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

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
423368
	const char *end, *wrd;
119
	unsigned long n;
120
121
	n = 0;
122
211684
	end = s;
123
124
18964270
	while ((wrd = iterate_words(&end)) != NULL) {
125
9270451
		Lst_AtFront(lst, escape_dupi(wrd, end, "\"'"));
126
9270451
		n++;
127
	}
128
211684
	return n;
129
211684
}
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
1058420
	while (ISSPACE(*ptr))
142
211684
		ptr++;
143
144
	/* Parse loop.  */
145
146
211684
	arg = emalloc(sizeof(*arg));
147
211684
	arg->nvars = 0;
148
211684
	Lst_Init(&arg->vars);
149
150
423563
	for (;;) {
151
		/* Grab the variables.  */
152

3783315
		for (wrd = ptr; *ptr && !ISSPACE(*ptr); ptr++)
153
			continue;
154
423563
		if (ptr - wrd == 0) {
155
			Parse_Error(PARSE_FATAL, "Syntax error in for");
156
			return 0;
157
		}
158
423563
		endVar = ptr++;
159
847126
		while (ISSPACE(*ptr))
160
			ptr++;
161
		/* End of variable list ? */
162

876180
		if (endVar - wrd == 2 && wrd[0] == 'i' && wrd[1] == 'n')
163
			break;
164
211879
		Lst_AtEnd(&arg->vars, Var_NewLoopVar(wrd, endVar));
165
211879
		arg->nvars++;
166
	}
167
211684
	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
211684
	sub = Var_Subst(ptr, NULL, false);
174
211684
	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
211684
	Lst_Init(&arg->lst);
184
211684
	n = build_words_list(&arg->lst, sub);
185
211684
	free(sub);
186

211869
	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
211684
	arg->lineno = Parse_Getlineno();
201
211684
	arg->level = 1;
202
211684
	Buf_Init(&arg->buf, 0);
203
204
211684
	return arg;
205
211684
}
206
207
208
bool
209
For_Accumulate(For *arg, const char *line)
210
{
211
	const char *ptr = line;
212
213
4547792
	assert(arg->level > 0);
214
215
2273896
	if (*ptr == '.') {
216
217
4071184
		for (ptr++; ISSPACE(*ptr); ptr++)
218
			continue;
219
220

1361352
		if (strncmp(ptr, "endfor", 6) == 0 &&
221
427670
		    (ISSPACE(ptr[6]) || !ptr[6])) {
222
213835
			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
213835
			if (--arg->level == 0)
227
211684
				return false;
228
		}
229

935833
		else if (strncmp(ptr, "for", 3) == 0 &&
230
2151
		     ISSPACE(ptr[3])) {
231
2151
			arg->level++;
232
2151
			if (DEBUG(FOR))
233
				(void)fprintf(stderr, "For: new loop %lu\n",
234
				    arg->level);
235
		}
236
	}
237
2062212
	Buf_AddString(&arg->buf, line);
238
4125259
	Buf_AddChar(&arg->buf, '\n');
239
2062212
	return true;
240
2273896
}
241
242
243
#define GUESS_EXPANSION 32
244
static void
245
ForExec(void *valuep, void *argp)
246
{
247
	char *value = valuep;
248
18540902
	For *arg = argp;
249
9270451
	BUFFER buf;
250
251
	/* Parse_FromString pushes stuff back, so we need to go over vars in
252
	   reverse.  */
253
9270451
	if (arg->var == NULL) {
254
9269136
		arg->var = Lst_Last(&arg->vars);
255
9269136
		arg->text = Buf_Retrieve(&arg->buf);
256
9269136
		arg->freeold = false;
257
9269136
	}
258
259
9270451
	if (DEBUG(FOR))
260
		(void)fprintf(stderr, "--- %s = %s\n",
261
		    Var_LoopVarName(Lst_Datum(arg->var)), value);
262
9270451
	Buf_Init(&buf, arg->guess);
263
9270451
	Var_SubstVar(&buf, arg->text, Lst_Datum(arg->var), value);
264
9270451
	if (arg->freeold)
265
1315
		free(arg->text);
266
9270451
	arg->text = Buf_Retrieve(&buf);
267
9270451
	arg->freeold = true;
268
9270451
	arg->var = Lst_Rev(arg->var);
269
9270451
	if (arg->var == NULL)
270
9269136
		Parse_FromString(arg->text, arg->lineno);
271
9270451
}
272
273
274
void
275
For_Run(For *arg)
276
{
277
423368
	arg->text = Buf_Retrieve(&arg->buf);
278
211684
	arg->guess = Buf_Size(&arg->buf) + GUESS_EXPANSION;
279
280
211684
	arg->var = NULL;
281
211684
	Lst_ForEach(&arg->lst, ForExec, arg);
282
211684
	Buf_Destroy(&arg->buf);
283
211684
	Lst_Destroy(&arg->vars, (SimpleProc)Var_DeleteLoopVar);
284
211684
	Lst_Destroy(&arg->lst, (SimpleProc)free);
285
211684
	free(arg);
286
211684
}