top 1015 Zend/zend.c if (CG(stack).top) { \ top 1017 Zend/zend.c CG(stack).top = CG(stack).max = 0; \ top 1020 Zend/zend.c stack.top = 0; \ top 1025 Zend/zend.c if (stack.top) { \ top 2007 Zend/zend_compile.c CG(delayed_oplines_stack).top = offset; top 153 Zend/zend_execute.c page->top = ZEND_VM_STACK_ELEMETS(page); top 162 Zend/zend_execute.c EG(vm_stack)->top++; top 163 Zend/zend_execute.c EG(vm_stack_top) = EG(vm_stack)->top; top 184 Zend/zend_execute.c stack->top = EG(vm_stack_top); top 189 Zend/zend_execute.c ptr = stack->top; top 2324 Zend/zend_execute.c EG(vm_stack_top) = EG(vm_stack)->top; top 2397 Zend/zend_execute.c EG(vm_stack)->prev->top = (zval*)call; top 2400 Zend/zend_execute.c if (UNEXPECTED(EG(vm_stack)->prev->top == ZEND_VM_STACK_ELEMETS(EG(vm_stack)->prev))) { top 140 Zend/zend_execute.h zval *top; top 159 Zend/zend_execute.h # define ZEND_ASSERT_VM_STACK(stack) ZEND_ASSERT(stack->top > (zval *) stack && stack->end > (zval *) stack && stack->top <= stack->end) top 266 Zend/zend_execute.h EG(vm_stack_top) = prev->top; top 45 Zend/zend_generators.c original_stack->top = EG(vm_stack_top); top 46 Zend/zend_generators.c EG(vm_stack_top) = generator->stack->top; top 53 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); top 54 Zend/zend_generators.c EG(vm_stack_top) = original_stack->top; top 235 Zend/zend_generators.c current_stack->top = EG(vm_stack_top); top 252 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); top 253 Zend/zend_generators.c EG(vm_stack_top) = current_stack->top; top 667 Zend/zend_generators.c original_stack->top = EG(vm_stack_top); top 672 Zend/zend_generators.c EG(vm_stack_top) = generator->stack->top; top 696 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); top 702 Zend/zend_generators.c EG(vm_stack_top) = original_stack->top; top 32 Zend/zend_objects_API.c objects->top = 1; /* Skip 0 so that handles are true */ top 46 Zend/zend_objects_API.c if (objects->top > 1) { top 48 Zend/zend_objects_API.c zend_object **end = objects->object_buckets + objects->top; top 68 Zend/zend_objects_API.c if (objects->object_buckets && objects->top > 1) { top 70 Zend/zend_objects_API.c zend_object **end = objects->object_buckets + objects->top; top 87 Zend/zend_objects_API.c if (objects->top <= 1) { top 93 Zend/zend_objects_API.c obj_ptr = objects->object_buckets + objects->top; top 122 Zend/zend_objects_API.c if (EG(objects_store).top == EG(objects_store).size) { top 126 Zend/zend_objects_API.c handle = EG(objects_store).top++; top 45 Zend/zend_objects_API.h uint32_t top; top 31 Zend/zend_ptr_stack.c stack->top = stack->max = 0; top 51 Zend/zend_ptr_stack.c stack->top++; top 68 Zend/zend_ptr_stack.c stack->top--; top 86 Zend/zend_ptr_stack.c int i = stack->top; top 98 Zend/zend_ptr_stack.c int i = stack->top; top 104 Zend/zend_ptr_stack.c stack->top = 0; top 111 Zend/zend_ptr_stack.c return stack->top; top 26 Zend/zend_ptr_stack.h int top, max; top 47 Zend/zend_ptr_stack.h if (stack->top+count > stack->max) { \ top 51 Zend/zend_ptr_stack.h } while (stack->top+count > stack->max); \ top 53 Zend/zend_ptr_stack.h stack->top_element = stack->elements+stack->top; \ top 64 Zend/zend_ptr_stack.h stack->top += ZEND_PTR_STACK_NUM_ARGS; top 78 Zend/zend_ptr_stack.h stack->top += ZEND_PTR_STACK_NUM_ARGS; top 90 Zend/zend_ptr_stack.h stack->top -= 3; top 97 Zend/zend_ptr_stack.h stack->top -= 2; top 104 Zend/zend_ptr_stack.h stack->top++; top 110 Zend/zend_ptr_stack.h stack->top--; top 116 Zend/zend_ptr_stack.h return stack->elements[stack->top - 1]; top 30 Zend/zend_stack.c stack->top = 0; top 39 Zend/zend_stack.c if (stack->top >= stack->max) { top 43 Zend/zend_stack.c memcpy(ZEND_STACK_ELEMENT(stack, stack->top), element, stack->size); top 44 Zend/zend_stack.c return stack->top++; top 50 Zend/zend_stack.c if (stack->top > 0) { top 51 Zend/zend_stack.c return ZEND_STACK_ELEMENT(stack, stack->top - 1); top 60 Zend/zend_stack.c --stack->top; top 78 Zend/zend_stack.c return stack->top == 0; top 101 Zend/zend_stack.c return stack->top; top 111 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { top 118 Zend/zend_stack.c for (i=0; i<stack->top; i++) { top 134 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { top 141 Zend/zend_stack.c for (i=0; i<stack->top; i++) { top 155 Zend/zend_stack.c for (i = 0; i < stack->top; i++) { top 164 Zend/zend_stack.c stack->top = stack->max = 0; top 26 Zend/zend_stack.h int size, top, max; top 4411 Zend/zend_vm_def.h zval *arg, *top; top 4440 Zend/zend_vm_def.h top = ZEND_CALL_ARG(EX(call), arg_num); top 4445 Zend/zend_vm_def.h ZVAL_REF(top, Z_REF_P(arg)); top 4447 Zend/zend_vm_def.h ZVAL_DUP(top, arg); top 4450 Zend/zend_vm_def.h ZVAL_COPY(top, Z_REFVAL_P(arg)); top 4452 Zend/zend_vm_def.h ZVAL_COPY(top, arg); top 4486 Zend/zend_vm_def.h zval *arg, *top; top 4531 Zend/zend_vm_def.h top = ZEND_CALL_ARG(EX(call), arg_num); top 4532 Zend/zend_vm_def.h ZVAL_COPY_VALUE(top, arg); top 952 Zend/zend_vm_execute.h zval *arg, *top; top 981 Zend/zend_vm_execute.h top = ZEND_CALL_ARG(EX(call), arg_num); top 986 Zend/zend_vm_execute.h ZVAL_REF(top, Z_REF_P(arg)); top 988 Zend/zend_vm_execute.h ZVAL_DUP(top, arg); top 991 Zend/zend_vm_execute.h ZVAL_COPY(top, Z_REFVAL_P(arg)); top 993 Zend/zend_vm_execute.h ZVAL_COPY(top, arg); top 1027 Zend/zend_vm_execute.h zval *arg, *top; top 1072 Zend/zend_vm_execute.h top = ZEND_CALL_ARG(EX(call), arg_num); top 1073 Zend/zend_vm_execute.h ZVAL_COPY_VALUE(top, arg); top 325 ext/date/lib/parse_date.c if((s->top - s->lim) < BSIZE){ top 333 ext/date/lib/parse_date.c s->top = &s->lim[BSIZE]; top 1897 ext/gd/gd.c Height = rc.bottom - rc.top; top 1973 ext/gd/gd.c Height = rc.bottom - rc.top; top 1980 ext/gd/gd.c BitBlt( memDC, 0, 0, Width, Height , hdc, rc.left, rc.top , SRCCOPY ); top 187 ext/gd/libgd/gd_gif_in.c int top, left; top 219 ext/gd/libgd/gd_gif_in.c top = LM_to_uint(buf[2], buf[3]); top 223 ext/gd/libgd/gd_gif_in.c if (left + width > screen_width || top + height > screen_height) { top 1150 ext/gd/libgd/gdft.c gdft_draw_bitmap(tc_cache, im, fg, bm->bitmap, x + x1 + ((pen.x + 31) >> 6) + bm->left, y + y1 + ((pen.y + 31) >> 6) - bm->top); top 4715 ext/imap/php_imap.c static int build_thread_tree(THREADNODE *top, zval **tree) top 4722 ext/imap/php_imap.c build_thread_tree_helper(top, *tree, &numNodes, buf); top 4736 ext/imap/php_imap.c THREADNODE *top; top 4749 ext/imap/php_imap.c top = mail_thread(imap_le_struct->imap_stream, "REFERENCES", NIL, pgm, flags); top 4754 ext/imap/php_imap.c if(top == NIL) { top 4760 ext/imap/php_imap.c if(build_thread_tree(top, &return_value) == FAILURE) { top 4761 ext/imap/php_imap.c mail_free_threadnode(&top); top 4764 ext/imap/php_imap.c mail_free_threadnode(&top); top 1 ext/json/json_parser.y %code top { top 1091 ext/mbstring/oniguruma/regexec.c , OnigStackType* top, OnigStackType* stk_base top 1100 ext/mbstring/oniguruma/regexec.c k = top; top 4501 ext/mbstring/oniguruma/regparse.c static int parse_subexp(Node** top, OnigToken* tok, int term, top 5428 ext/mbstring/oniguruma/regparse.c parse_branch(Node** top, OnigToken* tok, int term, top 5434 ext/mbstring/oniguruma/regparse.c *top = NULL; top 5439 ext/mbstring/oniguruma/regparse.c *top = node; top 5442 ext/mbstring/oniguruma/regparse.c *top = node_new_list(node, NULL); top 5443 ext/mbstring/oniguruma/regparse.c headp = &(NCDR(*top)); top 5465 ext/mbstring/oniguruma/regparse.c parse_subexp(Node** top, OnigToken* tok, int term, top 5471 ext/mbstring/oniguruma/regparse.c *top = NULL; top 5479 ext/mbstring/oniguruma/regparse.c *top = node; top 5482 ext/mbstring/oniguruma/regparse.c *top = onig_node_new_alt(node, NULL); top 5483 ext/mbstring/oniguruma/regparse.c headp = &(NCDR(*top)); top 5509 ext/mbstring/oniguruma/regparse.c parse_regexp(Node** top, UChar** src, UChar* end, ScanEnv* env) top 5516 ext/mbstring/oniguruma/regparse.c r = parse_subexp(top, &tok, TK_EOT, src, end, env); top 2187 ext/opcache/ZendAccelerator.c if (EG(objects_store).top > 1 || zend_hash_num_elements(&EG(regular_list)) > 0) { top 1513 ext/pcre/pcrelib/pcre_compile.c int i, bot, top; top 1556 ext/pcre/pcrelib/pcre_compile.c top = PRIV(utt_size); top 1558 ext/pcre/pcrelib/pcre_compile.c while (bot < top) top 1561 ext/pcre/pcrelib/pcre_compile.c i = (bot + top) >> 1; top 1569 ext/pcre/pcrelib/pcre_compile.c if (r > 0) bot = i + 1; else top = i; top 79 ext/pcre/pcrelib/pcre_get.c int top, bot; top 83 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 85 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 93 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 95 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 103 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 105 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 114 ext/pcre/pcrelib/pcre_get.c while (top > bot) top 116 ext/pcre/pcrelib/pcre_get.c int mid = (top + bot) / 2; top 121 ext/pcre/pcrelib/pcre_get.c if (c > 0) bot = mid + 1; else top = mid; top 162 ext/pcre/pcrelib/pcre_get.c int top, bot; top 166 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 168 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 176 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 178 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 186 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 188 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 196 ext/pcre/pcrelib/pcre_get.c lastentry = nametable + entrysize * (top - 1); top 198 ext/pcre/pcrelib/pcre_get.c while (top > bot) top 200 ext/pcre/pcrelib/pcre_get.c int mid = (top + bot) / 2; top 232 ext/pcre/pcrelib/pcre_get.c if (c > 0) bot = mid + 1; else top = mid; top 228 ext/pcre/pcrelib/pcre_jit_compile.c struct backtrack_common *top; top 5936 ext/pcre/pcrelib/pcre_jit_compile.c backtrack->prev = parent->top; \ top 5938 ext/pcre/pcrelib/pcre_jit_compile.c parent->top = backtrack; \ top 5949 ext/pcre/pcrelib/pcre_jit_compile.c backtrack->prev = parent->top; \ top 5951 ext/pcre/pcrelib/pcre_jit_compile.c parent->top = backtrack; \ top 6565 ext/pcre/pcrelib/pcre_jit_compile.c altbacktrack.top = NULL; top 6646 ext/pcre/pcrelib/pcre_jit_compile.c compile_backtrackingpath(common, altbacktrack.top); top 7033 ext/pcre/pcrelib/pcre_jit_compile.c parent->top = backtrack->prev; top 7676 ext/pcre/pcrelib/pcre_jit_compile.c backtrack->top = NULL; top 7755 ext/pcre/pcrelib/pcre_jit_compile.c compile_backtrackingpath(common, backtrack->top); top 8327 ext/pcre/pcrelib/pcre_jit_compile.c cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8342 ext/pcre/pcrelib/pcre_jit_compile.c cc = compile_charn_matchingpath(common, cc, ccend, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8344 ext/pcre/pcrelib/pcre_jit_compile.c cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8420 ext/pcre/pcrelib/pcre_jit_compile.c cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8428 ext/pcre/pcrelib/pcre_jit_compile.c cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8438 ext/pcre/pcrelib/pcre_jit_compile.c compile_ref_matchingpath(common, cc, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks, TRUE, FALSE); top 8449 ext/pcre/pcrelib/pcre_jit_compile.c compile_dnref_search(common, cc, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks); top 8450 ext/pcre/pcrelib/pcre_jit_compile.c compile_ref_matchingpath(common, cc, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks, TRUE, FALSE); top 8772 ext/pcre/pcrelib/pcre_jit_compile.c compile_backtrackingpath(common, current->top); top 9057 ext/pcre/pcrelib/pcre_jit_compile.c COMPILE_BACKTRACKINGPATH(current->top); top 9092 ext/pcre/pcrelib/pcre_jit_compile.c current->top = NULL; top 9198 ext/pcre/pcrelib/pcre_jit_compile.c COMPILE_BACKTRACKINGPATH(current->top); top 9363 ext/pcre/pcrelib/pcre_jit_compile.c current->top = NULL; top 9370 ext/pcre/pcrelib/pcre_jit_compile.c compile_bracket_backtrackingpath(common, current->top); top 9713 ext/pcre/pcrelib/pcre_jit_compile.c altbacktrack.top = NULL; top 9725 ext/pcre/pcrelib/pcre_jit_compile.c compile_backtrackingpath(common, altbacktrack.top); top 10143 ext/pcre/pcrelib/pcre_jit_compile.c compile_backtrackingpath(common, rootbacktrack.top); top 10246 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(struct sljit_stack, top), STACK_TOP, 0); top 10253 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(struct sljit_stack, top)); top 10401 ext/pcre/pcrelib/pcre_jit_compile.c local_stack.top = (sljit_sw)&local_space; top 10402 ext/pcre/pcrelib/pcre_jit_compile.c local_stack.base = local_stack.top; top 1140 ext/pcre/pcrelib/sljit/sljitLir.h sljit_uw top; top 273 ext/pcre/pcrelib/sljit/sljitUtils.c stack->top = stack->base; top 120 ext/soap/soap.c EG(vm_stack)->top = _old_stack_top; \ top 640 ext/spl/spl_dllist.c SPL_METHOD(SplDoublyLinkedList, top) top 1362 ext/spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, top, arginfo_dllist_void, ZEND_ACC_PUBLIC) top 699 ext/spl/spl_heap.c SPL_METHOD(SplPriorityQueue, top) top 820 ext/spl/spl_heap.c SPL_METHOD(SplHeap, top) top 1168 ext/spl/spl_heap.c SPL_ME(SplPriorityQueue, top, arginfo_splheap_void, ZEND_ACC_PUBLIC) top 1185 ext/spl/spl_heap.c SPL_ME(SplHeap, top, arginfo_splheap_void, ZEND_ACC_PUBLIC) top 54376 ext/sqlite3/libsqlite/sqlite3.c int top; /* First byte of cell content area */ top 54396 ext/sqlite3/libsqlite/sqlite3.c top = get2byteNotZero(&data[hdr+5]); top 54397 ext/sqlite3/libsqlite/sqlite3.c if( gap>top ) return SQLITE_CORRUPT_BKPT; top 54403 ext/sqlite3/libsqlite/sqlite3.c testcase( gap+2==top ); top 54404 ext/sqlite3/libsqlite/sqlite3.c testcase( gap+1==top ); top 54405 ext/sqlite3/libsqlite/sqlite3.c testcase( gap==top ); top 54406 ext/sqlite3/libsqlite/sqlite3.c if( gap+2<=top && (data[hdr+1] || data[hdr+2]) ){ top 54421 ext/sqlite3/libsqlite/sqlite3.c testcase( gap+2+nByte==top ); top 54422 ext/sqlite3/libsqlite/sqlite3.c if( gap+2+nByte>top ){ top 54427 ext/sqlite3/libsqlite/sqlite3.c top = get2byteNotZero(&data[hdr+5]); top 54428 ext/sqlite3/libsqlite/sqlite3.c assert( gap+nByte<=top ); top 54438 ext/sqlite3/libsqlite/sqlite3.c top -= nByte; top 54439 ext/sqlite3/libsqlite/sqlite3.c put2byte(&data[hdr+5], top); top 54440 ext/sqlite3/libsqlite/sqlite3.c assert( top+nByte <= (int)pPage->pBt->usableSize ); top 54441 ext/sqlite3/libsqlite/sqlite3.c *pIdx = top; top 54623 ext/sqlite3/libsqlite/sqlite3.c int top; /* First byte of the cell content area */ top 54644 ext/sqlite3/libsqlite/sqlite3.c top = get2byteNotZero(&data[hdr+5]); top 54657 ext/sqlite3/libsqlite/sqlite3.c assert( pPage->nCell>0 || top==usableSize || CORRUPT_DB ); top 54696 ext/sqlite3/libsqlite/sqlite3.c nFree = data[hdr+7] + top; /* Init nFree to non-freeblock free space */ top 96 ext/wddx/wddx.c int top, max; top 175 ext/wddx/wddx.c stack->top = 0; top 189 ext/wddx/wddx.c if (stack->top >= stack->max) { /* we need to allocate more memory */ top 193 ext/wddx/wddx.c stack->elements[stack->top] = (void *) emalloc(size); top 194 ext/wddx/wddx.c memcpy(stack->elements[stack->top], element, size); top 195 ext/wddx/wddx.c return stack->top++; top 203 ext/wddx/wddx.c if (stack->top > 0) { top 204 ext/wddx/wddx.c *element = stack->elements[stack->top - 1]; top 217 ext/wddx/wddx.c if (stack->top == 0) { top 232 ext/wddx/wddx.c for (i = 0; i < stack->top; i++) { top 869 ext/wddx/wddx.c if (stack->top == 0) { top 881 ext/wddx/wddx.c if (stack->top > 1) { top 882 ext/wddx/wddx.c stack->top--; top 909 ext/wddx/wddx.c if (stack->top > 1) { top 910 ext/wddx/wddx.c stack->top--; top 982 ext/wddx/wddx.c stack->top--; top 1071 ext/wddx/wddx.c if (stack.top == 1) { top 248 main/mergesort.c #define reverse(bot, top) { \ top 249 main/mergesort.c s = top; \ top 445 sapi/phpdbg/phpdbg_cmd.c if (stack->top == NULL) { top 446 sapi/phpdbg/phpdbg_cmd.c stack->top = next; top 447 sapi/phpdbg/phpdbg_cmd.c next->top = NULL; top 450 sapi/phpdbg/phpdbg_cmd.c stack->top->next = next; top 451 sapi/phpdbg/phpdbg_cmd.c next->top = stack->top; top 452 sapi/phpdbg/phpdbg_cmd.c stack->top = next; top 465 sapi/phpdbg/phpdbg_cmd.c stack->top = param->top; top 471 sapi/phpdbg/phpdbg_cmd.c const phpdbg_param_t *top = (stack != NULL) ? *stack : NULL; top 480 sapi/phpdbg/phpdbg_cmd.c if (!top || top->type == STACK_PARAM) { top 520 sapi/phpdbg/phpdbg_cmd.c if (top && top->type == STACK_PARAM) { top 533 sapi/phpdbg/phpdbg_cmd.c case 'i': verify_arg("raw input", top, STR_PARAM); break; top 534 sapi/phpdbg/phpdbg_cmd.c case 's': verify_arg("string", top, STR_PARAM); break; top 535 sapi/phpdbg/phpdbg_cmd.c case 'n': verify_arg("number", top, NUMERIC_PARAM); break; top 536 sapi/phpdbg/phpdbg_cmd.c case 'm': verify_arg("method", top, METHOD_PARAM); break; top 537 sapi/phpdbg/phpdbg_cmd.c case 'a': verify_arg("address", top, ADDR_PARAM); break; top 538 sapi/phpdbg/phpdbg_cmd.c case 'f': verify_arg("file:line", top, FILE_PARAM); break; top 539 sapi/phpdbg/phpdbg_cmd.c case 'c': verify_arg("condition", top, COND_PARAM); break; top 540 sapi/phpdbg/phpdbg_cmd.c case 'o': verify_arg("opcode", top, OP_PARAM); break; top 541 sapi/phpdbg/phpdbg_cmd.c case 'b': verify_arg("boolean", top, NUMERIC_PARAM); break; top 546 sapi/phpdbg/phpdbg_cmd.c if (top) { top 547 sapi/phpdbg/phpdbg_cmd.c top = top->next; top 572 sapi/phpdbg/phpdbg_cmd.c PHPDBG_API const phpdbg_command_t *phpdbg_stack_resolve(const phpdbg_command_t *commands, const phpdbg_command_t *parent, phpdbg_param_t **top) { top 574 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *name = *top; top 620 sapi/phpdbg/phpdbg_cmd.c (*top) = (*top)->next; top 655 sapi/phpdbg/phpdbg_cmd.c if (command->subs && (*top) && ((*top)->type == STR_PARAM)) { top 656 sapi/phpdbg/phpdbg_cmd.c return phpdbg_stack_resolve(command->subs, command, top); top 666 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *top = (phpdbg_param_t *) stack->next; top 668 sapi/phpdbg/phpdbg_cmd.c switch (top->type) { top 672 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(ev)(top); top 680 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(run)(top); top 689 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(sh)(top); top 692 sapi/phpdbg/phpdbg_cmd.c handler = phpdbg_stack_resolve(phpdbg_prompt_commands, NULL, &top); top 700 sapi/phpdbg/phpdbg_cmd.c if (phpdbg_stack_verify(handler, &top) == SUCCESS) { top 703 sapi/phpdbg/phpdbg_cmd.c return handler->handler(top); top 718 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *top = stack; top 731 sapi/phpdbg/phpdbg_cmd.c if (top->type == STACK_PARAM) { top 733 sapi/phpdbg/phpdbg_cmd.c if ((result = phpdbg_internal_stack_execute(top, allow_async_unsafe)) != SUCCESS) { top 737 sapi/phpdbg/phpdbg_cmd.c } while ((top = top->next)); top 68 sapi/phpdbg/phpdbg_cmd.h phpdbg_param_t *top; top 82 sapi/phpdbg/phpdbg_cmd.h (v)->top = NULL; \ top 141 sapi/phpdbg/phpdbg_cmd.h PHPDBG_API const phpdbg_command_t *phpdbg_stack_resolve(const phpdbg_command_t *commands, const phpdbg_command_t *parent, phpdbg_param_t **top); top 77 sapi/phpdbg/phpdbg_parser.y : parameters { $$.top = PHPDBG_G(parser_stack)->top; } top 78 sapi/phpdbg/phpdbg_parser.y | full_expression { phpdbg_stack_push(PHPDBG_G(parser_stack), &$1); $$.top = PHPDBG_G(parser_stack)->top; } top 82 sapi/phpdbg/phpdbg_parser.y : parameter { phpdbg_stack_push(PHPDBG_G(parser_stack), &$1); $$.top = PHPDBG_G(parser_stack)->top; } top 83 sapi/phpdbg/phpdbg_parser.y | parameters parameter { phpdbg_stack_push(PHPDBG_G(parser_stack), &$2); $$.top = PHPDBG_G(parser_stack)->top; } top 182 sapi/phpdbg/phpdbg_parser.y const phpdbg_param_t *top = PHPDBG_G(parser_stack); top 184 sapi/phpdbg/phpdbg_parser.y while (top) { top 185 sapi/phpdbg/phpdbg_parser.y phpdbg_param_debug(top, "--> "); top 186 sapi/phpdbg/phpdbg_parser.y top = top->next; top 808 sapi/phpdbg/phpdbg_prompt.c original_stack->top = EG(vm_stack_top); top 851 sapi/phpdbg/phpdbg_prompt.c EG(vm_stack_top) = original_stack->top; top 35 sapi/phpdbg/phpdbg_sigio_win32.c top: top 43 sapi/phpdbg/phpdbg_sigio_win32.c goto top; top 61 sapi/phpdbg/phpdbg_sigio_win32.c goto top;