1 /*
2 +----------------------------------------------------------------------+
3 | Zend Engine |
4 +----------------------------------------------------------------------+
5 | Copyright (c) 1998-2013 Zend Technologies Ltd. (http://www.zend.com) |
6 +----------------------------------------------------------------------+
7 | This source file is subject to version 2.00 of the Zend license, |
8 | that is bundled with this package in the file LICENSE, and is |
9 | available through the world-wide-web at the following url: |
10 | http://www.zend.com/license/2_00.txt. |
11 | If you did not receive a copy of the Zend license and are unable to |
12 | obtain it through the world-wide-web, please send a note to |
13 | license@zend.com so we can mail you a copy immediately. |
14 +----------------------------------------------------------------------+
15 | Authors: Andi Gutmans <andi@zend.com> |
16 | Zeev Suraski <zeev@zend.com> |
17 +----------------------------------------------------------------------+
18 */
19
20 /* $Id$ */
21
22 #include "zend.h"
23 #include "zend_ptr_stack.h"
24 #ifdef HAVE_STDARG_H
25 # include <stdarg.h>
26 #endif
27
zend_ptr_stack_init_ex(zend_ptr_stack * stack,zend_bool persistent)28 ZEND_API void zend_ptr_stack_init_ex(zend_ptr_stack *stack, zend_bool persistent)
29 {
30 stack->top_element = stack->elements = (void **) pemalloc(sizeof(void *)*PTR_STACK_BLOCK_SIZE, persistent);
31 stack->max = PTR_STACK_BLOCK_SIZE;
32 stack->top = 0;
33 stack->persistent = persistent;
34 }
35
zend_ptr_stack_init(zend_ptr_stack * stack)36 ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack)
37 {
38 zend_ptr_stack_init_ex(stack, 0);
39 }
40
41
zend_ptr_stack_n_push(zend_ptr_stack * stack,int count,...)42 ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...)
43 {
44 va_list ptr;
45 void *elem;
46
47 ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count)
48
49 va_start(ptr, count);
50 while (count>0) {
51 elem = va_arg(ptr, void *);
52 stack->top++;
53 *(stack->top_element++) = elem;
54 count--;
55 }
56 va_end(ptr);
57 }
58
59
zend_ptr_stack_n_pop(zend_ptr_stack * stack,int count,...)60 ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...)
61 {
62 va_list ptr;
63 void **elem;
64
65 va_start(ptr, count);
66 while (count>0) {
67 elem = va_arg(ptr, void **);
68 *elem = *(--stack->top_element);
69 stack->top--;
70 count--;
71 }
72 va_end(ptr);
73 }
74
75
76
zend_ptr_stack_destroy(zend_ptr_stack * stack)77 ZEND_API void zend_ptr_stack_destroy(zend_ptr_stack *stack)
78 {
79 if (stack->elements) {
80 pefree(stack->elements, stack->persistent);
81 }
82 }
83
84
zend_ptr_stack_apply(zend_ptr_stack * stack,void (* func)(void *))85 ZEND_API void zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *))
86 {
87 int i = stack->top;
88
89 while (--i >= 0) {
90 func(stack->elements[i]);
91 }
92 }
93
94
zend_ptr_stack_clean(zend_ptr_stack * stack,void (* func)(void *),zend_bool free_elements)95 ZEND_API void zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements)
96 {
97 zend_ptr_stack_apply(stack, func);
98 if (free_elements) {
99 int i = stack->top;
100
101 while (--i >= 0) {
102 pefree(stack->elements[i], stack->persistent);
103 }
104 }
105 stack->top = 0;
106 stack->top_element = stack->elements;
107 }
108
109
zend_ptr_stack_num_elements(zend_ptr_stack * stack)110 ZEND_API int zend_ptr_stack_num_elements(zend_ptr_stack *stack)
111 {
112 return stack->top;
113 }
114
115 /*
116 * Local variables:
117 * tab-width: 4
118 * c-basic-offset: 4
119 * indent-tabs-mode: t
120 * End:
121 */
122