pike.git / src / las.c

version» Context lines:

pike.git/src/las.c:34:      /* Define this if you want the optimizer to be paranoid about aliasing    * effects to to indexing.    */   /* #define PARANOID_INDEXING */      /* #define NEW_ARG_CHECK */      static node *eval(node *);   static void optimize(node *n); - static node *localopt(node *n); +       int cumulative_parse_error=0;   extern char *get_type_name(int);      #define MAX_GLOBAL 2048      /* #define yywarning my_yyerror */      int car_is_node(node *n)   {
pike.git/src/las.c:4426:    break;    }   #ifdef PIKE_DEBUG    if (n != orig_n) {    Pike_fatal("zzap_try_optimize() lost track of parent.\n");    }   #endif /* PIKE_DEBUG */    n->parent = parent;   }    - #if defined(SHARED_NODES) + #if defined(SHARED_NODES) && 0   /* FIXME: Ought to use parent pointer to avoid recursion. */   static void find_usage(node *n, unsigned char *usage,    unsigned char *switch_u,    const unsigned char *cont_u,    const unsigned char *break_u,    const unsigned char *catch_u)   {    if (!n)    return;   
pike.git/src/las.c:5139: Inside #if defined(SHARED_NODES) and #if defined(PIKE_DEBUG)
      fputs("After localopt: ", stderr);    print_tree(n2);    }    }   #endif /* PIKE_DEBUG */       free_node(n);    return n2;   } - #endif /* SHARED_NODES */ + #endif /* SHARED_NODES && 0 */      static void optimize(node *n)   {    node *tmp1, *tmp2, *tmp3;    struct compilation *c = THIS_COMPILATION;    struct pike_string *save_file =    dmalloc_touch(struct pike_string *, c->lex.current_file);    INT_TYPE save_line = c->lex.current_line;       do