Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/dc/stack.c	Lines:	147	162	90.7 %
Date:	2017-11-07	Branches:	55	68	80.9 %


/*	$OpenBSD: stack.c,v 1.14 2016/03/27 15:55:13 otto Exp $	*/

/*
 * Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <err.h>
#include <stdlib.h>
#include <string.h>

#include "extern.h"

static __inline bool	stack_empty(const struct stack *);
static void		stack_grow(struct stack *);
static struct array	*array_new(void);
static __inline void	array_free(struct array *);
static struct array *	array_dup(const struct array *);
static __inline void	array_grow(struct array *, size_t);
static __inline void	array_assign(struct array *, size_t, const struct value *);
static __inline struct value	*array_retrieve(const struct array *, size_t);

void
stack_init(struct stack *stack)
{
	stack->size = 0;
	stack->sp = -1;
	stack->stack = NULL;
}

static __inline bool
stack_empty(const struct stack *stack)
{
	bool empty = stack->sp == -1;
	if (empty)
		warnx("stack empty");
	return empty;
}

/* Clear number or string, but leave value itself */
void
stack_free_value(struct value *v)
{
	switch (v->type) {
	case BCODE_NONE:
		break;
	case BCODE_NUMBER:
		free_number(v->u.num);
		break;
	case BCODE_STRING:
		free(v->u.string);
		break;
	}
	array_free(v->array);
	v->array = NULL;
}

/* Copy number or string content into already allocated target */
struct value *
stack_dup_value(const struct value *a, struct value *copy)
{
	copy->type = a->type;

	switch (a->type) {
	case BCODE_NONE:
		break;
	case BCODE_NUMBER:
		copy->u.num = dup_number(a->u.num);
		break;
	case BCODE_STRING:
		copy->u.string = strdup(a->u.string);
		if (copy->u.string == NULL)
			err(1, NULL);
		break;
	}

	copy->array = a->array == NULL ? NULL : array_dup(a->array);

	return copy;
}

size_t
stack_size(const struct stack *stack)
{
	return stack->sp + 1;
}

void
stack_dup(struct stack *stack)
{
	struct value	*value;
	struct value	copy;

	value = stack_tos(stack);
	if (value == NULL) {
		warnx("stack empty");
		return;
	}
	stack_push(stack, stack_dup_value(value, &copy));
}

void
stack_swap(struct stack *stack)
{
	struct value	copy;

	if (stack->sp < 1) {
		warnx("stack empty");
		return;
	}
	copy = stack->stack[stack->sp];
	stack->stack[stack->sp] = stack->stack[stack->sp-1];
	stack->stack[stack->sp-1] = copy;
}

static void
stack_grow(struct stack *stack)
{
	size_t new_size;

	if (++stack->sp == stack->size) {
		new_size = stack->size * 2 + 1;
		stack->stack = breallocarray(stack->stack,
		    new_size, sizeof(*stack->stack));
		stack->size = new_size;
	}
}

void
stack_pushnumber(struct stack *stack, struct number *b)
{
	stack_grow(stack);
	stack->stack[stack->sp].type = BCODE_NUMBER;
	stack->stack[stack->sp].u.num = b;
	stack->stack[stack->sp].array = NULL;
}

void
stack_pushstring(struct stack *stack, char *string)
{
	stack_grow(stack);
	stack->stack[stack->sp].type = BCODE_STRING;
	stack->stack[stack->sp].u.string = string;
	stack->stack[stack->sp].array = NULL;
}

void
stack_push(struct stack *stack, struct value *v)
{
	switch (v->type) {
	case BCODE_NONE:
		stack_grow(stack);
		stack->stack[stack->sp].type = BCODE_NONE;
		break;
	case BCODE_NUMBER:
		stack_pushnumber(stack, v->u.num);
		break;
	case BCODE_STRING:
		stack_pushstring(stack, v->u.string);
		break;
	}
	stack->stack[stack->sp].array = v->array == NULL ?
	    NULL : array_dup(v->array);
}

struct value *
stack_tos(const struct stack *stack)
{
	if (stack->sp == -1)
		return NULL;
	return &stack->stack[stack->sp];
}

void
stack_set_tos(struct stack *stack, struct value *v)
{
	if (stack->sp == -1)
		stack_push(stack, v);
	else {
		stack_free_value(&stack->stack[stack->sp]);
		stack->stack[stack->sp] = *v;
		stack->stack[stack->sp].array = v->array == NULL ?
		    NULL : array_dup(v->array);
	}
}

struct value *
stack_pop(struct stack *stack)
{
	if (stack_empty(stack))
		return NULL;
	return &stack->stack[stack->sp--];
}

