Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/make/for.c	Lines:	75	97	77.3 %
Date:	2017-11-07	Branches:	45	62	72.6 %


/*	$OpenBSD: for.c,v 1.46 2015/01/23 13:18:40 espie Exp $	*/
/*	$NetBSD: for.c,v 1.4 1996/11/06 17:59:05 christos Exp $ */

/*
 * Copyright (c) 1999 Marc Espie.
 *
 * Extensive code modifications for the OpenBSD project.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OPENBSD
 * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

/*
 * Copyright (c) 1992, The Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <assert.h>
#include <ctype.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "config.h"
#include "defines.h"
#include "buf.h"
#include "for.h"
#include "lst.h"
#include "error.h"
#include "var.h"
#include "lowparse.h"
#include "str.h"
#include "memory.h"

/*
 * For statements are of the form:
 *
 * .for <variable> [variable...] in <varlist>
 * ...
 * .endfor
 *
 * The trick is to look for the matching .end inside .for loops.
 * To do that, we keep track of the nesting level of .for loops
 * and matching .endfor statements, accumulating all statements between
 * the initial .for loop and the matching .endfor,
 * then we evaluate the .for loop for each variable in the varlist.
 */

/* State of a for loop.  */
struct For_ {
	char		*text;		/* Unexpanded text		*/
	LIST		vars;		/* List of variables		*/
	LstNode		var;		/* Current var			*/
	int		nvars;		/* Total number of vars		*/
	LIST		lst;		/* List of items		*/
	size_t		guess;		/* Estimated expansion size	*/
	BUFFER		buf;		/* Accumulating text		*/
	unsigned long	lineno; 	/* Line number at start of loop */
	unsigned long	level;		/* Nesting level		*/
	bool		freeold;
};

/* ForExec(value, handle);
 *	Expands next variable in loop sequence described by handle to value. */
static void ForExec(void *, void *);

/* n = build_words_list(lst, s);
 *	Cuts string into words, pushes words into list, in reverse order,
 *	because Parse_FromString works as a stack.
 *	Returns the number of words.  */
static unsigned long build_words_list(Lst, const char *);

static unsigned long
build_words_list(Lst lst, const char *s)
{
	const char *end, *wrd;
	unsigned long n;

	n = 0;
	end = s;

	while ((wrd = iterate_words(&end)) != NULL) {
		Lst_AtFront(lst, escape_dupi(wrd, end, "\"'"));
		n++;
	}
	return n;
}

For *
For_Eval(const char *line)
{
	const char	*ptr = line;
	const char	*wrd;
	char	*sub;
	const char	*endVar;
	For 	*arg;
	unsigned long n;

	while (ISSPACE(*ptr))
		ptr++;

	/* Parse loop.  */

	arg = emalloc(sizeof(*arg));
	arg->nvars = 0;
	Lst_Init(&arg->vars);

	for (;;) {
		/* Grab the variables.  */
		for (wrd = ptr; *ptr && !ISSPACE(*ptr); ptr++)
			continue;
		if (ptr - wrd == 0) {
			Parse_Error(PARSE_FATAL, "Syntax error in for");
			return 0;
		}
		endVar = ptr++;
		while (ISSPACE(*ptr))
			ptr++;
		/* End of variable list ? */
		if (endVar - wrd == 2 && wrd[0] == 'i' && wrd[1] == 'n')
			break;
		Lst_AtEnd(&arg->vars, Var_NewLoopVar(wrd, endVar));
		arg->nvars++;
	}
	if (arg->nvars == 0) {
		Parse_Error(PARSE_FATAL, "Missing variable in for");
		return 0;
	}

	/* Make a list with the remaining words.  */
	sub = Var_Subst(ptr, NULL, false);
	if (DEBUG(FOR)) {
		LstNode ln;
		(void)fprintf(stderr, "For: Iterator ");
		for (ln = Lst_First(&arg->vars); ln != NULL; ln = Lst_Adv(ln))
			(void)fprintf(stderr, "%s ",
			    Var_LoopVarName(Lst_Datum(ln)));
		(void)fprintf(stderr, "List %s\n", sub);
	}

	Lst_Init(&arg->lst);
	n = build_words_list(&arg->lst, sub);
	free(sub);
	if (arg->nvars != 1 && n % arg->nvars != 0) {
		LstNode ln;

		Parse_Error(PARSE_FATAL, "Wrong number of items in for loop");
		(void)fprintf(stderr, "%lu items for %d variables:",
		    n, arg->nvars);
		for (ln = Lst_First(&arg->lst); ln != NULL; ln = Lst_Adv(ln)) {
			char *p = Lst_Datum(ln);

			(void)fprintf(stderr, " %s", p);
		}
		(void)fprintf(stderr, "\n");
		return 0;
	}
	arg->lineno = Parse_Getlineno();
	arg->level = 1;
	Buf_Init(&arg->buf, 0);

	return arg;
}


