9 #include "preprocessor.h"
13 #include "adt/error.h"
14 #include "adt/strutil.h"
15 #include "adt/strset.h"
16 #include "lang_features.h"
17 #include "diagnostic.h"
18 #include "string_rep.h"
22 #define INCLUDE_LIMIT 199 /* 199 is for gcc "compatibility" */
24 typedef struct saved_token_t {
29 typedef struct whitespace_info_t {
30 /** current token had whitespace in front of it */
32 /** current token is at the beginning of a line.
33 * => a "#" at line begin starts a preprocessing directive. */
35 /** number of spaces before the first token in a line */
36 unsigned whitespace_at_line_begin;
39 struct pp_definition_t {
41 source_position_t source_position;
42 pp_definition_t *parent_expansion;
44 whitespace_info_t expand_info;
46 bool is_expanding : 1;
47 bool has_parameters : 1;
48 bool is_parameter : 1;
49 pp_definition_t *function_definition;
51 pp_definition_t *parameters;
55 saved_token_t *token_list;
58 typedef struct pp_conditional_t pp_conditional_t;
59 struct pp_conditional_t {
60 source_position_t source_position;
63 /** conditional in skip mode (then+else gets skipped) */
65 pp_conditional_t *parent;
68 typedef struct pp_input_t pp_input_t;
73 utf32 buf[1024+MAX_PUTBACK];
76 source_position_t position;
81 typedef struct searchpath_entry_t searchpath_entry_t;
82 struct searchpath_entry_t {
84 searchpath_entry_t *next;
87 static pp_input_t input;
89 static pp_input_t *input_stack;
90 static unsigned n_inputs;
91 static struct obstack input_obstack;
93 static pp_conditional_t *conditional_stack;
96 bool allow_dollar_in_symbol = true;
97 static bool resolve_escape_sequences = true;
98 static bool error_on_unknown_chars = true;
99 static bool skip_mode;
101 static struct obstack pp_obstack;
102 static struct obstack config_obstack;
103 static const char *printed_input_name = NULL;
104 static source_position_t expansion_pos;
105 static pp_definition_t *current_expansion = NULL;
106 static pp_definition_t *current_call = NULL;
107 static pp_definition_t *current_argument = NULL;
108 static pp_definition_t *argument_expanding = NULL;
109 static unsigned argument_brace_count;
110 static strset_t stringset;
111 static token_kind_t last_token;
113 static searchpath_entry_t *searchpath;
115 static whitespace_info_t next_info; /* valid if had_whitespace is true */
116 static whitespace_info_t info;
118 static inline void next_char(void);
119 static void next_input_token(void);
120 static void print_line_directive(const source_position_t *pos, const char *add);
122 static symbol_t *symbol_colongreater;
123 static symbol_t *symbol_lesscolon;
124 static symbol_t *symbol_lesspercent;
125 static symbol_t *symbol_percentcolon;
126 static symbol_t *symbol_percentcolonpercentcolon;
127 static symbol_t *symbol_percentgreater;
129 static void init_symbols(void)
131 symbol_colongreater = symbol_table_insert(":>");
132 symbol_lesscolon = symbol_table_insert("<:");
133 symbol_lesspercent = symbol_table_insert("<%");
134 symbol_percentcolon = symbol_table_insert("%:");
135 symbol_percentcolonpercentcolon = symbol_table_insert("%:%:");
136 symbol_percentgreater = symbol_table_insert("%>");
139 void switch_input(FILE *const file, char const *const filename)
142 input.input = input_from_stream(file, NULL);
145 input.output_line = 0;
146 input.position.input_name = filename;
147 input.position.lineno = 1;
149 /* indicate that we're at a new input */
150 print_line_directive(&input.position, input_stack != NULL ? "1" : NULL);
152 /* place a virtual '\n' so we realize we're at line begin */
153 input.position.lineno = 0;
157 FILE* close_input(void)
159 input_free(input.input);
161 FILE* const file = input.file;
173 static void push_input(void)
175 pp_input_t *saved_input
176 = obstack_alloc(&input_obstack, sizeof(*saved_input));
178 memcpy(saved_input, &input, sizeof(*saved_input));
180 /* adjust buffer positions */
181 if (input.bufpos != NULL)
182 saved_input->bufpos = saved_input->buf + (input.bufpos - input.buf);
183 if (input.bufend != NULL)
184 saved_input->bufend = saved_input->buf + (input.bufend - input.buf);
186 saved_input->parent = input_stack;
187 input_stack = saved_input;
191 static void pop_restore_input(void)
193 assert(n_inputs > 0);
194 assert(input_stack != NULL);
196 pp_input_t *saved_input = input_stack;
198 memcpy(&input, saved_input, sizeof(input));
201 /* adjust buffer positions */
202 if (saved_input->bufpos != NULL)
203 input.bufpos = input.buf + (saved_input->bufpos - saved_input->buf);
204 if (saved_input->bufend != NULL)
205 input.bufend = input.buf + (saved_input->bufend - saved_input->buf);
207 input_stack = saved_input->parent;
208 obstack_free(&input_obstack, saved_input);
213 * Prints a parse error message at the current token.
215 * @param msg the error message
217 static void parse_error(const char *msg)
219 errorf(&pp_token.base.source_position, "%s", msg);
222 static inline void next_real_char(void)
224 assert(input.bufpos <= input.bufend);
225 if (input.bufpos >= input.bufend) {
226 size_t const n = decode(input.input, input.buf + MAX_PUTBACK, lengthof(input.buf) - MAX_PUTBACK);
231 input.bufpos = input.buf + MAX_PUTBACK;
232 input.bufend = input.bufpos + n;
234 input.c = *input.bufpos++;
235 ++input.position.colno;
239 * Put a character back into the buffer.
241 * @param pc the character to put back
243 static inline void put_back(utf32 const pc)
245 assert(input.bufpos > input.buf);
246 *(--input.bufpos - input.buf + input.buf) = (char) pc;
247 --input.position.colno;
253 if (input.c == '\n') { \
257 ++input.position.lineno; \
258 input.position.colno = 1; \
260 newline // Let it look like an ordinary case label.
262 #define eat(c_type) (assert(input.c == c_type), next_char())
264 static void maybe_concat_lines(void)
270 info.whitespace_at_line_begin = 0;
282 * Set c to the next input character, ie.
283 * after expanding trigraphs.
285 static inline void next_char(void)
289 /* filter trigraphs and concatenated lines */
290 if (UNLIKELY(input.c == '\\')) {
291 maybe_concat_lines();
292 goto end_of_next_char;
295 if (LIKELY(input.c != '?'))
296 goto end_of_next_char;
299 if (LIKELY(input.c != '?')) {
302 goto end_of_next_char;
307 case '=': input.c = '#'; break;
308 case '(': input.c = '['; break;
309 case '/': input.c = '\\'; maybe_concat_lines(); break;
310 case ')': input.c = ']'; break;
311 case '\'': input.c = '^'; break;
312 case '<': input.c = '{'; break;
313 case '!': input.c = '|'; break;
314 case '>': input.c = '}'; break;
315 case '-': input.c = '~'; break;
325 printf("nchar '%c'\n", input.c);
332 * Returns true if the given char is a octal digit.
334 * @param char the character to check
336 static inline bool is_octal_digit(int chr)
354 * Returns the value of a digit.
355 * The only portable way to do it ...
357 static int digit_value(int digit)
383 panic("wrong character given");
388 * Parses an octal character sequence.
390 * @param first_digit the already read first digit
392 static utf32 parse_octal_sequence(const utf32 first_digit)
394 assert(is_octal_digit(first_digit));
395 utf32 value = digit_value(first_digit);
396 if (!is_octal_digit(input.c)) return value;
397 value = 8 * value + digit_value(input.c);
399 if (!is_octal_digit(input.c)) return value;
400 value = 8 * value + digit_value(input.c);
407 * Parses a hex character sequence.
409 static utf32 parse_hex_sequence(void)
412 while (isxdigit(input.c)) {
413 value = 16 * value + digit_value(input.c);
419 static bool is_universal_char_valid(utf32 const v)
422 if (v < 0xA0U && v != 0x24 && v != 0x40 && v != 0x60)
424 if (0xD800 <= v && v <= 0xDFFF)
429 static utf32 parse_universal_char(unsigned const n_digits)
432 for (unsigned k = n_digits; k != 0; --k) {
433 if (isxdigit(input.c)) {
434 v = 16 * v + digit_value(input.c);
435 if (!resolve_escape_sequences)
436 obstack_1grow(&symbol_obstack, input.c);
439 errorf(&input.position,
440 "short universal character name, expected %u more digits",
445 if (!is_universal_char_valid(v)) {
446 errorf(&input.position,
447 "\\%c%0*X is not a valid universal character name",
448 n_digits == 4 ? 'u' : 'U', (int)n_digits, v);
453 static bool is_universal_char_valid_identifier(utf32 const v)
456 if ( v == 0x000A8) return true;
457 if ( v == 0x000AA) return true;
458 if ( v == 0x000AD) return true;
459 if ( v == 0x000AF) return true;
460 if (0x000B2 <= v && v <= 0x000B5) return true;
461 if (0x000B7 <= v && v <= 0x000BA) return true;
462 if (0x000BC <= v && v <= 0x000BE) return true;
463 if (0x000C0 <= v && v <= 0x000D6) return true;
464 if (0x000D8 <= v && v <= 0x000F6) return true;
465 if (0x000F8 <= v && v <= 0x000FF) return true;
466 if (0x00100 <= v && v <= 0x0167F) return true;
467 if (0x01681 <= v && v <= 0x0180D) return true;
468 if (0x0180F <= v && v <= 0x01FFF) return true;
469 if (0x0200B <= v && v <= 0x0200D) return true;
470 if (0x0202A <= v && v <= 0x0202E) return true;
471 if (0x0203F <= v && v <= 0x02040) return true;
472 if ( v == 0x02054) return true;
473 if (0x02060 <= v && v <= 0x0206F) return true;
474 if (0x02070 <= v && v <= 0x0218F) return true;
475 if (0x02460 <= v && v <= 0x024FF) return true;
476 if (0x02776 <= v && v <= 0x02793) return true;
477 if (0x02C00 <= v && v <= 0x02DFF) return true;
478 if (0x02E80 <= v && v <= 0x02FFF) return true;
479 if (0x03004 <= v && v <= 0x03007) return true;
480 if (0x03021 <= v && v <= 0x0302F) return true;
481 if (0x03031 <= v && v <= 0x0303F) return true;
482 if (0x03040 <= v && v <= 0x0D7FF) return true;
483 if (0x0F900 <= v && v <= 0x0FD3D) return true;
484 if (0x0FD40 <= v && v <= 0x0FDCF) return true;
485 if (0x0FDF0 <= v && v <= 0x0FE44) return true;
486 if (0x0FE47 <= v && v <= 0x0FFFD) return true;
487 if (0x10000 <= v && v <= 0x1FFFD) return true;
488 if (0x20000 <= v && v <= 0x2FFFD) return true;
489 if (0x30000 <= v && v <= 0x3FFFD) return true;
490 if (0x40000 <= v && v <= 0x4FFFD) return true;
491 if (0x50000 <= v && v <= 0x5FFFD) return true;
492 if (0x60000 <= v && v <= 0x6FFFD) return true;
493 if (0x70000 <= v && v <= 0x7FFFD) return true;
494 if (0x80000 <= v && v <= 0x8FFFD) return true;
495 if (0x90000 <= v && v <= 0x9FFFD) return true;
496 if (0xA0000 <= v && v <= 0xAFFFD) return true;
497 if (0xB0000 <= v && v <= 0xBFFFD) return true;
498 if (0xC0000 <= v && v <= 0xCFFFD) return true;
499 if (0xD0000 <= v && v <= 0xDFFFD) return true;
500 if (0xE0000 <= v && v <= 0xEFFFD) return true;
504 static bool is_universal_char_valid_identifier_start(utf32 const v)
507 if (0x0300 <= v && v <= 0x036F) return false;
508 if (0x1DC0 <= v && v <= 0x1DFF) return false;
509 if (0x20D0 <= v && v <= 0x20FF) return false;
510 if (0xFE20 <= v && v <= 0xFE2F) return false;
515 * Parse an escape sequence.
517 static utf32 parse_escape_sequence(void)
521 utf32 const ec = input.c;
525 case '"': return '"';
526 case '\'': return '\'';
527 case '\\': return '\\';
528 case '?': return '\?';
529 case 'a': return '\a';
530 case 'b': return '\b';
531 case 'f': return '\f';
532 case 'n': return '\n';
533 case 'r': return '\r';
534 case 't': return '\t';
535 case 'v': return '\v';
537 return parse_hex_sequence();
546 return parse_octal_sequence(ec);
548 parse_error("reached end of file while parsing escape sequence");
550 /* \E is not documented, but handled, by GCC. It is acceptable according
551 * to §6.11.4, whereas \e is not. */
555 return 27; /* hopefully 27 is ALWAYS the code for ESCAPE */
558 case 'U': return parse_universal_char(8);
559 case 'u': return parse_universal_char(4);
564 /* §6.4.4.4:8 footnote 64 */
565 parse_error("unknown escape sequence");
569 static const char *identify_string(char *string)
571 const char *result = strset_insert(&stringset, string);
572 if (result != string) {
573 obstack_free(&symbol_obstack, string);
578 static string_t sym_make_string(string_encoding_t const enc)
580 obstack_1grow(&symbol_obstack, '\0');
581 size_t const len = obstack_object_size(&symbol_obstack) - 1;
582 char *const string = obstack_finish(&symbol_obstack);
583 char const *const result = identify_string(string);
584 return (string_t){ result, len, enc };
587 string_t make_string(char const *const string)
589 obstack_grow(&symbol_obstack, string, strlen(string));
590 return sym_make_string(STRING_ENCODING_CHAR);
593 static void parse_string(utf32 const delimiter, token_kind_t const kind,
594 string_encoding_t const enc,
595 char const *const context)
597 const unsigned start_linenr = input.position.lineno;
604 if (resolve_escape_sequences) {
605 utf32 const tc = parse_escape_sequence();
606 if (enc == STRING_ENCODING_CHAR) {
608 warningf(WARN_OTHER, &pp_token.base.source_position, "escape sequence out of range");
610 obstack_1grow(&symbol_obstack, tc);
612 obstack_grow_utf8(&symbol_obstack, tc);
615 obstack_1grow(&symbol_obstack, (char)input.c);
617 obstack_1grow(&symbol_obstack, (char)input.c);
624 errorf(&pp_token.base.source_position, "newline while parsing %s", context);
628 source_position_t source_position;
629 source_position.input_name = pp_token.base.source_position.input_name;
630 source_position.lineno = start_linenr;
631 errorf(&source_position, "EOF while parsing %s", context);
636 if (input.c == delimiter) {
640 obstack_grow_utf8(&symbol_obstack, input.c);
648 pp_token.kind = kind;
649 pp_token.literal.string = sym_make_string(enc);
652 static void parse_string_literal(string_encoding_t const enc)
654 parse_string('"', T_STRING_LITERAL, enc, "string literal");
657 static void parse_character_constant(string_encoding_t const enc)
659 parse_string('\'', T_CHARACTER_CONSTANT, enc, "character constant");
660 if (pp_token.literal.string.size == 0) {
661 parse_error("empty character constant");
665 #define SYMBOL_CASES_WITHOUT_E_P \
666 '$': if (!allow_dollar_in_symbol) goto dollar_sign; \
717 #define SYMBOL_CASES \
718 SYMBOL_CASES_WITHOUT_E_P: \
724 #define DIGIT_CASES \
736 static void start_expanding(pp_definition_t *definition)
738 definition->parent_expansion = current_expansion;
739 definition->expand_pos = 0;
740 definition->is_expanding = true;
741 if (definition->list_len > 0) {
742 definition->token_list[0].had_whitespace
743 = info.had_whitespace;
745 current_expansion = definition;
748 static void finished_expanding(pp_definition_t *definition)
750 assert(definition->is_expanding);
751 pp_definition_t *parent = definition->parent_expansion;
752 definition->parent_expansion = NULL;
753 definition->is_expanding = false;
755 /* stop further expanding once we expanded a parameter used in a
757 if (definition == argument_expanding)
758 argument_expanding = NULL;
760 assert(current_expansion == definition);
761 current_expansion = parent;
764 static inline void set_punctuator(token_kind_t const kind)
766 pp_token.kind = kind;
767 pp_token.base.symbol = token_symbols[kind];
770 static inline void set_digraph(token_kind_t const kind, symbol_t *const symbol)
772 pp_token.kind = kind;
773 pp_token.base.symbol = symbol;
777 * returns next final token from a preprocessor macro expansion
779 static bool expand_next(void)
781 if (current_expansion == NULL)
785 size_t pos = current_expansion->expand_pos;
786 if (pos >= current_expansion->list_len) {
787 finished_expanding(current_expansion);
788 /* it was the outermost expansion, parse pptoken normally */
789 if (current_expansion == NULL) {
794 const saved_token_t *saved = ¤t_expansion->token_list[pos++];
795 pp_token = saved->token;
797 if (current_expansion->expand_pos > 0)
798 info.had_whitespace = saved->had_whitespace;
799 pp_token.base.source_position = expansion_pos;
800 ++current_expansion->expand_pos;
806 * Returns the next token kind found when continuing the current expansions
807 * without starting new sub-expansions.
809 static token_kind_t peek_expansion(void)
811 pp_definition_t *expansion = current_expansion;
812 while (expansion != NULL && expansion->expand_pos >= expansion->list_len) {
813 expansion = expansion->parent_expansion;
815 if (expansion == NULL)
817 return expansion->token_list[expansion->expand_pos].token.kind;
820 static void skip_line_comment(void)
822 info.had_whitespace = true;
839 static void skip_multiline_comment(void)
841 info.had_whitespace = true;
843 unsigned start_linenr = input.position.lineno;
848 if (input.c == '*') {
849 /* TODO: nested comment, warn here */
854 if (input.c == '/') {
855 if (input.position.lineno != input.output_line)
856 info.whitespace_at_line_begin = input.position.colno;
866 source_position_t source_position;
867 source_position.input_name = pp_token.base.source_position.input_name;
868 source_position.lineno = start_linenr;
869 errorf(&source_position, "at end of file while looking for comment end");
880 static bool skip_till_newline(bool stop_at_non_whitespace)
892 if (input.c == '/') {
896 } else if (input.c == '*') {
898 skip_multiline_comment();
910 if (stop_at_non_whitespace)
919 static void skip_whitespace(void)
925 ++info.whitespace_at_line_begin;
926 info.had_whitespace = true;
931 info.at_line_begin = true;
932 info.had_whitespace = true;
933 info.whitespace_at_line_begin = 0;
938 if (input.c == '/') {
942 } else if (input.c == '*') {
944 skip_multiline_comment();
958 static inline void eat_pp(pp_token_kind_t const kind)
960 assert(pp_token.base.symbol->pp_ID == kind);
965 static inline void eat_token(token_kind_t const kind)
967 assert(pp_token.kind == kind);
972 static void parse_symbol(void)
974 assert(obstack_object_size(&symbol_obstack) == 0);
979 obstack_1grow(&symbol_obstack, (char) input.c);
988 case 'U': n = 8; goto universal;
989 case 'u': n = 4; goto universal;
991 if (!resolve_escape_sequences) {
992 obstack_1grow(&symbol_obstack, '\\');
993 obstack_1grow(&symbol_obstack, input.c);
996 utf32 const v = parse_universal_char(n);
997 if (!is_universal_char_valid_identifier(v)) {
998 if (is_universal_char_valid(v)) {
999 errorf(&input.position,
1000 "universal character \\%c%0*X is not valid in an identifier",
1001 n == 4 ? 'u' : 'U', (int)n, v);
1003 } else if (obstack_object_size(&symbol_obstack) == 0 && !is_universal_char_valid_identifier_start(v)) {
1004 errorf(&input.position,
1005 "universal character \\%c%0*X is not valid as start of an identifier",
1006 n == 4 ? 'u' : 'U', (int)n, v);
1007 } else if (resolve_escape_sequences) {
1008 obstack_grow_utf8(&symbol_obstack, v);
1026 obstack_1grow(&symbol_obstack, '\0');
1027 char *string = obstack_finish(&symbol_obstack);
1029 /* might be a wide string or character constant ( L"string"/L'c' ) */
1030 if (input.c == '"' && string[0] == 'L' && string[1] == '\0') {
1031 obstack_free(&symbol_obstack, string);
1032 parse_string_literal(STRING_ENCODING_WIDE);
1034 } else if (input.c == '\'' && string[0] == 'L' && string[1] == '\0') {
1035 obstack_free(&symbol_obstack, string);
1036 parse_character_constant(STRING_ENCODING_WIDE);
1040 symbol_t *symbol = symbol_table_insert(string);
1042 pp_token.kind = symbol->ID;
1043 pp_token.base.symbol = symbol;
1045 /* we can free the memory from symbol obstack if we already had an entry in
1046 * the symbol table */
1047 if (symbol->string != string) {
1048 obstack_free(&symbol_obstack, string);
1052 static void parse_number(void)
1054 obstack_1grow(&symbol_obstack, (char) input.c);
1061 case SYMBOL_CASES_WITHOUT_E_P:
1062 obstack_1grow(&symbol_obstack, (char) input.c);
1070 obstack_1grow(&symbol_obstack, (char) input.c);
1072 if (input.c == '+' || input.c == '-') {
1073 obstack_1grow(&symbol_obstack, (char) input.c);
1085 pp_token.kind = T_NUMBER;
1086 pp_token.literal.string = sym_make_string(STRING_ENCODING_CHAR);
1089 #define MAYBE_PROLOG \
1093 #define MAYBE(ch, kind) \
1096 set_punctuator(kind); \
1099 #define MAYBE_DIGRAPH(ch, kind, symbol) \
1102 set_digraph(kind, symbol); \
1105 #define ELSE_CODE(code) \
1111 #define ELSE(kind) ELSE_CODE(set_punctuator(kind);)
1113 /** identifies and returns the next preprocessing token contained in the
1114 * input stream. No macro expansion is performed. */
1115 static void next_input_token(void)
1117 if (next_info.had_whitespace) {
1119 next_info.had_whitespace = false;
1121 info.at_line_begin = false;
1122 info.had_whitespace = false;
1125 pp_token.base.source_position = input.position;
1126 pp_token.base.symbol = NULL;
1131 info.whitespace_at_line_begin++;
1132 info.had_whitespace = true;
1137 info.at_line_begin = true;
1138 info.had_whitespace = true;
1139 info.whitespace_at_line_begin = 0;
1151 parse_string_literal(STRING_ENCODING_CHAR);
1155 parse_character_constant(STRING_ENCODING_CHAR);
1177 MAYBE('.', T_DOTDOTDOT)
1181 set_punctuator('.');
1186 MAYBE('&', T_ANDAND)
1187 MAYBE('=', T_ANDEQUAL)
1191 MAYBE('=', T_ASTERISKEQUAL)
1195 MAYBE('+', T_PLUSPLUS)
1196 MAYBE('=', T_PLUSEQUAL)
1200 MAYBE('>', T_MINUSGREATER)
1201 MAYBE('-', T_MINUSMINUS)
1202 MAYBE('=', T_MINUSEQUAL)
1206 MAYBE('=', T_EXCLAMATIONMARKEQUAL)
1210 MAYBE('=', T_SLASHEQUAL)
1213 skip_multiline_comment();
1217 skip_line_comment();
1222 MAYBE_DIGRAPH('>', '}', symbol_percentgreater)
1223 MAYBE('=', T_PERCENTEQUAL)
1228 MAYBE_DIGRAPH(':', T_HASHHASH, symbol_percentcolonpercentcolon)
1232 goto digraph_percentcolon;
1235 digraph_percentcolon:
1236 set_digraph('#', symbol_percentcolon);
1241 MAYBE_DIGRAPH(':', '[', symbol_lesscolon)
1242 MAYBE_DIGRAPH('%', '{', symbol_lesspercent)
1243 MAYBE('=', T_LESSEQUAL)
1246 MAYBE('=', T_LESSLESSEQUAL)
1251 MAYBE('=', T_GREATEREQUAL)
1254 MAYBE('=', T_GREATERGREATEREQUAL)
1255 ELSE(T_GREATERGREATER)
1259 MAYBE('=', T_CARETEQUAL)
1263 MAYBE('=', T_PIPEEQUAL)
1264 MAYBE('|', T_PIPEPIPE)
1268 MAYBE_DIGRAPH('>', ']', symbol_colongreater)
1270 if (c_mode & _CXX) {
1272 set_punctuator(T_COLONCOLON);
1279 MAYBE('=', T_EQUALEQUAL)
1283 MAYBE('#', T_HASHHASH)
1296 set_punctuator(input.c);
1301 if (input_stack != NULL) {
1302 fclose(close_input());
1303 pop_restore_input();
1305 if (input.c == (utf32)EOF)
1306 --input.position.lineno;
1307 print_line_directive(&input.position, "2");
1310 info.at_line_begin = true;
1311 set_punctuator(T_EOF);
1317 int next_c = input.c;
1320 if (next_c == 'U' || next_c == 'u') {
1327 if (error_on_unknown_chars) {
1328 errorf(&pp_token.base.source_position,
1329 "unknown character '%lc' found\n", input.c);
1333 assert(obstack_object_size(&symbol_obstack) == 0);
1334 obstack_grow_utf8(&symbol_obstack, input.c);
1335 obstack_1grow(&symbol_obstack, '\0');
1336 char *const string = obstack_finish(&symbol_obstack);
1337 symbol_t *const symbol = symbol_table_insert(string);
1338 if (symbol->string != string)
1339 obstack_free(&symbol_obstack, string);
1341 pp_token.kind = T_UNKNOWN_CHAR;
1342 pp_token.base.symbol = symbol;
1349 static void print_quoted_string(const char *const string)
1352 for (const char *c = string; *c != 0; ++c) {
1354 case '"': fputs("\\\"", out); break;
1355 case '\\': fputs("\\\\", out); break;
1356 case '\a': fputs("\\a", out); break;
1357 case '\b': fputs("\\b", out); break;
1358 case '\f': fputs("\\f", out); break;
1359 case '\n': fputs("\\n", out); break;
1360 case '\r': fputs("\\r", out); break;
1361 case '\t': fputs("\\t", out); break;
1362 case '\v': fputs("\\v", out); break;
1363 case '\?': fputs("\\?", out); break;
1366 fprintf(out, "\\%03o", (unsigned)*c);
1376 static void print_line_directive(const source_position_t *pos, const char *add)
1381 fprintf(out, "# %u ", pos->lineno);
1382 print_quoted_string(pos->input_name);
1388 printed_input_name = pos->input_name;
1389 input.output_line = pos->lineno-1;
1392 static bool emit_newlines(void)
1394 unsigned delta = pp_token.base.source_position.lineno - input.output_line;
1400 print_line_directive(&pp_token.base.source_position, NULL);
1403 for (unsigned i = 0; i < delta; ++i) {
1407 input.output_line = pp_token.base.source_position.lineno;
1409 for (unsigned i = 0; i < info.whitespace_at_line_begin; ++i)
1415 static void emit_pp_token(void)
1417 if (!emit_newlines() &&
1418 (info.had_whitespace || tokens_would_paste(last_token, pp_token.kind)))
1421 switch (pp_token.kind) {
1423 fputs(pp_token.literal.string.begin, out);
1426 case T_STRING_LITERAL:
1427 fputs(get_string_encoding_prefix(pp_token.literal.string.encoding), out);
1429 fputs(pp_token.literal.string.begin, out);
1433 case T_CHARACTER_CONSTANT:
1434 fputs(get_string_encoding_prefix(pp_token.literal.string.encoding), out);
1436 fputs(pp_token.literal.string.begin, out);
1440 case T_MACRO_PARAMETER:
1441 panic("macro parameter not expanded");
1444 fputs(pp_token.base.symbol->string, out);
1447 last_token = pp_token.kind;
1450 static void eat_pp_directive(void)
1452 while (!info.at_line_begin) {
1457 static bool strings_equal(const string_t *string1, const string_t *string2)
1459 size_t size = string1->size;
1460 if (size != string2->size)
1463 const char *c1 = string1->begin;
1464 const char *c2 = string2->begin;
1465 for (size_t i = 0; i < size; ++i, ++c1, ++c2) {
1472 static bool pp_tokens_equal(const token_t *token1, const token_t *token2)
1474 if (token1->kind != token2->kind)
1477 switch (token1->kind) {
1479 case T_CHARACTER_CONSTANT:
1480 case T_STRING_LITERAL:
1481 return strings_equal(&token1->literal.string, &token2->literal.string);
1483 case T_MACRO_PARAMETER:
1484 return token1->macro_parameter.def->symbol
1485 == token2->macro_parameter.def->symbol;
1488 return token1->base.symbol == token2->base.symbol;
1492 static bool pp_definitions_equal(const pp_definition_t *definition1,
1493 const pp_definition_t *definition2)
1495 if (definition1->list_len != definition2->list_len)
1498 size_t len = definition1->list_len;
1499 const saved_token_t *t1 = definition1->token_list;
1500 const saved_token_t *t2 = definition2->token_list;
1501 for (size_t i = 0; i < len; ++i, ++t1, ++t2) {
1502 if (!pp_tokens_equal(&t1->token, &t2->token))
1508 static void parse_define_directive(void)
1516 assert(obstack_object_size(&pp_obstack) == 0);
1518 if (pp_token.kind != T_IDENTIFIER || info.at_line_begin) {
1519 errorf(&pp_token.base.source_position,
1520 "expected identifier after #define, got %K", &pp_token);
1523 symbol_t *const symbol = pp_token.base.symbol;
1525 pp_definition_t *new_definition
1526 = obstack_alloc(&pp_obstack, sizeof(new_definition[0]));
1527 memset(new_definition, 0, sizeof(new_definition[0]));
1528 new_definition->symbol = symbol;
1529 new_definition->source_position = input.position;
1531 /* this is probably the only place where spaces are significant in the
1532 * lexer (except for the fact that they separate tokens). #define b(x)
1533 * is something else than #define b (x) */
1534 if (input.c == '(') {
1535 eat_token(T_IDENTIFIER);
1539 switch (pp_token.kind) {
1541 new_definition->is_variadic = true;
1542 eat_token(T_DOTDOTDOT);
1543 if (pp_token.kind != ')') {
1544 errorf(&input.position,
1545 "'...' not at end of macro argument list");
1550 case T_IDENTIFIER: {
1551 pp_definition_t parameter;
1552 memset(¶meter, 0, sizeof(parameter));
1553 parameter.source_position = pp_token.base.source_position;
1554 parameter.symbol = pp_token.base.symbol;
1555 parameter.is_parameter = true;
1556 obstack_grow(&pp_obstack, ¶meter, sizeof(parameter));
1557 eat_token(T_IDENTIFIER);
1559 if (pp_token.kind == ',') {
1564 if (pp_token.kind != ')') {
1565 errorf(&pp_token.base.source_position,
1566 "expected ',' or ')' after identifier, got %K",
1575 goto finish_argument_list;
1578 errorf(&pp_token.base.source_position,
1579 "expected identifier, '...' or ')' in #define argument list, got %K",
1585 finish_argument_list:
1586 new_definition->has_parameters = true;
1587 size_t size = obstack_object_size(&pp_obstack);
1588 new_definition->n_parameters
1589 = size / sizeof(new_definition->parameters[0]);
1590 new_definition->parameters = obstack_finish(&pp_obstack);
1591 for (size_t i = 0; i < new_definition->n_parameters; ++i) {
1592 pp_definition_t *param = &new_definition->parameters[i];
1593 symbol_t *symbol = param->symbol;
1594 pp_definition_t *previous = symbol->pp_definition;
1595 if (previous != NULL
1596 && previous->function_definition == new_definition) {
1597 errorf(¶m->source_position,
1598 "duplicate macro parameter '%Y'", symbol);
1599 param->symbol = sym_anonymous;
1602 param->parent_expansion = previous;
1603 param->function_definition = new_definition;
1604 symbol->pp_definition = param;
1607 eat_token(T_IDENTIFIER);
1610 /* construct token list */
1611 assert(obstack_object_size(&pp_obstack) == 0);
1612 while (!info.at_line_begin) {
1613 if (pp_token.kind == T_IDENTIFIER) {
1614 const symbol_t *symbol = pp_token.base.symbol;
1615 pp_definition_t *definition = symbol->pp_definition;
1616 if (definition != NULL
1617 && definition->function_definition == new_definition) {
1618 pp_token.kind = T_MACRO_PARAMETER;
1619 pp_token.macro_parameter.def = definition;
1622 saved_token_t saved_token;
1623 saved_token.token = pp_token;
1624 saved_token.had_whitespace = info.had_whitespace;
1625 obstack_grow(&pp_obstack, &saved_token, sizeof(saved_token));
1629 new_definition->list_len = obstack_object_size(&pp_obstack)
1630 / sizeof(new_definition->token_list[0]);
1631 new_definition->token_list = obstack_finish(&pp_obstack);
1633 if (new_definition->has_parameters) {
1634 for (size_t i = 0; i < new_definition->n_parameters; ++i) {
1635 pp_definition_t *param = &new_definition->parameters[i];
1636 symbol_t *symbol = param->symbol;
1637 if (symbol == sym_anonymous)
1639 assert(symbol->pp_definition == param);
1640 assert(param->function_definition == new_definition);
1641 symbol->pp_definition = param->parent_expansion;
1642 param->parent_expansion = NULL;
1646 pp_definition_t *old_definition = symbol->pp_definition;
1647 if (old_definition != NULL) {
1648 if (!pp_definitions_equal(old_definition, new_definition)) {
1649 warningf(WARN_OTHER, &input.position, "multiple definition of macro '%Y' (first defined %P)", symbol, &old_definition->source_position);
1651 /* reuse the old definition */
1652 obstack_free(&pp_obstack, new_definition);
1653 new_definition = old_definition;
1657 symbol->pp_definition = new_definition;
1661 if (obstack_object_size(&pp_obstack) > 0) {
1662 char *ptr = obstack_finish(&pp_obstack);
1663 obstack_free(&pp_obstack, ptr);
1668 static void parse_undef_directive(void)
1676 if (pp_token.kind != T_IDENTIFIER) {
1677 errorf(&input.position,
1678 "expected identifier after #undef, got %K", &pp_token);
1683 pp_token.base.symbol->pp_definition = NULL;
1684 eat_token(T_IDENTIFIER);
1686 if (!info.at_line_begin) {
1687 warningf(WARN_OTHER, &input.position, "extra tokens at end of #undef directive");
1692 /** behind an #include we can have the special headername lexems.
1693 * They're only allowed behind an #include so they're not recognized
1694 * by the normal next_preprocessing_token. We handle them as a special
1696 static void parse_headername(void)
1698 const source_position_t start_position = input.position;
1699 string_t string = { NULL, 0, STRING_ENCODING_CHAR };
1700 assert(obstack_object_size(&symbol_obstack) == 0);
1702 if (info.at_line_begin) {
1703 parse_error("expected headername after #include");
1707 /* check wether we have a "... or <... headername */
1711 case '<': delimiter = '>'; goto parse_name;
1712 case '"': delimiter = '"'; goto parse_name;
1719 errorf(&pp_token.base.source_position, "header name without closing '%c'", (char)delimiter);
1723 if (input.c == delimiter) {
1725 goto finished_headername;
1727 obstack_1grow(&symbol_obstack, (char)input.c);
1733 /* we should never be here */
1737 /* TODO: do normal pp_token parsing and concatenate results */
1738 panic("pp_token concat include not implemented yet");
1741 finished_headername:
1742 string = sym_make_string(STRING_ENCODING_CHAR);
1745 pp_token.base.source_position = start_position;
1746 pp_token.kind = T_HEADERNAME;
1747 pp_token.literal.string = string;
1750 static bool do_include(bool system_include, const char *headername)
1752 size_t headername_len = strlen(headername);
1753 if (!system_include) {
1754 /* put dirname of current input on obstack */
1755 const char *filename = input.position.input_name;
1756 const char *last_slash = strrchr(filename, '/');
1757 if (last_slash != NULL) {
1758 size_t len = last_slash - filename;
1759 obstack_grow(&symbol_obstack, filename, len + 1);
1760 obstack_grow0(&symbol_obstack, headername, headername_len);
1761 char *complete_path = obstack_finish(&symbol_obstack);
1762 headername = identify_string(complete_path);
1765 FILE *file = fopen(headername, "r");
1767 switch_input(file, headername);
1772 assert(obstack_object_size(&symbol_obstack) == 0);
1773 /* check searchpath */
1774 for (searchpath_entry_t *entry = searchpath; entry != NULL;
1775 entry = entry->next) {
1776 const char *path = entry->path;
1777 size_t len = strlen(path);
1778 obstack_grow(&symbol_obstack, path, len);
1779 if (path[len-1] != '/')
1780 obstack_1grow(&symbol_obstack, '/');
1781 obstack_grow(&symbol_obstack, headername, headername_len+1);
1783 char *complete_path = obstack_finish(&symbol_obstack);
1784 FILE *file = fopen(complete_path, "r");
1786 const char *filename = identify_string(complete_path);
1787 switch_input(file, filename);
1790 obstack_free(&symbol_obstack, complete_path);
1797 static void parse_include_directive(void)
1804 /* don't eat the TP_include here!
1805 * we need an alternative parsing for the next token */
1806 skip_till_newline(true);
1807 bool system_include = input.c == '<';
1809 string_t headername = pp_token.literal.string;
1810 if (headername.begin == NULL) {
1815 bool had_nonwhitespace = skip_till_newline(false);
1816 if (had_nonwhitespace) {
1817 warningf(WARN_OTHER, &pp_token.base.source_position,
1818 "extra tokens at end of #include directive");
1821 if (n_inputs > INCLUDE_LIMIT) {
1822 errorf(&pp_token.base.source_position, "#include nested too deeply");
1829 info.whitespace_at_line_begin = 0;
1830 info.had_whitespace = false;
1831 info.at_line_begin = true;
1834 bool res = do_include(system_include, pp_token.literal.string.begin);
1838 errorf(&pp_token.base.source_position, "failed including '%S': %s", &pp_token.literal.string, strerror(errno));
1839 pop_restore_input();
1843 static pp_conditional_t *push_conditional(void)
1845 pp_conditional_t *conditional
1846 = obstack_alloc(&pp_obstack, sizeof(*conditional));
1847 memset(conditional, 0, sizeof(*conditional));
1849 conditional->parent = conditional_stack;
1850 conditional_stack = conditional;
1855 static void pop_conditional(void)
1857 assert(conditional_stack != NULL);
1858 conditional_stack = conditional_stack->parent;
1861 static void check_unclosed_conditionals(void)
1863 while (conditional_stack != NULL) {
1864 pp_conditional_t *conditional = conditional_stack;
1866 if (conditional->in_else) {
1867 errorf(&conditional->source_position, "unterminated #else");
1869 errorf(&conditional->source_position, "unterminated condition");
1875 static void parse_ifdef_ifndef_directive(bool const is_ifdef)
1878 eat_pp(is_ifdef ? TP_ifdef : TP_ifndef);
1882 pp_conditional_t *conditional = push_conditional();
1883 conditional->source_position = pp_token.base.source_position;
1884 conditional->skip = true;
1888 if (pp_token.kind != T_IDENTIFIER || info.at_line_begin) {
1889 errorf(&pp_token.base.source_position,
1890 "expected identifier after #%s, got %K",
1891 is_ifdef ? "ifdef" : "ifndef", &pp_token);
1894 /* just take the true case in the hope to avoid further errors */
1897 /* evaluate wether we are in true or false case */
1898 condition = (bool)pp_token.base.symbol->pp_definition == is_ifdef;
1899 eat_token(T_IDENTIFIER);
1901 if (!info.at_line_begin) {
1902 errorf(&pp_token.base.source_position,
1903 "extra tokens at end of #%s",
1904 is_ifdef ? "ifdef" : "ifndef");
1909 pp_conditional_t *conditional = push_conditional();
1910 conditional->source_position = pp_token.base.source_position;
1911 conditional->condition = condition;
1918 static void parse_else_directive(void)
1922 if (!info.at_line_begin) {
1924 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #else");
1929 pp_conditional_t *conditional = conditional_stack;
1930 if (conditional == NULL) {
1931 errorf(&pp_token.base.source_position, "#else without prior #if");
1935 if (conditional->in_else) {
1936 errorf(&pp_token.base.source_position,
1937 "#else after #else (condition started %P)",
1938 &conditional->source_position);
1943 conditional->in_else = true;
1944 if (!conditional->skip) {
1945 skip_mode = conditional->condition;
1947 conditional->source_position = pp_token.base.source_position;
1950 static void parse_endif_directive(void)
1954 if (!info.at_line_begin) {
1956 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #endif");
1961 pp_conditional_t *conditional = conditional_stack;
1962 if (conditional == NULL) {
1963 errorf(&pp_token.base.source_position, "#endif without prior #if");
1967 if (!conditional->skip) {
1973 typedef enum stdc_pragma_kind_t {
1977 STDC_CX_LIMITED_RANGE
1978 } stdc_pragma_kind_t;
1980 typedef enum stdc_pragma_value_kind_t {
1985 } stdc_pragma_value_kind_t;
1987 static void parse_pragma_directive(void)
1991 if (pp_token.kind != T_IDENTIFIER) {
1992 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
1993 "expected identifier after #pragma");
1998 stdc_pragma_kind_t kind = STDC_UNKNOWN;
1999 if (pp_token.base.symbol->pp_ID == TP_STDC && c_mode & _C99) {
2003 switch (pp_token.base.symbol->pp_ID) {
2004 case TP_FP_CONTRACT: kind = STDC_FP_CONTRACT; break;
2005 case TP_FENV_ACCESS: kind = STDC_FENV_ACCESS; break;
2006 case TP_CX_LIMITED_RANGE: kind = STDC_CX_LIMITED_RANGE; break;
2009 if (kind != STDC_UNKNOWN) {
2011 stdc_pragma_value_kind_t value;
2012 switch (pp_token.base.symbol->pp_ID) {
2013 case TP_ON: value = STDC_VALUE_ON; break;
2014 case TP_OFF: value = STDC_VALUE_OFF; break;
2015 case TP_DEFAULT: value = STDC_VALUE_DEFAULT; break;
2016 default: value = STDC_VALUE_UNKNOWN; break;
2018 if (value == STDC_VALUE_UNKNOWN) {
2019 kind = STDC_UNKNOWN;
2020 errorf(&pp_token.base.source_position, "bad STDC pragma argument");
2025 if (kind == STDC_UNKNOWN) {
2026 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
2027 "encountered unknown #pragma");
2031 static void parse_line_directive(void)
2033 if (pp_token.kind != T_NUMBER) {
2035 parse_error("expected integer");
2038 long const line = strtol(pp_token.literal.string.begin, &end, 0);
2040 /* use offset -1 as this is about the next line */
2041 input.position.lineno = line - 1;
2042 /* force output of line */
2043 input.output_line = input.position.lineno - 20;
2046 errorf(&input.position, "'%S' is not a valid line number",
2047 &pp_token.literal.string);
2052 if (pp_token.kind == T_STRING_LITERAL
2053 && pp_token.literal.string.encoding == STRING_ENCODING_CHAR) {
2054 input.position.input_name = pp_token.literal.string.begin;
2055 input.position.is_system_header = false;
2058 /* attempt to parse numeric flags as outputted by gcc preprocessor */
2059 while (pp_token.kind == T_NUMBER) {
2061 * 1 - indicates start of a new file
2062 * 2 - indicates return from a file
2063 * 3 - indicates system header
2064 * 4 - indicates implicit extern "C" in C++ mode
2066 * currently we're only interested in "3"
2068 if (streq(pp_token.literal.string.begin, "3")) {
2069 input.position.is_system_header = true;
2078 static void parse_preprocessing_directive(void)
2082 if (info.at_line_begin) {
2083 /* empty directive */
2087 if (pp_token.base.symbol) {
2088 switch (pp_token.base.symbol->pp_ID) {
2089 case TP_define: parse_define_directive(); break;
2090 case TP_else: parse_else_directive(); break;
2091 case TP_endif: parse_endif_directive(); break;
2092 case TP_ifdef: parse_ifdef_ifndef_directive(true); break;
2093 case TP_ifndef: parse_ifdef_ifndef_directive(false); break;
2094 case TP_include: parse_include_directive(); break;
2095 case TP_line: next_input_token(); goto line_directive;
2096 case TP_pragma: parse_pragma_directive(); break;
2097 case TP_undef: parse_undef_directive(); break;
2100 } else if (pp_token.kind == T_NUMBER) {
2102 parse_line_directive();
2106 errorf(&pp_token.base.source_position, "invalid preprocessing directive #%K", &pp_token);
2111 assert(info.at_line_begin);
2114 static void finish_current_argument(void)
2116 if (current_argument == NULL)
2118 size_t size = obstack_object_size(&pp_obstack);
2119 current_argument->list_len = size/sizeof(current_argument->token_list[0]);
2120 current_argument->token_list = obstack_finish(&pp_obstack);
2123 void next_preprocessing_token(void)
2126 if (!expand_next()) {
2129 while (pp_token.kind == '#' && info.at_line_begin) {
2130 parse_preprocessing_directive();
2132 } while (skip_mode && pp_token.kind != T_EOF);
2135 const token_kind_t kind = pp_token.kind;
2136 if (current_call == NULL || argument_expanding != NULL) {
2137 if (kind == T_IDENTIFIER) {
2138 symbol_t *const symbol = pp_token.base.symbol;
2139 pp_definition_t *const pp_definition = symbol->pp_definition;
2140 if (pp_definition != NULL && !pp_definition->is_expanding) {
2141 if (pp_definition->has_parameters) {
2143 /* check if next token is a '(' */
2144 whitespace_info_t old_info = info;
2145 token_kind_t next_token = peek_expansion();
2146 if (next_token == T_EOF) {
2147 info.at_line_begin = false;
2148 info.had_whitespace = false;
2150 if (input.c == '(') {
2155 if (next_token == '(') {
2156 if (current_expansion == NULL)
2157 expansion_pos = pp_token.base.source_position;
2158 next_preprocessing_token();
2159 assert(pp_token.kind == '(');
2161 pp_definition->parent_expansion = current_expansion;
2162 current_call = pp_definition;
2163 current_call->expand_pos = 0;
2164 current_call->expand_info = old_info;
2165 if (current_call->n_parameters > 0) {
2166 current_argument = ¤t_call->parameters[0];
2167 assert(argument_brace_count == 0);
2171 /* skip_whitespaces() skipped newlines and whitespace,
2172 * remember results for next token */
2178 if (current_expansion == NULL)
2179 expansion_pos = pp_token.base.source_position;
2180 start_expanding(pp_definition);
2184 } else if (kind == T_MACRO_PARAMETER) {
2185 assert(current_expansion != NULL);
2186 start_expanding(pp_token.macro_parameter.def);
2191 if (current_call != NULL) {
2192 /* current_call != NULL */
2194 ++argument_brace_count;
2195 } else if (kind == ')') {
2196 if (argument_brace_count > 0) {
2197 --argument_brace_count;
2199 finish_current_argument();
2200 assert(kind == ')');
2201 start_expanding(current_call);
2202 info = current_call->expand_info;
2203 current_call = NULL;
2204 current_argument = NULL;
2207 } else if (kind == ',' && argument_brace_count == 0) {
2208 finish_current_argument();
2209 current_call->expand_pos++;
2210 if (current_call->expand_pos >= current_call->n_parameters) {
2211 errorf(&pp_token.base.source_position,
2212 "too many arguments passed for macro '%Y'",
2213 current_call->symbol);
2214 current_argument = NULL;
2217 = ¤t_call->parameters[current_call->expand_pos];
2220 } else if (kind == T_MACRO_PARAMETER) {
2221 /* parameters have to be fully expanded before being used as
2222 * parameters for another macro-call */
2223 assert(current_expansion != NULL);
2224 pp_definition_t *argument = pp_token.macro_parameter.def;
2225 argument_expanding = argument;
2226 start_expanding(argument);
2228 } else if (kind == T_EOF) {
2229 errorf(&expansion_pos,
2230 "reached end of file while parsing arguments for '%Y'",
2231 current_call->symbol);
2234 if (current_argument != NULL) {
2235 saved_token_t saved;
2236 saved.token = pp_token;
2237 saved.had_whitespace = info.had_whitespace;
2238 obstack_grow(&pp_obstack, &saved, sizeof(saved));
2245 static void prepend_include_path(const char *path)
2247 searchpath_entry_t *entry = OALLOCZ(&config_obstack, searchpath_entry_t);
2249 entry->next = searchpath;
2253 static void setup_include_path(void)
2255 /* built-in paths */
2256 prepend_include_path("/usr/include");
2258 /* parse environment variable */
2259 const char *cpath = getenv("CPATH");
2260 if (cpath != NULL && *cpath != '\0') {
2261 const char *begin = cpath;
2265 while (*c != '\0' && *c != ':')
2268 size_t len = c-begin;
2270 /* for gcc compatibility (Matze: I would expect that
2271 * nothing happens for an empty entry...) */
2272 prepend_include_path(".");
2274 char *string = obstack_alloc(&config_obstack, len+1);
2275 memcpy(string, begin, len);
2278 prepend_include_path(string);
2285 } while(*c != '\0');
2289 void init_preprocessor(void)
2293 obstack_init(&config_obstack);
2294 obstack_init(&pp_obstack);
2295 obstack_init(&input_obstack);
2296 strset_init(&stringset);
2298 setup_include_path();
2301 void exit_preprocessor(void)
2303 obstack_free(&input_obstack, NULL);
2304 obstack_free(&pp_obstack, NULL);
2305 obstack_free(&config_obstack, NULL);
2307 strset_destroy(&stringset);
2310 int pptest_main(int argc, char **argv);
2311 int pptest_main(int argc, char **argv)
2313 init_symbol_table();
2314 init_preprocessor();
2317 error_on_unknown_chars = false;
2318 resolve_escape_sequences = false;
2320 /* simplistic commandline parser */
2321 const char *filename = NULL;
2322 const char *output = NULL;
2323 for (int i = 1; i < argc; ++i) {
2324 const char *opt = argv[i];
2325 if (streq(opt, "-I")) {
2326 prepend_include_path(argv[++i]);
2328 } else if (streq(opt, "-E")) {
2330 } else if (streq(opt, "-o")) {
2333 } else if (opt[0] == '-') {
2334 fprintf(stderr, "Unknown option '%s'\n", opt);
2336 if (filename != NULL)
2337 fprintf(stderr, "Multiple inputs not supported\n");
2341 if (filename == NULL) {
2342 fprintf(stderr, "No input specified\n");
2346 if (output == NULL) {
2349 out = fopen(output, "w");
2351 fprintf(stderr, "Couldn't open output '%s'\n", output);
2356 /* just here for gcc compatibility */
2357 fprintf(out, "# 1 \"%s\"\n", filename);
2358 fprintf(out, "# 1 \"<built-in>\"\n");
2359 fprintf(out, "# 1 \"<command-line>\"\n");
2361 FILE *file = fopen(filename, "r");
2363 fprintf(stderr, "Couldn't open input '%s'\n", filename);
2366 switch_input(file, filename);
2369 next_preprocessing_token();
2370 if (pp_token.kind == T_EOF)
2376 check_unclosed_conditionals();
2377 fclose(close_input());
2382 exit_preprocessor();
2383 exit_symbol_table();