Searched refs:stack (Results 1 - 25 of 30) sorted by relevance

12

/PHP_TRUNK/ext/spl/internal/
H A Dsplstack.inc13 * @brief Implementation of a stack through a DoublyLinkedList. As SplStack
15 * though they don't make much sense for a stack.
19 * stack implemented using a doubly linked list (DLL).
34 * @note The iteration's direction is not modifiable for stack instances
/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.c87 int stack[STACK_SIZE], *sp; member in struct:__anon133
444 sd->sp = sd->stack;
456 if (sd->sp > sd->stack)
470 sd->sp = sd->stack;
490 if (sd->sp == (sd->stack + STACK_SIZE)) {
501 if (sd->sp == (sd->stack + STACK_SIZE)) {
527 if (sd->sp > sd->stack)
/PHP_TRUNK/ext/json/
H A DJSON_parser.c188 These modes can be pushed on the stack.
199 Push a mode onto the stack. Return false if there is overflow.
209 jp->stack[jp->top] = mode;
215 Pop the stack, assuring that the current mode matches the expectation.
221 if (jp->top < 0 || jp->stack[jp->top] != mode) {
249 jp->stack = (int*)ecalloc(depth, sizeof(int));
265 efree((void*)jp->stack);
396 int up_mode = jp->stack[up];
436 machine with a stack.
545 if (type != -1 && jp->stack[j
[all...]
H A DJSON_parser.h17 int* stack; member in struct:JSON_parser_struct
/PHP_TRUNK/Zend/
H A Dzend_generators.h44 /* The separate stack used by generator */
45 zend_vm_stack stack; member in struct:_zend_generator
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_stack.h34 ZEND_API int zend_stack_init(zend_stack *stack);
35 ZEND_API int zend_stack_push(zend_stack *stack, const void *element, int size);
36 ZEND_API int zend_stack_top(const zend_stack *stack, void **element);
37 ZEND_API int zend_stack_del_top(zend_stack *stack);
38 ZEND_API int zend_stack_int_top(const zend_stack *stack);
39 ZEND_API int zend_stack_is_empty(const zend_stack *stack);
40 ZEND_API int zend_stack_destroy(zend_stack *stack);
41 ZEND_API void **zend_stack_base(const zend_stack *stack);
42 ZEND_API int zend_stack_count(const zend_stack *stack);
43 ZEND_API void zend_stack_apply(zend_stack *stack, in
[all...]
H A Dzend_execute.h173 #define ZEND_VM_STACK_ELEMETS(stack) \
174 ((void**)(((char*)(stack)) + ZEND_MM_ALIGNED_SIZE(sizeof(struct _zend_vm_stack))))
200 zend_vm_stack stack = EG(argument_stack); local
202 while (stack != NULL) {
203 zend_vm_stack p = stack->prev;
204 efree(stack);
205 stack = p;
250 /* store old top on the stack */
H A Dzend.c1003 #define SAVE_STACK(stack) do { \
1004 if (CG(stack).top) { \
1005 memcpy(&stack, &CG(stack), sizeof(zend_stack)); \
1006 CG(stack).top = CG(stack).max = 0; \
1007 CG(stack).elements = NULL; \
1009 stack.top = 0; \
1013 #define RESTORE_STACK(stack) do { \
1014 if (stack
[all...]
H A Dzend_generators.c78 /* Clear any backed up stack arguments */
80 void **ptr = generator->stack->top - 1;
126 * up the stack may not be safe in this case. */
132 /* We have added an additional stack frame in prev_execute_data, so we
162 efree(generator->stack);
314 generator->stack = EG(argument_stack);
367 EG(argument_stack) = generator->stack;
371 * The first prev_execute_data contains an additional stack frame,
/PHP_TRUNK/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_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
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_TRUNK/sapi/phpdbg/
H A Dphpdbg_cmd.h119 * 1) the lexer/parser creates a stack of commands and arguments from input
120 * 2) the commands at the top of the stack are resolved sensibly using aliases, abbreviations and case insensitive matching
121 * 3) the remaining arguments in the stack are verified (optionally) against the handlers declared argument specification
122 * 4) the handler is called passing the top of the stack as the only parameter
123 * 5) the stack is destroyed upon return from the handler
135 PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param);
137 PHPDBG_API int phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack, char **why TSRMLS_DC);
138 PHPDBG_API int phpdbg_stack_execute(phpdbg_param_t *stack, char **why TSRMLS_DC);
139 PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack);
H A Dphpdbg_print.c38 PHPDBG_PRINT_COMMAND_D(stack, "print out the instructions in the current stack", 's', print_stack, NULL, 0),
127 PHPDBG_PRINT(stack) /* {{{ */
H A Dphpdbg_print.h36 PHPDBG_PRINT(stack); variable
H A Dphpdbg_lexer.h37 void phpdbg_init_lexer (phpdbg_param_t *stack, char *input TSRMLS_DC);
H A Dphpdbg.h81 int phpdbg_do_parse(phpdbg_param_t *stack, char *input TSRMLS_DC);
186 phpdbg_param_t *parser_stack; /* param stack during lexer / parser phase */
H A Dphpdbg_cmd.c50 return "stack";
467 PHPDBG_API void phpdbg_stack_free(phpdbg_param_t *stack) { argument
468 if (stack && stack->next) {
469 phpdbg_param_t *remove = stack->next;
513 stack->next = NULL;
517 PHPDBG_API void phpdbg_stack_push(phpdbg_param_t *stack, phpdbg_param_t *param) { argument
527 if (stack->top == NULL) {
528 stack->top = next;
530 stack
540 phpdbg_stack_verify(const phpdbg_command_t *command, phpdbg_param_t **stack, char **why TSRMLS_DC) argument
744 phpdbg_stack_execute(phpdbg_param_t *stack, char **why TSRMLS_DC) argument
[all...]
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...]
H A Dphpdbg_lexer.l29 void phpdbg_init_lexer (phpdbg_param_t *stack, char *input TSRMLS_DC) {
30 PHPDBG_G(parser_stack) = stack;
H A Dphpdbg_parser.y176 int phpdbg_do_parse(phpdbg_param_t *stack, char *input TSRMLS_DC) {
177 phpdbg_init_lexer(stack, input TSRMLS_CC);
/PHP_TRUNK/ext/standard/
H A Darray.c1825 /* {{{ proto int array_push(array stack, mixed var [, mixed ...])
1830 *stack, /* Input array */ local
1836 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a+", &stack, &args, &argc) == FAILURE) {
1845 if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var, sizeof(zval *), NULL) == FAILURE) {
1853 /* Clean up and return the number of values in the stack */
1855 RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack)));
1862 zval *stack, /* Input stack */ local
1868 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a", &stack) == FAILURE) {
1872 if (zend_hash_num_elements(Z_ARRVAL_P(stack))
1925 *stack; /* Input stack */ local
[all...]

Completed in 38 milliseconds

12