/
hlslang.y
2529 lines (2309 loc) · 85.7 KB
/
hlslang.y
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) The HLSL2GLSLFork Project Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE.txt file.
// Bison grammar and production code for parsing HLSL
%{
/* Based on:
ANSI C Yacc grammar
In 1985, Jeff Lee published his Yacc grammar (which is accompanied by a
matching Lex specification) for the April 30, 1985 draft version of the
ANSI C standard. Tom Stockfisch reposted it to net.sources in 1987; that
original, as mentioned in the answer to question 17.25 of the comp.lang.c
FAQ, can be ftp'ed from ftp.uu.net, file usenet/net.sources/ansi.c.grammar.Z.
I intend to keep this version as close to the current C Standard grammar as
possible; please let me know if you discover discrepancies.
Jutta Degener, 1995
*/
#include "SymbolTable.h"
#include "ParseHelper.h"
#include "../../include/hlsl2glsl.h"
#ifdef _WIN32
#define YYPARSE_PARAM parseContext
#define YYPARSE_PARAM_DECL TParseContext&
#define YY_DECL int yylex(YYSTYPE* pyylval, TParseContext& parseContext)
#define YYLEX_PARAM parseContext
#else
#define YYPARSE_PARAM parseContextLocal
#define parseContext (*((TParseContext*)(parseContextLocal)))
#define YY_DECL int yylex(YYSTYPE* pyylval, void* parseContextLocal)
#define YYLEX_PARAM (void*)(parseContextLocal)
extern void yyerror(const char*);
#endif
#define FRAG_ONLY(S, L) { \
if (parseContext.language != EShLangFragment) { \
parseContext.error(L, " supported in fragment shaders only ", S, "", ""); \
parseContext.recover(); \
} \
}
#define UNSUPPORTED_FEATURE(S, L) { \
parseContext.error(L, " not supported ", S, "", ""); \
parseContext.recover(); \
}
#define SET_BASIC_TYPE(RES,PAR,T,PREC) \
TQualifier qual = parseContext.getDefaultQualifier(); \
(RES).setBasic(T, qual, (PAR).line); \
(RES).precision = PREC
%}
%union {
struct {
TSourceLoc line;
union {
TString *string;
float f;
int i;
bool b;
};
TSymbol* symbol;
} lex;
struct {
TSourceLoc line;
TOperator op;
union {
TIntermNode* intermNode;
TIntermNodePair nodePair;
TIntermTyped* intermTypedNode;
TIntermAggregate* intermAggregate;
TIntermTyped* intermDeclaration;
};
union {
TPublicType type;
TQualifier qualifier;
TFunction* function;
TParameter param;
TTypeLine typeLine;
TTypeList* typeList;
TAnnotation* ann;
TTypeInfo* typeInfo;
};
} interm;
}
%{
#ifndef _WIN32
extern int yylex(YYSTYPE*, void*);
#endif
%}
%pure_parser /* Just in case is called from multiple threads */
%expect 1 /* One shift reduce conflict because of if | else */
%token <lex> CONST_QUAL STATIC_QUAL BOOL_TYPE FLOAT_TYPE INT_TYPE STRING_TYPE FIXED_TYPE HALF_TYPE
%token <lex> BREAK CONTINUE DO ELSE FOR IF DISCARD RETURN
%token <lex> BVEC2 BVEC3 BVEC4 IVEC2 IVEC3 IVEC4 VEC2 VEC3 VEC4 HVEC2 HVEC3 HVEC4 FVEC2 FVEC3 FVEC4
%token <lex> MATRIX2x2 MATRIX2x3 MATRIX2x4 MATRIX3x2 MATRIX3x3 MATRIX3x4 MATRIX4x2 MATRIX4x3 MATRIX4x4
%token <lex> HMATRIX2x2 HMATRIX2x3 HMATRIX2x4 HMATRIX3x2 HMATRIX3x3 HMATRIX3x4 HMATRIX4x2 HMATRIX4x3 HMATRIX4x4
%token <lex> FMATRIX2x2 FMATRIX2x3 FMATRIX2x4 FMATRIX3x2 FMATRIX3x3 FMATRIX3x4 FMATRIX4x2 FMATRIX4x3 FMATRIX4x4
%token <lex> IN_QUAL OUT_QUAL INOUT_QUAL UNIFORM
%token <lex> STRUCT VOID_TYPE WHILE
%token <lex> SAMPLER1D SAMPLER2D SAMPLER3D SAMPLERCUBE SAMPLER1DSHADOW SAMPLER2DSHADOW SAMPLERRECTSHADOW SAMPLERRECT
%token <lex> SAMPLER2D_HALF SAMPLER2D_FLOAT SAMPLERCUBE_HALF SAMPLERCUBE_FLOAT
%token <lex> SAMPLERGENERIC VECTOR MATRIX REGISTER TEXTURE SAMPLERSTATE
%token <lex> IDENTIFIER TYPE_NAME FLOATCONSTANT INTCONSTANT BOOLCONSTANT STRINGCONSTANT
%token <lex> FIELD_SELECTION
%token <lex> LEFT_OP RIGHT_OP
%token <lex> INC_OP DEC_OP LE_OP GE_OP EQ_OP NE_OP
%token <lex> AND_OP OR_OP XOR_OP MUL_ASSIGN DIV_ASSIGN ADD_ASSIGN
%token <lex> MOD_ASSIGN LEFT_ASSIGN RIGHT_ASSIGN AND_ASSIGN XOR_ASSIGN OR_ASSIGN
%token <lex> SUB_ASSIGN
%type <lex> ann_numerical_constant
%token <lex> LEFT_PAREN RIGHT_PAREN LEFT_BRACKET RIGHT_BRACKET LEFT_BRACE RIGHT_BRACE DOT
%token <lex> COMMA COLON EQUAL SEMICOLON BANG DASH TILDE PLUS STAR SLASH PERCENT
%token <lex> LEFT_ANGLE RIGHT_ANGLE VERTICAL_BAR CARET AMPERSAND QUESTION
%type <interm> assignment_operator unary_operator
%type <interm.intermTypedNode> variable_identifier primary_expression postfix_expression
%type <interm.intermTypedNode> expression int_expression assign_expression
%type <interm.intermTypedNode> unary_expression mul_expression add_expression
%type <interm.intermTypedNode> rel_expression eq_expression
%type <interm.intermTypedNode> cond_expression const_expression
%type <interm.intermTypedNode> log_or_expression log_xor_expression log_and_expression
%type <interm.intermTypedNode> shift_expression and_expression xor_expression or_expression
%type <interm.intermTypedNode> function_call initializer condition conditionopt
%type <interm.intermTypedNode> initialization_list sampler_initializer
%type <interm.intermAggregate> initializer_list
%type <interm.intermNode> translation_unit function_definition
%type <interm.intermNode> statement simple_statement
%type <interm.intermAggregate> statement_list compound_statement
%type <interm.intermNode> declaration_statement selection_statement expression_statement
%type <interm.intermNode> external_declaration
%type <interm.intermDeclaration> declaration
%type <interm.intermNode> for_init_statement compound_statement_no_new_scope
%type <interm.nodePair> selection_rest_statement for_rest_statement
%type <interm.intermNode> iteration_statement jump_statement statement_no_new_scope
%type <interm.intermDeclaration> single_declaration init_declarator_list
%type <interm> parameter_declaration parameter_declarator parameter_type_specifier
%type <interm.qualifier> parameter_qualifier
%type <interm.type> type_qualifier fully_specified_type type_specifier
%type <interm.type> type_specifier_nonarray
%type <interm.type> struct_specifier
%type <interm.typeLine> struct_declarator
%type <interm.typeList> struct_declarator_list struct_declaration struct_declaration_list
%type <interm.function> function_header function_declarator function_identifier
%type <interm.function> function_header_with_parameters function_call_header
%type <interm> function_call_header_with_parameters function_call_header_no_parameters function_call_generic function_prototype
%type <interm> function_call_or_method
%type <interm.ann> annotation annotation_list
%type <interm.typeInfo> type_info
%type <lex> annotation_item semantic
%start translation_unit
%%
variable_identifier
: IDENTIFIER {
// The symbol table search was done in the lexical phase
const TSymbol* symbol = $1.symbol;
const TVariable* variable;
if (symbol == 0) {
parseContext.error($1.line, "undeclared identifier", $1.string->c_str(), "");
parseContext.recover();
TType type(EbtFloat, EbpUndefined);
TVariable* fakeVariable = new TVariable($1.string, type);
parseContext.symbolTable.insert(*fakeVariable);
variable = fakeVariable;
} else {
// This identifier can only be a variable type symbol
if (! symbol->isVariable()) {
parseContext.error($1.line, "variable expected", $1.string->c_str(), "");
parseContext.recover();
}
variable = static_cast<const TVariable*>(symbol);
}
// don't delete $1.string, it's used by error recovery, and the pool
// pop will reclaim the memory
if (variable->getType().getQualifier() == EvqConst && variable->constValue)
{
TIntermConstant* c = ir_add_constant(variable->getType(), $1.line);
c->copyValuesFrom(*variable->constValue);
$$ = c;
}
else
{
TIntermSymbol* sym = ir_add_symbol(variable, $1.line);
$$ = sym;
}
}
;
primary_expression
: variable_identifier {
$$ = $1;
}
| INTCONSTANT {
TIntermConstant* constant = ir_add_constant(TType(EbtInt, EbpUndefined, EvqConst), $1.line);
constant->setValue($1.i);
$$ = constant;
}
| FLOATCONSTANT {
TIntermConstant* constant = ir_add_constant(TType(EbtFloat, EbpUndefined, EvqConst), $1.line);
constant->setValue($1.f);
$$ = constant;
}
| BOOLCONSTANT {
TIntermConstant* constant = ir_add_constant(TType(EbtBool, EbpUndefined, EvqConst), $1.line);
constant->setValue($1.b);
$$ = constant;
}
| LEFT_PAREN expression RIGHT_PAREN {
$$ = $2;
}
;
postfix_expression
: primary_expression {
$$ = $1;
}
| postfix_expression LEFT_BRACKET int_expression RIGHT_BRACKET {
if (!$1) {
parseContext.error($2.line, " left of '[' is null ", "expression", "");
YYERROR;
}
if (!$1->isArray() && !$1->isMatrix() && !$1->isVector()) {
if ($1->getAsSymbolNode())
parseContext.error($2.line, " left of '[' is not of type array, matrix, or vector ", $1->getAsSymbolNode()->getSymbol().c_str(), "");
else
parseContext.error($2.line, " left of '[' is not of type array, matrix, or vector ", "expression", "");
parseContext.recover();
}
if ($3->getQualifier() == EvqConst) {
if (($1->isVector() || $1->isMatrix()) && $1->getType().getRowsCount() <= $3->getAsConstant()->toInt() && !$1->isArray() ) {
parseContext.error($2.line, "", "[", "field selection out of range '%d'", $3->getAsConstant()->toInt());
parseContext.recover();
} else {
if ($1->isArray()) {
if ($1->getType().getArraySize() == 0) {
if ($1->getType().getMaxArraySize() <= $3->getAsConstant()->toInt()) {
if (parseContext.arraySetMaxSize($1->getAsSymbolNode(), $1->getTypePointer(), $3->getAsConstant()->toInt(), true, $2.line))
parseContext.recover();
} else {
if (parseContext.arraySetMaxSize($1->getAsSymbolNode(), $1->getTypePointer(), 0, false, $2.line))
parseContext.recover();
}
} else if ( $3->getAsConstant()->toInt() >= $1->getType().getArraySize()) {
parseContext.error($2.line, "", "[", "array index out of range '%d'", $3->getAsConstant()->toInt());
parseContext.recover();
}
}
$$ = ir_add_index(EOpIndexDirect, $1, $3, $2.line);
}
} else {
if ($1->isArray() && $1->getType().getArraySize() == 0) {
parseContext.error($2.line, "", "[", "array must be redeclared with a size before being indexed with a variable");
parseContext.recover();
}
$$ = ir_add_index(EOpIndexIndirect, $1, $3, $2.line);
}
if ($$ == 0) {
TIntermConstant* constant = ir_add_constant(TType(EbtFloat, EbpUndefined, EvqConst), $2.line);
constant->setValue(0.f);
$$ = constant;
} else if ($1->isArray()) {
if ($1->getType().getStruct())
$$->setType(TType($1->getType().getStruct(), $1->getType().getTypeName(), EbpUndefined, $1->getLine()));
else
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqTemporary, $1->getColsCount(),$1->getRowsCount(), $1->isMatrix()));
if ($1->getType().getQualifier() == EvqConst)
$$->getTypePointer()->changeQualifier(EvqConst);
} else if ($1->isMatrix() && $1->getType().getQualifier() == EvqConst)
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqConst, 1, $1->getColsCount()));
else if ($1->isMatrix())
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqTemporary, 1, $1->getColsCount()));
else if ($1->isVector() && $1->getType().getQualifier() == EvqConst)
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqConst));
else if ($1->isVector())
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqTemporary));
else
$$->setType($1->getType());
}
| function_call {
$$ = $1;
}
| postfix_expression DOT FIELD_SELECTION {
if (!$1) {
parseContext.error($3.line, "field selection on null object", ".", "");
YYERROR;
}
if ($1->isArray()) {
parseContext.error($3.line, "cannot apply dot operator to an array", ".", "");
parseContext.recover();
}
if ($1->isVector()) {
TVectorFields fields;
if (! parseContext.parseVectorFields(*$3.string, $1->getRowsCount(), fields, $3.line)) {
fields.num = 1;
fields.offsets[0] = 0;
parseContext.recover();
}
$$ = ir_add_vector_swizzle(fields, $1, $2.line, $3.line);
} else if ($1->isMatrix()) {
TVectorFields fields;
if (!parseContext.parseMatrixFields(*$3.string, $1->getColsCount(), $1->getRowsCount(), fields, $3.line)) {
fields.num = 1;
fields.offsets[0] = 0;
parseContext.recover();
}
TString vectorString = *$3.string;
TIntermTyped* index = ir_add_swizzle(fields, $3.line);
$$ = ir_add_index(EOpMatrixSwizzle, $1, index, $2.line);
$$->setType(TType($1->getBasicType(), $1->getPrecision(), EvqTemporary, 1, fields.num));
} else if ($1->getBasicType() == EbtStruct) {
bool fieldFound = false;
TTypeList* fields = $1->getType().getStruct();
if (fields == 0) {
parseContext.error($2.line, "structure has no fields", "Internal Error", "");
parseContext.recover();
$$ = $1;
} else {
unsigned int i;
for (i = 0; i < fields->size(); ++i) {
if ((*fields)[i].type->getFieldName() == *$3.string) {
fieldFound = true;
break;
}
}
if (fieldFound) {
TIntermConstant* index = ir_add_constant(TType(EbtInt, EbpUndefined, EvqConst), $3.line);
index->setValue(i);
$$ = ir_add_index(EOpIndexDirectStruct, $1, index, $2.line);
$$->setType(*(*fields)[i].type);
} else {
parseContext.error($2.line, " no such field in structure", $3.string->c_str(), "");
parseContext.recover();
$$ = $1;
}
}
} else if ($1->isScalar()) {
// HLSL allows ".xxxx" field selection on single component floats. Handle that here.
TVectorFields fields;
// Check to make sure only the "x" component is accessed.
if (! parseContext.parseVectorFields(*$3.string, 1, fields, $3.line)) {
fields.num = 1;
fields.offsets[0] = 0;
parseContext.recover();
}
// Create the appropriate constructor based on the number of ".x"'s there are in the selection field
TString vectorString = *$3.string;
TQualifier qualifier = $1->getType().getQualifier() == EvqConst ? EvqConst : EvqTemporary;
TType type($1->getBasicType(), $1->getPrecision(), qualifier, 1, (int) vectorString.size());
$$ = parseContext.constructBuiltIn(&type, parseContext.getConstructorOp(type),
$$, $1->getLine(), false);
} else {
parseContext.error($2.line, " field selection requires structure, vector, or matrix on left hand side", $3.string->c_str(), "");
parseContext.recover();
$$ = $1;
}
// don't delete $3.string, it's from the pool
}
| postfix_expression INC_OP {
if (parseContext.lValueErrorCheck($2.line, "++", $1))
parseContext.recover();
$$ = ir_add_unary_math(EOpPostIncrement, $1, $2.line, parseContext.infoSink);
if ($$ == 0) {
parseContext.unaryOpError($2.line, "++", $1->getCompleteString());
parseContext.recover();
$$ = $1;
}
}
| postfix_expression DEC_OP {
if (parseContext.lValueErrorCheck($2.line, "--", $1))
parseContext.recover();
$$ = ir_add_unary_math(EOpPostDecrement, $1, $2.line, parseContext.infoSink);
if ($$ == 0) {
parseContext.unaryOpError($2.line, "--", $1->getCompleteString());
parseContext.recover();
$$ = $1;
}
}
;
int_expression
: expression {
if (parseContext.scalarErrorCheck($1, "[]"))
parseContext.recover();
TType type(EbtInt, EbpUndefined);
$$ = parseContext.constructBuiltIn(&type, EOpConstructInt, $1, $1->getLine(), true);
if ($$ == 0) {
parseContext.error($1->getLine(), "cannot convert to index", "[]", "");
parseContext.recover();
$$ = $1;
}
}
;
function_call
: function_call_or_method {
TFunction* fnCall = $1.function;
TOperator op = fnCall->getBuiltInOp();
if (op == EOpArrayLength) {
if ($1.intermNode->getAsTyped() == 0 || $1.intermNode->getAsTyped()->getType().getArraySize() == 0) {
parseContext.error($1.line, "", fnCall->getName().c_str(), "array must be declared with a size before using this method");
parseContext.recover();
}
TIntermConstant* constant = ir_add_constant(TType(EbtInt, EbpUndefined, EvqConst), $1.line);
constant->setValue($1.intermNode->getAsTyped()->getType().getArraySize());
$$ = constant;
} else if (op != EOpNull) {
//
// Then this should be a constructor.
// Don't go through the symbol table for constructors.
// Their parameters will be verified algorithmically.
//
TType type(EbtVoid, EbpUndefined); // use this to get the type back
if (parseContext.constructorErrorCheck($1.line, $1.intermNode, *fnCall, op, &type)) {
$$ = 0;
} else {
//
// It's a constructor, of type 'type'.
//
$$ = parseContext.addConstructor($1.intermNode, &type, op, fnCall, $1.line);
}
if ($$ == 0) {
parseContext.recover();
$$ = ir_set_aggregate_op(0, op, $1.line);
$$->setType(type);
}
} else {
//
// Not a constructor. Find it in the symbol table.
//
const TFunction* fnCandidate;
bool builtIn;
fnCandidate = parseContext.findFunction($1.line, fnCall, &builtIn);
if ( fnCandidate && fnCandidate->getMangledName() != fnCall->getMangledName()) {
//add constructors to arguments to ensure that they have proper types
TIntermNode *temp = parseContext.promoteFunctionArguments( $1.intermNode,
fnCandidate);
if (temp)
$1.intermNode = temp;
else {
parseContext.error( $1.intermNode->getLine(), " unable to suitably promote arguments to function",
fnCandidate->getName().c_str(), "");
fnCandidate = 0;
}
}
if (fnCandidate) {
//
// A declared function. But, it might still map to a built-in
// operation.
//
op = fnCandidate->getBuiltInOp();
if (builtIn && op != EOpNull) {
//
// A function call mapped to a built-in operation.
//
if (fnCandidate->getParamCount() == 1) {
//
// Treat it like a built-in unary operator.
//
$$ = ir_add_unary_math(op, $1.intermNode, gNullSourceLoc, parseContext.infoSink);
if ($$ == 0) {
parseContext.error($1.intermNode->getLine(), " wrong operand type", "Internal Error",
"built in unary operator function. Type: %s",
static_cast<TIntermTyped*>($1.intermNode)->getCompleteString().c_str());
YYERROR;
}
} else {
$$ = ir_set_aggregate_op($1.intermAggregate, op, $1.line);
$$->setType(fnCandidate->getReturnType());
}
} else {
// This is a real function call
$$ = ir_set_aggregate_op($1.intermAggregate, EOpFunctionCall, $1.line);
$$->setType(fnCandidate->getReturnType());
$$->getAsAggregate()->setName(fnCandidate->getMangledName());
$$->getAsAggregate()->setPlainName(fnCandidate->getName());
TQualifier qual;
for (int i = 0; i < fnCandidate->getParamCount(); ++i) {
qual = (*fnCandidate)[i].type->getQualifier();
if (qual == EvqOut || qual == EvqInOut) {
if (parseContext.lValueErrorCheck($$->getLine(), "assign", $$->getAsAggregate()->getNodes()[i]->getAsTyped())) {
parseContext.error($1.intermNode->getLine(), "Constant value cannot be passed for 'out' or 'inout' parameters.", "Error", "");
parseContext.recover();
}
}
}
}
$$->setType(fnCandidate->getReturnType());
} else {
// error message was put out by PaFindFunction()
// Put on a dummy node for error recovery
TIntermConstant* constant = ir_add_constant(TType(EbtFloat, EbpUndefined, EvqConst), $1.line);
constant->setValue(0.f);
$$ = constant;
parseContext.recover();
}
}
delete fnCall;
}
;
function_call_or_method
: function_call_generic {
$$ = $1;
}
| postfix_expression DOT function_call_generic {
if ($1->isArray() && $3.function->getName() == "length") {
//
// implement array.length()
//
$$ = $3;
$$.intermNode = $1;
$$.function->relateToOperator(EOpArrayLength);
} else {
parseContext.error($3.line, "methods are not supported", "", "");
parseContext.recover();
$$ = $3;
}
}
;
function_call_generic
: function_call_header_with_parameters RIGHT_PAREN {
$$ = $1;
$$.line = $2.line;
}
| function_call_header_no_parameters RIGHT_PAREN {
$$ = $1;
$$.line = $2.line;
}
;
function_call_header_no_parameters
: function_call_header VOID_TYPE {
$$.function = $1;
$$.intermNode = 0;
}
| function_call_header {
$$.function = $1;
$$.intermNode = 0;
}
;
function_call_header_with_parameters
: function_call_header assign_expression {
if (!$2) {
YYERROR;
}
TParameter param = { 0, 0, new TType($2->getType()) };
$1->addParameter(param);
$$.function = $1;
$$.intermNode = $2;
}
| function_call_header_with_parameters COMMA assign_expression {
if (!$3) {
YYERROR;
}
TParameter param = { 0, 0, new TType($3->getType()) };
$1.function->addParameter(param);
$$.function = $1.function;
$$.intermNode = ir_grow_aggregate($1.intermNode, $3, $2.line);
}
;
function_call_header
: function_identifier LEFT_PAREN {
$$ = $1;
}
;
// Grammar Note: Constructors look like functions, but are recognized as types.
function_identifier
: type_specifier {
//
// Constructor
//
if ($1.array) {
//TODO : figure out how to deal with array constructors
}
if ($1.userDef) {
TString tempString = "";
TType type($1);
TFunction *function = new TFunction(&tempString, type, EOpConstructStruct);
$$ = function;
} else {
TOperator op = EOpNull;
switch ($1.type) {
case EbtFloat:
if ($1.matrix) {
switch($1.matcols) {
case 2: switch($1.matrows) {
case 2: op = EOpConstructMat2x2; break;
case 3: op = EOpConstructMat2x3; break;
case 4: op = EOpConstructMat2x4; break;
} break;
case 3: switch($1.matrows) {
case 2: op = EOpConstructMat3x2; break;
case 3: op = EOpConstructMat3x3; break;
case 4: op = EOpConstructMat3x4; break;
} break;
case 4: switch($1.matrows) {
case 2: op = EOpConstructMat4x2; break;
case 3: op = EOpConstructMat4x3; break;
case 4: op = EOpConstructMat4x4; break;
} break;
}
} else {
switch($1.matrows) {
case 1: op = EOpConstructFloat; break;
case 2: op = EOpConstructVec2; break;
case 3: op = EOpConstructVec3; break;
case 4: op = EOpConstructVec4; break;
}
}
break;
case EbtInt:
switch($1.matrows) {
case 1: op = EOpConstructInt; break;
case 2: op = EOpConstructIVec2; break;
case 3: op = EOpConstructIVec3; break;
case 4: op = EOpConstructIVec4; break;
}
break;
case EbtBool:
switch($1.matrows) {
case 1: op = EOpConstructBool; break;
case 2: op = EOpConstructBVec2; break;
case 3: op = EOpConstructBVec3; break;
case 4: op = EOpConstructBVec4; break;
}
break;
}
if (op == EOpNull) {
parseContext.error($1.line, "cannot construct this type", TType::getBasicString($1.type), "");
parseContext.recover();
$1.type = EbtFloat;
op = EOpConstructFloat;
}
TString tempString = "";
TType type($1);
TFunction *function = new TFunction(&tempString, type, op);
$$ = function;
}
}
| IDENTIFIER {
if (parseContext.reservedErrorCheck($1.line, *$1.string))
parseContext.recover();
TType type(EbtVoid, EbpUndefined);
const TString *mangled;
if ( *$1.string == "main")
mangled = NewPoolTString("xlat_main");
else
mangled = $1.string;
TFunction *function = new TFunction( mangled, type);
$$ = function;
}
| FIELD_SELECTION {
if (parseContext.reservedErrorCheck($1.line, *$1.string))
parseContext.recover();
TType type(EbtVoid, EbpUndefined);
TFunction *function = new TFunction($1.string, type);
$$ = function;
}
;
unary_expression
: postfix_expression {
$$ = $1;
}
| INC_OP unary_expression {
if (parseContext.lValueErrorCheck($1.line, "++", $2))
parseContext.recover();
$$ = ir_add_unary_math(EOpPreIncrement, $2, $1.line, parseContext.infoSink);
if ($$ == 0) {
parseContext.unaryOpError($1.line, "++", $2->getCompleteString());
parseContext.recover();
$$ = $2;
}
}
| DEC_OP unary_expression {
if (parseContext.lValueErrorCheck($1.line, "--", $2))
parseContext.recover();
$$ = ir_add_unary_math(EOpPreDecrement, $2, $1.line, parseContext.infoSink);
if ($$ == 0) {
parseContext.unaryOpError($1.line, "--", $2->getCompleteString());
parseContext.recover();
$$ = $2;
}
}
| unary_operator unary_expression {
if ($1.op != EOpNull) {
$$ = ir_add_unary_math($1.op, $2, $1.line, parseContext.infoSink);
if ($$ == 0) {
const char* errorOp = "";
switch($1.op) {
case EOpNegative: errorOp = "-"; break;
case EOpLogicalNot: errorOp = "!"; break;
case EOpBitwiseNot: errorOp = "~"; break;
default: break;
}
parseContext.unaryOpError($1.line, const_cast<char*> (errorOp), $2->getCompleteString());
parseContext.recover();
$$ = $2;
}
} else
$$ = $2;
}
| LEFT_PAREN type_specifier_nonarray RIGHT_PAREN unary_expression {
// cast operator, insert constructor
TOperator op = EOpNull;
switch ($2.type) {
case EbtFloat:
if ($2.matrix) {
switch($2.matcols) {
case 2: switch($2.matrows) {
case 2: op = EOpConstructMat2x2; break;
case 3: op = EOpConstructMat2x3; break;
case 4: op = EOpConstructMat2x4; break;
} break;
case 3: switch($2.matrows) {
case 2: op = EOpConstructMat3x2; break;
case 3: op = EOpConstructMat3x3; break;
case 4: op = EOpConstructMat3x4; break;
} break;
case 4: switch($2.matrows) {
case 2: op = EOpConstructMat4x2; break;
case 3: op = EOpConstructMat4x3; break;
case 4: op = EOpConstructMat4x4; break;
} break;
}
} else {
switch($2.matrows) {
case 1: op = EOpConstructFloat; break;
case 2: op = EOpConstructVec2; break;
case 3: op = EOpConstructVec3; break;
case 4: op = EOpConstructVec4; break;
}
}
break;
case EbtInt:
switch($2.matrows) {
case 1: op = EOpConstructInt; break;
case 2: op = EOpConstructIVec2; break;
case 3: op = EOpConstructIVec3; break;
case 4: op = EOpConstructIVec4; break;
}
break;
case EbtBool:
switch($2.matrows) {
case 1: op = EOpConstructBool; break;
case 2: op = EOpConstructBVec2; break;
case 3: op = EOpConstructBVec3; break;
case 4: op = EOpConstructBVec4; break;
}
break;
case EbtStruct:
op = EOpConstructStruct;
break;
}
if (op == EOpNull) {
parseContext.error($2.line, "cannot cast this type", TType::getBasicString($2.type), "");
parseContext.recover();
$2.type = EbtFloat;
op = EOpConstructFloat;
}
TString tempString = "";
TType type($2);
TFunction *function = new TFunction(&tempString, type, op);
TParameter param = { 0, 0, new TType($4->getType()) };
function->addParameter(param);
TType type2(EbtVoid, EbpUndefined); // use this to get the type back
if (parseContext.constructorErrorCheck($2.line, $4, *function, op, &type2)) {
$$ = 0;
} else {
//
// It's a constructor, of type 'type'.
//
$$ = parseContext.addConstructor($4, &type2, op, function, $2.line);
}
if ($$ == 0) {
parseContext.recover();
$$ = ir_set_aggregate_op(0, op, $2.line);
} else {
$$->setType(type2);
}
}
;
// Grammar Note: No traditional style type casts.
unary_operator
: PLUS { $$.line = $1.line; $$.op = EOpNull; }
| DASH { $$.line = $1.line; $$.op = EOpNegative; }
| BANG { $$.line = $1.line; $$.op = EOpLogicalNot; }
| TILDE { UNSUPPORTED_FEATURE("~", $1.line);
$$.line = $1.line; $$.op = EOpBitwiseNot; }
;
// Grammar Note: No '*' or '&' unary ops. Pointers are not supported.
mul_expression
: unary_expression { $$ = $1; }
| mul_expression STAR unary_expression { $$ = parseContext.add_binary(EOpMul, $1, $3, $2.line, "*", false); }
| mul_expression SLASH unary_expression { $$ = parseContext.add_binary(EOpDiv, $1, $3, $2.line, "/", false); }
| mul_expression PERCENT unary_expression { $$ = parseContext.add_binary(EOpMod, $1, $3, $2.line, "%", false); }
;
add_expression
: mul_expression { $$ = $1; }
| add_expression PLUS mul_expression { $$ = parseContext.add_binary(EOpAdd, $1, $3, $2.line, "+", false); }
| add_expression DASH mul_expression { $$ = parseContext.add_binary(EOpSub, $1, $3, $2.line, "-", false); }
;
shift_expression
: add_expression { $$ = $1; }
| shift_expression LEFT_OP add_expression { $$ = parseContext.add_binary(EOpLeftShift, $1, $3, $2.line, "<<", false); }
| shift_expression RIGHT_OP add_expression { $$ = parseContext.add_binary(EOpRightShift, $1, $3, $2.line, ">>", false); }
;
rel_expression
: shift_expression { $$ = $1; }
| rel_expression LEFT_ANGLE shift_expression { $$ = parseContext.add_binary(EOpLessThan, $1, $3, $2.line, "<", true); }
| rel_expression RIGHT_ANGLE shift_expression { $$ = parseContext.add_binary(EOpGreaterThan, $1, $3, $2.line, ">", true); }
| rel_expression LE_OP shift_expression { $$ = parseContext.add_binary(EOpLessThanEqual, $1, $3, $2.line, "<=", true); }
| rel_expression GE_OP shift_expression { $$ = parseContext.add_binary(EOpGreaterThanEqual, $1, $3, $2.line, ">=", true); }
;
eq_expression
: rel_expression { $$ = $1; }
| eq_expression EQ_OP rel_expression { $$ = parseContext.add_binary(EOpEqual, $1, $3, $2.line, "==", true); }
| eq_expression NE_OP rel_expression { $$ = parseContext.add_binary(EOpNotEqual, $1, $3, $2.line, "!=", true); }
;
and_expression
: eq_expression { $$ = $1; }
| and_expression AMPERSAND eq_expression { $$ = parseContext.add_binary(EOpAnd, $1, $3, $2.line, "&", false); }
;
xor_expression
: and_expression { $$ = $1; }
| xor_expression CARET and_expression { $$ = parseContext.add_binary(EOpExclusiveOr, $1, $3, $2.line, "^", false); }
;
or_expression
: xor_expression { $$ = $1; }
| or_expression VERTICAL_BAR xor_expression { $$ = parseContext.add_binary(EOpInclusiveOr, $1, $3, $2.line, "|", false); }
;
log_and_expression
: or_expression { $$ = $1; }
| log_and_expression AND_OP or_expression { $$ = parseContext.add_binary(EOpLogicalAnd, $1, $3, $2.line, "&&", true); }
;
log_xor_expression
: log_and_expression { $$ = $1; }
| log_xor_expression XOR_OP log_and_expression { $$ = parseContext.add_binary(EOpLogicalXor, $1, $3, $2.line, "^^", true); }
;
log_or_expression
: log_xor_expression { $$ = $1; }
| log_or_expression OR_OP log_xor_expression { $$ = parseContext.add_binary(EOpLogicalOr, $1, $3, $2.line, "||", true); }
;
cond_expression
: log_or_expression { $$ = $1; }
| log_or_expression QUESTION expression COLON assign_expression {
if (parseContext.boolOrVectorErrorCheck($2.line, $1))
parseContext.recover();
$$ = ir_add_selection($1, $3, $5, $2.line, parseContext.infoSink);
if ($$ == 0) {
parseContext.binaryOpError($2.line, ":", $3->getCompleteString(), $5->getCompleteString());
parseContext.recover();
$$ = $5;
}
}
;
assign_expression
: cond_expression { $$ = $1; }
| unary_expression assignment_operator assign_expression {
if (parseContext.lValueErrorCheck($2.line, "assign", $1))
parseContext.recover();
$$ = parseContext.addAssign($2.op, $1, $3, $2.line);
if ($$ == 0) {
parseContext.assignError($2.line, "assign", $1->getCompleteString(), $3->getCompleteString());
parseContext.recover();
$$ = $1;
} else if (($1->isArray() || $3->isArray()))
parseContext.recover();
}
;
assignment_operator
: EQUAL { $$.line = $1.line; $$.op = EOpAssign; }
| MUL_ASSIGN { $$.line = $1.line; $$.op = EOpMulAssign; }
| DIV_ASSIGN { $$.line = $1.line; $$.op = EOpDivAssign; }
| MOD_ASSIGN { UNSUPPORTED_FEATURE("%=", $1.line); $$.line = $1.line; $$.op = EOpModAssign; }
| ADD_ASSIGN { $$.line = $1.line; $$.op = EOpAddAssign; }
| SUB_ASSIGN { $$.line = $1.line; $$.op = EOpSubAssign; }
| LEFT_ASSIGN { UNSUPPORTED_FEATURE("<<=", $1.line); $$.line = $1.line; $$.op = EOpLeftShiftAssign; }
| RIGHT_ASSIGN { UNSUPPORTED_FEATURE("<<=", $1.line); $$.line = $1.line; $$.op = EOpRightShiftAssign; }
| AND_ASSIGN { UNSUPPORTED_FEATURE("&=", $1.line); $$.line = $1.line; $$.op = EOpAndAssign; }
| XOR_ASSIGN { UNSUPPORTED_FEATURE("^=", $1.line); $$.line = $1.line; $$.op = EOpExclusiveOrAssign; }
| OR_ASSIGN { UNSUPPORTED_FEATURE("|=", $1.line); $$.line = $1.line; $$.op = EOpInclusiveOrAssign; }
;
expression
: assign_expression {
$$ = $1;
}
| expression COMMA assign_expression {
$$ = ir_add_comma($1, $3, $2.line);
if ($$ == 0) {
parseContext.binaryOpError($2.line, ",", $1->getCompleteString(), $3->getCompleteString());
parseContext.recover();
$$ = $3;
}
}
;
const_expression
: cond_expression {
if (parseContext.constErrorCheck($1))
parseContext.recover();
$$ = $1;
}
;
declaration
: function_prototype SEMICOLON { $$ = 0; }
| init_declarator_list SEMICOLON { $$ = $1; }
;
function_prototype
: function_declarator RIGHT_PAREN {
//
// Multiple declarations of the same function are allowed.
//
// If this is a definition, the definition production code will check for redefinitions
// (we don't know at this point if it's a definition or not).
//
// Redeclarations are allowed. But, return types and parameter qualifiers must match.
//
TFunction* prevDec = static_cast<TFunction*>(parseContext.symbolTable.find($1->getMangledName()));
if (prevDec) {
if (prevDec->getReturnType() != $1->getReturnType()) {
parseContext.error($2.line, "overloaded functions must have the same return type", $1->getReturnType().getBasicString(), "");
parseContext.recover();
}
for (int i = 0; i < prevDec->getParamCount(); ++i) {
if ((*prevDec)[i].type->getQualifier() != (*$1)[i].type->getQualifier()) {
parseContext.error($2.line, "overloaded functions must have the same parameter qualifiers", (*$1)[i].type->getQualifierString(), "");
parseContext.recover();
}
}
}