25 static __inline bool	stack_empty(const struct stack *);
26 static void		stack_grow(struct stack *);
35 stack_init(struct stack *stack)  in stack_init()  argument
37 	stack->size = 0;  in stack_init()
38 	stack->sp = -1;  in stack_init()
39 	stack->stack = NULL;  in stack_init()
43 stack_empty(const struct stack *stack)  in stack_empty()  argument
45 	bool empty = stack->sp == -1;  in stack_empty()
92 stack_size(const struct stack *stack)  in stack_size()  argument
94 	return stack->sp + 1;  in stack_size()
98 stack_dup(struct stack *stack)  in stack_dup()  argument
103 	value = stack_tos(stack);  in stack_dup()
108 	stack_push(stack, stack_dup_value(value, &copy));  in stack_dup()
112 stack_swap(struct stack *stack)  in stack_swap()  argument
116 	if (stack->sp < 1) {  in stack_swap()
120 	copy = stack->stack[stack->sp];  in stack_swap()
121 	stack->stack[stack->sp] = stack->stack[stack->sp-1];  in stack_swap()
122 	stack->stack[stack->sp-1] = copy;  in stack_swap()
126 stack_grow(struct stack *stack)  in stack_grow()  argument
130 	if (++stack->sp == stack->size) {  in stack_grow()
131 		new_size = stack->size * 2 + 1;  in stack_grow()
132 		stack->stack = breallocarray(stack->stack,  in stack_grow()
133 		    new_size, sizeof(*stack->stack));  in stack_grow()
134 		stack->size = new_size;  in stack_grow()
139 stack_pushnumber(struct stack *stack, struct number *b)  in stack_pushnumber()  argument
141 	stack_grow(stack);  in stack_pushnumber()
142 	stack->stack[stack->sp].type = BCODE_NUMBER;  in stack_pushnumber()
143 	stack->stack[stack->sp].u.num = b;  in stack_pushnumber()
144 	stack->stack[stack->sp].array = NULL;  in stack_pushnumber()
148 stack_pushstring(struct stack *stack, char *string)  in stack_pushstring()  argument
150 	stack_grow(stack);  in stack_pushstring()
151 	stack->stack[stack->sp].type = BCODE_STRING;  in stack_pushstring()
152 	stack->stack[stack->sp].u.string = string;  in stack_pushstring()
153 	stack->stack[stack->sp].array = NULL;  in stack_pushstring()
157 stack_push(struct stack *stack, struct value *v)  in stack_push()  argument
161 		stack_grow(stack);  in stack_push()
162 		stack->stack[stack->sp].type = BCODE_NONE;  in stack_push()
165 		stack_pushnumber(stack, v->u.num);  in stack_push()
168 		stack_pushstring(stack, v->u.string);  in stack_push()
171 	stack->stack[stack->sp].array = v->array == NULL ?  in stack_push()
176 stack_tos(const struct stack *stack)  in stack_tos()  argument
178 	if (stack->sp == -1)  in stack_tos()
180 	return &stack->stack[stack->sp];  in stack_tos()
184 stack_set_tos(struct stack *stack, struct value *v)  in stack_set_tos()  argument
186 	if (stack->sp == -1)  in stack_set_tos()
187 		stack_push(stack, v);  in stack_set_tos()
189 		stack_free_value(&stack->stack[stack->sp]);  in stack_set_tos()
190 		stack->stack[stack->sp] = *v;  in stack_set_tos()
191 		stack->stack[stack->sp].array = v->array == NULL ?  in stack_set_tos()
197 stack_pop(struct stack *stack)  in stack_pop()  argument
199 	if (stack_empty(stack))  in stack_pop()
201 	return &stack->stack[stack->sp--];  in stack_pop()
205 stack_popnumber(struct stack *stack)  in stack_popnumber()  argument
207 	if (stack_empty(stack))  in stack_popnumber()
209 	array_free(stack->stack[stack->sp].array);  in stack_popnumber()
210 	stack->stack[stack->sp].array = NULL;  in stack_popnumber()
211 	if (stack->stack[stack->sp].type != BCODE_NUMBER) {  in stack_popnumber()
215 	return stack->stack[stack->sp--].u.num;  in stack_popnumber()
219 stack_popstring(struct stack *stack)  in stack_popstring()  argument
221 	if (stack_empty(stack))  in stack_popstring()
223 	array_free(stack->stack[stack->sp].array);  in stack_popstring()
224 	stack->stack[stack->sp].array = NULL;  in stack_popstring()
225 	if (stack->stack[stack->sp].type != BCODE_STRING) {  in stack_popstring()
229 	return stack->stack[stack->sp--].u.string;  in stack_popstring()
233 stack_clear(struct stack *stack)  in stack_clear()  argument
235 	while (stack->sp >= 0)  in stack_clear()
236 		stack_free_value(&stack->stack[stack->sp--]);  in stack_clear()
237 	free(stack->stack);  in stack_clear()
238 	stack_init(stack);  in stack_clear()
242 stack_print(FILE *f, const struct stack *stack, const char *prefix, u_int base)  in stack_print()  argument
246 	for (i = stack->sp; i >= 0; i--) {  in stack_print()
247 		print_value(f, &stack->stack[i], prefix, base);  in stack_print()
323 frame_assign(struct stack *stack, size_t index, const struct value *v)  in frame_assign()  argument
328 	if (stack->sp == -1) {  in frame_assign()
331 		stack_push(stack, &n);  in frame_assign()
334 	a = stack->stack[stack->sp].array;  in frame_assign()
336 		a = stack->stack[stack->sp].array = array_new();  in frame_assign()
341 frame_retrieve(const struct stack *stack, size_t index)  in frame_retrieve()  argument
345 	if (stack->sp == -1)  in frame_retrieve()
347 	a = stack->stack[stack->sp].array;  in frame_retrieve()
349 		a = stack->stack[stack->sp].array = array_new();  in frame_retrieve()