Blame view
scripts/unifdef.c
34.8 KB
01f1c8799 kbuild: add unifdef |
1 |
/* |
3cbea4366 unifdef: update t... |
2 |
* Copyright (c) 2002 - 2011 Tony Finch <dot@dotat.at> |
01f1c8799 kbuild: add unifdef |
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
* * 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. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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. */ |
d8379ab1d unifdef: update t... |
25 |
/* |
3cbea4366 unifdef: update t... |
26 27 |
* unifdef - remove ifdef'ed lines * |
d8379ab1d unifdef: update t... |
28 29 30 31 32 33 |
* This code was derived from software contributed to Berkeley by Dave Yost. * It was rewritten to support ANSI C by Tony Finch. The original version * of unifdef carried the 4-clause BSD copyright licence. None of its code * remains in this version (though some of the names remain) so it now * carries a more liberal licence. * |
01f1c8799 kbuild: add unifdef |
34 35 36 37 38 39 40 |
* Wishlist: * provide an option which will append the name of the * appropriate symbol after #else's and #endif's * provide an option which will check symbols after * #else's and #endif's to see that they match their * corresponding #ifdef or #ifndef * |
3cbea4366 unifdef: update t... |
41 42 |
* These require better buffer handling, which would also make * it possible to handle all "dodgy" directives correctly. |
01f1c8799 kbuild: add unifdef |
43 |
*/ |
3cbea4366 unifdef: update t... |
44 45 |
#include <sys/types.h> #include <sys/stat.h> |
01f1c8799 kbuild: add unifdef |
46 47 |
#include <ctype.h> #include <err.h> |
3cbea4366 unifdef: update t... |
48 |
#include <errno.h> |
01f1c8799 kbuild: add unifdef |
49 50 51 52 53 54 |
#include <stdarg.h> #include <stdbool.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <unistd.h> |
3cbea4366 unifdef: update t... |
55 56 57 58 59 60 61 62 |
const char copyright[] = "@(#) $Version: unifdef-2.5 $ " "@(#) $Author: Tony Finch (dot@dotat.at) $ " "@(#) $URL: http://dotat.at/prog/unifdef $ " ; |
01f1c8799 kbuild: add unifdef |
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 |
/* types of input lines: */ typedef enum { LT_TRUEI, /* a true #if with ignore flag */ LT_FALSEI, /* a false #if with ignore flag */ LT_IF, /* an unknown #if */ LT_TRUE, /* a true #if */ LT_FALSE, /* a false #if */ LT_ELIF, /* an unknown #elif */ LT_ELTRUE, /* a true #elif */ LT_ELFALSE, /* a false #elif */ LT_ELSE, /* #else */ LT_ENDIF, /* #endif */ LT_DODGY, /* flag: directive is not on one line */ LT_DODGY_LAST = LT_DODGY + LT_ENDIF, LT_PLAIN, /* ordinary line */ LT_EOF, /* end of file */ |
d8379ab1d unifdef: update t... |
79 |
LT_ERROR, /* unevaluable #if */ |
01f1c8799 kbuild: add unifdef |
80 81 82 83 84 85 86 87 88 89 |
LT_COUNT } Linetype; static char const * const linetype_name[] = { "TRUEI", "FALSEI", "IF", "TRUE", "FALSE", "ELIF", "ELTRUE", "ELFALSE", "ELSE", "ENDIF", "DODGY TRUEI", "DODGY FALSEI", "DODGY IF", "DODGY TRUE", "DODGY FALSE", "DODGY ELIF", "DODGY ELTRUE", "DODGY ELFALSE", "DODGY ELSE", "DODGY ENDIF", |
d8379ab1d unifdef: update t... |
90 |
"PLAIN", "EOF", "ERROR" |
01f1c8799 kbuild: add unifdef |
91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 |
}; /* state of #if processing */ typedef enum { IS_OUTSIDE, IS_FALSE_PREFIX, /* false #if followed by false #elifs */ IS_TRUE_PREFIX, /* first non-false #(el)if is true */ IS_PASS_MIDDLE, /* first non-false #(el)if is unknown */ IS_FALSE_MIDDLE, /* a false #elif after a pass state */ IS_TRUE_MIDDLE, /* a true #elif after a pass state */ IS_PASS_ELSE, /* an else after a pass state */ IS_FALSE_ELSE, /* an else after a true state */ IS_TRUE_ELSE, /* an else after only false states */ IS_FALSE_TRAILER, /* #elifs after a true are false */ IS_COUNT } Ifstate; static char const * const ifstate_name[] = { "OUTSIDE", "FALSE_PREFIX", "TRUE_PREFIX", "PASS_MIDDLE", "FALSE_MIDDLE", "TRUE_MIDDLE", "PASS_ELSE", "FALSE_ELSE", "TRUE_ELSE", "FALSE_TRAILER" }; /* state of comment parser */ typedef enum { NO_COMMENT = false, /* outside a comment */ C_COMMENT, /* in a comment like this one */ CXX_COMMENT, /* between // and end of line */ STARTING_COMMENT, /* just after slash-backslash-newline */ FINISHING_COMMENT, /* star-backslash-newline in a C comment */ CHAR_LITERAL, /* inside '' */ STRING_LITERAL /* inside "" */ } Comment_state; static char const * const comment_name[] = { "NO", "C", "CXX", "STARTING", "FINISHING", "CHAR", "STRING" }; /* state of preprocessor line parser */ typedef enum { LS_START, /* only space and comments on this line */ LS_HASH, /* only space, comments, and a hash */ LS_DIRTY /* this line can't be a preprocessor line */ } Line_state; static char const * const linestate_name[] = { "START", "HASH", "DIRTY" }; /* * Minimum translation limits from ISO/IEC 9899:1999 5.2.4.1 */ #define MAXDEPTH 64 /* maximum #if nesting */ #define MAXLINE 4096 /* maximum length of line */ #define MAXSYMS 4096 /* maximum number of symbols */ /* * Sometimes when editing a keyword the replacement text is longer, so * we leave some space at the end of the tline buffer to accommodate this. */ #define EDITSLOP 10 /* |
3cbea4366 unifdef: update t... |
155 156 157 158 159 |
* For temporary filenames */ #define TEMPLATE "unifdef.XXXXXX" /* |
01f1c8799 kbuild: add unifdef |
160 161 |
* Globals. */ |
d8379ab1d unifdef: update t... |
162 163 |
static bool compblank; /* -B: compress blank lines */ static bool lnblank; /* -b: blank deleted lines */ |
01f1c8799 kbuild: add unifdef |
164 165 166 |
static bool complement; /* -c: do the complement */ static bool debugging; /* -d: debugging reports */ static bool iocccok; /* -e: fewer IOCCC errors */ |
d8379ab1d unifdef: update t... |
167 |
static bool strictlogic; /* -K: keep ambiguous #ifs */ |
01f1c8799 kbuild: add unifdef |
168 |
static bool killconsts; /* -k: eval constant #ifs */ |
01f1c8799 kbuild: add unifdef |
169 170 |
static bool lnnum; /* -n: add #line directives */ static bool symlist; /* -s: output symbol list */ |
3cbea4366 unifdef: update t... |
171 |
static bool symdepth; /* -S: output symbol depth */ |
01f1c8799 kbuild: add unifdef |
172 173 174 175 176 177 178 179 180 181 |
static bool text; /* -t: this is a text file */ static const char *symname[MAXSYMS]; /* symbol name */ static const char *value[MAXSYMS]; /* -Dsym=value */ static bool ignore[MAXSYMS]; /* -iDsym or -iUsym */ static int nsyms; /* number of symbols */ static FILE *input; /* input file pointer */ static const char *filename; /* input file name */ static int linenum; /* current line number */ |
3cbea4366 unifdef: update t... |
182 183 184 185 |
static FILE *output; /* output file pointer */ static const char *ofilename; /* output file name */ static bool overwriting; /* output overwrites input */ static char tempname[FILENAME_MAX]; /* used when overwriting */ |
01f1c8799 kbuild: add unifdef |
186 187 188 |
static char tline[MAXLINE+EDITSLOP];/* input buffer plus space */ static char *keyword; /* used for editing #elif's */ |
3cbea4366 unifdef: update t... |
189 190 191 192 193 |
static const char *newline; /* input file format */ static const char newline_unix[] = " "; static const char newline_crlf[] = "\r "; |
01f1c8799 kbuild: add unifdef |
194 195 196 197 198 199 200 |
static Comment_state incomment; /* comment parser state */ static Line_state linestate; /* #if line parser state */ static Ifstate ifstate[MAXDEPTH]; /* #if processor state */ static bool ignoring[MAXDEPTH]; /* ignore comments state */ static int stifline[MAXDEPTH]; /* start of current #if */ static int depth; /* current #if nesting */ static int delcount; /* count of deleted lines */ |
d8379ab1d unifdef: update t... |
201 202 203 |
static unsigned blankcount; /* count of blank lines */ static unsigned blankmax; /* maximum recent blankcount */ static bool constexpr; /* constant #if expression */ |
3cbea4366 unifdef: update t... |
204 205 |
static bool zerosyms = true; /* to format symdepth output */ static bool firstsym; /* ditto */ |
01f1c8799 kbuild: add unifdef |
206 207 208 209 |
static int exitstat; /* program exit status */ static void addsym(bool, bool, char *); |
3cbea4366 unifdef: update t... |
210 |
static void closeout(void); |
01f1c8799 kbuild: add unifdef |
211 212 213 214 215 |
static void debug(const char *, ...); static void done(void); static void error(const char *); static int findsym(const char *); static void flushline(bool); |
d8379ab1d unifdef: update t... |
216 |
static Linetype parseline(void); |
01f1c8799 kbuild: add unifdef |
217 218 219 220 221 222 |
static Linetype ifeval(const char **); static void ignoreoff(void); static void ignoreon(void); static void keywordedit(const char *); static void nest(void); static void process(void); |
d8379ab1d unifdef: update t... |
223 |
static const char *skipargs(const char *); |
01f1c8799 kbuild: add unifdef |
224 225 226 227 228 229 |
static const char *skipcomment(const char *); static const char *skipsym(const char *); static void state(Ifstate); static int strlcmp(const char *, const char *, size_t); static void unnest(void); static void usage(void); |
3cbea4366 unifdef: update t... |
230 |
static void version(void); |
01f1c8799 kbuild: add unifdef |
231 |
|
d8379ab1d unifdef: update t... |
232 |
#define endsym(c) (!isalnum((unsigned char)c) && c != '_') |
01f1c8799 kbuild: add unifdef |
233 234 235 236 237 238 239 240 |
/* * The main program. */ int main(int argc, char *argv[]) { int opt; |
3cbea4366 unifdef: update t... |
241 |
while ((opt = getopt(argc, argv, "i:D:U:I:o:bBcdeKklnsStV")) != -1) |
01f1c8799 kbuild: add unifdef |
242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 |
switch (opt) { case 'i': /* treat stuff controlled by these symbols as text */ /* * For strict backwards-compatibility the U or D * should be immediately after the -i but it doesn't * matter much if we relax that requirement. */ opt = *optarg++; if (opt == 'D') addsym(true, true, optarg); else if (opt == 'U') addsym(true, false, optarg); else usage(); break; case 'D': /* define a symbol */ addsym(false, true, optarg); break; case 'U': /* undef a symbol */ addsym(false, false, optarg); break; |
3cbea4366 unifdef: update t... |
263 |
case 'I': /* no-op for compatibility with cpp */ |
d8379ab1d unifdef: update t... |
264 265 266 267 268 |
break; case 'b': /* blank deleted lines instead of omitting them */ case 'l': /* backwards compatibility */ lnblank = true; break; |
3cbea4366 unifdef: update t... |
269 270 271 |
case 'B': /* compress blank lines around removed section */ compblank = true; break; |
01f1c8799 kbuild: add unifdef |
272 273 274 275 276 277 278 279 280 |
case 'c': /* treat -D as -U and vice versa */ complement = true; break; case 'd': debugging = true; break; case 'e': /* fewer errors from dodgy lines */ iocccok = true; break; |
d8379ab1d unifdef: update t... |
281 282 283 |
case 'K': /* keep ambiguous #ifs */ strictlogic = true; break; |
01f1c8799 kbuild: add unifdef |
284 285 286 |
case 'k': /* process constant #ifs */ killconsts = true; break; |
01f1c8799 kbuild: add unifdef |
287 288 289 |
case 'n': /* add #line directive after deleted lines */ lnnum = true; break; |
3cbea4366 unifdef: update t... |
290 291 292 |
case 'o': /* output to a file */ ofilename = optarg; break; |
01f1c8799 kbuild: add unifdef |
293 294 295 |
case 's': /* only output list of symbols that control #ifs */ symlist = true; break; |
3cbea4366 unifdef: update t... |
296 297 298 |
case 'S': /* list symbols with their nesting depth */ symlist = symdepth = true; break; |
01f1c8799 kbuild: add unifdef |
299 300 301 |
case 't': /* don't parse C comments */ text = true; break; |
3cbea4366 unifdef: update t... |
302 303 |
case 'V': /* print version */ version(); |
01f1c8799 kbuild: add unifdef |
304 305 306 307 308 |
default: usage(); } argc -= optind; argv += optind; |
d8379ab1d unifdef: update t... |
309 310 |
if (compblank && lnblank) errx(2, "-B and -b are mutually exclusive"); |
01f1c8799 kbuild: add unifdef |
311 312 313 314 |
if (argc > 1) { errx(2, "can only do one file"); } else if (argc == 1 && strcmp(*argv, "-") != 0) { filename = *argv; |
3cbea4366 unifdef: update t... |
315 |
input = fopen(filename, "rb"); |
01f1c8799 kbuild: add unifdef |
316 317 318 319 320 321 |
if (input == NULL) err(2, "can't open %s", filename); } else { filename = "[stdin]"; input = stdin; } |
3cbea4366 unifdef: update t... |
322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 |
if (ofilename == NULL) { ofilename = "[stdout]"; output = stdout; } else { struct stat ist, ost; if (stat(ofilename, &ost) == 0 && fstat(fileno(input), &ist) == 0) overwriting = (ist.st_dev == ost.st_dev && ist.st_ino == ost.st_ino); if (overwriting) { const char *dirsep; int ofd; dirsep = strrchr(ofilename, '/'); if (dirsep != NULL) snprintf(tempname, sizeof(tempname), "%.*s/" TEMPLATE, (int)(dirsep - ofilename), ofilename); else snprintf(tempname, sizeof(tempname), TEMPLATE); ofd = mkstemp(tempname); if (ofd != -1) output = fdopen(ofd, "wb+"); if (output == NULL) err(2, "can't create temporary file"); fchmod(ofd, ist.st_mode & (S_IRWXU|S_IRWXG|S_IRWXO)); } else { output = fopen(ofilename, "wb"); if (output == NULL) err(2, "can't open %s", ofilename); } } |
01f1c8799 kbuild: add unifdef |
355 356 357 358 359 |
process(); abort(); /* bug */ } static void |
3cbea4366 unifdef: update t... |
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 |
version(void) { const char *c = copyright; for (;;) { while (*++c != '$') if (*c == '\0') exit(0); while (*++c != '$') putc(*c, stderr); putc(' ', stderr); } } static void |
01f1c8799 kbuild: add unifdef |
375 376 |
usage(void) { |
3cbea4366 unifdef: update t... |
377 |
fprintf(stderr, "usage: unifdef [-bBcdeKknsStV] [-Ipath]" |
01f1c8799 kbuild: add unifdef |
378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 |
" [-Dsym[=val]] [-Usym] [-iDsym[=val]] [-iUsym] ... [file] "); exit(2); } /* * A state transition function alters the global #if processing state * in a particular way. The table below is indexed by the current * processing state and the type of the current line. * * Nesting is handled by keeping a stack of states; some transition * functions increase or decrease the depth. They also maintain the * ignore state on a stack. In some complicated cases they have to * alter the preprocessor directive, as follows. * * When we have processed a group that starts off with a known-false * #if/#elif sequence (which has therefore been deleted) followed by a * #elif that we don't understand and therefore must keep, we edit the |
3cbea4366 unifdef: update t... |
396 397 |
* latter into a #if to keep the nesting correct. We use strncpy() to * overwrite the 4 byte token "elif" with "if " without a '\0' byte. |
01f1c8799 kbuild: add unifdef |
398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 |
* * When we find a true #elif in a group, the following block will * always be kept and the rest of the sequence after the next #elif or * #else will be discarded. We edit the #elif into a #else and the * following directive to #endif since this has the desired behaviour. * * "Dodgy" directives are split across multiple lines, the most common * example being a multi-line comment hanging off the right of the * directive. We can handle them correctly only if there is no change * from printing to dropping (or vice versa) caused by that directive. * If the directive is the first of a group we have a choice between * failing with an error, or passing it through unchanged instead of * evaluating it. The latter is not the default to avoid questions from * users about unifdef unexpectedly leaving behind preprocessor directives. */ typedef void state_fn(void); /* report an error */ static void Eelif (void) { error("Inappropriate #elif"); } static void Eelse (void) { error("Inappropriate #else"); } static void Eendif(void) { error("Inappropriate #endif"); } static void Eeof (void) { error("Premature EOF"); } static void Eioccc(void) { error("Obfuscated preprocessor control line"); } /* plain line handling */ static void print (void) { flushline(true); } static void drop (void) { flushline(false); } /* output lacks group's start line */ static void Strue (void) { drop(); ignoreoff(); state(IS_TRUE_PREFIX); } static void Sfalse(void) { drop(); ignoreoff(); state(IS_FALSE_PREFIX); } static void Selse (void) { drop(); state(IS_TRUE_ELSE); } /* print/pass this block */ static void Pelif (void) { print(); ignoreoff(); state(IS_PASS_MIDDLE); } static void Pelse (void) { print(); state(IS_PASS_ELSE); } static void Pendif(void) { print(); unnest(); } /* discard this block */ static void Dfalse(void) { drop(); ignoreoff(); state(IS_FALSE_TRAILER); } static void Delif (void) { drop(); ignoreoff(); state(IS_FALSE_MIDDLE); } static void Delse (void) { drop(); state(IS_FALSE_ELSE); } static void Dendif(void) { drop(); unnest(); } /* first line of group */ static void Fdrop (void) { nest(); Dfalse(); } static void Fpass (void) { nest(); Pelif(); } static void Ftrue (void) { nest(); Strue(); } static void Ffalse(void) { nest(); Sfalse(); } /* variable pedantry for obfuscated lines */ static void Oiffy (void) { if (!iocccok) Eioccc(); Fpass(); ignoreon(); } static void Oif (void) { if (!iocccok) Eioccc(); Fpass(); } static void Oelif (void) { if (!iocccok) Eioccc(); Pelif(); } /* ignore comments in this block */ static void Idrop (void) { Fdrop(); ignoreon(); } static void Itrue (void) { Ftrue(); ignoreon(); } static void Ifalse(void) { Ffalse(); ignoreon(); } |
3cbea4366 unifdef: update t... |
450 |
/* modify this line */ |
01f1c8799 kbuild: add unifdef |
451 |
static void Mpass (void) { strncpy(keyword, "if ", 4); Pelif(); } |
3cbea4366 unifdef: update t... |
452 453 454 |
static void Mtrue (void) { keywordedit("else"); state(IS_TRUE_MIDDLE); } static void Melif (void) { keywordedit("endif"); state(IS_FALSE_TRAILER); } static void Melse (void) { keywordedit("endif"); state(IS_FALSE_ELSE); } |
01f1c8799 kbuild: add unifdef |
455 456 457 458 459 |
static state_fn * const trans_table[IS_COUNT][LT_COUNT] = { /* IS_OUTSIDE */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Eelif, Eelif, Eelif, Eelse, Eendif, Oiffy, Oiffy, Fpass, Oif, Oif, Eelif, Eelif, Eelif, Eelse, Eendif, |
d8379ab1d unifdef: update t... |
460 |
print, done, abort }, |
01f1c8799 kbuild: add unifdef |
461 462 463 |
/* IS_FALSE_PREFIX */ { Idrop, Idrop, Fdrop, Fdrop, Fdrop, Mpass, Strue, Sfalse,Selse, Dendif, Idrop, Idrop, Fdrop, Fdrop, Fdrop, Mpass, Eioccc,Eioccc,Eioccc,Eioccc, |
d8379ab1d unifdef: update t... |
464 |
drop, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
465 466 467 |
/* IS_TRUE_PREFIX */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Dfalse,Dfalse,Dfalse,Delse, Dendif, Oiffy, Oiffy, Fpass, Oif, Oif, Eioccc,Eioccc,Eioccc,Eioccc,Eioccc, |
d8379ab1d unifdef: update t... |
468 |
print, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
469 470 471 |
/* IS_PASS_MIDDLE */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Pelif, Mtrue, Delif, Pelse, Pendif, Oiffy, Oiffy, Fpass, Oif, Oif, Pelif, Oelif, Oelif, Pelse, Pendif, |
d8379ab1d unifdef: update t... |
472 |
print, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
473 474 475 |
/* IS_FALSE_MIDDLE */ { Idrop, Idrop, Fdrop, Fdrop, Fdrop, Pelif, Mtrue, Delif, Pelse, Pendif, Idrop, Idrop, Fdrop, Fdrop, Fdrop, Eioccc,Eioccc,Eioccc,Eioccc,Eioccc, |
d8379ab1d unifdef: update t... |
476 |
drop, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
477 478 479 |
/* IS_TRUE_MIDDLE */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Melif, Melif, Melif, Melse, Pendif, Oiffy, Oiffy, Fpass, Oif, Oif, Eioccc,Eioccc,Eioccc,Eioccc,Pendif, |
d8379ab1d unifdef: update t... |
480 |
print, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
481 482 483 |
/* IS_PASS_ELSE */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Eelif, Eelif, Eelif, Eelse, Pendif, Oiffy, Oiffy, Fpass, Oif, Oif, Eelif, Eelif, Eelif, Eelse, Pendif, |
d8379ab1d unifdef: update t... |
484 |
print, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
485 486 487 |
/* IS_FALSE_ELSE */ { Idrop, Idrop, Fdrop, Fdrop, Fdrop, Eelif, Eelif, Eelif, Eelse, Dendif, Idrop, Idrop, Fdrop, Fdrop, Fdrop, Eelif, Eelif, Eelif, Eelse, Eioccc, |
d8379ab1d unifdef: update t... |
488 |
drop, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
489 490 491 |
/* IS_TRUE_ELSE */ { Itrue, Ifalse,Fpass, Ftrue, Ffalse,Eelif, Eelif, Eelif, Eelse, Dendif, Oiffy, Oiffy, Fpass, Oif, Oif, Eelif, Eelif, Eelif, Eelse, Eioccc, |
d8379ab1d unifdef: update t... |
492 |
print, Eeof, abort }, |
01f1c8799 kbuild: add unifdef |
493 494 495 |
/* IS_FALSE_TRAILER */ { Idrop, Idrop, Fdrop, Fdrop, Fdrop, Dfalse,Dfalse,Dfalse,Delse, Dendif, Idrop, Idrop, Fdrop, Fdrop, Fdrop, Dfalse,Dfalse,Dfalse,Delse, Eioccc, |
d8379ab1d unifdef: update t... |
496 |
drop, Eeof, abort } |
01f1c8799 kbuild: add unifdef |
497 498 |
/*TRUEI FALSEI IF TRUE FALSE ELIF ELTRUE ELFALSE ELSE ENDIF TRUEI FALSEI IF TRUE FALSE ELIF ELTRUE ELFALSE ELSE ENDIF (DODGY) |
d8379ab1d unifdef: update t... |
499 |
PLAIN EOF ERROR */ |
01f1c8799 kbuild: add unifdef |
500 501 502 503 504 505 |
}; /* * State machine utility functions */ static void |
01f1c8799 kbuild: add unifdef |
506 507 508 509 510 511 512 513 514 515 516 517 518 519 |
ignoreoff(void) { if (depth == 0) abort(); /* bug */ ignoring[depth] = ignoring[depth-1]; } static void ignoreon(void) { ignoring[depth] = true; } static void keywordedit(const char *replacement) { |
3cbea4366 unifdef: update t... |
520 521 |
snprintf(keyword, tline + sizeof(tline) - keyword, "%s%s", replacement, newline); |
01f1c8799 kbuild: add unifdef |
522 523 524 525 526 |
print(); } static void nest(void) { |
d8379ab1d unifdef: update t... |
527 528 529 |
if (depth > MAXDEPTH-1) abort(); /* bug */ if (depth == MAXDEPTH-1) |
01f1c8799 kbuild: add unifdef |
530 |
error("Too many levels of nesting"); |
d8379ab1d unifdef: update t... |
531 |
depth += 1; |
01f1c8799 kbuild: add unifdef |
532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 |
stifline[depth] = linenum; } static void unnest(void) { if (depth == 0) abort(); /* bug */ depth -= 1; } static void state(Ifstate is) { ifstate[depth] = is; } /* * Write a line to the output or not, according to command line options. */ static void flushline(bool keep) { if (symlist) return; if (keep ^ complement) { |
3cbea4366 unifdef: update t... |
556 557 |
bool blankline = tline[strspn(tline, " \t\r ")] == '\0'; |
d8379ab1d unifdef: update t... |
558 559 560 561 562 |
if (blankline && compblank && blankcount != blankmax) { delcount += 1; blankcount += 1; } else { if (lnnum && delcount > 0) |
3cbea4366 unifdef: update t... |
563 564 |
printf("#line %d%s", linenum, newline); fputs(tline, output); |
d8379ab1d unifdef: update t... |
565 566 567 |
delcount = 0; blankmax = blankcount = blankline ? blankcount + 1 : 0; } |
01f1c8799 kbuild: add unifdef |
568 569 |
} else { if (lnblank) |
3cbea4366 unifdef: update t... |
570 |
fputs(newline, output); |
01f1c8799 kbuild: add unifdef |
571 572 |
exitstat = 1; delcount += 1; |
d8379ab1d unifdef: update t... |
573 |
blankcount = 0; |
01f1c8799 kbuild: add unifdef |
574 |
} |
3cbea4366 unifdef: update t... |
575 576 |
if (debugging) fflush(output); |
01f1c8799 kbuild: add unifdef |
577 578 579 580 581 582 583 584 |
} /* * The driver for the state machine. */ static void process(void) { |
d8379ab1d unifdef: update t... |
585 586 587 |
/* When compressing blank lines, act as if the file is preceded by a large number of blank lines. */ blankmax = blankcount = 1000; |
01f1c8799 kbuild: add unifdef |
588 |
for (;;) { |
3cbea4366 unifdef: update t... |
589 |
Linetype lineval = parseline(); |
01f1c8799 kbuild: add unifdef |
590 |
trans_table[ifstate[depth]][lineval](); |
3cbea4366 unifdef: update t... |
591 592 |
debug("process line %d %s -> %s depth %d", linenum, linetype_name[lineval], |
01f1c8799 kbuild: add unifdef |
593 594 595 596 597 |
ifstate_name[ifstate[depth]], depth); } } /* |
3cbea4366 unifdef: update t... |
598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 |
* Flush the output and handle errors. */ static void closeout(void) { if (symdepth && !zerosyms) printf(" "); if (fclose(output) == EOF) { warn("couldn't write to %s", ofilename); if (overwriting) { unlink(tempname); errx(2, "%s unchanged", filename); } else { exit(2); } } } /* * Clean up and exit. */ static void done(void) { if (incomment) error("EOF in comment"); closeout(); if (overwriting && rename(tempname, ofilename) == -1) { warn("couldn't rename temporary file"); unlink(tempname); errx(2, "%s unchanged", ofilename); } exit(exitstat); } /* |
01f1c8799 kbuild: add unifdef |
635 636 637 638 639 |
* Parse a line and determine its type. We keep the preprocessor line * parser state between calls in the global variable linestate, with * help from skipcomment(). */ static Linetype |
d8379ab1d unifdef: update t... |
640 |
parseline(void) |
01f1c8799 kbuild: add unifdef |
641 642 643 644 645 646 |
{ const char *cp; int cursym; int kwlen; Linetype retval; Comment_state wascomment; |
3cbea4366 unifdef: update t... |
647 |
linenum++; |
01f1c8799 kbuild: add unifdef |
648 649 |
if (fgets(tline, MAXLINE, input) == NULL) return (LT_EOF); |
3cbea4366 unifdef: update t... |
650 651 652 653 654 655 656 |
if (newline == NULL) { if (strrchr(tline, ' ') == strrchr(tline, '\r') + 1) newline = newline_crlf; else newline = newline_unix; } |
01f1c8799 kbuild: add unifdef |
657 658 659 660 661 662 |
retval = LT_PLAIN; wascomment = incomment; cp = skipcomment(tline); if (linestate == LS_START) { if (*cp == '#') { linestate = LS_HASH; |
3cbea4366 unifdef: update t... |
663 |
firstsym = true; |
01f1c8799 kbuild: add unifdef |
664 665 666 667 668 669 670 671 672 |
cp = skipcomment(cp + 1); } else if (*cp != '\0') linestate = LS_DIRTY; } if (!incomment && linestate == LS_HASH) { keyword = tline + (cp - tline); cp = skipsym(cp); kwlen = cp - keyword; /* no way can we deal with a continuation inside a keyword */ |
3cbea4366 unifdef: update t... |
673 674 675 676 |
if (strncmp(cp, "\\\r ", 3) == 0 || strncmp(cp, "\\ ", 2) == 0) |
01f1c8799 kbuild: add unifdef |
677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 |
Eioccc(); if (strlcmp("ifdef", keyword, kwlen) == 0 || strlcmp("ifndef", keyword, kwlen) == 0) { cp = skipcomment(cp); if ((cursym = findsym(cp)) < 0) retval = LT_IF; else { retval = (keyword[2] == 'n') ? LT_FALSE : LT_TRUE; if (value[cursym] == NULL) retval = (retval == LT_TRUE) ? LT_FALSE : LT_TRUE; if (ignore[cursym]) retval = (retval == LT_TRUE) ? LT_TRUEI : LT_FALSEI; } cp = skipsym(cp); } else if (strlcmp("if", keyword, kwlen) == 0) retval = ifeval(&cp); else if (strlcmp("elif", keyword, kwlen) == 0) retval = ifeval(&cp) - LT_IF + LT_ELIF; else if (strlcmp("else", keyword, kwlen) == 0) retval = LT_ELSE; else if (strlcmp("endif", keyword, kwlen) == 0) retval = LT_ENDIF; else { linestate = LS_DIRTY; retval = LT_PLAIN; } cp = skipcomment(cp); if (*cp != '\0') { linestate = LS_DIRTY; if (retval == LT_TRUE || retval == LT_FALSE || retval == LT_TRUEI || retval == LT_FALSEI) retval = LT_IF; if (retval == LT_ELTRUE || retval == LT_ELFALSE) retval = LT_ELIF; } if (retval != LT_PLAIN && (wascomment || incomment)) { retval += LT_DODGY; if (incomment) linestate = LS_DIRTY; } |
d8379ab1d unifdef: update t... |
720 721 722 723 724 725 726 |
/* skipcomment normally changes the state, except if the last line of the file lacks a newline, or if there is too much whitespace in a directive */ if (linestate == LS_HASH) { size_t len = cp - tline; if (fgets(tline + len, MAXLINE - len, input) == NULL) { /* append the missing newline */ |
3cbea4366 unifdef: update t... |
727 728 |
strcpy(tline + len, newline); cp += strlen(newline); |
d8379ab1d unifdef: update t... |
729 730 731 732 733 |
linestate = LS_START; } else { linestate = LS_DIRTY; } } |
01f1c8799 kbuild: add unifdef |
734 735 736 737 738 |
} if (linestate == LS_DIRTY) { while (*cp != '\0') cp = skipcomment(cp + 1); } |
3cbea4366 unifdef: update t... |
739 |
debug("parser line %d state %s comment %s line", linenum, |
01f1c8799 kbuild: add unifdef |
740 741 742 743 744 745 |
comment_name[incomment], linestate_name[linestate]); return (retval); } /* * These are the binary operators that are supported by the expression |
d8379ab1d unifdef: update t... |
746 |
* evaluator. |
01f1c8799 kbuild: add unifdef |
747 |
*/ |
d8379ab1d unifdef: update t... |
748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 |
static Linetype op_strict(int *p, int v, Linetype at, Linetype bt) { if(at == LT_IF || bt == LT_IF) return (LT_IF); return (*p = v, v ? LT_TRUE : LT_FALSE); } static Linetype op_lt(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a < b, at, bt); } static Linetype op_gt(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a > b, at, bt); } static Linetype op_le(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a <= b, at, bt); } static Linetype op_ge(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a >= b, at, bt); } static Linetype op_eq(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a == b, at, bt); } static Linetype op_ne(int *p, Linetype at, int a, Linetype bt, int b) { return op_strict(p, a != b, at, bt); } static Linetype op_or(int *p, Linetype at, int a, Linetype bt, int b) { if (!strictlogic && (at == LT_TRUE || bt == LT_TRUE)) return (*p = 1, LT_TRUE); return op_strict(p, a || b, at, bt); } static Linetype op_and(int *p, Linetype at, int a, Linetype bt, int b) { if (!strictlogic && (at == LT_FALSE || bt == LT_FALSE)) return (*p = 0, LT_FALSE); return op_strict(p, a && b, at, bt); } |
01f1c8799 kbuild: add unifdef |
780 781 782 783 784 785 786 787 |
/* * An evaluation function takes three arguments, as follows: (1) a pointer to * an element of the precedence table which lists the operators at the current * level of precedence; (2) a pointer to an integer which will receive the * value of the expression; and (3) a pointer to a char* that points to the * expression to be evaluated and that is updated to the end of the expression * when evaluation is complete. The function returns LT_FALSE if the value of |
d8379ab1d unifdef: update t... |
788 789 |
* the expression is zero, LT_TRUE if it is non-zero, LT_IF if the expression * depends on an unknown symbol, or LT_ERROR if there is a parse failure. |
01f1c8799 kbuild: add unifdef |
790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 |
*/ struct ops; typedef Linetype eval_fn(const struct ops *, int *, const char **); static eval_fn eval_table, eval_unary; /* * The precedence table. Expressions involving binary operators are evaluated * in a table-driven way by eval_table. When it evaluates a subexpression it * calls the inner function with its first argument pointing to the next * element of the table. Innermost expressions have special non-table-driven * handling. */ static const struct ops { eval_fn *inner; struct op { const char *str; |
d8379ab1d unifdef: update t... |
808 |
Linetype (*fn)(int *, Linetype, int, Linetype, int); |
01f1c8799 kbuild: add unifdef |
809 810 811 812 813 814 815 816 817 818 819 820 821 822 |
} op[5]; } eval_ops[] = { { eval_table, { { "||", op_or } } }, { eval_table, { { "&&", op_and } } }, { eval_table, { { "==", op_eq }, { "!=", op_ne } } }, { eval_unary, { { "<=", op_le }, { ">=", op_ge }, { "<", op_lt }, { ">", op_gt } } } }; /* * Function for evaluating the innermost parts of expressions, |
d8379ab1d unifdef: update t... |
823 824 |
* viz. !expr (expr) number defined(symbol) symbol * We reset the constexpr flag in the last two cases. |
01f1c8799 kbuild: add unifdef |
825 826 827 828 829 830 831 |
*/ static Linetype eval_unary(const struct ops *ops, int *valp, const char **cpp) { const char *cp; char *ep; int sym; |
d8379ab1d unifdef: update t... |
832 833 |
bool defparen; Linetype lt; |
01f1c8799 kbuild: add unifdef |
834 835 836 837 838 |
cp = skipcomment(*cpp); if (*cp == '!') { debug("eval%d !", ops - eval_ops); cp++; |
d8379ab1d unifdef: update t... |
839 840 841 842 843 844 |
lt = eval_unary(ops, valp, &cp); if (lt == LT_ERROR) return (LT_ERROR); if (lt != LT_IF) { *valp = !*valp; lt = *valp ? LT_TRUE : LT_FALSE; |
eedc9d83e kbuild: fix heade... |
845 |
} |
01f1c8799 kbuild: add unifdef |
846 847 848 |
} else if (*cp == '(') { cp++; debug("eval%d (", ops - eval_ops); |
d8379ab1d unifdef: update t... |
849 850 851 |
lt = eval_table(eval_ops, valp, &cp); if (lt == LT_ERROR) return (LT_ERROR); |
01f1c8799 kbuild: add unifdef |
852 853 |
cp = skipcomment(cp); if (*cp++ != ')') |
d8379ab1d unifdef: update t... |
854 |
return (LT_ERROR); |
01f1c8799 kbuild: add unifdef |
855 856 857 |
} else if (isdigit((unsigned char)*cp)) { debug("eval%d number", ops - eval_ops); *valp = strtol(cp, &ep, 0); |
d8379ab1d unifdef: update t... |
858 859 860 |
if (ep == cp) return (LT_ERROR); lt = *valp ? LT_TRUE : LT_FALSE; |
01f1c8799 kbuild: add unifdef |
861 862 863 864 |
cp = skipsym(cp); } else if (strncmp(cp, "defined", 7) == 0 && endsym(cp[7])) { cp = skipcomment(cp+7); debug("eval%d defined", ops - eval_ops); |
d8379ab1d unifdef: update t... |
865 866 867 868 869 870 |
if (*cp == '(') { cp = skipcomment(cp+1); defparen = true; } else { defparen = false; } |
01f1c8799 kbuild: add unifdef |
871 |
sym = findsym(cp); |
d8379ab1d unifdef: update t... |
872 873 874 |
if (sym < 0) { lt = LT_IF; } else { |
eedc9d83e kbuild: fix heade... |
875 |
*valp = (value[sym] != NULL); |
d8379ab1d unifdef: update t... |
876 |
lt = *valp ? LT_TRUE : LT_FALSE; |
eedc9d83e kbuild: fix heade... |
877 |
} |
d8379ab1d unifdef: update t... |
878 879 880 881 882 |
cp = skipsym(cp); cp = skipcomment(cp); if (defparen && *cp++ != ')') return (LT_ERROR); constexpr = false; |
01f1c8799 kbuild: add unifdef |
883 884 885 |
} else if (!endsym(*cp)) { debug("eval%d symbol", ops - eval_ops); sym = findsym(cp); |
d8379ab1d unifdef: update t... |
886 887 888 889 890 |
cp = skipsym(cp); if (sym < 0) { lt = LT_IF; cp = skipargs(cp); } else if (value[sym] == NULL) { |
01f1c8799 kbuild: add unifdef |
891 |
*valp = 0; |
d8379ab1d unifdef: update t... |
892 893 |
lt = LT_FALSE; } else { |
01f1c8799 kbuild: add unifdef |
894 895 |
*valp = strtol(value[sym], &ep, 0); if (*ep != '\0' || ep == value[sym]) |
d8379ab1d unifdef: update t... |
896 897 898 |
return (LT_ERROR); lt = *valp ? LT_TRUE : LT_FALSE; cp = skipargs(cp); |
01f1c8799 kbuild: add unifdef |
899 |
} |
d8379ab1d unifdef: update t... |
900 |
constexpr = false; |
01f1c8799 kbuild: add unifdef |
901 902 |
} else { debug("eval%d bad expr", ops - eval_ops); |
d8379ab1d unifdef: update t... |
903 |
return (LT_ERROR); |
01f1c8799 kbuild: add unifdef |
904 905 906 907 |
} *cpp = cp; debug("eval%d = %d", ops - eval_ops, *valp); |
d8379ab1d unifdef: update t... |
908 |
return (lt); |
01f1c8799 kbuild: add unifdef |
909 910 911 912 913 914 915 916 917 918 919 |
} /* * Table-driven evaluation of binary operators. */ static Linetype eval_table(const struct ops *ops, int *valp, const char **cpp) { const struct op *op; const char *cp; int val; |
d8379ab1d unifdef: update t... |
920 |
Linetype lt, rt; |
01f1c8799 kbuild: add unifdef |
921 922 923 |
debug("eval%d", ops - eval_ops); cp = *cpp; |
d8379ab1d unifdef: update t... |
924 925 926 |
lt = ops->inner(ops+1, valp, &cp); if (lt == LT_ERROR) return (LT_ERROR); |
01f1c8799 kbuild: add unifdef |
927 928 929 930 931 932 933 934 935 |
for (;;) { cp = skipcomment(cp); for (op = ops->op; op->str != NULL; op++) if (strncmp(cp, op->str, strlen(op->str)) == 0) break; if (op->str == NULL) break; cp += strlen(op->str); debug("eval%d %s", ops - eval_ops, op->str); |
d8379ab1d unifdef: update t... |
936 937 938 939 |
rt = ops->inner(ops+1, &val, &cp); if (rt == LT_ERROR) return (LT_ERROR); lt = op->fn(valp, lt, *valp, rt, val); |
01f1c8799 kbuild: add unifdef |
940 941 942 943 |
} *cpp = cp; debug("eval%d = %d", ops - eval_ops, *valp); |
d8379ab1d unifdef: update t... |
944 945 |
debug("eval%d lt = %s", ops - eval_ops, linetype_name[lt]); return (lt); |
01f1c8799 kbuild: add unifdef |
946 947 948 949 950 951 952 953 954 955 956 |
} /* * Evaluate the expression on a #if or #elif line. If we can work out * the result we return LT_TRUE or LT_FALSE accordingly, otherwise we * return just a generic LT_IF. */ static Linetype ifeval(const char **cpp) { int ret; |
d8379ab1d unifdef: update t... |
957 |
int val = 0; |
01f1c8799 kbuild: add unifdef |
958 959 |
debug("eval %s", *cpp); |
d8379ab1d unifdef: update t... |
960 961 |
constexpr = killconsts ? false : true; ret = eval_table(eval_ops, &val, cpp); |
01f1c8799 kbuild: add unifdef |
962 |
debug("eval = %d", val); |
d8379ab1d unifdef: update t... |
963 |
return (constexpr ? LT_IF : ret == LT_ERROR ? LT_IF : ret); |
01f1c8799 kbuild: add unifdef |
964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 |
} /* * Skip over comments, strings, and character literals and stop at the * next character position that is not whitespace. Between calls we keep * the comment state in the global variable incomment, and we also adjust * the global variable linestate when we see a newline. * XXX: doesn't cope with the buffer splitting inside a state transition. */ static const char * skipcomment(const char *cp) { if (text || ignoring[depth]) { for (; isspace((unsigned char)*cp); cp++) if (*cp == ' ') linestate = LS_START; return (cp); } while (*cp != '\0') /* don't reset to LS_START after a line continuation */ |
3cbea4366 unifdef: update t... |
985 986 987 988 989 |
if (strncmp(cp, "\\\r ", 3) == 0) cp += 3; else if (strncmp(cp, "\\ ", 2) == 0) |
01f1c8799 kbuild: add unifdef |
990 991 992 |
cp += 2; else switch (incomment) { case NO_COMMENT: |
3cbea4366 unifdef: update t... |
993 994 995 996 997 998 |
if (strncmp(cp, "/\\\r ", 4) == 0) { incomment = STARTING_COMMENT; cp += 4; } else if (strncmp(cp, "/\\ ", 3) == 0) { |
01f1c8799 kbuild: add unifdef |
999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 |
incomment = STARTING_COMMENT; cp += 3; } else if (strncmp(cp, "/*", 2) == 0) { incomment = C_COMMENT; cp += 2; } else if (strncmp(cp, "//", 2) == 0) { incomment = CXX_COMMENT; cp += 2; } else if (strncmp(cp, "\'", 1) == 0) { incomment = CHAR_LITERAL; linestate = LS_DIRTY; cp += 1; } else if (strncmp(cp, "\"", 1) == 0) { incomment = STRING_LITERAL; linestate = LS_DIRTY; cp += 1; } else if (strncmp(cp, " ", 1) == 0) { linestate = LS_START; cp += 1; |
3cbea4366 unifdef: update t... |
1019 |
} else if (strchr(" \r\t", *cp) != NULL) { |
01f1c8799 kbuild: add unifdef |
1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 |
cp += 1; } else return (cp); continue; case CXX_COMMENT: if (strncmp(cp, " ", 1) == 0) { incomment = NO_COMMENT; linestate = LS_START; } cp += 1; continue; case CHAR_LITERAL: case STRING_LITERAL: if ((incomment == CHAR_LITERAL && cp[0] == '\'') || (incomment == STRING_LITERAL && cp[0] == '\"')) { incomment = NO_COMMENT; cp += 1; } else if (cp[0] == '\\') { if (cp[1] == '\0') cp += 1; else cp += 2; } else if (strncmp(cp, " ", 1) == 0) { if (incomment == CHAR_LITERAL) error("unterminated char literal"); else error("unterminated string literal"); } else cp += 1; continue; case C_COMMENT: |
3cbea4366 unifdef: update t... |
1053 1054 1055 1056 1057 1058 |
if (strncmp(cp, "*\\\r ", 4) == 0) { incomment = FINISHING_COMMENT; cp += 4; } else if (strncmp(cp, "*\\ ", 3) == 0) { |
01f1c8799 kbuild: add unifdef |
1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 |
incomment = FINISHING_COMMENT; cp += 3; } else if (strncmp(cp, "*/", 2) == 0) { incomment = NO_COMMENT; cp += 2; } else cp += 1; continue; case STARTING_COMMENT: if (*cp == '*') { incomment = C_COMMENT; cp += 1; } else if (*cp == '/') { incomment = CXX_COMMENT; cp += 1; } else { incomment = NO_COMMENT; linestate = LS_DIRTY; } continue; case FINISHING_COMMENT: if (*cp == '/') { incomment = NO_COMMENT; cp += 1; } else incomment = C_COMMENT; continue; default: abort(); /* bug */ } return (cp); } /* |
d8379ab1d unifdef: update t... |
1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 |
* Skip macro arguments. */ static const char * skipargs(const char *cp) { const char *ocp = cp; int level = 0; cp = skipcomment(cp); if (*cp != '(') return (cp); do { if (*cp == '(') level++; if (*cp == ')') level--; cp = skipcomment(cp+1); } while (level != 0 && *cp != '\0'); if (level == 0) return (cp); else /* Rewind and re-detect the syntax error later. */ return (ocp); } /* |
01f1c8799 kbuild: add unifdef |
1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 |
* Skip over an identifier. */ static const char * skipsym(const char *cp) { while (!endsym(*cp)) ++cp; return (cp); } /* |
d8379ab1d unifdef: update t... |
1129 |
* Look for the symbol in the symbol table. If it is found, we return |
01f1c8799 kbuild: add unifdef |
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 |
* the symbol table index, else we return -1. */ static int findsym(const char *str) { const char *cp; int symind; cp = skipsym(str); if (cp == str) return (-1); if (symlist) { |
3cbea4366 unifdef: update t... |
1142 1143 1144 1145 1146 1147 1148 1149 1150 |
if (symdepth && firstsym) printf("%s%3d", zerosyms ? "" : " ", depth); firstsym = zerosyms = false; printf("%s%.*s%s", symdepth ? " " : "", (int)(cp-str), str, symdepth ? "" : " "); |
01f1c8799 kbuild: add unifdef |
1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 |
/* we don't care about the value of the symbol */ return (0); } for (symind = 0; symind < nsyms; ++symind) { if (strlcmp(symname[symind], str, cp-str) == 0) { debug("findsym %s %s", symname[symind], value[symind] ? value[symind] : ""); return (symind); } } return (-1); } /* * Add a symbol to the symbol table. */ static void addsym(bool ignorethis, bool definethis, char *sym) { int symind; char *val; symind = findsym(sym); if (symind < 0) { if (nsyms >= MAXSYMS) errx(2, "too many symbols"); symind = nsyms++; } symname[symind] = sym; ignore[symind] = ignorethis; val = sym + (skipsym(sym) - sym); if (definethis) { if (*val == '=') { value[symind] = val+1; *val = '\0'; } else if (*val == '\0') |
3cbea4366 unifdef: update t... |
1187 |
value[symind] = "1"; |
01f1c8799 kbuild: add unifdef |
1188 1189 1190 1191 1192 1193 1194 |
else usage(); } else { if (*val != '\0') usage(); value[symind] = NULL; } |
3cbea4366 unifdef: update t... |
1195 1196 |
debug("addsym %s=%s", symname[symind], value[symind] ? value[symind] : "undef"); |
01f1c8799 kbuild: add unifdef |
1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 |
} /* * Compare s with n characters of t. * The same as strncmp() except that it checks that s[n] == '\0'. */ static int strlcmp(const char *s, const char *t, size_t n) { while (n-- && *t != '\0') if (*s != *t) return ((unsigned char)*s - (unsigned char)*t); else ++s, ++t; return ((unsigned char)*s); } /* * Diagnostics. */ static void debug(const char *msg, ...) { va_list ap; if (debugging) { va_start(ap, msg); vwarnx(msg, ap); va_end(ap); } } static void error(const char *msg) { if (depth == 0) warnx("%s: %d: %s", filename, linenum, msg); else warnx("%s: %d: %s (#if line %d depth %d)", filename, linenum, msg, stifline[depth], depth); |
3cbea4366 unifdef: update t... |
1237 |
closeout(); |
01f1c8799 kbuild: add unifdef |
1238 1239 |
errx(2, "output may be truncated"); } |