1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160
|
/*
+----------------------------------------------------------------------+
| Zend Engine |
+----------------------------------------------------------------------+
| Copyright (c) Zend Technologies Ltd. (http://www.zend.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 2.00 of the Zend license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.zend.com/license/2_00.txt. |
| If you did not receive a copy of the Zend license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@zend.com so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Authors: Andi Gutmans <andi@php.net> |
| Zeev Suraski <zeev@php.net> |
+----------------------------------------------------------------------+
*/
#include "zend.h"
#include "zend_stack.h"
#define ZEND_STACK_ELEMENT(stack, n) ((void *)((char *) (stack)->elements + (stack)->size * (n)))
ZEND_API void zend_stack_init(zend_stack *stack, int size)
{
stack->size = size;
stack->top = 0;
stack->max = 0;
stack->elements = NULL;
}
ZEND_API int zend_stack_push(zend_stack *stack, const void *element)
{
/* We need to allocate more memory */
if (stack->top >= stack->max) {
stack->max += STACK_BLOCK_SIZE;
stack->elements = safe_erealloc(stack->elements, stack->size, stack->max, 0);
}
memcpy(ZEND_STACK_ELEMENT(stack, stack->top), element, stack->size);
return stack->top++;
}
ZEND_API void *zend_stack_top(const zend_stack *stack)
{
if (stack->top > 0) {
return ZEND_STACK_ELEMENT(stack, stack->top - 1);
} else {
return NULL;
}
}
ZEND_API void zend_stack_del_top(zend_stack *stack)
{
--stack->top;
}
ZEND_API int zend_stack_int_top(const zend_stack *stack)
{
int *e = zend_stack_top(stack);
if (e) {
return *e;
} else {
return FAILURE;
}
}
ZEND_API bool zend_stack_is_empty(const zend_stack *stack)
{
return stack->top == 0;
}
ZEND_API void zend_stack_destroy(zend_stack *stack)
{
if (stack->elements) {
efree(stack->elements);
stack->elements = NULL;
}
}
ZEND_API void *zend_stack_base(const zend_stack *stack)
{
return stack->elements;
}
ZEND_API int zend_stack_count(const zend_stack *stack)
{
return stack->top;
}
ZEND_API void zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element))
{
int i;
switch (type) {
case ZEND_STACK_APPLY_TOPDOWN:
for (i=stack->top-1; i>=0; i--) {
if (apply_function(ZEND_STACK_ELEMENT(stack, i))) {
break;
}
}
break;
case ZEND_STACK_APPLY_BOTTOMUP:
for (i=0; i<stack->top; i++) {
if (apply_function(ZEND_STACK_ELEMENT(stack, i))) {
break;
}
}
break;
}
}
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)
{
int i;
switch (type) {
case ZEND_STACK_APPLY_TOPDOWN:
for (i=stack->top-1; i>=0; i--) {
if (apply_function(ZEND_STACK_ELEMENT(stack, i), arg)) {
break;
}
}
break;
case ZEND_STACK_APPLY_BOTTOMUP:
for (i=0; i<stack->top; i++) {
if (apply_function(ZEND_STACK_ELEMENT(stack, i), arg)) {
break;
}
}
break;
}
}
ZEND_API void zend_stack_clean(zend_stack *stack, void (*func)(void *), bool free_elements)
{
int i;
if (func) {
for (i = 0; i < stack->top; i++) {
func(ZEND_STACK_ELEMENT(stack, i));
}
}
if (free_elements) {
if (stack->elements) {
efree(stack->elements);
stack->elements = NULL;
}
stack->top = stack->max = 0;
}
}
|