nsz Git - cparser/blob - lexer.c

   1 /*
   2  * This file is part of cparser.
   3  * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
   4  *
   5  * This program is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU General Public License
   7  * as published by the Free Software Foundation; either version 2
   8  * of the License, or (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  18  * 02111-1307, USA.
  19  */
  20 #include <config.h>
  21
  22 #include "adt/strutil.h"
  23 #include "input.h"
  24 #include "diagnostic.h"
  25 #include "lexer.h"
  26 #include "symbol_t.h"
  27 #include "token_t.h"
  28 #include "symbol_table_t.h"
  29 #include "adt/error.h"
  30 #include "adt/strset.h"
  31 #include "adt/util.h"
  32 #include "types.h"
  33 #include "type_t.h"
  34 #include "parser.h"
  35 #include "warning.h"
  36 #include "lang_features.h"
  37
  38 #include <assert.h>
  39 #include <errno.h>
  40 #include <string.h>
  41 #include <stdbool.h>
  42 #include <ctype.h>
  43
  44 #ifndef _WIN32
  45 #include <strings.h>
  46 #endif
  47
  48 #define MAX_PUTBACK 16    // 3 would be enough, but 16 gives a nicer alignment
  49 #define BUF_SIZE    1024
  50
  51 static input_t           *input;
  52 static utf32              input_buf[BUF_SIZE + MAX_PUTBACK];
  53 static const utf32       *bufpos;
  54 static const utf32       *bufend;
  55 static utf32              c;
  56 static source_position_t  lexer_pos;
  57 token_t                   lexer_token;
  58 static symbol_t          *symbol_L;
  59 static strset_t           stringset;
  60 bool                      allow_dollar_in_symbol = true;
  61
  62 /**
  63  * Prints a parse error message at the current token.
  64  *
  65  * @param msg   the error message
  66  */
  67 static void parse_error(const char *msg)
  68 {
  69         errorf(&lexer_pos, "%s", msg);
  70 }
  71
  72 /**
  73  * Prints an internal error message at the current token.
  74  *
  75  * @param msg   the error message
  76  */
  77 static NORETURN internal_error(const char *msg)
  78 {
  79         internal_errorf(&lexer_pos, "%s", msg);
  80 }
  81
  82 static inline void next_real_char(void)
  83 {
  84         assert(bufpos <= bufend);
  85         if (bufpos >= bufend) {
  86                 size_t n = decode(input, input_buf+MAX_PUTBACK, BUF_SIZE);
  87                 if (n == 0) {
  88                         c = EOF;
  89                         return;
  90                 }
  91                 bufpos = input_buf + MAX_PUTBACK;
  92                 bufend = bufpos + n;
  93         }
  94         c = *bufpos++;
  95         ++lexer_pos.colno;
  96 }
  97
  98 /**
  99  * Put a character back into the buffer.
 100  *
 101  * @param pc  the character to put back
 102  */
 103 static inline void put_back(utf32 const pc)
 104 {
 105         *(--bufpos - input_buf + input_buf) = pc;
 106         --lexer_pos.colno;
 107 }
 108
 109 static inline void next_char(void);
 110
 111 #define MATCH_NEWLINE(code)  \
 112         case '\r':               \
 113                 next_char();         \
 114                 if (c == '\n') {     \
 115         case '\n':               \
 116                         next_char();     \
 117                 }                    \
 118                 lexer_pos.lineno++;  \
 119                 lexer_pos.colno = 1; \
 120                 code
 121
 122 #define eat(c_type) (assert(c == c_type), next_char())
 123
 124 static void maybe_concat_lines(void)
 125 {
 126         eat('\\');
 127
 128         switch (c) {
 129         MATCH_NEWLINE(return;)
 130
 131         default:
 132                 break;
 133         }
 134
 135         put_back(c);
 136         c = '\\';
 137 }
 138
 139 /**
 140  * Set c to the next input character, ie.
 141  * after expanding trigraphs.
 142  */
 143 static inline void next_char(void)
 144 {
 145         next_real_char();
 146
 147         /* filter trigraphs */
 148         if (UNLIKELY(c == '\\')) {
 149                 maybe_concat_lines();
 150                 return;
 151         }
 152
 153         if (LIKELY(c != '?'))
 154                 return;
 155
 156         next_real_char();
 157         if (LIKELY(c != '?')) {
 158                 put_back(c);
 159                 c = '?';
 160                 return;
 161         }
 162
 163         next_real_char();
 164         switch (c) {
 165         case '=': c = '#'; break;
 166         case '(': c = '['; break;
 167         case '/': c = '\\'; maybe_concat_lines(); break;
 168         case ')': c = ']'; break;
 169         case '\'': c = '^'; break;
 170         case '<': c = '{'; break;
 171         case '!': c = '|'; break;
 172         case '>': c = '}'; break;
 173         case '-': c = '~'; break;
 174         default:
 175                 put_back(c);
 176                 put_back('?');
 177                 c = '?';
 178                 break;
 179         }
 180 }
 181
 182 #define SYMBOL_CHARS  \
 183         case '$': if (!allow_dollar_in_symbol) goto dollar_sign; \
 184         case 'a':         \
 185         case 'b':         \
 186         case 'c':         \
 187         case 'd':         \
 188         case 'e':         \
 189         case 'f':         \
 190         case 'g':         \
 191         case 'h':         \
 192         case 'i':         \
 193         case 'j':         \
 194         case 'k':         \
 195         case 'l':         \
 196         case 'm':         \
 197         case 'n':         \
 198         case 'o':         \
 199         case 'p':         \
 200         case 'q':         \
 201         case 'r':         \
 202         case 's':         \
 203         case 't':         \
 204         case 'u':         \
 205         case 'v':         \
 206         case 'w':         \
 207         case 'x':         \
 208         case 'y':         \
 209         case 'z':         \
 210         case 'A':         \
 211         case 'B':         \
 212         case 'C':         \
 213         case 'D':         \
 214         case 'E':         \
 215         case 'F':         \
 216         case 'G':         \
 217         case 'H':         \
 218         case 'I':         \
 219         case 'J':         \
 220         case 'K':         \
 221         case 'L':         \
 222         case 'M':         \
 223         case 'N':         \
 224         case 'O':         \
 225         case 'P':         \
 226         case 'Q':         \
 227         case 'R':         \
 228         case 'S':         \
 229         case 'T':         \
 230         case 'U':         \
 231         case 'V':         \
 232         case 'W':         \
 233         case 'X':         \
 234         case 'Y':         \
 235         case 'Z':         \
 236         case '_':
 237
 238 #define DIGITS        \
 239         case '0':         \
 240         case '1':         \
 241         case '2':         \
 242         case '3':         \
 243         case '4':         \
 244         case '5':         \
 245         case '6':         \
 246         case '7':         \
 247         case '8':         \
 248         case '9':
 249
 250 /**
 251  * Read a symbol from the input and build
 252  * the lexer_token.
 253  */
 254 static void parse_symbol(void)
 255 {
 256         obstack_1grow(&symbol_obstack, (char) c);
 257         next_char();
 258
 259         while (true) {
 260                 switch (c) {
 261                 DIGITS
 262                 SYMBOL_CHARS
 263                         obstack_1grow(&symbol_obstack, (char) c);
 264                         next_char();
 265                         break;
 266
 267                 default:
 268 dollar_sign:
 269                         goto end_symbol;
 270                 }
 271         }
 272
 273 end_symbol:
 274         obstack_1grow(&symbol_obstack, '\0');
 275
 276         char     *string = obstack_finish(&symbol_obstack);
 277         symbol_t *symbol = symbol_table_insert(string);
 278
 279         lexer_token.kind        = symbol->ID;
 280         lexer_token.base.symbol = symbol;
 281
 282         if (symbol->string != string) {
 283                 obstack_free(&symbol_obstack, string);
 284         }
 285 }
 286
 287 static string_t identify_string(char *string, size_t len)
 288 {
 289         /* TODO hash */
 290 #if 0
 291         const char *result = strset_insert(&stringset, concat);
 292         if (result != concat) {
 293                 obstack_free(&symbol_obstack, concat);
 294         }
 295 #else
 296         const char *result = string;
 297 #endif
 298         return (string_t) {result, len};
 299 }
 300
 301 /**
 302  * parse suffixes like 'LU' or 'f' after numbers
 303  */
 304 static void parse_number_suffix(void)
 305 {
 306         assert(obstack_object_size(&symbol_obstack) == 0);
 307         while (true) {
 308                 switch (c) {
 309                 SYMBOL_CHARS
 310                         obstack_1grow(&symbol_obstack, (char) c);
 311                         next_char();
 312                         break;
 313                 default:
 314                 dollar_sign:
 315                         goto finish_suffix;
 316                 }
 317         }
 318 finish_suffix:
 319         if (obstack_object_size(&symbol_obstack) == 0) {
 320                 lexer_token.number.suffix.begin = NULL;
 321                 lexer_token.number.suffix.size  = 0;
 322                 return;
 323         }
 324
 325         obstack_1grow(&symbol_obstack, '\0');
 326         size_t size   = obstack_object_size(&symbol_obstack) - 1;
 327         char  *string = obstack_finish(&symbol_obstack);
 328
 329         lexer_token.number.suffix = identify_string(string, size);
 330 }
 331
 332 static void parse_exponent(void)
 333 {
 334         if (c == '-' || c == '+') {
 335                 obstack_1grow(&symbol_obstack, (char)c);
 336                 next_char();
 337         }
 338
 339         if (isdigit(c)) {
 340                 do {
 341                         obstack_1grow(&symbol_obstack, (char)c);
 342                         next_char();
 343                 } while (isdigit(c));
 344         } else {
 345                 errorf(&lexer_token.base.source_position, "exponent has no digits");
 346         }
 347 }
 348
 349 /**
 350  * Parses a hex number including hex floats and set the
 351  * lexer_token.
 352  */
 353 static void parse_number_hex(void)
 354 {
 355         bool is_float   = false;
 356         bool has_digits = false;
 357
 358         while (isxdigit(c)) {
 359                 has_digits = true;
 360                 obstack_1grow(&symbol_obstack, (char) c);
 361                 next_char();
 362         }
 363
 364         if (c == '.') {
 365                 is_float = true;
 366                 obstack_1grow(&symbol_obstack, (char) c);
 367                 next_char();
 368
 369                 while (isxdigit(c)) {
 370                         has_digits = true;
 371                         obstack_1grow(&symbol_obstack, (char) c);
 372                         next_char();
 373                 }
 374         }
 375         if (c == 'p' || c == 'P') {
 376                 is_float = true;
 377                 obstack_1grow(&symbol_obstack, (char) c);
 378                 next_char();
 379                 parse_exponent();
 380         } else if (is_float) {
 381                 errorf(&lexer_token.base.source_position,
 382                        "hexadecimal floatingpoint constant requires an exponent");
 383         }
 384         obstack_1grow(&symbol_obstack, '\0');
 385
 386         size_t  size   = obstack_object_size(&symbol_obstack) - 1;
 387         char   *string = obstack_finish(&symbol_obstack);
 388         lexer_token.number.number = identify_string(string, size);
 389
 390         lexer_token.kind = is_float ? T_FLOATINGPOINT : T_INTEGER;
 391
 392         if (!has_digits) {
 393                 errorf(&lexer_token.base.source_position, "invalid number literal '%S'", &lexer_token.number.number);
 394                 lexer_token.number.number.begin = "0";
 395                 lexer_token.number.number.size  = 1;
 396         }
 397
 398         parse_number_suffix();
 399 }
 400
 401 static void parse_number_bin(void)
 402 {
 403         bool has_digits = false;
 404
 405         while (c == '0' || c == '1') {
 406                 has_digits = true;
 407                 obstack_1grow(&symbol_obstack, (char)c);
 408                 next_char();
 409         }
 410         obstack_1grow(&symbol_obstack, '\0');
 411
 412         size_t  const size   = obstack_object_size(&symbol_obstack) - 1;
 413         char   *const string = obstack_finish(&symbol_obstack);
 414         lexer_token.number.number = identify_string(string, size);
 415         lexer_token.kind          = T_INTEGER;
 416
 417         if (!has_digits) {
 418                 errorf(&lexer_token.base.source_position, "invalid number literal '%S'", &lexer_token.number.number);
 419                 lexer_token.number.number.begin = "0";
 420                 lexer_token.number.number.size  = 1;
 421         }
 422
 423         parse_number_suffix();
 424 }
 425
 426 /**
 427  * Returns true if the given char is a octal digit.
 428  *
 429  * @param char  the character to check
 430  */
 431 static bool is_octal_digit(utf32 chr)
 432 {
 433         return '0' <= chr && chr <= '7';
 434 }
 435
 436 /**
 437  * Parses a number and sets the lexer_token.
 438  */
 439 static void parse_number(void)
 440 {
 441         bool is_float   = false;
 442         bool has_digits = false;
 443
 444         assert(obstack_object_size(&symbol_obstack) == 0);
 445         if (c == '0') {
 446                 obstack_1grow(&symbol_obstack, (char)c);
 447                 next_char();
 448                 if (c == 'x' || c == 'X') {
 449                         obstack_1grow(&symbol_obstack, (char)c);
 450                         next_char();
 451                         parse_number_hex();
 452                         return;
 453                 } else if (c == 'b' || c == 'B') {
 454                         /* GCC extension: binary constant 0x[bB][01]+.  */
 455                         obstack_1grow(&symbol_obstack, (char)c);
 456                         next_char();
 457                         parse_number_bin();
 458                         return;
 459                 }
 460                 has_digits = true;
 461         }
 462
 463         while (isdigit(c)) {
 464                 has_digits = true;
 465                 obstack_1grow(&symbol_obstack, (char) c);
 466                 next_char();
 467         }
 468
 469         if (c == '.') {
 470                 is_float = true;
 471                 obstack_1grow(&symbol_obstack, '.');
 472                 next_char();
 473
 474                 while (isdigit(c)) {
 475                         has_digits = true;
 476                         obstack_1grow(&symbol_obstack, (char) c);
 477                         next_char();
 478                 }
 479         }
 480         if (c == 'e' || c == 'E') {
 481                 is_float = true;
 482                 obstack_1grow(&symbol_obstack, 'e');
 483                 next_char();
 484                 parse_exponent();
 485         }
 486
 487         obstack_1grow(&symbol_obstack, '\0');
 488         size_t  size   = obstack_object_size(&symbol_obstack) - 1;
 489         char   *string = obstack_finish(&symbol_obstack);
 490         lexer_token.number.number = identify_string(string, size);
 491
 492         if (is_float) {
 493                 lexer_token.kind = T_FLOATINGPOINT;
 494         } else {
 495                 lexer_token.kind = T_INTEGER;
 496
 497                 if (string[0] == '0') {
 498                         /* check for invalid octal digits */
 499                         for (size_t i= 0; i < size; ++i) {
 500                                 char t = string[i];
 501                                 if (t >= '8')
 502                                         errorf(&lexer_token.base.source_position, "invalid digit '%c' in octal number", t);
 503                         }
 504                 }
 505         }
 506
 507         if (!has_digits) {
 508                 errorf(&lexer_token.base.source_position, "invalid number literal '%S'",
 509                        &lexer_token.number.number);
 510         }
 511
 512         parse_number_suffix();
 513 }
 514
 515 /**
 516  * Returns the value of a digit.
 517  * The only portable way to do it ...
 518  */
 519 static int digit_value(utf32 const digit)
 520 {
 521         switch (digit) {
 522         case '0': return 0;
 523         case '1': return 1;
 524         case '2': return 2;
 525         case '3': return 3;
 526         case '4': return 4;
 527         case '5': return 5;
 528         case '6': return 6;
 529         case '7': return 7;
 530         case '8': return 8;
 531         case '9': return 9;
 532         case 'a':
 533         case 'A': return 10;
 534         case 'b':
 535         case 'B': return 11;
 536         case 'c':
 537         case 'C': return 12;
 538         case 'd':
 539         case 'D': return 13;
 540         case 'e':
 541         case 'E': return 14;
 542         case 'f':
 543         case 'F': return 15;
 544         default:
 545                 internal_error("wrong character given");
 546         }
 547 }
 548
 549 /**
 550  * Parses an octal character sequence.
 551  *
 552  * @param first_digit  the already read first digit
 553  */
 554 static utf32 parse_octal_sequence(utf32 const first_digit)
 555 {
 556         assert(is_octal_digit(first_digit));
 557         utf32 value = digit_value(first_digit);
 558         if (!is_octal_digit(c)) return value;
 559         value = 8 * value + digit_value(c);
 560         next_char();
 561         if (!is_octal_digit(c)) return value;
 562         value = 8 * value + digit_value(c);
 563         next_char();
 564         return value;
 565 }
 566
 567 /**
 568  * Parses a hex character sequence.
 569  */
 570 static utf32 parse_hex_sequence(void)
 571 {
 572         utf32 value = 0;
 573         while (isxdigit(c)) {
 574                 value = 16 * value + digit_value(c);
 575                 next_char();
 576         }
 577         return value;
 578 }
 579
 580 /**
 581  * Parse an escape sequence.
 582  */
 583 static utf32 parse_escape_sequence(void)
 584 {
 585         eat('\\');
 586
 587         utf32 const ec = c;
 588         next_char();
 589
 590         switch (ec) {
 591         case '"':  return '"';
 592         case '\'': return '\'';
 593         case '\\': return '\\';
 594         case '?': return '\?';
 595         case 'a': return '\a';
 596         case 'b': return '\b';
 597         case 'f': return '\f';
 598         case 'n': return '\n';
 599         case 'r': return '\r';
 600         case 't': return '\t';
 601         case 'v': return '\v';
 602         case 'x':
 603                 return parse_hex_sequence();
 604         case '0':
 605         case '1':
 606         case '2':
 607         case '3':
 608         case '4':
 609         case '5':
 610         case '6':
 611         case '7':
 612                 return parse_octal_sequence(ec);
 613         case EOF:
 614                 parse_error("reached end of file while parsing escape sequence");
 615                 return EOF;
 616         /* \E is not documented, but handled, by GCC.  It is acceptable according
 617          * to §6.11.4, whereas \e is not. */
 618         case 'E':
 619         case 'e':
 620                 if (c_mode & _GNUC)
 621                         return 27;   /* hopefully 27 is ALWAYS the code for ESCAPE */
 622                 break;
 623         case 'u':
 624         case 'U':
 625                 parse_error("universal character parsing not implemented yet");
 626                 return EOF;
 627         default:
 628                 break;
 629         }
 630         /* §6.4.4.4:8 footnote 64 */
 631         parse_error("unknown escape sequence");
 632         return EOF;
 633 }
 634
 635 string_t make_string(const char *string)
 636 {
 637         size_t      len   = strlen(string) + 1;
 638         char *const space = obstack_alloc(&symbol_obstack, len);
 639         memcpy(space, string, len);
 640
 641         return identify_string(space, len);
 642 }
 643
 644 /**
 645  * Parse a string literal and set lexer_token.
 646  */
 647 static void parse_string_literal(void)
 648 {
 649         eat('"');
 650
 651         while (true) {
 652                 switch (c) {
 653                 case '\\': {
 654                         utf32 const tc = parse_escape_sequence();
 655                         if (tc >= 0x100) {
 656                                 warningf(WARN_OTHER, &lexer_pos, "escape sequence out of range");
 657                         }
 658                         obstack_1grow(&symbol_obstack, tc);
 659                         break;
 660                 }
 661
 662                 case EOF:
 663                         errorf(&lexer_token.base.source_position, "string has no end");
 664                         goto end_of_string;
 665
 666                 case '"':
 667                         next_char();
 668                         goto end_of_string;
 669
 670                 default:
 671                         obstack_grow_symbol(&symbol_obstack, c);
 672                         next_char();
 673                         break;
 674                 }
 675         }
 676
 677 end_of_string:
 678
 679         /* TODO: concatenate multiple strings separated by whitespace... */
 680
 681         /* add finishing 0 to the string */
 682         obstack_1grow(&symbol_obstack, '\0');
 683         const size_t  size   = (size_t)obstack_object_size(&symbol_obstack);
 684         char         *string = obstack_finish(&symbol_obstack);
 685
 686         lexer_token.kind          = T_STRING_LITERAL;
 687         lexer_token.string.string = identify_string(string, size);
 688 }
 689
 690 /**
 691  * Parse a wide character constant and set lexer_token.
 692  */
 693 static void parse_wide_character_constant(void)
 694 {
 695         eat('\'');
 696
 697         while (true) {
 698                 switch (c) {
 699                 case '\\': {
 700                         const utf32 tc = parse_escape_sequence();
 701                         obstack_grow_symbol(&symbol_obstack, tc);
 702                         break;
 703                 }
 704
 705                 MATCH_NEWLINE(
 706                         parse_error("newline while parsing character constant");
 707                         break;
 708                 )
 709
 710                 case '\'':
 711                         next_char();
 712                         goto end_of_wide_char_constant;
 713
 714                 case EOF:
 715                         errorf(&lexer_token.base.source_position, "EOF while parsing character constant");
 716                         goto end_of_wide_char_constant;
 717
 718                 default:
 719                         obstack_grow_symbol(&symbol_obstack, c);
 720                         next_char();
 721                         break;
 722                 }
 723         }
 724
 725 end_of_wide_char_constant:;
 726         obstack_1grow(&symbol_obstack, '\0');
 727         size_t  size   = (size_t) obstack_object_size(&symbol_obstack) - 1;
 728         char   *string = obstack_finish(&symbol_obstack);
 729
 730         lexer_token.kind          = T_WIDE_CHARACTER_CONSTANT;
 731         lexer_token.string.string = identify_string(string, size);
 732
 733         if (size == 0) {
 734                 errorf(&lexer_token.base.source_position, "empty character constant");
 735         }
 736 }
 737
 738 /**
 739  * Parse a wide string literal and set lexer_token.
 740  */
 741 static void parse_wide_string_literal(void)
 742 {
 743         parse_string_literal();
 744         if (lexer_token.kind == T_STRING_LITERAL)
 745                 lexer_token.kind = T_WIDE_STRING_LITERAL;
 746 }
 747
 748 /**
 749  * Parse a character constant and set lexer_token.
 750  */
 751 static void parse_character_constant(void)
 752 {
 753         eat('\'');
 754
 755         while (true) {
 756                 switch (c) {
 757                 case '\\': {
 758                         utf32 const tc = parse_escape_sequence();
 759                         if (tc >= 0x100) {
 760                                 warningf(WARN_OTHER, &lexer_pos, "escape sequence out of range");
 761                         }
 762                         obstack_1grow(&symbol_obstack, tc);
 763                         break;
 764                 }
 765
 766                 MATCH_NEWLINE(
 767                         parse_error("newline while parsing character constant");
 768                         break;
 769                 )
 770
 771                 case '\'':
 772                         next_char();
 773                         goto end_of_char_constant;
 774
 775                 case EOF:
 776                         errorf(&lexer_token.base.source_position, "EOF while parsing character constant");
 777                         goto end_of_char_constant;
 778
 779                 default:
 780                         obstack_grow_symbol(&symbol_obstack, c);
 781                         next_char();
 782                         break;
 783
 784                 }
 785         }
 786
 787 end_of_char_constant:;
 788         obstack_1grow(&symbol_obstack, '\0');
 789         const size_t        size   = (size_t)obstack_object_size(&symbol_obstack)-1;
 790         char         *const string = obstack_finish(&symbol_obstack);
 791
 792         lexer_token.kind          = T_CHARACTER_CONSTANT;
 793         lexer_token.string.string = identify_string(string, size);
 794
 795         if (size == 0) {
 796                 errorf(&lexer_token.base.source_position, "empty character constant");
 797         }
 798 }
 799
 800 /**
 801  * Skip a multiline comment.
 802  */
 803 static void skip_multiline_comment(void)
 804 {
 805         while (true) {
 806                 switch (c) {
 807                 case '/':
 808                         next_char();
 809                         if (c == '*') {
 810                                 /* nested comment, warn here */
 811                                 warningf(WARN_COMMENT, &lexer_pos, "'/*' within comment");
 812                         }
 813                         break;
 814                 case '*':
 815                         next_char();
 816                         if (c == '/') {
 817                                 next_char();
 818                                 return;
 819                         }
 820                         break;
 821
 822                 MATCH_NEWLINE(break;)
 823
 824                 case EOF: {
 825                         errorf(&lexer_token.base.source_position,
 826                                "at end of file while looking for comment end");
 827                         return;
 828                 }
 829
 830                 default:
 831                         next_char();
 832                         break;
 833                 }
 834         }
 835 }
 836
 837 /**
 838  * Skip a single line comment.
 839  */
 840 static void skip_line_comment(void)
 841 {
 842         while (true) {
 843                 switch (c) {
 844                 case EOF:
 845                         return;
 846
 847                 case '\n':
 848                 case '\r':
 849                         return;
 850
 851                 case '\\':
 852                         next_char();
 853                         if (c == '\n' || c == '\r') {
 854                                 warningf(WARN_COMMENT, &lexer_pos, "multi-line comment");
 855                                 return;
 856                         }
 857                         break;
 858
 859                 default:
 860                         next_char();
 861                         break;
 862                 }
 863         }
 864 }
 865
 866 /** The current preprocessor token. */
 867 static token_t pp_token;
 868
 869 /**
 870  * Read the next preprocessor token.
 871  */
 872 static inline void next_pp_token(void)
 873 {
 874         lexer_next_preprocessing_token();
 875         pp_token = lexer_token;
 876 }
 877
 878 /**
 879  * Eat all preprocessor tokens until newline.
 880  */
 881 static void eat_until_newline(void)
 882 {
 883         while (pp_token.kind != '\n' && pp_token.kind != T_EOF) {
 884                 next_pp_token();
 885         }
 886 }
 887
 888 /**
 889  * Parse the line directive.
 890  */
 891 static void parse_line_directive(void)
 892 {
 893         if (pp_token.kind != T_INTEGER) {
 894                 parse_error("expected integer");
 895         } else {
 896                 /* use offset -1 as this is about the next line */
 897                 lexer_pos.lineno = atoi(pp_token.number.number.begin) - 1;
 898                 next_pp_token();
 899         }
 900         if (pp_token.kind == T_STRING_LITERAL) {
 901                 lexer_pos.input_name = pp_token.string.string.begin;
 902                 lexer_pos.is_system_header = false;
 903                 next_pp_token();
 904
 905                 /* attempt to parse numeric flags as outputted by gcc preprocessor */
 906                 while (pp_token.kind == T_INTEGER) {
 907                         /* flags:
 908                          * 1 - indicates start of a new file
 909                          * 2 - indicates return from a file
 910                          * 3 - indicates system header
 911                          * 4 - indicates implicit extern "C" in C++ mode
 912                          *
 913                          * currently we're only interested in "3"
 914                          */
 915                         if (streq(pp_token.number.number.begin, "3")) {
 916                                 lexer_pos.is_system_header = true;
 917                         }
 918                         next_pp_token();
 919                 }
 920         }
 921
 922         eat_until_newline();
 923 }
 924
 925 /**
 926  * STDC pragmas.
 927  */
 928 typedef enum stdc_pragma_kind_t {
 929         STDC_UNKNOWN,
 930         STDC_FP_CONTRACT,
 931         STDC_FENV_ACCESS,
 932         STDC_CX_LIMITED_RANGE
 933 } stdc_pragma_kind_t;
 934
 935 /**
 936  * STDC pragma values.
 937  */
 938 typedef enum stdc_pragma_value_kind_t {
 939         STDC_VALUE_UNKNOWN,
 940         STDC_VALUE_ON,
 941         STDC_VALUE_OFF,
 942         STDC_VALUE_DEFAULT
 943 } stdc_pragma_value_kind_t;
 944
 945 /**
 946  * Parse a pragma directive.
 947  */
 948 static void parse_pragma(void)
 949 {
 950         next_pp_token();
 951         if (pp_token.kind != T_IDENTIFIER) {
 952                 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
 953                          "expected identifier after #pragma");
 954                 eat_until_newline();
 955                 return;
 956         }
 957
 958         stdc_pragma_kind_t kind = STDC_UNKNOWN;
 959         if (pp_token.base.symbol->pp_ID == TP_STDC && c_mode & _C99) {
 960                 /* a STDC pragma */
 961                 next_pp_token();
 962
 963                 switch (pp_token.base.symbol->pp_ID) {
 964                 case TP_FP_CONTRACT:      kind = STDC_FP_CONTRACT;      break;
 965                 case TP_FENV_ACCESS:      kind = STDC_FENV_ACCESS;      break;
 966                 case TP_CX_LIMITED_RANGE: kind = STDC_CX_LIMITED_RANGE; break;
 967                 default:                  break;
 968                 }
 969                 if (kind != STDC_UNKNOWN) {
 970                         next_pp_token();
 971                         stdc_pragma_value_kind_t value;
 972                         switch (pp_token.base.symbol->pp_ID) {
 973                         case TP_ON:      value = STDC_VALUE_ON;      break;
 974                         case TP_OFF:     value = STDC_VALUE_OFF;     break;
 975                         case TP_DEFAULT: value = STDC_VALUE_DEFAULT; break;
 976                         default:         value = STDC_VALUE_UNKNOWN; break;
 977                         }
 978                         if (value == STDC_VALUE_UNKNOWN) {
 979                                 kind = STDC_UNKNOWN;
 980                                 errorf(&pp_token.base.source_position, "bad STDC pragma argument");
 981                         }
 982                 }
 983         }
 984         eat_until_newline();
 985         if (kind == STDC_UNKNOWN) {
 986                 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
 987                          "encountered unknown #pragma");
 988         }
 989 }
 990
 991 /**
 992  * Parse a preprocessor non-null directive.
 993  */
 994 static void parse_preprocessor_identifier(void)
 995 {
 996         assert(pp_token.kind == T_IDENTIFIER);
 997         switch (pp_token.base.symbol->pp_ID) {
 998         case TP_line:
 999                 next_pp_token();
1000                 parse_line_directive();
1001                 break;
1002         case TP_pragma:
1003                 parse_pragma();
1004                 break;
1005         case TP_error:
1006                 /* TODO; output the rest of the line */
1007                 parse_error("#error directive");
1008                 break;
1009         }
1010 }
1011
1012 /**
1013  * Parse a preprocessor directive.
1014  */
1015 static void parse_preprocessor_directive(void)
1016 {
1017         next_pp_token();
1018
1019         switch (pp_token.kind) {
1020         case T_IDENTIFIER:
1021                 parse_preprocessor_identifier();
1022                 break;
1023         case T_INTEGER:
1024                 parse_line_directive();
1025                 break;
1026         case '\n':
1027                 /* NULL directive, see §6.10.7 */
1028                 break;
1029         default:
1030                 parse_error("invalid preprocessor directive");
1031                 eat_until_newline();
1032                 break;
1033         }
1034 }
1035
1036 #define MAYBE_PROLOG                                       \
1037                         next_char();                                   \
1038                         while (true) {                                 \
1039                                 switch (c) {
1040
1041 #define MAYBE(ch, set_type)                                \
1042                                 case ch:                                   \
1043                                         next_char();                           \
1044                                         lexer_token.kind = set_type;           \
1045                                         return;
1046
1047 /* must use this as last thing */
1048 #define MAYBE_MODE(ch, set_type, mode)                     \
1049                                 case ch:                                   \
1050                                         if (c_mode & mode) {                   \
1051                                                 next_char();                       \
1052                                                 lexer_token.kind = set_type;       \
1053                                                 return;                            \
1054                                         }                                      \
1055                                         /* fallthrough */
1056
1057 #define ELSE_CODE(code)                                    \
1058                                 default:                                   \
1059                                         code                                   \
1060                                         return;                                \
1061                                 }                                          \
1062                         } /* end of while (true) */                    \
1063
1064 #define ELSE(set_type)                                     \
1065                 ELSE_CODE(                                         \
1066                         lexer_token.kind = set_type;                   \
1067                 )
1068
1069 void lexer_next_preprocessing_token(void)
1070 {
1071         while (true) {
1072                 lexer_token.base.source_position = lexer_pos;
1073                 lexer_token.base.symbol          = NULL;
1074
1075                 switch (c) {
1076                 case ' ':
1077                 case '\t':
1078                         next_char();
1079                         break;
1080
1081                 MATCH_NEWLINE(
1082                         lexer_token.kind = '\n';
1083                         return;
1084                 )
1085
1086                 SYMBOL_CHARS
1087                         parse_symbol();
1088                         /* might be a wide string ( L"string" ) */
1089                         if (lexer_token.base.symbol == symbol_L) {
1090                                 switch (c) {
1091                                         case '"':  parse_wide_string_literal();     break;
1092                                         case '\'': parse_wide_character_constant(); break;
1093                                 }
1094                         }
1095                         return;
1096
1097                 DIGITS
1098                         parse_number();
1099                         return;
1100
1101                 case '"':
1102                         parse_string_literal();
1103                         return;
1104
1105                 case '\'':
1106                         parse_character_constant();
1107                         return;
1108
1109                 case '.':
1110                         MAYBE_PROLOG
1111                                 DIGITS
1112                                         put_back(c);
1113                                         c = '.';
1114                                         parse_number();
1115                                         return;
1116
1117                                 case '.':
1118                                         MAYBE_PROLOG
1119                                         MAYBE('.', T_DOTDOTDOT)
1120                                         ELSE_CODE(
1121                                                 put_back(c);
1122                                                 c = '.';
1123                                                 lexer_token.kind = '.';
1124                                         )
1125                         ELSE('.')
1126                 case '&':
1127                         MAYBE_PROLOG
1128                         MAYBE('&', T_ANDAND)
1129                         MAYBE('=', T_ANDEQUAL)
1130                         ELSE('&')
1131                 case '*':
1132                         MAYBE_PROLOG
1133                         MAYBE('=', T_ASTERISKEQUAL)
1134                         ELSE('*')
1135                 case '+':
1136                         MAYBE_PROLOG
1137                         MAYBE('+', T_PLUSPLUS)
1138                         MAYBE('=', T_PLUSEQUAL)
1139                         ELSE('+')
1140                 case '-':
1141                         MAYBE_PROLOG
1142                         MAYBE('>', T_MINUSGREATER)
1143                         MAYBE('-', T_MINUSMINUS)
1144                         MAYBE('=', T_MINUSEQUAL)
1145                         ELSE('-')
1146                 case '!':
1147                         MAYBE_PROLOG
1148                         MAYBE('=', T_EXCLAMATIONMARKEQUAL)
1149                         ELSE('!')
1150                 case '/':
1151                         MAYBE_PROLOG
1152                         MAYBE('=', T_SLASHEQUAL)
1153                                 case '*':
1154                                         next_char();
1155                                         skip_multiline_comment();
1156                                         lexer_next_preprocessing_token();
1157                                         return;
1158                                 case '/':
1159                                         next_char();
1160                                         skip_line_comment();
1161                                         lexer_next_preprocessing_token();
1162                                         return;
1163                         ELSE('/')
1164                 case '%':
1165                         MAYBE_PROLOG
1166                         MAYBE('>', '}')
1167                         MAYBE('=', T_PERCENTEQUAL)
1168                                 case ':':
1169                                         MAYBE_PROLOG
1170                                                 case '%':
1171                                                         MAYBE_PROLOG
1172                                                         MAYBE(':', T_HASHHASH)
1173                                                         ELSE_CODE(
1174                                                                 put_back(c);
1175                                                                 c = '%';
1176                                                                 lexer_token.kind = '#';
1177                                                         )
1178                                         ELSE('#')
1179                         ELSE('%')
1180                 case '<':
1181                         MAYBE_PROLOG
1182                         MAYBE(':', '[')
1183                         MAYBE('%', '{')
1184                         MAYBE('=', T_LESSEQUAL)
1185                                 case '<':
1186                                         MAYBE_PROLOG
1187                                         MAYBE('=', T_LESSLESSEQUAL)
1188                                         ELSE(T_LESSLESS)
1189                         ELSE('<')
1190                 case '>':
1191                         MAYBE_PROLOG
1192                         MAYBE('=', T_GREATEREQUAL)
1193                                 case '>':
1194                                         MAYBE_PROLOG
1195                                         MAYBE('=', T_GREATERGREATEREQUAL)
1196                                         ELSE(T_GREATERGREATER)
1197                         ELSE('>')
1198                 case '^':
1199                         MAYBE_PROLOG
1200                         MAYBE('=', T_CARETEQUAL)
1201                         ELSE('^')
1202                 case '|':
1203                         MAYBE_PROLOG
1204                         MAYBE('=', T_PIPEEQUAL)
1205                         MAYBE('|', T_PIPEPIPE)
1206                         ELSE('|')
1207                 case ':':
1208                         MAYBE_PROLOG
1209                         MAYBE('>', ']')
1210                         MAYBE_MODE(':', T_COLONCOLON, _CXX)
1211                         ELSE(':')
1212                 case '=':
1213                         MAYBE_PROLOG
1214                         MAYBE('=', T_EQUALEQUAL)
1215                         ELSE('=')
1216                 case '#':
1217                         MAYBE_PROLOG
1218                         MAYBE('#', T_HASHHASH)
1219                         ELSE('#')
1220
1221                 case '?':
1222                 case '[':
1223                 case ']':
1224                 case '(':
1225                 case ')':
1226                 case '{':
1227                 case '}':
1228                 case '~':
1229                 case ';':
1230                 case ',':
1231                 case '\\':
1232                         lexer_token.kind = c;
1233                         next_char();
1234                         return;
1235
1236                 case EOF:
1237                         lexer_token.kind = T_EOF;
1238                         return;
1239
1240                 default:
1241 dollar_sign:
1242                         errorf(&lexer_pos, "unknown character '%c' found", c);
1243                         next_char();
1244                         break;
1245                 }
1246         }
1247 }
1248
1249 void lexer_next_token(void)
1250 {
1251         lexer_next_preprocessing_token();
1252
1253         while (lexer_token.kind == '\n') {
1254 newline_found:
1255                 lexer_next_preprocessing_token();
1256         }
1257
1258         if (lexer_token.kind == '#') {
1259                 parse_preprocessor_directive();
1260                 goto newline_found;
1261         }
1262 }
1263
1264 void init_lexer(void)
1265 {
1266         strset_init(&stringset);
1267         symbol_L = symbol_table_insert("L");
1268 }
1269
1270 static void input_error(unsigned delta_lines, unsigned delta_cols,
1271                         const char *message)
1272 {
1273         lexer_pos.lineno += delta_lines;
1274         lexer_pos.colno  += delta_cols;
1275         errorf(&lexer_pos, "%s", message);
1276 }
1277
1278 void lexer_switch_input(input_t *new_input, const char *input_name)
1279 {
1280         lexer_pos.lineno     = 0;
1281         lexer_pos.colno      = 0;
1282         lexer_pos.input_name = input_name;
1283
1284         set_input_error_callback(input_error);
1285         input  = new_input;
1286         bufpos = NULL;
1287         bufend = NULL;
1288
1289         /* place a virtual \n at the beginning so the lexer knows that we're
1290          * at the beginning of a line */
1291         c = '\n';
1292 }
1293
1294 void exit_lexer(void)
1295 {
1296         strset_destroy(&stringset);
1297 }
1298
1299 static __attribute__((unused))
1300 void dbg_pos(const source_position_t source_position)
1301 {
1302         fprintf(stdout, "%s:%u:%u\n", source_position.input_name,
1303                 source_position.lineno, (unsigned)source_position.colno);
1304         fflush(stdout);
1305 }