bool
For_Accumulate(For *arg, const char *line)
{
	const char *ptr = line;

	assert(arg->level > 0);

	if (*ptr == '.') {

		for (ptr++; ISSPACE(*ptr); ptr++)
			continue;

		if (strncmp(ptr, "endfor", 6) == 0 &&
		    (ISSPACE(ptr[6]) || !ptr[6])) {
			if (DEBUG(FOR))
				(void)fprintf(stderr, "For: end for %lu\n",
				    arg->level);
			/* If matching endfor, don't add line to buffer.  */
			if (--arg->level == 0)
				return false;
		}
		else if (strncmp(ptr, "for", 3) == 0 &&
		     ISSPACE(ptr[3])) {
			arg->level++;
			if (DEBUG(FOR))
				(void)fprintf(stderr, "For: new loop %lu\n",
				    arg->level);
		}
	}
	Buf_AddString(&arg->buf, line);
	Buf_AddChar(&arg->buf, '\n');
	return true;
}


#define GUESS_EXPANSION 32
static void
ForExec(void *valuep, void *argp)
{
	char *value = valuep;
	For *arg = argp;
	BUFFER buf;

	/* Parse_FromString pushes stuff back, so we need to go over vars in
	   reverse.  */
	if (arg->var == NULL) {
		arg->var = Lst_Last(&arg->vars);
		arg->text = Buf_Retrieve(&arg->buf);
		arg->freeold = false;
	}

	if (DEBUG(FOR))
		(void)fprintf(stderr, "--- %s = %s\n",
		    Var_LoopVarName(Lst_Datum(arg->var)), value);
	Buf_Init(&buf, arg->guess);
	Var_SubstVar(&buf, arg->text, Lst_Datum(arg->var), value);
	if (arg->freeold)
		free(arg->text);
	arg->text = Buf_Retrieve(&buf);
	arg->freeold = true;
	arg->var = Lst_Rev(arg->var);
	if (arg->var == NULL)
		Parse_FromString(arg->text, arg->lineno);
}


