2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1988, 1989 by Adam de Boor
5 * Copyright (c) 1989 by Berkeley Softworks
8 * This code is derived from software contributed to Berkeley by
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)cond.c 8.2 (Berkeley) 1/2/94
40 * $FreeBSD: src/usr.bin/make/cond.c,v 1.12.2.1 2003/07/22 08:03:13 ru Exp $
41 * $DragonFly: src/usr.bin/make/cond.c,v 1.18 2004/12/17 21:09:04 okumoto Exp $
46 * Functions to handle conditionals in a makefile.
49 * Cond_Eval Evaluate the conditional in the passed line.
61 * The parsing of conditional expressions is based on this grammar:
66 * T -> defined(variable)
72 * T -> $(varspec) op value
73 * T -> $(varspec) == "string"
74 * T -> $(varspec) != "string"
77 * op -> == | != | > | < | >= | <=
79 * 'symbol' is some other symbol to which the default function (condDefProc)
82 * Tokens are scanned from the 'condExpr' string. The scanner (CondToken)
83 * will return And for '&' and '&&', Or for '|' and '||', Not for '!',
84 * LParen for '(', RParen for ')' and will evaluate the other terminal
85 * symbols, using either the default function or the function given in the
86 * terminal, and return the result as either True or False.
88 * All Non-Terminal functions (CondE, CondF and CondT) return Err on error.
91 And, Or, Not, True, False, LParen, RParen, EndOfFile, None, Err
95 * Structures to handle elegantly the different forms of #if's. The
96 * last two fields are stored in condInvert and condDefProc, respectively.
98 static void CondPushBack(Token);
99 static int CondGetArg(char **, char **, char *, Boolean);
100 static Boolean CondDoDefined(int, char *);
101 static Boolean CondDoMake(int, char *);
102 static Boolean CondDoExists(int, char *);
103 static Boolean CondDoTarget(int, char *);
104 static char * CondCvtArg(char *, double *);
105 static Token CondToken(Boolean);
106 static Token CondT(Boolean);
107 static Token CondF(Boolean);
108 static Token CondE(Boolean);
111 char *form; /* Form of if */
112 int formlen; /* Length of form */
113 Boolean doNot; /* TRUE if default function should be negated */
114 Boolean (*defProc)(int, char *); /* Default function to apply */
116 { "ifdef", 5, FALSE, CondDoDefined },
117 { "ifndef", 6, TRUE, CondDoDefined },
118 { "ifmake", 6, FALSE, CondDoMake },
119 { "ifnmake", 7, TRUE, CondDoMake },
120 { "if", 2, FALSE, CondDoDefined },
121 { NULL, 0, FALSE, NULL }
124 static Boolean condInvert; /* Invert the default function */
125 static Boolean (*condDefProc) /* Default function to apply */
127 static char *condExpr; /* The expression to parse */
128 static Token condPushBack=None; /* Single push-back token used in
131 #define MAXIF 30 /* greatest depth of #if'ing */
133 static Boolean condStack[MAXIF]; /* Stack of conditionals's values */
134 static int condLineno[MAXIF]; /* Line numbers of the opening .if */
135 static int condTop = MAXIF; /* Top-most conditional */
136 static int skipIfLevel=0; /* Depth of skipped conditionals */
137 static int skipIfLineno[MAXIF]; /* Line numbers of skipped .ifs */
138 static Boolean skipLine = FALSE; /* Whether the parse module is skipping
142 *-----------------------------------------------------------------------
144 * Push back the most recent token read. We only need one level of
145 * this, so the thing is just stored in 'condPushback'.
151 * condPushback is overwritten.
153 *-----------------------------------------------------------------------
156 CondPushBack(Token t)
163 *-----------------------------------------------------------------------
165 * Find the argument of a built-in function. parens is set to TRUE
166 * if the arguments are bounded by parens.
169 * The length of the argument and the address of the argument.
172 * The pointer is set to point to the closing parenthesis of the
175 *-----------------------------------------------------------------------
178 CondGetArg(char **linePtr, char **argPtr, char *func, Boolean parens)
186 while (*cp != '(' && *cp != '\0') {
196 * No arguments whatsoever. Because 'make' and 'defined' aren't really
197 * "reserved words", we don't print a message. I think this is better
198 * than hitting the user with a warning message every time s/he uses
199 * the word 'make' or 'defined' at the beginning of a symbol...
205 while (*cp == ' ' || *cp == '\t') {
210 * Create a buffer for the argument and start it out at 16 characters
211 * long. Why 16? Why not?
215 while ((strchr(" \t)&|", *cp) == NULL) && (*cp != '\0')) {
218 * Parse the variable spec and install it as part of the argument
219 * if it's valid. We tell Var_Parse to complain on an undefined
220 * variable, so we don't do it too. Nor do we return an error,
221 * though perhaps we should...
227 cp2 = Var_Parse(cp, VAR_CMD, TRUE, &len, &doFree);
229 Buf_AddBytes(buf, strlen(cp2), (Byte *)cp2);
235 Buf_AddByte(buf, (Byte)*cp);
240 Buf_AddByte(buf, (Byte)'\0');
241 *argPtr = (char *)Buf_GetAll(buf, &argLen);
242 Buf_Destroy(buf, FALSE);
244 while (*cp == ' ' || *cp == '\t') {
247 if (parens && *cp != ')') {
248 Parse_Error(PARSE_WARNING, "Missing closing parenthesis for %s()",
253 * Advance pointer past close parenthesis.
263 *-----------------------------------------------------------------------
265 * Handle the 'defined' function for conditionals.
268 * TRUE if the given variable is defined.
273 *-----------------------------------------------------------------------
276 CondDoDefined(int argLen, char *arg)
278 char savec = arg[argLen];
283 if (Var_Value(arg, VAR_CMD, &p1) != NULL) {
294 *-----------------------------------------------------------------------
296 * Front-end for Str_Match so it returns 0 on match and non-zero
297 * on mismatch. Callback function for CondDoMake via Lst_Find
300 * 0 if string matches pattern
305 *-----------------------------------------------------------------------
308 CondStrMatch(const void *string, const void *pattern)
311 return (!Str_Match(string, pattern));
315 *-----------------------------------------------------------------------
317 * Handle the 'make' function for conditionals.
320 * TRUE if the given target is being made.
325 *-----------------------------------------------------------------------
328 CondDoMake(int argLen, char *arg)
330 char savec = arg[argLen];
334 if (Lst_Find(&create, arg, CondStrMatch) == NULL) {
344 *-----------------------------------------------------------------------
346 * See if the given file exists.
349 * TRUE if the file exists and FALSE if it does not.
354 *-----------------------------------------------------------------------
357 CondDoExists(int argLen, char *arg)
359 char savec = arg[argLen];
364 path = Dir_FindFile(arg, &dirSearchPath);
376 *-----------------------------------------------------------------------
378 * See if the given node exists and is an actual target.
381 * TRUE if the node exists as a target and FALSE if it does not.
386 *-----------------------------------------------------------------------
389 CondDoTarget(int argLen, char *arg)
391 char savec = arg[argLen];
396 gn = Targ_FindNode(arg, TARG_NOCREATE);
397 if ((gn != NULL) && !OP_NOP(gn->type)) {
407 *-----------------------------------------------------------------------
409 * Convert the given number into a double. If the number begins
410 * with 0x, it is interpreted as a hexadecimal integer
411 * and converted to a double from there. All other strings just have
412 * strtod called on them.
415 * Sets 'value' to double value of string.
416 * Returns address of the first character after the last valid
417 * character of the converted number.
420 * Can change 'value' even if string is not a valid number.
423 *-----------------------------------------------------------------------
426 CondCvtArg(char *str, double *value)
428 if ((*str == '0') && (str[1] == 'x')) {
431 for (str += 2, i = 0; ; str++) {
433 if (isdigit((unsigned char)*str))
435 else if (isxdigit((unsigned char)*str))
436 x = 10 + *str - isupper((unsigned char)*str) ? 'A' : 'a';
446 *value = strtod(str, &eptr);
452 *-----------------------------------------------------------------------
454 * Return the next token from the input.
457 * A Token for the next lexical token in the stream.
460 * condPushback will be set back to None if it is used.
462 *-----------------------------------------------------------------------
465 CondToken(Boolean doEval)
469 if (condPushBack == None) {
470 while (*condExpr == ' ' || *condExpr == '\t') {
483 if (condExpr[1] == '|') {
490 if (condExpr[1] == '&') {
512 * Parse the variable spec and skip over it, saving its
516 lhs = Var_Parse(condExpr, VAR_CMD, doEval,
517 &varSpecLen, &doFree);
518 if (lhs == var_Error) {
520 * Even if !doEval, we still report syntax errors, which
521 * is what getting var_Error back with !doEval means.
525 condExpr += varSpecLen;
527 if (!isspace((unsigned char)*condExpr) &&
528 strchr("!=><", *condExpr) == NULL) {
534 for (cp = lhs; *cp; cp++)
535 Buf_AddByte(buf, (Byte)*cp);
540 for (;*condExpr && !isspace((unsigned char) *condExpr);
542 Buf_AddByte(buf, (Byte)*condExpr);
544 Buf_AddByte(buf, (Byte)'\0');
545 lhs = (char *)Buf_GetAll(buf, &varSpecLen);
546 Buf_Destroy(buf, FALSE);
552 * Skip whitespace to get to the operator
554 while (isspace((unsigned char)*condExpr))
558 * Make sure the operator is a valid one. If it isn't a
559 * known relational operator, pretend we got a
568 if (condExpr[1] == '=') {
580 while (isspace((unsigned char)*condExpr)) {
583 if (*condExpr == '\0') {
584 Parse_Error(PARSE_WARNING,
585 "Missing right-hand-side of operator");
592 * Doing a string comparison. Only allow == and != for
601 if (((*op != '!') && (*op != '=')) || (op[1] != '=')) {
602 Parse_Error(PARSE_WARNING,
603 "String comparison operator should be either == or !=");
608 qt = *rhs == '"' ? 1 : 0;
611 ((qt && (*cp != '"')) ||
612 (!qt && strchr(" \t)", *cp) == NULL)) &&
613 (*cp != '\0'); cp++) {
614 if ((*cp == '\\') && (cp[1] != '\0')) {
616 * Backslash escapes things -- skip over next
617 * character, if it exists.
620 Buf_AddByte(buf, (Byte)*cp);
621 } else if (*cp == '$') {
625 cp2 = Var_Parse(cp, VAR_CMD, doEval, &len, &freeIt);
626 if (cp2 != var_Error) {
627 Buf_AddBytes(buf, strlen(cp2), (Byte *)cp2);
633 Buf_AddByte(buf, (Byte)*cp);
636 Buf_AddByte(buf, (Byte)*cp);
640 Buf_AddByte(buf, (Byte)0);
642 string = (char *)Buf_GetAll(buf, (size_t *)NULL);
643 Buf_Destroy(buf, FALSE);
645 DEBUGF(COND, ("lhs = \"%s\", rhs = \"%s\", op = %.2s\n",
648 * Null-terminate rhs and perform the comparison.
649 * t is set to the result.
652 t = strcmp(lhs, string) ? False : True;
654 t = strcmp(lhs, string) ? True : False;
657 if (rhs == condExpr) {
658 if (!qt && *cp == ')')
665 * rhs is either a float or an integer. Convert both the
666 * lhs and the rhs to a double and compare the two.
671 if (*CondCvtArg(lhs, &left) != '\0')
672 goto do_string_compare;
677 string = Var_Parse(rhs, VAR_CMD, doEval, &len, &freeIt);
678 if (string == var_Error) {
681 if (*CondCvtArg(string, &right) != '\0') {
684 goto do_string_compare;
692 char *c = CondCvtArg(rhs, &right);
694 goto do_string_compare;
695 if (rhs == condExpr) {
697 * Skip over the right-hand side
703 DEBUGF(COND, ("left = %f, right = %f, op = %.2s\n", left,
708 Parse_Error(PARSE_WARNING,
712 t = (left != right ? True : False);
716 Parse_Error(PARSE_WARNING,
720 t = (left == right ? True : False);
724 t = (left <= right ? True : False);
726 t = (left < right ? True : False);
731 t = (left >= right ? True : False);
733 t = (left > right ? True : False);
746 Boolean (*evalProc)(int, char *);
747 Boolean invert = FALSE;
751 if (strncmp(condExpr, "defined", 7) == 0) {
753 * Use CondDoDefined to evaluate the argument and
754 * CondGetArg to extract the argument from the 'function
757 evalProc = CondDoDefined;
759 arglen = CondGetArg(&condExpr, &arg, "defined", TRUE);
764 } else if (strncmp(condExpr, "make", 4) == 0) {
766 * Use CondDoMake to evaluate the argument and
767 * CondGetArg to extract the argument from the 'function
770 evalProc = CondDoMake;
772 arglen = CondGetArg(&condExpr, &arg, "make", TRUE);
777 } else if (strncmp(condExpr, "exists", 6) == 0) {
779 * Use CondDoExists to evaluate the argument and
780 * CondGetArg to extract the argument from the
783 evalProc = CondDoExists;
785 arglen = CondGetArg(&condExpr, &arg, "exists", TRUE);
790 } else if (strncmp(condExpr, "empty", 5) == 0) {
792 * Use Var_Parse to parse the spec in parens and return
793 * True if the resulting string is empty.
802 condExpr[arglen] != '(' && condExpr[arglen] != '\0';
806 if (condExpr[arglen] != '\0') {
807 val = Var_Parse(&condExpr[arglen - 1], VAR_CMD,
808 FALSE, &length, &doFree);
809 if (val == var_Error) {
813 * A variable is empty when it just contains
814 * spaces... 4/15/92, christos
817 for (p = val; *p && isspace((unsigned char)*p); p++)
819 t = (*p == '\0') ? True : False;
825 * Advance condExpr to beyond the closing ). Note that
826 * we subtract one from arglen + length b/c length
827 * is calculated from condExpr[arglen - 1].
829 condExpr += arglen + length - 1;
835 } else if (strncmp(condExpr, "target", 6) == 0) {
837 * Use CondDoTarget to evaluate the argument and
838 * CondGetArg to extract the argument from the
841 evalProc = CondDoTarget;
843 arglen = CondGetArg(&condExpr, &arg, "target", TRUE);
850 * The symbol is itself the argument to the default
851 * function. We advance condExpr to the end of the symbol
852 * by hand (the next whitespace, closing paren or
853 * binary operator) and set to invert the evaluation
854 * function if condInvert is TRUE.
858 evalProc = condDefProc;
859 arglen = CondGetArg(&condExpr, &arg, "", FALSE);
863 * Evaluate the argument using the set function. If invert
864 * is TRUE, we invert the sense of the function.
866 t = (!doEval || (* evalProc) (arglen, arg) ?
867 (invert ? False : True) :
868 (invert ? True : False));
881 *-----------------------------------------------------------------------
883 * Parse a single term in the expression. This consists of a terminal
884 * symbol or Not and a terminal symbol (not including the binary
886 * T -> defined(variable) | make(target) | exists(file) | symbol
890 * True, False or Err.
893 * Tokens are consumed.
895 *-----------------------------------------------------------------------
898 CondT(Boolean doEval)
902 t = CondToken(doEval);
904 if (t == EndOfFile) {
906 * If we reached the end of the expression, the expression
910 } else if (t == LParen) {
916 if (CondToken(doEval) != RParen) {
920 } else if (t == Not) {
924 } else if (t == False) {
932 *-----------------------------------------------------------------------
934 * Parse a conjunctive factor (nice name, wot?)
941 * Tokens are consumed.
943 *-----------------------------------------------------------------------
946 CondF(Boolean doEval)
952 o = CondToken(doEval);
958 * If T is False, the whole thing will be False, but we have to
959 * parse the r.h.s. anyway (to throw it away).
960 * If T is True, the result is the r.h.s., be it an Err or no.
978 *-----------------------------------------------------------------------
980 * Main expression production.
984 * True, False or Err.
987 * Tokens are, of course, consumed.
989 *-----------------------------------------------------------------------
992 CondE(Boolean doEval)
998 o = CondToken(doEval);
1004 * A similar thing occurs for ||, except that here we make sure
1005 * the l.h.s. is False before we bother to evaluate the r.h.s.
1006 * Once again, if l is False, the result is the r.h.s. and once
1007 * again if l is True, we parse the r.h.s. to throw it away.
1025 *-----------------------------------------------------------------------
1027 * Evaluate the conditional in the passed line. The line
1029 * #<cond-type> <expr>
1030 * where <cond-type> is any of if, ifmake, ifnmake, ifdef,
1031 * ifndef, elif, elifmake, elifnmake, elifdef, elifndef
1032 * and <expr> consists of &&, ||, !, make(target), defined(variable)
1033 * and parenthetical groupings thereof.
1036 * COND_PARSE if should parse lines after the conditional
1037 * COND_SKIP if should skip lines after the conditional
1038 * COND_INVALID if not a valid conditional.
1043 *-----------------------------------------------------------------------
1046 Cond_Eval(char *line)
1050 Boolean value = FALSE;
1051 int level; /* Level at which to report errors. */
1054 level = PARSE_FATAL;
1055 lineno = curFile.lineno;
1057 for (line++; *line == ' ' || *line == '\t'; line++) {
1062 * Find what type of if we're dealing with. The result is left
1063 * in ifp and isElse is set TRUE if it's an elif line.
1065 if (line[0] == 'e' && line[1] == 'l') {
1068 } else if (strncmp(line, "endif", 5) == 0) {
1070 * End of a conditional section. If skipIfLevel is non-zero, that
1071 * conditional was skipped, so lines following it should also be
1072 * skipped. Hence, we return COND_SKIP. Otherwise, the conditional
1073 * was read so succeeding lines should be parsed (think about it...)
1074 * so we return COND_PARSE, unless this endif isn't paired with
1077 if (skipIfLevel != 0) {
1081 if (condTop == MAXIF) {
1082 Parse_Error(level, "if-less endif");
1083 return (COND_INVALID);
1087 return (COND_PARSE);
1095 * Figure out what sort of conditional it is -- what its default
1096 * function is, etc. -- by looking in the table of valid "ifs"
1098 for (ifp = ifs; ifp->form != NULL; ifp++) {
1099 if (strncmp(ifp->form, line, ifp->formlen) == 0) {
1104 if (ifp->form == NULL) {
1106 * Nothing fit. If the first word on the line is actually
1107 * "else", it's a valid conditional whose value is the inverse
1108 * of the previous if we parsed.
1110 if (isElse && (line[0] == 's') && (line[1] == 'e')) {
1111 if (condTop == MAXIF) {
1112 Parse_Error(level, "if-less else");
1113 return (COND_INVALID);
1114 } else if (skipIfLevel == 0) {
1115 value = !condStack[condTop];
1116 lineno = condLineno[condTop];
1122 * Not a valid conditional type. No error...
1124 return (COND_INVALID);
1128 if (condTop == MAXIF) {
1129 Parse_Error(level, "if-less elif");
1130 return (COND_INVALID);
1131 } else if (skipIfLevel != 0) {
1133 * If skipping this conditional, just ignore the whole thing.
1134 * If we don't, the user might be employing a variable that's
1135 * undefined, for which there's an enclosing ifdef that
1138 skipIfLineno[skipIfLevel - 1] = lineno;
1141 } else if (skipLine) {
1143 * Don't even try to evaluate a conditional that's not an else if
1144 * we're skipping things...
1146 skipIfLineno[skipIfLevel] = lineno;
1152 * Initialize file-global variables for parsing
1154 condDefProc = ifp->defProc;
1155 condInvert = ifp->doNot;
1157 line += ifp->formlen;
1159 while (*line == ' ' || *line == '\t') {
1164 condPushBack = None;
1166 switch (CondE(TRUE)) {
1168 if (CondToken(TRUE) == EndOfFile) {
1175 if (CondToken(TRUE) == EndOfFile) {
1182 Parse_Error(level, "Malformed conditional (%s)",
1184 return (COND_INVALID);
1191 } else if ((skipIfLevel != 0) || condStack[condTop]) {
1193 * If this is an else-type conditional, it should only take effect
1194 * if its corresponding if was evaluated and FALSE. If its if was
1195 * TRUE or skipped, we return COND_SKIP (and start skipping in case
1196 * we weren't already), leaving the stack unmolested so later elif's
1205 * This is the one case where we can definitely proclaim a fatal
1206 * error. If we don't, we're hosed.
1208 Parse_Error(PARSE_FATAL, "Too many nested if's. %d max.", MAXIF);
1209 return (COND_INVALID);
1211 condStack[condTop] = value;
1212 condLineno[condTop] = lineno;
1214 return (value ? COND_PARSE : COND_SKIP);
1219 *-----------------------------------------------------------------------
1221 * Make sure everything's clean at the end of a makefile.
1227 * Parse_Error will be called if open conditionals are around.
1229 *-----------------------------------------------------------------------
1236 if (condTop != MAXIF) {
1237 Parse_Error(PARSE_FATAL, "%d open conditional%s:",
1238 MAXIF - condTop + skipIfLevel,
1239 MAXIF - condTop + skipIfLevel== 1 ? "" : "s");
1241 for (level = skipIfLevel; level > 0; level--)
1242 Parse_Error(PARSE_FATAL, "\t%*sat line %d (skipped)",
1243 MAXIF - condTop + level + 1, "", skipIfLineno[level - 1]);
1244 for (level = condTop; level < MAXIF; level++)
1245 Parse_Error(PARSE_FATAL, "\t%*sat line %d "
1246 "(evaluated to %s)", MAXIF - level + skipIfLevel, "",
1247 condLineno[level], condStack[level] ? "true" : "false");