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
40 	stack->size = 0;  in stack_init()
41 	stack->sp = -1;  in stack_init()
42 	stack->stack = NULL;  in stack_init()
46 stack_empty(const struct stack *stack)  in stack_empty()  argument
48 	bool empty = stack->sp == -1;  in stack_empty()
97 stack_size(const struct stack *stack)  in stack_size()  argument
99 	return (size_t)(stack->sp + 1);  in stack_size()
103 stack_dup(struct stack *stack)  in stack_dup()  argument
108 	value = stack_tos(stack);  in stack_dup()
113 	stack_push(stack, stack_dup_value(value, &copy));  in stack_dup()
117 stack_swap(struct stack *stack)  in stack_swap()  argument
121 	if (stack->sp < 1) {  in stack_swap()
125 	copy = stack->stack[stack->sp];  in stack_swap()
126 	stack->stack[stack->sp] = stack->stack[stack->sp-1];  in stack_swap()
127 	stack->stack[stack->sp-1] = copy;  in stack_swap()
131 stack_grow(struct stack *stack)  in stack_grow()  argument
135 	if ((size_t)++stack->sp == stack->size) {  in stack_grow()
136 		new_size = stack->size * 2 + 1;  in stack_grow()
137 		stack->stack = breallocarray(stack->stack,  in stack_grow()
138 		    new_size, sizeof(*stack->stack));  in stack_grow()
139 		stack->size = new_size;  in stack_grow()
144 stack_pushnumber(struct stack *stack, struct number *b)  in stack_pushnumber()  argument
146 	stack_grow(stack);  in stack_pushnumber()
147 	stack->stack[stack->sp].type = BCODE_NUMBER;  in stack_pushnumber()
148 	stack->stack[stack->sp].u.num = b;  in stack_pushnumber()
149 	stack->stack[stack->sp].array = NULL;  in stack_pushnumber()
153 stack_pushstring(struct stack *stack, char *string)  in stack_pushstring()  argument
155 	stack_grow(stack);  in stack_pushstring()
156 	stack->stack[stack->sp].type = BCODE_STRING;  in stack_pushstring()
157 	stack->stack[stack->sp].u.string = string;  in stack_pushstring()
158 	stack->stack[stack->sp].array = NULL;  in stack_pushstring()
162 stack_push(struct stack *stack, struct value *v)  in stack_push()  argument
166 		stack_grow(stack);  in stack_push()
167 		stack->stack[stack->sp].type = BCODE_NONE;  in stack_push()
170 		stack_pushnumber(stack, v->u.num);  in stack_push()
173 		stack_pushstring(stack, v->u.string);  in stack_push()
176 	stack->stack[stack->sp].array = v->array == NULL ?  in stack_push()
181 stack_tos(const struct stack *stack)  in stack_tos()  argument
183 	if (stack->sp == -1)  in stack_tos()
185 	return &stack->stack[stack->sp];  in stack_tos()
189 stack_set_tos(struct stack *stack, struct value *v)  in stack_set_tos()  argument
191 	if (stack->sp == -1)  in stack_set_tos()
192 		stack_push(stack, v);  in stack_set_tos()
194 		stack_free_value(&stack->stack[stack->sp]);  in stack_set_tos()
195 		stack->stack[stack->sp] = *v;  in stack_set_tos()
196 		stack->stack[stack->sp].array = v->array == NULL ?  in stack_set_tos()
202 stack_pop(struct stack *stack)  in stack_pop()  argument
204 	if (stack_empty(stack))  in stack_pop()
206 	return &stack->stack[stack->sp--];  in stack_pop()
210 stack_popnumber(struct stack *stack)  in stack_popnumber()  argument
212 	if (stack_empty(stack))  in stack_popnumber()
214 	array_free(stack->stack[stack->sp].array);  in stack_popnumber()
215 	stack->stack[stack->sp].array = NULL;  in stack_popnumber()
216 	if (stack->stack[stack->sp].type != BCODE_NUMBER) {  in stack_popnumber()
220 	return stack->stack[stack->sp--].u.num;  in stack_popnumber()
224 stack_popstring(struct stack *stack)  in stack_popstring()  argument
226 	if (stack_empty(stack))  in stack_popstring()
228 	array_free(stack->stack[stack->sp].array);  in stack_popstring()
229 	stack->stack[stack->sp].array = NULL;  in stack_popstring()
230 	if (stack->stack[stack->sp].type != BCODE_STRING) {  in stack_popstring()
234 	return stack->stack[stack->sp--].u.string;  in stack_popstring()
238 stack_clear(struct stack *stack)  in stack_clear()  argument
240 	while (stack->sp >= 0)  in stack_clear()
241 		stack_free_value(&stack->stack[stack->sp--]);  in stack_clear()
242 	free(stack->stack);  in stack_clear()
243 	stack_init(stack);  in stack_clear()
247 stack_print(FILE *f, const struct stack *stack, const char *prefix, u_int base)  in stack_print()  argument
251 	for (i = stack->sp; i >= 0; i--) {  in stack_print()
252 		print_value(f, &stack->stack[i], prefix, base);  in stack_print()
328 frame_assign(struct stack *stack, size_t index, const struct value *v)  in frame_assign()  argument
333 	if (stack->sp == -1) {  in frame_assign()
336 		stack_push(stack, &n);  in frame_assign()
339 	a = stack->stack[stack->sp].array;  in frame_assign()
341 		a = stack->stack[stack->sp].array = array_new();  in frame_assign()
346 frame_retrieve(const struct stack *stack, size_t index)  in frame_retrieve()  argument
350 	if (stack->sp == -1)  in frame_retrieve()
352 	a = stack->stack[stack->sp].array;  in frame_retrieve()
354 		a = stack->stack[stack->sp].array = array_new();  in frame_retrieve()