Searched defs:stack (Results 1 - 20 of 20) 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.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)
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_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.h161 #define ZEND_VM_STACK_ELEMETS(stack) \
162 (((zval*)(stack)) + ZEND_VM_STACK_HEADER_SLOT)
190 zend_vm_stack stack = EG(argument_stack); local
192 while (stack != NULL) {
193 zend_vm_stack p = stack->prev;
194 efree(stack);
195 stack = p;
/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/sapi/phpdbg/
H A Dphpdbg_print.h36 PHPDBG_PRINT(stack); variable
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.c338 /* The OS might guarantee only one guard page at the bottom of the stack,
341 to allow for a few compiler-allocated temporary stack slots. */
380 /* A type that is properly aligned for any stack member. */
387 /* The size of the maximum gap between one aligned stack and the next. */
400 elements in the stack, and YYPTR gives the new location of the
401 stack. Advance YYPTR to a properly aligned location for the next
402 stack. */
819 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
869 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
905 if the built-in stack extensio
1903 phpdbg_do_parse(phpdbg_param_t *stack, char *input TSRMLS_DC) argument
[all...]
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...]
/PHP_TRUNK/ext/json/
H A DJSON_parser.h17 int* stack; member in struct:JSON_parser_struct
/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
10450 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
10585 pcre_jit_stack_free(pcre_jit_stack *stack) argument
10656 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
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/mbstring/
H A Dmbstring.c3547 zval *args, *stack, *var, *hash_entry, *hash_entry_ptr, *zfrom_enc; local
3599 stack = (zval *)safe_emalloc(stack_max, sizeof(zval), 0);
3617 var = &stack[stack_level];
3631 ptmp = erealloc(stack, sizeof(zval) * stack_max);
3632 stack = (zval *)ptmp;
3634 ZVAL_COPY_VALUE(&stack[stack_level], var);
3663 efree(stack);
3688 stack = (zval*)safe_emalloc(stack_max, sizeof(zval), 0);
3704 var = &stack[stack_level];
3719 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
715 wddx_stack *stack = (wddx_stack *)user_data; local
868 wddx_stack *stack = (wddx_stack *)user_data; local
987 wddx_stack *stack = (wddx_stack *)user_data; local
1050 wddx_stack stack; local
[all...]
/PHP_TRUNK/ext/standard/
H A Darray.c1964 /* {{{ proto int array_push(array stack, mixed var [, mixed ...])
1969 *stack, /* Input array */ local
1975 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a/+", &stack, &args, &argc) == FAILURE) {
1983 if (zend_hash_next_index_insert(Z_ARRVAL_P(stack), &new_var) == NULL) {
1990 /* Clean up and return the number of values in the stack */
1991 RETVAL_LONG(zend_hash_num_elements(Z_ARRVAL_P(stack)));
1998 zval *stack, /* Input stack */ local
2004 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "a/", &stack) == FAILURE) {
2009 Z_PARAM_ARRAY_EX(stack,
2117 *stack; /* Input stack */ local
[all...]

Completed in 62 milliseconds