projects / mesa.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
glcpp: don't push #line directives into next line
[mesa.git] / 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 <string.h>
28 #include <assert.h>
29 #include <inttypes.h>
30
31 #include "glcpp.h"
32 #include "main/core.h" /* for struct gl_extensions */
33 #include "main/mtypes.h" /* for gl_api enum */
34
35 static void
36 yyerror (YYLTYPE *locp, glcpp_parser_t *parser, const char *error);
37
38 static void
39 _define_object_macro (glcpp_parser_t *parser,
40 YYLTYPE *loc,
41 const char *macro,
42 token_list_t *replacements);
43
44 static void
45 _define_function_macro (glcpp_parser_t *parser,
46 YYLTYPE *loc,
47 const char *macro,
48 string_list_t *parameters,
49 token_list_t *replacements);
50
51 static string_list_t *
52 _string_list_create (void *ctx);
53
54 static void
55 _string_list_append_item (string_list_t *list, const char *str);
56
57 static int
58 _string_list_contains (string_list_t *list, const char *member, int *index);
59
60 static int
61 _string_list_length (string_list_t *list);
62
63 static int
64 _string_list_equal (string_list_t *a, string_list_t *b);
65
66 static argument_list_t *
67 _argument_list_create (void *ctx);
68
69 static void
70 _argument_list_append (argument_list_t *list, token_list_t *argument);
71
72 static int
73 _argument_list_length (argument_list_t *list);
74
75 static token_list_t *
76 _argument_list_member_at (argument_list_t *list, int index);
77
78 /* Note: This function ralloc_steal()s the str pointer. */
79 static token_t *
80 _token_create_str (void *ctx, int type, char *str);
81
82 static token_t *
83 _token_create_ival (void *ctx, int type, int ival);
84
85 static token_list_t *
86 _token_list_create (void *ctx);
87
88 static void
89 _token_list_append (token_list_t *list, token_t *token);
90
91 static void
92 _token_list_append_list (token_list_t *list, token_list_t *tail);
93
94 static int
95 _token_list_equal_ignoring_space (token_list_t *a, token_list_t *b);
96
97 static void
98 _parser_active_list_push (glcpp_parser_t *parser,
99 const char *identifier,
100 token_node_t *marker);
101
102 static void
103 _parser_active_list_pop (glcpp_parser_t *parser);
104
105 static int
106 _parser_active_list_contains (glcpp_parser_t *parser, const char *identifier);
107
108 /* Expand list, and begin lexing from the result (after first
109 * prefixing a token of type 'head_token_type').
110 */
111 static void
112 _glcpp_parser_expand_and_lex_from (glcpp_parser_t *parser,
113 int head_token_type,
114 token_list_t *list);
115
116 /* Perform macro expansion in-place on the given list. */
117 static void
118 _glcpp_parser_expand_token_list (glcpp_parser_t *parser,
119 token_list_t *list);
120
121 static void
122 _glcpp_parser_print_expanded_token_list (glcpp_parser_t *parser,
123 token_list_t *list);
124
125 static void
126 _glcpp_parser_skip_stack_push_if (glcpp_parser_t *parser, YYLTYPE *loc,
127 int condition);
128
129 static void
130 _glcpp_parser_skip_stack_change_if (glcpp_parser_t *parser, YYLTYPE *loc,
131 const char *type, int condition);
132
133 static void
134 _glcpp_parser_skip_stack_pop (glcpp_parser_t *parser, YYLTYPE *loc);
135
136 static int
137 glcpp_parser_lex (YYSTYPE *yylval, YYLTYPE *yylloc, glcpp_parser_t *parser);
138
139 static void
140 glcpp_parser_lex_from (glcpp_parser_t *parser, token_list_t *list);
141
142 static void
143 add_builtin_define(glcpp_parser_t *parser, const char *name, int value);
144
145 %}
146
147 %pure-parser
148 %error-verbose
149
150 %locations
151 %initial-action {
152 @$.first_line = 1;
153 @$.first_column = 1;
154 @$.last_line = 1;
155 @$.last_column = 1;
156 @$.source = 0;
157 }
158
159 %parse-param {glcpp_parser_t *parser}
160 %lex-param {glcpp_parser_t *parser}
161
162 %expect 0
163 %token COMMA_FINAL DEFINED ELIF_EXPANDED HASH HASH_DEFINE FUNC_IDENTIFIER OBJ_IDENTIFIER HASH_ELIF HASH_ELSE HASH_ENDIF HASH_IF HASH_IFDEF HASH_IFNDEF HASH_LINE HASH_UNDEF HASH_VERSION IDENTIFIER IF_EXPANDED INTEGER INTEGER_STRING LINE_EXPANDED NEWLINE OTHER PLACEHOLDER SPACE
164 %token PASTE
165 %type <ival> expression INTEGER operator SPACE integer_constant
166 %type <str> IDENTIFIER FUNC_IDENTIFIER OBJ_IDENTIFIER INTEGER_STRING OTHER
167 %type <string_list> identifier_list
168 %type <token> preprocessing_token conditional_token
169 %type <token_list> pp_tokens replacement_list text_line conditional_tokens
170 %left OR
171 %left AND
172 %left '|'
173 %left '^'
174 %left '&'
175 %left EQUAL NOT_EQUAL
176 %left '<' '>' LESS_OR_EQUAL GREATER_OR_EQUAL
177 %left LEFT_SHIFT RIGHT_SHIFT
178 %left '+' '-'
179 %left '*' '/' '%'
180 %right UNARY
181
182 %%
183
184 input:
185 /* empty */
186 | input line
187 ;
188
189 line:
190 control_line {
191 ralloc_asprintf_rewrite_tail (&parser->output, &parser->output_length, "\n");
192 }
193 | HASH_LINE pp_tokens NEWLINE {
194 if (parser->skip_stack == NULL ||
195 parser->skip_stack->type == SKIP_NO_SKIP)
196 {
197 _glcpp_parser_expand_and_lex_from (parser,
198 LINE_EXPANDED, $2);
199 }
200 }
201 | text_line {
202 _glcpp_parser_print_expanded_token_list (parser, $1);
203 ralloc_asprintf_rewrite_tail (&parser->output, &parser->output_length, "\n");
204 ralloc_free ($1);
205 }
206 | expanded_line
207 | HASH non_directive
208 ;
209
210 expanded_line:
211 IF_EXPANDED expression NEWLINE {
212 _glcpp_parser_skip_stack_push_if (parser, & @1, $2);
213 }
214 | ELIF_EXPANDED expression NEWLINE {
215 _glcpp_parser_skip_stack_change_if (parser, & @1, "elif", $2);
216 }
217 | LINE_EXPANDED integer_constant NEWLINE {
218 parser->has_new_line_number = 1;
219 parser->new_line_number = $2;
220 ralloc_asprintf_rewrite_tail (&parser->output,
221 &parser->output_length,
222 "#line %" PRIiMAX "\n",
223 $2);
224 }
225 | LINE_EXPANDED integer_constant integer_constant NEWLINE {
226 parser->has_new_line_number = 1;
227 parser->new_line_number = $2;
228 parser->has_new_source_number = 1;
229 parser->new_source_number = $3;
230 ralloc_asprintf_rewrite_tail (&parser->output,
231 &parser->output_length,
232 "#line %" PRIiMAX " %" PRIiMAX "\n",
233 $2, $3);
234 }
235 ;
236
237 control_line:
238 HASH_DEFINE OBJ_IDENTIFIER replacement_list NEWLINE {
239 _define_object_macro (parser, & @2, $2, $3);
240 }
241 | HASH_DEFINE FUNC_IDENTIFIER '(' ')' replacement_list NEWLINE {
242 _define_function_macro (parser, & @2, $2, NULL, $5);
243 }
244 | HASH_DEFINE FUNC_IDENTIFIER '(' identifier_list ')' replacement_list NEWLINE {
245 _define_function_macro (parser, & @2, $2, $4, $6);
246 }
247 | HASH_UNDEF IDENTIFIER NEWLINE {
248 macro_t *macro = hash_table_find (parser->defines, $2);
249 if (macro) {
250 hash_table_remove (parser->defines, $2);
251 ralloc_free (macro);
252 }
253 ralloc_free ($2);
254 }
255 | HASH_IF conditional_tokens NEWLINE {
256 /* Be careful to only evaluate the 'if' expression if
257 * we are not skipping. When we are skipping, we
258 * simply push a new 0-valued 'if' onto the skip
259 * stack.
260 *
261 * This avoids generating diagnostics for invalid
262 * expressions that are being skipped. */
263 if (parser->skip_stack == NULL ||
264 parser->skip_stack->type == SKIP_NO_SKIP)
265 {
266 _glcpp_parser_expand_and_lex_from (parser,
267 IF_EXPANDED, $2);
268 }
269 else
270 {
271 _glcpp_parser_skip_stack_push_if (parser, & @1, 0);
272 parser->skip_stack->type = SKIP_TO_ENDIF;
273 }
274 }
275 | HASH_IF NEWLINE {
276 /* #if without an expression is only an error if we
277 * are not skipping */
278 if (parser->skip_stack == NULL ||
279 parser->skip_stack->type == SKIP_NO_SKIP)
280 {
281 glcpp_error(& @1, parser, "#if with no expression");
282 }
283 _glcpp_parser_skip_stack_push_if (parser, & @1, 0);
284 }
285 | HASH_IFDEF IDENTIFIER junk NEWLINE {
286 macro_t *macro = hash_table_find (parser->defines, $2);
287 ralloc_free ($2);
288 _glcpp_parser_skip_stack_push_if (parser, & @1, macro != NULL);
289 }
290 | HASH_IFNDEF IDENTIFIER junk NEWLINE {
291 macro_t *macro = hash_table_find (parser->defines, $2);
292 ralloc_free ($2);
293 _glcpp_parser_skip_stack_push_if (parser, & @1, macro == NULL);
294 }
295 | HASH_ELIF conditional_tokens NEWLINE {
296 /* Be careful to only evaluate the 'elif' expression
297 * if we are not skipping. When we are skipping, we
298 * simply change to a 0-valued 'elif' on the skip
299 * stack.
300 *
301 * This avoids generating diagnostics for invalid
302 * expressions that are being skipped. */
303 if (parser->skip_stack &&
304 parser->skip_stack->type == SKIP_TO_ELSE)
305 {
306 _glcpp_parser_expand_and_lex_from (parser,
307 ELIF_EXPANDED, $2);
308 }
309 else
310 {
311 _glcpp_parser_skip_stack_change_if (parser, & @1,
312 "elif", 0);
313 }
314 }
315 | HASH_ELIF NEWLINE {
316 /* #elif without an expression is an error unless we
317 * are skipping. */
318 if (parser->skip_stack &&
319 parser->skip_stack->type == SKIP_TO_ELSE)
320 {
321 glcpp_error(& @1, parser, "#elif with no expression");
322 }
323 else
324 {
325 _glcpp_parser_skip_stack_change_if (parser, & @1,
326 "elif", 0);
327 glcpp_warning(& @1, parser, "ignoring illegal #elif without expression");
328 }
329 }
330 | HASH_ELSE {
331 _glcpp_parser_skip_stack_change_if (parser, & @1, "else", 1);
332 } NEWLINE
333 | HASH_ENDIF {
334 _glcpp_parser_skip_stack_pop (parser, & @1);
335 } NEWLINE
336 | HASH_VERSION integer_constant NEWLINE {
337 macro_t *macro = hash_table_find (parser->defines, "__VERSION__");
338 if (macro) {
339 hash_table_remove (parser->defines, "__VERSION__");
340 ralloc_free (macro);
341 }
342 add_builtin_define (parser, "__VERSION__", $2);
343
344 if ($2 == 100)
345 add_builtin_define (parser, "GL_ES", 1);
346
347 /* Currently, all ES2 implementations support highp in the
348 * fragment shader, so we always define this macro in ES2.
349 * If we ever get a driver that doesn't support highp, we'll
350 * need to add a flag to the gl_context and check that here.
351 */
352 if ($2 >= 130 || $2 == 100)
353 add_builtin_define (parser, "GL_FRAGMENT_PRECISION_HIGH", 1);
354
355 ralloc_asprintf_rewrite_tail (&parser->output, &parser->output_length, "#version %" PRIiMAX, $2);
356 }
357 | HASH NEWLINE
358 ;
359
360 integer_constant:
361 INTEGER_STRING {
362 if (strlen ($1) >= 3 && strncmp ($1, "0x", 2) == 0) {
363 $$ = strtoll ($1 + 2, NULL, 16);
364 } else if ($1[0] == '0') {
365 $$ = strtoll ($1, NULL, 8);
366 } else {
367 $$ = strtoll ($1, NULL, 10);
368 }
369 }
370 | INTEGER {
371 $$ = $1;
372 }
373
374 expression:
375 integer_constant
376 | IDENTIFIER {
377 $$ = 0;
378 }
379 | expression OR expression {
380 $$ = $1 || $3;
381 }
382 | expression AND expression {
383 $$ = $1 && $3;
384 }
385 | expression '|' expression {
386 $$ = $1 | $3;
387 }
388 | expression '^' expression {
389 $$ = $1 ^ $3;
390 }
391 | expression '&' expression {
392 $$ = $1 & $3;
393 }
394 | expression NOT_EQUAL expression {
395 $$ = $1 != $3;
396 }
397 | expression EQUAL expression {
398 $$ = $1 == $3;
399 }
400 | expression GREATER_OR_EQUAL expression {
401 $$ = $1 >= $3;
402 }
403 | expression LESS_OR_EQUAL expression {
404 $$ = $1 <= $3;
405 }
406 | expression '>' expression {
407 $$ = $1 > $3;
408 }
409 | expression '<' expression {
410 $$ = $1 < $3;
411 }
412 | expression RIGHT_SHIFT expression {
413 $$ = $1 >> $3;
414 }
415 | expression LEFT_SHIFT expression {
416 $$ = $1 << $3;
417 }
418 | expression '-' expression {
419 $$ = $1 - $3;
420 }
421 | expression '+' expression {
422 $$ = $1 + $3;
423 }
424 | expression '%' expression {
425 if ($3 == 0) {
426 yyerror (& @1, parser,
427 "zero modulus in preprocessor directive");
428 } else {
429 $$ = $1 % $3;
430 }
431 }
432 | expression '/' expression {
433 if ($3 == 0) {
434 yyerror (& @1, parser,
435 "division by 0 in preprocessor directive");
436 } else {
437 $$ = $1 / $3;
438 }
439 }
440 | expression '*' expression {
441 $$ = $1 * $3;
442 }
443 | '!' expression %prec UNARY {
444 $$ = ! $2;
445 }
446 | '~' expression %prec UNARY {
447 $$ = ~ $2;
448 }
449 | '-' expression %prec UNARY {
450 $$ = - $2;
451 }
452 | '+' expression %prec UNARY {
453 $$ = + $2;
454 }
455 | '(' expression ')' {
456 $$ = $2;
457 }
458 ;
459
460 identifier_list:
461 IDENTIFIER {
462 $$ = _string_list_create (parser);
463 _string_list_append_item ($$, $1);
464 ralloc_steal ($$, $1);
465 }
466 | identifier_list ',' IDENTIFIER {
467 $$ = $1;
468 _string_list_append_item ($$, $3);
469 ralloc_steal ($$, $3);
470 }
471 ;
472
473 text_line:
474 NEWLINE { $$ = NULL; }
475 | pp_tokens NEWLINE
476 ;
477
478 non_directive:
479 pp_tokens NEWLINE {
480 yyerror (& @1, parser, "Invalid tokens after #");
481 }
482 ;
483
484 replacement_list:
485 /* empty */ { $$ = NULL; }
486 | pp_tokens
487 ;
488
489 junk:
490 /* empty */
491 | pp_tokens {
492 glcpp_warning(&@1, parser, "extra tokens at end of directive");
493 }
494 ;
495
496 conditional_token:
497 /* Handle "defined" operator */
498 DEFINED IDENTIFIER {
499 int v = hash_table_find (parser->defines, $2) ? 1 : 0;
500 $$ = _token_create_ival (parser, INTEGER, v);
501 }
502 | DEFINED '(' IDENTIFIER ')' {
503 int v = hash_table_find (parser->defines, $3) ? 1 : 0;
504 $$ = _token_create_ival (parser, INTEGER, v);
505 }
506 | preprocessing_token
507 ;
508
509 conditional_tokens:
510 /* Exactly the same as pp_tokens, but using conditional_token */
511 conditional_token {
512 $$ = _token_list_create (parser);
513 _token_list_append ($$, $1);
514 }
515 | conditional_tokens conditional_token {
516 $$ = $1;
517 _token_list_append ($$, $2);
518 }
519 ;
520
521 pp_tokens:
522 preprocessing_token {
523 parser->space_tokens = 1;
524 $$ = _token_list_create (parser);
525 _token_list_append ($$, $1);
526 }
527 | pp_tokens preprocessing_token {
528 $$ = $1;
529 _token_list_append ($$, $2);
530 }
531 ;
532
533 preprocessing_token:
534 IDENTIFIER {
535 $$ = _token_create_str (parser, IDENTIFIER, $1);
536 $$->location = yylloc;
537 }
538 | INTEGER_STRING {
539 $$ = _token_create_str (parser, INTEGER_STRING, $1);
540 $$->location = yylloc;
541 }
542 | operator {
543 $$ = _token_create_ival (parser, $1, $1);
544 $$->location = yylloc;
545 }
546 | OTHER {
547 $$ = _token_create_str (parser, OTHER, $1);
548 $$->location = yylloc;
549 }
550 | SPACE {
551 $$ = _token_create_ival (parser, SPACE, SPACE);
552 $$->location = yylloc;
553 }
554 ;
555
556 operator:
557 '[' { $$ = '['; }
558 | ']' { $$ = ']'; }
559 | '(' { $$ = '('; }
560 | ')' { $$ = ')'; }
561 | '{' { $$ = '{'; }
562 | '}' { $$ = '}'; }
563 | '.' { $$ = '.'; }
564 | '&' { $$ = '&'; }
565 | '*' { $$ = '*'; }
566 | '+' { $$ = '+'; }
567 | '-' { $$ = '-'; }
568 | '~' { $$ = '~'; }
569 | '!' { $$ = '!'; }
570 | '/' { $$ = '/'; }
571 | '%' { $$ = '%'; }
572 | LEFT_SHIFT { $$ = LEFT_SHIFT; }
573 | RIGHT_SHIFT { $$ = RIGHT_SHIFT; }
574 | '<' { $$ = '<'; }
575 | '>' { $$ = '>'; }
576 | LESS_OR_EQUAL { $$ = LESS_OR_EQUAL; }
577 | GREATER_OR_EQUAL { $$ = GREATER_OR_EQUAL; }
578 | EQUAL { $$ = EQUAL; }
579 | NOT_EQUAL { $$ = NOT_EQUAL; }
580 | '^' { $$ = '^'; }
581 | '|' { $$ = '|'; }
582 | AND { $$ = AND; }
583 | OR { $$ = OR; }
584 | ';' { $$ = ';'; }
585 | ',' { $$ = ','; }
586 | '=' { $$ = '='; }
587 | PASTE { $$ = PASTE; }
588 ;
589
590 %%
591
592 string_list_t *
593 _string_list_create (void *ctx)
594 {
595 string_list_t *list;
596
597 list = ralloc (ctx, string_list_t);
598 list->head = NULL;
599 list->tail = NULL;
600
601 return list;
602 }
603
604 void
605 _string_list_append_item (string_list_t *list, const char *str)
606 {
607 string_node_t *node;
608
609 node = ralloc (list, string_node_t);
610 node->str = ralloc_strdup (node, str);
611
612 node->next = NULL;
613
614 if (list->head == NULL) {
615 list->head = node;
616 } else {
617 list->tail->next = node;
618 }
619
620 list->tail = node;
621 }
622
623 int
624 _string_list_contains (string_list_t *list, const char *member, int *index)
625 {
626 string_node_t *node;
627 int i;
628
629 if (list == NULL)
630 return 0;
631
632 for (i = 0, node = list->head; node; i++, node = node->next) {
633 if (strcmp (node->str, member) == 0) {
634 if (index)
635 *index = i;
636 return 1;
637 }
638 }
639
640 return 0;
641 }
642
643 int
644 _string_list_length (string_list_t *list)
645 {
646 int length = 0;
647 string_node_t *node;
648
649 if (list == NULL)
650 return 0;
651
652 for (node = list->head; node; node = node->next)
653 length++;
654
655 return length;
656 }
657
658 int
659 _string_list_equal (string_list_t *a, string_list_t *b)
660 {
661 string_node_t *node_a, *node_b;
662
663 if (a == NULL && b == NULL)
664 return 1;
665
666 if (a == NULL || b == NULL)
667 return 0;
668
669 for (node_a = a->head, node_b = b->head;
670 node_a && node_b;
671 node_a = node_a->next, node_b = node_b->next)
672 {
673 if (strcmp (node_a->str, node_b->str))
674 return 0;
675 }
676
677 /* Catch the case of lists being different lengths, (which
678 * would cause the loop above to terminate after the shorter
679 * list). */
680 return node_a == node_b;
681 }
682
683 argument_list_t *
684 _argument_list_create (void *ctx)
685 {
686 argument_list_t *list;
687
688 list = ralloc (ctx, argument_list_t);
689 list->head = NULL;
690 list->tail = NULL;
691
692 return list;
693 }
694
695 void
696 _argument_list_append (argument_list_t *list, token_list_t *argument)
697 {
698 argument_node_t *node;
699
700 node = ralloc (list, argument_node_t);
701 node->argument = argument;
702
703 node->next = NULL;
704
705 if (list->head == NULL) {
706 list->head = node;
707 } else {
708 list->tail->next = node;
709 }
710
711 list->tail = node;
712 }
713
714 int
715 _argument_list_length (argument_list_t *list)
716 {
717 int length = 0;
718 argument_node_t *node;
719
720 if (list == NULL)
721 return 0;
722
723 for (node = list->head; node; node = node->next)
724 length++;
725
726 return length;
727 }
728
729 token_list_t *
730 _argument_list_member_at (argument_list_t *list, int index)
731 {
732 argument_node_t *node;
733 int i;
734
735 if (list == NULL)
736 return NULL;
737
738 node = list->head;
739 for (i = 0; i < index; i++) {
740 node = node->next;
741 if (node == NULL)
742 break;
743 }
744
745 if (node)
746 return node->argument;
747
748 return NULL;
749 }
750
751 /* Note: This function ralloc_steal()s the str pointer. */
752 token_t *
753 _token_create_str (void *ctx, int type, char *str)
754 {
755 token_t *token;
756
757 token = ralloc (ctx, token_t);
758 token->type = type;
759 token->value.str = str;
760
761 ralloc_steal (token, str);
762
763 return token;
764 }
765
766 token_t *
767 _token_create_ival (void *ctx, int type, int ival)
768 {
769 token_t *token;
770
771 token = ralloc (ctx, token_t);
772 token->type = type;
773 token->value.ival = ival;
774
775 return token;
776 }
777
778 token_list_t *
779 _token_list_create (void *ctx)
780 {
781 token_list_t *list;
782
783 list = ralloc (ctx, token_list_t);
784 list->head = NULL;
785 list->tail = NULL;
786 list->non_space_tail = NULL;
787
788 return list;
789 }
790
791 void
792 _token_list_append (token_list_t *list, token_t *token)
793 {
794 token_node_t *node;
795
796 node = ralloc (list, token_node_t);
797 node->token = token;
798 node->next = NULL;
799
800 if (list->head == NULL) {
801 list->head = node;
802 } else {
803 list->tail->next = node;
804 }
805
806 list->tail = node;
807 if (token->type != SPACE)
808 list->non_space_tail = node;
809 }
810
811 void
812 _token_list_append_list (token_list_t *list, token_list_t *tail)
813 {
814 if (tail == NULL || tail->head == NULL)
815 return;
816
817 if (list->head == NULL) {
818 list->head = tail->head;
819 } else {
820 list->tail->next = tail->head;
821 }
822
823 list->tail = tail->tail;
824 list->non_space_tail = tail->non_space_tail;
825 }
826
827 static token_list_t *
828 _token_list_copy (void *ctx, token_list_t *other)
829 {
830 token_list_t *copy;
831 token_node_t *node;
832
833 if (other == NULL)
834 return NULL;
835
836 copy = _token_list_create (ctx);
837 for (node = other->head; node; node = node->next) {
838 token_t *new_token = ralloc (copy, token_t);
839 *new_token = *node->token;
840 _token_list_append (copy, new_token);
841 }
842
843 return copy;
844 }
845
846 static void
847 _token_list_trim_trailing_space (token_list_t *list)
848 {
849 token_node_t *tail, *next;
850
851 if (list->non_space_tail) {
852 tail = list->non_space_tail->next;
853 list->non_space_tail->next = NULL;
854 list->tail = list->non_space_tail;
855
856 while (tail) {
857 next = tail->next;
858 ralloc_free (tail);
859 tail = next;
860 }
861 }
862 }
863
864 static int
865 _token_list_is_empty_ignoring_space (token_list_t *l)
866 {
867 token_node_t *n;
868
869 if (l == NULL)
870 return 1;
871
872 n = l->head;
873 while (n != NULL && n->token->type == SPACE)
874 n = n->next;
875
876 return n == NULL;
877 }
878
879 int
880 _token_list_equal_ignoring_space (token_list_t *a, token_list_t *b)
881 {
882 token_node_t *node_a, *node_b;
883
884 if (a == NULL || b == NULL) {
885 int a_empty = _token_list_is_empty_ignoring_space(a);
886 int b_empty = _token_list_is_empty_ignoring_space(b);
887 return a_empty == b_empty;
888 }
889
890 node_a = a->head;
891 node_b = b->head;
892
893 while (1)
894 {
895 if (node_a == NULL && node_b == NULL)
896 break;
897
898 if (node_a == NULL || node_b == NULL)
899 return 0;
900
901 if (node_a->token->type == SPACE) {
902 node_a = node_a->next;
903 continue;
904 }
905
906 if (node_b->token->type == SPACE) {
907 node_b = node_b->next;
908 continue;
909 }
910
911 if (node_a->token->type != node_b->token->type)
912 return 0;
913
914 switch (node_a->token->type) {
915 case INTEGER:
916 if (node_a->token->value.ival !=
917 node_b->token->value.ival)
918 {
919 return 0;
920 }
921 break;
922 case IDENTIFIER:
923 case INTEGER_STRING:
924 case OTHER:
925 if (strcmp (node_a->token->value.str,
926 node_b->token->value.str))
927 {
928 return 0;
929 }
930 break;
931 }
932
933 node_a = node_a->next;
934 node_b = node_b->next;
935 }
936
937 return 1;
938 }
939
940 static void
941 _token_print (char **out, size_t *len, token_t *token)
942 {
943 if (token->type < 256) {
944 ralloc_asprintf_rewrite_tail (out, len, "%c", token->type);
945 return;
946 }
947
948 switch (token->type) {
949 case INTEGER:
950 ralloc_asprintf_rewrite_tail (out, len, "%" PRIiMAX, token->value.ival);
951 break;
952 case IDENTIFIER:
953 case INTEGER_STRING:
954 case OTHER:
955 ralloc_asprintf_rewrite_tail (out, len, "%s", token->value.str);
956 break;
957 case SPACE:
958 ralloc_asprintf_rewrite_tail (out, len, " ");
959 break;
960 case LEFT_SHIFT:
961 ralloc_asprintf_rewrite_tail (out, len, "<<");
962 break;
963 case RIGHT_SHIFT:
964 ralloc_asprintf_rewrite_tail (out, len, ">>");
965 break;
966 case LESS_OR_EQUAL:
967 ralloc_asprintf_rewrite_tail (out, len, "<=");
968 break;
969 case GREATER_OR_EQUAL:
970 ralloc_asprintf_rewrite_tail (out, len, ">=");
971 break;
972 case EQUAL:
973 ralloc_asprintf_rewrite_tail (out, len, "==");
974 break;
975 case NOT_EQUAL:
976 ralloc_asprintf_rewrite_tail (out, len, "!=");
977 break;
978 case AND:
979 ralloc_asprintf_rewrite_tail (out, len, "&&");
980 break;
981 case OR:
982 ralloc_asprintf_rewrite_tail (out, len, "||");
983 break;
984 case PASTE:
985 ralloc_asprintf_rewrite_tail (out, len, "##");
986 break;
987 case COMMA_FINAL:
988 ralloc_asprintf_rewrite_tail (out, len, ",");
989 break;
990 case PLACEHOLDER:
991 /* Nothing to print. */
992 break;
993 default:
994 assert(!"Error: Don't know how to print token.");
995 break;
996 }
997 }
998
999 /* Return a new token (ralloc()ed off of 'token') formed by pasting
1000 * 'token' and 'other'. Note that this function may return 'token' or
1001 * 'other' directly rather than allocating anything new.
1002 *
1003 * Caution: Only very cursory error-checking is performed to see if
1004 * the final result is a valid single token. */
1005 static token_t *
1006 _token_paste (glcpp_parser_t *parser, token_t *token, token_t *other)
1007 {
1008 token_t *combined = NULL;
1009
1010 /* Pasting a placeholder onto anything makes no change. */
1011 if (other->type == PLACEHOLDER)
1012 return token;
1013
1014 /* When 'token' is a placeholder, just return 'other'. */
1015 if (token->type == PLACEHOLDER)
1016 return other;
1017
1018 /* A very few single-character punctuators can be combined
1019 * with another to form a multi-character punctuator. */
1020 switch (token->type) {
1021 case '<':
1022 if (other->type == '<')
1023 combined = _token_create_ival (token, LEFT_SHIFT, LEFT_SHIFT);
1024 else if (other->type == '=')
1025 combined = _token_create_ival (token, LESS_OR_EQUAL, LESS_OR_EQUAL);
1026 break;
1027 case '>':
1028 if (other->type == '>')
1029 combined = _token_create_ival (token, RIGHT_SHIFT, RIGHT_SHIFT);
1030 else if (other->type == '=')
1031 combined = _token_create_ival (token, GREATER_OR_EQUAL, GREATER_OR_EQUAL);
1032 break;
1033 case '=':
1034 if (other->type == '=')
1035 combined = _token_create_ival (token, EQUAL, EQUAL);
1036 break;
1037 case '!':
1038 if (other->type == '=')
1039 combined = _token_create_ival (token, NOT_EQUAL, NOT_EQUAL);
1040 break;
1041 case '&':
1042 if (other->type == '&')
1043 combined = _token_create_ival (token, AND, AND);
1044 break;
1045 case '|':
1046 if (other->type == '|')
1047 combined = _token_create_ival (token, OR, OR);
1048 break;
1049 }
1050
1051 if (combined != NULL) {
1052 /* Inherit the location from the first token */
1053 combined->location = token->location;
1054 return combined;
1055 }
1056
1057 /* Two string-valued tokens can usually just be mashed
1058 * together.
1059 *
1060 * XXX: This isn't actually legitimate. Several things here
1061 * should result in a diagnostic since the result cannot be a
1062 * valid, single pre-processing token. For example, pasting
1063 * "123" and "abc" is not legal, but we don't catch that
1064 * here. */
1065 if ((token->type == IDENTIFIER || token->type == OTHER || token->type == INTEGER_STRING) &&
1066 (other->type == IDENTIFIER || other->type == OTHER || other->type == INTEGER_STRING))
1067 {
1068 char *str;
1069
1070 str = ralloc_asprintf (token, "%s%s", token->value.str,
1071 other->value.str);
1072 combined = _token_create_str (token, token->type, str);
1073 combined->location = token->location;
1074 return combined;
1075 }
1076
1077 glcpp_error (&token->location, parser, "");
1078 ralloc_asprintf_rewrite_tail (&parser->info_log, &parser->info_log_length, "Pasting \"");
1079 _token_print (&parser->info_log, &parser->info_log_length, token);
1080 ralloc_asprintf_rewrite_tail (&parser->info_log, &parser->info_log_length, "\" and \"");
1081 _token_print (&parser->info_log, &parser->info_log_length, other);
1082 ralloc_asprintf_rewrite_tail (&parser->info_log, &parser->info_log_length, "\" does not give a valid preprocessing token.\n");
1083
1084 return token;
1085 }
1086
1087 static void
1088 _token_list_print (glcpp_parser_t *parser, token_list_t *list)
1089 {
1090 token_node_t *node;
1091
1092 if (list == NULL)
1093 return;
1094
1095 for (node = list->head; node; node = node->next)
1096 _token_print (&parser->output, &parser->output_length, node->token);
1097 }
1098
1099 void
1100 yyerror (YYLTYPE *locp, glcpp_parser_t *parser, const char *error)
1101 {
1102 glcpp_error(locp, parser, "%s", error);
1103 }
1104
1105 static void add_builtin_define(glcpp_parser_t *parser,
1106 const char *name, int value)
1107 {
1108 token_t *tok;
1109 token_list_t *list;
1110
1111 tok = _token_create_ival (parser, INTEGER, value);
1112
1113 list = _token_list_create(parser);
1114 _token_list_append(list, tok);
1115 _define_object_macro(parser, NULL, name, list);
1116 }
1117
1118 glcpp_parser_t *
1119 glcpp_parser_create (const struct gl_extensions *extensions, int api)
1120 {
1121 glcpp_parser_t *parser;
1122 int language_version;
1123
1124 parser = ralloc (NULL, glcpp_parser_t);
1125
1126 glcpp_lex_init_extra (parser, &parser->scanner);
1127 parser->defines = hash_table_ctor (32, hash_table_string_hash,
1128 hash_table_string_compare);
1129 parser->active = NULL;
1130 parser->lexing_if = 0;
1131 parser->space_tokens = 1;
1132 parser->newline_as_space = 0;
1133 parser->in_control_line = 0;
1134 parser->paren_count = 0;
1135
1136 parser->skip_stack = NULL;
1137
1138 parser->lex_from_list = NULL;
1139 parser->lex_from_node = NULL;
1140
1141 parser->output = ralloc_strdup(parser, "");
1142 parser->output_length = 0;
1143 parser->info_log = ralloc_strdup(parser, "");
1144 parser->info_log_length = 0;
1145 parser->error = 0;
1146
1147 parser->has_new_line_number = 0;
1148 parser->new_line_number = 1;
1149 parser->has_new_source_number = 0;
1150 parser->new_source_number = 0;
1151
1152 /* Add pre-defined macros. */
1153 add_builtin_define(parser, "GL_ARB_draw_buffers", 1);
1154 add_builtin_define(parser, "GL_ARB_texture_rectangle", 1);
1155
1156 if (api == API_OPENGLES2)
1157 add_builtin_define(parser, "GL_ES", 1);
1158
1159 if (extensions != NULL) {
1160 if (extensions->EXT_texture_array) {
1161 add_builtin_define(parser, "GL_EXT_texture_array", 1);
1162 }
1163
1164 if (extensions->ARB_fragment_coord_conventions)
1165 add_builtin_define(parser, "GL_ARB_fragment_coord_conventions",
1166 1);
1167
1168 if (extensions->ARB_explicit_attrib_location)
1169 add_builtin_define(parser, "GL_ARB_explicit_attrib_location", 1);
1170
1171 if (extensions->ARB_shader_texture_lod)
1172 add_builtin_define(parser, "GL_ARB_shader_texture_lod", 1);
1173
1174 if (extensions->ARB_draw_instanced)
1175 add_builtin_define(parser, "GL_ARB_draw_instanced", 1);
1176
1177 if (extensions->ARB_conservative_depth) {
1178 add_builtin_define(parser, "GL_AMD_conservative_depth", 1);
1179 add_builtin_define(parser, "GL_ARB_conservative_depth", 1);
1180 }
1181
1182 if (extensions->OES_EGL_image_external)
1183 add_builtin_define(parser, "GL_OES_EGL_image_external", 1);
1184
1185 if (extensions->ARB_shader_bit_encoding)
1186 add_builtin_define(parser, "GL_ARB_shader_bit_encoding", 1);
1187
1188 if (extensions->ARB_uniform_buffer_object)
1189 add_builtin_define(parser, "GL_ARB_uniform_buffer_object", 1);
1190
1191 if (extensions->ARB_texture_cube_map_array)
1192 add_builtin_define(parser, "GL_ARB_texture_cube_map_array", 1);
1193 }
1194
1195 language_version = 110;
1196 add_builtin_define(parser, "__VERSION__", language_version);
1197
1198 return parser;
1199 }
1200
1201 void
1202 glcpp_parser_destroy (glcpp_parser_t *parser)
1203 {
1204 glcpp_lex_destroy (parser->scanner);
1205 hash_table_dtor (parser->defines);
1206 ralloc_free (parser);
1207 }
1208
1209 typedef enum function_status
1210 {
1211 FUNCTION_STATUS_SUCCESS,
1212 FUNCTION_NOT_A_FUNCTION,
1213 FUNCTION_UNBALANCED_PARENTHESES
1214 } function_status_t;
1215
1216 /* Find a set of function-like macro arguments by looking for a
1217 * balanced set of parentheses.
1218 *
1219 * When called, 'node' should be the opening-parenthesis token, (or
1220 * perhaps preceeding SPACE tokens). Upon successful return *last will
1221 * be the last consumed node, (corresponding to the closing right
1222 * parenthesis).
1223 *
1224 * Return values:
1225 *
1226 * FUNCTION_STATUS_SUCCESS:
1227 *
1228 * Successfully parsed a set of function arguments.
1229 *
1230 * FUNCTION_NOT_A_FUNCTION:
1231 *
1232 * Macro name not followed by a '('. This is not an error, but
1233 * simply that the macro name should be treated as a non-macro.
1234 *
1235 * FUNCTION_UNBALANCED_PARENTHESES
1236 *
1237 * Macro name is not followed by a balanced set of parentheses.
1238 */
1239 static function_status_t
1240 _arguments_parse (argument_list_t *arguments,
1241 token_node_t *node,
1242 token_node_t **last)
1243 {
1244 token_list_t *argument;
1245 int paren_count;
1246
1247 node = node->next;
1248
1249 /* Ignore whitespace before first parenthesis. */
1250 while (node && node->token->type == SPACE)
1251 node = node->next;
1252
1253 if (node == NULL || node->token->type != '(')
1254 return FUNCTION_NOT_A_FUNCTION;
1255
1256 node = node->next;
1257
1258 argument = _token_list_create (arguments);
1259 _argument_list_append (arguments, argument);
1260
1261 for (paren_count = 1; node; node = node->next) {
1262 if (node->token->type == '(')
1263 {
1264 paren_count++;
1265 }
1266 else if (node->token->type == ')')
1267 {
1268 paren_count--;
1269 if (paren_count == 0)
1270 break;
1271 }
1272
1273 if (node->token->type == ',' &&
1274 paren_count == 1)
1275 {
1276 _token_list_trim_trailing_space (argument);
1277 argument = _token_list_create (arguments);
1278 _argument_list_append (arguments, argument);
1279 }
1280 else {
1281 if (argument->head == NULL) {
1282 /* Don't treat initial whitespace as
1283 * part of the arguement. */
1284 if (node->token->type == SPACE)
1285 continue;
1286 }
1287 _token_list_append (argument, node->token);
1288 }
1289 }
1290
1291 if (paren_count)
1292 return FUNCTION_UNBALANCED_PARENTHESES;
1293
1294 *last = node;
1295
1296 return FUNCTION_STATUS_SUCCESS;
1297 }
1298
1299 static token_list_t *
1300 _token_list_create_with_one_space (void *ctx)
1301 {
1302 token_list_t *list;
1303 token_t *space;
1304
1305 list = _token_list_create (ctx);
1306 space = _token_create_ival (list, SPACE, SPACE);
1307 _token_list_append (list, space);
1308
1309 return list;
1310 }
1311
1312 /* Perform macro expansion on 'list', placing the resulting tokens
1313 * into a new list which is initialized with a first token of type
1314 * 'head_token_type'. Then begin lexing from the resulting list,
1315 * (return to the current lexing source when this list is exhausted).
1316 */
1317 static void
1318 _glcpp_parser_expand_and_lex_from (glcpp_parser_t *parser,
1319 int head_token_type,
1320 token_list_t *list)
1321 {
1322 token_list_t *expanded;
1323 token_t *token;
1324
1325 expanded = _token_list_create (parser);
1326 token = _token_create_ival (parser, head_token_type, head_token_type);
1327 _token_list_append (expanded, token);
1328 _glcpp_parser_expand_token_list (parser, list);
1329 _token_list_append_list (expanded, list);
1330 glcpp_parser_lex_from (parser, expanded);
1331 }
1332
1333 static void
1334 _glcpp_parser_apply_pastes (glcpp_parser_t *parser, token_list_t *list)
1335 {
1336 token_node_t *node;
1337
1338 node = list->head;
1339 while (node)
1340 {
1341 token_node_t *next_non_space;
1342
1343 /* Look ahead for a PASTE token, skipping space. */
1344 next_non_space = node->next;
1345 while (next_non_space && next_non_space->token->type == SPACE)
1346 next_non_space = next_non_space->next;
1347
1348 if (next_non_space == NULL)
1349 break;
1350
1351 if (next_non_space->token->type != PASTE) {
1352 node = next_non_space;
1353 continue;
1354 }
1355
1356 /* Now find the next non-space token after the PASTE. */
1357 next_non_space = next_non_space->next;
1358 while (next_non_space && next_non_space->token->type == SPACE)
1359 next_non_space = next_non_space->next;
1360
1361 if (next_non_space == NULL) {
1362 yyerror (&node->token->location, parser, "'##' cannot appear at either end of a macro expansion\n");
1363 return;
1364 }
1365
1366 node->token = _token_paste (parser, node->token, next_non_space->token);
1367 node->next = next_non_space->next;
1368 if (next_non_space == list->tail)
1369 list->tail = node;
1370 }
1371
1372 list->non_space_tail = list->tail;
1373 }
1374
1375 /* This is a helper function that's essentially part of the
1376 * implementation of _glcpp_parser_expand_node. It shouldn't be called
1377 * except for by that function.
1378 *
1379 * Returns NULL if node is a simple token with no expansion, (that is,
1380 * although 'node' corresponds to an identifier defined as a
1381 * function-like macro, it is not followed with a parenthesized
1382 * argument list).
1383 *
1384 * Compute the complete expansion of node (which is a function-like
1385 * macro) and subsequent nodes which are arguments.
1386 *
1387 * Returns the token list that results from the expansion and sets
1388 * *last to the last node in the list that was consumed by the
1389 * expansion. Specifically, *last will be set as follows: as the
1390 * token of the closing right parenthesis.
1391 */
1392 static token_list_t *
1393 _glcpp_parser_expand_function (glcpp_parser_t *parser,
1394 token_node_t *node,
1395 token_node_t **last)
1396
1397 {
1398 macro_t *macro;
1399 const char *identifier;
1400 argument_list_t *arguments;
1401 function_status_t status;
1402 token_list_t *substituted;
1403 int parameter_index;
1404
1405 identifier = node->token->value.str;
1406
1407 macro = hash_table_find (parser->defines, identifier);
1408
1409 assert (macro->is_function);
1410
1411 arguments = _argument_list_create (parser);
1412 status = _arguments_parse (arguments, node, last);
1413
1414 switch (status) {
1415 case FUNCTION_STATUS_SUCCESS:
1416 break;
1417 case FUNCTION_NOT_A_FUNCTION:
1418 return NULL;
1419 case FUNCTION_UNBALANCED_PARENTHESES:
1420 glcpp_error (&node->token->location, parser, "Macro %s call has unbalanced parentheses\n", identifier);
1421 return NULL;
1422 }
1423
1424 /* Replace a macro defined as empty with a SPACE token. */
1425 if (macro->replacements == NULL) {
1426 ralloc_free (arguments);
1427 return _token_list_create_with_one_space (parser);
1428 }
1429
1430 if (! ((_argument_list_length (arguments) ==
1431 _string_list_length (macro->parameters)) ||
1432 (_string_list_length (macro->parameters) == 0 &&
1433 _argument_list_length (arguments) == 1 &&
1434 arguments->head->argument->head == NULL)))
1435 {
1436 glcpp_error (&node->token->location, parser,
1437 "Error: macro %s invoked with %d arguments (expected %d)\n",
1438 identifier,
1439 _argument_list_length (arguments),
1440 _string_list_length (macro->parameters));
1441 return NULL;
1442 }
1443
1444 /* Perform argument substitution on the replacement list. */
1445 substituted = _token_list_create (arguments);
1446
1447 for (node = macro->replacements->head; node; node = node->next)
1448 {
1449 if (node->token->type == IDENTIFIER &&
1450 _string_list_contains (macro->parameters,
1451 node->token->value.str,
1452 &parameter_index))
1453 {
1454 token_list_t *argument;
1455 argument = _argument_list_member_at (arguments,
1456 parameter_index);
1457 /* Before substituting, we expand the argument
1458 * tokens, or append a placeholder token for
1459 * an empty argument. */
1460 if (argument->head) {
1461 token_list_t *expanded_argument;
1462 expanded_argument = _token_list_copy (parser,
1463 argument);
1464 _glcpp_parser_expand_token_list (parser,
1465 expanded_argument);
1466 _token_list_append_list (substituted,
1467 expanded_argument);
1468 } else {
1469 token_t *new_token;
1470
1471 new_token = _token_create_ival (substituted,
1472 PLACEHOLDER,
1473 PLACEHOLDER);
1474 _token_list_append (substituted, new_token);
1475 }
1476 } else {
1477 _token_list_append (substituted, node->token);
1478 }
1479 }
1480
1481 /* After argument substitution, and before further expansion
1482 * below, implement token pasting. */
1483
1484 _token_list_trim_trailing_space (substituted);
1485
1486 _glcpp_parser_apply_pastes (parser, substituted);
1487
1488 return substituted;
1489 }
1490
1491 /* Compute the complete expansion of node, (and subsequent nodes after
1492 * 'node' in the case that 'node' is a function-like macro and
1493 * subsequent nodes are arguments).
1494 *
1495 * Returns NULL if node is a simple token with no expansion.
1496 *
1497 * Otherwise, returns the token list that results from the expansion
1498 * and sets *last to the last node in the list that was consumed by
1499 * the expansion. Specifically, *last will be set as follows:
1500 *
1501 * As 'node' in the case of object-like macro expansion.
1502 *
1503 * As the token of the closing right parenthesis in the case of
1504 * function-like macro expansion.
1505 */
1506 static token_list_t *
1507 _glcpp_parser_expand_node (glcpp_parser_t *parser,
1508 token_node_t *node,
1509 token_node_t **last)
1510 {
1511 token_t *token = node->token;
1512 const char *identifier;
1513 macro_t *macro;
1514
1515 /* We only expand identifiers */
1516 if (token->type != IDENTIFIER) {
1517 /* We change any COMMA into a COMMA_FINAL to prevent
1518 * it being mistaken for an argument separator
1519 * later. */
1520 if (token->type == ',') {
1521 token->type = COMMA_FINAL;
1522 token->value.ival = COMMA_FINAL;
1523 }
1524
1525 return NULL;
1526 }
1527
1528 /* Look up this identifier in the hash table. */
1529 identifier = token->value.str;
1530 macro = hash_table_find (parser->defines, identifier);
1531
1532 /* Not a macro, so no expansion needed. */
1533 if (macro == NULL)
1534 return NULL;
1535
1536 /* Finally, don't expand this macro if we're already actively
1537 * expanding it, (to avoid infinite recursion). */
1538 if (_parser_active_list_contains (parser, identifier)) {
1539 /* We change the token type here from IDENTIFIER to
1540 * OTHER to prevent any future expansion of this
1541 * unexpanded token. */
1542 char *str;
1543 token_list_t *expansion;
1544 token_t *final;
1545
1546 str = ralloc_strdup (parser, token->value.str);
1547 final = _token_create_str (parser, OTHER, str);
1548 expansion = _token_list_create (parser);
1549 _token_list_append (expansion, final);
1550 *last = node;
1551 return expansion;
1552 }
1553
1554 if (! macro->is_function)
1555 {
1556 token_list_t *replacement;
1557 *last = node;
1558
1559 /* Replace a macro defined as empty with a SPACE token. */
1560 if (macro->replacements == NULL)
1561 return _token_list_create_with_one_space (parser);
1562
1563 replacement = _token_list_copy (parser, macro->replacements);
1564 _glcpp_parser_apply_pastes (parser, replacement);
1565 return replacement;
1566 }
1567
1568 return _glcpp_parser_expand_function (parser, node, last);
1569 }
1570
1571 /* Push a new identifier onto the parser's active list.
1572 *
1573 * Here, 'marker' is the token node that appears in the list after the
1574 * expansion of 'identifier'. That is, when the list iterator begins
1575 * examining 'marker', then it is time to pop this node from the
1576 * active stack.
1577 */
1578 static void
1579 _parser_active_list_push (glcpp_parser_t *parser,
1580 const char *identifier,
1581 token_node_t *marker)
1582 {
1583 active_list_t *node;
1584
1585 node = ralloc (parser->active, active_list_t);
1586 node->identifier = ralloc_strdup (node, identifier);
1587 node->marker = marker;
1588 node->next = parser->active;
1589
1590 parser->active = node;
1591 }
1592
1593 static void
1594 _parser_active_list_pop (glcpp_parser_t *parser)
1595 {
1596 active_list_t *node = parser->active;
1597
1598 if (node == NULL) {
1599 parser->active = NULL;
1600 return;
1601 }
1602
1603 node = parser->active->next;
1604 ralloc_free (parser->active);
1605
1606 parser->active = node;
1607 }
1608
1609 static int
1610 _parser_active_list_contains (glcpp_parser_t *parser, const char *identifier)
1611 {
1612 active_list_t *node;
1613
1614 if (parser->active == NULL)
1615 return 0;
1616
1617 for (node = parser->active; node; node = node->next)
1618 if (strcmp (node->identifier, identifier) == 0)
1619 return 1;
1620
1621 return 0;
1622 }
1623
1624 /* Walk over the token list replacing nodes with their expansion.
1625 * Whenever nodes are expanded the walking will walk over the new
1626 * nodes, continuing to expand as necessary. The results are placed in
1627 * 'list' itself;
1628 */
1629 static void
1630 _glcpp_parser_expand_token_list (glcpp_parser_t *parser,
1631 token_list_t *list)
1632 {
1633 token_node_t *node_prev;
1634 token_node_t *node, *last = NULL;
1635 token_list_t *expansion;
1636 active_list_t *active_initial = parser->active;
1637
1638 if (list == NULL)
1639 return;
1640
1641 _token_list_trim_trailing_space (list);
1642
1643 node_prev = NULL;
1644 node = list->head;
1645
1646 while (node) {
1647
1648 while (parser->active && parser->active->marker == node)
1649 _parser_active_list_pop (parser);
1650
1651 expansion = _glcpp_parser_expand_node (parser, node, &last);
1652 if (expansion) {
1653 token_node_t *n;
1654
1655 for (n = node; n != last->next; n = n->next)
1656 while (parser->active &&
1657 parser->active->marker == n)
1658 {
1659 _parser_active_list_pop (parser);
1660 }
1661
1662 _parser_active_list_push (parser,
1663 node->token->value.str,
1664 last->next);
1665
1666 /* Splice expansion into list, supporting a
1667 * simple deletion if the expansion is
1668 * empty. */
1669 if (expansion->head) {
1670 if (node_prev)
1671 node_prev->next = expansion->head;
1672 else
1673 list->head = expansion->head;
1674 expansion->tail->next = last->next;
1675 if (last == list->tail)
1676 list->tail = expansion->tail;
1677 } else {
1678 if (node_prev)
1679 node_prev->next = last->next;
1680 else
1681 list->head = last->next;
1682 if (last == list->tail)
1683 list->tail = NULL;
1684 }
1685 } else {
1686 node_prev = node;
1687 }
1688 node = node_prev ? node_prev->next : list->head;
1689 }
1690
1691 /* Remove any lingering effects of this invocation on the
1692 * active list. That is, pop until the list looks like it did
1693 * at the beginning of this function. */
1694 while (parser->active && parser->active != active_initial)
1695 _parser_active_list_pop (parser);
1696
1697 list->non_space_tail = list->tail;
1698 }
1699
1700 void
1701 _glcpp_parser_print_expanded_token_list (glcpp_parser_t *parser,
1702 token_list_t *list)
1703 {
1704 if (list == NULL)
1705 return;
1706
1707 _glcpp_parser_expand_token_list (parser, list);
1708
1709 _token_list_trim_trailing_space (list);
1710
1711 _token_list_print (parser, list);
1712 }
1713
1714 static void
1715 _check_for_reserved_macro_name (glcpp_parser_t *parser, YYLTYPE *loc,
1716 const char *identifier)
1717 {
1718 /* According to the GLSL specification, macro names starting with "__"
1719 * or "GL_" are reserved for future use. So, don't allow them.
1720 */
1721 if (strstr(identifier, "__")) {
1722 glcpp_error (loc, parser, "Macro names containing \"__\" are reserved.\n");
1723 }
1724 if (strncmp(identifier, "GL_", 3) == 0) {
1725 glcpp_error (loc, parser, "Macro names starting with \"GL_\" are reserved.\n");
1726 }
1727 }
1728
1729 static int
1730 _macro_equal (macro_t *a, macro_t *b)
1731 {
1732 if (a->is_function != b->is_function)
1733 return 0;
1734
1735 if (a->is_function) {
1736 if (! _string_list_equal (a->parameters, b->parameters))
1737 return 0;
1738 }
1739
1740 return _token_list_equal_ignoring_space (a->replacements,
1741 b->replacements);
1742 }
1743
1744 void
1745 _define_object_macro (glcpp_parser_t *parser,
1746 YYLTYPE *loc,
1747 const char *identifier,
1748 token_list_t *replacements)
1749 {
1750 macro_t *macro, *previous;
1751
1752 if (loc != NULL)
1753 _check_for_reserved_macro_name(parser, loc, identifier);
1754
1755 macro = ralloc (parser, macro_t);
1756
1757 macro->is_function = 0;
1758 macro->parameters = NULL;
1759 macro->identifier = ralloc_strdup (macro, identifier);
1760 macro->replacements = replacements;
1761 ralloc_steal (macro, replacements);
1762
1763 previous = hash_table_find (parser->defines, identifier);
1764 if (previous) {
1765 if (_macro_equal (macro, previous)) {
1766 ralloc_free (macro);
1767 return;
1768 }
1769 glcpp_error (loc, parser, "Redefinition of macro %s\n",
1770 identifier);
1771 }
1772
1773 hash_table_insert (parser->defines, macro, identifier);
1774 }
1775
1776 void
1777 _define_function_macro (glcpp_parser_t *parser,
1778 YYLTYPE *loc,
1779 const char *identifier,
1780 string_list_t *parameters,
1781 token_list_t *replacements)
1782 {
1783 macro_t *macro, *previous;
1784
1785 _check_for_reserved_macro_name(parser, loc, identifier);
1786
1787 macro = ralloc (parser, macro_t);
1788 ralloc_steal (macro, parameters);
1789 ralloc_steal (macro, replacements);
1790
1791 macro->is_function = 1;
1792 macro->parameters = parameters;
1793 macro->identifier = ralloc_strdup (macro, identifier);
1794 macro->replacements = replacements;
1795 previous = hash_table_find (parser->defines, identifier);
1796 if (previous) {
1797 if (_macro_equal (macro, previous)) {
1798 ralloc_free (macro);
1799 return;
1800 }
1801 glcpp_error (loc, parser, "Redefinition of macro %s\n",
1802 identifier);
1803 }
1804
1805 hash_table_insert (parser->defines, macro, identifier);
1806 }
1807
1808 static int
1809 glcpp_parser_lex (YYSTYPE *yylval, YYLTYPE *yylloc, glcpp_parser_t *parser)
1810 {
1811 token_node_t *node;
1812 int ret;
1813
1814 if (parser->lex_from_list == NULL) {
1815 ret = glcpp_lex (yylval, yylloc, parser->scanner);
1816
1817 /* XXX: This ugly block of code exists for the sole
1818 * purpose of converting a NEWLINE token into a SPACE
1819 * token, but only in the case where we have seen a
1820 * function-like macro name, but have not yet seen its
1821 * closing parenthesis.
1822 *
1823 * There's perhaps a more compact way to do this with
1824 * mid-rule actions in the grammar.
1825 *
1826 * I'm definitely not pleased with the complexity of
1827 * this code here.
1828 */
1829 if (parser->newline_as_space)
1830 {
1831 if (ret == '(') {
1832 parser->paren_count++;
1833 } else if (ret == ')') {
1834 parser->paren_count--;
1835 if (parser->paren_count == 0)
1836 parser->newline_as_space = 0;
1837 } else if (ret == NEWLINE) {
1838 ret = SPACE;
1839 } else if (ret != SPACE) {
1840 if (parser->paren_count == 0)
1841 parser->newline_as_space = 0;
1842 }
1843 }
1844 else if (parser->in_control_line)
1845 {
1846 if (ret == NEWLINE)
1847 parser->in_control_line = 0;
1848 }
1849 else if (ret == HASH_DEFINE ||
1850 ret == HASH_UNDEF || ret == HASH_IF ||
1851 ret == HASH_IFDEF || ret == HASH_IFNDEF ||
1852 ret == HASH_ELIF || ret == HASH_ELSE ||
1853 ret == HASH_ENDIF || ret == HASH)
1854 {
1855 parser->in_control_line = 1;
1856 }
1857 else if (ret == IDENTIFIER)
1858 {
1859 macro_t *macro;
1860 macro = hash_table_find (parser->defines,
1861 yylval->str);
1862 if (macro && macro->is_function) {
1863 parser->newline_as_space = 1;
1864 parser->paren_count = 0;
1865 }
1866 }
1867
1868 return ret;
1869 }
1870
1871 node = parser->lex_from_node;
1872
1873 if (node == NULL) {
1874 ralloc_free (parser->lex_from_list);
1875 parser->lex_from_list = NULL;
1876 return NEWLINE;
1877 }
1878
1879 *yylval = node->token->value;
1880 ret = node->token->type;
1881
1882 parser->lex_from_node = node->next;
1883
1884 return ret;
1885 }
1886
1887 static void
1888 glcpp_parser_lex_from (glcpp_parser_t *parser, token_list_t *list)
1889 {
1890 token_node_t *node;
1891
1892 assert (parser->lex_from_list == NULL);
1893
1894 /* Copy list, eliminating any space tokens. */
1895 parser->lex_from_list = _token_list_create (parser);
1896
1897 for (node = list->head; node; node = node->next) {
1898 if (node->token->type == SPACE)
1899 continue;
1900 _token_list_append (parser->lex_from_list, node->token);
1901 }
1902
1903 ralloc_free (list);
1904
1905 parser->lex_from_node = parser->lex_from_list->head;
1906
1907 /* It's possible the list consisted of nothing but whitespace. */
1908 if (parser->lex_from_node == NULL) {
1909 ralloc_free (parser->lex_from_list);
1910 parser->lex_from_list = NULL;
1911 }
1912 }
1913
1914 static void
1915 _glcpp_parser_skip_stack_push_if (glcpp_parser_t *parser, YYLTYPE *loc,
1916 int condition)
1917 {
1918 skip_type_t current = SKIP_NO_SKIP;
1919 skip_node_t *node;
1920
1921 if (parser->skip_stack)
1922 current = parser->skip_stack->type;
1923
1924 node = ralloc (parser, skip_node_t);
1925 node->loc = *loc;
1926
1927 if (current == SKIP_NO_SKIP) {
1928 if (condition)
1929 node->type = SKIP_NO_SKIP;
1930 else
1931 node->type = SKIP_TO_ELSE;
1932 } else {
1933 node->type = SKIP_TO_ENDIF;
1934 }
1935
1936 node->next = parser->skip_stack;
1937 parser->skip_stack = node;
1938 }
1939
1940 static void
1941 _glcpp_parser_skip_stack_change_if (glcpp_parser_t *parser, YYLTYPE *loc,
1942 const char *type, int condition)
1943 {
1944 if (parser->skip_stack == NULL) {
1945 glcpp_error (loc, parser, "%s without #if\n", type);
1946 return;
1947 }
1948
1949 if (parser->skip_stack->type == SKIP_TO_ELSE) {
1950 if (condition)
1951 parser->skip_stack->type = SKIP_NO_SKIP;
1952 } else {
1953 parser->skip_stack->type = SKIP_TO_ENDIF;
1954 }
1955 }
1956
1957 static void
1958 _glcpp_parser_skip_stack_pop (glcpp_parser_t *parser, YYLTYPE *loc)
1959 {
1960 skip_node_t *node;
1961
1962 if (parser->skip_stack == NULL) {
1963 glcpp_error (loc, parser, "#endif without #if\n");
1964 return;
1965 }
1966
1967 node = parser->skip_stack;
1968 parser->skip_stack = node->next;
1969 ralloc_free (node);
1970 }