struct number *
stack_popnumber(struct stack *stack)
{
	if (stack_empty(stack))
		return NULL;
	array_free(stack->stack[stack->sp].array);
	stack->stack[stack->sp].array = NULL;
	if (stack->stack[stack->sp].type != BCODE_NUMBER) {
		warnx("not a number"); /* XXX remove */
		return NULL;
	}
	return stack->stack[stack->sp--].u.num;
}

char *
stack_popstring(struct stack *stack)
{
	if (stack_empty(stack))
		return NULL;
	array_free(stack->stack[stack->sp].array);
	stack->stack[stack->sp].array = NULL;
	if (stack->stack[stack->sp].type != BCODE_STRING) {
		warnx("not a string"); /* XXX remove */
		return NULL;
	}
	return stack->stack[stack->sp--].u.string;
}

void
stack_clear(struct stack *stack)
{
	while (stack->sp >= 0)
		stack_free_value(&stack->stack[stack->sp--]);
	free(stack->stack);
	stack_init(stack);
}

void
stack_print(FILE *f, const struct stack *stack, const char *prefix, u_int base)
{
	ssize_t i;

	for (i = stack->sp; i >= 0; i--) {
		print_value(f, &stack->stack[i], prefix, base);
		(void)putc('\n', f);
	}
}


static struct array *
array_new(void)
{
	struct array *a;

	a = bmalloc(sizeof(*a));
	a->data = NULL;
	a->size = 0;
	return a;
}

static __inline void
array_free(struct array *a)
{
	size_t i;

	if (a == NULL)
		return;
	for (i = 0; i < a->size; i++)
		stack_free_value(&a->data[i]);
	free(a->data);
	free(a);
}

static struct array *
array_dup(const struct array *a)
{
	struct array	*n;
	size_t		i;

	if (a == NULL)
		return NULL;
	n = array_new();
	array_grow(n, a->size);
	for (i = 0; i < a->size; i++)
		(void)stack_dup_value(&a->data[i], &n->data[i]);
	return n;
}

static __inline void
array_grow(struct array *array, size_t newsize)
{
	size_t i;

	array->data = breallocarray(array->data, newsize, sizeof(*array->data));
	for (i = array->size; i < newsize; i++) {
		array->data[i].type = BCODE_NONE;
		array->data[i].array = NULL;
	}
	array->size = newsize;
}

static __inline void
array_assign(struct array *array, size_t index, const struct value *v)
{
	if (index >= array->size)
		array_grow(array, index+1);
	stack_free_value(&array->data[index]);
	array->data[index] = *v;
}

static __inline struct value *
array_retrieve(const struct array *array, size_t index)
{
	if (index >= array->size)
		return NULL;
	return &array->data[index];
}

void
frame_assign(struct stack *stack, size_t index, const struct value *v)
{
	struct array *a;
	struct value n;

	if (stack->sp == -1) {
		n.type = BCODE_NONE;
		n.array = NULL;
		stack_push(stack, &n);
	}

	a = stack->stack[stack->sp].array;
	if (a == NULL)
		a = stack->stack[stack->sp].array = array_new();
	array_assign(a, index, v);
}