void
For_Run(For *arg)
{
	arg->text = Buf_Retrieve(&arg->buf);
	arg->guess = Buf_Size(&arg->buf) + GUESS_EXPANSION;

	arg->var = NULL;
	Lst_ForEach(&arg->lst, ForExec, arg);
	Buf_Destroy(&arg->buf);
	Lst_Destroy(&arg->vars, (SimpleProc)Var_DeleteLoopVar);
	Lst_Destroy(&arg->lst, (SimpleProc)free);
	free(arg);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: for.c,v 1.46 2015/01/23 13:18:40 espie Exp $ */
2			/* $NetBSD: for.c,v 1.4 1996/11/06 17:59:05 christos Exp $ */
3
4			/*
5			* Copyright (c) 1999 Marc Espie.
6			*
7			* Extensive code modifications for the OpenBSD project.
8			*
9			* Redistribution and use in source and binary forms, with or without
10			* modification, are permitted provided that the following conditions
11			* are met:
12			* 1. Redistributions of source code must retain the above copyright
13			* notice, this list of conditions and the following disclaimer.
14			* 2. Redistributions in binary form must reproduce the above copyright
15			* notice, this list of conditions and the following disclaimer in the
16			* documentation and/or other materials provided with the distribution.
17			*
18			* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
19			* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20			* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21			* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
22			* PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23			* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24			* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25			* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26			* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27			* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28			* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29			*/
30
31			/*
32			* Copyright (c) 1992, The Regents of the University of California.
33			* All rights reserved.
34			*
35			* Redistribution and use in source and binary forms, with or without
36			* modification, are permitted provided that the following conditions
37			* are met:
38			* 1. Redistributions of source code must retain the above copyright
39			* notice, this list of conditions and the following disclaimer.
40			* 2. Redistributions in binary form must reproduce the above copyright
41			* notice, this list of conditions and the following disclaimer in the
42			* documentation and/or other materials provided with the distribution.
43			* 3. Neither the name of the University nor the names of its contributors
44			* may be used to endorse or promote products derived from this software
45			* without specific prior written permission.
46			*
47			* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
48			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50			* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
51			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
52			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
55			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
56			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
57			* SUCH DAMAGE.
58			*/
59
60			#include <assert.h>
61			#include <ctype.h>
62			#include <stddef.h>
63			#include <stdio.h>
64			#include <stdlib.h>
65			#include <string.h>
66			#include "config.h"
67			#include "defines.h"
68			#include "buf.h"
69			#include "for.h"
70			#include "lst.h"
71			#include "error.h"
72			#include "var.h"
73			#include "lowparse.h"
74			#include "str.h"
75			#include "memory.h"
76
77			/*
78			* For statements are of the form:
79			*
80			* .for <variable> [variable...] in <varlist>
81			* ...
82			* .endfor
83			*
84			* The trick is to look for the matching .end inside .for loops.
85			* To do that, we keep track of the nesting level of .for loops
86			* and matching .endfor statements, accumulating all statements between
87			* the initial .for loop and the matching .endfor,
88			* then we evaluate the .for loop for each variable in the varlist.
89			*/
90
91			/* State of a for loop. */
92			struct For_ {
93			char text; / Unexpanded text */
94			LIST vars; /* List of variables */
95			LstNode var; /* Current var */
96			int nvars; /* Total number of vars */
97			LIST lst; /* List of items */
98			size_t guess; /* Estimated expansion size */
99			BUFFER buf; /* Accumulating text */
100			unsigned long lineno; /* Line number at start of loop */
101			unsigned long level; /* Nesting level */
102			bool freeold;
103			};
104
105			/* ForExec(value, handle);
106			* Expands next variable in loop sequence described by handle to value. */
107			static void ForExec(void , void );
108
109			/* n = build_words_list(lst, s);
110			* Cuts string into words, pushes words into list, in reverse order,
111			* because Parse_FromString works as a stack.
112			* Returns the number of words. */
113			static unsigned long build_words_list(Lst, const char *);
114
115			static unsigned long
116			build_words_list(Lst lst, const char *s)
117			{
118		844022	const char end, wrd;
119			unsigned long n;
120
121			n = 0;
122		422011	end = s;
123
124	✓✓	34568192	while ((wrd = iterate_words(&end)) != NULL) {
125		16862085	Lst_AtFront(lst, escape_dupi(wrd, end, "\"'"));
126		16862085	n++;
127			}
128		422011	return n;
129		422011	}
130
131			For *
132			For_Eval(const char *line)
133			{
134			const char *ptr = line;
135			const char *wrd;
136			char *sub;
137			const char *endVar;
138			For *arg;
139			unsigned long n;
140
141	✓✓	2110055	while (ISSPACE(*ptr))
142		422011	ptr++;
143
144			/* Parse loop. */
145
146		422011	arg = emalloc(sizeof(*arg));
147		422011	arg->nvars = 0;
148		422011	Lst_Init(&arg->vars);
149
150		844604	for (;;) {
151			/* Grab the variables. */
152	✓✗✓✓	7636554	for (wrd = ptr; ptr && !ISSPACE(ptr); ptr++)
153			continue;
154	✗✓	844604	if (ptr - wrd == 0) {
155			Parse_Error(PARSE_FATAL, "Syntax error in for");
156			return 0;
157			}
158		844604	endVar = ptr++;
159	✗✓	1689208	while (ISSPACE(*ptr))
160			ptr++;
161			/* End of variable list ? */
162	✓✓✓✓ ✓✓	1745283	if (endVar - wrd == 2 && wrd[0] == 'i' && wrd[1] == 'n')
163			break;
164		422593	Lst_AtEnd(&arg->vars, Var_NewLoopVar(wrd, endVar));
165		422593	arg->nvars++;
166			}
167	✗✓	422011	if (arg->nvars == 0) {
168			Parse_Error(PARSE_FATAL, "Missing variable in for");
169			return 0;
170			}
171
172			/* Make a list with the remaining words. */
173		422011	sub = Var_Subst(ptr, NULL, false);
174	✗✓	422011	if (DEBUG(FOR)) {
175			LstNode ln;
176			(void)fprintf(stderr, "For: Iterator ");
177			for (ln = Lst_First(&arg->vars); ln != NULL; ln = Lst_Adv(ln))
178			(void)fprintf(stderr, "%s ",
179			Var_LoopVarName(Lst_Datum(ln)));
180			(void)fprintf(stderr, "List %s\n", sub);
181			}
182
183		422011	Lst_Init(&arg->lst);
184		422011	n = build_words_list(&arg->lst, sub);
185		422011	free(sub);
186	✓✓✗✓	422571	if (arg->nvars != 1 && n % arg->nvars != 0) {
187			LstNode ln;
188
189			Parse_Error(PARSE_FATAL, "Wrong number of items in for loop");
190			(void)fprintf(stderr, "%lu items for %d variables:",
191			n, arg->nvars);
192			for (ln = Lst_First(&arg->lst); ln != NULL; ln = Lst_Adv(ln)) {
193			char *p = Lst_Datum(ln);
194
195			(void)fprintf(stderr, " %s", p);
196			}
197			(void)fprintf(stderr, "\n");
198			return 0;
199			}
200		422011	arg->lineno = Parse_Getlineno();
201		422011	arg->level = 1;
202		422011	Buf_Init(&arg->buf, 0);
203
204		422011	return arg;
205		422011	}
206
207
208			bool
209			For_Accumulate(For arg, const char line)
210			{
211			const char *ptr = line;
212
213	✗✓	9231800	assert(arg->level > 0);
214
215	✓✓	4615900	if (*ptr == '.') {
216
217	✓✓	8047820	for (ptr++; ISSPACE(*ptr); ptr++)
218			continue;
219
220	✓✓✓✗	2722437	if (strncmp(ptr, "endfor", 6) == 0 &&
221	✓✗	854752	(ISSPACE(ptr[6]) \|\| !ptr[6])) {
222	✗✓	427376	if (DEBUG(FOR))
223			(void)fprintf(stderr, "For: end for %lu\n",
224			arg->level);
225			/* If matching endfor, don't add line to buffer. */
226	✓✓	427376	if (--arg->level == 0)
227		422011	return false;
228			}
229	✓✓✓✗	1873050	else if (strncmp(ptr, "for", 3) == 0 &&
230		5365	ISSPACE(ptr[3])) {
231		5365	arg->level++;
232	✗✓	5365	if (DEBUG(FOR))
233			(void)fprintf(stderr, "For: new loop %lu\n",
234			arg->level);
235			}
236			}
237		4193889	Buf_AddString(&arg->buf, line);
238	✓✓	8390266	Buf_AddChar(&arg->buf, '\n');
239		4193889	return true;
240		4615900	}
241
242
243			#define GUESS_EXPANSION 32
244			static void
245			ForExec(void valuep, void argp)
246			{
247			char *value = valuep;
248		33724170	For *arg = argp;
249		16862085	BUFFER buf;
250
251			/* Parse_FromString pushes stuff back, so we need to go over vars in
252			reverse. */
253	✓✓	16862085	if (arg->var == NULL) {
254		16857950	arg->var = Lst_Last(&arg->vars);
255		16857950	arg->text = Buf_Retrieve(&arg->buf);
256		16857950	arg->freeold = false;
257		16857950	}
258
259	✗✓	16862085	if (DEBUG(FOR))
260			(void)fprintf(stderr, "--- %s = %s\n",
261			Var_LoopVarName(Lst_Datum(arg->var)), value);
262		16862085	Buf_Init(&buf, arg->guess);
263		16862085	Var_SubstVar(&buf, arg->text, Lst_Datum(arg->var), value);
264	✓✓	16862085	if (arg->freeold)
265		4135	free(arg->text);
266		16862085	arg->text = Buf_Retrieve(&buf);
267		16862085	arg->freeold = true;
268		16862085	arg->var = Lst_Rev(arg->var);
269	✓✓	16862085	if (arg->var == NULL)
270		16857950	Parse_FromString(arg->text, arg->lineno);
271		16862085	}
272
273
274			void
275			For_Run(For *arg)
276			{
277		844022	arg->text = Buf_Retrieve(&arg->buf);
278		422011	arg->guess = Buf_Size(&arg->buf) + GUESS_EXPANSION;
279
280		422011	arg->var = NULL;
281		422011	Lst_ForEach(&arg->lst, ForExec, arg);
282		422011	Buf_Destroy(&arg->buf);
283		422011	Lst_Destroy(&arg->vars, (SimpleProc)Var_DeleteLoopVar);
284		422011	Lst_Destroy(&arg->lst, (SimpleProc)free);
285		422011	free(arg);
286		422011	}