src/glsl/glcpp/glcpp-parse.y

   1 %{
   2 /*
   3  * Copyright © 2010 Intel Corporation
   4  *
   5  * Permission is hereby granted, free of charge, to any person obtaining a
   6  * copy of this software and associated documentation files (the "Software"),
   7  * to deal in the Software without restriction, including without limitation
   8  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   9  * and/or sell copies of the Software, and to permit persons to whom the
  10  * Software is furnished to do so, subject to the following conditions:
  11  *
  12  * The above copyright notice and this permission notice (including the next
  13  * paragraph) shall be included in all copies or substantial portions of the
  14  * Software.
  15  *
  16  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  19  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  21  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  22  * DEALINGS IN THE SOFTWARE.
  23  */
  24
  25 #include <stdio.h>
  26 #include <stdlib.h>
  27 #include <assert.h>
  28 #include <inttypes.h>
  29
  30 #include "glcpp.h"
  31 #include "main/mtypes.h"
  32
  33 #define glcpp_print(stream, str) stream = talloc_strdup_append(stream, str)
  34 #define glcpp_printf(stream, fmt, args...) \
  35         stream = talloc_asprintf_append(stream, fmt, args)
  36
  37 static void
  38 yyerror (YYLTYPE *locp, glcpp_parser_t *parser, const char *error);
  39
  40 static void
  41 _define_object_macro (glcpp_parser_t *parser,
  42                       YYLTYPE *loc,
  43                       const char *macro,
  44                       token_list_t *replacements);
  45
  46 static void
  47 _define_function_macro (glcpp_parser_t *parser,
  48                         YYLTYPE *loc,
  49                         const char *macro,
  50                         string_list_t *parameters,
  51                         token_list_t *replacements);
  52
  53 static string_list_t *
  54 _string_list_create (void *ctx);
  55
  56 static void
  57 _string_list_append_item (string_list_t *list, const char *str);
  58
  59 static int
  60 _string_list_contains (string_list_t *list, const char *member, int *index);
  61
  62 static int
  63 _string_list_length (string_list_t *list);
  64
  65 static argument_list_t *
  66 _argument_list_create (void *ctx);
  67
  68 static void
  69 _argument_list_append (argument_list_t *list, token_list_t *argument);
  70
  71 static int
  72 _argument_list_length (argument_list_t *list);
  73
  74 static token_list_t *
  75 _argument_list_member_at (argument_list_t *list, int index);
  76
  77 /* Note: This function talloc_steal()s the str pointer. */
  78 static token_t *
  79 _token_create_str (void *ctx, int type, char *str);
  80
  81 static token_t *
  82 _token_create_ival (void *ctx, int type, int ival);
  83
  84 static token_list_t *
  85 _token_list_create (void *ctx);
  86
  87 /* Note: This function adds a talloc_reference() to token.
  88  *
  89  * You may want to talloc_unlink any current reference if you no
  90  * longer need it. */
  91 static void
  92 _token_list_append (token_list_t *list, token_t *token);
  93
  94 static void
  95 _token_list_append_list (token_list_t *list, token_list_t *tail);
  96
  97 static active_list_t *
  98 _active_list_push (active_list_t *list,
  99                    const char *identifier,
 100                    token_node_t *marker);
 101
 102 static active_list_t *
 103 _active_list_pop (active_list_t *list);
 104
 105 int
 106 _active_list_contains (active_list_t *list, const char *identifier);
 107
 108 static void
 109 _glcpp_parser_expand_token_list (glcpp_parser_t *parser,
 110                                  token_list_t *list);
 111
 112 static void
 113 _glcpp_parser_print_expanded_token_list (glcpp_parser_t *parser,
 114                                          token_list_t *list);
 115
 116 static void
 117 _glcpp_parser_skip_stack_push_if (glcpp_parser_t *parser, YYLTYPE *loc,
 118                                   int condition);
 119
 120 static void
 121 _glcpp_parser_skip_stack_change_if (glcpp_parser_t *parser, YYLTYPE *loc,
 122                                     const char *type, int condition);
 123
 124 static void
 125 _glcpp_parser_skip_stack_pop (glcpp_parser_t *parser, YYLTYPE *loc);
 126
 127 #define yylex glcpp_parser_lex
 128
 129 static int
 130 glcpp_parser_lex (YYSTYPE *yylval, YYLTYPE *yylloc, glcpp_parser_t *parser);
 131
 132 static void
 133 glcpp_parser_lex_from (glcpp_parser_t *parser, token_list_t *list);
 134
 135 %}
 136
 137 %pure-parser
 138 %error-verbose
 139 %locations
 140
 141 %parse-param {glcpp_parser_t *parser}
 142 %lex-param {glcpp_parser_t *parser}
 143
 144 %token COMMA_FINAL DEFINED ELIF_EXPANDED HASH HASH_DEFINE_FUNC HASH_DEFINE_OBJ HASH_ELIF HASH_ELSE HASH_ENDIF HASH_IF HASH_IFDEF HASH_IFNDEF HASH_UNDEF IDENTIFIER IF_EXPANDED INTEGER INTEGER_STRING NEWLINE OTHER PLACEHOLDER SPACE
 145 %token PASTE
 146 %type <ival> expression INTEGER operator SPACE
 147 %type <str> IDENTIFIER INTEGER_STRING OTHER
 148 %type <string_list> identifier_list
 149 %type <token> preprocessing_token conditional_token
 150 %type <token_list> pp_tokens replacement_list text_line conditional_tokens
 151 %left OR
 152 %left AND
 153 %left '|'
 154 %left '^'
 155 %left '&'
 156 %left EQUAL NOT_EQUAL
 157 %left '<' '>' LESS_OR_EQUAL GREATER_OR_EQUAL
 158 %left LEFT_SHIFT RIGHT_SHIFT
 159 %left '+' '-'
 160 %left '*' '/' '%'
 161 %right UNARY
 162
 163 %%
 164
 165 input:
 166         /* empty */
 167 |       input line
 168 ;
 169
 170 line:
 171         control_line {
 172                 glcpp_print(parser->output, "\n");
 173         }
 174 |       text_line {
 175                 _glcpp_parser_print_expanded_token_list (parser, $1);
 176                 glcpp_print(parser->output, "\n");
 177                 talloc_free ($1);
 178         }
 179 |       expanded_line
 180 |       HASH non_directive
 181 ;
 182
 183 expanded_line:
 184         IF_EXPANDED expression NEWLINE {
 185                 _glcpp_parser_skip_stack_push_if (parser, & @1, $2);
 186         }
 187 |       ELIF_EXPANDED expression NEWLINE {
 188                 _glcpp_parser_skip_stack_change_if (parser, & @1, "elif", $2);
 189         }
 190 ;
 191
 192 control_line:
 193         HASH_DEFINE_OBJ IDENTIFIER replacement_list NEWLINE {
 194                 _define_object_macro (parser, & @2, $2, $3);
 195         }
 196 |       HASH_DEFINE_FUNC IDENTIFIER '(' ')' replacement_list NEWLINE {
 197                 _define_function_macro (parser, & @2, $2, NULL, $5);
 198         }
 199 |       HASH_DEFINE_FUNC IDENTIFIER '(' identifier_list ')' replacement_list NEWLINE {
 200                 _define_function_macro (parser, & @2, $2, $4, $6);
 201         }
 202 |       HASH_UNDEF IDENTIFIER NEWLINE {
 203                 macro_t *macro = hash_table_find (parser->defines, $2);
 204                 if (macro) {
 205                         hash_table_remove (parser->defines, $2);
 206                         talloc_free (macro);
 207                 }
 208                 talloc_free ($2);
 209         }
 210 |       HASH_IF conditional_tokens NEWLINE {
 211                 token_list_t *expanded;
 212                 token_t *token;
 213
 214                 expanded = _token_list_create (parser);
 215                 token = _token_create_ival (parser, IF_EXPANDED, IF_EXPANDED);
 216                 _token_list_append (expanded, token);
 217                 talloc_unlink (parser, token);
 218                 _glcpp_parser_expand_token_list (parser, $2);
 219                 _token_list_append_list (expanded, $2);
 220                 glcpp_parser_lex_from (parser, expanded);
 221         }
 222 |       HASH_IFDEF IDENTIFIER junk NEWLINE {
 223                 macro_t *macro = hash_table_find (parser->defines, $2);
 224                 talloc_free ($2);
 225                 _glcpp_parser_skip_stack_push_if (parser, & @1, macro != NULL);
 226         }
 227 |       HASH_IFNDEF IDENTIFIER junk NEWLINE {
 228                 macro_t *macro = hash_table_find (parser->defines, $2);
 229                 talloc_free ($2);
 230                 _glcpp_parser_skip_stack_push_if (parser, & @1, macro == NULL);
 231         }
 232 |       HASH_ELIF conditional_tokens NEWLINE {
 233                 token_list_t *expanded;
 234                 token_t *token;
 235
 236                 expanded = _token_list_create (parser);
 237                 token = _token_create_ival (parser, ELIF_EXPANDED, ELIF_EXPANDED);
 238                 _token_list_append (expanded, token);
 239                 talloc_unlink (parser, token);
 240                 _glcpp_parser_expand_token_list (parser, $2);
 241                 _token_list_append_list (expanded, $2);
 242                 glcpp_parser_lex_from (parser, expanded);
 243         }
 244 |       HASH_ELIF NEWLINE {
 245                 /* #elif without an expression results in a warning if the
 246                  * condition doesn't matter (we just handled #if 1 or such)
 247                  * but an error otherwise. */
 248                 if (parser->skip_stack != NULL && parser->skip_stack->type == SKIP_NO_SKIP) {
 249                         parser->skip_stack->type = SKIP_TO_ENDIF;
 250                         glcpp_warning(& @1, parser, "ignoring illegal #elif without expression");
 251                 } else {
 252                         glcpp_error(& @1, parser, "#elif needs an expression");
 253                 }
 254         }
 255 |       HASH_ELSE NEWLINE {
 256                 _glcpp_parser_skip_stack_change_if (parser, & @1, "else", 1);
 257         }
 258 |       HASH_ENDIF NEWLINE {
 259                 _glcpp_parser_skip_stack_pop (parser, & @1);
 260         }
 261 |       HASH NEWLINE
 262 ;
 263
 264 expression:
 265         INTEGER_STRING {
 266                 if (strlen ($1) >= 3 && strncmp ($1, "0x", 2) == 0) {
 267                         $$ = strtoll ($1 + 2, NULL, 16);
 268                 } else if ($1[0] == '0') {
 269                         $$ = strtoll ($1, NULL, 8);
 270                 } else {
 271                         $$ = strtoll ($1, NULL, 10);
 272                 }
 273         }
 274 |       INTEGER {
 275                 $$ = $1;
 276         }
 277 |       expression OR expression {
 278                 $$ = $1 || $3;
 279         }
 280 |       expression AND expression {
 281                 $$ = $1 && $3;
 282         }
 283 |       expression '|' expression {
 284                 $$ = $1 | $3;
 285         }
 286 |       expression '^' expression {
 287                 $$ = $1 ^ $3;
 288         }
 289 |       expression '&' expression {
 290                 $$ = $1 & $3;
 291         }
 292 |       expression NOT_EQUAL expression {
 293                 $$ = $1 != $3;
 294         }
 295 |       expression EQUAL expression {
 296                 $$ = $1 == $3;
 297         }
 298 |       expression GREATER_OR_EQUAL expression {
 299                 $$ = $1 >= $3;
 300         }
 301 |       expression LESS_OR_EQUAL expression {
 302                 $$ = $1 <= $3;
 303         }
 304 |       expression '>' expression {
 305                 $$ = $1 > $3;
 306         }
 307 |       expression '<' expression {
 308                 $$ = $1 < $3;
 309         }
 310 |       expression RIGHT_SHIFT expression {
 311                 $$ = $1 >> $3;
 312         }
 313 |       expression LEFT_SHIFT expression {
 314                 $$ = $1 << $3;
 315         }
 316 |       expression '-' expression {
 317                 $$ = $1 - $3;
 318         }
 319 |       expression '+' expression {
 320                 $$ = $1 + $3;
 321         }
 322 |       expression '%' expression {
 323                 $$ = $1 % $3;
 324         }
 325 |       expression '/' expression {
 326                 $$ = $1 / $3;
 327         }
 328 |       expression '*' expression {
 329                 $$ = $1 * $3;
 330         }
 331 |       '!' expression %prec UNARY {
 332                 $$ = ! $2;
 333         }
 334 |       '~' expression %prec UNARY {
 335                 $$ = ~ $2;
 336         }
 337 |       '-' expression %prec UNARY {
 338                 $$ = - $2;
 339         }
 340 |       '+' expression %prec UNARY {
 341                 $$ = + $2;
 342         }
 343 |       '(' expression ')' {
 344                 $$ = $2;
 345         }
 346 ;
 347
 348 identifier_list:
 349         IDENTIFIER {
 350                 $$ = _string_list_create (parser);
 351                 _string_list_append_item ($$, $1);
 352                 talloc_steal ($$, $1);
 353         }
 354 |       identifier_list ',' IDENTIFIER {
 355                 $$ = $1;
 356                 _string_list_append_item ($$, $3);
 357                 talloc_steal ($$, $3);
 358         }
 359 ;
 360
 361 text_line:
 362         NEWLINE { $$ = NULL; }
 363 |       pp_tokens NEWLINE
 364 ;
 365
 366 non_directive:
 367         pp_tokens NEWLINE {
 368                 yyerror (& @1, parser, "Invalid tokens after #");
 369         }
 370 ;
 371
 372 replacement_list:
 373         /* empty */ { $$ = NULL; }
 374 |       pp_tokens
 375 ;
 376
 377 junk:
 378         /* empty */
 379 |       pp_tokens {
 380                 glcpp_warning(&@1, parser, "extra tokens at end of directive");
 381         }
 382 ;
 383
 384 conditional_token:
 385         /* Handle "defined" operator */
 386         DEFINED IDENTIFIER {
 387                 int v = hash_table_find (parser->defines, $2) ? 1 : 0;
 388                 $$ = _token_create_ival (parser, INTEGER, v);
 389         }
 390 |       DEFINED '(' IDENTIFIER ')' {
 391                 int v = hash_table_find (parser->defines, $3) ? 1 : 0;
 392                 $$ = _token_create_ival (parser, INTEGER, v);
 393         }
 394 |       preprocessing_token
 395 ;
 396
 397 conditional_tokens:
 398         /* Exactly the same as pp_tokens, but using conditional_token */
 399         conditional_token {
 400                 parser->space_tokens = 1;
 401                 $$ = _token_list_create (parser);
 402                 _token_list_append ($$, $1);
 403                 talloc_unlink (parser, $1);
 404         }
 405 |       conditional_tokens conditional_token {
 406                 $$ = $1;
 407                 _token_list_append ($$, $2);
 408                 talloc_unlink (parser, $2);
 409         }
 410 ;
 411
 412 pp_tokens:
 413         preprocessing_token {
 414                 parser->space_tokens = 1;
 415                 $$ = _token_list_create (parser);
 416                 _token_list_append ($$, $1);
 417                 talloc_unlink (parser, $1);
 418         }
 419 |       pp_tokens preprocessing_token {
 420                 $$ = $1;
 421                 _token_list_append ($$, $2);
 422                 talloc_unlink (parser, $2);
 423         }
 424 ;
 425
 426 preprocessing_token:
 427         IDENTIFIER {
 428                 $$ = _token_create_str (parser, IDENTIFIER, $1);
 429                 $$->location = yylloc;
 430         }
 431 |       INTEGER_STRING {
 432                 $$ = _token_create_str (parser, INTEGER_STRING, $1);
 433                 $$->location = yylloc;
 434         }
 435 |       operator {
 436                 $$ = _token_create_ival (parser, $1, $1);
 437                 $$->location = yylloc;
 438         }
 439 |       OTHER {
 440                 $$ = _token_create_str (parser, OTHER, $1);
 441                 $$->location = yylloc;
 442         }
 443 |       SPACE {
 444                 $$ = _token_create_ival (parser, SPACE, SPACE);
 445                 $$->location = yylloc;
 446         }
 447 ;
 448
 449 operator:
 450         '['                     { $$ = '['; }
 451 |       ']'                     { $$ = ']'; }
 452 |       '('                     { $$ = '('; }
 453 |       ')'                     { $$ = ')'; }
 454 |       '{'                     { $$ = '{'; }
 455 |       '}'                     { $$ = '}'; }
 456 |       '.'                     { $$ = '.'; }
 457 |       '&'                     { $$ = '&'; }
 458 |       '*'                     { $$ = '*'; }
 459 |       '+'                     { $$ = '+'; }
 460 |       '-'                     { $$ = '-'; }
 461 |       '~'                     { $$ = '~'; }
 462 |       '!'                     { $$ = '!'; }
 463 |       '/'                     { $$ = '/'; }
 464 |       '%'                     { $$ = '%'; }
 465 |       LEFT_SHIFT              { $$ = LEFT_SHIFT; }
 466 |       RIGHT_SHIFT             { $$ = RIGHT_SHIFT; }
 467 |       '<'                     { $$ = '<'; }
 468 |       '>'                     { $$ = '>'; }
 469 |       LESS_OR_EQUAL           { $$ = LESS_OR_EQUAL; }
 470 |       GREATER_OR_EQUAL        { $$ = GREATER_OR_EQUAL; }
 471 |       EQUAL                   { $$ = EQUAL; }
 472 |       NOT_EQUAL               { $$ = NOT_EQUAL; }
 473 |       '^'                     { $$ = '^'; }
 474 |       '|'                     { $$ = '|'; }
 475 |       AND                     { $$ = AND; }
 476 |       OR                      { $$ = OR; }
 477 |       ';'                     { $$ = ';'; }
 478 |       ','                     { $$ = ','; }
 479 |       '='                     { $$ = '='; }
 480 |       PASTE                   { $$ = PASTE; }
 481 ;
 482
 483 %%
 484
 485 string_list_t *
 486 _string_list_create (void *ctx)
 487 {
 488         string_list_t *list;
 489
 490         list = xtalloc (ctx, string_list_t);
 491         list->head = NULL;
 492         list->tail = NULL;
 493
 494         return list;
 495 }
 496
 497 void
 498 _string_list_append_item (string_list_t *list, const char *str)
 499 {
 500         string_node_t *node;
 501
 502         node = xtalloc (list, string_node_t);
 503         node->str = xtalloc_strdup (node, str);
 504
 505         node->next = NULL;
 506
 507         if (list->head == NULL) {
 508                 list->head = node;
 509         } else {
 510                 list->tail->next = node;
 511         }
 512
 513         list->tail = node;
 514 }
 515
 516 int
 517 _string_list_contains (string_list_t *list, const char *member, int *index)
 518 {
 519         string_node_t *node;
 520         int i;
 521
 522         if (list == NULL)
 523                 return 0;
 524
 525         for (i = 0, node = list->head; node; i++, node = node->next) {
 526                 if (strcmp (node->str, member) == 0) {
 527                         if (index)
 528                                 *index = i;
 529                         return 1;
 530                 }
 531         }
 532
 533         return 0;
 534 }
 535
 536 int
 537 _string_list_length (string_list_t *list)
 538 {
 539         int length = 0;
 540         string_node_t *node;
 541
 542         if (list == NULL)
 543                 return 0;
 544
 545         for (node = list->head; node; node = node->next)
 546                 length++;
 547
 548         return length;
 549 }
 550
 551 argument_list_t *
 552 _argument_list_create (void *ctx)
 553 {
 554         argument_list_t *list;
 555
 556         list = xtalloc (ctx, argument_list_t);
 557         list->head = NULL;
 558         list->tail = NULL;
 559
 560         return list;
 561 }
 562
 563 void
 564 _argument_list_append (argument_list_t *list, token_list_t *argument)
 565 {
 566         argument_node_t *node;
 567
 568         node = xtalloc (list, argument_node_t);
 569         node->argument = argument;
 570
 571         node->next = NULL;
 572
 573         if (list->head == NULL) {
 574                 list->head = node;
 575         } else {
 576                 list->tail->next = node;
 577         }
 578
 579         list->tail = node;
 580 }
 581
 582 int
 583 _argument_list_length (argument_list_t *list)
 584 {
 585         int length = 0;
 586         argument_node_t *node;
 587
 588         if (list == NULL)
 589                 return 0;
 590
 591         for (node = list->head; node; node = node->next)
 592                 length++;
 593
 594         return length;
 595 }
 596
 597 token_list_t *
 598 _argument_list_member_at (argument_list_t *list, int index)
 599 {
 600         argument_node_t *node;
 601         int i;
 602
 603         if (list == NULL)
 604                 return NULL;
 605
 606         node = list->head;
 607         for (i = 0; i < index; i++) {
 608                 node = node->next;
 609                 if (node == NULL)
 610                         break;
 611         }
 612
 613         if (node)
 614                 return node->argument;
 615
 616         return NULL;
 617 }
 618
 619 /* Note: This function talloc_steal()s the str pointer. */
 620 token_t *
 621 _token_create_str (void *ctx, int type, char *str)
 622 {
 623         token_t *token;
 624
 625         token = xtalloc (ctx, token_t);
 626         token->type = type;
 627         token->value.str = talloc_steal (token, str);
 628
 629         return token;
 630 }
 631
 632 token_t *
 633 _token_create_ival (void *ctx, int type, int ival)
 634 {
 635         token_t *token;
 636
 637         token = xtalloc (ctx, token_t);
 638         token->type = type;
 639         token->value.ival = ival;
 640
 641         return token;
 642 }
 643
 644 token_list_t *
 645 _token_list_create (void *ctx)
 646 {
 647         token_list_t *list;
 648
 649         list = xtalloc (ctx, token_list_t);
 650         list->head = NULL;
 651         list->tail = NULL;
 652         list->non_space_tail = NULL;
 653
 654         return list;
 655 }
 656
 657 void
 658 _token_list_append (token_list_t *list, token_t *token)
 659 {
 660         token_node_t *node;
 661
 662         node = xtalloc (list, token_node_t);
 663         node->token = xtalloc_reference (list, token);
 664
 665         node->next = NULL;
 666
 667         if (list->head == NULL) {
 668                 list->head = node;
 669         } else {
 670                 list->tail->next = node;
 671         }
 672
 673         list->tail = node;
 674         if (token->type != SPACE)
 675                 list->non_space_tail = node;
 676 }
 677
 678 void
 679 _token_list_append_list (token_list_t *list, token_list_t *tail)
 680 {
 681         if (tail == NULL || tail->head == NULL)
 682                 return;
 683
 684         if (list->head == NULL) {
 685                 list->head = tail->head;
 686         } else {
 687                 list->tail->next = tail->head;
 688         }
 689
 690         list->tail = tail->tail;
 691         list->non_space_tail = tail->non_space_tail;
 692 }
 693
 694 static token_list_t *
 695 _token_list_copy (void *ctx, token_list_t *other)
 696 {
 697         token_list_t *copy;
 698         token_node_t *node;
 699
 700         if (other == NULL)
 701                 return NULL;
 702
 703         copy = _token_list_create (ctx);
 704         for (node = other->head; node; node = node->next)
 705                 _token_list_append (copy, node->token);
 706
 707         return copy;
 708 }
 709
 710 static void
 711 _token_list_trim_trailing_space (token_list_t *list)
 712 {
 713         token_node_t *tail, *next;
 714
 715         if (list->non_space_tail) {
 716                 tail = list->non_space_tail->next;
 717                 list->non_space_tail->next = NULL;
 718                 list->tail = list->non_space_tail;
 719
 720                 while (tail) {
 721                         next = tail->next;
 722                         talloc_free (tail);
 723                         tail = next;
 724                 }
 725         }
 726 }
 727
 728 static void
 729 _token_print (char **out, token_t *token)
 730 {
 731         if (token->type < 256) {
 732                 glcpp_printf (*out, "%c", token->type);
 733                 return;
 734         }
 735
 736         switch (token->type) {
 737         case INTEGER:
 738                 glcpp_printf (*out, "%" PRIxMAX, token->value.ival);
 739                 break;
 740         case IDENTIFIER:
 741         case INTEGER_STRING:
 742         case OTHER:
 743                 glcpp_print (*out, token->value.str);
 744                 break;
 745         case SPACE:
 746                 glcpp_print (*out, " ");
 747                 break;
 748         case LEFT_SHIFT:
 749                 glcpp_print (*out, "<<");
 750                 break;
 751         case RIGHT_SHIFT:
 752                 glcpp_print (*out, ">>");
 753                 break;
 754         case LESS_OR_EQUAL:
 755                 glcpp_print (*out, "<=");
 756                 break;
 757         case GREATER_OR_EQUAL:
 758                 glcpp_print (*out, ">=");
 759                 break;
 760         case EQUAL:
 761                 glcpp_print (*out, "==");
 762                 break;
 763         case NOT_EQUAL:
 764                 glcpp_print (*out, "!=");
 765                 break;
 766         case AND:
 767                 glcpp_print (*out, "&&");
 768                 break;
 769         case OR:
 770                 glcpp_print (*out, "||");
 771                 break;
 772         case PASTE:
 773                 glcpp_print (*out, "##");
 774                 break;
 775         case COMMA_FINAL:
 776                 glcpp_print (*out, ",");
 777                 break;
 778         case PLACEHOLDER:
 779                 /* Nothing to print. */
 780                 break;
 781         default:
 782                 assert(!"Error: Don't know how to print token.");
 783                 break;
 784         }
 785 }
 786
 787 /* Return a new token (talloc()ed off of 'token') formed by pasting
 788  * 'token' and 'other'. Note that this function may return 'token' or
 789  * 'other' directly rather than allocating anything new.
 790  *
 791  * Caution: Only very cursory error-checking is performed to see if
 792  * the final result is a valid single token. */
 793 static token_t *
 794 _token_paste (glcpp_parser_t *parser, token_t *token, token_t *other)
 795 {
 796         token_t *combined = NULL;
 797
 798         /* Pasting a placeholder onto anything makes no change. */
 799         if (other->type == PLACEHOLDER)
 800                 return token;
 801
 802         /* When 'token' is a placeholder, just return 'other'. */
 803         if (token->type == PLACEHOLDER)
 804                 return other;
 805
 806         /* A very few single-character punctuators can be combined
 807          * with another to form a multi-character punctuator. */
 808         switch (token->type) {
 809         case '<':
 810                 if (other->type == '<')
 811                         combined = _token_create_ival (token, LEFT_SHIFT, LEFT_SHIFT);
 812                 else if (other->type == '=')
 813                         combined = _token_create_ival (token, LESS_OR_EQUAL, LESS_OR_EQUAL);
 814                 break;
 815         case '>':
 816                 if (other->type == '>')
 817                         combined = _token_create_ival (token, RIGHT_SHIFT, RIGHT_SHIFT);
 818                 else if (other->type == '=')
 819                         combined = _token_create_ival (token, GREATER_OR_EQUAL, GREATER_OR_EQUAL);
 820                 break;
 821         case '=':
 822                 if (other->type == '=')
 823                         combined = _token_create_ival (token, EQUAL, EQUAL);
 824                 break;
 825         case '!':
 826                 if (other->type == '=')
 827                         combined = _token_create_ival (token, NOT_EQUAL, NOT_EQUAL);
 828                 break;
 829         case '&':
 830                 if (other->type == '&')
 831                         combined = _token_create_ival (token, AND, AND);
 832                 break;
 833         case '|':
 834                 if (other->type == '|')
 835                         combined = _token_create_ival (token, OR, OR);
 836                 break;
 837         }
 838
 839         if (combined != NULL) {
 840                 /* Inherit the location from the first token */
 841                 combined->location = token->location;
 842                 return combined;
 843         }
 844
 845         /* Two string-valued tokens can usually just be mashed
 846          * together.
 847          *
 848          * XXX: This isn't actually legitimate. Several things here
 849          * should result in a diagnostic since the result cannot be a
 850          * valid, single pre-processing token. For example, pasting
 851          * "123" and "abc" is not legal, but we don't catch that
 852          * here. */
 853         if ((token->type == IDENTIFIER || token->type == OTHER || token->type == INTEGER_STRING) &&
 854             (other->type == IDENTIFIER || other->type == OTHER || other->type == INTEGER_STRING))
 855         {
 856                 char *str;
 857
 858                 str = xtalloc_asprintf (token, "%s%s",
 859                                         token->value.str, other->value.str);
 860                 combined = _token_create_str (token, token->type, str);
 861                 combined->location = token->location;
 862                 return combined;
 863         }
 864
 865         glcpp_error (&token->location, parser, "");
 866         glcpp_print (parser->info_log, "Pasting \"");
 867         _token_print (&parser->info_log, token);
 868         glcpp_print (parser->info_log, "\" and \"");
 869         _token_print (&parser->info_log, other);
 870         glcpp_print (parser->info_log, "\" does not give a valid preprocessing token.\n");
 871
 872         return token;
 873 }
 874
 875 static void
 876 _token_list_print (glcpp_parser_t *parser, token_list_t *list)
 877 {
 878         token_node_t *node;
 879
 880         if (list == NULL)
 881                 return;
 882
 883         for (node = list->head; node; node = node->next)
 884                 _token_print (&parser->output, node->token);
 885 }
 886
 887 void
 888 yyerror (YYLTYPE *locp, glcpp_parser_t *parser, const char *error)
 889 {
 890         glcpp_error(locp, parser, "%s", error);
 891 }
 892
 893 glcpp_parser_t *
 894 glcpp_parser_create (const struct gl_extensions *extensions)
 895 {
 896         glcpp_parser_t *parser;
 897         token_t *tok;
 898         token_list_t *list;
 899
 900         parser = xtalloc (NULL, glcpp_parser_t);
 901
 902         glcpp_lex_init_extra (parser, &parser->scanner);
 903         parser->defines = hash_table_ctor (32, hash_table_string_hash,
 904                                            hash_table_string_compare);
 905         parser->active = NULL;
 906         parser->lexing_if = 0;
 907         parser->space_tokens = 1;
 908         parser->newline_as_space = 0;
 909         parser->in_control_line = 0;
 910         parser->paren_count = 0;
 911
 912         parser->skip_stack = NULL;
 913
 914         parser->lex_from_list = NULL;
 915         parser->lex_from_node = NULL;
 916
 917         parser->output = talloc_strdup(parser, "");
 918         parser->info_log = talloc_strdup(parser, "");
 919         parser->error = 0;
 920
 921         /* Add pre-defined macros. */
 922         tok = _token_create_ival (parser, INTEGER, 1);
 923
 924         list = _token_list_create(parser);
 925         _token_list_append(list, tok);
 926         _define_object_macro(parser, NULL, "GL_ARB_draw_buffers", list);
 927
 928         list = _token_list_create(parser);
 929         _token_list_append(list, tok);
 930         _define_object_macro(parser, NULL, "GL_ARB_texture_rectangle", list);
 931
 932         if ((extensions != NULL) && extensions->EXT_texture_array) {
 933                 list = _token_list_create(parser);
 934                 _token_list_append(list, tok);
 935                 _define_object_macro(parser, NULL,
 936                                      "GL_EXT_texture_array", list);
 937         }
 938
 939         talloc_unlink(parser, tok);
 940
 941         return parser;
 942 }
 943
 944 int
 945 glcpp_parser_parse (glcpp_parser_t *parser)
 946 {
 947         return yyparse (parser);
 948 }
 949
 950 void
 951 glcpp_parser_destroy (glcpp_parser_t *parser)
 952 {
 953         if (parser->skip_stack)
 954                 glcpp_error (&parser->skip_stack->loc, parser, "Unterminated #if\n");
 955         glcpp_lex_destroy (parser->scanner);
 956         hash_table_dtor (parser->defines);
 957         talloc_free (parser);
 958 }
 959
 960 typedef enum function_status
 961 {
 962         FUNCTION_STATUS_SUCCESS,
 963         FUNCTION_NOT_A_FUNCTION,
 964         FUNCTION_UNBALANCED_PARENTHESES
 965 } function_status_t;
 966
 967 /* Find a set of function-like macro arguments by looking for a
 968  * balanced set of parentheses.
 969  *
 970  * When called, 'node' should be the opening-parenthesis token, (or
 971  * perhaps preceeding SPACE tokens). Upon successful return *last will
 972  * be the last consumed node, (corresponding to the closing right
 973  * parenthesis).
 974  *
 975  * Return values:
 976  *
 977  *   FUNCTION_STATUS_SUCCESS:
 978  *
 979  *      Successfully parsed a set of function arguments.
 980  *
 981  *   FUNCTION_NOT_A_FUNCTION:
 982  *
 983  *      Macro name not followed by a '('. This is not an error, but
 984  *      simply that the macro name should be treated as a non-macro.
 985  *
 986  *   FUNCTION_UNBALANCED_PARENTHESES
 987  *
 988  *      Macro name is not followed by a balanced set of parentheses.
 989  */
 990 static function_status_t
 991 _arguments_parse (argument_list_t *arguments,
 992                   token_node_t *node,
 993                   token_node_t **last)
 994 {
 995         token_list_t *argument;
 996         int paren_count;
 997
 998         node = node->next;
 999
1000         /* Ignore whitespace before first parenthesis. */
1001         while (node && node->token->type == SPACE)
1002                 node = node->next;
1003
1004         if (node == NULL || node->token->type != '(')
1005                 return FUNCTION_NOT_A_FUNCTION;
1006
1007         node = node->next;
1008
1009         argument = _token_list_create (arguments);
1010         _argument_list_append (arguments, argument);
1011
1012         for (paren_count = 1; node; node = node->next) {
1013                 if (node->token->type == '(')
1014                 {
1015                         paren_count++;
1016                 }
1017                 else if (node->token->type == ')')
1018                 {
1019                         paren_count--;
1020                         if (paren_count == 0)
1021                                 break;
1022                 }
1023
1024                 if (node->token->type == ',' &&
1025                          paren_count == 1)
1026                 {
1027                         _token_list_trim_trailing_space (argument);
1028                         argument = _token_list_create (arguments);
1029                         _argument_list_append (arguments, argument);
1030                 }
1031                 else {
1032                         if (argument->head == NULL) {
1033                                 /* Don't treat initial whitespace as
1034                                  * part of the arguement. */
1035                                 if (node->token->type == SPACE)
1036                                         continue;
1037                         }
1038                         _token_list_append (argument, node->token);
1039                 }
1040         }
1041
1042         if (paren_count)
1043                 return FUNCTION_UNBALANCED_PARENTHESES;
1044
1045         *last = node;
1046
1047         return FUNCTION_STATUS_SUCCESS;
1048 }
1049
1050 static token_list_t *
1051 _token_list_create_with_one_space (void *ctx)
1052 {
1053         token_list_t *list;
1054         token_t *space;
1055
1056         list = _token_list_create (ctx);
1057         space = _token_create_ival (list, SPACE, SPACE);
1058         _token_list_append (list, space);
1059
1060         return list;
1061 }
1062
1063 /* This is a helper function that's essentially part of the
1064  * implementation of _glcpp_parser_expand_node. It shouldn't be called
1065  * except for by that function.
1066  *
1067  * Returns NULL if node is a simple token with no expansion, (that is,
1068  * although 'node' corresponds to an identifier defined as a
1069  * function-like macro, it is not followed with a parenthesized
1070  * argument list).
1071  *
1072  * Compute the complete expansion of node (which is a function-like
1073  * macro) and subsequent nodes which are arguments.
1074  *
1075  * Returns the token list that results from the expansion and sets
1076  * *last to the last node in the list that was consumed by the
1077  * expansion. Specifically, *last will be set as follows: as the
1078  * token of the closing right parenthesis.
1079  */
1080 static token_list_t *
1081 _glcpp_parser_expand_function (glcpp_parser_t *parser,
1082                                token_node_t *node,
1083                                token_node_t **last)
1084
1085 {
1086         macro_t *macro;
1087         const char *identifier;
1088         argument_list_t *arguments;
1089         function_status_t status;
1090         token_list_t *substituted;
1091         int parameter_index;
1092
1093         identifier = node->token->value.str;
1094
1095         macro = hash_table_find (parser->defines, identifier);
1096
1097         assert (macro->is_function);
1098
1099         arguments = _argument_list_create (parser);
1100         status = _arguments_parse (arguments, node, last);
1101
1102         switch (status) {
1103         case FUNCTION_STATUS_SUCCESS:
1104                 break;
1105         case FUNCTION_NOT_A_FUNCTION:
1106                 return NULL;
1107         case FUNCTION_UNBALANCED_PARENTHESES:
1108                 glcpp_error (&node->token->location, parser, "Macro %s call has unbalanced parentheses\n", identifier);
1109                 return NULL;
1110         }
1111
1112         /* Replace a macro defined as empty with a SPACE token. */
1113         if (macro->replacements == NULL) {
1114                 talloc_free (arguments);
1115                 return _token_list_create_with_one_space (parser);
1116         }
1117
1118         if (! ((_argument_list_length (arguments) ==
1119                 _string_list_length (macro->parameters)) ||
1120                (_string_list_length (macro->parameters) == 0 &&
1121                 _argument_list_length (arguments) == 1 &&
1122                 arguments->head->argument->head == NULL)))
1123         {
1124                 glcpp_error (&node->token->location, parser,
1125                               "Error: macro %s invoked with %d arguments (expected %d)\n",
1126                               identifier,
1127                               _argument_list_length (arguments),
1128                               _string_list_length (macro->parameters));
1129                 return NULL;
1130         }
1131
1132         /* Perform argument substitution on the replacement list. */
1133         substituted = _token_list_create (arguments);
1134
1135         for (node = macro->replacements->head; node; node = node->next)
1136         {
1137                 if (node->token->type == IDENTIFIER &&
1138                     _string_list_contains (macro->parameters,
1139                                            node->token->value.str,
1140                                            &parameter_index))
1141                 {
1142                         token_list_t *argument;
1143                         argument = _argument_list_member_at (arguments,
1144                                                              parameter_index);
1145                         /* Before substituting, we expand the argument
1146                          * tokens, or append a placeholder token for
1147                          * an empty argument. */
1148                         if (argument->head) {
1149                                 token_list_t *expanded_argument;
1150                                 expanded_argument = _token_list_copy (parser,
1151                                                                       argument);
1152                                 _glcpp_parser_expand_token_list (parser,
1153                                                                  expanded_argument);
1154                                 _token_list_append_list (substituted,
1155                                                          expanded_argument);
1156                         } else {
1157                                 token_t *new_token;
1158
1159                                 new_token = _token_create_ival (substituted,
1160                                                                 PLACEHOLDER,
1161                                                                 PLACEHOLDER);
1162                                 _token_list_append (substituted, new_token);
1163                         }
1164                 } else {
1165                         _token_list_append (substituted, node->token);
1166                 }
1167         }
1168
1169         /* After argument substitution, and before further expansion
1170          * below, implement token pasting. */
1171
1172         _token_list_trim_trailing_space (substituted);
1173
1174         node = substituted->head;
1175         while (node)
1176         {
1177                 token_node_t *next_non_space;
1178
1179                 /* Look ahead for a PASTE token, skipping space. */
1180                 next_non_space = node->next;
1181                 while (next_non_space && next_non_space->token->type == SPACE)
1182                         next_non_space = next_non_space->next;
1183
1184                 if (next_non_space == NULL)
1185                         break;
1186
1187                 if (next_non_space->token->type != PASTE) {
1188                         node = next_non_space;
1189                         continue;
1190                 }
1191
1192                 /* Now find the next non-space token after the PASTE. */
1193                 next_non_space = next_non_space->next;
1194                 while (next_non_space && next_non_space->token->type == SPACE)
1195                         next_non_space = next_non_space->next;
1196
1197                 if (next_non_space == NULL) {
1198                         yyerror (&node->token->location, parser, "'##' cannot appear at either end of a macro expansion\n");
1199                         return NULL;
1200                 }
1201
1202                 node->token = _token_paste (parser, node->token, next_non_space->token);
1203                 node->next = next_non_space->next;
1204                 if (next_non_space == substituted->tail)
1205                         substituted->tail = node;
1206
1207                 node = node->next;
1208         }
1209
1210         substituted->non_space_tail = substituted->tail;
1211
1212         return substituted;
1213 }
1214
1215 /* Compute the complete expansion of node, (and subsequent nodes after
1216  * 'node' in the case that 'node' is a function-like macro and
1217  * subsequent nodes are arguments).
1218  *
1219  * Returns NULL if node is a simple token with no expansion.
1220  *
1221  * Otherwise, returns the token list that results from the expansion
1222  * and sets *last to the last node in the list that was consumed by
1223  * the expansion. Specifically, *last will be set as follows:
1224  *
1225  *      As 'node' in the case of object-like macro expansion.
1226  *
1227  *      As the token of the closing right parenthesis in the case of
1228  *      function-like macro expansion.
1229  */
1230 static token_list_t *
1231 _glcpp_parser_expand_node (glcpp_parser_t *parser,
1232                            token_node_t *node,
1233                            token_node_t **last)
1234 {
1235         token_t *token = node->token;
1236         const char *identifier;
1237         macro_t *macro;
1238
1239         /* We only expand identifiers */
1240         if (token->type != IDENTIFIER) {
1241                 /* We change any COMMA into a COMMA_FINAL to prevent
1242                  * it being mistaken for an argument separator
1243                  * later. */
1244                 if (token->type == ',') {
1245                         token->type = COMMA_FINAL;
1246                         token->value.ival = COMMA_FINAL;
1247                 }
1248
1249                 return NULL;
1250         }
1251
1252         /* Look up this identifier in the hash table. */
1253         identifier = token->value.str;
1254         macro = hash_table_find (parser->defines, identifier);
1255
1256         /* Not a macro, so no expansion needed. */
1257         if (macro == NULL)
1258                 return NULL;
1259
1260         /* Finally, don't expand this macro if we're already actively
1261          * expanding it, (to avoid infinite recursion). */
1262         if (_active_list_contains (parser->active, identifier)) {
1263                 /* We change the token type here from IDENTIFIER to
1264                  * OTHER to prevent any future expansion of this
1265                  * unexpanded token. */
1266                 char *str;
1267                 token_list_t *expansion;
1268                 token_t *final;
1269
1270                 str = xtalloc_strdup (parser, token->value.str);
1271                 final = _token_create_str (parser, OTHER, str);
1272                 expansion = _token_list_create (parser);
1273                 _token_list_append (expansion, final);
1274                 *last = node;
1275                 return expansion;
1276         }
1277
1278         if (! macro->is_function)
1279         {
1280                 *last = node;
1281
1282                 /* Replace a macro defined as empty with a SPACE token. */
1283                 if (macro->replacements == NULL)
1284                         return _token_list_create_with_one_space (parser);
1285
1286                 return _token_list_copy (parser, macro->replacements);
1287         }
1288
1289         return _glcpp_parser_expand_function (parser, node, last);
1290 }
1291
1292 /* Push a new identifier onto the active list, returning the new list.
1293  *
1294  * Here, 'marker' is the token node that appears in the list after the
1295  * expansion of 'identifier'. That is, when the list iterator begins
1296  * examinging 'marker', then it is time to pop this node from the
1297  * active stack.
1298  */
1299 active_list_t *
1300 _active_list_push (active_list_t *list,
1301                    const char *identifier,
1302                    token_node_t *marker)
1303 {
1304         active_list_t *node;
1305
1306         node = xtalloc (list, active_list_t);
1307         node->identifier = xtalloc_strdup (node, identifier);
1308         node->marker = marker;
1309         node->next = list;
1310
1311         return node;
1312 }
1313
1314 active_list_t *
1315 _active_list_pop (active_list_t *list)
1316 {
1317         active_list_t *node = list;
1318
1319         if (node == NULL)
1320                 return NULL;
1321
1322         node = list->next;
1323         talloc_free (list);
1324
1325         return node;
1326 }
1327
1328 int
1329 _active_list_contains (active_list_t *list, const char *identifier)
1330 {
1331         active_list_t *node;
1332
1333         if (list == NULL)
1334                 return 0;
1335
1336         for (node = list; node; node = node->next)
1337                 if (strcmp (node->identifier, identifier) == 0)
1338                         return 1;
1339
1340         return 0;
1341 }
1342
1343 /* Walk over the token list replacing nodes with their expansion.
1344  * Whenever nodes are expanded the walking will walk over the new
1345  * nodes, continuing to expand as necessary. The results are placed in
1346  * 'list' itself;
1347  */
1348 static void
1349 _glcpp_parser_expand_token_list (glcpp_parser_t *parser,
1350                                  token_list_t *list)
1351 {
1352         token_node_t *node_prev;
1353         token_node_t *node, *last = NULL;
1354         token_list_t *expansion;
1355
1356         if (list == NULL)
1357                 return;
1358
1359         _token_list_trim_trailing_space (list);
1360
1361         node_prev = NULL;
1362         node = list->head;
1363
1364         while (node) {
1365
1366                 while (parser->active && parser->active->marker == node)
1367                         parser->active = _active_list_pop (parser->active);
1368
1369                 /* Find the expansion for node, which will replace all
1370                  * nodes from node to last, inclusive. */
1371                 expansion = _glcpp_parser_expand_node (parser, node, &last);
1372                 if (expansion) {
1373                         token_node_t *n;
1374
1375                         for (n = node; n != last->next; n = n->next)
1376                                 while (parser->active &&
1377                                        parser->active->marker == n)
1378                                 {
1379                                         parser->active = _active_list_pop (parser->active);
1380                                 }
1381
1382                         parser->active = _active_list_push (parser->active,
1383                                                             node->token->value.str,
1384                                                             last->next);
1385
1386                         /* Splice expansion into list, supporting a
1387                          * simple deletion if the expansion is
1388                          * empty. */
1389                         if (expansion->head) {
1390                                 if (node_prev)
1391                                         node_prev->next = expansion->head;
1392                                 else
1393                                         list->head = expansion->head;
1394                                 expansion->tail->next = last->next;
1395                                 if (last == list->tail)
1396                                         list->tail = expansion->tail;
1397                         } else {
1398                                 if (node_prev)
1399                                         node_prev->next = last->next;
1400                                 else
1401                                         list->head = last->next;
1402                                 if (last == list->tail)
1403                                         list->tail = NULL;
1404                         }
1405                 } else {
1406                         node_prev = node;
1407                 }
1408                 node = node_prev ? node_prev->next : list->head;
1409         }
1410
1411         while (parser->active)
1412                 parser->active = _active_list_pop (parser->active);
1413
1414         list->non_space_tail = list->tail;
1415 }
1416
1417 void
1418 _glcpp_parser_print_expanded_token_list (glcpp_parser_t *parser,
1419                                          token_list_t *list)
1420 {
1421         if (list == NULL)
1422                 return;
1423
1424         _glcpp_parser_expand_token_list (parser, list);
1425
1426         _token_list_trim_trailing_space (list);
1427
1428         _token_list_print (parser, list);
1429 }
1430
1431 static void
1432 _check_for_reserved_macro_name (glcpp_parser_t *parser, YYLTYPE *loc,
1433                                 const char *identifier)
1434 {
1435         /* According to the GLSL specification, macro names starting with "__"
1436          * or "GL_" are reserved for future use.  So, don't allow them.
1437          */
1438         if (strncmp(identifier, "__", 2) == 0) {
1439                 glcpp_error (loc, parser, "Macro names starting with \"__\" are reserved.\n");
1440         }
1441         if (strncmp(identifier, "GL_", 3) == 0) {
1442                 glcpp_error (loc, parser, "Macro names starting with \"GL_\" are reserved.\n");
1443         }
1444 }
1445
1446 void
1447 _define_object_macro (glcpp_parser_t *parser,
1448                       YYLTYPE *loc,
1449                       const char *identifier,
1450                       token_list_t *replacements)
1451 {
1452         macro_t *macro;
1453
1454         if (loc != NULL)
1455                 _check_for_reserved_macro_name(parser, loc, identifier);
1456
1457         macro = xtalloc (parser, macro_t);
1458
1459         macro->is_function = 0;
1460         macro->parameters = NULL;
1461         macro->identifier = talloc_strdup (macro, identifier);
1462         macro->replacements = talloc_steal (macro, replacements);
1463
1464         hash_table_insert (parser->defines, macro, identifier);
1465 }
1466
1467 void
1468 _define_function_macro (glcpp_parser_t *parser,
1469                         YYLTYPE *loc,
1470                         const char *identifier,
1471                         string_list_t *parameters,
1472                         token_list_t *replacements)
1473 {
1474         macro_t *macro;
1475
1476         _check_for_reserved_macro_name(parser, loc, identifier);
1477
1478         macro = xtalloc (parser, macro_t);
1479
1480         macro->is_function = 1;
1481         macro->parameters = talloc_steal (macro, parameters);
1482         macro->identifier = talloc_strdup (macro, identifier);
1483         macro->replacements = talloc_steal (macro, replacements);
1484
1485         hash_table_insert (parser->defines, macro, identifier);
1486 }
1487
1488 static int
1489 glcpp_parser_lex (YYSTYPE *yylval, YYLTYPE *yylloc, glcpp_parser_t *parser)
1490 {
1491         token_node_t *node;
1492         int ret;
1493
1494         if (parser->lex_from_list == NULL) {
1495                 ret = glcpp_lex (yylval, yylloc, parser->scanner);
1496
1497                 /* XXX: This ugly block of code exists for the sole
1498                  * purpose of converting a NEWLINE token into a SPACE
1499                  * token, but only in the case where we have seen a
1500                  * function-like macro name, but have not yet seen its
1501                  * closing parenthesis.
1502                  *
1503                  * There's perhaps a more compact way to do this with
1504                  * mid-rule actions in the grammar.
1505                  *
1506                  * I'm definitely not pleased with the complexity of
1507                  * this code here.
1508                  */
1509                 if (parser->newline_as_space)
1510                 {
1511                         if (ret == '(') {
1512                                 parser->paren_count++;
1513                         } else if (ret == ')') {
1514                                 parser->paren_count--;
1515                                 if (parser->paren_count == 0)
1516                                         parser->newline_as_space = 0;
1517                         } else if (ret == NEWLINE) {
1518                                 ret = SPACE;
1519                         } else if (ret != SPACE) {
1520                                 if (parser->paren_count == 0)
1521                                         parser->newline_as_space = 0;
1522                         }
1523                 }
1524                 else if (parser->in_control_line)
1525                 {
1526                         if (ret == NEWLINE)
1527                                 parser->in_control_line = 0;
1528                 }
1529                 else if (ret == HASH_DEFINE_OBJ || ret == HASH_DEFINE_FUNC ||
1530                            ret == HASH_UNDEF || ret == HASH_IF ||
1531                            ret == HASH_IFDEF || ret == HASH_IFNDEF ||
1532                            ret == HASH_ELIF || ret == HASH_ELSE ||
1533                            ret == HASH_ENDIF || ret == HASH)
1534                 {
1535                         parser->in_control_line = 1;
1536                 }
1537                 else if (ret == IDENTIFIER)
1538                 {
1539                         macro_t *macro;
1540                         macro = hash_table_find (parser->defines,
1541                                                  yylval->str);
1542                         if (macro && macro->is_function) {
1543                                 parser->newline_as_space = 1;
1544                                 parser->paren_count = 0;
1545                         }
1546                 }
1547
1548                 return ret;
1549         }
1550
1551         node = parser->lex_from_node;
1552
1553         if (node == NULL) {
1554                 talloc_free (parser->lex_from_list);
1555                 parser->lex_from_list = NULL;
1556                 return NEWLINE;
1557         }
1558
1559         *yylval = node->token->value;
1560         ret = node->token->type;
1561
1562         parser->lex_from_node = node->next;
1563
1564         return ret;
1565 }
1566
1567 static void
1568 glcpp_parser_lex_from (glcpp_parser_t *parser, token_list_t *list)
1569 {
1570         token_node_t *node;
1571
1572         assert (parser->lex_from_list == NULL);
1573
1574         /* Copy list, eliminating any space tokens. */
1575         parser->lex_from_list = _token_list_create (parser);
1576
1577         for (node = list->head; node; node = node->next) {
1578                 if (node->token->type == SPACE)
1579                         continue;
1580                 _token_list_append (parser->lex_from_list, node->token);
1581         }
1582
1583         talloc_free (list);
1584
1585         parser->lex_from_node = parser->lex_from_list->head;
1586
1587         /* It's possible the list consisted of nothing but whitespace. */
1588         if (parser->lex_from_node == NULL) {
1589                 talloc_free (parser->lex_from_list);
1590                 parser->lex_from_list = NULL;
1591         }
1592 }
1593
1594 static void
1595 _glcpp_parser_skip_stack_push_if (glcpp_parser_t *parser, YYLTYPE *loc,
1596                                   int condition)
1597 {
1598         skip_type_t current = SKIP_NO_SKIP;
1599         skip_node_t *node;
1600
1601         if (parser->skip_stack)
1602                 current = parser->skip_stack->type;
1603
1604         node = xtalloc (parser, skip_node_t);
1605         node->loc = *loc;
1606
1607         if (current == SKIP_NO_SKIP) {
1608                 if (condition)
1609                         node->type = SKIP_NO_SKIP;
1610                 else
1611                         node->type = SKIP_TO_ELSE;
1612         } else {
1613                 node->type = SKIP_TO_ENDIF;
1614         }
1615
1616         node->next = parser->skip_stack;
1617         parser->skip_stack = node;
1618 }
1619
1620 static void
1621 _glcpp_parser_skip_stack_change_if (glcpp_parser_t *parser, YYLTYPE *loc,
1622                                     const char *type, int condition)
1623 {
1624         if (parser->skip_stack == NULL) {
1625                 glcpp_error (loc, parser, "%s without #if\n", type);
1626                 return;
1627         }
1628
1629         if (parser->skip_stack->type == SKIP_TO_ELSE) {
1630                 if (condition)
1631                         parser->skip_stack->type = SKIP_NO_SKIP;
1632         } else {
1633                 parser->skip_stack->type = SKIP_TO_ENDIF;
1634         }
1635 }
1636
1637 static void
1638 _glcpp_parser_skip_stack_pop (glcpp_parser_t *parser, YYLTYPE *loc)
1639 {
1640         skip_node_t *node;
1641
1642         if (parser->skip_stack == NULL) {
1643                 glcpp_error (loc, parser, "#endif without #if\n");
1644                 return;
1645         }
1646
1647         node = parser->skip_stack;
1648         parser->skip_stack = node->next;
1649         talloc_free (node);
1650 }