23#define ZEND_STACK_ELEMENT(stack, n) ((void *)((char *) (stack)->elements + (stack)->size * (n)))
36 if (stack->
top >= stack->
max) {
74 return stack->
top == 0;
105 for (i=stack->
top-1; i>=0; i--) {
112 for (i=0; i<stack->
top; i++) {
128 for (i=stack->
top-1; i>=0; i--) {
135 for (i=0; i<stack->
top; i++) {
149 for (i = 0; i < stack->
top; i++) {
158 stack->
top = stack->
max = 0;
#define safe_erealloc(ptr, nmemb, size, offset)
ZEND_API int zend_stack_push(zend_stack *stack, const void *element)
ZEND_API void * zend_stack_base(const zend_stack *stack)
ZEND_API void * zend_stack_top(const zend_stack *stack)
ZEND_API int zend_stack_count(const zend_stack *stack)
ZEND_API void zend_stack_apply_with_argument(zend_stack *stack, zend_stack_apply_direction type, int(*apply_function)(void *element, void *arg), void *arg)
ZEND_API void zend_stack_destroy(zend_stack *stack)
ZEND_API int zend_stack_int_top(const zend_stack *stack)
ZEND_API void zend_stack_init(zend_stack *stack, int size)
ZEND_API bool zend_stack_is_empty(const zend_stack *stack)
ZEND_API void zend_stack_del_top(zend_stack *stack)
ZEND_API void zend_stack_clean(zend_stack *stack, void(*func)(void *), bool free_elements)
ZEND_API void zend_stack_apply(zend_stack *stack, int type, int(*apply_function)(void *element))
#define ZEND_STACK_ELEMENT(stack, n)
struct _zend_stack zend_stack
zend_stack_apply_direction
@ ZEND_STACK_APPLY_BOTTOMUP
@ ZEND_STACK_APPLY_TOPDOWN