2008-12-29 13:12:30 +03:00
|
|
|
|
/* $NetBSD: for.c,v 1.41 2008/12/29 10:12:30 dsl Exp $ */
|
1995-06-14 19:18:37 +04:00
|
|
|
|
|
1994-03-05 03:34:29 +03:00
|
|
|
|
/*
|
|
|
|
|
* 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.
|
2003-08-07 15:13:06 +04:00
|
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1994-03-05 03:34:29 +03:00
|
|
|
|
* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
2004-05-07 04:04:38 +04:00
|
|
|
|
#ifndef MAKE_NATIVE
|
2008-12-29 13:12:30 +03:00
|
|
|
|
static char rcsid[] = "$NetBSD: for.c,v 1.41 2008/12/29 10:12:30 dsl Exp $";
|
1997-09-28 07:30:58 +04:00
|
|
|
|
#else
|
1997-07-02 01:17:00 +04:00
|
|
|
|
#include <sys/cdefs.h>
|
1994-03-05 03:34:29 +03:00
|
|
|
|
#ifndef lint
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#if 0
|
1996-11-06 20:58:58 +03:00
|
|
|
|
static char sccsid[] = "@(#)for.c 8.1 (Berkeley) 6/6/93";
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#else
|
2008-12-29 13:12:30 +03:00
|
|
|
|
__RCSID("$NetBSD: for.c,v 1.41 2008/12/29 10:12:30 dsl Exp $");
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#endif
|
1994-03-05 03:34:29 +03:00
|
|
|
|
#endif /* not lint */
|
1997-09-28 07:30:58 +04:00
|
|
|
|
#endif
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
* for.c --
|
|
|
|
|
* Functions to handle loops in a makefile.
|
|
|
|
|
*
|
|
|
|
|
* Interface:
|
|
|
|
|
* For_Eval Evaluate the loop in the passed line.
|
|
|
|
|
* For_Run Run accumulated loop
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
2000-04-17 02:08:06 +04:00
|
|
|
|
#include <assert.h>
|
2002-06-15 22:24:55 +04:00
|
|
|
|
#include <ctype.h>
|
|
|
|
|
|
1994-03-05 03:34:29 +03:00
|
|
|
|
#include "make.h"
|
|
|
|
|
#include "hash.h"
|
|
|
|
|
#include "dir.h"
|
|
|
|
|
#include "buf.h"
|
2008-12-21 01:41:53 +03:00
|
|
|
|
#include "strlist.h"
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* For statements are of the form:
|
|
|
|
|
*
|
|
|
|
|
* .for <variable> in <varlist>
|
|
|
|
|
* ...
|
|
|
|
|
* .endfor
|
|
|
|
|
*
|
|
|
|
|
* The trick is to look for the matching end inside for for loop
|
|
|
|
|
* To do that, we count the current nesting level of the for loops.
|
|
|
|
|
* and the .endfor statements, accumulating all the statements between
|
1996-11-06 20:58:58 +03:00
|
|
|
|
* the initial .for loop and the matching .endfor;
|
1994-03-05 03:34:29 +03:00
|
|
|
|
* then we evaluate the for loop for each variable in the varlist.
|
2000-04-17 02:08:06 +04:00
|
|
|
|
*
|
|
|
|
|
* Note that any nested fors are just passed through; they get handled
|
|
|
|
|
* recursively in For_Eval when we're expanding the enclosing for in
|
|
|
|
|
* For_Run.
|
1994-03-05 03:34:29 +03:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static int forLevel = 0; /* Nesting level */
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* State of a for loop.
|
|
|
|
|
*/
|
1994-06-07 02:45:17 +04:00
|
|
|
|
typedef struct _For {
|
2000-04-17 02:08:06 +04:00
|
|
|
|
Buffer buf; /* Body of loop */
|
2008-12-21 01:41:53 +03:00
|
|
|
|
strlist_t vars; /* Iteration variables */
|
|
|
|
|
strlist_t items; /* Substitution items */
|
1994-06-07 02:45:17 +04:00
|
|
|
|
} For;
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2000-04-17 02:08:06 +04:00
|
|
|
|
static For accumFor; /* Loop being accumulated */
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
|
|
|
|
|
2000-04-17 02:08:06 +04:00
|
|
|
|
|
2008-12-01 01:37:55 +03:00
|
|
|
|
static char *
|
|
|
|
|
make_str(const char *ptr, int len)
|
|
|
|
|
{
|
|
|
|
|
char *new_ptr;
|
|
|
|
|
|
|
|
|
|
new_ptr = bmake_malloc(len + 1);
|
|
|
|
|
memcpy(new_ptr, ptr, len);
|
|
|
|
|
new_ptr[len] = 0;
|
|
|
|
|
return new_ptr;
|
|
|
|
|
}
|
|
|
|
|
|
1994-03-05 03:34:29 +03:00
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* For_Eval --
|
|
|
|
|
* Evaluate the for loop in the passed line. The line
|
|
|
|
|
* looks like this:
|
|
|
|
|
* .for <variable> in <varlist>
|
|
|
|
|
*
|
2002-06-15 22:24:55 +04:00
|
|
|
|
* Input:
|
|
|
|
|
* line Line to parse
|
|
|
|
|
*
|
1994-03-05 03:34:29 +03:00
|
|
|
|
* Results:
|
2008-12-02 00:05:21 +03:00
|
|
|
|
* 0: Not a .for statement, parse the line
|
|
|
|
|
* 1: We found a for loop
|
|
|
|
|
* -1: A .for statement with a bad syntax error, discard.
|
1994-03-05 03:34:29 +03:00
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* None.
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
int
|
2002-06-15 22:24:55 +04:00
|
|
|
|
For_Eval(char *line)
|
1994-03-05 03:34:29 +03:00
|
|
|
|
{
|
2008-12-01 01:37:55 +03:00
|
|
|
|
char *ptr = line, *sub;
|
|
|
|
|
int len;
|
2008-12-21 21:06:53 +03:00
|
|
|
|
int i;
|
|
|
|
|
int escapes;
|
2008-12-21 22:19:55 +03:00
|
|
|
|
int depth;
|
|
|
|
|
char ch;
|
2008-12-01 01:37:55 +03:00
|
|
|
|
|
|
|
|
|
/* Forget anything we previously knew about - it cannot be useful */
|
|
|
|
|
memset(&accumFor, 0, sizeof accumFor);
|
2008-11-29 20:50:11 +03:00
|
|
|
|
|
|
|
|
|
forLevel = 0;
|
|
|
|
|
for (ptr++; *ptr && isspace((unsigned char) *ptr); ptr++)
|
|
|
|
|
continue;
|
|
|
|
|
/*
|
|
|
|
|
* If we are not in a for loop quickly determine if the statement is
|
|
|
|
|
* a for.
|
|
|
|
|
*/
|
|
|
|
|
if (ptr[0] != 'f' || ptr[1] != 'o' || ptr[2] != 'r' ||
|
|
|
|
|
!isspace((unsigned char) ptr[3])) {
|
|
|
|
|
if (ptr[0] == 'e' && strncmp(ptr+1, "ndfor", 5) == 0) {
|
|
|
|
|
Parse_Error(PARSE_FATAL, "for-less endfor");
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
ptr += 3;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* we found a for loop, and now we are going to parse it.
|
|
|
|
|
*/
|
|
|
|
|
|
2008-12-01 01:37:55 +03:00
|
|
|
|
/* Grab the variables. Terminate on "in". */
|
|
|
|
|
for (;; ptr += len) {
|
1994-06-07 02:45:17 +04:00
|
|
|
|
while (*ptr && isspace((unsigned char) *ptr))
|
1994-03-05 03:34:29 +03:00
|
|
|
|
ptr++;
|
2008-12-01 01:37:55 +03:00
|
|
|
|
if (*ptr == '\0') {
|
|
|
|
|
Parse_Error(PARSE_FATAL, "missing `in' in for");
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
for (len = 1; ptr[len] && !isspace((unsigned char)ptr[len]); len++)
|
|
|
|
|
continue;
|
|
|
|
|
if (len == 2 && ptr[0] == 'i' && ptr[1] == 'n') {
|
|
|
|
|
ptr += 2;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2008-12-21 01:41:53 +03:00
|
|
|
|
strlist_add_str(&accumFor.vars, make_str(ptr, len));
|
2008-11-29 20:50:11 +03:00
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
2008-12-21 01:41:53 +03:00
|
|
|
|
if (strlist_num(&accumFor.vars) == 0) {
|
2008-11-29 20:50:11 +03:00
|
|
|
|
Parse_Error(PARSE_FATAL, "no iteration variables in for");
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
2000-04-17 02:08:06 +04:00
|
|
|
|
|
2008-11-29 20:50:11 +03:00
|
|
|
|
while (*ptr && isspace((unsigned char) *ptr))
|
|
|
|
|
ptr++;
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2008-11-29 20:50:11 +03:00
|
|
|
|
/*
|
|
|
|
|
* Make a list with the remaining words
|
2008-12-21 21:06:53 +03:00
|
|
|
|
* The values are substituted as ${:U<value>... so we must \ escape
|
|
|
|
|
* characters that break that syntax - particularly ':', maybe $ and \.
|
2008-11-29 20:50:11 +03:00
|
|
|
|
*/
|
|
|
|
|
sub = Var_Subst(NULL, ptr, VAR_GLOBAL, FALSE);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2008-12-21 01:41:53 +03:00
|
|
|
|
for (ptr = sub;; ptr += len) {
|
2008-12-01 01:37:55 +03:00
|
|
|
|
while (*ptr && isspace((unsigned char)*ptr))
|
|
|
|
|
ptr++;
|
|
|
|
|
if (*ptr == 0)
|
|
|
|
|
break;
|
2008-12-21 21:06:53 +03:00
|
|
|
|
escapes = 0;
|
|
|
|
|
for (len = 0; ptr[len] && !isspace((unsigned char)ptr[len]); len++)
|
|
|
|
|
if (ptr[len] == ':')
|
|
|
|
|
escapes++;
|
|
|
|
|
if (escapes == 0)
|
|
|
|
|
strlist_add_str(&accumFor.items, make_str(ptr, len));
|
|
|
|
|
else {
|
|
|
|
|
char *item = bmake_malloc(len + escapes + 1);
|
|
|
|
|
strlist_add_str(&accumFor.items, item);
|
2008-12-21 22:19:55 +03:00
|
|
|
|
for (depth= 0, i = 0; i < len; i++) {
|
|
|
|
|
ch = ptr[i];
|
|
|
|
|
/* Loose determination of nested variable definitions. */
|
|
|
|
|
if (ch == '(' || ch == '{')
|
|
|
|
|
depth++;
|
|
|
|
|
else if (ch == ')' || ch == '}')
|
|
|
|
|
depth--;
|
|
|
|
|
else if (ch == ':' && depth == 0)
|
2008-12-21 21:06:53 +03:00
|
|
|
|
*item++ = '\\';
|
2008-12-21 22:19:55 +03:00
|
|
|
|
*item++ = ch;
|
2008-12-21 21:06:53 +03:00
|
|
|
|
}
|
|
|
|
|
*item = 0;
|
|
|
|
|
}
|
2008-12-01 01:37:55 +03:00
|
|
|
|
}
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2008-12-01 01:37:55 +03:00
|
|
|
|
free(sub);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2008-12-21 01:41:53 +03:00
|
|
|
|
if (strlist_num(&accumFor.items) % strlist_num(&accumFor.vars)) {
|
2008-12-01 01:37:55 +03:00
|
|
|
|
Parse_Error(PARSE_FATAL,
|
|
|
|
|
"Wrong number of words in .for substitution list %d %d",
|
2008-12-21 01:41:53 +03:00
|
|
|
|
strlist_num(&accumFor.items), strlist_num(&accumFor.vars));
|
2008-12-01 01:37:55 +03:00
|
|
|
|
/*
|
|
|
|
|
* Return 'success' so that the body of the .for loop is accumulated.
|
|
|
|
|
* The loop will have zero iterations expanded due a later test.
|
|
|
|
|
*/
|
1994-03-05 03:34:29 +03:00
|
|
|
|
}
|
2008-11-29 20:50:11 +03:00
|
|
|
|
|
|
|
|
|
accumFor.buf = Buf_Init(0);
|
|
|
|
|
forLevel = 1;
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
2008-12-02 00:05:21 +03:00
|
|
|
|
/*
|
|
|
|
|
* Add another line to a .for loop.
|
|
|
|
|
* Returns 0 when the matching .enfor is reached.
|
|
|
|
|
*/
|
|
|
|
|
|
2008-11-29 20:50:11 +03:00
|
|
|
|
int
|
|
|
|
|
For_Accum(char *line)
|
|
|
|
|
{
|
|
|
|
|
char *ptr = line;
|
2007-01-02 00:31:51 +03:00
|
|
|
|
|
|
|
|
|
if (*ptr == '.') {
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
1994-06-07 02:45:17 +04:00
|
|
|
|
for (ptr++; *ptr && isspace((unsigned char) *ptr); ptr++)
|
1994-03-05 03:34:29 +03:00
|
|
|
|
continue;
|
|
|
|
|
|
1994-06-07 02:45:17 +04:00
|
|
|
|
if (strncmp(ptr, "endfor", 6) == 0 &&
|
2007-01-02 00:31:51 +03:00
|
|
|
|
(isspace((unsigned char) ptr[6]) || !ptr[6])) {
|
1994-03-05 03:34:29 +03:00
|
|
|
|
if (DEBUG(FOR))
|
2006-10-15 12:38:21 +04:00
|
|
|
|
(void)fprintf(debug_file, "For: end for %d\n", forLevel);
|
2008-11-29 20:50:11 +03:00
|
|
|
|
if (--forLevel <= 0)
|
1994-03-05 03:34:29 +03:00
|
|
|
|
return 0;
|
2007-01-02 00:31:51 +03:00
|
|
|
|
} else if (strncmp(ptr, "for", 3) == 0 &&
|
1994-06-07 02:45:17 +04:00
|
|
|
|
isspace((unsigned char) ptr[3])) {
|
1994-03-05 03:34:29 +03:00
|
|
|
|
forLevel++;
|
|
|
|
|
if (DEBUG(FOR))
|
2006-10-15 12:38:21 +04:00
|
|
|
|
(void)fprintf(debug_file, "For: new loop %d\n", forLevel);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2008-11-29 20:50:11 +03:00
|
|
|
|
Buf_AddBytes(accumFor.buf, strlen(line), (Byte *)line);
|
|
|
|
|
Buf_AddByte(accumFor.buf, (Byte)'\n');
|
|
|
|
|
return 1;
|
1994-03-05 03:34:29 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* For_Run --
|
2000-04-17 02:08:06 +04:00
|
|
|
|
* Run the for loop, imitating the actions of an include file
|
1994-03-05 03:34:29 +03:00
|
|
|
|
*
|
|
|
|
|
* Results:
|
|
|
|
|
* None.
|
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* None.
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
void
|
2004-03-06 06:57:07 +03:00
|
|
|
|
For_Run(int lineno)
|
1994-03-05 03:34:29 +03:00
|
|
|
|
{
|
1994-06-07 02:45:17 +04:00
|
|
|
|
For arg;
|
2008-12-21 01:41:53 +03:00
|
|
|
|
int i, len;
|
2008-12-21 21:06:53 +03:00
|
|
|
|
unsigned int num_items;
|
|
|
|
|
char *for_body;
|
2008-12-21 01:41:53 +03:00
|
|
|
|
char *var, *item;
|
2008-12-21 21:06:53 +03:00
|
|
|
|
char *cp;
|
|
|
|
|
char *cmd_cp;
|
|
|
|
|
char *body_end;
|
|
|
|
|
char ch;
|
|
|
|
|
Buffer cmds;
|
|
|
|
|
int short_var;
|
2000-04-17 02:08:06 +04:00
|
|
|
|
|
|
|
|
|
arg = accumFor;
|
2008-12-21 01:41:53 +03:00
|
|
|
|
memset(&accumFor, 0, sizeof accumFor);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
2008-12-21 21:06:53 +03:00
|
|
|
|
num_items = strlist_num(&arg.items);
|
|
|
|
|
if (num_items % strlist_num(&arg.vars))
|
2008-12-01 01:37:55 +03:00
|
|
|
|
/* Error message already printed */
|
2008-12-21 01:41:53 +03:00
|
|
|
|
goto out;
|
2000-04-17 02:08:06 +04:00
|
|
|
|
|
2008-12-21 21:06:53 +03:00
|
|
|
|
short_var = 0;
|
|
|
|
|
STRLIST_FOREACH(var, &arg.vars, i) {
|
|
|
|
|
if (var[1] == 0) {
|
|
|
|
|
short_var = 1;
|
|
|
|
|
break;
|
2000-06-06 08:56:52 +04:00
|
|
|
|
}
|
2000-04-17 02:08:06 +04:00
|
|
|
|
}
|
|
|
|
|
|
2008-12-21 21:06:53 +03:00
|
|
|
|
/*
|
|
|
|
|
* Scan the for loop body and replace references to the loop variables
|
|
|
|
|
* with variable references that expand to the required text.
|
|
|
|
|
* Using variable expansions ensures that the .for loop can't generate
|
|
|
|
|
* syntax, and that the later parsing will still see a variable.
|
|
|
|
|
* We assume that the null variable will never be defined.
|
|
|
|
|
*
|
|
|
|
|
* The detection of substitions of the loop control variable is naive.
|
|
|
|
|
* Many of the modifiers use \ to escape $ (not $) so it is possible
|
|
|
|
|
* to contrive a makefile where an unwanted substitution happens.
|
|
|
|
|
*
|
|
|
|
|
* Each loop expansion is fed back into the parser as if it were an
|
|
|
|
|
* include file. This means we have to generate the last iteration first.
|
|
|
|
|
*/
|
|
|
|
|
while (num_items != 0) {
|
|
|
|
|
num_items -= strlist_num(&arg.vars);
|
|
|
|
|
for_body = (char *)Buf_GetAll(arg.buf, &len);
|
|
|
|
|
body_end = for_body + len;
|
|
|
|
|
cmds = Buf_Init(len + 256);
|
|
|
|
|
cmd_cp = for_body;
|
|
|
|
|
for (cp = for_body; (cp = strchr(cp, '$')) != NULL;) {
|
|
|
|
|
ch = *++cp;
|
|
|
|
|
if (ch == '(' || ch == '{') {
|
|
|
|
|
char ech = ch == '(' ? ')' : '}';
|
|
|
|
|
cp++;
|
2008-12-29 13:12:30 +03:00
|
|
|
|
/* Check variable name against the .for loop variables */
|
2008-12-21 21:06:53 +03:00
|
|
|
|
STRLIST_FOREACH(var, &arg.vars, i) {
|
|
|
|
|
len = strlen(var);
|
|
|
|
|
if (memcmp(cp, var, len) != 0)
|
|
|
|
|
continue;
|
2008-12-29 13:12:30 +03:00
|
|
|
|
if (cp[len] != ':' && cp[len] != ech && cp[len] != '\\')
|
2008-12-21 21:06:53 +03:00
|
|
|
|
continue;
|
|
|
|
|
/* Found a variable match. Replace with ${:U<value> */
|
|
|
|
|
Buf_AddBytes(cmds, cp - cmd_cp, cmd_cp);
|
|
|
|
|
Buf_AddBytes(cmds, 2, ":U");
|
|
|
|
|
cp += len;
|
|
|
|
|
cmd_cp = cp;
|
|
|
|
|
item = strlist_str(&arg.items, num_items + i);
|
|
|
|
|
Buf_AddBytes(cmds, strlen(item), item);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
if (ch == 0)
|
|
|
|
|
break;
|
|
|
|
|
/* Probably a single character name, ignore $$ and stupid ones. */
|
|
|
|
|
if (!short_var || strchr("}):$", ch) != NULL) {
|
|
|
|
|
cp++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
STRLIST_FOREACH(var, &arg.vars, i) {
|
|
|
|
|
if (var[0] != ch || var[1] != 0)
|
|
|
|
|
continue;
|
|
|
|
|
/* Found a variable match. Replace with ${:U<value>} */
|
|
|
|
|
Buf_AddBytes(cmds, cp - cmd_cp, cmd_cp);
|
|
|
|
|
Buf_AddBytes(cmds, 3, "{:U");
|
|
|
|
|
cmd_cp = ++cp;
|
|
|
|
|
item = strlist_str(&arg.items, num_items + i);
|
|
|
|
|
Buf_AddBytes(cmds, strlen(item), item);
|
|
|
|
|
Buf_AddBytes(cmds, 1, "}");
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
Buf_AddBytes(cmds, body_end - cmd_cp, cmd_cp);
|
|
|
|
|
|
|
|
|
|
cp = Buf_GetAll(cmds, NULL);
|
|
|
|
|
if (DEBUG(FOR))
|
|
|
|
|
(void)fprintf(debug_file, "For: loop body:\n%s", cp);
|
|
|
|
|
Parse_SetInput(NULL, lineno, -1, cp);
|
|
|
|
|
Buf_Destroy(cmds, FALSE);
|
|
|
|
|
}
|
2000-04-17 02:08:06 +04:00
|
|
|
|
|
2008-12-21 01:41:53 +03:00
|
|
|
|
out:
|
|
|
|
|
strlist_clean(&arg.vars);
|
|
|
|
|
strlist_clean(&arg.items);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
|
|
|
|
|
Buf_Destroy(arg.buf, TRUE);
|
|
|
|
|
}
|