Branch: Tag:

2003-04-02

2003-04-02 19:24:49 by Martin Nilsson <mani@lysator.liu.se>

We are not building tpike, so this is not needed.

Rev: src/Makefile.in:1.351
Rev: src/builtin_functions.c:1.482
Rev: src/builtin_functions_t.c:1.4(DEAD)
Rev: src/dummy_ci.h:1.7(DEAD)
Rev: src/las.c:1.335
Rev: src/las_t.c:1.4(DEAD)
Rev: src/module.c:1.23
Rev: src/module_t.c:1.4(DEAD)
Rev: src/peep.c:1.85
Rev: src/peep_t.c:1.4(DEAD)

2:   || This file is part of Pike. For copyright information see COPYRIGHT.   || Pike is distributed under GPL, LGPL and MPL. See the file COPYING   || for more information. - || $Id: las.c,v 1.334 2003/04/02 19:22:43 mast Exp $ + || $Id: las.c,v 1.335 2003/04/02 19:24:20 nilsson Exp $   */      #include "global.h" - RCSID("$Id: las.c,v 1.334 2003/04/02 19:22:43 mast Exp $"); + RCSID("$Id: las.c,v 1.335 2003/04/02 19:24:20 nilsson Exp $");      #include "language.h"   #include "interpret.h"
4412:    n->parent = parent;   }    - #if defined(SHARED_NODES) && !defined(IN_TPIKE) + #if defined(SHARED_NODES)   /* FIXME: Ought to use parent pointer to avoid recursion. */   static void find_usage(node *n, unsigned char *usage,    unsigned char *switch_u,
5124: Inside #if defined(SHARED_NODES) && !defined(IN_TPIKE)
   free_node(n);    return n2;   } - #endif /* SHARED_NODES && !IN_TPIKE */ + #endif /* SHARED_NODES */      static void optimize(node *n)   { - #ifndef IN_TPIKE +     node *tmp1, *tmp2, *tmp3; - #endif /* !IN_TPIKE */ +     struct pike_string *save_file = lex.current_file;    INT32 save_line = lex.current_line;   
5153: Inside #if defined(SHARED_NODES)
     #if defined(SHARED_NODES)    if ((n->node_info & OPT_DEFROSTED) && (n->parent)) { - #ifndef IN_TPIKE +     /* Add ref since both freeze_node() and use_tmp1 will free it. */    ADD_NODE_REF(n);    /* We don't want freeze_node() to find this node in the hash-table. */
5166: Inside #if defined(SHARED_NODES) and #if undefined(IN_TPIKE)
   }    /* Remove the extra ref from n */    free_node(n); - #endif /* !IN_TPIKE */ +     n->node_info &= ~OPT_DEFROSTED;    if (n->node_info & OPT_OPTIMIZED) {    /* No need to check this node any more. */
5174: Inside #if defined(SHARED_NODES)
   continue;    }    } - #endif /* SHARED_NODES && !IN_TPIKE */ + #endif /* SHARED_NODES */       lex.current_line = n->line_number;    lex.current_file = n->current_file;
5273:    }   #endif    - #ifndef IN_TPIKE +     switch(n->token)    {   #include "treeopt.h"
5338:    continue;       } - #endif /* !IN_TPIKE */ +     n->node_info |= OPT_OPTIMIZED;    n=n->parent;    }while(n);
5711:    }   #endif    }else{ - #if defined(SHARED_NODES) && !defined(IN_TPIKE) && 0 + #if defined(SHARED_NODES) && 0    /* Try the local variable usage analyser. */    n = localopt(check_node_hash(n));    /* Try optimizing some more. */    optimize(n); - #endif /* SHARED_NODES && !IN_TPIKE */ + #endif /* SHARED_NODES && 0 */    n = mknode(F_ARG_LIST,check_node_hash(n),0);       if((foo=is_stupid_func(check_node_hash(n), args, vargs, type)))