Searched defs:stack (Results 1 - 20 of 20) sorted by relevance

/PHP_5_6/main/
H A Dalloca.c5 which is used to allocate space off the run-time stack so
16 that are found to be deeper in the stack than the current
62 /* If your stack is a linked list of frames, you have to
82 /* Define STACK_DIRECTION if you know the direction of stack
107 auto char dummy; /* To get stack address. */
129 (b) keep track of stack depth.
144 char *deep; /* For stack depth measure. */
153 was supposed to be taken from the current stack frame of the
161 auto char probe; /* Probes stack depth: */
170 was allocated from deeper in the stack tha
421 long size, pseg, this_segment, stack; local
[all...]
/PHP_5_6/ext/json/
H A DJSON_parser.h17 int* stack; member in struct:JSON_parser_struct
/PHP_5_6/sapi/phpdbg/
H A Dphpdbg_lexer.c31 void phpdbg_init_lexer (phpdbg_param_t *stack, char *input TSRMLS_DC) { argument
32 PHPDBG_G(parser_stack) = stack;
H A Dphpdbg_parser.c347 /* The OS might guarantee only one guard page at the bottom of the stack,
350 to allow for a few compiler-allocated temporary stack slots. */
389 /* A type that is properly aligned for any stack member. */
396 /* The size of the maximum gap between one aligned stack and the next. */
409 elements in the stack, and YYPTR gives the new location of the
410 stack. Advance YYPTR to a properly aligned location for the next
411 stack. */
795 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
845 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
881 if the built-in stack extensio
1896 phpdbg_do_parse(phpdbg_param_t *stack, char *input TSRMLS_DC) argument
[all...]
H A Dphpdbg_cmd.c50 return "stack";
394 PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack) { argument
395 if (stack && stack->next) {
396 phpdbg_param_t *remove = stack->next;
440 stack->next = NULL;
444 PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param) { argument
454 if (stack->top == NULL) {
455 stack->top = next;
457 stack
467 phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack, char **why TSRMLS_DC) argument
671 phpdbg_stack_execute(phpdbg_param_t *stack, char **why TSRMLS_DC) argument
[all...]
H A Dphpdbg_print.h36 PHPDBG_PRINT(stack); variable
H A Dphpdbg_prompt.c49 PHPDBG_COMMAND_D(finish, "continue past the end of the stack", 'F', NULL, 0),
50 PHPDBG_COMMAND_D(leave, "continue until the end of the stack", 'L', NULL, 0),
72 static inline int phpdbg_call_register(phpdbg_param_t *stack TSRMLS_DC) /* {{{ */
76 if (stack->type == STACK_PARAM) {
77 name = stack->next;
248 phpdbg_param_t stack; local
250 phpdbg_init_param(&stack, STACK_PARAM);
252 if (phpdbg_do_parse(&stack, input TSRMLS_CC) <= 0) {
253 switch (phpdbg_stack_execute(&stack, &why TSRMLS_CC)) {
256 if (phpdbg_call_register(&stack TSRMLS_C
999 phpdbg_param_t stack; local
[all...]
/PHP_5_6/ext/gd/libgd/
H A Dgd_gif_in.c89 int stack[STACK_SIZE], *sp; member in struct:__anon2
451 sd->sp = sd->stack;
463 if (sd->sp > sd->stack)
477 sd->sp = sd->stack;
497 if (sd->sp == (sd->stack + STACK_SIZE)) {
508 if (sd->sp == (sd->stack + STACK_SIZE)) {
534 if (sd->sp > sd->stack)
H A Dgd.c1851 /* max depth of stack */
1854 if (sp<stack+FILL_MAX && Y+(DY)>=0 && Y+(DY)<wy2) \
1870 /* stack of filled segments */
1871 /* struct seg stack[FILL_MAX],*sp = stack;; */
1872 struct seg *stack = NULL; local
1913 stack = (struct seg *)safe_emalloc(sizeof(struct seg), ((int)(im->sy*im->sx)/4), 1);
1914 sp = stack;
1920 while (sp>stack) {
1951 efree(stack);
1963 struct seg *stack; local
[all...]
/PHP_5_6/Zend/
H A Dzend_execute.h175 #define ZEND_VM_STACK_ELEMETS(stack) \
176 ((void**)(((char*)(stack)) + ZEND_MM_ALIGNED_SIZE(sizeof(struct _zend_vm_stack))))
202 zend_vm_stack stack = EG(argument_stack); local
204 while (stack != NULL) {
205 zend_vm_stack p = stack->prev;
206 efree(stack);
207 stack = p;
252 /* store old top on the stack */
H A Dzend_ptr_stack.c28 ZEND_API void zend_ptr_stack_init_ex(zend_ptr_stack *stack, zend_bool persistent) argument
30 stack->top_element = stack->elements = NULL;
31 stack->top = stack->max = 0;
32 stack->persistent = persistent;
35 ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack) argument
37 zend_ptr_stack_init_ex(stack, 0);
41 ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...) argument
46 ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, coun
59 zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...) argument
76 zend_ptr_stack_destroy(zend_ptr_stack *stack) argument
84 zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *)) argument
94 zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements) argument
109 zend_ptr_stack_num_elements(zend_ptr_stack *stack) argument
[all...]
H A Dzend_ptr_stack.h36 ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack);
37 ZEND_API void zend_ptr_stack_init_ex(zend_ptr_stack *stack, zend_bool persistent);
38 ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...);
39 ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...);
40 ZEND_API void zend_ptr_stack_destroy(zend_ptr_stack *stack);
41 ZEND_API void zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *));
42 ZEND_API void zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements);
43 ZEND_API int zend_ptr_stack_num_elements(zend_ptr_stack *stack);
46 #define ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count) \
47 if (stack
58 zend_ptr_stack_3_push(zend_ptr_stack *stack, void *a, void *b, void *c) argument
72 zend_ptr_stack_2_push(zend_ptr_stack *stack, void *a, void *b) argument
85 zend_ptr_stack_3_pop(zend_ptr_stack *stack, void **a, void **b, void **c) argument
93 zend_ptr_stack_2_pop(zend_ptr_stack *stack, void **a, void **b) argument
100 zend_ptr_stack_push(zend_ptr_stack *stack, void *ptr) argument
108 zend_ptr_stack_pop(zend_ptr_stack *stack) argument
114 zend_ptr_stack_top(zend_ptr_stack *stack) argument
[all...]
H A Dzend_stack.c25 ZEND_API int zend_stack_init(zend_stack *stack) argument
27 stack->top = 0;
28 stack->max = 0;
29 stack->elements = NULL;
33 ZEND_API int zend_stack_push(zend_stack *stack, const void *element, int size) argument
35 if (stack->top >= stack->max) { /* we need to allocate more memory */
36 stack->elements = (void **) erealloc(stack->elements,
37 (sizeof(void **) * (stack
48 zend_stack_top(const zend_stack *stack, void **element) argument
60 zend_stack_del_top(zend_stack *stack) argument
69 zend_stack_int_top(const zend_stack *stack) argument
81 zend_stack_is_empty(const zend_stack *stack) argument
91 zend_stack_destroy(zend_stack *stack) argument
107 zend_stack_base(const zend_stack *stack) argument
113 zend_stack_count(const zend_stack *stack) argument
119 zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element)) argument
142 zend_stack_apply_with_argument(zend_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg) argument
[all...]
H A Dzend_generators.h44 /* The separate stack used by generator */
45 zend_vm_stack stack; member in struct:_zend_generator
/PHP_5_6/ext/mbstring/
H A Dmbstring.c3516 zval ***args, ***stack, **var, **hash_entry, **zfrom_enc; local
3567 stack = (zval ***)safe_emalloc(stack_max, sizeof(zval **), 0);
3583 var = stack[stack_level];
3593 ptmp = erealloc(stack, sizeof(zval **)*stack_max);
3594 stack = (zval ***)ptmp;
3596 stack[stack_level] = var;
3625 efree(stack);
3650 stack = (zval ***)safe_emalloc(stack_max, sizeof(zval **), 0);
3664 var = stack[stack_level];
3674 ptmp = erealloc(stack, sizeo
[all...]
/PHP_5_6/ext/standard/
H A Darray.c1821 /* {{{ proto int array_push(array stack, mixed var [, mixed ...])
1826 *stack, /* Input array */ local
1832 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a+", &stack, &args, &argc) == FAILURE) {
1841 if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var, sizeof(zval *), NULL) == FAILURE) {
1849 /* Clean up and return the number of values in the stack */
1851 RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack)));
1858 zval *stack, /* Input stack */ local
1864 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a", &stack) == FAILURE) {
1868 if (zend_hash_num_elements(Z_ARRVAL_P(stack))
1921 *stack; /* Input stack */ local
[all...]
/PHP_5_6/sapi/apache_hooks/
H A Dmod_php5.c107 /* {{{ zend stack utility functions
115 int sapi_stack_init_ex(sapi_stack *stack, int persistent) argument
117 stack->top = 0;
118 stack->persistent = persistent;
119 stack->elements = (void **) pemalloc(sizeof(void **) * STACK_BLOCK_SIZE, persistent);
120 if (!stack->elements) {
123 stack->max = STACK_BLOCK_SIZE;
127 int sapi_stack_push(sapi_stack *stack, void *element) argument
129 if (stack->top >= stack
139 sapi_stack_pop(sapi_stack *stack) argument
148 sapi_stack_destroy(sapi_stack *stack) argument
153 sapi_stack_apply_with_argument_all(sapi_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg) argument
173 sapi_stack_apply_with_argument_stop_if_equals(sapi_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg, int stopval) argument
196 sapi_stack_apply_with_argument_stop_if_http_error(sapi_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg) argument
219 php_handler_stack_destroy(sapi_stack *stack) argument
[all...]
/PHP_5_6/ext/wddx/
H A Dwddx.c69 if (stack->varname) { \
70 ent.varname = estrdup(stack->varname); \
71 efree(stack->varname); \
72 stack->varname = NULL; \
173 static int wddx_stack_init(wddx_stack *stack) argument
175 stack->top = 0;
176 stack->elements = (void **) safe_emalloc(sizeof(void **), STACK_BLOCK_SIZE, 0);
177 stack->max = STACK_BLOCK_SIZE;
178 stack->varname = NULL;
179 stack
187 wddx_stack_push(wddx_stack *stack, void *element, int size) argument
201 wddx_stack_top(wddx_stack *stack, void **element) argument
215 wddx_stack_is_empty(wddx_stack *stack) argument
227 wddx_stack_destroy(wddx_stack *stack) argument
737 wddx_stack *stack = (wddx_stack *)user_data; local
915 wddx_stack *stack = (wddx_stack *)user_data; local
1043 wddx_stack *stack = (wddx_stack *)user_data; local
1124 wddx_stack stack; local
[all...]
/PHP_5_6/ext/pcre/pcrelib/
H A Dpcre_jit_compile.c77 /* Allocate memory for the regex stack on the real machine stack.
81 /* Growth rate for stack allocated by the OS. Should be the multiply
124 '(' matching path (pushing arguments to the stack)
126 ')' matching path (pushing arguments to the stack)
139 code paths. In this way the topmost value on the stack is always belong
142 the matching path eventually. Otherwise it needs to clear out its own stack
147 Saved stack frames:
154 The stack frames are stored in a chain list, and have the following format:
157 Thus we can restore the private data to a particular point in the stack
162 struct sljit_stack *stack; member in struct:jit_arguments
7498 int stack; /* Also contains the offset of control head. */ local
10442 pcre_jit_exec(const pcre *argument_re, const pcre_extra *extra_data, PCRE_SPTR subject, int length, int start_offset, int options, int *offsets, int offset_count, pcre_jit_stack *stack) argument
10576 pcre_jit_stack_free(pcre_jit_stack *stack) argument
10647 pcre_jit_stack_free(pcre_jit_stack *stack) argument
[all...]
/PHP_5_6/ext/pcre/pcrelib/sljit/
H A DsljitUtils.c205 struct sljit_stack *stack; local
236 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data);
237 if (!stack)
243 SLJIT_FREE(stack, allocator_data);
246 stack->base = base.uw;
247 stack->limit = stack->base;
248 stack->max_limit = stack->base + max_limit;
249 if (sljit_stack_resize(stack, stac
279 sljit_free_stack(struct sljit_stack* stack, void *allocator_data) argument
290 sljit_stack_resize(struct sljit_stack* stack, sljit_uw new_limit) argument
[all...]

Completed in 61 milliseconds