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