28 static __inline bool	 stack_empty(const struct stack *);
29 static void		 stack_grow(struct stack *);
38 stack_init(struct stack *stack)  in stack_init()  argument
41 	stack->size = 0;  in stack_init()
42 	stack->sp = -1;  in stack_init()
43 	stack->stack = NULL;  in stack_init()
47 stack_empty(const struct stack *stack)  in stack_empty()  argument
49 	bool empty = stack->sp == -1;  in stack_empty()
101 stack_size(const struct stack *stack)  in stack_size()  argument
104 	return (stack->sp + 1);  in stack_size()
108 stack_dup(struct stack *stack)  in stack_dup()  argument
113 	value = stack_tos(stack);  in stack_dup()
118 	stack_push(stack, stack_dup_value(value, &copy));  in stack_dup()
122 stack_swap(struct stack *stack)  in stack_swap()  argument
126 	if (stack->sp < 1) {  in stack_swap()
130 	copy = stack->stack[stack->sp];  in stack_swap()
131 	stack->stack[stack->sp] = stack->stack[stack->sp-1];  in stack_swap()
132 	stack->stack[stack->sp-1] = copy;  in stack_swap()
136 stack_grow(struct stack *stack)  in stack_grow()  argument
140 	if (++stack->sp == stack->size) {  in stack_grow()
141 		new_size = stack->size * 2 + 1;  in stack_grow()
142 		stack->stack = breallocarray(stack->stack,  in stack_grow()
143 		    new_size, sizeof(*stack->stack));  in stack_grow()
144 		stack->size = new_size;  in stack_grow()
149 stack_pushnumber(struct stack *stack, struct number *b)  in stack_pushnumber()  argument
152 	stack_grow(stack);  in stack_pushnumber()
153 	stack->stack[stack->sp].type = BCODE_NUMBER;  in stack_pushnumber()
154 	stack->stack[stack->sp].u.num = b;  in stack_pushnumber()
155 	stack->stack[stack->sp].array = NULL;  in stack_pushnumber()
159 stack_pushstring(struct stack *stack, char *string)  in stack_pushstring()  argument
162 	stack_grow(stack);  in stack_pushstring()
163 	stack->stack[stack->sp].type = BCODE_STRING;  in stack_pushstring()
164 	stack->stack[stack->sp].u.string = string;  in stack_pushstring()
165 	stack->stack[stack->sp].array = NULL;  in stack_pushstring()
169 stack_push(struct stack *stack, struct value *v)  in stack_push()  argument
174 		stack_grow(stack);  in stack_push()
175 		stack->stack[stack->sp].type = BCODE_NONE;  in stack_push()
178 		stack_pushnumber(stack, v->u.num);  in stack_push()
181 		stack_pushstring(stack, v->u.string);  in stack_push()
184 	stack->stack[stack->sp].array = v->array == NULL ?  in stack_push()
189 stack_tos(const struct stack *stack)  in stack_tos()  argument
192 	if (stack->sp == -1)  in stack_tos()
194 	return &stack->stack[stack->sp];  in stack_tos()
198 stack_set_tos(struct stack *stack, struct value *v)  in stack_set_tos()  argument
201 	if (stack->sp == -1)  in stack_set_tos()
202 		stack_push(stack, v);  in stack_set_tos()
204 		stack_free_value(&stack->stack[stack->sp]);  in stack_set_tos()
205 		stack->stack[stack->sp] = *v;  in stack_set_tos()
206 		stack->stack[stack->sp].array = v->array == NULL ?  in stack_set_tos()
212 stack_pop(struct stack *stack)  in stack_pop()  argument
215 	if (stack_empty(stack))  in stack_pop()
217 	return &stack->stack[stack->sp--];  in stack_pop()
221 stack_popnumber(struct stack *stack)  in stack_popnumber()  argument
224 	if (stack_empty(stack))  in stack_popnumber()
226 	array_free(stack->stack[stack->sp].array);  in stack_popnumber()
227 	stack->stack[stack->sp].array = NULL;  in stack_popnumber()
228 	if (stack->stack[stack->sp].type != BCODE_NUMBER) {  in stack_popnumber()
232 	return stack->stack[stack->sp--].u.num;  in stack_popnumber()
236 stack_popstring(struct stack *stack)  in stack_popstring()  argument
239 	if (stack_empty(stack))  in stack_popstring()
241 	array_free(stack->stack[stack->sp].array);  in stack_popstring()
242 	stack->stack[stack->sp].array = NULL;  in stack_popstring()
243 	if (stack->stack[stack->sp].type != BCODE_STRING) {  in stack_popstring()
247 	return stack->stack[stack->sp--].u.string;  in stack_popstring()
251 stack_clear(struct stack *stack)  in stack_clear()  argument
254 	while (stack->sp >= 0)  in stack_clear()
255 		stack_free_value(&stack->stack[stack->sp--]);  in stack_clear()
256 	free(stack->stack);  in stack_clear()
257 	stack_init(stack);  in stack_clear()
261 stack_print(FILE *f, const struct stack *stack, const char *prefix, u_int base)  in stack_print()  argument
265 	for (i = stack->sp; i >= 0; i--) {  in stack_print()
266 		print_value(f, &stack->stack[i], prefix, base);  in stack_print()
344 frame_assign(struct stack *stack, size_t i, const struct value *v)  in frame_assign()  argument
349 	if (stack->sp == -1) {  in frame_assign()
352 		stack_push(stack, &n);  in frame_assign()
355 	a = stack->stack[stack->sp].array;  in frame_assign()
357 		a = stack->stack[stack->sp].array = array_new();  in frame_assign()
362 frame_retrieve(const struct stack *stack, size_t i)  in frame_retrieve()  argument
366 	if (stack->sp == -1)  in frame_retrieve()
368 	a = stack->stack[stack->sp].array;  in frame_retrieve()
370 		a = stack->stack[stack->sp].array = array_new();  in frame_retrieve()