Branch: Tag:

2003-04-02

2003-04-02 19:22:44 by Martin Stjernholm <mast@lysator.liu.se>

Extended all integer argument types shorter than int to int since that's
more efficient.

Rev: src/constants.c:1.47
Rev: src/constants.h:1.30
Rev: src/docode.c:1.164
Rev: src/docode.h:1.18
Rev: src/dynamic_buffer.c:1.23
Rev: src/dynamic_buffer.h:1.18
Rev: src/encode.c:1.171
Rev: src/gc.c:1.216
Rev: src/global.h:1.85
Rev: src/las.c:1.334
Rev: src/las.h:1.62
Rev: src/multiset.c:1.71
Rev: src/pike_memory.c:1.145
Rev: src/pike_memory.h:1.44
Rev: src/pike_search.c:1.14
Rev: src/pike_search.h:1.7
Rev: src/pike_types.c:1.214
Rev: src/pike_types.h:1.86
Rev: src/port.h:1.50
Rev: src/program.c:1.497
Rev: src/program.h:1.181
Rev: src/program_areas.h:1.13
Rev: src/rbtree.h:1.10
Rev: src/svalue.h:1.118

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: docode.c,v 1.163 2003/02/24 21:00:44 mast Exp $ + || $Id: docode.c,v 1.164 2003/04/02 19:22:42 mast Exp $   */      #include "global.h" - RCSID("$Id: docode.c,v 1.163 2003/02/24 21:00:44 mast Exp $"); + RCSID("$Id: docode.c,v 1.164 2003/04/02 19:22:42 mast Exp $");   #include "las.h"   #include "program.h"   #include "pike_types.h"
30:   #include "mapping.h"   #include "multiset.h"    - static int do_docode2(node *n, INT16 flags); + static int do_docode2(node *n, int flags);      typedef void (*cleanup_func)(void *);   
284:      #define DO_CODE_BLOCK(X) do_pop(do_docode((X),DO_NOT_COPY | DO_POP ))    - int do_docode(node *n, INT16 flags) + int do_docode(node *n, int flags)   {    int i;    int stack_depth_save = current_stack_depth;
308:    n->u.sval.u.efun->function == fun;   }    - static void code_expression(node *n, INT16 flags, char *err) + static void code_expression(node *n, int flags, char *err)   { -  switch(do_docode(check_node_hash(n), (INT16)(flags & ~DO_POP))) +  switch(do_docode(check_node_hash(n), flags & ~DO_POP))    {    case 0: my_yyerror("Void expression for %s",err);    case 1: return;
362:    return;    }    -  code_expression(n, (INT16)(flags | DO_NOT_COPY), "condition"); +  code_expression(n, flags | DO_NOT_COPY, "condition");       if(flags & DO_POP)    {
537:   }      static int do_encode_automap_arg_list(node *n, -  INT16 flags) +  int flags)   {    int stack_depth_save = current_stack_depth;    if(!n) return 0;
596:    free_node(n);   }    - static int do_docode2(node *n, INT16 flags) + static int do_docode2(node *n, int flags)   {    ptrdiff_t tmp1,tmp2,tmp3;   
1569:    n = CAR(n);    }    /* CAR(n) is not F_ARG_LIST or F_COMMA_EXPR */ -  tmp1 += do_docode(CAR(n), (INT16)(flags & ~WANT_LVALUE)); +  tmp1 += do_docode(CAR(n), flags & ~WANT_LVALUE);       do {    if (CDR(n)) {
1584:    }    /* CDR(n) is not F_ARG_LIST or F_COMMA_EXPR */    if (n->parent) { -  tmp1 += do_docode(CDR(n), (INT16)(flags & ~WANT_LVALUE)); +  tmp1 += do_docode(CDR(n), flags & ~WANT_LVALUE);    } else {    tmp1 += do_docode(CDR(n), flags);    }
2003:    {    int mklval=CAR(n) && match_types(CAR(n)->type, string_type_string);    tmp1 = do_docode(CAR(n), -  (INT16)(mklval ? DO_LVALUE_IF_POSSIBLE : 0)); +  mklval ? DO_LVALUE_IF_POSSIBLE : 0);    if(tmp1==2)    {   #ifdef PIKE_DEBUG
2226:       case F_VAL_LVAL:    return do_docode(CAR(n),flags) + -  do_docode(CDR(n), (INT16)(flags | DO_LVALUE)); +  do_docode(CDR(n), flags | DO_LVALUE);       case F_AUTO_MAP:    emit0(F_MARK);