1 /* $NetBSD: cond.c,v 1.71 2015/12/02 00:28:24 sjg Exp $ */
4 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1988, 1989 by Adam de Boor
37 * Copyright (c) 1989 by Berkeley Softworks
38 * All rights reserved.
40 * This code is derived from software contributed to Berkeley by
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
73 static char rcsid[] = "$NetBSD: cond.c,v 1.71 2015/12/02 00:28:24 sjg Exp $";
75 #include <sys/cdefs.h>
78 static char sccsid[] = "@(#)cond.c 8.2 (Berkeley) 1/2/94";
80 __RCSID("$NetBSD: cond.c,v 1.71 2015/12/02 00:28:24 sjg Exp $");
87 * Functions to handle conditionals in a makefile.
90 * Cond_Eval Evaluate the conditional in the passed line.
95 #include <errno.h> /* For strtoul() error checking */
103 * The parsing of conditional expressions is based on this grammar:
108 * T -> defined(variable)
111 * T -> empty(varspec)
113 * T -> commands(name)
115 * T -> $(varspec) op value
116 * T -> $(varspec) == "string"
117 * T -> $(varspec) != "string"
121 * op -> == | != | > | < | >= | <=
123 * 'symbol' is some other symbol to which the default function (condDefProc)
126 * Tokens are scanned from the 'condExpr' string. The scanner (CondToken)
127 * will return TOK_AND for '&' and '&&', TOK_OR for '|' and '||',
128 * TOK_NOT for '!', TOK_LPAREN for '(', TOK_RPAREN for ')' and will evaluate
129 * the other terminal symbols, using either the default function or the
130 * function given in the terminal, and return the result as either TOK_TRUE
133 * TOK_FALSE is 0 and TOK_TRUE 1 so we can directly assign C comparisons.
135 * All Non-Terminal functions (CondE, CondF and CondT) return TOK_ERROR on
139 TOK_FALSE = 0, TOK_TRUE = 1, TOK_AND, TOK_OR, TOK_NOT,
140 TOK_LPAREN, TOK_RPAREN, TOK_EOF, TOK_NONE, TOK_ERROR
144 * Structures to handle elegantly the different forms of #if's. The
145 * last two fields are stored in condInvert and condDefProc, respectively.
147 static void CondPushBack(Token);
148 static int CondGetArg(char **, char **, const char *);
149 static Boolean CondDoDefined(int, const char *);
150 static int CondStrMatch(const void *, const void *);
151 static Boolean CondDoMake(int, const char *);
152 static Boolean CondDoExists(int, const char *);
153 static Boolean CondDoTarget(int, const char *);
154 static Boolean CondDoCommands(int, const char *);
155 static Boolean CondCvtArg(char *, double *);
156 static Token CondToken(Boolean);
157 static Token CondT(Boolean);
158 static Token CondF(Boolean);
159 static Token CondE(Boolean);
160 static int do_Cond_EvalExpression(Boolean *);
162 static const struct If {
163 const char *form; /* Form of if */
164 int formlen; /* Length of form */
165 Boolean doNot; /* TRUE if default function should be negated */
166 Boolean (*defProc)(int, const char *); /* Default function to apply */
168 { "def", 3, FALSE, CondDoDefined },
169 { "ndef", 4, TRUE, CondDoDefined },
170 { "make", 4, FALSE, CondDoMake },
171 { "nmake", 5, TRUE, CondDoMake },
172 { "", 0, FALSE, CondDoDefined },
173 { NULL, 0, FALSE, NULL }
176 static const struct If *if_info; /* Info for current statement */
177 static char *condExpr; /* The expression to parse */
178 static Token condPushBack=TOK_NONE; /* Single push-back token used in
181 static unsigned int cond_depth = 0; /* current .if nesting level */
182 static unsigned int cond_min_depth = 0; /* depth at makefile open */
185 * Indicate when we should be strict about lhs of comparisons.
186 * TRUE when Cond_EvalExpression is called from Cond_Eval (.if etc)
187 * FALSE when Cond_EvalExpression is called from var.c:ApplyModifiers
188 * since lhs is already expanded and we cannot tell if
189 * it was a variable reference or not.
191 static Boolean lhsStrict;
194 istoken(const char *str, const char *tok, size_t len)
196 return strncmp(str, tok, len) == 0 && !isalpha((unsigned char)str[len]);
200 *-----------------------------------------------------------------------
202 * Push back the most recent token read. We only need one level of
203 * this, so the thing is just stored in 'condPushback'.
206 * t Token to push back into the "stream"
212 * condPushback is overwritten.
214 *-----------------------------------------------------------------------
217 CondPushBack(Token t)
223 *-----------------------------------------------------------------------
225 * Find the argument of a built-in function.
228 * parens TRUE if arg should be bounded by parens
231 * The length of the argument and the address of the argument.
234 * The pointer is set to point to the closing parenthesis of the
237 *-----------------------------------------------------------------------
240 CondGetArg(char **linePtr, char **argPtr, const char *func)
250 /* Skip opening '(' - verfied by caller */
255 * No arguments whatsoever. Because 'make' and 'defined' aren't really
256 * "reserved words", we don't print a message. I think this is better
257 * than hitting the user with a warning message every time s/he uses
258 * the word 'make' or 'defined' at the beginning of a symbol...
264 while (*cp == ' ' || *cp == '\t') {
269 * Create a buffer for the argument and start it out at 16 characters
270 * long. Why 16? Why not?
277 if (ch == 0 || ch == ' ' || ch == '\t')
279 if ((ch == '&' || ch == '|') && paren_depth == 0)
283 * Parse the variable spec and install it as part of the argument
284 * if it's valid. We tell Var_Parse to complain on an undefined
285 * variable, so we don't do it too. Nor do we return an error,
286 * though perhaps we should...
292 cp2 = Var_Parse(cp, VAR_CMD, TRUE, TRUE, &len, &freeIt);
293 Buf_AddBytes(&buf, strlen(cp2), cp2);
302 if (ch == ')' && --paren_depth < 0)
304 Buf_AddByte(&buf, *cp);
308 *argPtr = Buf_GetAll(&buf, &argLen);
309 Buf_Destroy(&buf, FALSE);
311 while (*cp == ' ' || *cp == '\t') {
315 if (func != NULL && *cp++ != ')') {
316 Parse_Error(PARSE_WARNING, "Missing closing parenthesis for %s()",
326 *-----------------------------------------------------------------------
328 * Handle the 'defined' function for conditionals.
331 * TRUE if the given variable is defined.
336 *-----------------------------------------------------------------------
339 CondDoDefined(int argLen MAKE_ATTR_UNUSED, const char *arg)
344 if (Var_Value(arg, VAR_CMD, &p1) != NULL) {
355 *-----------------------------------------------------------------------
357 * Front-end for Str_Match so it returns 0 on match and non-zero
358 * on mismatch. Callback function for CondDoMake via Lst_Find
361 * 0 if string matches pattern
366 *-----------------------------------------------------------------------
369 CondStrMatch(const void *string, const void *pattern)
371 return(!Str_Match(string, pattern));
375 *-----------------------------------------------------------------------
377 * Handle the 'make' function for conditionals.
380 * TRUE if the given target is being made.
385 *-----------------------------------------------------------------------
388 CondDoMake(int argLen MAKE_ATTR_UNUSED, const char *arg)
390 return Lst_Find(create, arg, CondStrMatch) != NULL;
394 *-----------------------------------------------------------------------
396 * See if the given file exists.
399 * TRUE if the file exists and FALSE if it does not.
404 *-----------------------------------------------------------------------
407 CondDoExists(int argLen MAKE_ATTR_UNUSED, const char *arg)
412 path = Dir_FindFile(arg, dirSearchPath);
414 fprintf(debug_file, "exists(%s) result is \"%s\"\n",
415 arg, path ? path : "");
427 *-----------------------------------------------------------------------
429 * See if the given node exists and is an actual target.
432 * TRUE if the node exists as a target and FALSE if it does not.
437 *-----------------------------------------------------------------------
440 CondDoTarget(int argLen MAKE_ATTR_UNUSED, const char *arg)
444 gn = Targ_FindNode(arg, TARG_NOCREATE);
445 return (gn != NULL) && !OP_NOP(gn->type);
449 *-----------------------------------------------------------------------
451 * See if the given node exists and is an actual target with commands
452 * associated with it.
455 * TRUE if the node exists as a target and has commands associated with
456 * it and FALSE if it does not.
461 *-----------------------------------------------------------------------
464 CondDoCommands(int argLen MAKE_ATTR_UNUSED, const char *arg)
468 gn = Targ_FindNode(arg, TARG_NOCREATE);
469 return (gn != NULL) && !OP_NOP(gn->type) && !Lst_IsEmpty(gn->commands);
473 *-----------------------------------------------------------------------
475 * Convert the given number into a double.
476 * We try a base 10 or 16 integer conversion first, if that fails
477 * then we try a floating point conversion instead.
480 * Sets 'value' to double value of string.
481 * Returns 'true' if the convertion suceeded
483 *-----------------------------------------------------------------------
486 CondCvtArg(char *str, double *value)
497 l_val = strtoul(str, &eptr, str[1] == 'x' ? 16 : 10);
499 if (ech == 0 && errno != ERANGE) {
500 d_val = str[0] == '-' ? -(double)-l_val : (double)l_val;
502 if (ech != 0 && ech != '.' && ech != 'e' && ech != 'E')
504 d_val = strtod(str, &eptr);
514 *-----------------------------------------------------------------------
516 * Get a string from a variable reference or an optionally quoted
517 * string. This is called for the lhs and rhs of string compares.
520 * Sets freeIt if needed,
521 * Sets quoted if string was quoted,
522 * Returns NULL on error,
523 * else returns string - absent any quotes.
526 * Moves condExpr to end of this token.
529 *-----------------------------------------------------------------------
531 /* coverity:[+alloc : arg-*2] */
533 CondGetString(Boolean doEval, Boolean *quoted, void **freeIt, Boolean strictLHS)
545 *quoted = qt = *condExpr == '"' ? 1 : 0;
548 for (start = condExpr; *condExpr && str == NULL; condExpr++) {
551 if (condExpr[1] != '\0') {
553 Buf_AddByte(&buf, *condExpr);
558 condExpr++; /* we don't want the quotes */
561 Buf_AddByte(&buf, *condExpr); /* likely? */
573 Buf_AddByte(&buf, *condExpr);
576 /* if we are in quotes, then an undefined variable is ok */
577 str = Var_Parse(condExpr, VAR_CMD, (qt ? 0 : doEval),
579 if (str == var_Error) {
585 * Even if !doEval, we still report syntax errors, which
586 * is what getting var_Error back with !doEval means.
593 * If the '$' was first char (no quotes), and we are
594 * followed by space, the operator or end of expression,
597 if ((condExpr == start + len) &&
598 (*condExpr == '\0' ||
599 isspace((unsigned char) *condExpr) ||
600 strchr("!=><)", *condExpr))) {
604 * Nope, we better copy str to buf
606 for (cp = str; *cp; cp++) {
607 Buf_AddByte(&buf, *cp);
613 str = NULL; /* not finished yet */
614 condExpr--; /* don't skip over next char */
617 if (strictLHS && !qt && *start != '$' &&
618 !isdigit((unsigned char) *start)) {
619 /* lhs must be quoted, a variable reference or number */
627 Buf_AddByte(&buf, *condExpr);
632 str = Buf_GetAll(&buf, NULL);
635 Buf_Destroy(&buf, FALSE);
640 *-----------------------------------------------------------------------
642 * Return the next token from the input.
645 * A Token for the next lexical token in the stream.
648 * condPushback will be set back to TOK_NONE if it is used.
650 *-----------------------------------------------------------------------
653 compare_expression(Boolean doEval)
667 lhsFree = rhsFree = FALSE;
668 lhsQuoted = rhsQuoted = FALSE;
671 * Parse the variable spec and skip over it, saving its
674 lhs = CondGetString(doEval, &lhsQuoted, &lhsFree, lhsStrict);
679 * Skip whitespace to get to the operator
681 while (isspace((unsigned char) *condExpr))
685 * Make sure the operator is a valid one. If it isn't a
686 * known relational operator, pretend we got a
695 if (condExpr[1] == '=') {
706 /* For .ifxxx "..." check for non-empty string. */
711 /* For .ifxxx <number> compare against zero */
712 if (CondCvtArg(lhs, &left)) {
716 /* For .if ${...} check for non-empty string (defProc is ifdef). */
717 if (if_info->form[0] == 0) {
721 /* Otherwise action default test ... */
722 t = if_info->defProc(strlen(lhs), lhs) != if_info->doNot;
726 while (isspace((unsigned char)*condExpr))
729 if (*condExpr == '\0') {
730 Parse_Error(PARSE_WARNING,
731 "Missing right-hand-side of operator");
735 rhs = CondGetString(doEval, &rhsQuoted, &rhsFree, FALSE);
739 if (rhsQuoted || lhsQuoted) {
741 if (((*op != '!') && (*op != '=')) || (op[1] != '=')) {
742 Parse_Error(PARSE_WARNING,
743 "String comparison operator should be either == or !=");
748 fprintf(debug_file, "lhs = \"%s\", rhs = \"%s\", op = %.2s\n",
752 * Null-terminate rhs and perform the comparison.
753 * t is set to the result.
756 t = strcmp(lhs, rhs) == 0;
758 t = strcmp(lhs, rhs) != 0;
762 * rhs is either a float or an integer. Convert both the
763 * lhs and the rhs to a double and compare the two.
766 if (!CondCvtArg(lhs, &left) || !CondCvtArg(rhs, &right))
767 goto do_string_compare;
770 fprintf(debug_file, "left = %f, right = %f, op = %.2s\n", left,
776 Parse_Error(PARSE_WARNING,
784 Parse_Error(PARSE_WARNING,
816 get_mpt_arg(char **linePtr, char **argPtr, const char *func MAKE_ATTR_UNUSED)
819 * Use Var_Parse to parse the spec in parens and return
820 * TOK_TRUE if the resulting string is empty.
827 /* We do all the work here and return the result as the length */
830 val = Var_Parse(cp - 1, VAR_CMD, FALSE, TRUE, &length, &freeIt);
832 * Advance *linePtr to beyond the closing ). Note that
833 * we subtract one because 'length' is calculated from 'cp - 1'.
835 *linePtr = cp - 1 + length;
837 if (val == var_Error) {
842 /* A variable is empty when it just contains spaces... 4/15/92, christos */
843 while (isspace(*(unsigned char *)val))
847 * For consistency with the other functions we can't generate the
850 length = *val ? 2 : 1;
857 CondDoEmpty(int arglen, const char *arg MAKE_ATTR_UNUSED)
863 compare_function(Boolean doEval)
865 static const struct fn_def {
868 int (*fn_getarg)(char **, char **, const char *);
869 Boolean (*fn_proc)(int, const char *);
871 { "defined", 7, CondGetArg, CondDoDefined },
872 { "make", 4, CondGetArg, CondDoMake },
873 { "exists", 6, CondGetArg, CondDoExists },
874 { "empty", 5, get_mpt_arg, CondDoEmpty },
875 { "target", 6, CondGetArg, CondDoTarget },
876 { "commands", 8, CondGetArg, CondDoCommands },
877 { NULL, 0, NULL, NULL },
879 const struct fn_def *fn_def;
886 for (fn_def = fn_defs; fn_def->fn_name != NULL; fn_def++) {
887 if (!istoken(cp, fn_def->fn_name, fn_def->fn_name_len))
889 cp += fn_def->fn_name_len;
890 /* There can only be whitespace before the '(' */
891 while (isspace(*(unsigned char *)cp))
896 arglen = fn_def->fn_getarg(&cp, &arg, fn_def->fn_name);
899 return arglen < 0 ? TOK_ERROR : TOK_FALSE;
901 /* Evaluate the argument using the required function. */
902 t = !doEval || fn_def->fn_proc(arglen, arg);
909 /* Push anything numeric through the compare expression */
911 if (isdigit((unsigned char)cp[0]) || strchr("+-", cp[0]))
912 return compare_expression(doEval);
915 * Most likely we have a naked token to apply the default function to.
916 * However ".if a == b" gets here when the "a" is unquoted and doesn't
917 * start with a '$'. This surprises people.
918 * If what follows the function argument is a '=' or '!' then the syntax
919 * would be invalid if we did "defined(a)" - so instead treat as an
922 arglen = CondGetArg(&cp, &arg, NULL);
923 for (cp1 = cp; isspace(*(unsigned char *)cp1); cp1++)
925 if (*cp1 == '=' || *cp1 == '!')
926 return compare_expression(doEval);
930 * Evaluate the argument using the default function.
931 * This path always treats .if as .ifdef. To get here the character
932 * after .if must have been taken literally, so the argument cannot
933 * be empty - even if it contained a variable expansion.
935 t = !doEval || if_info->defProc(arglen, arg) != if_info->doNot;
942 CondToken(Boolean doEval)
948 condPushBack = TOK_NONE;
952 while (*condExpr == ' ' || *condExpr == '\t') {
967 if (condExpr[1] == '|') {
974 if (condExpr[1] == '&') {
991 return compare_expression(doEval);
994 return compare_function(doEval);
999 *-----------------------------------------------------------------------
1001 * Parse a single term in the expression. This consists of a terminal
1002 * symbol or TOK_NOT and a terminal symbol (not including the binary
1004 * T -> defined(variable) | make(target) | exists(file) | symbol
1008 * TOK_TRUE, TOK_FALSE or TOK_ERROR.
1011 * Tokens are consumed.
1013 *-----------------------------------------------------------------------
1016 CondT(Boolean doEval)
1020 t = CondToken(doEval);
1024 * If we reached the end of the expression, the expression
1028 } else if (t == TOK_LPAREN) {
1033 if (t != TOK_ERROR) {
1034 if (CondToken(doEval) != TOK_RPAREN) {
1038 } else if (t == TOK_NOT) {
1040 if (t == TOK_TRUE) {
1042 } else if (t == TOK_FALSE) {
1050 *-----------------------------------------------------------------------
1052 * Parse a conjunctive factor (nice name, wot?)
1056 * TOK_TRUE, TOK_FALSE or TOK_ERROR
1059 * Tokens are consumed.
1061 *-----------------------------------------------------------------------
1064 CondF(Boolean doEval)
1069 if (l != TOK_ERROR) {
1070 o = CondToken(doEval);
1076 * If T is TOK_FALSE, the whole thing will be TOK_FALSE, but we have to
1077 * parse the r.h.s. anyway (to throw it away).
1078 * If T is TOK_TRUE, the result is the r.h.s., be it an TOK_ERROR or no.
1080 if (l == TOK_TRUE) {
1096 *-----------------------------------------------------------------------
1098 * Main expression production.
1102 * TOK_TRUE, TOK_FALSE or TOK_ERROR.
1105 * Tokens are, of course, consumed.
1107 *-----------------------------------------------------------------------
1110 CondE(Boolean doEval)
1115 if (l != TOK_ERROR) {
1116 o = CondToken(doEval);
1122 * A similar thing occurs for ||, except that here we make sure
1123 * the l.h.s. is TOK_FALSE before we bother to evaluate the r.h.s.
1124 * Once again, if l is TOK_FALSE, the result is the r.h.s. and once
1125 * again if l is TOK_TRUE, we parse the r.h.s. to throw it away.
1127 if (l == TOK_FALSE) {
1143 *-----------------------------------------------------------------------
1144 * Cond_EvalExpression --
1145 * Evaluate an expression in the passed line. The expression
1146 * consists of &&, ||, !, make(target), defined(variable)
1147 * and parenthetical groupings thereof.
1150 * COND_PARSE if the condition was valid grammatically
1151 * COND_INVALID if not a valid conditional.
1153 * (*value) is set to the boolean value of the condition
1158 *-----------------------------------------------------------------------
1161 Cond_EvalExpression(const struct If *info, char *line, Boolean *value, int eprint, Boolean strictLHS)
1163 static const struct If *dflt_info;
1164 const struct If *sv_if_info = if_info;
1165 char *sv_condExpr = condExpr;
1166 Token sv_condPushBack = condPushBack;
1169 lhsStrict = strictLHS;
1171 while (*line == ' ' || *line == '\t')
1174 if (info == NULL && (info = dflt_info) == NULL) {
1175 /* Scan for the entry for .if - it can't be first */
1176 for (info = ifs; ; info++)
1177 if (info->form[0] == 0)
1182 if_info = info != NULL ? info : ifs + 4;
1184 condPushBack = TOK_NONE;
1186 rval = do_Cond_EvalExpression(value);
1188 if (rval == COND_INVALID && eprint)
1189 Parse_Error(PARSE_FATAL, "Malformed conditional (%s)", line);
1191 if_info = sv_if_info;
1192 condExpr = sv_condExpr;
1193 condPushBack = sv_condPushBack;
1199 do_Cond_EvalExpression(Boolean *value)
1202 switch (CondE(TRUE)) {
1204 if (CondToken(TRUE) == TOK_EOF) {
1210 if (CondToken(TRUE) == TOK_EOF) {
1220 return COND_INVALID;
1225 *-----------------------------------------------------------------------
1227 * Evaluate the conditional in the passed line. The line
1229 * .<cond-type> <expr>
1230 * where <cond-type> is any of if, ifmake, ifnmake, ifdef,
1231 * ifndef, elif, elifmake, elifnmake, elifdef, elifndef
1232 * and <expr> consists of &&, ||, !, make(target), defined(variable)
1233 * and parenthetical groupings thereof.
1236 * line Line to parse
1239 * COND_PARSE if should parse lines after the conditional
1240 * COND_SKIP if should skip lines after the conditional
1241 * COND_INVALID if not a valid conditional.
1246 * Note that the states IF_ACTIVE and ELSE_ACTIVE are only different in order
1247 * to detect splurious .else lines (as are SKIP_TO_ELSE and SKIP_TO_ENDIF)
1248 * otherwise .else could be treated as '.elif 1'.
1250 *-----------------------------------------------------------------------
1253 Cond_Eval(char *line)
1255 #define MAXIF 128 /* maximum depth of .if'ing */
1256 #define MAXIF_BUMP 32 /* how much to grow by */
1258 IF_ACTIVE, /* .if or .elif part active */
1259 ELSE_ACTIVE, /* .else part active */
1260 SEARCH_FOR_ELIF, /* searching for .elif/else to execute */
1261 SKIP_TO_ELSE, /* has been true, but not seen '.else' */
1262 SKIP_TO_ENDIF /* nothing else to execute */
1264 static enum if_states *cond_state = NULL;
1265 static unsigned int max_if_depth = MAXIF;
1267 const struct If *ifp;
1270 int level; /* Level at which to report errors. */
1271 enum if_states state;
1273 level = PARSE_FATAL;
1275 cond_state = bmake_malloc(max_if_depth * sizeof(*cond_state));
1276 cond_state[0] = IF_ACTIVE;
1278 /* skip leading character (the '.') and any whitespace */
1279 for (line++; *line == ' ' || *line == '\t'; line++)
1282 /* Find what type of if we're dealing with. */
1283 if (line[0] == 'e') {
1284 if (line[1] != 'l') {
1285 if (!istoken(line + 1, "ndif", 4))
1286 return COND_INVALID;
1287 /* End of conditional section */
1288 if (cond_depth == cond_min_depth) {
1289 Parse_Error(level, "if-less endif");
1292 /* Return state for previous conditional */
1294 return cond_state[cond_depth] <= ELSE_ACTIVE ? COND_PARSE : COND_SKIP;
1297 /* Quite likely this is 'else' or 'elif' */
1299 if (istoken(line, "se", 2)) {
1301 if (cond_depth == cond_min_depth) {
1302 Parse_Error(level, "if-less else");
1306 state = cond_state[cond_depth];
1308 case SEARCH_FOR_ELIF:
1309 state = ELSE_ACTIVE;
1313 Parse_Error(PARSE_WARNING, "extra else");
1318 state = SKIP_TO_ENDIF;
1321 cond_state[cond_depth] = state;
1322 return state <= ELSE_ACTIVE ? COND_PARSE : COND_SKIP;
1324 /* Assume for now it is an elif */
1329 if (line[0] != 'i' || line[1] != 'f')
1330 /* Not an ifxxx or elifxxx line */
1331 return COND_INVALID;
1334 * Figure out what sort of conditional it is -- what its default
1335 * function is, etc. -- by looking in the table of valid "ifs"
1338 for (ifp = ifs; ; ifp++) {
1339 if (ifp->form == NULL)
1340 return COND_INVALID;
1341 if (istoken(ifp->form, line, ifp->formlen)) {
1342 line += ifp->formlen;
1347 /* Now we know what sort of 'if' it is... */
1350 if (cond_depth == cond_min_depth) {
1351 Parse_Error(level, "if-less elif");
1354 state = cond_state[cond_depth];
1355 if (state == SKIP_TO_ENDIF || state == ELSE_ACTIVE) {
1356 Parse_Error(PARSE_WARNING, "extra elif");
1357 cond_state[cond_depth] = SKIP_TO_ENDIF;
1360 if (state != SEARCH_FOR_ELIF) {
1361 /* Either just finished the 'true' block, or already SKIP_TO_ELSE */
1362 cond_state[cond_depth] = SKIP_TO_ELSE;
1367 if (cond_depth + 1 >= max_if_depth) {
1369 * This is rare, but not impossible.
1370 * In meta mode, dirdeps.mk (only runs at level 0)
1371 * can need more than the default.
1373 max_if_depth += MAXIF_BUMP;
1374 cond_state = bmake_realloc(cond_state, max_if_depth *
1375 sizeof(*cond_state));
1377 state = cond_state[cond_depth];
1379 if (state > ELSE_ACTIVE) {
1380 /* If we aren't parsing the data, treat as always false */
1381 cond_state[cond_depth] = SKIP_TO_ELSE;
1386 /* And evaluate the conditional expresssion */
1387 if (Cond_EvalExpression(ifp, line, &value, 1, TRUE) == COND_INVALID) {
1388 /* Syntax error in conditional, error message already output. */
1389 /* Skip everything to matching .endif */
1390 cond_state[cond_depth] = SKIP_TO_ELSE;
1395 cond_state[cond_depth] = SEARCH_FOR_ELIF;
1398 cond_state[cond_depth] = IF_ACTIVE;
1405 *-----------------------------------------------------------------------
1407 * Make sure everything's clean at the end of a makefile.
1413 * Parse_Error will be called if open conditionals are around.
1415 *-----------------------------------------------------------------------
1418 Cond_restore_depth(unsigned int saved_depth)
1420 int open_conds = cond_depth - cond_min_depth;
1422 if (open_conds != 0 || saved_depth > cond_depth) {
1423 Parse_Error(PARSE_FATAL, "%d open conditional%s", open_conds,
1424 open_conds == 1 ? "" : "s");
1425 cond_depth = cond_min_depth;
1428 cond_min_depth = saved_depth;
1432 Cond_save_depth(void)
1434 int depth = cond_min_depth;
1436 cond_min_depth = cond_depth;