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/pcre/pcrelib/sljit/
H A DsljitUtils.c205 struct sljit_stack *stack; local
235 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack));
236 if (!stack)
242 SLJIT_FREE(stack);
245 stack->base = base.uw;
246 stack->limit = stack->base;
247 stack->max_limit = stack->base + max_limit;
248 if (sljit_stack_resize(stack, stac
278 sljit_free_stack(struct sljit_stack* stack) argument
288 sljit_stack_resize(struct sljit_stack* stack, sljit_uw new_limit) argument
[all...]
/PHP_TRUNK/ext/gd/libgd/
H A Dgd.c1849 /* max depth of stack */
1852 if (sp<stack+FILL_MAX && Y+(DY)>=0 && Y+(DY)<wy2) \
1868 /* stack of filled segments */
1869 /* struct seg stack[FILL_MAX],*sp = stack;; */
1870 struct seg *stack = NULL; local
1911 stack = (struct seg *)safe_emalloc(sizeof(struct seg), ((int)(im->sy*im->sx)/4), 1);
1912 sp = stack;
1918 while (sp>stack) {
1949 efree(stack);
1961 struct seg *stack; local
[all...]
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)
/PHP_TRUNK/sapi/phpdbg/
H A Dphpdbg_lexer.c32 void phpdbg_init_lexer (phpdbg_param_t *stack, char *input) { argument
33 PHPDBG_G(parser_stack) = stack;
H A Dphpdbg_parser.c304 /* The OS might guarantee only one guard page at the bottom of the stack,
307 to allow for a few compiler-allocated temporary stack slots. */
346 /* A type that is properly aligned for any stack member. */
353 /* The size of the maximum gap between one aligned stack and the next. */
382 elements in the stack, and YYPTR gives the new location of the
383 stack. Advance YYPTR to a properly aligned location for the next
384 stack. */
775 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
824 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
860 if the built-in stack extensio
1866 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;
422 stack->next = NULL;
426 PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param) { argument
436 if (stack->top == NULL) {
437 stack->top = next;
439 stack
449 phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack) argument
640 phpdbg_stack_execute(phpdbg_param_t *stack, zend_bool allow_async_unsafe) argument
[all...]
H A Dphpdbg_print.h36 PHPDBG_PRINT(stack); variable
H A Dphpdbg_prompt.c74 PHPDBG_COMMAND_D(finish, "continue past the end of the stack", 'F', NULL, 0, 0),
75 PHPDBG_COMMAND_D(leave, "continue until the end of the stack", 'L', NULL, 0, 0),
97 static inline int phpdbg_call_register(phpdbg_param_t *stack) /* {{{ */ argument
101 if (stack->type == STACK_PARAM) {
104 name = stack->next;
261 phpdbg_param_t stack; local
263 phpdbg_init_param(&stack, STACK_PARAM);
267 if (phpdbg_do_parse(&stack, input) <= 0) {
268 switch (phpdbg_stack_execute(&stack, 1 /* allow_async_unsafe == 1 */)) {
271 if (phpdbg_call_register(&stack)
1244 phpdbg_param_t 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.h36 /* The separate stack used by generator */
37 zend_vm_stack stack; member in struct:_zend_generator
H A Dzend_execute.c156 EG(vm_stack) = zend_vm_stack_new_page(ZEND_VM_STACK_PAGE_SIZE(0 /* main stack */), NULL);
164 zend_vm_stack stack = EG(vm_stack); local
166 while (stack != NULL) {
167 zend_vm_stack p = stack->prev;
168 efree(stack);
169 stack = p;
175 zend_vm_stack stack; local
178 stack = EG(vm_stack);
179 stack->top = EG(vm_stack_top);
180 EG(vm_stack) = stack
[all...]
/PHP_TRUNK/ext/pcre/pcrelib/
H A Dpcre_jit_compile.c75 /* Allocate memory for the regex stack on the real machine stack.
79 /* Growth rate for stack allocated by the OS. Should be the multiply
122 '(' matching path (pushing arguments to the stack)
124 ')' matching path (pushing arguments to the stack)
137 code paths. In this way the topmost value on the stack is always belong
140 the matching path eventually. Otherwise it needs to clear out its own stack
145 Saved stack frames:
152 The stack frames are stored in a chain list, and have the following format:
155 Thus we can restore the private data to a particular point in the stack
160 struct sljit_stack *stack; member in struct:jit_arguments
7479 int stack; /* Also contains the offset of control head. */ local
10453 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
10588 pcre_jit_stack_free(pcre_jit_stack *stack) argument
10659 pcre_jit_stack_free(pcre_jit_stack *stack) argument
[all...]
/PHP_TRUNK/ext/mbstring/
H A Dmbstring.c3553 zval *args, *stack, *var, *hash_entry, *hash_entry_ptr, *zfrom_enc; local
3605 stack = (zval *)safe_emalloc(stack_max, sizeof(zval), 0);
3623 var = &stack[stack_level];
3637 ptmp = erealloc(stack, sizeof(zval) * stack_max);
3638 stack = (zval *)ptmp;
3640 ZVAL_COPY_VALUE(&stack[stack_level], var);
3669 efree(stack);
3694 stack = (zval*)safe_emalloc(stack_max, sizeof(zval), 0);
3710 var = &stack[stack_level];
3725 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
713 wddx_stack *stack = (wddx_stack *)user_data; local
865 wddx_stack *stack = (wddx_stack *)user_data; local
983 wddx_stack *stack = (wddx_stack *)user_data; local
1045 wddx_stack stack; local
[all...]
/PHP_TRUNK/ext/standard/
H A Darray.c2113 /* {{{ proto int array_push(array stack, mixed var [, mixed ...])
2118 *stack, /* Input array */ local
2124 if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/+", &stack, &args, &argc) == FAILURE) {
2132 if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var) == NULL) {
2139 /* Clean up and return the number of values in the stack */
2140 RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack)));
2144 /* {{{ proto mixed array_pop(array stack)
2148 zval *stack, /* Input stack */ local
2154 if (zend_parse_parameters(ZEND_NUM_ARGS(), "a/", &stack)
2209 zval *stack, /* Input stack */ local
2328 *stack; /* Input stack */ local
[all...]

Completed in 64 milliseconds