2 * Copyright (c) 2002 - 2005 Tony Finch <dot@dotat.at>. All rights reserved.
4 * This code is derived from software contributed to Berkeley by Dave Yost.
5 * It was rewritten to support ANSI C by Tony Finch. The original version of
6 * unifdef carried the following copyright notice. None of its code remains
7 * in this version (though some of the names remain).
9 * Copyright (c) 1985, 1993
10 * The Regents of the University of California. All rights reserved.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include <sys/cdefs.h>
38 static const char copyright
[] =
39 "@(#) Copyright (c) 1985, 1993\n\
40 The Regents of the University of California. All rights reserved.\n";
43 __IDSTRING(Berkeley
, "@(#)unifdef.c 8.1 (Berkeley) 6/6/93");
44 __IDSTRING(NetBSD
, "$NetBSD: unifdef.c,v 1.8 2000/07/03 02:51:36 matt Exp $");
45 __IDSTRING(dotat
, "$dotat: things/unifdef.c,v 1.171 2005/03/08 12:38:48 fanf2 Exp $");
49 __FBSDID("$FreeBSD: /repoman/r/ncvs/src/usr.bin/unifdef/unifdef.c,v 1.20 2005/05/21 09:55:09 ru Exp $");
53 * unifdef - remove ifdef'ed lines
56 * provide an option which will append the name of the
57 * appropriate symbol after #else's and #endif's
58 * provide an option which will check symbols after
59 * #else's and #endif's to see that they match their
60 * corresponding #ifdef or #ifndef
62 * The first two items above require better buffer handling, which would
63 * also make it possible to handle all "dodgy" directives correctly.
75 size_t strlcpy(char *dst
, const char *src
, size_t siz
);
77 /* types of input lines: */
79 LT_TRUEI
, /* a true #if with ignore flag */
80 LT_FALSEI
, /* a false #if with ignore flag */
81 LT_IF
, /* an unknown #if */
82 LT_TRUE
, /* a true #if */
83 LT_FALSE
, /* a false #if */
84 LT_ELIF
, /* an unknown #elif */
85 LT_ELTRUE
, /* a true #elif */
86 LT_ELFALSE
, /* a false #elif */
88 LT_ENDIF
, /* #endif */
89 LT_DODGY
, /* flag: directive is not on one line */
90 LT_DODGY_LAST
= LT_DODGY
+ LT_ENDIF
,
91 LT_PLAIN
, /* ordinary line */
92 LT_EOF
, /* end of file */
96 static char const * const linetype_name
[] = {
97 "TRUEI", "FALSEI", "IF", "TRUE", "FALSE",
98 "ELIF", "ELTRUE", "ELFALSE", "ELSE", "ENDIF",
99 "DODGY TRUEI", "DODGY FALSEI",
100 "DODGY IF", "DODGY TRUE", "DODGY FALSE",
101 "DODGY ELIF", "DODGY ELTRUE", "DODGY ELFALSE",
102 "DODGY ELSE", "DODGY ENDIF",
106 /* state of #if processing */
109 IS_FALSE_PREFIX
, /* false #if followed by false #elifs */
110 IS_TRUE_PREFIX
, /* first non-false #(el)if is true */
111 IS_PASS_MIDDLE
, /* first non-false #(el)if is unknown */
112 IS_FALSE_MIDDLE
, /* a false #elif after a pass state */
113 IS_TRUE_MIDDLE
, /* a true #elif after a pass state */
114 IS_PASS_ELSE
, /* an else after a pass state */
115 IS_FALSE_ELSE
, /* an else after a true state */
116 IS_TRUE_ELSE
, /* an else after only false states */
117 IS_FALSE_TRAILER
, /* #elifs after a true are false */
121 static char const * const ifstate_name
[] = {
122 "OUTSIDE", "FALSE_PREFIX", "TRUE_PREFIX",
123 "PASS_MIDDLE", "FALSE_MIDDLE", "TRUE_MIDDLE",
124 "PASS_ELSE", "FALSE_ELSE", "TRUE_ELSE",
128 /* state of comment parser */
130 NO_COMMENT
= false, /* outside a comment */
131 C_COMMENT
, /* in a comment like this one */
132 CXX_COMMENT
, /* between // and end of line */
133 STARTING_COMMENT
, /* just after slash-backslash-newline */
134 FINISHING_COMMENT
, /* star-backslash-newline in a C comment */
135 CHAR_LITERAL
, /* inside '' */
136 STRING_LITERAL
/* inside "" */
139 static char const * const comment_name
[] = {
140 "NO", "C", "CXX", "STARTING", "FINISHING", "CHAR", "STRING"
143 /* state of preprocessor line parser */
145 LS_START
, /* only space and comments on this line */
146 LS_HASH
, /* only space, comments, and a hash */
147 LS_DIRTY
/* this line can't be a preprocessor line */
150 static char const * const linestate_name
[] = {
151 "START", "HASH", "DIRTY"
155 * Minimum translation limits from ISO/IEC 9899:1999 5.2.4.1
157 #define MAXDEPTH 64 /* maximum #if nesting */
158 #define MAXLINE 4096 /* maximum length of line */
159 #define MAXSYMS 4096 /* maximum number of symbols */
162 * Sometimes when editing a keyword the replacement text is longer, so
163 * we leave some space at the end of the tline buffer to accommodate this.
171 static bool complement
; /* -c: do the complement */
172 static bool debugging
; /* -d: debugging reports */
173 static bool iocccok
; /* -e: fewer IOCCC errors */
174 static bool killconsts
; /* -k: eval constant #ifs */
175 static bool lnblank
; /* -l: blank deleted lines */
176 static bool lnnum
; /* -n: add #line directives */
177 static bool symlist
; /* -s: output symbol list */
178 static bool text
; /* -t: this is a text file */
180 static const char *symname
[MAXSYMS
]; /* symbol name */
181 static const char *value
[MAXSYMS
]; /* -Dsym=value */
182 static bool ignore
[MAXSYMS
]; /* -iDsym or -iUsym */
183 static int nsyms
; /* number of symbols */
185 static FILE *input
; /* input file pointer */
186 static const char *filename
; /* input file name */
187 static int linenum
; /* current line number */
189 static char tline
[MAXLINE
+EDITSLOP
];/* input buffer plus space */
190 static char *keyword
; /* used for editing #elif's */
192 static Comment_state incomment
; /* comment parser state */
193 static Line_state linestate
; /* #if line parser state */
194 static Ifstate ifstate
[MAXDEPTH
]; /* #if processor state */
195 static bool ignoring
[MAXDEPTH
]; /* ignore comments state */
196 static int stifline
[MAXDEPTH
]; /* start of current #if */
197 static int depth
; /* current #if nesting */
198 static int delcount
; /* count of deleted lines */
199 static bool keepthis
; /* don't delete constant #if */
201 static int exitstat
; /* program exit status */
203 static void addsym(bool, bool, char *);
204 static void debug(const char *, ...);
205 static void done(void);
206 static void error(const char *);
207 static int findsym(const char *);
208 static void flushline(bool);
209 static Linetype
get_line(void);
210 static Linetype
ifeval(const char **);
211 static void ignoreoff(void);
212 static void ignoreon(void);
213 static void keywordedit(const char *);
214 static void nest(void);
215 static void process(void);
216 static const char *skipcomment(const char *);
217 static const char *skipsym(const char *);
218 static void state(Ifstate
);
219 static int strlcmp(const char *, const char *, size_t);
220 static void unnest(void);
221 static void usage(void);
223 #define endsym(c) (!isalpha((unsigned char)c) && !isdigit((unsigned char)c) && c != '_')
229 main(int argc
, char *argv
[])
233 while ((opt
= getopt(argc
, argv
, "i:D:U:I:cdeklnst")) != -1)
235 case 'i': /* treat stuff controlled by these symbols as text */
237 * For strict backwards-compatibility the U or D
238 * should be immediately after the -i but it doesn't
239 * matter much if we relax that requirement.
243 addsym(true, true, optarg
);
245 addsym(true, false, optarg
);
249 case 'D': /* define a symbol */
250 addsym(false, true, optarg
);
252 case 'U': /* undef a symbol */
253 addsym(false, false, optarg
);
256 /* no-op for compatibility with cpp */
258 case 'c': /* treat -D as -U and vice versa */
264 case 'e': /* fewer errors from dodgy lines */
267 case 'k': /* process constant #ifs */
270 case 'l': /* blank deleted lines instead of omitting them */
273 case 'n': /* add #line directive after deleted lines */
276 case 's': /* only output list of symbols that control #ifs */
279 case 't': /* don't parse C comments */
288 errx(2, "can only do one file");
289 } else if (argc
== 1 && strcmp(*argv
, "-") != 0) {
291 input
= fopen(filename
, "r");
293 err(2, "can't open %s", filename
);
295 filename
= "[stdin]";
305 fprintf(stderr
, "usage: unifdef [-cdeklnst] [-Ipath]"
306 " [-Dsym[=val]] [-Usym] [-iDsym[=val]] [-iUsym] ... [file]\n");
311 * A state transition function alters the global #if processing state
312 * in a particular way. The table below is indexed by the current
313 * processing state and the type of the current line.
315 * Nesting is handled by keeping a stack of states; some transition
316 * functions increase or decrease the depth. They also maintain the
317 * ignore state on a stack. In some complicated cases they have to
318 * alter the preprocessor directive, as follows.
320 * When we have processed a group that starts off with a known-false
321 * #if/#elif sequence (which has therefore been deleted) followed by a
322 * #elif that we don't understand and therefore must keep, we edit the
323 * latter into a #if to keep the nesting correct.
325 * When we find a true #elif in a group, the following block will
326 * always be kept and the rest of the sequence after the next #elif or
327 * #else will be discarded. We edit the #elif into a #else and the
328 * following directive to #endif since this has the desired behaviour.
330 * "Dodgy" directives are split across multiple lines, the most common
331 * example being a multi-line comment hanging off the right of the
332 * directive. We can handle them correctly only if there is no change
333 * from printing to dropping (or vice versa) caused by that directive.
334 * If the directive is the first of a group we have a choice between
335 * failing with an error, or passing it through unchanged instead of
336 * evaluating it. The latter is not the default to avoid questions from
337 * users about unifdef unexpectedly leaving behind preprocessor directives.
339 typedef void state_fn(void);
341 /* report an error */
342 static void Eelif (void) { error("Inappropriate #elif"); }
343 static void Eelse (void) { error("Inappropriate #else"); }
344 static void Eendif(void) { error("Inappropriate #endif"); }
345 static void Eeof (void) { error("Premature EOF"); }
346 static void Eioccc(void) { error("Obfuscated preprocessor control line"); }
347 /* plain line handling */
348 static void print (void) { flushline(true); }
349 static void drop (void) { flushline(false); }
350 /* output lacks group's start line */
351 static void Strue (void) { drop(); ignoreoff(); state(IS_TRUE_PREFIX
); }
352 static void Sfalse(void) { drop(); ignoreoff(); state(IS_FALSE_PREFIX
); }
353 static void Selse (void) { drop(); state(IS_TRUE_ELSE
); }
354 /* print/pass this block */
355 static void Pelif (void) { print(); ignoreoff(); state(IS_PASS_MIDDLE
); }
356 static void Pelse (void) { print(); state(IS_PASS_ELSE
); }
357 static void Pendif(void) { print(); unnest(); }
358 /* discard this block */
359 static void Dfalse(void) { drop(); ignoreoff(); state(IS_FALSE_TRAILER
); }
360 static void Delif (void) { drop(); ignoreoff(); state(IS_FALSE_MIDDLE
); }
361 static void Delse (void) { drop(); state(IS_FALSE_ELSE
); }
362 static void Dendif(void) { drop(); unnest(); }
363 /* first line of group */
364 static void Fdrop (void) { nest(); Dfalse(); }
365 static void Fpass (void) { nest(); Pelif(); }
366 static void Ftrue (void) { nest(); Strue(); }
367 static void Ffalse(void) { nest(); Sfalse(); }
368 /* variable pedantry for obfuscated lines */
369 static void Oiffy (void) { if (!iocccok
) Eioccc(); Fpass(); ignoreon(); }
370 static void Oif (void) { if (!iocccok
) Eioccc(); Fpass(); }
371 static void Oelif (void) { if (!iocccok
) Eioccc(); Pelif(); }
372 /* ignore comments in this block */
373 static void Idrop (void) { Fdrop(); ignoreon(); }
374 static void Itrue (void) { Ftrue(); ignoreon(); }
375 static void Ifalse(void) { Ffalse(); ignoreon(); }
377 static void Mpass (void) { strncpy(keyword
, "if ", 4); Pelif(); }
378 static void Mtrue (void) { keywordedit("else\n"); state(IS_TRUE_MIDDLE
); }
379 static void Melif (void) { keywordedit("endif\n"); state(IS_FALSE_TRAILER
); }
380 static void Melse (void) { keywordedit("endif\n"); state(IS_FALSE_ELSE
); }
382 static state_fn
* const trans_table
[IS_COUNT
][LT_COUNT
] = {
384 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Eelif
, Eelif
, Eelif
, Eelse
, Eendif
,
385 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Eelif
, Eelif
, Eelif
, Eelse
, Eendif
,
387 /* IS_FALSE_PREFIX */
388 { Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Mpass
, Strue
, Sfalse
,Selse
, Dendif
,
389 Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Mpass
, Eioccc
,Eioccc
,Eioccc
,Eioccc
,
392 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Dfalse
,Dfalse
,Dfalse
,Delse
, Dendif
,
393 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Eioccc
,Eioccc
,Eioccc
,Eioccc
,Eioccc
,
396 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Pelif
, Mtrue
, Delif
, Pelse
, Pendif
,
397 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Pelif
, Oelif
, Oelif
, Pelse
, Pendif
,
399 /* IS_FALSE_MIDDLE */
400 { Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Pelif
, Mtrue
, Delif
, Pelse
, Pendif
,
401 Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Eioccc
,Eioccc
,Eioccc
,Eioccc
,Eioccc
,
404 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Melif
, Melif
, Melif
, Melse
, Pendif
,
405 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Eioccc
,Eioccc
,Eioccc
,Eioccc
,Pendif
,
408 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Eelif
, Eelif
, Eelif
, Eelse
, Pendif
,
409 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Eelif
, Eelif
, Eelif
, Eelse
, Pendif
,
412 { Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Eelif
, Eelif
, Eelif
, Eelse
, Dendif
,
413 Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Eelif
, Eelif
, Eelif
, Eelse
, Eioccc
,
416 { Itrue
, Ifalse
,Fpass
, Ftrue
, Ffalse
,Eelif
, Eelif
, Eelif
, Eelse
, Dendif
,
417 Oiffy
, Oiffy
, Fpass
, Oif
, Oif
, Eelif
, Eelif
, Eelif
, Eelse
, Eioccc
,
419 /* IS_FALSE_TRAILER */
420 { Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Dfalse
,Dfalse
,Dfalse
,Delse
, Dendif
,
421 Idrop
, Idrop
, Fdrop
, Fdrop
, Fdrop
, Dfalse
,Dfalse
,Dfalse
,Delse
, Eioccc
,
423 /*TRUEI FALSEI IF TRUE FALSE ELIF ELTRUE ELFALSE ELSE ENDIF
424 TRUEI FALSEI IF TRUE FALSE ELIF ELTRUE ELFALSE ELSE ENDIF (DODGY)
429 * State machine utility functions
435 error("EOF in comment");
443 ignoring
[depth
] = ignoring
[depth
-1];
448 ignoring
[depth
] = true;
451 keywordedit(const char *replacement
)
453 size_t size
= tline
+ sizeof(tline
) - keyword
;
455 const char *src
= replacement
;
457 while ((--size
!= 0) && (*src
!= '\0'))
467 if (depth
>= MAXDEPTH
)
468 error("Too many levels of nesting");
469 stifline
[depth
] = linenum
;
485 * Write a line to the output or not, according to command line options.
492 if (keep
^ complement
) {
493 if (lnnum
&& delcount
> 0)
494 printf("#line %d\n", linenum
);
495 fputs(tline
, stdout
);
506 * The driver for the state machine.
515 lineval
= get_line();
516 trans_table
[ifstate
[depth
]][lineval
]();
517 debug("process %s -> %s depth %d",
518 linetype_name
[lineval
],
519 ifstate_name
[ifstate
[depth
]], depth
);
524 * Parse a line and determine its type. We keep the preprocessor line
525 * parser state between calls in the global variable linestate, with
526 * help from skipcomment().
535 Comment_state wascomment
;
537 if (fgets(tline
, MAXLINE
, input
) == NULL
)
540 wascomment
= incomment
;
541 cp
= skipcomment(tline
);
542 if (linestate
== LS_START
) {
545 cp
= skipcomment(cp
+ 1);
546 } else if (*cp
!= '\0')
547 linestate
= LS_DIRTY
;
549 if (!incomment
&& linestate
== LS_HASH
) {
550 keyword
= tline
+ (cp
- tline
);
552 kwlen
= cp
- keyword
;
553 /* no way can we deal with a continuation inside a keyword */
554 if (strncmp(cp
, "\\\n", 2) == 0)
556 if (strlcmp("ifdef", keyword
, kwlen
) == 0 ||
557 strlcmp("ifndef", keyword
, kwlen
) == 0) {
558 cp
= skipcomment(cp
);
559 if ((cursym
= findsym(cp
)) < 0)
562 retval
= (keyword
[2] == 'n')
563 ? LT_FALSE
: LT_TRUE
;
564 if (value
[cursym
] == NULL
)
565 retval
= (retval
== LT_TRUE
)
566 ? LT_FALSE
: LT_TRUE
;
568 retval
= (retval
== LT_TRUE
)
569 ? LT_TRUEI
: LT_FALSEI
;
572 } else if (strlcmp("if", keyword
, kwlen
) == 0)
573 retval
= ifeval(&cp
);
574 else if (strlcmp("elif", keyword
, kwlen
) == 0)
575 retval
= ifeval(&cp
) - LT_IF
+ LT_ELIF
;
576 else if (strlcmp("else", keyword
, kwlen
) == 0)
578 else if (strlcmp("endif", keyword
, kwlen
) == 0)
581 linestate
= LS_DIRTY
;
584 cp
= skipcomment(cp
);
586 linestate
= LS_DIRTY
;
587 if (retval
== LT_TRUE
|| retval
== LT_FALSE
||
588 retval
== LT_TRUEI
|| retval
== LT_FALSEI
)
590 if (retval
== LT_ELTRUE
|| retval
== LT_ELFALSE
)
593 if (retval
!= LT_PLAIN
&& (wascomment
|| incomment
)) {
596 linestate
= LS_DIRTY
;
598 /* skipcomment should have changed the state */
599 if (linestate
== LS_HASH
)
602 if (linestate
== LS_DIRTY
) {
604 cp
= skipcomment(cp
+ 1);
606 debug("parser %s comment %s line",
607 comment_name
[incomment
], linestate_name
[linestate
]);
612 * These are the binary operators that are supported by the expression
613 * evaluator. Note that if support for division is added then we also
614 * need short-circuiting booleans because of divide-by-zero.
616 static int op_lt(int a
, int b
) { return (a
< b
); }
617 static int op_gt(int a
, int b
) { return (a
> b
); }
618 static int op_le(int a
, int b
) { return (a
<= b
); }
619 static int op_ge(int a
, int b
) { return (a
>= b
); }
620 static int op_eq(int a
, int b
) { return (a
== b
); }
621 static int op_ne(int a
, int b
) { return (a
!= b
); }
622 static int op_or(int a
, int b
) { return (a
|| b
); }
623 static int op_and(int a
, int b
) { return (a
&& b
); }
626 * An evaluation function takes three arguments, as follows: (1) a pointer to
627 * an element of the precedence table which lists the operators at the current
628 * level of precedence; (2) a pointer to an integer which will receive the
629 * value of the expression; and (3) a pointer to a char* that points to the
630 * expression to be evaluated and that is updated to the end of the expression
631 * when evaluation is complete. The function returns LT_FALSE if the value of
632 * the expression is zero, LT_TRUE if it is non-zero, or LT_IF if the
633 * expression could not be evaluated.
637 typedef Linetype
eval_fn(const struct ops
*, int *, const char **);
639 static eval_fn eval_table
, eval_unary
;
642 * The precedence table. Expressions involving binary operators are evaluated
643 * in a table-driven way by eval_table. When it evaluates a subexpression it
644 * calls the inner function with its first argument pointing to the next
645 * element of the table. Innermost expressions have special non-table-driven
648 static const struct ops
{
655 { eval_table
, { { "||", op_or
} } },
656 { eval_table
, { { "&&", op_and
} } },
657 { eval_table
, { { "==", op_eq
},
659 { eval_unary
, { { "<=", op_le
},
666 * Function for evaluating the innermost parts of expressions,
667 * viz. !expr (expr) defined(symbol) symbol number
668 * We reset the keepthis flag when we find a non-constant subexpression.
671 eval_unary(const struct ops
*ops
, int *valp
, const char **cpp
)
677 cp
= skipcomment(*cpp
);
679 debug("eval%d !", ops
- eval_ops
);
681 if (eval_unary(ops
, valp
, &cp
) == LT_IF
) {
686 } else if (*cp
== '(') {
688 debug("eval%d (", ops
- eval_ops
);
689 if (eval_table(eval_ops
, valp
, &cp
) == LT_IF
)
691 cp
= skipcomment(cp
);
694 } else if (isdigit((unsigned char)*cp
)) {
695 debug("eval%d number", ops
- eval_ops
);
696 *valp
= strtol(cp
, &ep
, 0);
698 } else if (strncmp(cp
, "defined", 7) == 0 && endsym(cp
[7])) {
699 cp
= skipcomment(cp
+7);
700 debug("eval%d defined", ops
- eval_ops
);
703 cp
= skipcomment(cp
);
706 cp
= skipcomment(cp
);
710 *valp
= (value
[sym
] != NULL
);
716 } else if (!endsym(*cp
)) {
717 debug("eval%d symbol", ops
- eval_ops
);
721 if (value
[sym
] == NULL
)
724 *valp
= strtol(value
[sym
], &ep
, 0);
725 if (*ep
!= '\0' || ep
== value
[sym
])
731 debug("eval%d bad expr", ops
- eval_ops
);
736 debug("eval%d = %d", ops
- eval_ops
, *valp
);
737 return (*valp
? LT_TRUE
: LT_FALSE
);
741 * Table-driven evaluation of binary operators.
744 eval_table(const struct ops
*ops
, int *valp
, const char **cpp
)
751 debug("eval%d", ops
- eval_ops
);
753 lhs
= ops
->inner(ops
+1, valp
, &cp
);
755 cp
= skipcomment(cp
);
756 for (op
= ops
->op
; op
->str
!= NULL
; op
++)
757 if (strncmp(cp
, op
->str
, strlen(op
->str
)) == 0)
761 cp
+= strlen(op
->str
);
762 debug("eval%d %s", ops
- eval_ops
, op
->str
);
763 rhs
= ops
->inner(ops
+1, &val
, &cp
);
764 if (op
->fn
== op_and
&& (lhs
== LT_FALSE
|| rhs
== LT_FALSE
)) {
765 debug("eval%d: and always false", ops
- eval_ops
);
771 if (op
->fn
== op_or
&& (lhs
== LT_TRUE
|| rhs
== LT_TRUE
)) {
772 debug("eval%d: or always true", ops
- eval_ops
);
781 *valp
= op
->fn(*valp
, val
);
785 debug("eval%d = %d", ops
- eval_ops
, *valp
);
787 lhs
= (*valp
? LT_TRUE
: LT_FALSE
);
792 * Evaluate the expression on a #if or #elif line. If we can work out
793 * the result we return LT_TRUE or LT_FALSE accordingly, otherwise we
794 * return just a generic LT_IF.
797 ifeval(const char **cpp
)
799 const char *cp
= *cpp
;
803 debug("eval %s", *cpp
);
804 keepthis
= killconsts
? false : true;
805 ret
= eval_table(eval_ops
, &val
, &cp
);
808 debug("eval = %d", val
);
809 return (keepthis
? LT_IF
: ret
);
813 * Skip over comments, strings, and character literals and stop at the
814 * next character position that is not whitespace. Between calls we keep
815 * the comment state in the global variable incomment, and we also adjust
816 * the global variable linestate when we see a newline.
817 * XXX: doesn't cope with the buffer splitting inside a state transition.
820 skipcomment(const char *cp
)
822 if (text
|| ignoring
[depth
]) {
823 for (; isspace((unsigned char)*cp
); cp
++)
825 linestate
= LS_START
;
829 /* don't reset to LS_START after a line continuation */
830 if (strncmp(cp
, "\\\n", 2) == 0)
832 else switch (incomment
) {
834 if (strncmp(cp
, "/\\\n", 3) == 0) {
835 incomment
= STARTING_COMMENT
;
837 } else if (strncmp(cp
, "/*", 2) == 0) {
838 incomment
= C_COMMENT
;
840 } else if (strncmp(cp
, "//", 2) == 0) {
841 incomment
= CXX_COMMENT
;
843 } else if (strncmp(cp
, "\'", 1) == 0) {
844 incomment
= CHAR_LITERAL
;
845 linestate
= LS_DIRTY
;
847 } else if (strncmp(cp
, "\"", 1) == 0) {
848 incomment
= STRING_LITERAL
;
849 linestate
= LS_DIRTY
;
851 } else if (strncmp(cp
, "\n", 1) == 0) {
852 linestate
= LS_START
;
854 } else if (strchr(" \t", *cp
) != NULL
) {
860 if (strncmp(cp
, "\n", 1) == 0) {
861 incomment
= NO_COMMENT
;
862 linestate
= LS_START
;
868 if ((incomment
== CHAR_LITERAL
&& cp
[0] == '\'') ||
869 (incomment
== STRING_LITERAL
&& cp
[0] == '\"')) {
870 incomment
= NO_COMMENT
;
872 } else if (cp
[0] == '\\') {
877 } else if (strncmp(cp
, "\n", 1) == 0) {
878 if (incomment
== CHAR_LITERAL
)
879 error("unterminated char literal");
881 error("unterminated string literal");
886 if (strncmp(cp
, "*\\\n", 3) == 0) {
887 incomment
= FINISHING_COMMENT
;
889 } else if (strncmp(cp
, "*/", 2) == 0) {
890 incomment
= NO_COMMENT
;
895 case STARTING_COMMENT
:
897 incomment
= C_COMMENT
;
899 } else if (*cp
== '/') {
900 incomment
= CXX_COMMENT
;
903 incomment
= NO_COMMENT
;
904 linestate
= LS_DIRTY
;
907 case FINISHING_COMMENT
:
909 incomment
= NO_COMMENT
;
912 incomment
= C_COMMENT
;
921 * Skip over an identifier.
924 skipsym(const char *cp
)
932 * Look for the symbol in the symbol table. If is is found, we return
933 * the symbol table index, else we return -1.
936 findsym(const char *str
)
945 printf("%.*s\n", (int)(cp
-str
), str
);
946 /* we don't care about the value of the symbol */
949 for (symind
= 0; symind
< nsyms
; ++symind
) {
950 if (strlcmp(symname
[symind
], str
, cp
-str
) == 0) {
951 debug("findsym %s %s", symname
[symind
],
952 value
[symind
] ? value
[symind
] : "");
960 * Add a symbol to the symbol table.
963 addsym(bool ignorethis
, bool definethis
, char *sym
)
968 symind
= findsym(sym
);
970 if (nsyms
>= MAXSYMS
)
971 errx(2, "too many symbols");
974 symname
[symind
] = sym
;
975 ignore
[symind
] = ignorethis
;
976 val
= sym
+ (skipsym(sym
) - sym
);
979 value
[symind
] = val
+1;
981 } else if (*val
== '\0')
988 value
[symind
] = NULL
;
993 * Compare s with n characters of t.
994 * The same as strncmp() except that it checks that s[n] == '\0'.
997 strlcmp(const char *s
, const char *t
, size_t n
)
999 while (n
-- && *t
!= '\0')
1001 return ((unsigned char)*s
- (unsigned char)*t
);
1004 return ((unsigned char)*s
);
1011 debug(const char *msg
, ...)
1023 error(const char *msg
)
1026 warnx("%s: %d: %s", filename
, linenum
, msg
);
1028 warnx("%s: %d: %s (#if line %d depth %d)",
1029 filename
, linenum
, msg
, stifline
[depth
], depth
);
1030 errx(2, "output may be truncated");
This page took 0.074588 seconds and 6 git commands to generate.