pike.git/ src/ las.c

2001-03-20

2001-03-20 00:25:02 by Henrik Grubbström (Grubba) <grubba@grubba.org>

• 226e1a0eb2b1493b12369c4a7fe65bf62d8a2234 (25 lines) (+24/-1) ^{[ Show | Annotate ]}
  Branch: 7.9

Added depend2_p, which takes an lvalue as the second argument.

Rev: src/las.c:1.247

5:   \*/   /**/   #include "global.h" - RCSID("$Id: las.c,v 1.246 2001/03/17 06:25:58 hubbe Exp $"); + RCSID("$Id: las.c,v 1.247 2001/03/20 00:25:02 grubba Exp $");      #include "language.h"   #include "interpret.h"
2381:    low_print_tree(_CDR(foo),0);    return;    +  case F_LOOP: +  fprintf(stderr, "loop("); +  if(car_is_node(foo)) low_print_tree(_CAR(foo),0); +  fprintf(stderr, ",{"); +  if(cdr_is_node(foo)) low_print_tree(_CDR(foo),0); +  fprintf(stderr, "})"); +  return; +     default:    if(!car_is_node(foo) && !cdr_is_node(foo))    {
2996:   #define depend_p depend_p3   #endif    + /* Check if n depends on the lvalue lval */ + static int depend2_p(node *n, node *lval) + { +  node *tmp; +  int ret; +  +  /* Make a temporary node (lval = 0), so that we can use depend_p(). */ +  ADD_NODE_REF2(lval, +  tmp = mknode(F_ASSIGN, mkintnode(0), lval)); +  ret = depend_p(n, tmp); +  free_node(tmp); +  return ret; + } +    /* FIXME: Ought to use parent pointer to avoid recursion. */   static int cntargs(node *n)   {