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 "input.h"
  23 #include "diagnostic.h"
  24 #include "lexer.h"
  25 #include "symbol_t.h"
  26 #include "token_t.h"
  27 #include "symbol_table_t.h"
  28 #include "adt/error.h"
  29 #include "adt/strset.h"
  30 #include "adt/util.h"
  31 #include "types.h"
  32 #include "type_t.h"
  33 #include "target_architecture.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.identifier.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);
 327         char     *string = obstack_finish(&symbol_obstack);
 328
 329         lexer_token.number.suffix = identify_string(string, size);
 330 }
 331
 332 /**
 333  * Parses a hex number including hex floats and set the
 334  * lexer_token.
 335  */
 336 static void parse_number_hex(void)
 337 {
 338         bool is_float   = false;
 339         bool has_digits = false;
 340
 341         assert(obstack_object_size(&symbol_obstack) == 0);
 342         while (isxdigit(c)) {
 343                 has_digits = true;
 344                 obstack_1grow(&symbol_obstack, (char) c);
 345                 next_char();
 346         }
 347
 348         if (c == '.') {
 349                 is_float = true;
 350                 obstack_1grow(&symbol_obstack, (char) c);
 351                 next_char();
 352
 353                 while (isxdigit(c)) {
 354                         has_digits = true;
 355                         obstack_1grow(&symbol_obstack, (char) c);
 356                         next_char();
 357                 }
 358         }
 359         if (c == 'p' || c == 'P') {
 360                 is_float = true;
 361                 obstack_1grow(&symbol_obstack, (char) c);
 362                 next_char();
 363
 364                 if (c == '-' || c == '+') {
 365                         obstack_1grow(&symbol_obstack, (char) c);
 366                         next_char();
 367                 }
 368
 369                 while (isxdigit(c)) {
 370                         obstack_1grow(&symbol_obstack, (char) c);
 371                         next_char();
 372                 }
 373         } else if (is_float) {
 374                 errorf(&lexer_token.base.source_position,
 375                        "hexadecimal floatingpoint constant requires an exponent");
 376         }
 377         obstack_1grow(&symbol_obstack, '\0');
 378
 379         size_t  size   = obstack_object_size(&symbol_obstack) - 1;
 380         char   *string = obstack_finish(&symbol_obstack);
 381         lexer_token.number.number = identify_string(string, size);
 382
 383         lexer_token.kind    =
 384                 is_float ? T_FLOATINGPOINT_HEXADECIMAL : T_INTEGER_HEXADECIMAL;
 385
 386         if (!has_digits) {
 387                 errorf(&lexer_token.base.source_position,
 388                        "invalid number literal '0x%S'", &lexer_token.number.number);
 389                 lexer_token.number.number.begin = "0";
 390                 lexer_token.number.number.size  = 1;
 391         }
 392
 393         parse_number_suffix();
 394 }
 395
 396 /**
 397  * Returns true if the given char is a octal digit.
 398  *
 399  * @param char  the character to check
 400  */
 401 static bool is_octal_digit(utf32 chr)
 402 {
 403         return '0' <= chr && chr <= '7';
 404 }
 405
 406 /**
 407  * Parses a number and sets the lexer_token.
 408  */
 409 static void parse_number(void)
 410 {
 411         bool is_float   = false;
 412         bool has_digits = false;
 413
 414         assert(obstack_object_size(&symbol_obstack) == 0);
 415         if (c == '0') {
 416                 next_char();
 417                 if (c == 'x' || c == 'X') {
 418                         next_char();
 419                         parse_number_hex();
 420                         return;
 421                 } else {
 422                         has_digits = true;
 423                 }
 424                 obstack_1grow(&symbol_obstack, '0');
 425         }
 426
 427         while (isdigit(c)) {
 428                 has_digits = true;
 429                 obstack_1grow(&symbol_obstack, (char) c);
 430                 next_char();
 431         }
 432
 433         if (c == '.') {
 434                 is_float = true;
 435                 obstack_1grow(&symbol_obstack, '.');
 436                 next_char();
 437
 438                 while (isdigit(c)) {
 439                         has_digits = true;
 440                         obstack_1grow(&symbol_obstack, (char) c);
 441                         next_char();
 442                 }
 443         }
 444         if (c == 'e' || c == 'E') {
 445                 is_float = true;
 446                 obstack_1grow(&symbol_obstack, 'e');
 447                 next_char();
 448
 449                 if (c == '-' || c == '+') {
 450                         obstack_1grow(&symbol_obstack, (char) c);
 451                         next_char();
 452                 }
 453
 454                 while (isdigit(c)) {
 455                         obstack_1grow(&symbol_obstack, (char) c);
 456                         next_char();
 457                 }
 458         }
 459
 460         obstack_1grow(&symbol_obstack, '\0');
 461         size_t  size   = obstack_object_size(&symbol_obstack) - 1;
 462         char   *string = obstack_finish(&symbol_obstack);
 463         lexer_token.number.number = identify_string(string, size);
 464
 465         /* is it an octal number? */
 466         if (is_float) {
 467                 lexer_token.kind = T_FLOATINGPOINT;
 468         } else if (string[0] == '0') {
 469                 lexer_token.kind = T_INTEGER_OCTAL;
 470
 471                 /* check for invalid octal digits */
 472                 for (size_t i= 0; i < size; ++i) {
 473                         char t = string[i];
 474                         if (t >= '8')
 475                                 errorf(&lexer_token.base.source_position,
 476                                        "invalid digit '%c' in octal number", t);
 477                 }
 478         } else {
 479                 lexer_token.kind = T_INTEGER;
 480         }
 481
 482         if (!has_digits) {
 483                 errorf(&lexer_token.base.source_position, "invalid number literal '%S'",
 484                        &lexer_token.number.number);
 485         }
 486
 487         parse_number_suffix();
 488 }
 489
 490 /**
 491  * Returns the value of a digit.
 492  * The only portable way to do it ...
 493  */
 494 static int digit_value(utf32 const digit)
 495 {
 496         switch (digit) {
 497         case '0': return 0;
 498         case '1': return 1;
 499         case '2': return 2;
 500         case '3': return 3;
 501         case '4': return 4;
 502         case '5': return 5;
 503         case '6': return 6;
 504         case '7': return 7;
 505         case '8': return 8;
 506         case '9': return 9;
 507         case 'a':
 508         case 'A': return 10;
 509         case 'b':
 510         case 'B': return 11;
 511         case 'c':
 512         case 'C': return 12;
 513         case 'd':
 514         case 'D': return 13;
 515         case 'e':
 516         case 'E': return 14;
 517         case 'f':
 518         case 'F': return 15;
 519         default:
 520                 internal_error("wrong character given");
 521         }
 522 }
 523
 524 /**
 525  * Parses an octal character sequence.
 526  *
 527  * @param first_digit  the already read first digit
 528  */
 529 static utf32 parse_octal_sequence(utf32 const first_digit)
 530 {
 531         assert(is_octal_digit(first_digit));
 532         utf32 value = digit_value(first_digit);
 533         if (!is_octal_digit(c)) return value;
 534         value = 8 * value + digit_value(c);
 535         next_char();
 536         if (!is_octal_digit(c)) return value;
 537         value = 8 * value + digit_value(c);
 538         next_char();
 539         return value;
 540 }
 541
 542 /**
 543  * Parses a hex character sequence.
 544  */
 545 static utf32 parse_hex_sequence(void)
 546 {
 547         utf32 value = 0;
 548         while (isxdigit(c)) {
 549                 value = 16 * value + digit_value(c);
 550                 next_char();
 551         }
 552         return value;
 553 }
 554
 555 /**
 556  * Parse an escape sequence.
 557  */
 558 static utf32 parse_escape_sequence(void)
 559 {
 560         eat('\\');
 561
 562         utf32 const ec = c;
 563         next_char();
 564
 565         switch (ec) {
 566         case '"':  return '"';
 567         case '\'': return '\'';
 568         case '\\': return '\\';
 569         case '?': return '\?';
 570         case 'a': return '\a';
 571         case 'b': return '\b';
 572         case 'f': return '\f';
 573         case 'n': return '\n';
 574         case 'r': return '\r';
 575         case 't': return '\t';
 576         case 'v': return '\v';
 577         case 'x':
 578                 return parse_hex_sequence();
 579         case '0':
 580         case '1':
 581         case '2':
 582         case '3':
 583         case '4':
 584         case '5':
 585         case '6':
 586         case '7':
 587                 return parse_octal_sequence(ec);
 588         case EOF:
 589                 parse_error("reached end of file while parsing escape sequence");
 590                 return EOF;
 591         /* \E is not documented, but handled, by GCC.  It is acceptable according
 592          * to §6.11.4, whereas \e is not. */
 593         case 'E':
 594         case 'e':
 595                 if (c_mode & _GNUC)
 596                         return 27;   /* hopefully 27 is ALWAYS the code for ESCAPE */
 597                 break;
 598         case 'u':
 599         case 'U':
 600                 parse_error("universal character parsing not implemented yet");
 601                 return EOF;
 602         default:
 603                 break;
 604         }
 605         /* §6.4.4.4:8 footnote 64 */
 606         parse_error("unknown escape sequence");
 607         return EOF;
 608 }
 609
 610 /**
 611  * Concatenate two strings.
 612  */
 613 string_t concat_strings(const string_t *const s1, const string_t *const s2)
 614 {
 615         const size_t len1 = s1->size - 1;
 616         const size_t len2 = s2->size - 1;
 617
 618         char *const concat = obstack_alloc(&symbol_obstack, len1 + len2 + 1);
 619         memcpy(concat, s1->begin, len1);
 620         memcpy(concat + len1, s2->begin, len2 + 1);
 621
 622         return identify_string(concat, len1 + len2 + 1);
 623 }
 624
 625 string_t make_string(const char *string)
 626 {
 627         size_t      len   = strlen(string) + 1;
 628         char *const space = obstack_alloc(&symbol_obstack, len);
 629         memcpy(space, string, len);
 630
 631         return identify_string(space, len);
 632 }
 633
 634 /**
 635  * Parse a string literal and set lexer_token.
 636  */
 637 static void parse_string_literal(void)
 638 {
 639         eat('"');
 640
 641         while (true) {
 642                 switch (c) {
 643                 case '\\': {
 644                         utf32 const tc = parse_escape_sequence();
 645                         if (tc >= 0x100) {
 646                                 warningf(WARN_OTHER, &lexer_pos, "escape sequence out of range");
 647                         }
 648                         obstack_1grow(&symbol_obstack, tc);
 649                         break;
 650                 }
 651
 652                 case EOF: {
 653                         errorf(&lexer_token.base.source_position, "string has no end");
 654                         lexer_token.kind = T_ERROR;
 655                         return;
 656                 }
 657
 658                 case '"':
 659                         next_char();
 660                         goto end_of_string;
 661
 662                 default:
 663                         obstack_grow_symbol(&symbol_obstack, c);
 664                         next_char();
 665                         break;
 666                 }
 667         }
 668
 669 end_of_string:
 670
 671         /* TODO: concatenate multiple strings separated by whitespace... */
 672
 673         /* add finishing 0 to the string */
 674         obstack_1grow(&symbol_obstack, '\0');
 675         const size_t  size   = (size_t)obstack_object_size(&symbol_obstack);
 676         char         *string = obstack_finish(&symbol_obstack);
 677
 678         lexer_token.kind          = T_STRING_LITERAL;
 679         lexer_token.string.string = identify_string(string, size);
 680 }
 681
 682 /**
 683  * Parse a wide character constant and set lexer_token.
 684  */
 685 static void parse_wide_character_constant(void)
 686 {
 687         eat('\'');
 688
 689         while (true) {
 690                 switch (c) {
 691                 case '\\': {
 692                         const utf32 tc = parse_escape_sequence();
 693                         obstack_grow_symbol(&symbol_obstack, tc);
 694                         break;
 695                 }
 696
 697                 MATCH_NEWLINE(
 698                         parse_error("newline while parsing character constant");
 699                         break;
 700                 )
 701
 702                 case '\'':
 703                         next_char();
 704                         goto end_of_wide_char_constant;
 705
 706                 case EOF: {
 707                         errorf(&lexer_token.base.source_position,
 708                                "EOF while parsing character constant");
 709                         lexer_token.kind = T_ERROR;
 710                         return;
 711                 }
 712
 713                 default:
 714                         obstack_grow_symbol(&symbol_obstack, c);
 715                         next_char();
 716                         break;
 717                 }
 718         }
 719
 720 end_of_wide_char_constant:;
 721         obstack_1grow(&symbol_obstack, '\0');
 722         size_t  size   = (size_t) obstack_object_size(&symbol_obstack) - 1;
 723         char   *string = obstack_finish(&symbol_obstack);
 724
 725         lexer_token.kind          = T_WIDE_CHARACTER_CONSTANT;
 726         lexer_token.string.string = identify_string(string, size);
 727
 728         if (size == 0) {
 729                 errorf(&lexer_token.base.source_position, "empty character constant");
 730         }
 731 }
 732
 733 /**
 734  * Parse a wide string literal and set lexer_token.
 735  */
 736 static void parse_wide_string_literal(void)
 737 {
 738         parse_string_literal();
 739         if (lexer_token.kind == T_STRING_LITERAL)
 740                 lexer_token.kind = T_WIDE_STRING_LITERAL;
 741 }
 742
 743 /**
 744  * Parse a character constant and set lexer_token.
 745  */
 746 static void parse_character_constant(void)
 747 {
 748         eat('\'');
 749
 750         while (true) {
 751                 switch (c) {
 752                 case '\\': {
 753                         utf32 const tc = parse_escape_sequence();
 754                         if (tc >= 0x100) {
 755                                 warningf(WARN_OTHER, &lexer_pos, "escape sequence out of range");
 756                         }
 757                         obstack_1grow(&symbol_obstack, tc);
 758                         break;
 759                 }
 760
 761                 MATCH_NEWLINE(
 762                         parse_error("newline while parsing character constant");
 763                         break;
 764                 )
 765
 766                 case '\'':
 767                         next_char();
 768                         goto end_of_char_constant;
 769
 770                 case EOF: {
 771                         errorf(&lexer_token.base.source_position,
 772                                "EOF while parsing character constant");
 773                         lexer_token.kind = T_ERROR;
 774                         return;
 775                 }
 776
 777                 default:
 778                         obstack_grow_symbol(&symbol_obstack, c);
 779                         next_char();
 780                         break;
 781
 782                 }
 783         }
 784
 785 end_of_char_constant:;
 786         obstack_1grow(&symbol_obstack, '\0');
 787         const size_t        size   = (size_t)obstack_object_size(&symbol_obstack)-1;
 788         char         *const string = obstack_finish(&symbol_obstack);
 789
 790         lexer_token.kind          = T_CHARACTER_CONSTANT;
 791         lexer_token.string.string = identify_string(string, size);
 792
 793         if (size == 0) {
 794                 errorf(&lexer_token.base.source_position, "empty character constant");
 795         }
 796 }
 797
 798 /**
 799  * Skip a multiline comment.
 800  */
 801 static void skip_multiline_comment(void)
 802 {
 803         while (true) {
 804                 switch (c) {
 805                 case '/':
 806                         next_char();
 807                         if (c == '*') {
 808                                 /* nested comment, warn here */
 809                                 warningf(WARN_COMMENT, &lexer_pos, "'/*' within comment");
 810                         }
 811                         break;
 812                 case '*':
 813                         next_char();
 814                         if (c == '/') {
 815                                 next_char();
 816                                 return;
 817                         }
 818                         break;
 819
 820                 MATCH_NEWLINE(break;)
 821
 822                 case EOF: {
 823                         errorf(&lexer_token.base.source_position,
 824                                "at end of file while looking for comment end");
 825                         return;
 826                 }
 827
 828                 default:
 829                         next_char();
 830                         break;
 831                 }
 832         }
 833 }
 834
 835 /**
 836  * Skip a single line comment.
 837  */
 838 static void skip_line_comment(void)
 839 {
 840         while (true) {
 841                 switch (c) {
 842                 case EOF:
 843                         return;
 844
 845                 case '\n':
 846                 case '\r':
 847                         return;
 848
 849                 case '\\':
 850                         next_char();
 851                         if (c == '\n' || c == '\r') {
 852                                 warningf(WARN_COMMENT, &lexer_pos, "multi-line comment");
 853                                 return;
 854                         }
 855                         break;
 856
 857                 default:
 858                         next_char();
 859                         break;
 860                 }
 861         }
 862 }
 863
 864 /** The current preprocessor token. */
 865 static token_t pp_token;
 866
 867 /**
 868  * Read the next preprocessor token.
 869  */
 870 static inline void next_pp_token(void)
 871 {
 872         lexer_next_preprocessing_token();
 873         pp_token = lexer_token;
 874 }
 875
 876 /**
 877  * Eat all preprocessor tokens until newline.
 878  */
 879 static void eat_until_newline(void)
 880 {
 881         while (pp_token.kind != '\n' && pp_token.kind != T_EOF) {
 882                 next_pp_token();
 883         }
 884 }
 885
 886 /**
 887  * Parse the line directive.
 888  */
 889 static void parse_line_directive(void)
 890 {
 891         if (pp_token.kind != T_INTEGER) {
 892                 parse_error("expected integer");
 893         } else {
 894                 /* use offset -1 as this is about the next line */
 895                 lexer_pos.lineno = atoi(pp_token.number.number.begin) - 1;
 896                 next_pp_token();
 897         }
 898         if (pp_token.kind == T_STRING_LITERAL) {
 899                 lexer_pos.input_name = pp_token.string.string.begin;
 900                 next_pp_token();
 901         }
 902
 903         eat_until_newline();
 904 }
 905
 906 /**
 907  * STDC pragmas.
 908  */
 909 typedef enum stdc_pragma_kind_t {
 910         STDC_UNKNOWN,
 911         STDC_FP_CONTRACT,
 912         STDC_FENV_ACCESS,
 913         STDC_CX_LIMITED_RANGE
 914 } stdc_pragma_kind_t;
 915
 916 /**
 917  * STDC pragma values.
 918  */
 919 typedef enum stdc_pragma_value_kind_t {
 920         STDC_VALUE_UNKNOWN,
 921         STDC_VALUE_ON,
 922         STDC_VALUE_OFF,
 923         STDC_VALUE_DEFAULT
 924 } stdc_pragma_value_kind_t;
 925
 926 /**
 927  * Parse a pragma directive.
 928  */
 929 static void parse_pragma(void)
 930 {
 931         bool unknown_pragma = true;
 932
 933         next_pp_token();
 934         if (pp_token.kind != T_IDENTIFIER) {
 935                 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
 936                          "expected identifier after #pragma");
 937                 eat_until_newline();
 938                 return;
 939         }
 940
 941         symbol_t *symbol = pp_token.identifier.symbol;
 942         if (symbol->pp_ID == TP_STDC) {
 943                 stdc_pragma_kind_t kind = STDC_UNKNOWN;
 944                 /* a STDC pragma */
 945                 if (c_mode & _C99) {
 946                         next_pp_token();
 947
 948                         switch (pp_token.identifier.symbol->pp_ID) {
 949                         case TP_FP_CONTRACT:
 950                                 kind = STDC_FP_CONTRACT;
 951                                 break;
 952                         case TP_FENV_ACCESS:
 953                                 kind = STDC_FENV_ACCESS;
 954                                 break;
 955                         case TP_CX_LIMITED_RANGE:
 956                                 kind = STDC_CX_LIMITED_RANGE;
 957                                 break;
 958                         default:
 959                                 break;
 960                         }
 961                         if (kind != STDC_UNKNOWN) {
 962                                 stdc_pragma_value_kind_t value = STDC_VALUE_UNKNOWN;
 963                                 next_pp_token();
 964                                 switch (pp_token.identifier.symbol->pp_ID) {
 965                                 case TP_ON:
 966                                         value = STDC_VALUE_ON;
 967                                         break;
 968                                 case TP_OFF:
 969                                         value = STDC_VALUE_OFF;
 970                                         break;
 971                                 case TP_DEFAULT:
 972                                         value = STDC_VALUE_DEFAULT;
 973                                         break;
 974                                 default:
 975                                         break;
 976                                 }
 977                                 if (value != STDC_VALUE_UNKNOWN) {
 978                                         unknown_pragma = false;
 979                                 } else {
 980                                         errorf(&pp_token.base.source_position,
 981                                                "bad STDC pragma argument");
 982                                 }
 983                         }
 984                 }
 985         } else {
 986                 unknown_pragma = true;
 987         }
 988         eat_until_newline();
 989         if (unknown_pragma) {
 990                 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
 991                          "encountered unknown #pragma");
 992         }
 993 }
 994
 995 /**
 996  * Parse a preprocessor non-null directive.
 997  */
 998 static void parse_preprocessor_identifier(void)
 999 {
1000         assert(pp_token.kind == T_IDENTIFIER);
1001         symbol_t *symbol = pp_token.identifier.symbol;
1002
1003         switch (symbol->pp_ID) {
1004         case TP_line:
1005                 next_pp_token();
1006                 parse_line_directive();
1007                 break;
1008         case TP_pragma:
1009                 parse_pragma();
1010                 break;
1011         case TP_error:
1012                 /* TODO; output the rest of the line */
1013                 parse_error("#error directive");
1014                 break;
1015         }
1016 }
1017
1018 /**
1019  * Parse a preprocessor directive.
1020  */
1021 static void parse_preprocessor_directive(void)
1022 {
1023         next_pp_token();
1024
1025         switch (pp_token.kind) {
1026         case T_IDENTIFIER:
1027                 parse_preprocessor_identifier();
1028                 break;
1029         case T_INTEGER:
1030                 parse_line_directive();
1031                 break;
1032         case '\n':
1033                 /* NULL directive, see §6.10.7 */
1034                 break;
1035         default:
1036                 parse_error("invalid preprocessor directive");
1037                 eat_until_newline();
1038                 break;
1039         }
1040 }
1041
1042 #define MAYBE_PROLOG                                       \
1043                         next_char();                                   \
1044                         while (true) {                                 \
1045                                 switch (c) {
1046
1047 #define MAYBE(ch, set_type)                                \
1048                                 case ch:                                   \
1049                                         next_char();                           \
1050                                         lexer_token.kind = set_type;           \
1051                                         return;
1052
1053 /* must use this as last thing */
1054 #define MAYBE_MODE(ch, set_type, mode)                     \
1055                                 case ch:                                   \
1056                                         if (c_mode & mode) {                   \
1057                                                 next_char();                       \
1058                                                 lexer_token.kind = set_type;       \
1059                                                 return;                            \
1060                                         }                                      \
1061                                         /* fallthrough */
1062
1063 #define ELSE_CODE(code)                                    \
1064                                 default:                                   \
1065                                         code                                   \
1066                                         return;                                \
1067                                 }                                          \
1068                         } /* end of while (true) */                    \
1069
1070 #define ELSE(set_type)                                     \
1071                 ELSE_CODE(                                         \
1072                         lexer_token.kind = set_type;                   \
1073                 )
1074
1075 void lexer_next_preprocessing_token(void)
1076 {
1077         while (true) {
1078                 lexer_token.base.source_position = lexer_pos;
1079
1080                 switch (c) {
1081                 case ' ':
1082                 case '\t':
1083                         next_char();
1084                         break;
1085
1086                 MATCH_NEWLINE(
1087                         lexer_token.kind = '\n';
1088                         return;
1089                 )
1090
1091                 SYMBOL_CHARS
1092                         parse_symbol();
1093                         /* might be a wide string ( L"string" ) */
1094                         if (lexer_token.identifier.symbol == symbol_L) {
1095                                 switch (c) {
1096                                         case '"':  parse_wide_string_literal();     break;
1097                                         case '\'': parse_wide_character_constant(); break;
1098                                 }
1099                         }
1100                         return;
1101
1102                 DIGITS
1103                         parse_number();
1104                         return;
1105
1106                 case '"':
1107                         parse_string_literal();
1108                         return;
1109
1110                 case '\'':
1111                         parse_character_constant();
1112                         return;
1113
1114                 case '.':
1115                         MAYBE_PROLOG
1116                                 DIGITS
1117                                         put_back(c);
1118                                         c = '.';
1119                                         parse_number();
1120                                         return;
1121
1122                                 case '.':
1123                                         MAYBE_PROLOG
1124                                         MAYBE('.', T_DOTDOTDOT)
1125                                         ELSE_CODE(
1126                                                 put_back(c);
1127                                                 c = '.';
1128                                                 lexer_token.kind = '.';
1129                                         )
1130                         ELSE('.')
1131                 case '&':
1132                         MAYBE_PROLOG
1133                         MAYBE('&', T_ANDAND)
1134                         MAYBE('=', T_ANDEQUAL)
1135                         ELSE('&')
1136                 case '*':
1137                         MAYBE_PROLOG
1138                         MAYBE('=', T_ASTERISKEQUAL)
1139                         ELSE('*')
1140                 case '+':
1141                         MAYBE_PROLOG
1142                         MAYBE('+', T_PLUSPLUS)
1143                         MAYBE('=', T_PLUSEQUAL)
1144                         ELSE('+')
1145                 case '-':
1146                         MAYBE_PROLOG
1147                         MAYBE('>', T_MINUSGREATER)
1148                         MAYBE('-', T_MINUSMINUS)
1149                         MAYBE('=', T_MINUSEQUAL)
1150                         ELSE('-')
1151                 case '!':
1152                         MAYBE_PROLOG
1153                         MAYBE('=', T_EXCLAMATIONMARKEQUAL)
1154                         ELSE('!')
1155                 case '/':
1156                         MAYBE_PROLOG
1157                         MAYBE('=', T_SLASHEQUAL)
1158                                 case '*':
1159                                         next_char();
1160                                         skip_multiline_comment();
1161                                         lexer_next_preprocessing_token();
1162                                         return;
1163                                 case '/':
1164                                         next_char();
1165                                         skip_line_comment();
1166                                         lexer_next_preprocessing_token();
1167                                         return;
1168                         ELSE('/')
1169                 case '%':
1170                         MAYBE_PROLOG
1171                         MAYBE('>', '}')
1172                         MAYBE('=', T_PERCENTEQUAL)
1173                                 case ':':
1174                                         MAYBE_PROLOG
1175                                                 case '%':
1176                                                         MAYBE_PROLOG
1177                                                         MAYBE(':', T_HASHHASH)
1178                                                         ELSE_CODE(
1179                                                                 put_back(c);
1180                                                                 c = '%';
1181                                                                 lexer_token.kind = '#';
1182                                                         )
1183                                         ELSE('#')
1184                         ELSE('%')
1185                 case '<':
1186                         MAYBE_PROLOG
1187                         MAYBE(':', '[')
1188                         MAYBE('%', '{')
1189                         MAYBE('=', T_LESSEQUAL)
1190                                 case '<':
1191                                         MAYBE_PROLOG
1192                                         MAYBE('=', T_LESSLESSEQUAL)
1193                                         ELSE(T_LESSLESS)
1194                         ELSE('<')
1195                 case '>':
1196                         MAYBE_PROLOG
1197                         MAYBE('=', T_GREATEREQUAL)
1198                                 case '>':
1199                                         MAYBE_PROLOG
1200                                         MAYBE('=', T_GREATERGREATEREQUAL)
1201                                         ELSE(T_GREATERGREATER)
1202                         ELSE('>')
1203                 case '^':
1204                         MAYBE_PROLOG
1205                         MAYBE('=', T_CARETEQUAL)
1206                         ELSE('^')
1207                 case '|':
1208                         MAYBE_PROLOG
1209                         MAYBE('=', T_PIPEEQUAL)
1210                         MAYBE('|', T_PIPEPIPE)
1211                         ELSE('|')
1212                 case ':':
1213                         MAYBE_PROLOG
1214                         MAYBE('>', ']')
1215                         MAYBE_MODE(':', T_COLONCOLON, _CXX)
1216                         ELSE(':')
1217                 case '=':
1218                         MAYBE_PROLOG
1219                         MAYBE('=', T_EQUALEQUAL)
1220                         ELSE('=')
1221                 case '#':
1222                         MAYBE_PROLOG
1223                         MAYBE('#', T_HASHHASH)
1224                         ELSE('#')
1225
1226                 case '?':
1227                 case '[':
1228                 case ']':
1229                 case '(':
1230                 case ')':
1231                 case '{':
1232                 case '}':
1233                 case '~':
1234                 case ';':
1235                 case ',':
1236                 case '\\':
1237                         lexer_token.kind = c;
1238                         next_char();
1239                         return;
1240
1241                 case EOF:
1242                         lexer_token.kind = T_EOF;
1243                         return;
1244
1245                 default:
1246 dollar_sign:
1247                         errorf(&lexer_pos, "unknown character '%c' found", c);
1248                         next_char();
1249                         lexer_token.kind = T_ERROR;
1250                         return;
1251                 }
1252         }
1253 }
1254
1255 void lexer_next_token(void)
1256 {
1257         lexer_next_preprocessing_token();
1258
1259         while (lexer_token.kind == '\n') {
1260 newline_found:
1261                 lexer_next_preprocessing_token();
1262         }
1263
1264         if (lexer_token.kind == '#') {
1265                 parse_preprocessor_directive();
1266                 goto newline_found;
1267         }
1268 }
1269
1270 void init_lexer(void)
1271 {
1272         strset_init(&stringset);
1273         symbol_L = symbol_table_insert("L");
1274 }
1275
1276 static void input_error(unsigned delta_lines, unsigned delta_cols,
1277                         const char *message)
1278 {
1279         lexer_pos.lineno += delta_lines;
1280         lexer_pos.colno  += delta_cols;
1281         errorf(&lexer_pos, "%s", message);
1282 }
1283
1284 void lexer_switch_input(input_t *new_input, const char *input_name)
1285 {
1286         lexer_pos.lineno     = 0;
1287         lexer_pos.colno      = 0;
1288         lexer_pos.input_name = input_name;
1289
1290         set_input_error_callback(input_error);
1291         input  = new_input;
1292         bufpos = NULL;
1293         bufend = NULL;
1294
1295         /* place a virtual \n at the beginning so the lexer knows that we're
1296          * at the beginning of a line */
1297         c = '\n';
1298 }
1299
1300 void exit_lexer(void)
1301 {
1302         strset_destroy(&stringset);
1303 }
1304
1305 static __attribute__((unused))
1306 void dbg_pos(const source_position_t source_position)
1307 {
1308         fprintf(stdout, "%s:%u:%u\n", source_position.input_name,
1309                 source_position.lineno, source_position.colno);
1310         fflush(stdout);
1311 }