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;
79 searchpath_entry_t *path;
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_pp_input(FILE *const file, char const *const filename, searchpath_entry_t *const path)
142 input.input = input_from_stream(file, NULL);
145 input.output_line = 0;
146 input.position.input_name = filename;
147 input.position.lineno = 1;
150 /* indicate that we're at a new input */
151 print_line_directive(&input.position, input_stack != NULL ? "1" : NULL);
153 /* place a virtual '\n' so we realize we're at line begin */
154 input.position.lineno = 0;
158 FILE *close_pp_input(void)
160 input_free(input.input);
162 FILE* const file = input.file;
174 static void push_input(void)
176 pp_input_t *const saved_input = obstack_copy(&input_obstack, &input, sizeof(input));
178 /* adjust buffer positions */
179 if (input.bufpos != NULL)
180 saved_input->bufpos = saved_input->buf + (input.bufpos - input.buf);
181 if (input.bufend != NULL)
182 saved_input->bufend = saved_input->buf + (input.bufend - input.buf);
184 saved_input->parent = input_stack;
185 input_stack = saved_input;
189 static void pop_restore_input(void)
191 assert(n_inputs > 0);
192 assert(input_stack != NULL);
194 pp_input_t *saved_input = input_stack;
196 memcpy(&input, saved_input, sizeof(input));
199 /* adjust buffer positions */
200 if (saved_input->bufpos != NULL)
201 input.bufpos = input.buf + (saved_input->bufpos - saved_input->buf);
202 if (saved_input->bufend != NULL)
203 input.bufend = input.buf + (saved_input->bufend - saved_input->buf);
205 input_stack = saved_input->parent;
206 obstack_free(&input_obstack, saved_input);
211 * Prints a parse error message at the current token.
213 * @param msg the error message
215 static void parse_error(const char *msg)
217 errorf(&pp_token.base.source_position, "%s", msg);
220 static inline void next_real_char(void)
222 assert(input.bufpos <= input.bufend);
223 if (input.bufpos >= input.bufend) {
224 size_t const n = decode(input.input, input.buf + MAX_PUTBACK, lengthof(input.buf) - MAX_PUTBACK);
229 input.bufpos = input.buf + MAX_PUTBACK;
230 input.bufend = input.bufpos + n;
232 input.c = *input.bufpos++;
233 ++input.position.colno;
237 * Put a character back into the buffer.
239 * @param pc the character to put back
241 static inline void put_back(utf32 const pc)
243 assert(input.bufpos > input.buf);
244 *(--input.bufpos - input.buf + input.buf) = (char) pc;
245 --input.position.colno;
251 if (input.c == '\n') { \
255 ++input.position.lineno; \
256 input.position.colno = 1; \
258 newline // Let it look like an ordinary case label.
260 #define eat(c_type) (assert(input.c == c_type), next_char())
262 static void maybe_concat_lines(void)
268 info.whitespace_at_line_begin = 0;
280 * Set c to the next input character, ie.
281 * after expanding trigraphs.
283 static inline void next_char(void)
287 /* filter trigraphs and concatenated lines */
288 if (UNLIKELY(input.c == '\\')) {
289 maybe_concat_lines();
290 goto end_of_next_char;
293 if (LIKELY(input.c != '?'))
294 goto end_of_next_char;
297 if (LIKELY(input.c != '?')) {
300 goto end_of_next_char;
305 case '=': input.c = '#'; break;
306 case '(': input.c = '['; break;
307 case '/': input.c = '\\'; maybe_concat_lines(); break;
308 case ')': input.c = ']'; break;
309 case '\'': input.c = '^'; break;
310 case '<': input.c = '{'; break;
311 case '!': input.c = '|'; break;
312 case '>': input.c = '}'; break;
313 case '-': input.c = '~'; break;
323 printf("nchar '%c'\n", input.c);
330 * Returns true if the given char is a octal digit.
332 * @param char the character to check
334 static inline bool is_octal_digit(int chr)
352 * Returns the value of a digit.
353 * The only portable way to do it ...
355 static int digit_value(int digit)
381 panic("wrong character given");
386 * Parses an octal character sequence.
388 * @param first_digit the already read first digit
390 static utf32 parse_octal_sequence(const utf32 first_digit)
392 assert(is_octal_digit(first_digit));
393 utf32 value = digit_value(first_digit);
394 if (!is_octal_digit(input.c)) return value;
395 value = 8 * value + digit_value(input.c);
397 if (!is_octal_digit(input.c)) return value;
398 value = 8 * value + digit_value(input.c);
405 * Parses a hex character sequence.
407 static utf32 parse_hex_sequence(void)
410 while (isxdigit(input.c)) {
411 value = 16 * value + digit_value(input.c);
417 static bool is_universal_char_valid(utf32 const v)
420 if (v < 0xA0U && v != 0x24 && v != 0x40 && v != 0x60)
422 if (0xD800 <= v && v <= 0xDFFF)
427 static utf32 parse_universal_char(unsigned const n_digits)
430 for (unsigned k = n_digits; k != 0; --k) {
431 if (isxdigit(input.c)) {
432 v = 16 * v + digit_value(input.c);
433 if (!resolve_escape_sequences)
434 obstack_1grow(&symbol_obstack, input.c);
437 errorf(&input.position,
438 "short universal character name, expected %u more digits",
443 if (!is_universal_char_valid(v)) {
444 errorf(&input.position,
445 "\\%c%0*X is not a valid universal character name",
446 n_digits == 4 ? 'u' : 'U', (int)n_digits, v);
451 static bool is_universal_char_valid_identifier(utf32 const v)
454 if ( v == 0x000A8) return true;
455 if ( v == 0x000AA) return true;
456 if ( v == 0x000AD) return true;
457 if ( v == 0x000AF) return true;
458 if (0x000B2 <= v && v <= 0x000B5) return true;
459 if (0x000B7 <= v && v <= 0x000BA) return true;
460 if (0x000BC <= v && v <= 0x000BE) return true;
461 if (0x000C0 <= v && v <= 0x000D6) return true;
462 if (0x000D8 <= v && v <= 0x000F6) return true;
463 if (0x000F8 <= v && v <= 0x000FF) return true;
464 if (0x00100 <= v && v <= 0x0167F) return true;
465 if (0x01681 <= v && v <= 0x0180D) return true;
466 if (0x0180F <= v && v <= 0x01FFF) return true;
467 if (0x0200B <= v && v <= 0x0200D) return true;
468 if (0x0202A <= v && v <= 0x0202E) return true;
469 if (0x0203F <= v && v <= 0x02040) return true;
470 if ( v == 0x02054) return true;
471 if (0x02060 <= v && v <= 0x0206F) return true;
472 if (0x02070 <= v && v <= 0x0218F) return true;
473 if (0x02460 <= v && v <= 0x024FF) return true;
474 if (0x02776 <= v && v <= 0x02793) return true;
475 if (0x02C00 <= v && v <= 0x02DFF) return true;
476 if (0x02E80 <= v && v <= 0x02FFF) return true;
477 if (0x03004 <= v && v <= 0x03007) return true;
478 if (0x03021 <= v && v <= 0x0302F) return true;
479 if (0x03031 <= v && v <= 0x0303F) return true;
480 if (0x03040 <= v && v <= 0x0D7FF) return true;
481 if (0x0F900 <= v && v <= 0x0FD3D) return true;
482 if (0x0FD40 <= v && v <= 0x0FDCF) return true;
483 if (0x0FDF0 <= v && v <= 0x0FE44) return true;
484 if (0x0FE47 <= v && v <= 0x0FFFD) return true;
485 if (0x10000 <= v && v <= 0x1FFFD) return true;
486 if (0x20000 <= v && v <= 0x2FFFD) return true;
487 if (0x30000 <= v && v <= 0x3FFFD) return true;
488 if (0x40000 <= v && v <= 0x4FFFD) return true;
489 if (0x50000 <= v && v <= 0x5FFFD) return true;
490 if (0x60000 <= v && v <= 0x6FFFD) return true;
491 if (0x70000 <= v && v <= 0x7FFFD) return true;
492 if (0x80000 <= v && v <= 0x8FFFD) return true;
493 if (0x90000 <= v && v <= 0x9FFFD) return true;
494 if (0xA0000 <= v && v <= 0xAFFFD) return true;
495 if (0xB0000 <= v && v <= 0xBFFFD) return true;
496 if (0xC0000 <= v && v <= 0xCFFFD) return true;
497 if (0xD0000 <= v && v <= 0xDFFFD) return true;
498 if (0xE0000 <= v && v <= 0xEFFFD) return true;
502 static bool is_universal_char_valid_identifier_start(utf32 const v)
505 if (0x0300 <= v && v <= 0x036F) return false;
506 if (0x1DC0 <= v && v <= 0x1DFF) return false;
507 if (0x20D0 <= v && v <= 0x20FF) return false;
508 if (0xFE20 <= v && v <= 0xFE2F) return false;
513 * Parse an escape sequence.
515 static utf32 parse_escape_sequence(void)
519 utf32 const ec = input.c;
523 case '"': return '"';
524 case '\'': return '\'';
525 case '\\': return '\\';
526 case '?': return '\?';
527 case 'a': return '\a';
528 case 'b': return '\b';
529 case 'f': return '\f';
530 case 'n': return '\n';
531 case 'r': return '\r';
532 case 't': return '\t';
533 case 'v': return '\v';
535 return parse_hex_sequence();
544 return parse_octal_sequence(ec);
546 parse_error("reached end of file while parsing escape sequence");
548 /* \E is not documented, but handled, by GCC. It is acceptable according
549 * to §6.11.4, whereas \e is not. */
553 return 27; /* hopefully 27 is ALWAYS the code for ESCAPE */
556 case 'U': return parse_universal_char(8);
557 case 'u': return parse_universal_char(4);
562 /* §6.4.4.4:8 footnote 64 */
563 parse_error("unknown escape sequence");
567 static const char *identify_string(char *string)
569 const char *result = strset_insert(&stringset, string);
570 if (result != string) {
571 obstack_free(&symbol_obstack, string);
576 static string_t sym_make_string(string_encoding_t const enc)
578 obstack_1grow(&symbol_obstack, '\0');
579 size_t const len = obstack_object_size(&symbol_obstack) - 1;
580 char *const string = obstack_finish(&symbol_obstack);
581 char const *const result = identify_string(string);
582 return (string_t){ result, len, enc };
585 string_t make_string(char const *const string)
587 obstack_grow(&symbol_obstack, string, strlen(string));
588 return sym_make_string(STRING_ENCODING_CHAR);
591 static void parse_string(utf32 const delimiter, token_kind_t const kind,
592 string_encoding_t const enc,
593 char const *const context)
595 const unsigned start_linenr = input.position.lineno;
602 if (resolve_escape_sequences) {
603 utf32 const tc = parse_escape_sequence();
604 if (enc == STRING_ENCODING_CHAR) {
606 warningf(WARN_OTHER, &pp_token.base.source_position, "escape sequence out of range");
608 obstack_1grow(&symbol_obstack, tc);
610 obstack_grow_utf8(&symbol_obstack, tc);
613 obstack_1grow(&symbol_obstack, (char)input.c);
615 obstack_1grow(&symbol_obstack, (char)input.c);
622 errorf(&pp_token.base.source_position, "newline while parsing %s", context);
626 source_position_t source_position;
627 source_position.input_name = pp_token.base.source_position.input_name;
628 source_position.lineno = start_linenr;
629 errorf(&source_position, "EOF while parsing %s", context);
634 if (input.c == delimiter) {
638 obstack_grow_utf8(&symbol_obstack, input.c);
646 pp_token.kind = kind;
647 pp_token.literal.string = sym_make_string(enc);
650 static void parse_string_literal(string_encoding_t const enc)
652 parse_string('"', T_STRING_LITERAL, enc, "string literal");
655 static void parse_character_constant(string_encoding_t const enc)
657 parse_string('\'', T_CHARACTER_CONSTANT, enc, "character constant");
658 if (pp_token.literal.string.size == 0) {
659 parse_error("empty character constant");
663 #define SYMBOL_CASES_WITHOUT_E_P \
664 '$': if (!allow_dollar_in_symbol) goto dollar_sign; \
715 #define SYMBOL_CASES \
716 SYMBOL_CASES_WITHOUT_E_P: \
722 #define DIGIT_CASES \
734 static void start_expanding(pp_definition_t *definition)
736 definition->parent_expansion = current_expansion;
737 definition->expand_pos = 0;
738 definition->is_expanding = true;
739 if (definition->list_len > 0) {
740 definition->token_list[0].had_whitespace
741 = info.had_whitespace;
743 current_expansion = definition;
746 static void finished_expanding(pp_definition_t *definition)
748 assert(definition->is_expanding);
749 pp_definition_t *parent = definition->parent_expansion;
750 definition->parent_expansion = NULL;
751 definition->is_expanding = false;
753 /* stop further expanding once we expanded a parameter used in a
755 if (definition == argument_expanding)
756 argument_expanding = NULL;
758 assert(current_expansion == definition);
759 current_expansion = parent;
762 static void grow_string_escaped(struct obstack *obst, const string_t *string, char const *delimiter)
764 char const *prefix = get_string_encoding_prefix(string->encoding);
765 obstack_printf(obst, "%s%s", prefix, delimiter);
766 size_t size = string->size;
767 const char *str = string->begin;
768 if (resolve_escape_sequences) {
769 obstack_grow(obst, str, size);
771 for (size_t i = 0; i < size; ++i) {
772 const char c = str[i];
773 if (c == '\\' || c == '"')
774 obstack_1grow(obst, '\\');
775 obstack_1grow(obst, c);
778 obstack_printf(obst, "%s", delimiter);
781 static void grow_token(struct obstack *obst, const token_t *token)
783 switch (token->kind) {
785 obstack_grow(obst, token->literal.string.begin, token->literal.string.size);
788 case T_STRING_LITERAL: {
789 char const *const delimiter = resolve_escape_sequences ? "\"" : "\\\"";
790 grow_string_escaped(obst, &token->literal.string, delimiter);
794 case T_CHARACTER_CONSTANT:
795 grow_string_escaped(obst, &token->literal.string, "'");
800 const char *str = token->base.symbol->string;
801 size_t len = strlen(str);
802 obstack_grow(obst, str, len);
808 static void stringify(const pp_definition_t *definition)
810 assert(obstack_object_size(&symbol_obstack) == 0);
812 size_t list_len = definition->list_len;
813 for (size_t p = 0; p < list_len; ++p) {
814 const saved_token_t *saved = &definition->token_list[p];
815 if (p > 0 && saved->had_whitespace)
816 obstack_1grow(&symbol_obstack, ' ');
817 grow_token(&symbol_obstack, &saved->token);
819 pp_token.kind = T_STRING_LITERAL;
820 pp_token.literal.string = sym_make_string(STRING_ENCODING_CHAR);
823 static inline void set_punctuator(token_kind_t const kind)
825 pp_token.kind = kind;
826 pp_token.base.symbol = token_symbols[kind];
829 static inline void set_digraph(token_kind_t const kind, symbol_t *const symbol)
831 pp_token.kind = kind;
832 pp_token.base.symbol = symbol;
836 * returns next final token from a preprocessor macro expansion
838 static bool expand_next(void)
840 if (current_expansion == NULL)
844 size_t pos = current_expansion->expand_pos;
845 if (pos >= current_expansion->list_len) {
846 finished_expanding(current_expansion);
847 /* it was the outermost expansion, parse pptoken normally */
848 if (current_expansion == NULL) {
853 const saved_token_t *saved = ¤t_expansion->token_list[pos++];
854 pp_token = saved->token;
855 if (pp_token.kind == '#') {
856 if (pos < current_expansion->list_len) {
857 const saved_token_t *next = ¤t_expansion->token_list[pos];
858 if (next->token.kind == T_MACRO_PARAMETER) {
859 pp_definition_t *def = next->token.macro_parameter.def;
860 assert(def != NULL && def->is_parameter);
867 if (current_expansion->expand_pos > 0)
868 info.had_whitespace = saved->had_whitespace;
869 current_expansion->expand_pos = pos;
870 pp_token.base.source_position = expansion_pos;
876 * Returns the next token kind found when continuing the current expansions
877 * without starting new sub-expansions.
879 static token_kind_t peek_expansion(void)
881 for (pp_definition_t *e = current_expansion; e; e = e->parent_expansion) {
882 if (e->expand_pos < e->list_len)
883 return e->token_list[e->expand_pos].token.kind;
888 static void skip_line_comment(void)
890 info.had_whitespace = true;
907 static void skip_multiline_comment(void)
909 info.had_whitespace = true;
911 unsigned start_linenr = input.position.lineno;
916 if (input.c == '*') {
917 /* TODO: nested comment, warn here */
922 if (input.c == '/') {
923 if (input.position.lineno != input.output_line)
924 info.whitespace_at_line_begin = input.position.colno;
934 source_position_t source_position;
935 source_position.input_name = pp_token.base.source_position.input_name;
936 source_position.lineno = start_linenr;
937 errorf(&source_position, "at end of file while looking for comment end");
948 static bool skip_till_newline(bool stop_at_non_whitespace)
960 if (input.c == '/') {
964 } else if (input.c == '*') {
966 skip_multiline_comment();
978 if (stop_at_non_whitespace)
987 static void skip_whitespace(void)
993 ++info.whitespace_at_line_begin;
994 info.had_whitespace = true;
999 info.at_line_begin = true;
1000 info.had_whitespace = true;
1001 info.whitespace_at_line_begin = 0;
1006 if (input.c == '/') {
1008 skip_line_comment();
1010 } else if (input.c == '*') {
1012 skip_multiline_comment();
1026 static inline void eat_pp(pp_token_kind_t const kind)
1028 assert(pp_token.base.symbol->pp_ID == kind);
1033 static inline void eat_token(token_kind_t const kind)
1035 assert(pp_token.kind == kind);
1040 static void parse_symbol(void)
1042 assert(obstack_object_size(&symbol_obstack) == 0);
1047 obstack_1grow(&symbol_obstack, (char) input.c);
1056 case 'U': n = 8; goto universal;
1057 case 'u': n = 4; goto universal;
1059 if (!resolve_escape_sequences) {
1060 obstack_1grow(&symbol_obstack, '\\');
1061 obstack_1grow(&symbol_obstack, input.c);
1064 utf32 const v = parse_universal_char(n);
1065 if (!is_universal_char_valid_identifier(v)) {
1066 if (is_universal_char_valid(v)) {
1067 errorf(&input.position,
1068 "universal character \\%c%0*X is not valid in an identifier",
1069 n == 4 ? 'u' : 'U', (int)n, v);
1071 } else if (obstack_object_size(&symbol_obstack) == 0 && !is_universal_char_valid_identifier_start(v)) {
1072 errorf(&input.position,
1073 "universal character \\%c%0*X is not valid as start of an identifier",
1074 n == 4 ? 'u' : 'U', (int)n, v);
1075 } else if (resolve_escape_sequences) {
1076 obstack_grow_utf8(&symbol_obstack, v);
1094 obstack_1grow(&symbol_obstack, '\0');
1095 char *string = obstack_finish(&symbol_obstack);
1097 /* might be a wide string or character constant ( L"string"/L'c' ) */
1098 if (input.c == '"' && string[0] == 'L' && string[1] == '\0') {
1099 obstack_free(&symbol_obstack, string);
1100 parse_string_literal(STRING_ENCODING_WIDE);
1102 } else if (input.c == '\'' && string[0] == 'L' && string[1] == '\0') {
1103 obstack_free(&symbol_obstack, string);
1104 parse_character_constant(STRING_ENCODING_WIDE);
1108 symbol_t *symbol = symbol_table_insert(string);
1110 pp_token.kind = symbol->ID;
1111 pp_token.base.symbol = symbol;
1113 /* we can free the memory from symbol obstack if we already had an entry in
1114 * the symbol table */
1115 if (symbol->string != string) {
1116 obstack_free(&symbol_obstack, string);
1120 static void parse_number(void)
1122 obstack_1grow(&symbol_obstack, (char) input.c);
1129 case SYMBOL_CASES_WITHOUT_E_P:
1130 obstack_1grow(&symbol_obstack, (char) input.c);
1138 obstack_1grow(&symbol_obstack, (char) input.c);
1140 if (input.c == '+' || input.c == '-') {
1141 obstack_1grow(&symbol_obstack, (char) input.c);
1153 pp_token.kind = T_NUMBER;
1154 pp_token.literal.string = sym_make_string(STRING_ENCODING_CHAR);
1157 #define MAYBE_PROLOG \
1161 #define MAYBE(ch, kind) \
1164 set_punctuator(kind); \
1167 #define MAYBE_DIGRAPH(ch, kind, symbol) \
1170 set_digraph(kind, symbol); \
1173 #define ELSE_CODE(code) \
1178 #define ELSE(kind) ELSE_CODE(set_punctuator(kind); return;)
1180 /** identifies and returns the next preprocessing token contained in the
1181 * input stream. No macro expansion is performed. */
1182 static void next_input_token(void)
1184 if (next_info.had_whitespace) {
1186 next_info.had_whitespace = false;
1188 info.at_line_begin = false;
1189 info.had_whitespace = false;
1192 pp_token.base.source_position = input.position;
1193 pp_token.base.symbol = NULL;
1198 info.whitespace_at_line_begin++;
1199 info.had_whitespace = true;
1204 info.at_line_begin = true;
1205 info.had_whitespace = true;
1206 info.whitespace_at_line_begin = 0;
1218 parse_string_literal(STRING_ENCODING_CHAR);
1222 parse_character_constant(STRING_ENCODING_CHAR);
1244 MAYBE('.', T_DOTDOTDOT)
1248 set_punctuator('.');
1254 MAYBE('&', T_ANDAND)
1255 MAYBE('=', T_ANDEQUAL)
1259 MAYBE('=', T_ASTERISKEQUAL)
1263 MAYBE('+', T_PLUSPLUS)
1264 MAYBE('=', T_PLUSEQUAL)
1268 MAYBE('>', T_MINUSGREATER)
1269 MAYBE('-', T_MINUSMINUS)
1270 MAYBE('=', T_MINUSEQUAL)
1274 MAYBE('=', T_EXCLAMATIONMARKEQUAL)
1278 MAYBE('=', T_SLASHEQUAL)
1281 skip_multiline_comment();
1285 skip_line_comment();
1290 MAYBE_DIGRAPH('>', '}', symbol_percentgreater)
1291 MAYBE('=', T_PERCENTEQUAL)
1296 MAYBE_DIGRAPH(':', T_HASHHASH, symbol_percentcolonpercentcolon)
1300 goto digraph_percentcolon;
1303 digraph_percentcolon:
1304 set_digraph('#', symbol_percentcolon);
1310 MAYBE_DIGRAPH(':', '[', symbol_lesscolon)
1311 MAYBE_DIGRAPH('%', '{', symbol_lesspercent)
1312 MAYBE('=', T_LESSEQUAL)
1315 MAYBE('=', T_LESSLESSEQUAL)
1320 MAYBE('=', T_GREATEREQUAL)
1323 MAYBE('=', T_GREATERGREATEREQUAL)
1324 ELSE(T_GREATERGREATER)
1328 MAYBE('=', T_CARETEQUAL)
1332 MAYBE('=', T_PIPEEQUAL)
1333 MAYBE('|', T_PIPEPIPE)
1337 MAYBE_DIGRAPH('>', ']', symbol_colongreater)
1339 if (c_mode & _CXX) {
1341 set_punctuator(T_COLONCOLON);
1348 MAYBE('=', T_EQUALEQUAL)
1352 MAYBE('#', T_HASHHASH)
1365 set_punctuator(input.c);
1370 if (input_stack != NULL) {
1371 fclose(close_pp_input());
1372 pop_restore_input();
1374 if (input.c == (utf32)EOF)
1375 --input.position.lineno;
1376 print_line_directive(&input.position, "2");
1379 info.at_line_begin = true;
1380 set_punctuator(T_EOF);
1386 int next_c = input.c;
1389 if (next_c == 'U' || next_c == 'u') {
1396 if (error_on_unknown_chars) {
1397 errorf(&pp_token.base.source_position,
1398 "unknown character '%lc' found\n", input.c);
1402 assert(obstack_object_size(&symbol_obstack) == 0);
1403 obstack_grow_utf8(&symbol_obstack, input.c);
1404 obstack_1grow(&symbol_obstack, '\0');
1405 char *const string = obstack_finish(&symbol_obstack);
1406 symbol_t *const symbol = symbol_table_insert(string);
1407 if (symbol->string != string)
1408 obstack_free(&symbol_obstack, string);
1410 pp_token.kind = T_UNKNOWN_CHAR;
1411 pp_token.base.symbol = symbol;
1418 static void print_quoted_string(const char *const string)
1421 for (const char *c = string; *c != 0; ++c) {
1423 case '"': fputs("\\\"", out); break;
1424 case '\\': fputs("\\\\", out); break;
1425 case '\a': fputs("\\a", out); break;
1426 case '\b': fputs("\\b", out); break;
1427 case '\f': fputs("\\f", out); break;
1428 case '\n': fputs("\\n", out); break;
1429 case '\r': fputs("\\r", out); break;
1430 case '\t': fputs("\\t", out); break;
1431 case '\v': fputs("\\v", out); break;
1432 case '\?': fputs("\\?", out); break;
1435 fprintf(out, "\\%03o", (unsigned)*c);
1445 static void print_line_directive(const source_position_t *pos, const char *add)
1450 fprintf(out, "# %u ", pos->lineno);
1451 print_quoted_string(pos->input_name);
1456 if (pos->is_system_header) {
1460 printed_input_name = pos->input_name;
1461 input.output_line = pos->lineno-1;
1464 static bool emit_newlines(void)
1466 unsigned delta = pp_token.base.source_position.lineno - input.output_line;
1472 print_line_directive(&pp_token.base.source_position, NULL);
1475 for (unsigned i = 0; i < delta; ++i) {
1479 input.output_line = pp_token.base.source_position.lineno;
1481 for (unsigned i = 0; i < info.whitespace_at_line_begin; ++i)
1487 void set_preprocessor_output(FILE *output)
1491 error_on_unknown_chars = false;
1492 resolve_escape_sequences = false;
1494 error_on_unknown_chars = true;
1495 resolve_escape_sequences = true;
1499 void emit_pp_token(void)
1501 if (!emit_newlines() &&
1502 (info.had_whitespace || tokens_would_paste(last_token, pp_token.kind)))
1505 switch (pp_token.kind) {
1507 fputs(pp_token.literal.string.begin, out);
1510 case T_STRING_LITERAL:
1511 fputs(get_string_encoding_prefix(pp_token.literal.string.encoding), out);
1513 fputs(pp_token.literal.string.begin, out);
1517 case T_CHARACTER_CONSTANT:
1518 fputs(get_string_encoding_prefix(pp_token.literal.string.encoding), out);
1520 fputs(pp_token.literal.string.begin, out);
1524 case T_MACRO_PARAMETER:
1525 panic("macro parameter not expanded");
1528 fputs(pp_token.base.symbol->string, out);
1531 last_token = pp_token.kind;
1534 static void eat_pp_directive(void)
1536 while (!info.at_line_begin) {
1541 static bool strings_equal(const string_t *string1, const string_t *string2)
1543 size_t size = string1->size;
1544 if (size != string2->size)
1547 const char *c1 = string1->begin;
1548 const char *c2 = string2->begin;
1549 for (size_t i = 0; i < size; ++i, ++c1, ++c2) {
1556 static bool pp_tokens_equal(const token_t *token1, const token_t *token2)
1558 if (token1->kind != token2->kind)
1561 switch (token1->kind) {
1563 case T_CHARACTER_CONSTANT:
1564 case T_STRING_LITERAL:
1565 return strings_equal(&token1->literal.string, &token2->literal.string);
1567 case T_MACRO_PARAMETER:
1568 return token1->macro_parameter.def->symbol
1569 == token2->macro_parameter.def->symbol;
1572 return token1->base.symbol == token2->base.symbol;
1576 static bool pp_definitions_equal(const pp_definition_t *definition1,
1577 const pp_definition_t *definition2)
1579 if (definition1->list_len != definition2->list_len)
1582 size_t len = definition1->list_len;
1583 const saved_token_t *t1 = definition1->token_list;
1584 const saved_token_t *t2 = definition2->token_list;
1585 for (size_t i = 0; i < len; ++i, ++t1, ++t2) {
1586 if (!pp_tokens_equal(&t1->token, &t2->token))
1592 static void missing_macro_param_error(void)
1594 errorf(&pp_token.base.source_position,
1595 "'#' is not followed by a macro parameter");
1598 static bool is_defineable_token(char const *const context)
1600 if (info.at_line_begin) {
1601 errorf(&pp_token.base.source_position, "unexpected end of line after %s", context);
1604 symbol_t *const symbol = pp_token.base.symbol;
1608 if (pp_token.kind != T_IDENTIFIER) {
1609 switch (symbol->string[0]) {
1616 errorf(&pp_token.base.source_position, "expected identifier after %s, got %K", context, &pp_token);
1621 /* TODO turn this into a flag in pp_def. */
1622 switch (symbol->pp_ID) {
1625 errorf(&pp_token.base.source_position, "%K cannot be used as macro name in %s", &pp_token, context);
1633 static void parse_define_directive(void)
1641 assert(obstack_object_size(&pp_obstack) == 0);
1643 if (!is_defineable_token("#define"))
1645 symbol_t *const symbol = pp_token.base.symbol;
1647 pp_definition_t *new_definition
1648 = obstack_alloc(&pp_obstack, sizeof(new_definition[0]));
1649 memset(new_definition, 0, sizeof(new_definition[0]));
1650 new_definition->symbol = symbol;
1651 new_definition->source_position = input.position;
1653 /* this is probably the only place where spaces are significant in the
1654 * lexer (except for the fact that they separate tokens). #define b(x)
1655 * is something else than #define b (x) */
1656 if (input.c == '(') {
1661 switch (pp_token.kind) {
1663 new_definition->is_variadic = true;
1664 eat_token(T_DOTDOTDOT);
1665 if (pp_token.kind != ')') {
1666 errorf(&input.position,
1667 "'...' not at end of macro argument list");
1672 case T_IDENTIFIER: {
1673 pp_definition_t parameter;
1674 memset(¶meter, 0, sizeof(parameter));
1675 parameter.source_position = pp_token.base.source_position;
1676 parameter.symbol = pp_token.base.symbol;
1677 parameter.is_parameter = true;
1678 obstack_grow(&pp_obstack, ¶meter, sizeof(parameter));
1679 eat_token(T_IDENTIFIER);
1681 if (pp_token.kind == ',') {
1686 if (pp_token.kind != ')') {
1687 errorf(&pp_token.base.source_position,
1688 "expected ',' or ')' after identifier, got %K",
1697 goto finish_argument_list;
1700 errorf(&pp_token.base.source_position,
1701 "expected identifier, '...' or ')' in #define argument list, got %K",
1707 finish_argument_list:
1708 new_definition->has_parameters = true;
1709 size_t size = obstack_object_size(&pp_obstack);
1710 new_definition->n_parameters
1711 = size / sizeof(new_definition->parameters[0]);
1712 new_definition->parameters = obstack_finish(&pp_obstack);
1713 for (size_t i = 0; i < new_definition->n_parameters; ++i) {
1714 pp_definition_t *param = &new_definition->parameters[i];
1715 symbol_t *symbol = param->symbol;
1716 pp_definition_t *previous = symbol->pp_definition;
1717 if (previous != NULL
1718 && previous->function_definition == new_definition) {
1719 errorf(¶m->source_position,
1720 "duplicate macro parameter '%Y'", symbol);
1721 param->symbol = sym_anonymous;
1724 param->parent_expansion = previous;
1725 param->function_definition = new_definition;
1726 symbol->pp_definition = param;
1732 /* construct token list */
1733 assert(obstack_object_size(&pp_obstack) == 0);
1734 bool next_must_be_param = false;
1735 while (!info.at_line_begin) {
1736 if (pp_token.kind == T_IDENTIFIER) {
1737 const symbol_t *symbol = pp_token.base.symbol;
1738 pp_definition_t *definition = symbol->pp_definition;
1739 if (definition != NULL
1740 && definition->function_definition == new_definition) {
1741 pp_token.kind = T_MACRO_PARAMETER;
1742 pp_token.macro_parameter.def = definition;
1745 if (next_must_be_param && pp_token.kind != T_MACRO_PARAMETER) {
1746 missing_macro_param_error();
1748 saved_token_t saved_token;
1749 saved_token.token = pp_token;
1750 saved_token.had_whitespace = info.had_whitespace;
1751 obstack_grow(&pp_obstack, &saved_token, sizeof(saved_token));
1753 = new_definition->has_parameters && pp_token.kind == '#';
1756 if (next_must_be_param)
1757 missing_macro_param_error();
1759 new_definition->list_len = obstack_object_size(&pp_obstack)
1760 / sizeof(new_definition->token_list[0]);
1761 new_definition->token_list = obstack_finish(&pp_obstack);
1763 if (new_definition->has_parameters) {
1764 for (size_t i = 0; i < new_definition->n_parameters; ++i) {
1765 pp_definition_t *param = &new_definition->parameters[i];
1766 symbol_t *symbol = param->symbol;
1767 if (symbol == sym_anonymous)
1769 assert(symbol->pp_definition == param);
1770 assert(param->function_definition == new_definition);
1771 symbol->pp_definition = param->parent_expansion;
1772 param->parent_expansion = NULL;
1776 pp_definition_t *old_definition = symbol->pp_definition;
1777 if (old_definition != NULL) {
1778 if (!pp_definitions_equal(old_definition, new_definition)) {
1779 warningf(WARN_OTHER, &input.position, "multiple definition of macro '%Y' (first defined %P)", symbol, &old_definition->source_position);
1781 /* reuse the old definition */
1782 obstack_free(&pp_obstack, new_definition);
1783 new_definition = old_definition;
1787 symbol->pp_definition = new_definition;
1791 if (obstack_object_size(&pp_obstack) > 0) {
1792 char *ptr = obstack_finish(&pp_obstack);
1793 obstack_free(&pp_obstack, ptr);
1798 static void parse_undef_directive(void)
1806 if (!is_defineable_token("#undef")) {
1811 pp_token.base.symbol->pp_definition = NULL;
1814 if (!info.at_line_begin) {
1815 warningf(WARN_OTHER, &input.position, "extra tokens at end of #undef directive");
1820 /** behind an #include we can have the special headername lexems.
1821 * They're only allowed behind an #include so they're not recognized
1822 * by the normal next_preprocessing_token. We handle them as a special
1824 static void parse_headername(void)
1826 const source_position_t start_position = input.position;
1827 string_t string = { NULL, 0, STRING_ENCODING_CHAR };
1828 assert(obstack_object_size(&symbol_obstack) == 0);
1830 if (info.at_line_begin) {
1831 parse_error("expected headername after #include");
1835 /* check wether we have a "... or <... headername */
1839 case '<': delimiter = '>'; goto parse_name;
1840 case '"': delimiter = '"'; goto parse_name;
1847 errorf(&pp_token.base.source_position, "header name without closing '%c'", (char)delimiter);
1851 if (input.c == delimiter) {
1853 goto finished_headername;
1855 obstack_1grow(&symbol_obstack, (char)input.c);
1861 /* we should never be here */
1865 /* TODO: do normal pp_token parsing and concatenate results */
1866 panic("pp_token concat include not implemented yet");
1869 finished_headername:
1870 string = sym_make_string(STRING_ENCODING_CHAR);
1873 pp_token.base.source_position = start_position;
1874 pp_token.kind = T_HEADERNAME;
1875 pp_token.literal.string = string;
1878 static bool do_include(bool const system_include, bool const include_next, char const *const headername)
1880 size_t const headername_len = strlen(headername);
1881 searchpath_entry_t *entry;
1883 entry = input.path ? input.path->next : searchpath;
1885 if (!system_include) {
1886 /* put dirname of current input on obstack */
1887 const char *filename = input.position.input_name;
1888 const char *last_slash = strrchr(filename, '/');
1889 const char *full_name;
1890 if (last_slash != NULL) {
1891 size_t len = last_slash - filename;
1892 obstack_grow(&symbol_obstack, filename, len + 1);
1893 obstack_grow0(&symbol_obstack, headername, headername_len);
1894 char *complete_path = obstack_finish(&symbol_obstack);
1895 full_name = identify_string(complete_path);
1897 full_name = headername;
1900 FILE *file = fopen(full_name, "r");
1902 switch_pp_input(file, full_name, NULL);
1910 assert(obstack_object_size(&symbol_obstack) == 0);
1911 /* check searchpath */
1912 for (; entry; entry = entry->next) {
1913 const char *path = entry->path;
1914 size_t len = strlen(path);
1915 obstack_grow(&symbol_obstack, path, len);
1916 if (path[len-1] != '/')
1917 obstack_1grow(&symbol_obstack, '/');
1918 obstack_grow(&symbol_obstack, headername, headername_len+1);
1920 char *complete_path = obstack_finish(&symbol_obstack);
1921 FILE *file = fopen(complete_path, "r");
1923 const char *filename = identify_string(complete_path);
1924 switch_pp_input(file, filename, entry);
1927 obstack_free(&symbol_obstack, complete_path);
1934 static void parse_include_directive(bool const include_next)
1941 /* don't eat the TP_include here!
1942 * we need an alternative parsing for the next token */
1943 skip_till_newline(true);
1944 bool system_include = input.c == '<';
1946 string_t headername = pp_token.literal.string;
1947 if (headername.begin == NULL) {
1952 bool had_nonwhitespace = skip_till_newline(false);
1953 if (had_nonwhitespace) {
1954 warningf(WARN_OTHER, &pp_token.base.source_position,
1955 "extra tokens at end of #include directive");
1958 if (n_inputs > INCLUDE_LIMIT) {
1959 errorf(&pp_token.base.source_position, "#include nested too deeply");
1966 info.whitespace_at_line_begin = 0;
1967 info.had_whitespace = false;
1968 info.at_line_begin = true;
1971 bool res = do_include(system_include, include_next, pp_token.literal.string.begin);
1975 errorf(&pp_token.base.source_position, "failed including '%S': %s", &pp_token.literal.string, strerror(errno));
1976 pop_restore_input();
1980 static pp_conditional_t *push_conditional(void)
1982 pp_conditional_t *conditional
1983 = obstack_alloc(&pp_obstack, sizeof(*conditional));
1984 memset(conditional, 0, sizeof(*conditional));
1986 conditional->parent = conditional_stack;
1987 conditional_stack = conditional;
1992 static void pop_conditional(void)
1994 assert(conditional_stack != NULL);
1995 conditional_stack = conditional_stack->parent;
1998 void check_unclosed_conditionals(void)
2000 while (conditional_stack != NULL) {
2001 pp_conditional_t *conditional = conditional_stack;
2003 if (conditional->in_else) {
2004 errorf(&conditional->source_position, "unterminated #else");
2006 errorf(&conditional->source_position, "unterminated condition");
2012 static void parse_ifdef_ifndef_directive(bool const is_ifdef)
2015 eat_pp(is_ifdef ? TP_ifdef : TP_ifndef);
2019 pp_conditional_t *conditional = push_conditional();
2020 conditional->source_position = pp_token.base.source_position;
2021 conditional->skip = true;
2025 if (pp_token.kind != T_IDENTIFIER || info.at_line_begin) {
2026 errorf(&pp_token.base.source_position,
2027 "expected identifier after #%s, got %K",
2028 is_ifdef ? "ifdef" : "ifndef", &pp_token);
2031 /* just take the true case in the hope to avoid further errors */
2034 /* evaluate wether we are in true or false case */
2035 condition = (bool)pp_token.base.symbol->pp_definition == is_ifdef;
2036 eat_token(T_IDENTIFIER);
2038 if (!info.at_line_begin) {
2039 errorf(&pp_token.base.source_position,
2040 "extra tokens at end of #%s",
2041 is_ifdef ? "ifdef" : "ifndef");
2046 pp_conditional_t *conditional = push_conditional();
2047 conditional->source_position = pp_token.base.source_position;
2048 conditional->condition = condition;
2055 static void parse_else_directive(void)
2059 if (!info.at_line_begin) {
2061 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #else");
2066 pp_conditional_t *conditional = conditional_stack;
2067 if (conditional == NULL) {
2068 errorf(&pp_token.base.source_position, "#else without prior #if");
2072 if (conditional->in_else) {
2073 errorf(&pp_token.base.source_position,
2074 "#else after #else (condition started %P)",
2075 &conditional->source_position);
2080 conditional->in_else = true;
2081 if (!conditional->skip) {
2082 skip_mode = conditional->condition;
2084 conditional->source_position = pp_token.base.source_position;
2087 static void parse_endif_directive(void)
2091 if (!info.at_line_begin) {
2093 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #endif");
2098 pp_conditional_t *conditional = conditional_stack;
2099 if (conditional == NULL) {
2100 errorf(&pp_token.base.source_position, "#endif without prior #if");
2104 if (!conditional->skip) {
2110 typedef enum stdc_pragma_kind_t {
2114 STDC_CX_LIMITED_RANGE
2115 } stdc_pragma_kind_t;
2117 typedef enum stdc_pragma_value_kind_t {
2122 } stdc_pragma_value_kind_t;
2124 static void parse_pragma_directive(void)
2132 if (pp_token.kind != T_IDENTIFIER) {
2133 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
2134 "expected identifier after #pragma");
2139 stdc_pragma_kind_t kind = STDC_UNKNOWN;
2140 if (pp_token.base.symbol->pp_ID == TP_STDC && c_mode & _C99) {
2144 switch (pp_token.base.symbol->pp_ID) {
2145 case TP_FP_CONTRACT: kind = STDC_FP_CONTRACT; break;
2146 case TP_FENV_ACCESS: kind = STDC_FENV_ACCESS; break;
2147 case TP_CX_LIMITED_RANGE: kind = STDC_CX_LIMITED_RANGE; break;
2150 if (kind != STDC_UNKNOWN) {
2152 stdc_pragma_value_kind_t value;
2153 switch (pp_token.base.symbol->pp_ID) {
2154 case TP_ON: value = STDC_VALUE_ON; break;
2155 case TP_OFF: value = STDC_VALUE_OFF; break;
2156 case TP_DEFAULT: value = STDC_VALUE_DEFAULT; break;
2157 default: value = STDC_VALUE_UNKNOWN; break;
2159 if (value == STDC_VALUE_UNKNOWN) {
2160 kind = STDC_UNKNOWN;
2161 errorf(&pp_token.base.source_position, "bad STDC pragma argument");
2166 if (kind == STDC_UNKNOWN) {
2167 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
2168 "encountered unknown #pragma");
2172 static void parse_line_directive(void)
2174 if (pp_token.kind != T_NUMBER) {
2176 parse_error("expected integer");
2179 long const line = strtol(pp_token.literal.string.begin, &end, 0);
2181 /* use offset -1 as this is about the next line */
2182 input.position.lineno = line - 1;
2183 /* force output of line */
2184 input.output_line = input.position.lineno - 20;
2187 errorf(&input.position, "'%S' is not a valid line number",
2188 &pp_token.literal.string);
2192 if (info.at_line_begin)
2195 if (pp_token.kind == T_STRING_LITERAL
2196 && pp_token.literal.string.encoding == STRING_ENCODING_CHAR) {
2197 input.position.input_name = pp_token.literal.string.begin;
2198 input.position.is_system_header = false;
2201 /* attempt to parse numeric flags as outputted by gcc preprocessor */
2202 while (!info.at_line_begin && pp_token.kind == T_NUMBER) {
2204 * 1 - indicates start of a new file
2205 * 2 - indicates return from a file
2206 * 3 - indicates system header
2207 * 4 - indicates implicit extern "C" in C++ mode
2209 * currently we're only interested in "3"
2211 if (streq(pp_token.literal.string.begin, "3")) {
2212 input.position.is_system_header = true;
2221 static void parse_error_directive(void)
2228 bool const old_resolve_escape_sequences = resolve_escape_sequences;
2229 resolve_escape_sequences = false;
2231 source_position_t const pos = pp_token.base.source_position;
2233 if (info.had_whitespace && obstack_object_size(&pp_obstack) != 0)
2234 obstack_1grow(&pp_obstack, ' ');
2236 switch (pp_token.kind) {
2238 string_t const *const str = &pp_token.literal.string;
2239 obstack_grow(&pp_obstack, str->begin, str->size);
2245 case T_STRING_LITERAL: delim = '"'; goto string;
2246 case T_CHARACTER_CONSTANT: delim = '\''; goto string;
2248 string_t const *const str = &pp_token.literal.string;
2249 char const *const enc = get_string_encoding_prefix(str->encoding);
2250 obstack_printf(&pp_obstack, "%s%c%s%c", enc, delim, str->begin, delim);
2255 char const *const str = pp_token.base.symbol->string;
2256 obstack_grow(&pp_obstack, str, strlen(str));
2262 } while (!info.at_line_begin);
2264 resolve_escape_sequences = old_resolve_escape_sequences;
2266 obstack_1grow(&pp_obstack, '\0');
2267 char *const str = obstack_finish(&pp_obstack);
2268 errorf(&pos, "#%s", str);
2269 obstack_free(&pp_obstack, str);
2272 static void parse_preprocessing_directive(void)
2276 if (info.at_line_begin) {
2277 /* empty directive */
2281 if (pp_token.base.symbol) {
2282 switch (pp_token.base.symbol->pp_ID) {
2283 case TP_define: parse_define_directive(); break;
2284 case TP_else: parse_else_directive(); break;
2285 case TP_endif: parse_endif_directive(); break;
2286 case TP_error: parse_error_directive(); break;
2287 case TP_ifdef: parse_ifdef_ifndef_directive(true); break;
2288 case TP_ifndef: parse_ifdef_ifndef_directive(false); break;
2289 case TP_include: parse_include_directive(false); break;
2290 case TP_include_next: parse_include_directive(true); break;
2291 case TP_line: next_input_token(); goto line_directive;
2292 case TP_pragma: parse_pragma_directive(); break;
2293 case TP_undef: parse_undef_directive(); break;
2296 } else if (pp_token.kind == T_NUMBER) {
2298 parse_line_directive();
2302 errorf(&pp_token.base.source_position, "invalid preprocessing directive #%K", &pp_token);
2307 assert(info.at_line_begin);
2310 static void finish_current_argument(void)
2312 if (current_argument == NULL)
2314 size_t size = obstack_object_size(&pp_obstack);
2315 current_argument->list_len = size/sizeof(current_argument->token_list[0]);
2316 current_argument->token_list = obstack_finish(&pp_obstack);
2319 void next_preprocessing_token(void)
2322 if (!expand_next()) {
2325 while (pp_token.kind == '#' && info.at_line_begin) {
2326 parse_preprocessing_directive();
2328 } while (skip_mode && pp_token.kind != T_EOF);
2331 const token_kind_t kind = pp_token.kind;
2332 if (current_call == NULL || argument_expanding != NULL) {
2333 symbol_t *const symbol = pp_token.base.symbol;
2335 if (kind == T_MACRO_PARAMETER) {
2336 assert(current_expansion != NULL);
2337 start_expanding(pp_token.macro_parameter.def);
2341 pp_definition_t *const pp_definition = symbol->pp_definition;
2342 if (pp_definition != NULL && !pp_definition->is_expanding) {
2343 if (pp_definition->has_parameters) {
2345 /* check if next token is a '(' */
2346 whitespace_info_t old_info = info;
2347 token_kind_t next_token = peek_expansion();
2348 if (next_token == T_EOF) {
2349 info.at_line_begin = false;
2350 info.had_whitespace = false;
2352 if (input.c == '(') {
2357 if (next_token == '(') {
2358 if (current_expansion == NULL)
2359 expansion_pos = pp_token.base.source_position;
2360 next_preprocessing_token();
2361 assert(pp_token.kind == '(');
2363 pp_definition->parent_expansion = current_expansion;
2364 current_call = pp_definition;
2365 current_call->expand_pos = 0;
2366 current_call->expand_info = old_info;
2367 if (current_call->n_parameters > 0) {
2368 current_argument = ¤t_call->parameters[0];
2369 assert(argument_brace_count == 0);
2373 /* skip_whitespaces() skipped newlines and whitespace,
2374 * remember results for next token */
2380 if (current_expansion == NULL)
2381 expansion_pos = pp_token.base.source_position;
2382 start_expanding(pp_definition);
2389 if (current_call != NULL) {
2390 /* current_call != NULL */
2392 ++argument_brace_count;
2393 } else if (kind == ')') {
2394 if (argument_brace_count > 0) {
2395 --argument_brace_count;
2397 finish_current_argument();
2398 assert(kind == ')');
2399 start_expanding(current_call);
2400 info = current_call->expand_info;
2401 current_call = NULL;
2402 current_argument = NULL;
2405 } else if (kind == ',' && argument_brace_count == 0) {
2406 finish_current_argument();
2407 current_call->expand_pos++;
2408 if (current_call->expand_pos >= current_call->n_parameters) {
2409 errorf(&pp_token.base.source_position,
2410 "too many arguments passed for macro '%Y'",
2411 current_call->symbol);
2412 current_argument = NULL;
2415 = ¤t_call->parameters[current_call->expand_pos];
2418 } else if (kind == T_MACRO_PARAMETER) {
2419 /* parameters have to be fully expanded before being used as
2420 * parameters for another macro-call */
2421 assert(current_expansion != NULL);
2422 pp_definition_t *argument = pp_token.macro_parameter.def;
2423 argument_expanding = argument;
2424 start_expanding(argument);
2426 } else if (kind == T_EOF) {
2427 errorf(&expansion_pos,
2428 "reached end of file while parsing arguments for '%Y'",
2429 current_call->symbol);
2432 if (current_argument != NULL) {
2433 saved_token_t saved;
2434 saved.token = pp_token;
2435 saved.had_whitespace = info.had_whitespace;
2436 obstack_grow(&pp_obstack, &saved, sizeof(saved));
2443 static void prepend_include_path(const char *path)
2445 searchpath_entry_t *entry = OALLOCZ(&config_obstack, searchpath_entry_t);
2447 entry->next = searchpath;
2451 static void setup_include_path(void)
2453 /* built-in paths */
2454 prepend_include_path("/usr/include");
2456 /* parse environment variable */
2457 const char *cpath = getenv("CPATH");
2458 if (cpath != NULL && *cpath != '\0') {
2459 const char *begin = cpath;
2463 while (*c != '\0' && *c != ':')
2466 size_t len = c-begin;
2468 /* for gcc compatibility (Matze: I would expect that
2469 * nothing happens for an empty entry...) */
2470 prepend_include_path(".");
2472 char *const string = obstack_copy0(&config_obstack, begin, len);
2473 prepend_include_path(string);
2480 } while(*c != '\0');
2484 static void input_error(unsigned const delta_lines, unsigned const delta_cols, char const *const message)
2486 source_position_t pos = pp_token.base.source_position;
2487 pos.lineno += delta_lines;
2488 pos.colno += delta_cols;
2489 errorf(&pos, "%s", message);
2492 void init_preprocessor(void)
2496 obstack_init(&config_obstack);
2497 obstack_init(&pp_obstack);
2498 obstack_init(&input_obstack);
2499 strset_init(&stringset);
2501 setup_include_path();
2503 set_input_error_callback(input_error);
2506 void exit_preprocessor(void)
2508 obstack_free(&input_obstack, NULL);
2509 obstack_free(&pp_obstack, NULL);
2510 obstack_free(&config_obstack, NULL);
2512 strset_destroy(&stringset);
2515 int pptest_main(int argc, char **argv);
2516 int pptest_main(int argc, char **argv)
2518 init_symbol_table();
2519 init_preprocessor();
2522 error_on_unknown_chars = false;
2523 resolve_escape_sequences = false;
2525 /* simplistic commandline parser */
2526 const char *filename = NULL;
2527 const char *output = NULL;
2528 for (int i = 1; i < argc; ++i) {
2529 const char *opt = argv[i];
2530 if (streq(opt, "-I")) {
2531 prepend_include_path(argv[++i]);
2533 } else if (streq(opt, "-E")) {
2535 } else if (streq(opt, "-o")) {
2538 } else if (opt[0] == '-') {
2539 fprintf(stderr, "Unknown option '%s'\n", opt);
2541 if (filename != NULL)
2542 fprintf(stderr, "Multiple inputs not supported\n");
2546 if (filename == NULL) {
2547 fprintf(stderr, "No input specified\n");
2551 if (output == NULL) {
2554 out = fopen(output, "w");
2556 fprintf(stderr, "Couldn't open output '%s'\n", output);
2561 /* just here for gcc compatibility */
2562 fprintf(out, "# 1 \"%s\"\n", filename);
2563 fprintf(out, "# 1 \"<built-in>\"\n");
2564 fprintf(out, "# 1 \"<command-line>\"\n");
2566 FILE *file = fopen(filename, "r");
2568 fprintf(stderr, "Couldn't open input '%s'\n", filename);
2571 switch_pp_input(file, filename, NULL);
2574 next_preprocessing_token();
2575 if (pp_token.kind == T_EOF)
2581 check_unclosed_conditionals();
2582 fclose(close_pp_input());
2587 exit_preprocessor();
2588 exit_symbol_table();