stack 1014 Zend/zend.c #define SAVE_STACK(stack) do { \ stack 1015 Zend/zend.c if (CG(stack).top) { \ stack 1016 Zend/zend.c memcpy(&stack, &CG(stack), sizeof(zend_stack)); \ stack 1017 Zend/zend.c CG(stack).top = CG(stack).max = 0; \ stack 1018 Zend/zend.c CG(stack).elements = NULL; \ stack 1020 Zend/zend.c stack.top = 0; \ stack 1024 Zend/zend.c #define RESTORE_STACK(stack) do { \ stack 1025 Zend/zend.c if (stack.top) { \ stack 1026 Zend/zend.c zend_stack_destroy(&CG(stack)); \ stack 1027 Zend/zend.c memcpy(&CG(stack), &stack, sizeof(zend_stack)); \ stack 169 Zend/zend_execute.c zend_vm_stack stack = EG(vm_stack); stack 171 Zend/zend_execute.c while (stack != NULL) { stack 172 Zend/zend_execute.c zend_vm_stack p = stack->prev; stack 173 Zend/zend_execute.c efree(stack); stack 174 Zend/zend_execute.c stack = p; stack 180 Zend/zend_execute.c zend_vm_stack stack; stack 183 Zend/zend_execute.c stack = EG(vm_stack); stack 184 Zend/zend_execute.c stack->top = EG(vm_stack_top); stack 185 Zend/zend_execute.c EG(vm_stack) = stack = zend_vm_stack_new_page( stack 188 Zend/zend_execute.c stack); stack 189 Zend/zend_execute.c ptr = stack->top; stack 191 Zend/zend_execute.c EG(vm_stack_end) = stack->end; stack 148 Zend/zend_execute.h #define ZEND_VM_STACK_ELEMETS(stack) \ stack 149 Zend/zend_execute.h (((zval*)(stack)) + ZEND_VM_STACK_HEADER_SLOTS) stack 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) stack 162 Zend/zend_execute.h # define ZEND_ASSERT_VM_STACK(stack) stack 46 Zend/zend_generators.c EG(vm_stack_top) = generator->stack->top; stack 47 Zend/zend_generators.c EG(vm_stack_end) = generator->stack->end; stack 48 Zend/zend_generators.c EG(vm_stack) = generator->stack; stack 52 Zend/zend_generators.c generator->stack = EG(vm_stack); stack 53 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); stack 96 Zend/zend_generators.c efree(generator->stack); stack 251 Zend/zend_generators.c generator->stack = EG(vm_stack); stack 252 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); stack 672 Zend/zend_generators.c EG(vm_stack_top) = generator->stack->top; stack 673 Zend/zend_generators.c EG(vm_stack_end) = generator->stack->end; stack 674 Zend/zend_generators.c EG(vm_stack) = generator->stack; stack 695 Zend/zend_generators.c generator->stack = EG(vm_stack); stack 696 Zend/zend_generators.c generator->stack->top = EG(vm_stack_top); stack 66 Zend/zend_generators.h zend_vm_stack stack; stack 28 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_init_ex(zend_ptr_stack *stack, zend_bool persistent) stack 30 Zend/zend_ptr_stack.c stack->top_element = stack->elements = NULL; stack 31 Zend/zend_ptr_stack.c stack->top = stack->max = 0; stack 32 Zend/zend_ptr_stack.c stack->persistent = persistent; stack 35 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack) stack 37 Zend/zend_ptr_stack.c zend_ptr_stack_init_ex(stack, 0); stack 41 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...) stack 46 Zend/zend_ptr_stack.c ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count) stack 51 Zend/zend_ptr_stack.c stack->top++; stack 52 Zend/zend_ptr_stack.c *(stack->top_element++) = elem; stack 59 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...) stack 67 Zend/zend_ptr_stack.c *elem = *(--stack->top_element); stack 68 Zend/zend_ptr_stack.c stack->top--; stack 76 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_destroy(zend_ptr_stack *stack) stack 78 Zend/zend_ptr_stack.c if (stack->elements) { stack 79 Zend/zend_ptr_stack.c pefree(stack->elements, stack->persistent); stack 84 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *)) stack 86 Zend/zend_ptr_stack.c int i = stack->top; stack 89 Zend/zend_ptr_stack.c func(stack->elements[i]); stack 94 Zend/zend_ptr_stack.c ZEND_API void zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements) stack 96 Zend/zend_ptr_stack.c zend_ptr_stack_apply(stack, func); stack 98 Zend/zend_ptr_stack.c int i = stack->top; stack 101 Zend/zend_ptr_stack.c pefree(stack->elements[i], stack->persistent); stack 104 Zend/zend_ptr_stack.c stack->top = 0; stack 105 Zend/zend_ptr_stack.c stack->top_element = stack->elements; stack 109 Zend/zend_ptr_stack.c ZEND_API int zend_ptr_stack_num_elements(zend_ptr_stack *stack) stack 111 Zend/zend_ptr_stack.c return stack->top; stack 36 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack); stack 37 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_init_ex(zend_ptr_stack *stack, zend_bool persistent); stack 38 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...); stack 39 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...); stack 40 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_destroy(zend_ptr_stack *stack); stack 41 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *)); stack 42 Zend/zend_ptr_stack.h ZEND_API void zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements); stack 43 Zend/zend_ptr_stack.h ZEND_API int zend_ptr_stack_num_elements(zend_ptr_stack *stack); stack 46 Zend/zend_ptr_stack.h #define ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count) \ stack 47 Zend/zend_ptr_stack.h if (stack->top+count > stack->max) { \ stack 50 Zend/zend_ptr_stack.h stack->max += PTR_STACK_BLOCK_SIZE; \ stack 51 Zend/zend_ptr_stack.h } while (stack->top+count > stack->max); \ stack 52 Zend/zend_ptr_stack.h stack->elements = (void **) perealloc(stack->elements, (sizeof(void *) * (stack->max)), stack->persistent); \ stack 53 Zend/zend_ptr_stack.h stack->top_element = stack->elements+stack->top; \ stack 58 Zend/zend_ptr_stack.h static zend_always_inline void zend_ptr_stack_3_push(zend_ptr_stack *stack, void *a, void *b, void *c) stack 62 Zend/zend_ptr_stack.h ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, ZEND_PTR_STACK_NUM_ARGS) stack 64 Zend/zend_ptr_stack.h stack->top += ZEND_PTR_STACK_NUM_ARGS; stack 65 Zend/zend_ptr_stack.h *(stack->top_element++) = a; stack 66 Zend/zend_ptr_stack.h *(stack->top_element++) = b; stack 67 Zend/zend_ptr_stack.h *(stack->top_element++) = c; stack 72 Zend/zend_ptr_stack.h static zend_always_inline void zend_ptr_stack_2_push(zend_ptr_stack *stack, void *a, void *b) stack 76 Zend/zend_ptr_stack.h ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, ZEND_PTR_STACK_NUM_ARGS) stack 78 Zend/zend_ptr_stack.h stack->top += ZEND_PTR_STACK_NUM_ARGS; stack 79 Zend/zend_ptr_stack.h *(stack->top_element++) = a; stack 80 Zend/zend_ptr_stack.h *(stack->top_element++) = b; stack 85 Zend/zend_ptr_stack.h static zend_always_inline void zend_ptr_stack_3_pop(zend_ptr_stack *stack, void **a, void **b, void **c) stack 87 Zend/zend_ptr_stack.h *a = *(--stack->top_element); stack 88 Zend/zend_ptr_stack.h *b = *(--stack->top_element); stack 89 Zend/zend_ptr_stack.h *c = *(--stack->top_element); stack 90 Zend/zend_ptr_stack.h stack->top -= 3; stack 93 Zend/zend_ptr_stack.h static zend_always_inline void zend_ptr_stack_2_pop(zend_ptr_stack *stack, void **a, void **b) stack 95 Zend/zend_ptr_stack.h *a = *(--stack->top_element); stack 96 Zend/zend_ptr_stack.h *b = *(--stack->top_element); stack 97 Zend/zend_ptr_stack.h stack->top -= 2; stack 100 Zend/zend_ptr_stack.h static zend_always_inline void zend_ptr_stack_push(zend_ptr_stack *stack, void *ptr) stack 102 Zend/zend_ptr_stack.h ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, 1) stack 104 Zend/zend_ptr_stack.h stack->top++; stack 105 Zend/zend_ptr_stack.h *(stack->top_element++) = ptr; stack 108 Zend/zend_ptr_stack.h static zend_always_inline void *zend_ptr_stack_pop(zend_ptr_stack *stack) stack 110 Zend/zend_ptr_stack.h stack->top--; stack 111 Zend/zend_ptr_stack.h return *(--stack->top_element); stack 114 Zend/zend_ptr_stack.h static zend_always_inline void *zend_ptr_stack_top(zend_ptr_stack *stack) stack 116 Zend/zend_ptr_stack.h return stack->elements[stack->top - 1]; stack 25 Zend/zend_stack.c #define ZEND_STACK_ELEMENT(stack, n) ((void *)((char *) (stack)->elements + (stack)->size * (n))) stack 27 Zend/zend_stack.c ZEND_API int zend_stack_init(zend_stack *stack, int size) stack 29 Zend/zend_stack.c stack->size = size; stack 30 Zend/zend_stack.c stack->top = 0; stack 31 Zend/zend_stack.c stack->max = 0; stack 32 Zend/zend_stack.c stack->elements = NULL; stack 36 Zend/zend_stack.c ZEND_API int zend_stack_push(zend_stack *stack, const void *element) stack 39 Zend/zend_stack.c if (stack->top >= stack->max) { stack 40 Zend/zend_stack.c stack->max += STACK_BLOCK_SIZE; stack 41 Zend/zend_stack.c stack->elements = safe_erealloc(stack->elements, stack->size, stack->max, 0); stack 43 Zend/zend_stack.c memcpy(ZEND_STACK_ELEMENT(stack, stack->top), element, stack->size); stack 44 Zend/zend_stack.c return stack->top++; stack 48 Zend/zend_stack.c ZEND_API void *zend_stack_top(const zend_stack *stack) stack 50 Zend/zend_stack.c if (stack->top > 0) { stack 51 Zend/zend_stack.c return ZEND_STACK_ELEMENT(stack, stack->top - 1); stack 58 Zend/zend_stack.c ZEND_API int zend_stack_del_top(zend_stack *stack) stack 60 Zend/zend_stack.c --stack->top; stack 65 Zend/zend_stack.c ZEND_API int zend_stack_int_top(const zend_stack *stack) stack 67 Zend/zend_stack.c int *e = zend_stack_top(stack); stack 76 Zend/zend_stack.c ZEND_API int zend_stack_is_empty(const zend_stack *stack) stack 78 Zend/zend_stack.c return stack->top == 0; stack 82 Zend/zend_stack.c ZEND_API int zend_stack_destroy(zend_stack *stack) stack 84 Zend/zend_stack.c if (stack->elements) { stack 85 Zend/zend_stack.c efree(stack->elements); stack 86 Zend/zend_stack.c stack->elements = NULL; stack 93 Zend/zend_stack.c ZEND_API void *zend_stack_base(const zend_stack *stack) stack 95 Zend/zend_stack.c return stack->elements; stack 99 Zend/zend_stack.c ZEND_API int zend_stack_count(const zend_stack *stack) stack 101 Zend/zend_stack.c return stack->top; stack 105 Zend/zend_stack.c ZEND_API void zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element)) stack 111 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { stack 112 Zend/zend_stack.c if (apply_function(ZEND_STACK_ELEMENT(stack, i))) { stack 118 Zend/zend_stack.c for (i=0; i<stack->top; i++) { stack 119 Zend/zend_stack.c if (apply_function(ZEND_STACK_ELEMENT(stack, i))) { stack 128 Zend/zend_stack.c ZEND_API void zend_stack_apply_with_argument(zend_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg) stack 134 Zend/zend_stack.c for (i=stack->top-1; i>=0; i--) { stack 135 Zend/zend_stack.c if (apply_function(ZEND_STACK_ELEMENT(stack, i), arg)) { stack 141 Zend/zend_stack.c for (i=0; i<stack->top; i++) { stack 142 Zend/zend_stack.c if (apply_function(ZEND_STACK_ELEMENT(stack, i), arg)) { stack 150 Zend/zend_stack.c ZEND_API void zend_stack_clean(zend_stack *stack, void (*func)(void *), zend_bool free_elements) stack 155 Zend/zend_stack.c for (i = 0; i < stack->top; i++) { stack 156 Zend/zend_stack.c func(ZEND_STACK_ELEMENT(stack, i)); stack 160 Zend/zend_stack.c if (stack->elements) { stack 161 Zend/zend_stack.c efree(stack->elements); stack 162 Zend/zend_stack.c stack->elements = NULL; stack 164 Zend/zend_stack.c stack->top = stack->max = 0; stack 34 Zend/zend_stack.h ZEND_API int zend_stack_init(zend_stack *stack, int size); stack 35 Zend/zend_stack.h ZEND_API int zend_stack_push(zend_stack *stack, const void *element); stack 36 Zend/zend_stack.h ZEND_API void *zend_stack_top(const zend_stack *stack); stack 37 Zend/zend_stack.h ZEND_API int zend_stack_del_top(zend_stack *stack); stack 38 Zend/zend_stack.h ZEND_API int zend_stack_int_top(const zend_stack *stack); stack 39 Zend/zend_stack.h ZEND_API int zend_stack_is_empty(const zend_stack *stack); stack 40 Zend/zend_stack.h ZEND_API int zend_stack_destroy(zend_stack *stack); stack 41 Zend/zend_stack.h ZEND_API void *zend_stack_base(const zend_stack *stack); stack 42 Zend/zend_stack.h ZEND_API int zend_stack_count(const zend_stack *stack); stack 43 Zend/zend_stack.h ZEND_API void zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element)); stack 44 Zend/zend_stack.h ZEND_API void zend_stack_apply_with_argument(zend_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg); stack 45 Zend/zend_stack.h ZEND_API void zend_stack_clean(zend_stack *stack, void (*func)(void *), zend_bool free_elements); stack 1856 ext/gd/libgd/gd.c if (sp<stack+FILL_MAX && Y+(DY)>=0 && Y+(DY)<wy2) \ stack 1874 ext/gd/libgd/gd.c struct seg *stack = NULL; stack 1915 ext/gd/libgd/gd.c stack = (struct seg *)safe_emalloc(sizeof(struct seg), ((int)(im->sy*im->sx)/4), 1); stack 1916 ext/gd/libgd/gd.c sp = stack; stack 1922 ext/gd/libgd/gd.c while (sp>stack) { stack 1953 ext/gd/libgd/gd.c efree(stack); stack 1965 ext/gd/libgd/gd.c struct seg *stack; stack 1982 ext/gd/libgd/gd.c stack = (struct seg *)safe_emalloc(sizeof(struct seg), ((int)(im->sy*im->sx)/4), 1); stack 1983 ext/gd/libgd/gd.c sp = stack; stack 1991 ext/gd/libgd/gd.c while (sp>stack) { stack 2029 ext/gd/libgd/gd.c efree(stack); stack 89 ext/gd/libgd/gd_gif_in.c int stack[STACK_SIZE], *sp; stack 451 ext/gd/libgd/gd_gif_in.c sd->sp = sd->stack; stack 463 ext/gd/libgd/gd_gif_in.c if (sd->sp > sd->stack) stack 477 ext/gd/libgd/gd_gif_in.c sd->sp = sd->stack; stack 497 ext/gd/libgd/gd_gif_in.c if (sd->sp == (sd->stack + STACK_SIZE)) { stack 508 ext/gd/libgd/gd_gif_in.c if (sd->sp == (sd->stack + STACK_SIZE)) { stack 534 ext/gd/libgd/gd_gif_in.c if (sd->sp > sd->stack) stack 3685 ext/mbstring/mbstring.c zval *args, *stack, *var, *hash_entry, *hash_entry_ptr, *zfrom_enc; stack 3737 ext/mbstring/mbstring.c stack = (zval *)safe_emalloc(stack_max, sizeof(zval), 0); stack 3755 ext/mbstring/mbstring.c var = &stack[stack_level]; stack 3769 ext/mbstring/mbstring.c ptmp = erealloc(stack, sizeof(zval) * stack_max); stack 3770 ext/mbstring/mbstring.c stack = (zval *)ptmp; stack 3772 ext/mbstring/mbstring.c ZVAL_COPY_VALUE(&stack[stack_level], var); stack 3801 ext/mbstring/mbstring.c efree(stack); stack 3826 ext/mbstring/mbstring.c stack = (zval*)safe_emalloc(stack_max, sizeof(zval), 0); stack 3842 ext/mbstring/mbstring.c var = &stack[stack_level]; stack 3857 ext/mbstring/mbstring.c ptmp = erealloc(stack, sizeof(zval) * stack_max); stack 3858 ext/mbstring/mbstring.c stack = (zval *)ptmp; stack 3860 ext/mbstring/mbstring.c ZVAL_COPY_VALUE(&stack[stack_level], var); stack 3894 ext/mbstring/mbstring.c efree(stack); stack 2108 ext/openssl/openssl.c STACK_OF(X509) *stack=NULL, *ret=NULL; stack 2112 ext/openssl/openssl.c if(!(stack = sk_X509_new_null())) { stack 2118 ext/openssl/openssl.c sk_X509_free(stack); stack 2124 ext/openssl/openssl.c sk_X509_free(stack); stack 2131 ext/openssl/openssl.c sk_X509_free(stack); stack 2139 ext/openssl/openssl.c sk_X509_push(stack,xi->x509); stack 2144 ext/openssl/openssl.c if(!sk_X509_num(stack)) { stack 2146 ext/openssl/openssl.c sk_X509_free(stack); stack 2149 ext/openssl/openssl.c ret=stack; stack 162 ext/pcre/pcrelib/pcre_jit_compile.c struct sljit_stack *stack; stack 2223 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(STACK_TOP), SLJIT_OFFSETOF(jit_arguments, stack)); stack 7535 ext/pcre/pcrelib/pcre_jit_compile.c int stack; /* Also contains the offset of control head. */ stack 7596 ext/pcre/pcrelib/pcre_jit_compile.c stack = 0; stack 7599 ext/pcre/pcrelib/pcre_jit_compile.c stack = 2; stack 7611 ext/pcre/pcrelib/pcre_jit_compile.c stack = 3; stack 7619 ext/pcre/pcrelib/pcre_jit_compile.c stack = 1; stack 7623 ext/pcre/pcrelib/pcre_jit_compile.c stack++; stack 7625 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), SLJIT_IMM, 1); stack 7628 ext/pcre/pcrelib/pcre_jit_compile.c stack--; stack 7629 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), TMP2, 0); stack 7649 ext/pcre/pcrelib/pcre_jit_compile.c stack = 0; stack 7653 ext/pcre/pcrelib/pcre_jit_compile.c stack = 1; stack 7657 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), TMP2, 0); stack 7658 ext/pcre/pcrelib/pcre_jit_compile.c stack++; stack 7662 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), STR_PTR, 0); stack 7663 ext/pcre/pcrelib/pcre_jit_compile.c stack++; stack 7665 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), TMP1, 0); stack 7667 ext/pcre/pcrelib/pcre_jit_compile.c stack -= 1 + (offset == 0); stack 7707 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SP), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), STACK(stack)); stack 7738 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SP), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), STACK(stack)); stack 10033 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, stack)); stack 10245 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, stack)); stack 10252 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, stack)); stack 10405 ext/pcre/pcrelib/pcre_jit_compile.c arguments->stack = &local_stack; stack 10463 ext/pcre/pcrelib/pcre_jit_compile.c arguments.stack = (struct sljit_stack *)functions->callback(functions->userdata); stack 10465 ext/pcre/pcrelib/pcre_jit_compile.c arguments.stack = (struct sljit_stack *)functions->userdata; stack 10467 ext/pcre/pcrelib/pcre_jit_compile.c if (arguments.stack == NULL) stack 10487 ext/pcre/pcrelib/pcre_jit_compile.c int *offsets, int offset_count, pcre_jit_stack *stack) stack 10492 ext/pcre/pcrelib/pcre_jit_compile.c int *offsets, int offset_count, pcre16_jit_stack *stack) stack 10497 ext/pcre/pcrelib/pcre_jit_compile.c int *offsets, int offset_count, pcre32_jit_stack *stack) stack 10525 ext/pcre/pcrelib/pcre_jit_compile.c arguments.stack = (struct sljit_stack *)stack; stack 10619 ext/pcre/pcrelib/pcre_jit_compile.c pcre_jit_stack_free(pcre_jit_stack *stack) stack 10622 ext/pcre/pcrelib/pcre_jit_compile.c pcre16_jit_stack_free(pcre16_jit_stack *stack) stack 10625 ext/pcre/pcrelib/pcre_jit_compile.c pcre32_jit_stack_free(pcre32_jit_stack *stack) stack 10628 ext/pcre/pcrelib/pcre_jit_compile.c sljit_free_stack((struct sljit_stack *)stack, NULL); stack 10690 ext/pcre/pcrelib/pcre_jit_compile.c pcre_jit_stack_free(pcre_jit_stack *stack) stack 10693 ext/pcre/pcrelib/pcre_jit_compile.c pcre16_jit_stack_free(pcre16_jit_stack *stack) stack 10696 ext/pcre/pcrelib/pcre_jit_compile.c pcre32_jit_stack_free(pcre32_jit_stack *stack) stack 10699 ext/pcre/pcrelib/pcre_jit_compile.c (void)stack; stack 1152 ext/pcre/pcrelib/sljit/sljitLir.h SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_free_stack(struct sljit_stack *stack, void *allocator_data); stack 1160 ext/pcre/pcrelib/sljit/sljitLir.h SLJIT_API_FUNC_ATTRIBUTE sljit_sw SLJIT_CALL sljit_stack_resize(struct sljit_stack *stack, sljit_uw new_limit); stack 205 ext/pcre/pcrelib/sljit/sljitUtils.c struct sljit_stack *stack; stack 236 ext/pcre/pcrelib/sljit/sljitUtils.c stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); stack 237 ext/pcre/pcrelib/sljit/sljitUtils.c if (!stack) stack 243 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_FREE(stack, allocator_data); stack 246 ext/pcre/pcrelib/sljit/sljitUtils.c stack->base = base.uw; stack 247 ext/pcre/pcrelib/sljit/sljitUtils.c stack->limit = stack->base; stack 248 ext/pcre/pcrelib/sljit/sljitUtils.c stack->max_limit = stack->base + max_limit; stack 249 ext/pcre/pcrelib/sljit/sljitUtils.c if (sljit_stack_resize(stack, stack->base + limit)) { stack 250 ext/pcre/pcrelib/sljit/sljitUtils.c sljit_free_stack(stack, allocator_data); stack 259 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_FREE(stack, allocator_data); stack 266 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_FREE(stack, allocator_data); stack 269 ext/pcre/pcrelib/sljit/sljitUtils.c stack->base = base.uw; stack 270 ext/pcre/pcrelib/sljit/sljitUtils.c stack->limit = stack->base + limit; stack 271 ext/pcre/pcrelib/sljit/sljitUtils.c stack->max_limit = stack->base + max_limit; stack 273 ext/pcre/pcrelib/sljit/sljitUtils.c stack->top = stack->base; stack 274 ext/pcre/pcrelib/sljit/sljitUtils.c return stack; stack 279 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_free_stack(struct sljit_stack* stack, void *allocator_data) stack 283 ext/pcre/pcrelib/sljit/sljitUtils.c VirtualFree((void*)stack->base, 0, MEM_RELEASE); stack 285 ext/pcre/pcrelib/sljit/sljitUtils.c munmap((void*)stack->base, stack->max_limit - stack->base); stack 287 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_FREE(stack, allocator_data); stack 290 ext/pcre/pcrelib/sljit/sljitUtils.c SLJIT_API_FUNC_ATTRIBUTE sljit_sw SLJIT_CALL sljit_stack_resize(struct sljit_stack* stack, sljit_uw new_limit) stack 295 ext/pcre/pcrelib/sljit/sljitUtils.c if ((new_limit > stack->max_limit) || (new_limit < stack->base)) stack 299 ext/pcre/pcrelib/sljit/sljitUtils.c aligned_old_limit = (stack->limit + sljit_page_align) & ~sljit_page_align; stack 310 ext/pcre/pcrelib/sljit/sljitUtils.c stack->limit = new_limit; stack 313 ext/pcre/pcrelib/sljit/sljitUtils.c if (new_limit >= stack->limit) { stack 314 ext/pcre/pcrelib/sljit/sljitUtils.c stack->limit = new_limit; stack 318 ext/pcre/pcrelib/sljit/sljitUtils.c aligned_old_limit = (stack->limit + sljit_page_align) & ~sljit_page_align; stack 327 ext/pcre/pcrelib/sljit/sljitUtils.c stack->limit = new_limit; stack 2540 ext/standard/array.c *stack, /* Input array */ stack 2546 ext/standard/array.c if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/+", &stack, &args, &argc) == FAILURE) { stack 2554 ext/standard/array.c if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var) == NULL) { stack 2562 ext/standard/array.c RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack))); stack 2570 ext/standard/array.c zval *stack, /* Input stack */ stack 2576 ext/standard/array.c if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/", &stack) == FAILURE) { stack 2581 ext/standard/array.c Z_PARAM_ARRAY_EX(stack, 0, 1) stack 2585 ext/standard/array.c if (zend_hash_num_elements(Z_ARRVAL_P(stack)) == 0) { stack 2590 ext/standard/array.c idx = Z_ARRVAL_P(stack)->nNumUsed; stack 2596 ext/standard/array.c p = Z_ARRVAL_P(stack)->arData + idx; stack 2608 ext/standard/array.c if (!p->key && Z_ARRVAL_P(stack)->nNextFreeElement > 0 && p->h >= (zend_ulong)(Z_ARRVAL_P(stack)->nNextFreeElement - 1)) { stack 2609 ext/standard/array.c Z_ARRVAL_P(stack)->nNextFreeElement = Z_ARRVAL_P(stack)->nNextFreeElement - 1; stack 2614 ext/standard/array.c if (Z_ARRVAL_P(stack) == &EG(symbol_table)) { stack 2617 ext/standard/array.c zend_hash_del(Z_ARRVAL_P(stack), p->key); stack 2620 ext/standard/array.c zend_hash_index_del(Z_ARRVAL_P(stack), p->h); stack 2623 ext/standard/array.c zend_hash_internal_pointer_reset(Z_ARRVAL_P(stack)); stack 2631 ext/standard/array.c zval *stack, /* Input stack */ stack 2637 ext/standard/array.c if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/", &stack) == FAILURE) { stack 2642 ext/standard/array.c Z_PARAM_ARRAY_EX(stack, 0, 1) stack 2646 ext/standard/array.c if (zend_hash_num_elements(Z_ARRVAL_P(stack)) == 0) { stack 2653 ext/standard/array.c if (idx == Z_ARRVAL_P(stack)->nNumUsed) { stack 2656 ext/standard/array.c p = Z_ARRVAL_P(stack)->arData + idx; stack 2671 ext/standard/array.c if (Z_ARRVAL_P(stack) == &EG(symbol_table)) { stack 2674 ext/standard/array.c zend_hash_del(Z_ARRVAL_P(stack), p->key); stack 2677 ext/standard/array.c zend_hash_index_del(Z_ARRVAL_P(stack), p->h); stack 2681 ext/standard/array.c if (Z_ARRVAL_P(stack)->u.flags & HASH_FLAG_PACKED) { stack 2684 ext/standard/array.c if (EXPECTED(Z_ARRVAL_P(stack)->u.v.nIteratorsCount == 0)) { stack 2685 ext/standard/array.c for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) { stack 2686 ext/standard/array.c p = Z_ARRVAL_P(stack)->arData + idx; stack 2689 ext/standard/array.c Bucket *q = Z_ARRVAL_P(stack)->arData + k; stack 2698 ext/standard/array.c uint32_t iter_pos = zend_hash_iterators_lower_pos(Z_ARRVAL_P(stack), 0); stack 2700 ext/standard/array.c for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) { stack 2701 ext/standard/array.c p = Z_ARRVAL_P(stack)->arData + idx; stack 2704 ext/standard/array.c Bucket *q = Z_ARRVAL_P(stack)->arData + k; stack 2710 ext/standard/array.c zend_hash_iterators_update(Z_ARRVAL_P(stack), idx, k); stack 2711 ext/standard/array.c iter_pos = zend_hash_iterators_lower_pos(Z_ARRVAL_P(stack), iter_pos + 1); stack 2717 ext/standard/array.c Z_ARRVAL_P(stack)->nNumUsed = k; stack 2718 ext/standard/array.c Z_ARRVAL_P(stack)->nNextFreeElement = k; stack 2723 ext/standard/array.c for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) { stack 2724 ext/standard/array.c p = Z_ARRVAL_P(stack)->arData + idx; stack 2735 ext/standard/array.c Z_ARRVAL_P(stack)->nNextFreeElement = k; stack 2737 ext/standard/array.c zend_hash_rehash(Z_ARRVAL_P(stack)); stack 2741 ext/standard/array.c zend_hash_internal_pointer_reset(Z_ARRVAL_P(stack)); stack 2750 ext/standard/array.c *stack; /* Input stack */ stack 2757 ext/standard/array.c if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/+", &stack, &args, &argc) == FAILURE) { stack 2761 ext/standard/array.c zend_hash_init(&new_hash, zend_hash_num_elements(Z_ARRVAL_P(stack)) + argc, NULL, ZVAL_PTR_DTOR, 0); stack 2768 ext/standard/array.c if (EXPECTED(Z_ARRVAL_P(stack)->u.v.nIteratorsCount == 0)) { stack 2769 ext/standard/array.c ZEND_HASH_FOREACH_STR_KEY_VAL(Z_ARRVAL_P(stack), key, value) { stack 2779 ext/standard/array.c uint32_t iter_pos = zend_hash_iterators_lower_pos(Z_ARRVAL_P(stack), 0); stack 2781 ext/standard/array.c ZEND_HASH_FOREACH_STR_KEY_VAL(Z_ARRVAL_P(stack), key, value) { stack 2787 ext/standard/array.c old_idx = (Bucket*)value - Z_ARRVAL_P(stack)->arData; stack 2789 ext/standard/array.c zend_hash_iterators_update(Z_ARRVAL_P(stack), old_idx, new_idx); stack 2790 ext/standard/array.c iter_pos = zend_hash_iterators_lower_pos(Z_ARRVAL_P(stack), iter_pos + 1); stack 2797 ext/standard/array.c Z_ARRVAL_P(stack)->u.v.nIteratorsCount = 0; stack 2798 ext/standard/array.c Z_ARRVAL_P(stack)->pDestructor = NULL; stack 2799 ext/standard/array.c zend_hash_destroy(Z_ARRVAL_P(stack)); stack 2801 ext/standard/array.c Z_ARRVAL_P(stack)->u.v.flags = new_hash.u.v.flags; stack 2802 ext/standard/array.c Z_ARRVAL_P(stack)->nTableSize = new_hash.nTableSize; stack 2803 ext/standard/array.c Z_ARRVAL_P(stack)->nTableMask = new_hash.nTableMask; stack 2804 ext/standard/array.c Z_ARRVAL_P(stack)->nNumUsed = new_hash.nNumUsed; stack 2805 ext/standard/array.c Z_ARRVAL_P(stack)->nNumOfElements = new_hash.nNumOfElements; stack 2806 ext/standard/array.c Z_ARRVAL_P(stack)->nNextFreeElement = new_hash.nNextFreeElement; stack 2807 ext/standard/array.c Z_ARRVAL_P(stack)->arData = new_hash.arData; stack 2808 ext/standard/array.c Z_ARRVAL_P(stack)->pDestructor = new_hash.pDestructor; stack 2810 ext/standard/array.c zend_hash_internal_pointer_reset(Z_ARRVAL_P(stack)); stack 2813 ext/standard/array.c RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack))); stack 363 ext/standard/basic_functions.c ZEND_ARG_INFO(1, stack) /* ARRAY_INFO(1, stack, 0) */ stack 368 ext/standard/basic_functions.c ZEND_ARG_INFO(1, stack) /* ARRAY_INFO(1, stack, 0) */ stack 372 ext/standard/basic_functions.c ZEND_ARG_INFO(1, stack) /* ARRAY_INFO(1, stack, 0) */ stack 376 ext/standard/basic_functions.c ZEND_ARG_INFO(1, stack) /* ARRAY_INFO(1, stack, 0) */ stack 69 ext/wddx/wddx.c if (stack->varname) { \ stack 70 ext/wddx/wddx.c ent.varname = estrdup(stack->varname); \ stack 71 ext/wddx/wddx.c efree(stack->varname); \ stack 72 ext/wddx/wddx.c stack->varname = NULL; \ stack 173 ext/wddx/wddx.c static int wddx_stack_init(wddx_stack *stack) stack 175 ext/wddx/wddx.c stack->top = 0; stack 176 ext/wddx/wddx.c stack->elements = (void **) safe_emalloc(sizeof(void **), STACK_BLOCK_SIZE, 0); stack 177 ext/wddx/wddx.c stack->max = STACK_BLOCK_SIZE; stack 178 ext/wddx/wddx.c stack->varname = NULL; stack 179 ext/wddx/wddx.c stack->done = 0; stack 187 ext/wddx/wddx.c static int wddx_stack_push(wddx_stack *stack, void *element, int size) stack 189 ext/wddx/wddx.c if (stack->top >= stack->max) { /* we need to allocate more memory */ stack 190 ext/wddx/wddx.c stack->elements = (void **) erealloc(stack->elements, stack 191 ext/wddx/wddx.c (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE))); stack 193 ext/wddx/wddx.c stack->elements[stack->top] = (void *) emalloc(size); stack 194 ext/wddx/wddx.c memcpy(stack->elements[stack->top], element, size); stack 195 ext/wddx/wddx.c return stack->top++; stack 201 ext/wddx/wddx.c static int wddx_stack_top(wddx_stack *stack, void **element) stack 203 ext/wddx/wddx.c if (stack->top > 0) { stack 204 ext/wddx/wddx.c *element = stack->elements[stack->top - 1]; stack 215 ext/wddx/wddx.c static int wddx_stack_is_empty(wddx_stack *stack) stack 217 ext/wddx/wddx.c if (stack->top == 0) { stack 227 ext/wddx/wddx.c static int wddx_stack_destroy(wddx_stack *stack) stack 231 ext/wddx/wddx.c if (stack->elements) { stack 232 ext/wddx/wddx.c for (i = 0; i < stack->top; i++) { stack 233 ext/wddx/wddx.c zval_ptr_dtor(&((st_entry *)stack->elements[i])->data); stack 234 ext/wddx/wddx.c if (((st_entry *)stack->elements[i])->varname) { stack 235 ext/wddx/wddx.c efree(((st_entry *)stack->elements[i])->varname); stack 237 ext/wddx/wddx.c efree(stack->elements[i]); stack 239 ext/wddx/wddx.c efree(stack->elements); stack 711 ext/wddx/wddx.c wddx_stack *stack = (wddx_stack *)user_data; stack 725 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 731 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 749 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 759 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 770 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 776 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 781 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 787 ext/wddx/wddx.c stack->varname = estrdup((char *)atts[i]); stack 823 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 837 ext/wddx/wddx.c if (wddx_stack_top(stack, (void**)&recordset) == SUCCESS && stack 847 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 853 ext/wddx/wddx.c wddx_stack_push((wddx_stack *)stack, &ent, sizeof(st_entry)); stack 863 ext/wddx/wddx.c wddx_stack *stack = (wddx_stack *)user_data; stack 869 ext/wddx/wddx.c if (stack->top == 0) { stack 878 ext/wddx/wddx.c wddx_stack_top(stack, (void**)&ent1); stack 881 ext/wddx/wddx.c if (stack->top > 1) { stack 882 ext/wddx/wddx.c stack->top--; stack 884 ext/wddx/wddx.c stack->done = 1; stack 909 ext/wddx/wddx.c if (stack->top > 1) { stack 910 ext/wddx/wddx.c stack->top--; stack 911 ext/wddx/wddx.c wddx_stack_top(stack, (void**)&ent2); stack 973 ext/wddx/wddx.c stack->done = 1; stack 975 ext/wddx/wddx.c } else if (!strcmp((char *)name, EL_VAR) && stack->varname) { stack 976 ext/wddx/wddx.c efree(stack->varname); stack 977 ext/wddx/wddx.c stack->varname = NULL; stack 980 ext/wddx/wddx.c wddx_stack_top(stack, (void **)&ent); stack 982 ext/wddx/wddx.c stack->top--; stack 992 ext/wddx/wddx.c wddx_stack *stack = (wddx_stack *)user_data; stack 994 ext/wddx/wddx.c if (!wddx_stack_is_empty(stack) && !stack->done) { stack 995 ext/wddx/wddx.c wddx_stack_top(stack, (void**)&ent); stack 1054 ext/wddx/wddx.c wddx_stack stack; stack 1059 ext/wddx/wddx.c wddx_stack_init(&stack); stack 1062 ext/wddx/wddx.c XML_SetUserData(parser, &stack); stack 1071 ext/wddx/wddx.c if (stack.top == 1) { stack 1072 ext/wddx/wddx.c wddx_stack_top(&stack, (void**)&ent); stack 1079 ext/wddx/wddx.c wddx_stack_destroy(&stack); stack 421 main/alloca.c long size, pseg, this_segment, stack; stack 139 sapi/phpdbg/phpdbg.h int phpdbg_do_parse(phpdbg_param_t *stack, char *input); stack 375 sapi/phpdbg/phpdbg_cmd.c PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack) { stack 376 sapi/phpdbg/phpdbg_cmd.c if (stack && stack->next) { stack 377 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *remove = stack->next; stack 430 sapi/phpdbg/phpdbg_cmd.c stack->next = NULL; stack 434 sapi/phpdbg/phpdbg_cmd.c PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param) { stack 445 sapi/phpdbg/phpdbg_cmd.c if (stack->top == NULL) { stack 446 sapi/phpdbg/phpdbg_cmd.c stack->top = next; stack 448 sapi/phpdbg/phpdbg_cmd.c stack->next = next; stack 450 sapi/phpdbg/phpdbg_cmd.c stack->top->next = next; stack 451 sapi/phpdbg/phpdbg_cmd.c next->top = stack->top; stack 452 sapi/phpdbg/phpdbg_cmd.c stack->top = next; stack 455 sapi/phpdbg/phpdbg_cmd.c stack->len++; stack 460 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *stack = calloc(1, sizeof(phpdbg_param_t)); stack 462 sapi/phpdbg/phpdbg_cmd.c stack->type = STACK_PARAM; stack 463 sapi/phpdbg/phpdbg_cmd.c stack->next = param->next; stack 464 sapi/phpdbg/phpdbg_cmd.c param->next = stack; stack 465 sapi/phpdbg/phpdbg_cmd.c stack->top = param->top; stack 468 sapi/phpdbg/phpdbg_cmd.c PHPDBG_API int phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack) { stack 471 sapi/phpdbg/phpdbg_cmd.c const phpdbg_param_t *top = (stack != NULL) ? *stack : NULL; stack 664 sapi/phpdbg/phpdbg_cmd.c static int phpdbg_internal_stack_execute(phpdbg_param_t *stack, zend_bool allow_async_unsafe) { stack 666 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *top = (phpdbg_param_t *) stack->next; stack 717 sapi/phpdbg/phpdbg_cmd.c PHPDBG_API int phpdbg_stack_execute(phpdbg_param_t *stack, zend_bool allow_async_unsafe) { stack 718 sapi/phpdbg/phpdbg_cmd.c phpdbg_param_t *top = stack; stack 720 sapi/phpdbg/phpdbg_cmd.c if (stack->type != STACK_PARAM) { stack 725 sapi/phpdbg/phpdbg_cmd.c if (!stack->len) { stack 139 sapi/phpdbg/phpdbg_cmd.h PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param); stack 142 sapi/phpdbg/phpdbg_cmd.h PHPDBG_API int phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack); stack 143 sapi/phpdbg/phpdbg_cmd.h PHPDBG_API int phpdbg_stack_execute(phpdbg_param_t *stack, zend_bool allow_async_unsafe); stack 144 sapi/phpdbg/phpdbg_cmd.h PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack); stack 33 sapi/phpdbg/phpdbg_lexer.c void phpdbg_init_lexer (phpdbg_param_t *stack, char *input) { stack 34 sapi/phpdbg/phpdbg_lexer.c PHPDBG_G(parser_stack) = stack; stack 38 sapi/phpdbg/phpdbg_lexer.h void phpdbg_init_lexer (phpdbg_param_t *stack, char *input); stack 192 sapi/phpdbg/phpdbg_parser.y int phpdbg_do_parse(phpdbg_param_t *stack, char *input) { stack 197 sapi/phpdbg/phpdbg_parser.y phpdbg_init_lexer(stack, input); stack 38 sapi/phpdbg/phpdbg_print.c PHPDBG_PRINT_COMMAND_D(stack, "print out the instructions in the current stack", 's', print_stack, NULL, 0, PHPDBG_ASYNC_SAFE), stack 124 sapi/phpdbg/phpdbg_print.c PHPDBG_PRINT(stack) /* {{{ */ stack 36 sapi/phpdbg/phpdbg_print.h PHPDBG_PRINT(stack); stack 100 sapi/phpdbg/phpdbg_prompt.c static inline int phpdbg_call_register(phpdbg_param_t *stack) /* {{{ */ stack 104 sapi/phpdbg/phpdbg_prompt.c if (stack->type == STACK_PARAM) { stack 107 sapi/phpdbg/phpdbg_prompt.c name = stack->next; stack 265 sapi/phpdbg/phpdbg_prompt.c phpdbg_param_t stack; stack 267 sapi/phpdbg/phpdbg_prompt.c phpdbg_init_param(&stack, STACK_PARAM); stack 271 sapi/phpdbg/phpdbg_prompt.c if (phpdbg_do_parse(&stack, input) <= 0) { stack 272 sapi/phpdbg/phpdbg_prompt.c switch (phpdbg_stack_execute(&stack, 1 /* allow_async_unsafe == 1 */)) { stack 275 sapi/phpdbg/phpdbg_prompt.c if (phpdbg_call_register(&stack) == FAILURE) { stack 289 sapi/phpdbg/phpdbg_prompt.c phpdbg_stack_free(&stack); stack 1347 sapi/phpdbg/phpdbg_prompt.c phpdbg_param_t stack; stack 1361 sapi/phpdbg/phpdbg_prompt.c phpdbg_init_param(&stack, STACK_PARAM); stack 1363 sapi/phpdbg/phpdbg_prompt.c if (phpdbg_do_parse(&stack, input) <= 0) { stack 1367 sapi/phpdbg/phpdbg_prompt.c #define PARA ((phpdbg_param_t *)stack.next)->type stack 1372 sapi/phpdbg/phpdbg_prompt.c switch (ret = phpdbg_stack_execute(&stack, allow_async_unsafe)) { stack 1375 sapi/phpdbg/phpdbg_prompt.c if (!allow_async_unsafe || phpdbg_call_register(&stack) == FAILURE) { stack 1404 sapi/phpdbg/phpdbg_prompt.c phpdbg_stack_free(&stack); stack 1411 sapi/phpdbg/phpdbg_prompt.c phpdbg_stack_free(&stack);