pike.git/src/interpret.h:1abbfb11ff4d276425f52f9a925cb5f6a146b677

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 /* || 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: interpret.h,v 1.168 2006/03/25 16:31:59 grubba Exp $ */ #ifndef INTERPRET_H #define INTERPRET_H #include "global.h" #include "program.h" #include "pike_error.h" #include "object.h" #include "pike_rusage.h" struct catch_context { struct catch_context *prev; JMP_BUF recovery; struct svalue *save_expendible; PIKE_OPCODE_T *next_addr; ptrdiff_t continue_reladdr; #ifdef PIKE_DEBUG struct pike_frame *frame; #endif }; struct Pike_interpreter { /* Swapped variables */ struct svalue *stack_pointer; struct svalue *evaluator_stack; struct svalue **mark_stack_pointer; struct svalue **mark_stack; struct pike_frame *frame_pointer; JMP_BUF *recoveries; #ifdef PIKE_THREADS struct thread_state *thread_state; #endif char *stack_top; DO_IF_SECURITY(struct object *current_creds;) struct catch_context *catch_ctx; LOW_JMP_BUF *catching_eval_jmpbuf; int svalue_stack_margin; int c_stack_margin; INT16 evaluator_stack_malloced; INT16 mark_stack_malloced; #ifdef PROFILING cpu_time_t accounted_time; /** Time spent and accounted for so far. */ cpu_time_t unlocked_time; /** Time spent unlocked so far. */ char *stack_bottom; #endif int trace_level; }; #ifndef STRUCT_FRAME_DECLARED #define STRUCT_FRAME_DECLARED #endif struct pike_frame { INT32 refs;/* must be first */ INT32 args; /** Actual number of arguments. */ unsigned INT16 fun; /** Function number. */ INT16 num_locals; /** Number of local variables. */ INT16 num_args; /** Number of argument variables. */ unsigned INT16 flags; /** PIKE_FRAME_* */ INT16 ident; struct pike_frame *next; struct pike_frame *scope; PIKE_OPCODE_T *pc; /** Address of current opcode. */ PIKE_OPCODE_T *return_addr; /** Address of opcode to continue at after call. */ struct svalue *locals; /** Start of local variables. */ /** This is <= locals, and this is where the * return value should go. */ struct svalue *save_sp; /** * This tells us the current level of svalues on the stack that can * be discarded once the current function is done with them */ struct svalue *expendible; struct svalue **save_mark_sp; struct svalue **mark_sp_base; struct object *current_object; DO_IF_SECURITY(struct object *current_creds;) #if defined(PROFILING) cpu_time_t children_base; /** Accounted time when the frame started. */ cpu_time_t start_time; /** Adjusted time when thr frame started. */ cpu_time_t self_time_base; /* ??? */ #endif struct inherit context; char *current_storage; }; #define PIKE_FRAME_RETURN_INTERNAL 1 #define PIKE_FRAME_RETURN_POP 2 #define PIKE_FRAME_MALLOCED_LOCALS 0x8000 struct external_variable_context { struct object *o; struct inherit *inherit; int parent_identifier; }; #ifdef HAVE_COMPUTED_GOTO extern PIKE_OPCODE_T *fcode_to_opcode; extern struct op_2_f { PIKE_OPCODE_T opcode; INT32 fcode; } *opcode_to_fcode; #endif /* HAVE_COMPUTED_GOTO */ #ifdef PIKE_DEBUG PMOD_EXPORT extern const char msg_stack_error[]; #define debug_check_stack() do{if(Pike_sp<Pike_interpreter.evaluator_stack)Pike_fatal(msg_stack_error);}while(0) #define check__positive(X,Y) if((X)<0) Pike_fatal Y #include "pike_error.h" #else #define check__positive(X,Y) #define debug_check_stack() #endif #define low_stack_check(X) \ (Pike_sp - Pike_interpreter.evaluator_stack + \ Pike_interpreter.svalue_stack_margin + (X) >= Pike_stack_size) PMOD_EXPORT extern const char Pike_check_stack_errmsg[]; #define check_stack(X) do { \ if(low_stack_check(X)) \ ((void (*)(const char *, ...))Pike_error)( \ Pike_check_stack_errmsg, \ PTRDIFF_T_TO_LONG(Pike_sp - Pike_interpreter.evaluator_stack), \ PTRDIFF_T_TO_LONG(Pike_stack_size), \ PTRDIFF_T_TO_LONG(X)); \ }while(0) PMOD_EXPORT extern const char Pike_check_mark_stack_errmsg[]; #define check_mark_stack(X) do { \ if(Pike_mark_sp - Pike_interpreter.mark_stack + (X) >= Pike_stack_size) \ ((void (*)(const char*, ...))Pike_error)(Pike_check_mark_stack_errmsg); \ }while(0) PMOD_EXPORT extern const char Pike_check_c_stack_errmsg[]; #define check_c_stack(X) do { \ ptrdiff_t x_= (((char *)&x_) - Pike_interpreter.stack_top) + \ STACK_DIRECTION * (Pike_interpreter.c_stack_margin + (X)); \ x_*=STACK_DIRECTION; \ if(x_>0) { \ low_error(Pike_check_c_stack_errmsg); \ /* Pike_fatal("C stack overflow: x_:%p &x_:%p top:%p margin:%p\n", \ x_, &x_, Pike_interpreter.stack_top, \ Pike_interpreter.c_stack_margin + (X)); */ \ } \ }while(0) #define fatal_check_c_stack(X) do { \ ptrdiff_t x_= \ ((char *)&x_) + STACK_DIRECTION * (X) - Pike_interpreter.stack_top ; \ x_*=STACK_DIRECTION; \ if(x_>0) { \ ((void (*)(const char*, ...))Pike_fatal)(Pike_check_c_stack_errmsg); \ } \ }while(0) #ifdef PIKE_DEBUG #define STACK_LEVEL_START(depth) \ do { \ struct svalue *save_stack_level = (Pike_sp - (depth)) #define STACK_LEVEL_DONE(depth) \ STACK_LEVEL_CHECK(depth); \ } while(0) #define STACK_LEVEL_CHECK(depth) \ do { \ if (Pike_sp != save_stack_level + (depth)) { \ Pike_fatal("Unexpected stack level! " \ "Actual: %d, expected: %d\n", \ DO_NOT_WARN((int)(Pike_sp - save_stack_level)), \ (depth)); \ } \ } while(0) #else /* !PIKE_DEBUG */ #define STACK_LEVEL_START(depth) do { #define STACK_LEVEL_DONE(depth) } while(0) #define STACK_LEVEL_CHECK(depth) #endif /* PIKE_DEBUG */ #define pop_stack() do{ free_svalue(--Pike_sp); debug_check_stack(); }while(0) #define pop_2_elems() do { pop_stack(); pop_stack(); }while(0) #ifdef __ECL #define MAYBE_CAST_TO_LONG(X) (X) #else /* !__ECL */ #define MAYBE_CAST_TO_LONG(X) ((long)(X)) #endif /* __ECL */ PMOD_EXPORT extern const char msg_pop_neg[]; #define pop_n_elems(X) \ do { \ ptrdiff_t x_=(X); \ if(x_) { \ struct svalue *_sp_; \ check__positive(x_, (msg_pop_neg, x_)); \ _sp_ = Pike_sp = Pike_sp - x_; \ debug_check_stack(); \ free_mixed_svalues(_sp_, x_); \ } \ } while (0) /* This pops a number of arguments from the stack but keeps the top * element on top. Used for popping the arguments while keeping the * return value. */ #define stack_unlink(X) do { \ ptrdiff_t x2_ = (X); \ if (x2_) { \ struct svalue *_sp_ = --Pike_sp; \ free_svalue (_sp_ - x2_); \ move_svalue (_sp_ - x2_, _sp_); \ pop_n_elems (x2_ - 1); \ } \ }while(0) #define stack_pop_n_elems_keep_top(X) stack_unlink(X) #define stack_pop_keep_top() do { \ struct svalue *_sp_ = --Pike_sp; \ free_svalue (_sp_ - 1); \ move_svalue (_sp_ - 1, _sp_); \ debug_check_stack(); \ } while (0) #define stack_pop_2_elems_keep_top() do { \ struct svalue *_sp_ = Pike_sp = Pike_sp - 2; \ free_svalue (_sp_ - 1); \ free_svalue (_sp_); \ move_svalue (_sp_ - 1, _sp_ + 1); \ debug_check_stack(); \ } while (0) #define stack_pop_to_no_free(X) move_svalue(X, --Pike_sp) #define stack_pop_to(X) do { \ struct svalue *_=(X); \ free_svalue(_); \ stack_pop_to_no_free(_); \ }while(0) #define push_program(P) do{ \ struct program *_=(P); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.program=_; \ _sp_++->type=PIKE_T_PROGRAM; \ }while(0) #define push_int(I) do{ \ INT_TYPE _=(I); \ struct svalue *_sp_ = Pike_sp++; \ _sp_->u.integer=_; \ _sp_->type=PIKE_T_INT; \ _sp_->subtype=NUMBER_NUMBER; \ }while(0) #define push_undefined() do{ \ struct svalue *_sp_ = Pike_sp++; \ _sp_->u.integer=0; \ _sp_->type=PIKE_T_INT; \ _sp_->subtype=NUMBER_UNDEFINED; \ }while(0) #define push_obj_index(I) do{ \ int _=(I); \ struct svalue *_sp_ = Pike_sp++; \ _sp_->u.identifier=_; \ _sp_->type=T_OBJ_INDEX; \ }while(0) #define push_mapping(M) do{ \ struct mapping *_=(M); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.mapping=_; \ _sp_->type=PIKE_T_MAPPING; \ }while(0) #define push_array(A) do{ \ struct array *_=(A); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.array=_ ; \ _sp_->type=PIKE_T_ARRAY; \ }while(0) #define push_empty_array() ref_push_array(&empty_array) #define push_multiset(L) do{ \ struct multiset *_=(L); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.multiset=_; \ _sp_->type=PIKE_T_MULTISET; \ }while(0) #define push_string(S) do { \ struct pike_string *_=(S); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ DO_IF_DEBUG(if(_->size_shift & ~3) { \ Pike_fatal("Pushing string with bad shift: %d\n", \ _->size_shift); \ }); \ _sp_->subtype=0; \ _sp_->u.string=_; \ _sp_->type=PIKE_T_STRING; \ }while(0) #define push_empty_string() ref_push_string(empty_pike_string) #define push_type_value(S) do{ \ struct pike_type *_=(S); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.type=_; \ _sp_->type=PIKE_T_TYPE; \ }while(0) #define push_object(O) do { \ struct object *_=(O); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.object=_; \ _sp_->type=PIKE_T_OBJECT; \ _sp_->subtype = 0; \ }while(0) #define push_object_inherit(O, INH_NUM) do { \ struct object *_ = (O); \ struct svalue *_sp_ = Pike_sp++; \ int _inh_ = (INH_NUM); \ debug_malloc_touch(_); \ _sp_->u.object = _; \ _sp_->type = PIKE_T_OBJECT; \ _sp_->subtype = _inh_; \ }while(0) #define push_float(F) do{ \ FLOAT_TYPE _=(F); \ struct svalue *_sp_ = Pike_sp++; \ _sp_->u.float_number=_; \ _sp_->type=PIKE_T_FLOAT; \ }while(0) #define push_text(T) do { \ const char *_ = (T); \ struct svalue *_sp_ = Pike_sp++; \ _sp_->subtype=0; \ _sp_->u.string=make_shared_binary_string(_,strlen(_)); \ debug_malloc_touch(_sp_->u.string); \ _sp_->type=PIKE_T_STRING; \ }while(0) #define push_constant_text(T) do{ \ struct svalue *_sp_ = Pike_sp++; \ _sp_->subtype=0; \ REF_MAKE_CONST_STRING(_sp_->u.string,T); \ _sp_->type=PIKE_T_STRING; \ }while(0) #define push_constant_string_code(STR, CODE) do{ \ struct pike_string *STR; \ REF_MAKE_CONST_STRING_CODE (STR, CODE); \ push_string (STR); \ }while(0) #define push_function(OBJ, FUN) do { \ struct object *_=(OBJ); \ struct svalue *_sp_ = Pike_sp++; \ debug_malloc_touch(_); \ _sp_->u.object=_; \ _sp_->subtype=(FUN); \ _sp_->type=PIKE_T_FUNCTION; \ } while (0) #define ref_push_program(P) do{ \ struct program *_=(P); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.program=_; \ _sp_->type=PIKE_T_PROGRAM; \ }while(0) #define ref_push_mapping(M) do{ \ struct mapping *_=(M); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.mapping=_; \ _sp_->type=PIKE_T_MAPPING; \ }while(0) #define ref_push_array(A) do{ \ struct array *_=(A); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.array=_ ; \ _sp_->type=PIKE_T_ARRAY; \ }while(0) #define ref_push_multiset(L) do{ \ struct multiset *_=(L); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.multiset=_; \ _sp_->type=PIKE_T_MULTISET; \ }while(0) #define ref_push_string(S) do{ \ struct pike_string *_=(S); \ struct svalue *_sp_ = Pike_sp++; \ DO_IF_DEBUG(if(_->size_shift & ~3) { \ Pike_fatal("Pushing string with bad shift: %d\n", \ _->size_shift); \ }); \ add_ref(_); \ _sp_->subtype=0; \ _sp_->u.string=_; \ _sp_->type=PIKE_T_STRING; \ }while(0) #define ref_push_type_value(S) do{ \ struct pike_type *_=(S); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.type=_; \ _sp_->type=PIKE_T_TYPE; \ }while(0) #define ref_push_object(O) do{ \ struct object *_=(O); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.object=_; \ _sp_->type=PIKE_T_OBJECT; \ _sp_->subtype = 0; \ }while(0) #define ref_push_object_inherit(O, INH_NUM) do{ \ struct object *_ = (O); \ struct svalue *_sp_ = Pike_sp++; \ int _inh_ = (INH_NUM); \ add_ref(_); \ _sp_->u.object = _; \ _sp_->type = PIKE_T_OBJECT; \ _sp_->subtype = _inh_; \ }while(0) #define ref_push_function(OBJ, FUN) do { \ struct object *_=(OBJ); \ struct svalue *_sp_ = Pike_sp++; \ add_ref(_); \ _sp_->u.object=_; \ _sp_->subtype=(FUN); \ _sp_->type=PIKE_T_FUNCTION; \ } while (0) #define push_svalue(S) do { \ const struct svalue *_=(S); \ struct svalue *_sp_ = Pike_sp++; \ assign_svalue_no_free(_sp_,_); \ }while(0) #define stack_dup() push_svalue(Pike_sp-1) #define stack_swap() do { \ struct svalue *_sp_ = Pike_sp; \ struct svalue _=_sp_[-1]; \ _sp_[-1]=_sp_[-2]; \ _sp_[-2]=_; \ } while(0) #define push_zeroes(N) do{ \ struct svalue *s_=Pike_sp; \ ptrdiff_t num_= (N); \ for(;num_-- > 0;s_++) \ { \ s_->type=PIKE_T_INT; \ s_->subtype=NUMBER_NUMBER; \ s_->u.integer=0; \ } \ Pike_sp=s_; \ }while(0) #define push_undefines(N) do{ \ struct svalue *s_=Pike_sp; \ ptrdiff_t num_= (N); \ for(;num_-- > 0;s_++) \ { \ s_->type=PIKE_T_INT; \ s_->subtype=NUMBER_UNDEFINED; \ s_->u.integer=0; \ } \ Pike_sp=s_; \ }while(0) #define free_pike_frame(F) do{ struct pike_frame *f_=(F); if(!sub_ref(f_)) really_free_pike_frame(f_); }while(0) /* A scope is any frame which may have malloced locals */ #define free_pike_scope(F) do{ struct pike_frame *f_=(F); if(!sub_ref(f_)) really_free_pike_scope(f_); }while(0) #define POP_PIKE_FRAME() do { \ struct pike_frame *_fp_ = Pike_fp; \ struct pike_frame *tmp_=_fp_->next; \ DO_IF_PROFILING({ \ /* Time spent in this frame + children. */ \ cpu_time_t time_passed = \ get_cpu_time() - Pike_interpreter.unlocked_time; \ /* Time spent in children to this frame. */ \ cpu_time_t time_in_children; \ /* Time spent in just this frame. */ \ cpu_time_t self_time; \ struct identifier *function; \ DO_IF_PROFILING_DEBUG({ \ fprintf(stderr, "%p}: Pop got %" PRINT_CPU_TIME \ " (%" PRINT_CPU_TIME ")" \ " %" PRINT_CPU_TIME " (%" PRINT_CPU_TIME ")\n", \ Pike_interpreter.thread_state, time_passed, \ _fp_->start_time, Pike_interpreter.accounted_time, \ _fp_->children_base); \ }); \ time_passed -= _fp_->start_time; \ DO_IF_DEBUG(if (time_passed < 0) { \ Pike_fatal("Negative time_passed: %" PRINT_CPU_TIME \ " now: %" PRINT_CPU_TIME \ " unlocked_time: %" PRINT_CPU_TIME \ " start_time: %" PRINT_CPU_TIME \ "\n", time_passed, get_cpu_time(), \ Pike_interpreter.unlocked_time, \ _fp_->start_time); \ }); \ time_in_children = \ Pike_interpreter.accounted_time - _fp_->children_base; \ DO_IF_DEBUG(if (time_in_children < 0) { \ Pike_fatal("Negative time_in_children: %" \ PRINT_CPU_TIME \ " accounted_time: %" PRINT_CPU_TIME \ " children_base: %" PRINT_CPU_TIME \ "\n", time_in_children, \ Pike_interpreter.accounted_time, \ _fp_->children_base); \ }); \ self_time = time_passed - time_in_children; \ DO_IF_DEBUG(if (self_time < 0) { \ Pike_fatal("Negative self_time: %" PRINT_CPU_TIME \ " time_passed: %" PRINT_CPU_TIME \ " time_in_children: %" PRINT_CPU_TIME \ "\n", self_time, time_passed, \ time_in_children); \ }); \ Pike_interpreter.accounted_time += self_time; \ /* FIXME: Can context.prog be NULL? */ \ function = _fp_->context.prog->identifiers + _fp_->ident; \ /* function->total_time = \ Pike_fp->self_time_base + time_passed; */ \ function->total_time += time_passed; \ function->self_time += self_time; \ }); \ if(!sub_ref(_fp_)) \ { \ really_free_pike_frame(_fp_); \ }else{ \ ptrdiff_t num_expendible = _fp_->expendible - _fp_->locals; \ DO_IF_DEBUG( \ if( (_fp_->locals + _fp_->num_locals > Pike_sp) || \ (Pike_sp < _fp_->expendible) || \ (num_expendible < 0) || (num_expendible > _fp_->num_locals)) \ Pike_fatal("Stack failure in POP_PIKE_FRAME %p+%d=%p %p %p!\n", \ _fp_->locals, _fp_->num_locals, \ _fp_->locals+_fp_->num_locals, \ Pike_sp,_fp_->expendible)); \ debug_malloc_touch(_fp_); \ if(num_expendible) \ { \ struct svalue *s=(struct svalue *)xalloc(sizeof(struct svalue)* \ num_expendible); \ _fp_->num_locals = num_expendible; \ assign_svalues_no_free(s, _fp_->locals, num_expendible, \ BIT_MIXED); \ _fp_->locals=s; \ _fp_->flags|=PIKE_FRAME_MALLOCED_LOCALS; \ }else{ \ _fp_->locals=0; \ } \ _fp_->next=0; \ } \ Pike_fp=tmp_; \ }while(0) enum apply_type { APPLY_STACK, /* The function is the first argument */ APPLY_SVALUE, /* arg1 points to an svalue containing the function */ APPLY_SVALUE_STRICT, /* Like APPLY_SVALUE, but does not return values for void functions */ APPLY_LOW /* arg1 is the object pointer,(int)arg2 the function */ }; #define APPLY_MASTER(FUN,ARGS) \ do{ \ static int fun_, master_cnt=0; \ struct object *master_ob=master(); \ if(master_cnt != master_ob->prog->id) \ { \ fun_=find_identifier(FUN,master_ob->prog); \ master_cnt = master_ob->prog->id; \ } \ if (fun_ >= 0) { \ apply_low(master_ob, fun_, ARGS); \ } else { \ Pike_error("Cannot call undefined function \"%s\" in master.\n", FUN); \ } \ }while(0) #define SAFE_APPLY_MASTER(FUN,ARGS) \ do{ \ static int fun_, master_cnt=0; \ struct object *master_ob=master(); \ if(master_cnt != master_ob->prog->id) \ { \ fun_=find_identifier(FUN,master_ob->prog); \ master_cnt = master_ob->prog->id; \ } \ safe_apply_low2(master_ob, fun_, ARGS, FUN); \ }while(0) #define SAFE_APPLY_HANDLER(FUN, HANDLER, COMPAT, ARGS) do { \ static int h_fun_=-1, h_id_=0; \ static int c_fun_=-1, c_fun_id_=0; \ struct object *h_=(HANDLER), *c_=(COMPAT); \ if (h_ && h_->prog) { \ if (h_->prog->id != h_id_) { \ h_fun_ = find_identifier(fun, h_->prog); \ h_id_ = h_->prog->id; \ } \ if (h_fun_ != -1) { \ safe_apply_low(h_, h_fun_, ARGS); \ break; \ } \ } \ if (c_ && c_->prog) { \ if (c_->prog->id != c_id_) { \ c_fun_ = find_identifier(fun, c_->prog); \ c_id_ = c_->prog->id; \ } \ if (c_fun_ != -1) { \ safe_apply_low(c_, c_fun_, ARGS); \ break; \ } \ } \ SAFE_APPLY_MASTER(FUN, ARGS); \ } while(0) #ifdef INTERNAL_PROFILING PMOD_EXPORT extern unsigned long evaluator_callback_calls; #endif #define check_threads_etc() do { \ DO_IF_INTERNAL_PROFILING (evaluator_callback_calls++); \ call_callback(& evaluator_callbacks, NULL); \ }while(0) #ifdef PIKE_DEBUG #define fast_check_threads_etc(X) do { \ static int div_; if(d_flag || !(div_++& ((1<<(X))-1))) check_threads_etc(); } while(0) #else #define fast_check_threads_etc(X) do { \ static int div_; if(!(div_++& ((1<<(X))-1))) check_threads_etc(); } while(0) #endif #include "block_alloc_h.h" /* Prototypes begin here */ void push_sp_mark(void); ptrdiff_t pop_sp_mark(void); void gc_mark_stack_external (struct pike_frame *frame, struct svalue *stack_p, struct svalue *stack); PMOD_EXPORT int low_init_interpreter(struct Pike_interpreter *interpreter); PMOD_EXPORT void init_interpreter(void); void lvalue_to_svalue_no_free(struct svalue *to,struct svalue *lval); PMOD_EXPORT void assign_lvalue(struct svalue *lval,struct svalue *from); PMOD_EXPORT union anything *get_pointer_if_this_type(struct svalue *lval, TYPE_T t); void print_return_value(void); void reset_evaluator(void); struct backlog; void dump_backlog(void); BLOCK_ALLOC (catch_context, 0); BLOCK_ALLOC(pike_frame,128); #ifdef PIKE_USE_MACHINE_CODE #if defined(OPCODE_INLINE_BRANCH) || defined(INS_F_JUMP) || \ defined(INS_F_JUMP_WITH_ARG) || defined(INS_F_JUMP_WITH_TWO_ARGS) void branch_check_threads_etc(); #endif #ifdef PIKE_DEBUG void simple_debug_instr_prologue_0 (PIKE_INSTR_T instr); void simple_debug_instr_prologue_1 (PIKE_INSTR_T instr, INT32 arg); void simple_debug_instr_prologue_2 (PIKE_INSTR_T instr, INT32 arg1, INT32 arg2); #endif #endif /* PIKE_USE_MACHINE_CODE */ PMOD_EXPORT void find_external_context(struct external_variable_context *loc, int arg2); void really_free_pike_scope(struct pike_frame *scope); int low_mega_apply(enum apply_type type, INT32 args, void *arg1, void *arg2); void low_return(void); void low_return_pop(void); void unlink_previous_frame(void); void mega_apply(enum apply_type type, INT32 args, void *arg1, void *arg2); PMOD_EXPORT void f_call_function(INT32 args); PMOD_EXPORT void call_handle_error(void); PMOD_EXPORT int apply_low_safe_and_stupid(struct object *o, INT32 offset); PMOD_EXPORT void safe_apply_low(struct object *o,int fun,int args); PMOD_EXPORT void safe_apply_low2(struct object *o,int fun,int args, const char *fun_name); PMOD_EXPORT void safe_apply(struct object *o, const char *fun ,INT32 args); PMOD_EXPORT int low_unsafe_apply_handler(const char *fun, struct object *handler, struct object *compat, INT32 args); PMOD_EXPORT void low_safe_apply_handler(const char *fun, struct object *handler, struct object *compat, INT32 args); PMOD_EXPORT int safe_apply_handler(const char *fun, struct object *handler, struct object *compat, INT32 args, TYPE_FIELD rettypes); PMOD_EXPORT void apply_lfun(struct object *o, int fun, int args); PMOD_EXPORT void apply_shared(struct object *o, struct pike_string *fun, int args); PMOD_EXPORT void apply(struct object *o, const char *fun, int args); PMOD_EXPORT void apply_svalue(struct svalue *s, INT32 args); PMOD_EXPORT void safe_apply_svalue (struct svalue *s, INT32 args, int handle_errors); PMOD_EXPORT void apply_external(int depth, int fun, INT32 args); PMOD_EXPORT void slow_check_stack(void); PMOD_EXPORT void custom_check_stack(ptrdiff_t amount, const char *fmt, ...) ATTRIBUTE((format (printf, 2, 3))); PMOD_EXPORT void cleanup_interpret(void); PMOD_EXPORT void low_cleanup_interpret(struct Pike_interpreter *interpreter); void really_clean_up_interpret(void); /* Prototypes end here */ /* These need to be after the prototypes, * to avoid implicit declaration of mega_apply(). */ #ifdef __ECL static INLINE void apply_low(struct object *o, ptrdiff_t fun, INT32 args) { mega_apply(APPLY_LOW, args, (void*)o, (void*)fun); } static INLINE void strict_apply_svalue(struct svalue *sval, INT32 args) { mega_apply(APPLY_SVALUE_STRICT, args, (void*)sval, 0); } #else /* !__ECL */ #define apply_low(O,FUN,ARGS) \ mega_apply(APPLY_LOW, (ARGS), (void*)(O),(void*)(ptrdiff_t)(FUN)) #define strict_apply_svalue(SVAL,ARGS) \ mega_apply(APPLY_SVALUE, (ARGS), (void*)(SVAL),0) #endif /* __ECL */ #define apply_current(FUN, ARGS) \ apply_low(Pike_fp->current_object, \ (FUN) + Pike_fp->context.identifier_level, \ (ARGS)) PMOD_EXPORT extern int d_flag; /* really in main.c */ PMOD_EXPORT extern int Pike_stack_size; PMOD_EXPORT struct callback; PMOD_EXPORT extern struct callback_list evaluator_callbacks; /* Things to try: * we could reduce thread swapping to a pointer operation if * we do something like: * #define Pike_interpreter (*Pike_interpreter_pointer) * * Since global variables are usually accessed through indirection * anyways, it might not make any speed differance. * * The above define could also be used to facilitate dynamic loading * on Win32.. */ PMOD_EXPORT extern struct Pike_interpreter Pike_interpreter; #define Pike_sp Pike_interpreter.stack_pointer #define Pike_fp Pike_interpreter.frame_pointer #define Pike_mark_sp Pike_interpreter.mark_stack_pointer #define CURRENT_STORAGE (dmalloc_touch(struct pike_frame *,Pike_fp)->current_storage) #define PIKE_STACK_MMAPPED struct Pike_stack { struct svalue *top; int flags; struct Pike_stack *previous; struct svalue *save_ptr; struct svalue stack[1]; }; #define PIKE_STACK_REQUIRE_BEGIN(num, base) do { \ struct Pike_stack *old_stack_; \ if(Pike_interpreter.current_stack->top - Pike_sp < num) \ { \ old_stack_=Pike_interpreter.current_stack; \ old_stack_->save_ptr=Pike_sp; \ Pike_interpreter.current_stack=allocate_array(MAXIMUM(num, 8192)); \ while(old_sp > base) *(Pike_sp++) = *--old_stack_->save_ptr; \ } #define PIKE_STACK_REQUIRE_END() \ while(Pike_sp > Pike_interpreter.current_stack->stack) \ *(old_stack_->save_ptr++) = *--Pike_sp; \ Pike_interpreter.current_stack=Pike_interpreter.current_stack->previous; \ }while(0) #endif

pike.git/ src/ interpret.h > 1abbfb11ff4d276425f52f9a925cb5f6a146b677 [Annotate]