Branch: Tag:

2000-04-18

2000-04-18 17:23:35 by Fredrik Hübinette (Hubbe) <hubbe@hubbe.net>

some preparations for machine code compiling (possibly JIT)

Rev: src/Makefile.in:1.188
Rev: src/interpret_functions.h:1.1
Rev: src/interpreter.h:1.38
Rev: src/lex.c:1.68
Rev: src/lex.h:1.14
Rev: src/peep.c:1.29

129:       CASE(F_LDA); accumulator=GET_ARG(); break;    -  /* Push number */ -  CASE(F_UNDEFINED); push_int(0); Pike_sp[-1].subtype=NUMBER_UNDEFINED; break; -  CASE(F_CONST0); push_int(0); break; -  CASE(F_CONST1); push_int(1); break; -  CASE(F_CONST_1); push_int(-1); break; -  CASE(F_BIGNUM); push_int(0x7fffffff); break; -  CASE(F_NUMBER); push_int(GET_ARG()); break; -  CASE(F_NEG_NUMBER); push_int(-GET_ARG()); break; +     -  /* The rest of the basic 'push value' instructions */ + #define INTERPRETER    -  CASE(F_MARK_AND_STRING); *(Pike_mark_sp++)=Pike_sp; -  CASE(F_STRING); -  copy_shared_string(Pike_sp->u.string,Pike_fp->context.prog->strings[GET_ARG()]); -  Pike_sp->type=PIKE_T_STRING; -  Pike_sp->subtype=0; -  Pike_sp++; -  print_return_value(); -  break; + #define OPCODE0(OP,DESC) CASE(OP); { + #define OPCODE1(OP,DESC) CASE(OP); { \ +  INT32 arg1=GET_ARG();    -  CASE(F_ARROW_STRING); -  copy_shared_string(Pike_sp->u.string,Pike_fp->context.prog->strings[GET_ARG()]); -  Pike_sp->type=PIKE_T_STRING; -  Pike_sp->subtype=1; /* Magic */ -  Pike_sp++; -  print_return_value(); -  break; + #define OPCODE2(OP,DESC) CASE(OP); { \ +  INT32 arg1=GET_ARG(); \ +  INT32 arg2=accumulator;    -  CASE(F_CONSTANT); -  assign_svalue_no_free(Pike_sp++,& Pike_fp->context.prog->constants[GET_ARG()].sval); -  print_return_value(); -  break; + #define OPCODE0_TAIL(OP,DESC) CASE(OP); + #define OPCODE1_TAIL(OP,DESC) CASE(OP); + #define OPCODE2_TAIL(OP,DESC) CASE(OP);    -  CASE(F_FLOAT); -  Pike_sp->type=PIKE_T_FLOAT; -  MEMCPY((void *)&Pike_sp->u.float_number, pc, sizeof(FLOAT_TYPE)); -  pc+=sizeof(FLOAT_TYPE); -  Pike_sp++; -  break; +     -  CASE(F_LFUN); -  Pike_sp->u.object=Pike_fp->current_object; -  add_ref(Pike_fp->current_object); -  Pike_sp->subtype=GET_ARG()+Pike_fp->context.identifier_level; -  Pike_sp->type=PIKE_T_FUNCTION; -  Pike_sp++; -  print_return_value(); -  break; + #define BREAK break; }    -  CASE(F_TRAMPOLINE); -  { -  struct object *o=low_clone(pike_trampoline_program); -  add_ref( ((struct pike_trampoline *)(o->storage))->frame=Pike_fp ); -  ((struct pike_trampoline *)(o->storage))->func=GET_ARG()+Pike_fp->context.identifier_level; -  push_object(o); -  /* Make it look like a function. */ -  Pike_sp[-1].subtype = pike_trampoline_program->lfuns[LFUN_CALL]; -  Pike_sp[-1].type = T_FUNCTION; -  print_return_value(); -  break; -  } + #include "interpret_functions.h"    -  -  /* The not so basic 'push value' instructions */ -  CASE(F_GLOBAL); -  { -  low_object_index_no_free(Pike_sp, -  Pike_fp->current_object, -  GET_ARG() + Pike_fp->context.identifier_level); -  Pike_sp++; -  print_return_value(); -  } -  break; -  -  CASE(F_EXTERNAL); -  { -  struct inherit *inherit; -  struct program *p; -  struct object *o; -  INT32 i,id=GET_ARG(); -  -  inherit=&Pike_fp->context; -  -  o=Pike_fp->current_object; -  -  if(!o) -  error("Current object is destructed\n"); -  -  while(1) -  { -  if(inherit->parent_offset) -  { - #ifdef PIKE_DEBUG -  if(t_flag>4) -  { -  sprintf(trace_buffer,"- Following o->parent (accumulator+=%d)\n",inherit->parent_offset-1); -  write_to_stderr(trace_buffer,strlen(trace_buffer)); -  } - #endif -  -  i=o->parent_identifier; -  o=o->parent; -  accumulator+=inherit->parent_offset-1; -  }else{ - #ifdef PIKE_DEBUG -  if(t_flag>4) -  { -  sprintf(trace_buffer,"- Following inherit->parent (accumulator+=%d)\n",inherit->parent_offset-1); -  write_to_stderr(trace_buffer,strlen(trace_buffer)); -  } - #endif -  i=inherit->parent_identifier; -  o=inherit->parent; -  } -  -  if(!o) -  error("Parent was lost during cloning.\n"); -  -  if(!(p=o->prog)) -  error("Attempting to access variable in destructed object\n"); -  - #ifdef DEBUG_MALLOC -  if (o->refs == 0x55555555) { -  fprintf(stderr, "The object %p has been zapped!\n", o); -  describe(p); -  fatal("Object zapping detected.\n"); -  } -  if (p->refs == 0x55555555) { -  fprintf(stderr, "The program %p has been zapped!\n", p); -  describe(p); -  fprintf(stderr, "Which taken from the object %p\n", o); -  describe(o); -  fatal("Looks like the program %p has been zapped!\n", p); -  } - #endif /* DEBUG_MALLOC */ -  - #ifdef PIKE_DEBUG -  if(i < 0 || i > p->num_identifier_references) -  fatal("Identifier out of range!\n"); - #endif -  -  -  inherit=INHERIT_FROM_INT(p, i); -  - #ifdef DEBUG_MALLOC -  if (inherit->storage_offset == 0x55555555) { -  fprintf(stderr, "The inherit %p has been zapped!\n", inherit); -  debug_malloc_dump_references(inherit,0,2,0); -  fprintf(stderr, "It was extracted from the program %p %d\n", p, i); -  describe(p); -  fprintf(stderr, "Which was in turn taken from the object %p\n", o); -  describe(o); -  fatal("Looks like the program %p has been zapped!\n", p); -  } - #endif /* DEBUG_MALLOC */ -  -  if(!accumulator) break; -  --accumulator; -  } -  -  low_object_index_no_free(Pike_sp, -  o, -  id + inherit->identifier_level); -  Pike_sp++; -  print_return_value(); -  break; -  } -  -  CASE(F_EXTERNAL_LVALUE); -  { -  struct inherit *inherit; -  struct program *p; -  struct object *o; -  INT32 i,id=GET_ARG(); -  -  inherit=&Pike_fp->context; -  o=Pike_fp->current_object; -  -  if(!o) -  error("Current object is destructed\n"); -  -  while(1) -  { -  if(inherit->parent_offset) -  { -  i=o->parent_identifier; -  o=o->parent; -  accumulator+=inherit->parent_offset-1; -  }else{ -  i=inherit->parent_identifier; -  o=inherit->parent; -  } -  -  if(!o) -  error("Parent no longer exists\n"); -  -  if(!(p=o->prog)) -  error("Attempting to access variable in destructed object\n"); -  -  inherit=INHERIT_FROM_INT(p, i); -  -  if(!accumulator) break; -  accumulator--; -  } -  -  ref_push_object(o); -  Pike_sp->type=T_LVALUE; -  Pike_sp->u.integer=id + inherit->identifier_level; -  Pike_sp++; -  break; -  } -  -  -  CASE(F_MARK_AND_LOCAL); *(Pike_mark_sp++)=Pike_sp; -  CASE(F_LOCAL); -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+GET_ARG()); -  print_return_value(); -  break; -  -  CASE(F_2_LOCALS); -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+GET_ARG()); -  print_return_value(); -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+GET_ARG2()); -  print_return_value(); -  break; -  -  CASE(F_LOCAL_2_LOCAL); -  { -  int tmp=GET_ARG(); -  assign_svalue(Pike_fp->locals+tmp, Pike_fp->locals+GET_ARG2()); -  break; -  } -  -  CASE(F_LOCAL_2_GLOBAL); -  { -  INT32 tmp=GET_ARG() + Pike_fp->context.identifier_level; -  struct identifier *i; -  -  if(!Pike_fp->current_object->prog) -  error("Cannot access global variables in destructed object.\n"); -  -  i=ID_FROM_INT(Pike_fp->current_object->prog, tmp); -  if(!IDENTIFIER_IS_VARIABLE(i->identifier_flags)) -  error("Cannot assign functions or constants.\n"); -  if(i->run_time_type == T_MIXED) -  { -  assign_svalue((struct svalue *)GLOBAL_FROM_INT(tmp), Pike_fp->locals + GET_ARG2()); -  }else{ -  assign_to_short_svalue((union anything *)GLOBAL_FROM_INT(tmp), -  i->run_time_type, -  Pike_fp->locals + GET_ARG2()); -  } -  break; -  } -  -  CASE(F_GLOBAL_2_LOCAL); -  { -  INT32 tmp=GET_ARG() + Pike_fp->context.identifier_level; -  INT32 tmp2=GET_ARG2(); -  free_svalue(Pike_fp->locals + tmp2); -  low_object_index_no_free(Pike_fp->locals + tmp2, -  Pike_fp->current_object, -  tmp); -  break; -  } -  -  CASE(F_LOCAL_LVALUE); -  Pike_sp[0].type=T_LVALUE; -  Pike_sp[0].u.lval=Pike_fp->locals+GET_ARG(); -  Pike_sp[1].type=T_VOID; -  Pike_sp+=2; -  break; -  -  CASE(F_LEXICAL_LOCAL); -  { -  struct pike_frame *f=Pike_fp; -  while(accumulator--) -  { -  f=f->scope; -  if(!f) error("Lexical scope error.\n"); -  } -  push_svalue(f->locals + GET_ARG()); -  print_return_value(); -  break; -  } -  -  CASE(F_LEXICAL_LOCAL_LVALUE); -  { -  struct pike_frame *f=Pike_fp; -  while(accumulator--) -  { -  f=f->scope; -  if(!f) error("Lexical scope error.\n"); -  } -  Pike_sp[0].type=T_LVALUE; -  Pike_sp[0].u.lval=f->locals+GET_ARG(); -  Pike_sp[1].type=T_VOID; -  Pike_sp+=2; -  break; -  } -  -  CASE(F_ARRAY_LVALUE); -  f_aggregate(GET_ARG()*2); -  Pike_sp[-1].u.array->flags |= ARRAY_LVALUE; -  Pike_sp[-1].u.array->type_field |= BIT_UNFINISHED | BIT_MIXED; -  Pike_sp[0]=Pike_sp[-1]; -  Pike_sp[-1].type=T_ARRAY_LVALUE; -  Pike_sp++; -  break; -  -  CASE(F_CLEAR_2_LOCAL); -  instr=GET_ARG(); -  free_svalues(Pike_fp->locals + instr, 2, -1); -  Pike_fp->locals[instr].type=PIKE_T_INT; -  Pike_fp->locals[instr].subtype=0; -  Pike_fp->locals[instr].u.integer=0; -  Pike_fp->locals[instr+1].type=PIKE_T_INT; -  Pike_fp->locals[instr+1].subtype=0; -  Pike_fp->locals[instr+1].u.integer=0; -  break; -  -  CASE(F_CLEAR_4_LOCAL); -  { -  int e; -  instr=GET_ARG(); -  free_svalues(Pike_fp->locals + instr, 4, -1); -  for(e=0;e<4;e++) -  { -  Pike_fp->locals[instr+e].type=PIKE_T_INT; -  Pike_fp->locals[instr+e].subtype=0; -  Pike_fp->locals[instr+e].u.integer=0; -  } -  break; -  } -  -  CASE(F_CLEAR_LOCAL); -  instr=GET_ARG(); -  free_svalue(Pike_fp->locals + instr); -  Pike_fp->locals[instr].type=PIKE_T_INT; -  Pike_fp->locals[instr].subtype=0; -  Pike_fp->locals[instr].u.integer=0; -  break; -  -  CASE(F_INC_LOCAL); -  instr=GET_ARG(); - #ifdef AUTO_BIGNUM -  if(Pike_fp->locals[instr].type == PIKE_T_INT && -  !INT_TYPE_ADD_OVERFLOW(Pike_fp->locals[instr].u.integer, 1)) - #else -  if(Pike_fp->locals[instr].type == PIKE_T_INT) - #endif /* AUTO_BIGNUM */ -  { -  Pike_fp->locals[instr].u.integer++; -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  } -  else -  { -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  push_int(1); -  f_add(2); -  assign_svalue(Pike_fp->locals+instr,Pike_sp-1); -  } -  break; -  -  CASE(F_POST_INC_LOCAL); -  instr=GET_ARG(); -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  goto inc_local_and_pop; -  -  CASE(F_INC_LOCAL_AND_POP); -  instr=GET_ARG(); -  inc_local_and_pop: - #ifdef AUTO_BIGNUM -  if(Pike_fp->locals[instr].type == PIKE_T_INT && -  !INT_TYPE_ADD_OVERFLOW(Pike_fp->locals[instr].u.integer, 1)) - #else -  if(Pike_fp->locals[instr].type == PIKE_T_INT) - #endif /* AUTO_BIGNUM */ -  { -  Pike_fp->locals[instr].u.integer++; -  }else{ -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  push_int(1); -  f_add(2); -  assign_svalue(Pike_fp->locals+instr,Pike_sp-1); -  pop_stack(); -  } -  break; -  -  CASE(F_DEC_LOCAL); -  instr=GET_ARG(); - #ifdef AUTO_BIGNUM -  if(Pike_fp->locals[instr].type == PIKE_T_INT && -  !INT_TYPE_SUB_OVERFLOW(Pike_fp->locals[instr].u.integer, 1)) - #else -  if(Pike_fp->locals[instr].type == PIKE_T_INT) - #endif /* AUTO_BIGNUM */ -  { -  Pike_fp->locals[instr].u.integer--; -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  }else{ -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  push_int(1); -  o_subtract(); -  assign_svalue(Pike_fp->locals+instr,Pike_sp-1); -  } -  break; -  -  CASE(F_POST_DEC_LOCAL); -  instr=GET_ARG(); -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  goto dec_local_and_pop; -  /* Pike_fp->locals[instr].u.integer--; */ -  break; -  -  CASE(F_DEC_LOCAL_AND_POP); -  instr=GET_ARG(); -  dec_local_and_pop: - #ifdef AUTO_BIGNUM -  if(Pike_fp->locals[instr].type == PIKE_T_INT && -  !INT_TYPE_SUB_OVERFLOW(Pike_fp->locals[instr].u.integer, 1)) - #else -  if(Pike_fp->locals[instr].type == PIKE_T_INT) - #endif /* AUTO_BIGNUM */ -  { -  Pike_fp->locals[instr].u.integer--; -  }else{ -  assign_svalue_no_free(Pike_sp++,Pike_fp->locals+instr); -  push_int(1); -  o_subtract(); -  assign_svalue(Pike_fp->locals+instr,Pike_sp-1); -  pop_stack(); -  } -  break; -  -  CASE(F_LTOSVAL); -  lvalue_to_svalue_no_free(Pike_sp,Pike_sp-2); -  Pike_sp++; -  break; -  -  CASE(F_LTOSVAL2); -  Pike_sp[0]=Pike_sp[-1]; -  Pike_sp[-1].type=PIKE_T_INT; -  Pike_sp++; -  lvalue_to_svalue_no_free(Pike_sp-2,Pike_sp-4); -  -  /* this is so that foo+=bar (and similar things) will be faster, this -  * is done by freeing the old reference to foo after it has been pushed -  * on the stack. That way foo can have only 1 reference if we are lucky, -  * and then the low array/multiset/mapping manipulation routines can be -  * destructive if they like -  */ -  if( (1 << Pike_sp[-2].type) & ( BIT_ARRAY | BIT_MULTISET | BIT_MAPPING | BIT_STRING )) -  { -  struct svalue s; -  s.type=PIKE_T_INT; -  s.subtype=0; -  s.u.integer=0; -  assign_lvalue(Pike_sp-4,&s); -  } -  break; -  -  -  CASE(F_ADD_TO_AND_POP); -  Pike_sp[0]=Pike_sp[-1]; -  Pike_sp[-1].type=PIKE_T_INT; -  Pike_sp++; -  lvalue_to_svalue_no_free(Pike_sp-2,Pike_sp-4); -  -  /* this is so that foo+=bar (and similar things) will be faster, this -  * is done by freeing the old reference to foo after it has been pushed -  * on the stack. That way foo can have only 1 reference if we are lucky, -  * and then the low array/multiset/mapping manipulation routines can be -  * destructive if they like -  */ -  if( (1 << Pike_sp[-2].type) & ( BIT_ARRAY | BIT_MULTISET | BIT_MAPPING | BIT_STRING )) -  { -  struct svalue s; -  s.type=PIKE_T_INT; -  s.subtype=0; -  s.u.integer=0; -  assign_lvalue(Pike_sp-4,&s); -  } -  f_add(2); -  assign_lvalue(Pike_sp-3,Pike_sp-1); -  pop_n_elems(3); -  break; -  -  CASE(F_GLOBAL_LVALUE); -  { -  struct identifier *i; -  INT32 tmp=GET_ARG() + Pike_fp->context.identifier_level; -  -  if(!Pike_fp->current_object->prog) -  error("Cannot access global variables in destructed object.\n"); -  -  i=ID_FROM_INT(Pike_fp->current_object->prog, tmp); -  -  if(!IDENTIFIER_IS_VARIABLE(i->identifier_flags)) -  error("Cannot re-assign functions or constants.\n"); -  -  if(i->run_time_type == T_MIXED) -  { -  Pike_sp[0].type=T_LVALUE; -  Pike_sp[0].u.lval=(struct svalue *)GLOBAL_FROM_INT(tmp); -  }else{ -  Pike_sp[0].type=T_SHORT_LVALUE; -  Pike_sp[0].u.short_lval= (union anything *)GLOBAL_FROM_INT(tmp); -  Pike_sp[0].subtype=i->run_time_type; -  } -  Pike_sp[1].type=T_VOID; -  Pike_sp+=2; -  break; -  } -  -  CASE(F_INC); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_ADD_OVERFLOW(u->integer, 1) - #endif -  ) -  { -  instr=++ u->integer; -  pop_n_elems(2); -  push_int(u->integer); -  break; -  } -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  push_int(1); -  f_add(2); -  assign_lvalue(Pike_sp-3, Pike_sp-1); -  assign_svalue(Pike_sp-3, Pike_sp-1); -  pop_n_elems(2); -  break; -  } -  -  CASE(F_DEC); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_SUB_OVERFLOW(u->integer, 1) - #endif -  ) -  { -  instr=-- u->integer; -  pop_n_elems(2); -  push_int(u->integer); -  break; -  } -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  push_int(1); -  o_subtract(); -  assign_lvalue(Pike_sp-3, Pike_sp-1); -  assign_svalue(Pike_sp-3, Pike_sp-1); -  pop_n_elems(2); -  break; -  } -  -  CASE(F_DEC_AND_POP); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_SUB_OVERFLOW(u->integer, 1) - #endif - ) -  { -  instr=-- u->integer; -  pop_n_elems(2); -  }else{ -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  push_int(1); -  o_subtract(); -  assign_lvalue(Pike_sp-3, Pike_sp-1); -  pop_n_elems(3); -  } -  break; -  } -  -  CASE(F_INC_AND_POP); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_ADD_OVERFLOW(u->integer, 1) - #endif -  ) -  { -  instr=++ u->integer; -  pop_n_elems(2); -  break; -  } -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  push_int(1); -  f_add(2); -  assign_lvalue(Pike_sp-3, Pike_sp-1); -  pop_n_elems(3); -  break; -  } -  -  CASE(F_POST_INC); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_ADD_OVERFLOW(u->integer, 1) - #endif -  ) -  { -  instr=u->integer ++; -  pop_n_elems(2); -  push_int(instr); -  break; -  } -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  assign_svalue_no_free(Pike_sp,Pike_sp-1); Pike_sp++; -  push_int(1); -  f_add(2); -  assign_lvalue(Pike_sp-4, Pike_sp-1); -  assign_svalue(Pike_sp-4, Pike_sp-2); -  pop_n_elems(3); -  break; -  } -  -  CASE(F_POST_DEC); -  { -  union anything *u=get_pointer_if_this_type(Pike_sp-2, PIKE_T_INT); -  if(u - #ifdef AUTO_BIGNUM -  && !INT_TYPE_SUB_OVERFLOW(u->integer, 1) - #endif -  ) -  { -  instr=u->integer --; -  pop_n_elems(2); -  push_int(instr); -  break; -  } -  lvalue_to_svalue_no_free(Pike_sp, Pike_sp-2); Pike_sp++; -  assign_svalue_no_free(Pike_sp,Pike_sp-1); Pike_sp++; -  push_int(1); -  o_subtract(); -  assign_lvalue(Pike_sp-4, Pike_sp-1); -  assign_svalue(Pike_sp-4, Pike_sp-2); -  pop_n_elems(3); -  break; -  } -  -  CASE(F_ASSIGN); -  assign_lvalue(Pike_sp-3,Pike_sp-1); -  free_svalue(Pike_sp-3); -  free_svalue(Pike_sp-2); -  Pike_sp[-3]=Pike_sp[-1]; -  Pike_sp-=2; -  break; -  -  CASE(F_ASSIGN_AND_POP); -  assign_lvalue(Pike_sp-3,Pike_sp-1); -  pop_n_elems(3); -  break; -  -  CASE(F_APPLY_ASSIGN_LOCAL); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), Pike_sp - *--Pike_mark_sp ); -  /* Fall through */ -  -  CASE(F_ASSIGN_LOCAL); -  assign_svalue(Pike_fp->locals+GET_ARG(),Pike_sp-1); -  break; -  -  CASE(F_APPLY_ASSIGN_LOCAL_AND_POP); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), Pike_sp - *--Pike_mark_sp ); -  /* Fall through */ -  -  CASE(F_ASSIGN_LOCAL_AND_POP); -  instr=GET_ARG(); -  free_svalue(Pike_fp->locals+instr); -  Pike_fp->locals[instr]=Pike_sp[-1]; -  Pike_sp--; -  break; -  -  CASE(F_ASSIGN_GLOBAL) -  { -  struct identifier *i; -  INT32 tmp=GET_ARG() + Pike_fp->context.identifier_level; -  if(!Pike_fp->current_object->prog) -  error("Cannot access global variables in destructed object.\n"); -  -  i=ID_FROM_INT(Pike_fp->current_object->prog, tmp); -  if(!IDENTIFIER_IS_VARIABLE(i->identifier_flags)) -  error("Cannot assign functions or constants.\n"); -  if(i->run_time_type == T_MIXED) -  { -  assign_svalue((struct svalue *)GLOBAL_FROM_INT(tmp), Pike_sp-1); -  }else{ -  assign_to_short_svalue((union anything *)GLOBAL_FROM_INT(tmp), -  i->run_time_type, -  Pike_sp-1); -  } -  } -  break; -  -  CASE(F_ASSIGN_GLOBAL_AND_POP) -  { -  struct identifier *i; -  INT32 tmp=GET_ARG() + Pike_fp->context.identifier_level; -  if(!Pike_fp->current_object->prog) -  error("Cannot access global variables in destructed object.\n"); -  -  i=ID_FROM_INT(Pike_fp->current_object->prog, tmp); -  if(!IDENTIFIER_IS_VARIABLE(i->identifier_flags)) -  error("Cannot assign functions or constants.\n"); -  -  if(i->run_time_type == T_MIXED) -  { -  struct svalue *s=(struct svalue *)GLOBAL_FROM_INT(tmp); -  free_svalue(s); -  Pike_sp--; -  *s=*Pike_sp; -  }else{ -  assign_to_short_svalue((union anything *)GLOBAL_FROM_INT(tmp), -  i->run_time_type, -  Pike_sp-1); -  pop_stack(); -  } -  } -  break; -  -  /* Stack machine stuff */ -  CASE(F_POP_VALUE); pop_stack(); break; -  CASE(F_POP_N_ELEMS); pop_n_elems(GET_ARG()); break; -  CASE(F_MARK2); *(Pike_mark_sp++)=Pike_sp; -  CASE(F_MARK); *(Pike_mark_sp++)=Pike_sp; break; -  CASE(F_MARK_X); *(Pike_mark_sp++)=Pike_sp-GET_ARG(); break; -  CASE(F_POP_MARK); --Pike_mark_sp; break; -  -  CASE(F_CLEAR_STRING_SUBTYPE); -  if(Pike_sp[-1].type==PIKE_T_STRING) Pike_sp[-1].subtype=0; -  break; -  -  /* Jumps */ -  CASE(F_BRANCH); -  DOJUMP(); -  break; -  -  CASE(F_BRANCH_IF_NOT_LOCAL_ARROW); -  { -  struct svalue tmp; -  tmp.type=PIKE_T_STRING; -  tmp.u.string=Pike_fp->context.prog->strings[GET_ARG()]; -  tmp.subtype=1; -  Pike_sp->type=PIKE_T_INT; -  Pike_sp++; -  index_no_free(Pike_sp-1,Pike_fp->locals+GET_ARG2() , &tmp); -  print_return_value(); -  } -  -  /* Fall through */ -  -  CASE(F_BRANCH_WHEN_ZERO); -  if(!IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  } -  pop_stack(); -  break; -  -  -  CASE(F_BRANCH_WHEN_NON_ZERO); -  if(IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  } -  pop_stack(); -  break; -  -  CASE(F_BRANCH_IF_LOCAL); -  instr=GET_ARG(); -  if(IS_ZERO(Pike_fp->locals + instr)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  } -  break; -  -  CASE(F_BRANCH_IF_NOT_LOCAL); -  instr=GET_ARG(); -  if(!IS_ZERO(Pike_fp->locals + instr)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  } -  break; -  -  CJUMP(F_BRANCH_WHEN_EQ, is_eq); -  CJUMP(F_BRANCH_WHEN_NE,!is_eq); -  CJUMP(F_BRANCH_WHEN_LT, is_lt); -  CJUMP(F_BRANCH_WHEN_LE,!is_gt); -  CJUMP(F_BRANCH_WHEN_GT, is_gt); -  CJUMP(F_BRANCH_WHEN_GE,!is_lt); -  -  CASE(F_BRANCH_AND_POP_WHEN_ZERO); -  if(!IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  pop_stack(); -  } -  break; -  -  CASE(F_BRANCH_AND_POP_WHEN_NON_ZERO); -  if(IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  }else{ -  DOJUMP(); -  pop_stack(); -  } -  break; -  -  CASE(F_LAND); -  if(!IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  pop_stack(); -  }else{ -  DOJUMP(); -  } -  break; -  -  CASE(F_LOR); -  if(IS_ZERO(Pike_sp-1)) -  { -  pc+=sizeof(INT32); -  pop_stack(); -  }else{ -  DOJUMP(); -  } -  break; -  -  CASE(F_EQ_OR); -  if(!is_eq(Pike_sp-2,Pike_sp-1)) -  { -  pop_n_elems(2); -  pc+=sizeof(INT32); -  }else{ -  pop_n_elems(2); -  push_int(1); -  DOJUMP(); -  } -  break; -  -  CASE(F_EQ_AND); -  if(is_eq(Pike_sp-2,Pike_sp-1)) -  { -  pop_n_elems(2); -  pc+=sizeof(INT32); -  }else{ -  pop_n_elems(2); -  push_int(0); -  DOJUMP(); -  } -  break; -  -  CASE(F_CATCH); -  if(o_catch(pc+sizeof(INT32))) -  return -1; /* There was a return inside the evaluated code */ -  else -  pc+=EXTRACT_INT(pc); -  break; -  -  CASE(F_THROW_ZERO); -  push_int(0); -  f_throw(1); -  break; -  -  CASE(F_SWITCH) -  { -  INT32 tmp; -  tmp=switch_lookup(Pike_fp->context.prog-> -  constants[GET_ARG()].sval.u.array,Pike_sp-1); -  pc=(unsigned char *)DO_ALIGN(pc,sizeof(INT32)); -  pc+=(tmp>=0 ? 1+tmp*2 : 2*~tmp) * sizeof(INT32); -  if(*(INT32*)pc < 0) fast_check_threads_etc(7); -  pc+=*(INT32*)pc; -  pop_stack(); -  break; -  } -  -  /* FIXME: Does this need bignum tests? /Fixed - Hubbe */ -  LOOP(F_INC_LOOP, 1, <, is_lt); -  LOOP(F_DEC_LOOP, -1, >, is_gt); -  LOOP(F_INC_NEQ_LOOP, 1, !=, !is_eq); -  LOOP(F_DEC_NEQ_LOOP, -1, !=, !is_eq); -  -  CASE(F_FOREACH) /* array, lvalue, X, i */ -  { -  if(Pike_sp[-4].type != PIKE_T_ARRAY) -  PIKE_ERROR("foreach", "Bad argument 1.\n", Pike_sp-3, 1); -  if(Pike_sp[-1].u.integer < Pike_sp[-4].u.array->size) -  { -  fast_check_threads_etc(10); -  index_no_free(Pike_sp,Pike_sp-4,Pike_sp-1); -  Pike_sp++; -  assign_lvalue(Pike_sp-4, Pike_sp-1); -  free_svalue(Pike_sp-1); -  Pike_sp--; -  pc+=EXTRACT_INT(pc); -  Pike_sp[-1].u.integer++; -  }else{ -  pc+=sizeof(INT32); -  } -  break; -  } -  -  CASE(F_APPLY_AND_RETURN); -  { -  INT32 args=Pike_sp - *--Pike_mark_sp; - /* fprintf(stderr,"%p >= %p\n",Pike_fp->expendible,Pike_sp-args); */ -  if(Pike_fp->expendible >= Pike_sp-args) -  { - /* fprintf(stderr,"NOT EXPENDIBLE!\n"); */ -  MEMMOVE(Pike_sp-args+1,Pike_sp-args,args*sizeof(struct svalue)); -  Pike_sp++; -  Pike_sp[-args-1].type=PIKE_T_INT; -  } -  /* We sabotage the stack here */ -  assign_svalue(Pike_sp-args-1,&Pike_fp->context.prog->constants[GET_ARG()].sval); -  return args+1; -  } -  -  CASE(F_CALL_LFUN_AND_RETURN); -  { -  INT32 args=Pike_sp - *--Pike_mark_sp; -  if(Pike_fp->expendible >= Pike_sp-args) -  { -  MEMMOVE(Pike_sp-args+1,Pike_sp-args,args*sizeof(struct svalue)); -  Pike_sp++; -  Pike_sp[-args-1].type=PIKE_T_INT; -  }else{ -  free_svalue(Pike_sp-args-1); -  } -  /* More stack sabotage */ -  Pike_sp[-args-1].u.object=Pike_fp->current_object; -  Pike_sp[-args-1].subtype=GET_ARG()+Pike_fp->context.identifier_level; - #ifdef PIKE_DEBUG -  if(t_flag > 9) -  fprintf(stderr,"- IDENTIFIER_LEVEL: %d\n",Pike_fp->context.identifier_level); - #endif -  Pike_sp[-args-1].type=PIKE_T_FUNCTION; -  add_ref(Pike_fp->current_object); -  -  return args+1; -  } -  -  CASE(F_RETURN_LOCAL); -  instr=GET_ARG(); -  if(Pike_fp->expendible <= Pike_fp->locals+instr) -  { -  pop_n_elems(Pike_sp-1 - (Pike_fp->locals+instr)); -  }else{ -  push_svalue(Pike_fp->locals+instr); -  } -  print_return_value(); -  goto do_return; -  -  CASE(F_RETURN_IF_TRUE); -  if(!IS_ZERO(Pike_sp-1)) -  goto do_return; -  pop_stack(); -  break; -  -  CASE(F_RETURN_1); -  push_int(1); -  goto do_return; -  -  CASE(F_RETURN_0); -  push_int(0); -  goto do_return; -  -  CASE(F_RETURN); -  do_return: - #if defined(PIKE_DEBUG) && defined(GC2) -  if(d_flag>3) do_gc(); -  if(d_flag>4) do_debug(); -  check_threads_etc(); - #endif -  -  /* fall through */ -  -  CASE(F_DUMB_RETURN); -  return -1; -  -  CASE(F_NEGATE); -  if(Pike_sp[-1].type == PIKE_T_INT) -  { - #ifdef AUTO_BIGNUM -  if(INT_TYPE_NEG_OVERFLOW(Pike_sp[-1].u.integer)) -  { -  convert_stack_top_to_bignum(); -  o_negate(); -  } -  else - #endif /* AUTO_BIGNUM */ -  Pike_sp[-1].u.integer =- Pike_sp[-1].u.integer; -  } -  else if(Pike_sp[-1].type == PIKE_T_FLOAT) -  { -  Pike_sp[-1].u.float_number =- Pike_sp[-1].u.float_number; -  }else{ -  o_negate(); -  } -  break; -  -  CASE(F_COMPL); o_compl(); break; -  -  CASE(F_NOT); -  switch(Pike_sp[-1].type) -  { -  case PIKE_T_INT: -  Pike_sp[-1].u.integer =! Pike_sp[-1].u.integer; -  break; -  -  case PIKE_T_FUNCTION: -  case PIKE_T_OBJECT: -  if(IS_ZERO(Pike_sp-1)) -  { -  pop_stack(); -  push_int(1); -  }else{ -  pop_stack(); -  push_int(0); -  } -  break; -  +     default: -  free_svalue(Pike_sp-1); -  Pike_sp[-1].type=PIKE_T_INT; -  Pike_sp[-1].u.integer=0; -  } -  break; -  -  CASE(F_LSH); o_lsh(); break; -  CASE(F_RSH); o_rsh(); break; -  -  COMPARISMENT(F_EQ, is_eq(Pike_sp-2,Pike_sp-1)); -  COMPARISMENT(F_NE,!is_eq(Pike_sp-2,Pike_sp-1)); -  COMPARISMENT(F_GT, is_gt(Pike_sp-2,Pike_sp-1)); -  COMPARISMENT(F_GE,!is_lt(Pike_sp-2,Pike_sp-1)); -  COMPARISMENT(F_LT, is_lt(Pike_sp-2,Pike_sp-1)); -  COMPARISMENT(F_LE,!is_gt(Pike_sp-2,Pike_sp-1)); -  -  CASE(F_ADD); f_add(2); break; -  CASE(F_SUBTRACT); o_subtract(); break; -  CASE(F_AND); o_and(); break; -  CASE(F_OR); o_or(); break; -  CASE(F_XOR); o_xor(); break; -  CASE(F_MULTIPLY); o_multiply(); break; -  CASE(F_DIVIDE); o_divide(); break; -  CASE(F_MOD); o_mod(); break; -  -  CASE(F_ADD_INT); push_int(GET_ARG()); f_add(2); break; -  CASE(F_ADD_NEG_INT); push_int(-GET_ARG()); f_add(2); break; -  -  CASE(F_PUSH_ARRAY); -  switch(Pike_sp[-1].type) -  { -  default: -  PIKE_ERROR("@", "Bad argument.\n", Pike_sp, 1); -  -  case PIKE_T_OBJECT: -  if(!Pike_sp[-1].u.object->prog || FIND_LFUN(Pike_sp[-1].u.object->prog,LFUN__VALUES) == -1) -  PIKE_ERROR("@", "Bad argument.\n", Pike_sp, 1); -  -  apply_lfun(Pike_sp[-1].u.object, LFUN__VALUES, 0); -  if(Pike_sp[-1].type != PIKE_T_ARRAY) -  error("Bad return type from o->_values() in @\n"); -  free_svalue(Pike_sp-2); -  Pike_sp[-2]=Pike_sp[-1]; -  Pike_sp--; -  break; -  -  case PIKE_T_ARRAY: break; -  } -  Pike_sp--; -  push_array_items(Pike_sp->u.array); -  break; -  -  CASE(F_LOCAL_LOCAL_INDEX); -  { -  struct svalue *s=Pike_fp->locals+GET_ARG(); -  if(s->type == PIKE_T_STRING) s->subtype=0; -  Pike_sp++->type=PIKE_T_INT; -  index_no_free(Pike_sp-1,Pike_fp->locals+GET_ARG2(),s); -  break; -  } -  -  CASE(F_LOCAL_INDEX); -  { -  struct svalue tmp,*s=Pike_fp->locals+GET_ARG(); -  if(s->type == PIKE_T_STRING) s->subtype=0; -  index_no_free(&tmp,Pike_sp-1,s); -  free_svalue(Pike_sp-1); -  Pike_sp[-1]=tmp; -  break; -  } -  -  CASE(F_GLOBAL_LOCAL_INDEX); -  { -  struct svalue tmp,*s; -  low_object_index_no_free(Pike_sp, -  Pike_fp->current_object, -  GET_ARG() + Pike_fp->context.identifier_level); -  Pike_sp++; -  s=Pike_fp->locals+GET_ARG2(); -  if(s->type == PIKE_T_STRING) s->subtype=0; -  index_no_free(&tmp,Pike_sp-1,s); -  free_svalue(Pike_sp-1); -  Pike_sp[-1]=tmp; -  break; -  } -  -  CASE(F_LOCAL_ARROW); -  { -  struct svalue tmp; -  tmp.type=PIKE_T_STRING; -  tmp.u.string=Pike_fp->context.prog->strings[GET_ARG()]; -  tmp.subtype=1; -  Pike_sp->type=PIKE_T_INT; -  Pike_sp++; -  index_no_free(Pike_sp-1,Pike_fp->locals+GET_ARG2() , &tmp); -  print_return_value(); -  break; -  } -  -  CASE(F_ARROW); -  { -  struct svalue tmp,tmp2; -  tmp.type=PIKE_T_STRING; -  tmp.u.string=Pike_fp->context.prog->strings[GET_ARG()]; -  tmp.subtype=1; -  index_no_free(&tmp2, Pike_sp-1, &tmp); -  free_svalue(Pike_sp-1); -  Pike_sp[-1]=tmp2; -  print_return_value(); -  break; -  } -  -  CASE(F_STRING_INDEX); -  { -  struct svalue tmp,tmp2; -  tmp.type=PIKE_T_STRING; -  tmp.u.string=Pike_fp->context.prog->strings[GET_ARG()]; -  tmp.subtype=0; -  index_no_free(&tmp2, Pike_sp-1, &tmp); -  free_svalue(Pike_sp-1); -  Pike_sp[-1]=tmp2; -  print_return_value(); -  break; -  } -  -  CASE(F_POS_INT_INDEX); -  push_int(GET_ARG()); -  print_return_value(); -  goto do_index; -  -  CASE(F_NEG_INT_INDEX); -  push_int(-GET_ARG()); -  print_return_value(); -  -  CASE(F_INDEX); -  do_index: -  { -  struct svalue s; -  index_no_free(&s,Pike_sp-2,Pike_sp-1); -  pop_n_elems(2); -  *Pike_sp=s; -  Pike_sp++; -  } -  print_return_value(); -  break; -  -  CASE(F_MAGIC_INDEX); -  push_magic_index(magic_index_program, accumulator, GET_ARG()); -  break; -  -  CASE(F_MAGIC_SET_INDEX); -  push_magic_index(magic_set_index_program, accumulator, GET_ARG()); -  break; -  -  CASE(F_CAST); f_cast(); break; -  -  CASE(F_SOFT_CAST); -  /* Stack: type_string, value */ - #ifdef PIKE_DEBUG -  if (Pike_sp[-2].type != T_STRING) { -  /* FIXME: The type should really be T_TYPE... */ -  fatal("Argument 1 to soft_cast isn't a string!\n"); -  } - #endif /* PIKE_DEBUG */ -  if (runtime_options & RUNTIME_CHECK_TYPES) { -  struct pike_string *sval_type = get_type_of_svalue(Pike_sp-1); -  if (!pike_types_le(sval_type, Pike_sp[-2].u.string)) { -  /* get_type_from_svalue() doesn't return a fully specified type -  * for array, mapping and multiset, so we perform a more lenient -  * check for them. -  */ -  if (!pike_types_le(sval_type, weak_type_string) || -  !match_types(sval_type, Pike_sp[-2].u.string)) { -  struct pike_string *t1; -  struct pike_string *t2; -  char *fname = "__soft-cast"; -  ONERROR tmp1; -  ONERROR tmp2; -  -  if (Pike_fp->current_object && Pike_fp->context.prog && -  Pike_fp->current_object->prog) { -  /* Look up the function-name */ -  struct pike_string *name = -  ID_FROM_INT(Pike_fp->current_object->prog, Pike_fp->fun)->name; -  if ((!name->size_shift) && (name->len < 100)) -  fname = name->str; -  } -  -  t1 = describe_type(Pike_sp[-2].u.string); -  SET_ONERROR(tmp1, do_free_string, t1); -  -  t2 = describe_type(sval_type); -  SET_ONERROR(tmp2, do_free_string, t2); -  -  free_string(sval_type); -  -  bad_arg_error(NULL, Pike_sp-1, 1, 1, t1->str, Pike_sp-1, -  "%s(): Soft cast failed. Expected %s, got %s\n", -  fname, t1->str, t2->str); -  /* NOT_REACHED */ -  UNSET_ONERROR(tmp2); -  UNSET_ONERROR(tmp1); -  free_string(t2); -  free_string(t1); -  } -  } -  free_string(sval_type); - #ifdef PIKE_DEBUG -  if (d_flag > 2) { -  struct pike_string *t = describe_type(Pike_sp[-2].u.string); -  fprintf(stderr, "Soft cast to %s\n", t->str); -  free_string(t); -  } - #endif /* PIKE_DEBUG */ -  } -  stack_swap(); -  pop_stack(); -  break; -  -  CASE(F_RANGE); o_range(); break; -  CASE(F_COPY_VALUE); -  { -  struct svalue tmp; -  copy_svalues_recursively_no_free(&tmp,Pike_sp-1,1,0); -  free_svalue(Pike_sp-1); -  Pike_sp[-1]=tmp; -  } -  break; -  -  CASE(F_INDIRECT); -  { -  struct svalue s; -  lvalue_to_svalue_no_free(&s,Pike_sp-2); -  if(s.type != PIKE_T_STRING) -  { -  pop_n_elems(2); -  *Pike_sp=s; -  Pike_sp++; -  }else{ -  struct object *o; -  o=low_clone(string_assignment_program); -  ((struct string_assignment_storage *)o->storage)->lval[0]=Pike_sp[-2]; -  ((struct string_assignment_storage *)o->storage)->lval[1]=Pike_sp[-1]; -  ((struct string_assignment_storage *)o->storage)->s=s.u.string; -  Pike_sp-=2; -  push_object(o); -  } -  } -  print_return_value(); -  break; -  -  -  CASE(F_SIZEOF); -  instr=pike_sizeof(Pike_sp-1); -  pop_stack(); -  push_int(instr); -  break; -  -  CASE(F_SIZEOF_LOCAL); -  push_int(pike_sizeof(Pike_fp->locals+GET_ARG())); -  break; -  -  CASE(F_SSCANF); o_sscanf(GET_ARG()); break; -  -  CASE(F_CALL_LFUN); -  apply_low(Pike_fp->current_object, -  GET_ARG()+Pike_fp->context.identifier_level, -  Pike_sp - *--Pike_mark_sp); -  break; -  -  CASE(F_CALL_LFUN_AND_POP); -  apply_low(Pike_fp->current_object, -  GET_ARG()+Pike_fp->context.identifier_level, -  Pike_sp - *--Pike_mark_sp); -  pop_stack(); -  break; -  -  CASE(F_MARK_APPLY); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), 0); -  break; -  -  CASE(F_MARK_APPLY_POP); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), 0); -  pop_stack(); -  break; -  -  CASE(F_APPLY); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), Pike_sp - *--Pike_mark_sp ); -  break; -  -  CASE(F_APPLY_AND_POP); -  strict_apply_svalue(Pike_fp->context.prog->constants + GET_ARG(), Pike_sp - *--Pike_mark_sp ); -  pop_stack(); -  break; -  -  CASE(F_CALL_FUNCTION); -  mega_apply(APPLY_STACK,Pike_sp - *--Pike_mark_sp,0,0); -  break; -  -  CASE(F_CALL_FUNCTION_AND_RETURN); -  { -  INT32 args=Pike_sp - *--Pike_mark_sp; -  if(!args) -  PIKE_ERROR("`()", "Too few arguments.\n", Pike_sp, 0); -  switch(Pike_sp[-args].type) -  { -  case PIKE_T_INT: -  if (!Pike_sp[-args].u.integer) { -  PIKE_ERROR("`()", "Attempt to call the NULL-value\n", Pike_sp, args); -  } -  case PIKE_T_STRING: -  case PIKE_T_FLOAT: -  case PIKE_T_MAPPING: -  case PIKE_T_MULTISET: -  PIKE_ERROR("`()", "Attempt to call a non-function value.\n", Pike_sp, args); -  } -  return args; -  } -  -  default: +     fatal("Strange instruction %ld\n",(long)instr);    }       }   }