12 #include "adt/error.h"
13 #include "adt/strutil.h"
14 #include "adt/strset.h"
15 #include "lang_features.h"
16 #include "diagnostic.h"
17 #include "string_rep.h"
21 #define INCLUDE_LIMIT 199 /* 199 is for gcc "compatibility" */
23 struct pp_argument_t {
28 struct pp_definition_t {
30 source_position_t source_position;
31 pp_definition_t *parent_expansion;
34 bool is_expanding : 1;
35 bool has_parameters : 1;
45 typedef struct pp_conditional_t pp_conditional_t;
46 struct pp_conditional_t {
47 source_position_t source_position;
50 bool skip; /**< conditional in skip mode (then+else gets skipped) */
51 pp_conditional_t *parent;
54 typedef struct pp_input_t pp_input_t;
59 utf32 buf[1024+MAX_PUTBACK];
62 source_position_t position;
67 /** additional info about the current token */
68 typedef struct add_token_info_t {
69 /** whitespace from beginning of line to the token */
71 /** there has been any whitespace before the token */
73 /** the token is at the beginning of the line */
77 typedef struct searchpath_entry_t searchpath_entry_t;
78 struct searchpath_entry_t {
80 searchpath_entry_t *next;
83 static pp_input_t input;
85 static pp_input_t *input_stack;
86 static unsigned n_inputs;
87 static struct obstack input_obstack;
89 static pp_conditional_t *conditional_stack;
91 static token_t pp_token;
92 static bool resolve_escape_sequences = false;
93 static bool ignore_unknown_chars = true;
94 static bool in_pp_directive;
95 static bool skip_mode;
97 static struct obstack pp_obstack;
98 static struct obstack config_obstack;
99 static const char *printed_input_name = NULL;
100 static source_position_t expansion_pos;
101 static pp_definition_t *current_expansion = NULL;
102 static strset_t stringset;
103 static preprocessor_token_kind_t last_token = TP_ERROR;
105 static searchpath_entry_t *searchpath;
107 static add_token_info_t info;
109 static inline void next_char(void);
110 static void next_preprocessing_token(void);
111 static void print_line_directive(const source_position_t *pos, const char *add);
113 static void switch_input(FILE *file, const char *filename)
116 input.input = input_from_stream(file, NULL);
119 input.output_line = 0;
120 input.position.input_name = filename;
121 input.position.lineno = 1;
123 /* indicate that we're at a new input */
124 print_line_directive(&input.position, input_stack != NULL ? "1" : NULL);
126 /* place a virtual '\n' so we realize we're at line begin */
127 input.position.lineno = 0;
129 next_preprocessing_token();
132 static void close_input(void)
134 input_free(input.input);
135 assert(input.file != NULL);
145 static void push_input(void)
147 pp_input_t *saved_input
148 = obstack_alloc(&input_obstack, sizeof(*saved_input));
150 memcpy(saved_input, &input, sizeof(*saved_input));
152 /* adjust buffer positions */
153 if (input.bufpos != NULL)
154 saved_input->bufpos = saved_input->buf + (input.bufpos - input.buf);
155 if (input.bufend != NULL)
156 saved_input->bufend = saved_input->buf + (input.bufend - input.buf);
158 saved_input->parent = input_stack;
159 input_stack = saved_input;
163 static void pop_restore_input(void)
165 assert(n_inputs > 0);
166 assert(input_stack != NULL);
168 pp_input_t *saved_input = input_stack;
170 memcpy(&input, saved_input, sizeof(input));
173 /* adjust buffer positions */
174 if (saved_input->bufpos != NULL)
175 input.bufpos = input.buf + (saved_input->bufpos - saved_input->buf);
176 if (saved_input->bufend != NULL)
177 input.bufend = input.buf + (saved_input->bufend - saved_input->buf);
179 input_stack = saved_input->parent;
180 obstack_free(&input_obstack, saved_input);
185 * Prints a parse error message at the current token.
187 * @param msg the error message
189 static void parse_error(const char *msg)
191 errorf(&pp_token.base.source_position, "%s", msg);
194 static inline void next_real_char(void)
196 assert(input.bufpos <= input.bufend);
197 if (input.bufpos >= input.bufend) {
198 size_t const n = decode(input.input, input.buf + MAX_PUTBACK, lengthof(input.buf) - MAX_PUTBACK);
203 input.bufpos = input.buf + MAX_PUTBACK;
204 input.bufend = input.bufpos + n;
206 input.c = *input.bufpos++;
207 ++input.position.colno;
211 * Put a character back into the buffer.
213 * @param pc the character to put back
215 static inline void put_back(utf32 const pc)
217 assert(input.bufpos > input.buf);
218 *(--input.bufpos - input.buf + input.buf) = (char) pc;
219 --input.position.colno;
222 #define MATCH_NEWLINE(code) \
225 if (input.c == '\n') { \
229 info.whitespace = 0; \
230 ++input.position.lineno; \
231 input.position.colno = 1; \
234 #define eat(c_type) (assert(input.c == c_type), next_char())
236 static void maybe_concat_lines(void)
254 * Set c to the next input character, ie.
255 * after expanding trigraphs.
257 static inline void next_char(void)
261 /* filter trigraphs and concatenated lines */
262 if (UNLIKELY(input.c == '\\')) {
263 maybe_concat_lines();
264 goto end_of_next_char;
267 if (LIKELY(input.c != '?'))
268 goto end_of_next_char;
271 if (LIKELY(input.c != '?')) {
274 goto end_of_next_char;
279 case '=': input.c = '#'; break;
280 case '(': input.c = '['; break;
281 case '/': input.c = '\\'; maybe_concat_lines(); break;
282 case ')': input.c = ']'; break;
283 case '\'': input.c = '^'; break;
284 case '<': input.c = '{'; break;
285 case '!': input.c = '|'; break;
286 case '>': input.c = '}'; break;
287 case '-': input.c = '~'; break;
297 printf("nchar '%c'\n", input.c);
304 * Returns true if the given char is a octal digit.
306 * @param char the character to check
308 static inline bool is_octal_digit(int chr)
326 * Returns the value of a digit.
327 * The only portable way to do it ...
329 static int digit_value(int digit)
355 panic("wrong character given");
360 * Parses an octal character sequence.
362 * @param first_digit the already read first digit
364 static utf32 parse_octal_sequence(const utf32 first_digit)
366 assert(is_octal_digit(first_digit));
367 utf32 value = digit_value(first_digit);
368 if (!is_octal_digit(input.c)) return value;
369 value = 8 * value + digit_value(input.c);
371 if (!is_octal_digit(input.c)) return value;
372 value = 8 * value + digit_value(input.c);
379 * Parses a hex character sequence.
381 static utf32 parse_hex_sequence(void)
384 while (isxdigit(input.c)) {
385 value = 16 * value + digit_value(input.c);
392 * Parse an escape sequence.
394 static utf32 parse_escape_sequence(void)
398 utf32 const ec = input.c;
402 case '"': return '"';
403 case '\'': return '\'';
404 case '\\': return '\\';
405 case '?': return '\?';
406 case 'a': return '\a';
407 case 'b': return '\b';
408 case 'f': return '\f';
409 case 'n': return '\n';
410 case 'r': return '\r';
411 case 't': return '\t';
412 case 'v': return '\v';
414 return parse_hex_sequence();
423 return parse_octal_sequence(ec);
425 parse_error("reached end of file while parsing escape sequence");
427 /* \E is not documented, but handled, by GCC. It is acceptable according
428 * to §6.11.4, whereas \e is not. */
432 return 27; /* hopefully 27 is ALWAYS the code for ESCAPE */
436 parse_error("universal character parsing not implemented yet");
441 /* §6.4.4.4:8 footnote 64 */
442 parse_error("unknown escape sequence");
446 static const char *identify_string(char *string)
448 const char *result = strset_insert(&stringset, string);
449 if (result != string) {
450 obstack_free(&symbol_obstack, string);
455 static string_t make_string(char *string, size_t len)
457 const char *result = identify_string(string);
458 return (string_t) {result, len};
461 static void parse_string_literal(void)
463 const unsigned start_linenr = input.position.lineno;
471 if (resolve_escape_sequences) {
472 tc = parse_escape_sequence();
473 obstack_1grow(&symbol_obstack, (char) tc);
475 obstack_1grow(&symbol_obstack, (char) input.c);
477 obstack_1grow(&symbol_obstack, (char) input.c);
484 source_position_t source_position;
485 source_position.input_name = pp_token.base.source_position.input_name;
486 source_position.lineno = start_linenr;
487 errorf(&source_position, "string has no end");
488 pp_token.kind = TP_ERROR;
497 obstack_grow_symbol(&symbol_obstack, input.c);
504 /* add finishing 0 to the string */
505 obstack_1grow(&symbol_obstack, '\0');
506 const size_t size = (size_t)obstack_object_size(&symbol_obstack);
507 char *const string = obstack_finish(&symbol_obstack);
509 pp_token.kind = TP_STRING_LITERAL;
510 pp_token.string.string = make_string(string, size);
514 * Parse a wide string literal and set lexer_token.
516 static void parse_wide_string_literal(void)
518 parse_string_literal();
519 if (pp_token.kind == TP_STRING_LITERAL)
520 pp_token.kind = TP_WIDE_STRING_LITERAL;
523 static void parse_wide_character_constant(void)
530 const utf32 tc = parse_escape_sequence();
531 obstack_grow_symbol(&symbol_obstack, tc);
536 parse_error("newline while parsing character constant");
542 goto end_of_wide_char_constant;
545 parse_error("EOF while parsing character constant");
546 pp_token.kind = TP_ERROR;
550 obstack_grow_symbol(&symbol_obstack, input.c);
556 end_of_wide_char_constant:
557 obstack_1grow(&symbol_obstack, '\0');
558 size_t size = (size_t) obstack_object_size(&symbol_obstack)-1;
559 char *string = obstack_finish(&symbol_obstack);
560 pp_token.kind = TP_WIDE_CHARACTER_CONSTANT;
561 pp_token.string.string = make_string(string, size);
564 parse_error("empty character constant");
568 static void parse_character_constant(void)
570 const unsigned start_linenr = input.position.lineno;
578 tc = parse_escape_sequence();
579 obstack_1grow(&symbol_obstack, (char) tc);
583 parse_error("newline while parsing character constant");
588 source_position_t source_position;
589 source_position.input_name = pp_token.base.source_position.input_name;
590 source_position.lineno = start_linenr;
591 errorf(&source_position, "EOF while parsing character constant");
592 pp_token.kind = TP_ERROR;
598 goto end_of_char_constant;
601 obstack_1grow(&symbol_obstack, (char) input.c);
608 end_of_char_constant:;
609 obstack_1grow(&symbol_obstack, '\0');
610 const size_t size = (size_t)obstack_object_size(&symbol_obstack);
611 char *const string = obstack_finish(&symbol_obstack);
613 pp_token.kind = TP_CHARACTER_CONSTANT;
614 pp_token.string.string = make_string(string, size);
617 parse_error("empty character constant");
621 #define SYMBOL_CHARS_WITHOUT_E_P \
672 #define SYMBOL_CHARS \
673 SYMBOL_CHARS_WITHOUT_E_P \
692 * returns next final token from a preprocessor macro expansion
694 static void expand_next(void)
696 assert(current_expansion != NULL);
698 pp_definition_t *definition = current_expansion;
701 if (definition->list_len == 0
702 || definition->expand_pos >= definition->list_len) {
703 /* we're finished with the current macro, move up 1 level in the
705 pp_definition_t *parent = definition->parent_expansion;
706 definition->parent_expansion = NULL;
707 definition->is_expanding = false;
709 /* it was the outermost expansion, parse normal pptoken */
710 if (parent == NULL) {
711 current_expansion = NULL;
712 next_preprocessing_token();
716 current_expansion = definition;
719 pp_token = definition->token_list[definition->expand_pos];
720 pp_token.base.source_position = expansion_pos;
721 ++definition->expand_pos;
723 if (pp_token.kind != TP_IDENTIFIER)
726 /* if it was an identifier then we might need to expand again */
727 pp_definition_t *symbol_definition = pp_token.identifier.symbol->pp_definition;
728 if (symbol_definition != NULL && !symbol_definition->is_expanding) {
729 symbol_definition->parent_expansion = definition;
730 symbol_definition->expand_pos = 0;
731 symbol_definition->is_expanding = true;
732 definition = symbol_definition;
733 current_expansion = definition;
738 static void skip_line_comment(void)
756 static void skip_multiline_comment(void)
758 unsigned start_linenr = input.position.lineno;
763 if (input.c == '*') {
764 /* TODO: nested comment, warn here */
769 if (input.c == '/') {
771 info.whitespace += input.position.colno-1;
777 info.at_line_begin |= !in_pp_directive;
782 source_position_t source_position;
783 source_position.input_name = pp_token.base.source_position.input_name;
784 source_position.lineno = start_linenr;
785 errorf(&source_position, "at end of file while looking for comment end");
796 static void skip_whitespace(void)
806 info.at_line_begin = true;
812 if (input.c == '/') {
816 } else if (input.c == '*') {
818 skip_multiline_comment();
831 static void eat_pp(int type)
834 assert(pp_token.kind == type);
835 next_preprocessing_token();
838 static void parse_symbol(void)
840 obstack_1grow(&symbol_obstack, (char) input.c);
847 obstack_1grow(&symbol_obstack, (char) input.c);
857 obstack_1grow(&symbol_obstack, '\0');
858 char *string = obstack_finish(&symbol_obstack);
860 /* might be a wide string or character constant ( L"string"/L'c' ) */
861 if (input.c == '"' && string[0] == 'L' && string[1] == '\0') {
862 obstack_free(&symbol_obstack, string);
863 parse_wide_string_literal();
865 } else if (input.c == '\'' && string[0] == 'L' && string[1] == '\0') {
866 obstack_free(&symbol_obstack, string);
867 parse_wide_character_constant();
871 symbol_t *symbol = symbol_table_insert(string);
873 pp_token.kind = symbol->pp_ID;
874 pp_token.identifier.symbol = symbol;
876 /* we can free the memory from symbol obstack if we already had an entry in
877 * the symbol table */
878 if (symbol->string != string) {
879 obstack_free(&symbol_obstack, string);
883 static void parse_number(void)
885 obstack_1grow(&symbol_obstack, (char) input.c);
892 SYMBOL_CHARS_WITHOUT_E_P
893 obstack_1grow(&symbol_obstack, (char) input.c);
901 obstack_1grow(&symbol_obstack, (char) input.c);
903 if (input.c == '+' || input.c == '-') {
904 obstack_1grow(&symbol_obstack, (char) input.c);
915 obstack_1grow(&symbol_obstack, '\0');
916 size_t size = obstack_object_size(&symbol_obstack);
917 char *string = obstack_finish(&symbol_obstack);
919 pp_token.kind = TP_NUMBER;
920 pp_token.number.number = make_string(string, size);
924 #define MAYBE_PROLOG \
929 #define MAYBE(ch, set_type) \
932 pp_token.kind = set_type; \
935 #define ELSE_CODE(code) \
942 #define ELSE(set_type) \
944 pp_token.kind = set_type; \
947 static void next_preprocessing_token(void)
949 if (current_expansion != NULL) {
954 info.at_line_begin = false;
955 info.had_whitespace = false;
957 pp_token.base.source_position = input.position;
962 info.had_whitespace = true;
967 info.at_line_begin = true;
968 info.had_whitespace = true;
981 parse_string_literal();
985 parse_character_constant();
1007 MAYBE('.', TP_DOTDOTDOT)
1011 pp_token.kind = '.';
1016 MAYBE('&', TP_ANDAND)
1017 MAYBE('=', TP_ANDEQUAL)
1021 MAYBE('=', TP_ASTERISKEQUAL)
1025 MAYBE('+', TP_PLUSPLUS)
1026 MAYBE('=', TP_PLUSEQUAL)
1030 MAYBE('>', TP_MINUSGREATER)
1031 MAYBE('-', TP_MINUSMINUS)
1032 MAYBE('=', TP_MINUSEQUAL)
1036 MAYBE('=', TP_EXCLAMATIONMARKEQUAL)
1040 MAYBE('=', TP_SLASHEQUAL)
1043 info.had_whitespace = true;
1044 skip_multiline_comment();
1048 info.had_whitespace = true;
1049 skip_line_comment();
1055 MAYBE('=', TP_PERCENTEQUAL)
1060 MAYBE(':', TP_HASHHASH)
1064 pp_token.kind = '#';
1072 MAYBE('=', TP_LESSEQUAL)
1075 MAYBE('=', TP_LESSLESSEQUAL)
1080 MAYBE('=', TP_GREATEREQUAL)
1083 MAYBE('=', TP_GREATERGREATEREQUAL)
1084 ELSE(TP_GREATERGREATER)
1088 MAYBE('=', TP_CARETEQUAL)
1092 MAYBE('=', TP_PIPEEQUAL)
1093 MAYBE('|', TP_PIPEPIPE)
1101 MAYBE('=', TP_EQUALEQUAL)
1105 MAYBE('#', TP_HASHHASH)
1107 pp_token.kind = '#';
1121 pp_token.kind = input.c;
1126 if (input_stack != NULL) {
1128 pop_restore_input();
1130 print_line_directive(&input.position, "2");
1133 pp_token.base.source_position.lineno++;
1134 info.at_line_begin = true;
1135 pp_token.kind = TP_EOF;
1141 if (!ignore_unknown_chars) {
1142 errorf(&pp_token.base.source_position,
1143 "unknown character '%c' found\n", input.c);
1144 pp_token.kind = TP_ERROR;
1146 pp_token.kind = input.c;
1152 static void print_quoted_string(const char *const string)
1155 for (const char *c = string; *c != 0; ++c) {
1157 case '"': fputs("\\\"", out); break;
1158 case '\\': fputs("\\\\", out); break;
1159 case '\a': fputs("\\a", out); break;
1160 case '\b': fputs("\\b", out); break;
1161 case '\f': fputs("\\f", out); break;
1162 case '\n': fputs("\\n", out); break;
1163 case '\r': fputs("\\r", out); break;
1164 case '\t': fputs("\\t", out); break;
1165 case '\v': fputs("\\v", out); break;
1166 case '\?': fputs("\\?", out); break;
1169 fprintf(out, "\\%03o", (unsigned)*c);
1179 static void print_line_directive(const source_position_t *pos, const char *add)
1181 fprintf(out, "# %u ", pos->lineno);
1182 print_quoted_string(pos->input_name);
1188 printed_input_name = pos->input_name;
1189 input.output_line = pos->lineno-1;
1192 static void emit_newlines(void)
1194 unsigned delta = pp_token.base.source_position.lineno - input.output_line;
1198 print_line_directive(&pp_token.base.source_position, NULL);
1201 for (unsigned i = 0; i < delta; ++i) {
1205 input.output_line = pp_token.base.source_position.lineno;
1208 static void emit_pp_token(void)
1213 if (info.at_line_begin) {
1216 for (unsigned i = 0; i < info.whitespace; ++i)
1219 } else if (info.had_whitespace ||
1220 tokens_would_paste(last_token, pp_token.kind)) {
1224 switch (pp_token.kind) {
1226 fputs(pp_token.identifier.symbol->string, out);
1229 fputs(pp_token.number.number.begin, out);
1231 case TP_WIDE_STRING_LITERAL:
1233 case TP_STRING_LITERAL:
1235 fputs(pp_token.string.string.begin, out);
1238 case TP_WIDE_CHARACTER_CONSTANT:
1240 case TP_CHARACTER_CONSTANT:
1242 fputs(pp_token.string.string.begin, out);
1246 print_pp_token_kind(out, pp_token.kind);
1249 last_token = pp_token.kind;
1252 static void eat_pp_directive(void)
1254 while (!info.at_line_begin) {
1255 next_preprocessing_token();
1259 static bool strings_equal(const string_t *string1, const string_t *string2)
1261 size_t size = string1->size;
1262 if (size != string2->size)
1265 const char *c1 = string1->begin;
1266 const char *c2 = string2->begin;
1267 for (size_t i = 0; i < size; ++i, ++c1, ++c2) {
1274 static bool pp_tokens_equal(const token_t *token1, const token_t *token2)
1276 if (token1->kind != token2->kind)
1279 switch (token1->kind) {
1281 return token1->identifier.symbol == token2->identifier.symbol;
1283 case TP_CHARACTER_CONSTANT:
1284 case TP_STRING_LITERAL:
1285 return strings_equal(&token1->string.string, &token2->string.string);
1292 static bool pp_definitions_equal(const pp_definition_t *definition1,
1293 const pp_definition_t *definition2)
1295 if (definition1->list_len != definition2->list_len)
1298 size_t len = definition1->list_len;
1299 const token_t *t1 = definition1->token_list;
1300 const token_t *t2 = definition2->token_list;
1301 for (size_t i = 0; i < len; ++i, ++t1, ++t2) {
1302 if (!pp_tokens_equal(t1, t2))
1308 static void parse_define_directive(void)
1311 assert(obstack_object_size(&pp_obstack) == 0);
1313 if (pp_token.kind != TP_IDENTIFIER || info.at_line_begin) {
1314 errorf(&pp_token.base.source_position,
1315 "expected identifier after #define, got '%t'", &pp_token);
1318 symbol_t *symbol = pp_token.identifier.symbol;
1320 pp_definition_t *new_definition
1321 = obstack_alloc(&pp_obstack, sizeof(new_definition[0]));
1322 memset(new_definition, 0, sizeof(new_definition[0]));
1323 new_definition->source_position = input.position;
1325 /* this is probably the only place where spaces are significant in the
1326 * lexer (except for the fact that they separate tokens). #define b(x)
1327 * is something else than #define b (x) */
1328 if (input.c == '(') {
1330 next_preprocessing_token();
1331 /* get next token after '(' */
1332 next_preprocessing_token();
1335 switch (pp_token.kind) {
1337 new_definition->is_variadic = true;
1338 next_preprocessing_token();
1339 if (pp_token.kind != ')') {
1340 errorf(&input.position,
1341 "'...' not at end of macro argument list");
1346 obstack_ptr_grow(&pp_obstack, pp_token.identifier.symbol);
1347 next_preprocessing_token();
1349 if (pp_token.kind == ',') {
1350 next_preprocessing_token();
1354 if (pp_token.kind != ')') {
1355 errorf(&pp_token.base.source_position,
1356 "expected ',' or ')' after identifier, got '%t'",
1362 next_preprocessing_token();
1363 goto finish_argument_list;
1365 errorf(&pp_token.base.source_position,
1366 "expected identifier, '...' or ')' in #define argument list, got '%t'",
1372 finish_argument_list:
1373 new_definition->has_parameters = true;
1374 new_definition->n_parameters
1375 = obstack_object_size(&pp_obstack) / sizeof(new_definition->parameters[0]);
1376 new_definition->parameters = obstack_finish(&pp_obstack);
1378 next_preprocessing_token();
1381 /* construct a new pp_definition on the obstack */
1382 assert(obstack_object_size(&pp_obstack) == 0);
1383 size_t list_len = 0;
1384 while (!info.at_line_begin) {
1385 obstack_grow(&pp_obstack, &pp_token, sizeof(pp_token));
1387 next_preprocessing_token();
1390 new_definition->list_len = list_len;
1391 new_definition->token_list = obstack_finish(&pp_obstack);
1393 pp_definition_t *old_definition = symbol->pp_definition;
1394 if (old_definition != NULL) {
1395 if (!pp_definitions_equal(old_definition, new_definition)) {
1396 warningf(WARN_OTHER, &input.position, "multiple definition of macro '%Y' (first defined %P)", symbol, &old_definition->source_position);
1398 /* reuse the old definition */
1399 obstack_free(&pp_obstack, new_definition);
1400 new_definition = old_definition;
1404 symbol->pp_definition = new_definition;
1408 if (obstack_object_size(&pp_obstack) > 0) {
1409 char *ptr = obstack_finish(&pp_obstack);
1410 obstack_free(&pp_obstack, ptr);
1415 static void parse_undef_directive(void)
1419 if (pp_token.kind != TP_IDENTIFIER) {
1420 errorf(&input.position,
1421 "expected identifier after #undef, got '%t'", &pp_token);
1426 symbol_t *symbol = pp_token.identifier.symbol;
1427 symbol->pp_definition = NULL;
1428 next_preprocessing_token();
1430 if (!info.at_line_begin) {
1431 warningf(WARN_OTHER, &input.position, "extra tokens at end of #undef directive");
1436 static const char *parse_headername(void)
1438 /* behind an #include we can have the special headername lexems.
1439 * They're only allowed behind an #include so they're not recognized
1440 * by the normal next_preprocessing_token. We handle them as a special
1442 if (info.at_line_begin) {
1443 parse_error("expected headername after #include");
1447 assert(obstack_object_size(&symbol_obstack) == 0);
1449 /* check wether we have a "... or <... headername */
1458 parse_error("header name without closing '>'");
1463 goto finished_headername;
1465 obstack_1grow(&symbol_obstack, (char) input.c);
1468 /* we should never be here */
1477 parse_error("header name without closing '>'");
1482 goto finished_headername;
1484 obstack_1grow(&symbol_obstack, (char) input.c);
1487 /* we should never be here */
1490 /* TODO: do normal pp_token parsing and concatenate results */
1491 panic("pp_token concat include not implemented yet");
1494 finished_headername:
1495 obstack_1grow(&symbol_obstack, '\0');
1496 char *headername = obstack_finish(&symbol_obstack);
1498 /* TODO: iterate search-path to find the file */
1502 return identify_string(headername);
1505 static bool do_include(bool system_include, const char *headername)
1507 if (!system_include) {
1508 /* for "bla" includes first try current dir
1509 * TODO: this isn't correct, should be the directory of the source file
1511 FILE *file = fopen(headername, "r");
1513 switch_input(file, headername);
1518 size_t headername_len = strlen(headername);
1519 assert(obstack_object_size(&pp_obstack) == 0);
1520 /* check searchpath */
1521 for (searchpath_entry_t *entry = searchpath; entry != NULL;
1522 entry = entry->next) {
1523 const char *path = entry->path;
1524 size_t len = strlen(path);
1525 obstack_grow(&pp_obstack, path, len);
1526 if (path[len-1] != '/')
1527 obstack_1grow(&pp_obstack, '/');
1528 obstack_grow(&pp_obstack, headername, headername_len+1);
1530 char *complete_path = obstack_finish(&pp_obstack);
1531 FILE *file = fopen(complete_path, "r");
1533 const char *filename = identify_string(complete_path);
1534 switch_input(file, filename);
1537 obstack_free(&pp_obstack, complete_path);
1543 static bool parse_include_directive(void)
1545 /* don't eat the TP_include here!
1546 * we need an alternative parsing for the next token */
1548 bool system_include = input.c == '<';
1549 const char *headername = parse_headername();
1550 if (headername == NULL) {
1555 if (!info.at_line_begin) {
1556 warningf(WARN_OTHER, &pp_token.base.source_position,
1557 "extra tokens at end of #include directive");
1561 if (n_inputs > INCLUDE_LIMIT) {
1562 errorf(&pp_token.base.source_position, "#include nested too deeply");
1564 next_preprocessing_token();
1568 /* we have to reenable space counting and macro expansion here,
1569 * because it is still disabled in directive parsing,
1570 * but we will trigger a preprocessing token reading of the new file
1571 * now and need expansions/space counting */
1572 in_pp_directive = false;
1577 bool res = do_include(system_include, headername);
1579 errorf(&pp_token.base.source_position,
1580 "failed including '%s': %s", headername, strerror(errno));
1581 pop_restore_input();
1588 static pp_conditional_t *push_conditional(void)
1590 pp_conditional_t *conditional
1591 = obstack_alloc(&pp_obstack, sizeof(*conditional));
1592 memset(conditional, 0, sizeof(*conditional));
1594 conditional->parent = conditional_stack;
1595 conditional_stack = conditional;
1600 static void pop_conditional(void)
1602 assert(conditional_stack != NULL);
1603 conditional_stack = conditional_stack->parent;
1606 static void check_unclosed_conditionals(void)
1608 while (conditional_stack != NULL) {
1609 pp_conditional_t *conditional = conditional_stack;
1611 if (conditional->in_else) {
1612 errorf(&conditional->source_position, "unterminated #else");
1614 errorf(&conditional->source_position, "unterminated condition");
1620 static void parse_ifdef_ifndef_directive(void)
1622 bool is_ifndef = (pp_token.kind == TP_ifndef);
1624 next_preprocessing_token();
1628 pp_conditional_t *conditional = push_conditional();
1629 conditional->source_position = pp_token.base.source_position;
1630 conditional->skip = true;
1634 if (pp_token.kind != TP_IDENTIFIER || info.at_line_begin) {
1635 errorf(&pp_token.base.source_position,
1636 "expected identifier after #%s, got '%t'",
1637 is_ifndef ? "ifndef" : "ifdef", &pp_token);
1640 /* just take the true case in the hope to avoid further errors */
1643 symbol_t *symbol = pp_token.identifier.symbol;
1644 pp_definition_t *pp_definition = symbol->pp_definition;
1645 next_preprocessing_token();
1647 if (!info.at_line_begin) {
1648 errorf(&pp_token.base.source_position,
1649 "extra tokens at end of #%s",
1650 is_ifndef ? "ifndef" : "ifdef");
1654 /* evaluate wether we are in true or false case */
1655 condition = is_ifndef ? pp_definition == NULL : pp_definition != NULL;
1658 pp_conditional_t *conditional = push_conditional();
1659 conditional->source_position = pp_token.base.source_position;
1660 conditional->condition = condition;
1667 static void parse_else_directive(void)
1671 if (!info.at_line_begin) {
1673 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #else");
1678 pp_conditional_t *conditional = conditional_stack;
1679 if (conditional == NULL) {
1680 errorf(&pp_token.base.source_position, "#else without prior #if");
1684 if (conditional->in_else) {
1685 errorf(&pp_token.base.source_position,
1686 "#else after #else (condition started %P)",
1687 conditional->source_position);
1692 conditional->in_else = true;
1693 if (!conditional->skip) {
1694 skip_mode = conditional->condition;
1696 conditional->source_position = pp_token.base.source_position;
1699 static void parse_endif_directive(void)
1703 if (!info.at_line_begin) {
1705 warningf(WARN_OTHER, &pp_token.base.source_position, "extra tokens at end of #endif");
1710 pp_conditional_t *conditional = conditional_stack;
1711 if (conditional == NULL) {
1712 errorf(&pp_token.base.source_position, "#endif without prior #if");
1716 if (!conditional->skip) {
1722 static void parse_preprocessing_directive(void)
1724 in_pp_directive = true;
1728 switch (pp_token.kind) {
1731 parse_ifdef_ifndef_directive();
1734 parse_else_directive();
1737 parse_endif_directive();
1744 switch (pp_token.kind) {
1746 parse_define_directive();
1749 parse_undef_directive();
1753 parse_ifdef_ifndef_directive();
1756 parse_else_directive();
1759 parse_endif_directive();
1762 parse_include_directive();
1765 if (info.at_line_begin) {
1766 /* the nop directive "#" */
1769 errorf(&pp_token.base.source_position,
1770 "invalid preprocessing directive #%t", &pp_token);
1776 in_pp_directive = false;
1777 assert(info.at_line_begin);
1780 static void prepend_include_path(const char *path)
1782 searchpath_entry_t *entry = OALLOCZ(&config_obstack, searchpath_entry_t);
1784 entry->next = searchpath;
1788 static void setup_include_path(void)
1790 /* built-in paths */
1791 prepend_include_path("/usr/include");
1793 /* parse environment variable */
1794 const char *cpath = getenv("CPATH");
1795 if (cpath != NULL && *cpath != '\0') {
1796 const char *begin = cpath;
1800 while (*c != '\0' && *c != ':')
1803 size_t len = c-begin;
1805 /* for gcc compatibility (Matze: I would expect that
1806 * nothing happens for an empty entry...) */
1807 prepend_include_path(".");
1809 char *string = obstack_alloc(&config_obstack, len+1);
1810 memcpy(string, begin, len);
1813 prepend_include_path(string);
1820 } while(*c != '\0');
1824 int pptest_main(int argc, char **argv);
1825 int pptest_main(int argc, char **argv)
1827 init_symbol_table();
1830 obstack_init(&config_obstack);
1831 obstack_init(&pp_obstack);
1832 obstack_init(&input_obstack);
1833 strset_init(&stringset);
1835 setup_include_path();
1837 /* simplistic commandline parser */
1838 const char *filename = NULL;
1839 for (int i = 1; i < argc; ++i) {
1840 const char *opt = argv[i];
1841 if (streq(opt, "-I")) {
1842 prepend_include_path(argv[++i]);
1844 } else if (streq(opt, "-E")) {
1846 } else if (opt[0] == '-') {
1847 fprintf(stderr, "Unknown option '%s'\n", opt);
1849 if (filename != NULL)
1850 fprintf(stderr, "Multiple inputs not supported\n");
1854 if (filename == NULL) {
1855 fprintf(stderr, "No input specified\n");
1861 /* just here for gcc compatibility */
1862 fprintf(out, "# 1 \"%s\"\n", filename);
1863 fprintf(out, "# 1 \"<built-in>\"\n");
1864 fprintf(out, "# 1 \"<command-line>\"\n");
1866 FILE *file = fopen(filename, "r");
1868 fprintf(stderr, "Couldn't open input '%s'\n", filename);
1871 switch_input(file, filename);
1874 if (pp_token.kind == '#' && info.at_line_begin) {
1875 parse_preprocessing_directive();
1877 } else if (pp_token.kind == TP_EOF) {
1878 goto end_of_main_loop;
1879 } else if (pp_token.kind == TP_IDENTIFIER && !in_pp_directive) {
1880 symbol_t *symbol = pp_token.identifier.symbol;
1881 pp_definition_t *pp_definition = symbol->pp_definition;
1882 if (pp_definition != NULL && !pp_definition->is_expanding) {
1883 expansion_pos = pp_token.base.source_position;
1884 if (pp_definition->has_parameters) {
1885 source_position_t position = pp_token.base.source_position;
1886 add_token_info_t old_info = info;
1887 next_preprocessing_token();
1888 add_token_info_t new_info = info;
1890 /* no opening brace -> no expansion */
1891 if (pp_token.kind == '(') {
1894 /* parse arguments (TODO) */
1895 while (pp_token.kind != TP_EOF && pp_token.kind != ')')
1896 next_preprocessing_token();
1898 token_t next_token = pp_token;
1899 /* restore identifier token */
1900 pp_token.kind = TP_IDENTIFIER;
1901 pp_token.identifier.symbol = symbol;
1902 pp_token.base.source_position = position;
1907 pp_token = next_token;
1912 pp_definition->expand_pos = 0;
1913 pp_definition->is_expanding = true;
1914 current_expansion = pp_definition;
1921 next_preprocessing_token();
1926 check_unclosed_conditionals();
1929 obstack_free(&input_obstack, NULL);
1930 obstack_free(&pp_obstack, NULL);
1931 obstack_free(&config_obstack, NULL);
1933 strset_destroy(&stringset);
1936 exit_symbol_table();