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 1686 Zend/zend_execute.c EG(argument_stack)->top = zend_vm_stack_frame_base(execute_data); top 1742 Zend/zend_execute.c EG(argument_stack)->top += count; top 1743 Zend/zend_execute.c *(EG(argument_stack)->top) = (void*)(zend_uintptr_t)count; top 1745 Zend/zend_execute.c void *data = *(--p->top); top 1747 Zend/zend_execute.c if (UNEXPECTED(p->top == ZEND_VM_STACK_ELEMETS(p))) { top 1756 Zend/zend_execute.c return EG(argument_stack)->top++; top 1762 Zend/zend_execute.c if (UNEXPECTED(EG(argument_stack)->top - ZEND_VM_STACK_ELEMETS(EG(argument_stack)) < count) top 1763 Zend/zend_execute.c || UNEXPECTED(EG(argument_stack)->top == EG(argument_stack)->end)) { top 1766 Zend/zend_execute.c *(EG(argument_stack)->top) = (void*)(zend_uintptr_t)count; top 1767 Zend/zend_execute.c return EG(argument_stack)->top++; top 170 Zend/zend_execute.h void **top; top 181 Zend/zend_execute.h EG(argument_stack)->end - EG(argument_stack)->top)) { \ top 189 Zend/zend_execute.h page->top = ZEND_VM_STACK_ELEMETS(page); top 190 Zend/zend_execute.h page->end = page->top + count; top 220 Zend/zend_execute.h return EG(argument_stack)->top; top 225 Zend/zend_execute.h *(EG(argument_stack)->top++) = ptr; top 230 Zend/zend_execute.h void *el = *(--EG(argument_stack)->top); top 243 Zend/zend_execute.h int extra = (ZEND_MM_ALIGNMENT - ((zend_uintptr_t)EG(argument_stack)->top & (ZEND_MM_ALIGNMENT - 1))) / sizeof(void*); top 246 Zend/zend_execute.h (zend_uintptr_t)(EG(argument_stack)->end - EG(argument_stack)->top))) { top 249 Zend/zend_execute.h void **old_top = EG(argument_stack)->top; top 251 Zend/zend_execute.h EG(argument_stack)->top += extra; top 253 Zend/zend_execute.h *EG(argument_stack)->top = (void*)old_top; top 254 Zend/zend_execute.h EG(argument_stack)->top += ZEND_MM_ALIGNED_SIZE(sizeof(void*)) / sizeof(void*); top 259 Zend/zend_execute.h ret = (void*)EG(argument_stack)->top; top 260 Zend/zend_execute.h EG(argument_stack)->top += size; top 278 Zend/zend_execute.h EG(argument_stack)->top = (void**)ptr; top 293 Zend/zend_execute.h EG(argument_stack)->top = *(void***)ptr; top 295 Zend/zend_execute.h EG(argument_stack)->top = (void**)ptr; top 302 Zend/zend_execute.h void **p = EG(argument_stack)->top - 1; top 311 Zend/zend_execute.h EG(argument_stack)->top = p; top 729 Zend/zend_execute_API.c if (i || UNEXPECTED(ZEND_VM_STACK_ELEMETS(EG(argument_stack)) == (EG(argument_stack)->top))) { top 80 Zend/zend_generators.c void **ptr = generator->stack->top - 1; top 33 Zend/zend_objects_API.c objects->top = 1; /* Skip 0 so that handles are true */ top 49 Zend/zend_objects_API.c for (i = 1; i < objects->top ; i++) { top 78 Zend/zend_objects_API.c for (i = 1; i < objects->top ; i++) { top 89 Zend/zend_objects_API.c for (i = 1; i < objects->top ; i++) { top 116 Zend/zend_objects_API.c if (EG(objects_store).top == EG(objects_store).size) { top 120 Zend/zend_objects_API.c handle = EG(objects_store).top++; top 53 Zend/zend_objects_API.h zend_uint 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 27 Zend/zend_stack.c stack->top = 0; top 35 Zend/zend_stack.c if (stack->top >= stack->max) { /* we need to allocate more memory */ top 42 Zend/zend_stack.c stack->elements[stack->top] = (void *) emalloc(size); top 43 Zend/zend_stack.c memcpy(stack->elements[stack->top], element, 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 *element = stack->elements[stack->top - 1]; top 62 Zend/zend_stack.c if (stack->top > 0) { top 63 Zend/zend_stack.c efree(stack->elements[--stack->top]); top 83 Zend/zend_stack.c if (stack->top == 0) { top 96 Zend/zend_stack.c for (i = 0; i < stack->top; i++) { top 115 Zend/zend_stack.c return stack->top; top 125 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { top 132 Zend/zend_stack.c for (i=0; i<stack->top; i++) { top 148 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { top 155 Zend/zend_stack.c for (i=0; i<stack->top; i++) { top 26 Zend/zend_stack.h int top, max; 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 1068 ext/ereg/regex/regcomp.c register cset *top = &p->g->sets[p->g->ncsets]; top 1073 ext/ereg/regex/regcomp.c if (cs == top-1) /* recover only the easy case */ top 1094 ext/ereg/regex/regcomp.c register cset *top = &p->g->sets[p->g->ncsets]; top 1099 ext/ereg/regex/regcomp.c for (cs2 = &p->g->sets[0]; cs2 < top; cs2++) top 1109 ext/ereg/regex/regcomp.c if (cs2 < top) { /* found one */ top 1985 ext/gd/gd.c Height = rc.bottom - rc.top; top 2061 ext/gd/gd.c Height = rc.bottom - rc.top; top 2068 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 1143 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 4693 ext/imap/php_imap.c static int build_thread_tree(THREADNODE *top, zval **tree) top 4700 ext/imap/php_imap.c build_thread_tree_helper(top, *tree, &numNodes, buf); top 4714 ext/imap/php_imap.c THREADNODE *top; top 4725 ext/imap/php_imap.c top = mail_thread(imap_le_struct->imap_stream, "REFERENCES", NIL, pgm, flags); top 4730 ext/imap/php_imap.c if(top == NIL) { top 4736 ext/imap/php_imap.c if(build_thread_tree(top, &return_value) == FAILURE) { top 4737 ext/imap/php_imap.c mail_free_threadnode(&top); top 4740 ext/imap/php_imap.c mail_free_threadnode(&top); top 204 ext/json/JSON_parser.c jp->top += 1; top 205 ext/json/JSON_parser.c if (jp->top >= jp->depth) { top 209 ext/json/JSON_parser.c jp->stack[jp->top] = mode; top 221 ext/json/JSON_parser.c if (jp->top < 0 || jp->stack[jp->top] != mode) { top 225 ext/json/JSON_parser.c jp->top -= 1; top 247 ext/json/JSON_parser.c jp->top = -1; top 545 ext/json/JSON_parser.c if (type != -1 && jp->stack[jp->top] == MODE_OBJECT) top 553 ext/json/JSON_parser.c add_property_zval_ex(jp->the_zstack[jp->top], (key.len ? key.c : "_empty_"), (key.len ? (key.len + 1) : sizeof("_empty_")), mval TSRMLS_CC); top 556 ext/json/JSON_parser.c add_assoc_zval_ex(jp->the_zstack[jp->top], (key.len ? key.c : ""), (key.len ? (key.len + 1) : sizeof("")), mval); top 573 ext/json/JSON_parser.c if (type != -1 && jp->stack[jp->top] == MODE_ARRAY) top 579 ext/json/JSON_parser.c add_next_index_zval(jp->the_zstack[jp->top], mval); top 599 ext/json/JSON_parser.c if (jp->top > 0) { top 602 ext/json/JSON_parser.c if (jp->top == 1) { top 614 ext/json/JSON_parser.c jp->the_zstack[jp->top] = obj; top 616 ext/json/JSON_parser.c if (jp->top > 1) { top 617 ext/json/JSON_parser.c attach_zval(jp, jp->top - 1, jp->top, &key, assoc TSRMLS_CC); top 632 ext/json/JSON_parser.c if (jp->top > 0) { top 635 ext/json/JSON_parser.c if (jp->top == 1) { top 642 ext/json/JSON_parser.c jp->the_zstack[jp->top] = arr; top 644 ext/json/JSON_parser.c if (jp->top > 1) { top 645 ext/json/JSON_parser.c attach_zval(jp, jp->top - 1, jp->top, &key, assoc TSRMLS_CC); top 655 ext/json/JSON_parser.c switch (jp->stack[jp->top]) { top 686 ext/json/JSON_parser.c (jp->stack[jp->top] == MODE_OBJECT || top 687 ext/json/JSON_parser.c jp->stack[jp->top] == MODE_ARRAY)) top 693 ext/json/JSON_parser.c switch (jp->stack[jp->top]) { top 698 ext/json/JSON_parser.c add_property_zval_ex(jp->the_zstack[jp->top], (key.len ? key.c : "_empty_"), (key.len ? (key.len + 1) : sizeof("_empty_")), mval TSRMLS_CC); top 701 ext/json/JSON_parser.c add_assoc_zval_ex(jp->the_zstack[jp->top], (key.len ? key.c : ""), (key.len ? (key.len + 1) : sizeof("")), mval); top 710 ext/json/JSON_parser.c add_next_index_zval(jp->the_zstack[jp->top], mval); top 15 ext/json/JSON_parser.h int 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 296 ext/opcache/ZendAccelerator.c ZCSG(interned_strings_top) = ZCSG(interned_strings_saved_state).top; top 308 ext/opcache/ZendAccelerator.c ZCSG(interned_strings_saved_state).top = ZCSG(interned_strings_top); top 2337 ext/opcache/ZendAccelerator.c if (EG(objects_store).top > 1 || zend_hash_num_elements(&EG(regular_list)) > 0) { top 311 ext/opcache/ZendAccelerator.h char *top; top 1515 ext/pcre/pcrelib/pcre_compile.c int i, bot, top; top 1558 ext/pcre/pcrelib/pcre_compile.c top = PRIV(utt_size); top 1560 ext/pcre/pcrelib/pcre_compile.c while (bot < top) top 1563 ext/pcre/pcrelib/pcre_compile.c i = (bot + top) >> 1; top 1571 ext/pcre/pcrelib/pcre_compile.c if (r > 0) bot = i + 1; else top = i; top 81 ext/pcre/pcrelib/pcre_get.c int top, bot; top 85 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 87 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 95 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 97 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 105 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 107 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 116 ext/pcre/pcrelib/pcre_get.c while (top > bot) top 118 ext/pcre/pcrelib/pcre_get.c int mid = (top + bot) / 2; top 123 ext/pcre/pcrelib/pcre_get.c if (c > 0) bot = mid + 1; else top = mid; top 164 ext/pcre/pcrelib/pcre_get.c int top, bot; top 168 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 170 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 178 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 180 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 188 ext/pcre/pcrelib/pcre_get.c if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) top 190 ext/pcre/pcrelib/pcre_get.c if (top <= 0) return PCRE_ERROR_NOSUBSTRING; top 198 ext/pcre/pcrelib/pcre_get.c lastentry = nametable + entrysize * (top - 1); top 200 ext/pcre/pcrelib/pcre_get.c while (top > bot) top 202 ext/pcre/pcrelib/pcre_get.c int mid = (top + bot) / 2; top 234 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 96 ext/soap/soap.c void **_old_stack_top = EG(argument_stack)->top; \ top 113 ext/soap/soap.c if (_old_stack_top != EG(argument_stack)->top) { \ top 121 ext/soap/soap.c EG(argument_stack)->top = _old_stack_top; \ top 645 ext/spl/spl_dllist.c SPL_METHOD(SplDoublyLinkedList, top) top 1371 ext/spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, top, arginfo_dllist_void, ZEND_ACC_PUBLIC) top 279 ext/spl/spl_heap.c spl_ptr_heap_element top; top 286 ext/spl/spl_heap.c top = heap->elements[0]; top 311 ext/spl/spl_heap.c heap->dtor(top TSRMLS_CC); top 312 ext/spl/spl_heap.c return top; top 747 ext/spl/spl_heap.c SPL_METHOD(SplPriorityQueue, top) top 834 ext/spl/spl_heap.c SPL_METHOD(SplHeap, top) top 1184 ext/spl/spl_heap.c SPL_ME(SplPriorityQueue, top, arginfo_splheap_void, ZEND_ACC_PUBLIC) top 1200 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 926 ext/wddx/wddx.c if (stack->top == 0) { top 938 ext/wddx/wddx.c if (stack->top > 1) { top 939 ext/wddx/wddx.c stack->top--; top 973 ext/wddx/wddx.c if (stack->top > 1) { top 974 ext/wddx/wddx.c stack->top--; top 1048 ext/wddx/wddx.c stack->top--; top 1155 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 439 sapi/apache/php_apache.c zend_bool top=0; top 443 sapi/apache/php_apache.c if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "ss|b", &var, &var_len, &val, &val_len, &top) == FAILURE) { top 447 sapi/apache/php_apache.c while(top) { top 58 sapi/apache_hooks/mod_php5.c int top, max, persistent; top 117 sapi/apache_hooks/mod_php5.c stack->top = 0; top 129 sapi/apache_hooks/mod_php5.c if (stack->top >= stack->max) { /* we need to allocate more memory */ top 136 sapi/apache_hooks/mod_php5.c stack->elements[stack->top] = (void *) element; top 137 sapi/apache_hooks/mod_php5.c return stack->top++; top 140 sapi/apache_hooks/mod_php5.c if(stack->top == 0) { top 144 sapi/apache_hooks/mod_php5.c return stack->elements[--stack->top]; top 159 sapi/apache_hooks/mod_php5.c for (i=stack->top-1; i>=0; i--) { top 164 sapi/apache_hooks/mod_php5.c for (i=0; i<stack->top; i++) { top 179 sapi/apache_hooks/mod_php5.c for (i=stack->top-1; i>=0; i--) { top 186 sapi/apache_hooks/mod_php5.c for (i=0; i<stack->top; i++) { top 202 sapi/apache_hooks/mod_php5.c for (i=stack->top-1; i>=0; i--) { top 209 sapi/apache_hooks/mod_php5.c for (i=0; i<stack->top; i++) { top 881 sapi/apache_hooks/mod_php5.c a->headers_handlers = (a->headers_handlers.top)?a->headers_handlers:b->headers_handlers; top 882 sapi/apache_hooks/mod_php5.c a->auth_handlers = (a->auth_handlers.top)?a->auth_handlers:b->auth_handlers; top 883 sapi/apache_hooks/mod_php5.c a->access_handlers = (a->access_handlers.top)?a->access_handlers:b->access_handlers; top 884 sapi/apache_hooks/mod_php5.c a->type_handlers = (a->type_handlers.top)?a->type_handlers:b->type_handlers; top 885 sapi/apache_hooks/mod_php5.c a->fixup_handlers = (a->fixup_handlers.top)?a->fixup_handlers:b->fixup_handlers; top 886 sapi/apache_hooks/mod_php5.c a->logger_handlers = (a->logger_handlers.top)?a->logger_handlers:b->logger_handlers; top 887 sapi/apache_hooks/mod_php5.c a->post_read_handlers = (a->post_read_handlers.top)?a->post_read_handlers:b->post_read_handlers; top 888 sapi/apache_hooks/mod_php5.c a->response_handlers = (a->response_handlers.top)?a->response_handlers:b->response_handlers; top 1812 sapi/apache_hooks/php_apache.c zend_bool top=0; top 1816 sapi/apache_hooks/php_apache.c if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "ss|b", &var, &var_len, &val, &val_len, &top) == FAILURE) { top 1820 sapi/apache_hooks/php_apache.c while(top) { top 454 sapi/phpdbg/phpdbg_cmd.c if (stack->top == NULL) { top 455 sapi/phpdbg/phpdbg_cmd.c stack->top = next; top 456 sapi/phpdbg/phpdbg_cmd.c next->top = NULL; top 459 sapi/phpdbg/phpdbg_cmd.c stack->top->next = next; top 460 sapi/phpdbg/phpdbg_cmd.c next->top = stack->top; top 461 sapi/phpdbg/phpdbg_cmd.c stack->top = next; top 470 sapi/phpdbg/phpdbg_cmd.c const phpdbg_param_t *top = (stack != NULL) ? *stack : NULL; top 479 sapi/phpdbg/phpdbg_cmd.c if (!top) { top 531 sapi/phpdbg/phpdbg_cmd.c case 'i': verify_arg("raw input", top, STR_PARAM); break; top 532 sapi/phpdbg/phpdbg_cmd.c case 's': verify_arg("string", top, STR_PARAM); break; top 533 sapi/phpdbg/phpdbg_cmd.c case 'n': verify_arg("number", top, NUMERIC_PARAM); break; top 534 sapi/phpdbg/phpdbg_cmd.c case 'm': verify_arg("method", top, METHOD_PARAM); break; top 535 sapi/phpdbg/phpdbg_cmd.c case 'a': verify_arg("address", top, ADDR_PARAM); break; top 536 sapi/phpdbg/phpdbg_cmd.c case 'f': verify_arg("file:line", top, FILE_PARAM); break; top 537 sapi/phpdbg/phpdbg_cmd.c case 'c': verify_arg("condition", top, COND_PARAM); break; top 538 sapi/phpdbg/phpdbg_cmd.c case 'o': verify_arg("opcode", top, OP_PARAM); break; top 539 sapi/phpdbg/phpdbg_cmd.c case 'b': verify_arg("boolean", top, NUMERIC_PARAM); break; top 544 sapi/phpdbg/phpdbg_cmd.c if (top ) { top 545 sapi/phpdbg/phpdbg_cmd.c top = top->next; top 569 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, char **why) { top 571 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *name = *top; top 622 sapi/phpdbg/phpdbg_cmd.c (*top) = (*top)->next; top 661 sapi/phpdbg/phpdbg_cmd.c if (command->subs && (*top) && ((*top)->type == STR_PARAM)) { top 662 sapi/phpdbg/phpdbg_cmd.c return phpdbg_stack_resolve(command->subs, command, top, why); top 672 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *top = NULL; top 687 sapi/phpdbg/phpdbg_cmd.c top = (phpdbg_param_t*) stack->next; top 689 sapi/phpdbg/phpdbg_cmd.c switch (top->type) { top 691 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(ev)(top TSRMLS_CC); top 694 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(run)(top TSRMLS_CC); top 697 sapi/phpdbg/phpdbg_cmd.c return PHPDBG_COMMAND_HANDLER(sh)(top TSRMLS_CC); top 701 sapi/phpdbg/phpdbg_cmd.c phpdbg_prompt_commands, NULL, &top, why); top 704 sapi/phpdbg/phpdbg_cmd.c if (phpdbg_stack_verify(handler, &top, why TSRMLS_CC) == SUCCESS) { top 705 sapi/phpdbg/phpdbg_cmd.c return handler->handler(top TSRMLS_CC); top 68 sapi/phpdbg/phpdbg_cmd.h phpdbg_param_t *top; top 82 sapi/phpdbg/phpdbg_cmd.h (v)->top = NULL; \ top 136 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, char **why); top 166 sapi/phpdbg/phpdbg_parser.y const phpdbg_param_t *top = PHPDBG_G(parser_stack); top 168 sapi/phpdbg/phpdbg_parser.y while (top) { top 169 sapi/phpdbg/phpdbg_parser.y phpdbg_param_debug(top, "--> "); top 170 sapi/phpdbg/phpdbg_parser.y top = top->next;