struct value *
frame_retrieve(const struct stack *stack, size_t index)
{
	struct array *a;

	if (stack->sp == -1)
		return NULL;
	a = stack->stack[stack->sp].array;
	if (a == NULL)
		a = stack->stack[stack->sp].array = array_new();
	return array_retrieve(a, index);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: stack.c,v 1.14 2016/03/27 15:55:13 otto Exp $ */
2
3			/*
4			* Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
5			*
6			* Permission to use, copy, modify, and distribute this software for any
7			* purpose with or without fee is hereby granted, provided that the above
8			* copyright notice and this permission notice appear in all copies.
9			*
10			* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11			* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12			* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13			* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14			* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15			* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16			* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17			*/
18
19			#include <err.h>
20			#include <stdlib.h>
21			#include <string.h>
22
23			#include "extern.h"
24
25			static __inline bool stack_empty(const struct stack *);
26			static void stack_grow(struct stack *);
27			static struct array *array_new(void);
28			static __inline void array_free(struct array *);
29			static struct array * array_dup(const struct array *);
30			static __inline void array_grow(struct array *, size_t);
31			static __inline void array_assign(struct array , size_t, const struct value );
32			static __inline struct value array_retrieve(const struct array , size_t);
33
34			void
35			stack_init(struct stack *stack)
36			{
37		32159124	stack->size = 0;
38		16079562	stack->sp = -1;
39		16079562	stack->stack = NULL;
40		16079562	}
41
42			static __inline bool
43			stack_empty(const struct stack *stack)
44			{
45		1621602	bool empty = stack->sp == -1;
46	✗✓	810801	if (empty)
47			warnx("stack empty");
48		810801	return empty;
49			}
50
51			/* Clear number or string, but leave value itself */
52			void
53			stack_free_value(struct value *v)
54			{
55	✓✓✓	443592	switch (v->type) {
56			case BCODE_NONE:
57			break;
58			case BCODE_NUMBER:
59		133002	free_number(v->u.num);
60		133002	break;
61			case BCODE_STRING:
62		14760	free(v->u.string);
63		14760	break;
64			}
65		147915	array_free(v->array);
66		147915	v->array = NULL;
67		147915	}
68
69			/* Copy number or string content into already allocated target */
70			struct value *
71			stack_dup_value(const struct value a, struct value copy)
72			{
73		698274	copy->type = a->type;
74
75	✓✓✓	465498	switch (a->type) {
76			case BCODE_NONE:
77			break;
78			case BCODE_NUMBER:
79		203328	copy->u.num = dup_number(a->u.num);
80		203328	break;
81			case BCODE_STRING:
82		29394	copy->u.string = strdup(a->u.string);
83	✗✓	29394	if (copy->u.string == NULL)
84			err(1, NULL);
85			break;
86			}
87
88	✓✓	465588	copy->array = a->array == NULL ? NULL : array_dup(a->array);
89
90		232776	return copy;
91			}
92
93			size_t
94			stack_size(const struct stack *stack)
95			{
96		19584	return stack->sp + 1;
97			}
98
99			void
100			stack_dup(struct stack *stack)
101			{
102			struct value *value;
103		112986	struct value copy;
104
105		56493	value = stack_tos(stack);
106	✗✓	56493	if (value == NULL) {
107			warnx("stack empty");
108			return;
109			}
110		56493	stack_push(stack, stack_dup_value(value, &copy));
111		112986	}
112
113			void
114			stack_swap(struct stack *stack)
115			{
116		126	struct value copy;
117
118	✓✓	63	if (stack->sp < 1) {
119		18	warnx("stack empty");
120		18	return;
121			}
122		45	copy = stack->stack[stack->sp];
123		45	stack->stack[stack->sp] = stack->stack[stack->sp-1];
124		45	stack->stack[stack->sp-1] = copy;
125		108	}
126
127			static void
128			stack_grow(struct stack *stack)
129			{
130			size_t new_size;
131
132	✓✓	1630566	if (++stack->sp == stack->size) {
133		93555	new_size = stack->size * 2 + 1;
134		93555	stack->stack = breallocarray(stack->stack,
135			new_size, sizeof(*stack->stack));
136		93555	stack->size = new_size;
137		93555	}
138		815283	}
139
140			void
141			stack_pushnumber(struct stack stack, struct number b)
142			{
143		1130940	stack_grow(stack);
144		565470	stack->stack[stack->sp].type = BCODE_NUMBER;
145		565470	stack->stack[stack->sp].u.num = b;
146		565470	stack->stack[stack->sp].array = NULL;
147		565470	}
148
149			void
150			stack_pushstring(struct stack stack, char string)
151			{
152		499302	stack_grow(stack);
153		249651	stack->stack[stack->sp].type = BCODE_STRING;
154		249651	stack->stack[stack->sp].u.string = string;
155		249651	stack->stack[stack->sp].array = NULL;
156		249651	}
157
158			void
159			stack_push(struct stack stack, struct value v)
160			{
161	✓✓✓✓	766935	switch (v->type) {
162			case BCODE_NONE:
163		162	stack_grow(stack);
164		162	stack->stack[stack->sp].type = BCODE_NONE;
165		162	break;
166			case BCODE_NUMBER:
167		225180	stack_pushnumber(stack, v->u.num);
168		225180	break;
169			case BCODE_STRING:
170		30303	stack_pushstring(stack, v->u.string);
171		30303	break;
172			}
173	✓✓	511416	stack->stack[stack->sp].array = v->array == NULL ?
174		126	NULL : array_dup(v->array);
175		255645	}
176
177			struct value *
178			stack_tos(const struct stack *stack)
179			{
180	✗✓	608508	if (stack->sp == -1)
181			return NULL;
182		304254	return &stack->stack[stack->sp];
183		304254	}
184
185			void
186			stack_set_tos(struct stack stack, struct value v)
187			{
188	✓✓	230922	if (stack->sp == -1)
189		3681	stack_push(stack, v);
190			else {
191		111780	stack_free_value(&stack->stack[stack->sp]);
192		111780	stack->stack[stack->sp] = *v;
193	✓✓	223596	stack->stack[stack->sp].array = v->array == NULL ?
194		36	NULL : array_dup(v->array);
195			}
196		115461	}
197
198			struct value *
199			stack_pop(struct stack *stack)
200			{
201	✗✓	341820	if (stack_empty(stack))
202			return NULL;
203		170910	return &stack->stack[stack->sp--];
204		170910	}
205
206			struct number *
207			stack_popnumber(struct stack *stack)
208			{
209	✗✓	813780	if (stack_empty(stack))
210			return NULL;
211		406890	array_free(stack->stack[stack->sp].array);
212		406890	stack->stack[stack->sp].array = NULL;
213	✗✓	406890	if (stack->stack[stack->sp].type != BCODE_NUMBER) {
214			warnx("not a number"); /* XXX remove */
215			return NULL;
216			}
217		406890	return stack->stack[stack->sp--].u.num;
218		406890	}
219
220			char *
221			stack_popstring(struct stack *stack)
222			{
223	✗✓	466002	if (stack_empty(stack))
224			return NULL;
225		233001	array_free(stack->stack[stack->sp].array);
226		233001	stack->stack[stack->sp].array = NULL;
227	✗✓	233001	if (stack->stack[stack->sp].type != BCODE_STRING) {
228			warnx("not a string"); /* XXX remove */
229			return NULL;
230			}
231		233001	return stack->stack[stack->sp--].u.string;
232		233001	}
233
234			void
235			stack_clear(struct stack *stack)
236			{
237	✓✓	138051	while (stack->sp >= 0)
238		108	stack_free_value(&stack->stack[stack->sp--]);
239		45945	free(stack->stack);
240		45945	stack_init(stack);
241		45945	}
242
243			void
244			stack_print(FILE f, const struct stack stack, const char *prefix, u_int base)
245			{
246			ssize_t i;
247
248	✓✓	900	for (i = stack->sp; i >= 0; i--) {
249		342	print_value(f, &stack->stack[i], prefix, base);
250	✓✗	684	(void)putc('\n', f);
251			}
252		72	}
253
254
255			static struct array *
256			array_new(void)
257			{
258			struct array *a;
259
260		522	a = bmalloc(sizeof(*a));
261		261	a->data = NULL;
262		261	a->size = 0;
263		261	return a;
264			}
265
266			static __inline void
267			array_free(struct array *a)
268			{
269			size_t i;
270
271	✓✓	1575612	if (a == NULL)
272		787743	return;
273	✓✓	360	for (i = 0; i < a->size; i++)
274		117	stack_free_value(&a->data[i]);
275		63	free(a->data);
276		63	free(a);
277		787869	}
278
279			static struct array *
280			array_dup(const struct array *a)
281			{
282			struct array *n;
283			size_t i;
284
285	✗✓	396	if (a == NULL)
286			return NULL;
287		198	n = array_new();
288		198	array_grow(n, a->size);
289	✓✓	1188	for (i = 0; i < a->size; i++)
290		396	(void)stack_dup_value(&a->data[i], &n->data[i]);
291		198	return n;
292		198	}
293
294			static __inline void
295			array_grow(struct array *array, size_t newsize)
296			{
297			size_t i;
298
299		576	array->data = breallocarray(array->data, newsize, sizeof(*array->data));
300	✓✓	3384	for (i = array->size; i < newsize; i++) {
301		1404	array->data[i].type = BCODE_NONE;
302		1404	array->data[i].array = NULL;
303			}
304		288	array->size = newsize;
305		288	}
306
307			static __inline void
308			array_assign(struct array array, size_t index, const struct value v)
309			{
310	✓✓	234	if (index >= array->size)
311		90	array_grow(array, index+1);
312		117	stack_free_value(&array->data[index]);
313		117	array->data[index] = *v;
314		117	}
315
316			static __inline struct value *
317			array_retrieve(const struct array *array, size_t index)
318			{
319	✗✓	162	if (index >= array->size)
320			return NULL;
321		81	return &array->data[index];
322		81	}
323
324			void
325			frame_assign(struct stack stack, size_t index, const struct value v)
326			{
327			struct array *a;
328		234	struct value n;
329
330	✓✓	117	if (stack->sp == -1) {
331		45	n.type = BCODE_NONE;
332		45	n.array = NULL;
333		45	stack_push(stack, &n);
334		45	}
335
336		117	a = stack->stack[stack->sp].array;
337	✓✓	117	if (a == NULL)
338		63	a = stack->stack[stack->sp].array = array_new();
339		117	array_assign(a, index, v);
340		117	}
341
342			struct value *
343			frame_retrieve(const struct stack *stack, size_t index)
344			{
345			struct array *a;
346
347	✓✓	216	if (stack->sp == -1)
348		27	return NULL;
349		81	a = stack->stack[stack->sp].array;
350	✗✓	81	if (a == NULL)
351			a = stack->stack[stack->sp].array = array_new();
352		81	return array_retrieve(a, index);
353		108	}