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

/PHP_TRUNK/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_TRUNK/ext/gd/libgd/
H A Dgd_gif_in.c89 int stack[STACK_SIZE], *sp; member in struct:__anon76
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.c1853 /* max depth of stack */
1856 if (sp<stack+FILL_MAX && Y+(DY)>=0 && Y+(DY)<wy2) \
1872 /* stack of filled segments */
1873 /* struct seg stack[FILL_MAX],*sp = stack;; */
1874 struct seg *stack = NULL; local
1915 stack = (struct seg *)safe_emalloc(sizeof(struct seg), ((int)(im->sy*im->sx)/4), 1);
1916 sp = stack;
1922 while (sp>stack) {
1953 efree(stack);
1965 struct seg *stack; local
[all...]
/PHP_TRUNK/Zend/
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 #define ZEND_STACK_ELEMENT(stack, n) ((void *)((char *) (stack)->elements + (stack)->size * (n)))
27 ZEND_API int zend_stack_init(zend_stack *stack, int size) argument
29 stack->size = size;
30 stack->top = 0;
31 stack->max = 0;
32 stack->elements = NULL;
36 ZEND_API int zend_stack_push(zend_stack *stack, const void *element) argument
39 if (stack
48 zend_stack_top(const zend_stack *stack) argument
58 zend_stack_del_top(zend_stack *stack) argument
65 zend_stack_int_top(const zend_stack *stack) argument
76 zend_stack_is_empty(const zend_stack *stack) argument
82 zend_stack_destroy(zend_stack *stack) argument
93 zend_stack_base(const zend_stack *stack) argument
99 zend_stack_count(const zend_stack *stack) argument
105 zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element)) argument
128 zend_stack_apply_with_argument(zend_stack *stack, int type, int (*apply_function)(void *element, void *arg), void *arg) argument
150 zend_stack_clean(zend_stack *stack, void (*func)(void *), zend_bool free_elements) argument
[all...]
H A Dzend_generators.h35 * The root of the tree is then the currently executed Generator. The subnodes of the tree (all except the root node) are all Generators which do `yield from`. Each node of the tree knows a pointer to one leaf descendant node. Each node with multiple children needs a list of all leaf descendant nodes paired with pointers to their respective child node. (The stack is determined by leaf node pointers) Nodes with only one child just don't need a list, there it is enough to just have a pointer to the child node. Further, leaf nodes store a pointer to the root node.
65 /* The separate stack used by generator */
66 zend_vm_stack stack; member in struct:_zend_generator
H A Dzend_execute.c158 EG(vm_stack) = zend_vm_stack_new_page(ZEND_VM_STACK_PAGE_SIZE(0 /* main stack */), NULL);
166 zend_vm_stack stack = EG(vm_stack); local
168 while (stack != NULL) {
169 zend_vm_stack p = stack->prev;
170 efree(stack);
171 stack = p;
177 zend_vm_stack stack; local
180 stack = EG(vm_stack);
181 stack->top = EG(vm_stack_top);
182 EG(vm_stack) = stack
[all...]
/PHP_TRUNK/sapi/phpdbg/
H A Dphpdbg_print.h36 PHPDBG_PRINT(stack); variable
H A Dphpdbg_lexer.c33 void phpdbg_init_lexer (phpdbg_param_t *stack, char *input) { argument
34 PHPDBG_G(parser_stack) = stack;
H A Dphpdbg_parser.c354 /* The OS might guarantee only one guard page at the bottom of the stack,
357 to allow for a few compiler-allocated temporary stack slots. */
396 /* A type that is properly aligned for any stack member. */
403 /* The size of the maximum gap between one aligned stack and the next. */
416 elements in the stack, and YYPTR gives the new location of the
417 stack. Advance YYPTR to a properly aligned location for the next
418 stack. */
804 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
853 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
889 if the built-in stack extensio
1914 phpdbg_do_parse(phpdbg_param_t *stack, char *input) argument
[all...]
H A Dphpdbg_cmd.c51 return "stack";
375 PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack) { argument
376 if (stack && stack->next) {
377 phpdbg_param_t *remove = stack->next;
430 stack->next = NULL;
434 PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param) { argument
444 if (stack->top == NULL) {
445 stack->top = next;
447 stack
457 phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack) argument
648 phpdbg_stack_execute(phpdbg_param_t *stack, zend_bool allow_async_unsafe) argument
[all...]
H A Dphpdbg_prompt.c76 PHPDBG_COMMAND_D(finish, "continue past the end of the stack", 'F', NULL, 0, 0),
77 PHPDBG_COMMAND_D(leave, "continue until the end of the stack", 'L', NULL, 0, 0),
100 static inline int phpdbg_call_register(phpdbg_param_t *stack) /* {{{ */ argument
104 if (stack->type == STACK_PARAM) {
107 name = stack->next;
264 phpdbg_param_t stack; local
266 phpdbg_init_param(&stack, STACK_PARAM);
270 if (phpdbg_do_parse(&stack, input) <= 0) {
271 switch (phpdbg_stack_execute(&stack, 1 /* allow_async_unsafe == 1 */)) {
274 if (phpdbg_call_register(&stack)
1326 phpdbg_param_t stack; local
[all...]
/PHP_TRUNK/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_TRUNK/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...]
/PHP_TRUNK/ext/mbstring/
H A Dmbstring.c3555 zval *args, *stack, *var, *hash_entry, *hash_entry_ptr, *zfrom_enc; local
3607 stack = (zval *)safe_emalloc(stack_max, sizeof(zval), 0);
3625 var = &stack[stack_level];
3639 ptmp = erealloc(stack, sizeof(zval) * stack_max);
3640 stack = (zval *)ptmp;
3642 ZVAL_COPY_VALUE(&stack[stack_level], var);
3671 efree(stack);
3696 stack = (zval*)safe_emalloc(stack_max, sizeof(zval), 0);
3712 var = &stack[stack_level];
3727 ptmp = erealloc(stack, sizeo
[all...]
/PHP_TRUNK/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
707 wddx_stack *stack = (wddx_stack *)user_data; local
859 wddx_stack *stack = (wddx_stack *)user_data; local
976 wddx_stack *stack = (wddx_stack *)user_data; local
1038 wddx_stack stack; local
[all...]
/PHP_TRUNK/ext/standard/
H A Darray.c2082 /* {{{ proto int array_push(array stack, mixed var [, mixed ...])
2087 *stack, /* Input array */ local
2093 if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/+", &stack, &args, &argc) == FAILURE) {
2101 if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var) == NULL) {
2108 /* Clean up and return the number of values in the stack */
2109 RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack)));
2113 /* {{{ proto mixed array_pop(array stack)
2117 zval *stack, /* Input stack */ local
2123 if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/", &stack)
2178 zval *stack, /* Input stack */ local
2297 *stack; /* Input stack */ local
[all...]

Completed in 45 milliseconds