2 * Copyright © 2010 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
26 * Convert abstract syntax to to high-level intermediate reprensentation (HIR).
28 * During the conversion to HIR, the majority of the symantic checking is
29 * preformed on the program. This includes:
31 * * Symbol table management
35 * The majority of this work could be done during parsing, and the parser could
36 * probably generate HIR directly. However, this results in frequent changes
37 * to the parser code. Since we do not assume that every system this complier
38 * is built on will have Flex and Bison installed, we have to store the code
39 * generated by these tools in our version control system. In other parts of
40 * the system we've seen problems where a parser was changed but the generated
41 * code was not committed, merge conflicts where created because two developers
42 * had slightly different versions of Bison installed, etc.
44 * I have also noticed that running Bison generated parsers in GDB is very
45 * irritating. When you get a segfault on '$$ = $1->foo', you can't very
46 * well 'print $1' in GDB.
48 * As a result, my preference is to put as little C code as possible in the
49 * parser (and lexer) sources.
52 #include "main/imports.h"
53 #include "glsl_symbol_table.h"
54 #include "glsl_parser_extras.h"
56 #include "glsl_types.h"
60 _mesa_ast_to_hir(exec_list
*instructions
, struct _mesa_glsl_parse_state
*state
)
62 struct simple_node
*ptr
;
64 _mesa_glsl_initialize_variables(instructions
, state
);
65 _mesa_glsl_initialize_constructors(instructions
, state
);
67 state
->current_function
= NULL
;
69 foreach (ptr
, & state
->translation_unit
) {
70 ((ast_node
*)ptr
)->hir(instructions
, state
);
75 static const struct glsl_type
*
76 arithmetic_result_type(const struct glsl_type
*type_a
,
77 const struct glsl_type
*type_b
,
79 struct _mesa_glsl_parse_state
*state
)
81 /* From GLSL 1.50 spec, page 56:
83 * "The arithmetic binary operators add (+), subtract (-),
84 * multiply (*), and divide (/) operate on integer and
85 * floating-point scalars, vectors, and matrices."
87 if (!type_a
->is_numeric() || !type_b
->is_numeric()) {
88 return glsl_type::error_type
;
92 /* "If one operand is floating-point based and the other is
93 * not, then the conversions from Section 4.1.10 "Implicit
94 * Conversions" are applied to the non-floating-point-based operand."
96 * This conversion was added in GLSL 1.20. If the compilation mode is
97 * GLSL 1.10, the conversion is skipped.
99 if (state
->language_version
>= 120) {
100 if ((type_a
->base_type
== GLSL_TYPE_FLOAT
)
101 && (type_b
->base_type
!= GLSL_TYPE_FLOAT
)) {
102 } else if ((type_a
->base_type
!= GLSL_TYPE_FLOAT
)
103 && (type_b
->base_type
== GLSL_TYPE_FLOAT
)) {
107 /* "If the operands are integer types, they must both be signed or
110 * From this rule and the preceeding conversion it can be inferred that
111 * both types must be GLSL_TYPE_FLOAT, or GLSL_TYPE_UINT, or GLSL_TYPE_INT.
112 * The is_numeric check above already filtered out the case where either
113 * type is not one of these, so now the base types need only be tested for
116 if (type_a
->base_type
!= type_b
->base_type
) {
117 return glsl_type::error_type
;
120 /* "All arithmetic binary operators result in the same fundamental type
121 * (signed integer, unsigned integer, or floating-point) as the
122 * operands they operate on, after operand type conversion. After
123 * conversion, the following cases are valid
125 * * The two operands are scalars. In this case the operation is
126 * applied, resulting in a scalar."
128 if (type_a
->is_scalar() && type_b
->is_scalar())
131 /* "* One operand is a scalar, and the other is a vector or matrix.
132 * In this case, the scalar operation is applied independently to each
133 * component of the vector or matrix, resulting in the same size
136 if (type_a
->is_scalar()) {
137 if (!type_b
->is_scalar())
139 } else if (type_b
->is_scalar()) {
143 /* All of the combinations of <scalar, scalar>, <vector, scalar>,
144 * <scalar, vector>, <scalar, matrix>, and <matrix, scalar> have been
147 assert(!type_a
->is_scalar());
148 assert(!type_b
->is_scalar());
150 /* "* The two operands are vectors of the same size. In this case, the
151 * operation is done component-wise resulting in the same size
154 if (type_a
->is_vector() && type_b
->is_vector()) {
155 return (type_a
== type_b
) ? type_a
: glsl_type::error_type
;
158 /* All of the combinations of <scalar, scalar>, <vector, scalar>,
159 * <scalar, vector>, <scalar, matrix>, <matrix, scalar>, and
160 * <vector, vector> have been handled. At least one of the operands must
161 * be matrix. Further, since there are no integer matrix types, the base
162 * type of both operands must be float.
164 assert(type_a
->is_matrix() || type_b
->is_matrix());
165 assert(type_a
->base_type
== GLSL_TYPE_FLOAT
);
166 assert(type_b
->base_type
== GLSL_TYPE_FLOAT
);
168 /* "* The operator is add (+), subtract (-), or divide (/), and the
169 * operands are matrices with the same number of rows and the same
170 * number of columns. In this case, the operation is done component-
171 * wise resulting in the same size matrix."
172 * * The operator is multiply (*), where both operands are matrices or
173 * one operand is a vector and the other a matrix. A right vector
174 * operand is treated as a column vector and a left vector operand as a
175 * row vector. In all these cases, it is required that the number of
176 * columns of the left operand is equal to the number of rows of the
177 * right operand. Then, the multiply (*) operation does a linear
178 * algebraic multiply, yielding an object that has the same number of
179 * rows as the left operand and the same number of columns as the right
180 * operand. Section 5.10 "Vector and Matrix Operations" explains in
181 * more detail how vectors and matrices are operated on."
184 return (type_a
== type_b
) ? type_a
: glsl_type::error_type
;
186 if (type_a
->is_matrix() && type_b
->is_matrix()) {
187 /* Matrix multiply. The columns of A must match the rows of B. Given
188 * the other previously tested constraints, this means the vector type
189 * of a row from A must be the same as the vector type of a column from
192 if (type_a
->row_type() == type_b
->column_type()) {
193 /* The resulting matrix has the number of columns of matrix B and
194 * the number of rows of matrix A. We get the row count of A by
195 * looking at the size of a vector that makes up a column. The
196 * transpose (size of a row) is done for B.
199 glsl_type::get_instance(type_a
->base_type
,
200 type_a
->column_type()->vector_elements
,
201 type_b
->row_type()->vector_elements
);
203 } else if (type_a
->is_matrix()) {
204 /* A is a matrix and B is a column vector. Columns of A must match
205 * rows of B. Given the other previously tested constraints, this
206 * means the vector type of a row from A must be the same as the
207 * vector the type of B.
209 if (type_a
->row_type() == type_b
)
212 assert(type_b
->is_matrix());
214 /* A is a row vector and B is a matrix. Columns of A must match rows
215 * of B. Given the other previously tested constraints, this means
216 * the type of A must be the same as the vector type of a column from
219 if (type_a
== type_b
->column_type())
225 /* "All other cases are illegal."
227 return glsl_type::error_type
;
231 static const struct glsl_type
*
232 unary_arithmetic_result_type(const struct glsl_type
*type
)
234 /* From GLSL 1.50 spec, page 57:
236 * "The arithmetic unary operators negate (-), post- and pre-increment
237 * and decrement (-- and ++) operate on integer or floating-point
238 * values (including vectors and matrices). All unary operators work
239 * component-wise on their operands. These result with the same type
242 if (!is_numeric_base_type(type
->base_type
))
243 return glsl_type::error_type
;
249 static const struct glsl_type
*
250 modulus_result_type(const struct glsl_type
*type_a
,
251 const struct glsl_type
*type_b
)
253 /* From GLSL 1.50 spec, page 56:
254 * "The operator modulus (%) operates on signed or unsigned integers or
255 * integer vectors. The operand types must both be signed or both be
258 if (!type_a
->is_integer() || !type_b
->is_integer()
259 || (type_a
->base_type
!= type_b
->base_type
)) {
260 return glsl_type::error_type
;
263 /* "The operands cannot be vectors of differing size. If one operand is
264 * a scalar and the other vector, then the scalar is applied component-
265 * wise to the vector, resulting in the same type as the vector. If both
266 * are vectors of the same size, the result is computed component-wise."
268 if (type_a
->is_vector()) {
269 if (!type_b
->is_vector()
270 || (type_a
->vector_elements
== type_b
->vector_elements
))
275 /* "The operator modulus (%) is not defined for any other data types
276 * (non-integer types)."
278 return glsl_type::error_type
;
282 static const struct glsl_type
*
283 relational_result_type(const struct glsl_type
*type_a
,
284 const struct glsl_type
*type_b
,
285 struct _mesa_glsl_parse_state
*state
)
287 /* From GLSL 1.50 spec, page 56:
288 * "The relational operators greater than (>), less than (<), greater
289 * than or equal (>=), and less than or equal (<=) operate only on
290 * scalar integer and scalar floating-point expressions."
292 if (! is_numeric_base_type(type_a
->base_type
)
293 || ! is_numeric_base_type(type_b
->base_type
)
294 || !type_a
->is_scalar()
295 || !type_b
->is_scalar())
296 return glsl_type::error_type
;
298 /* "Either the operands' types must match, or the conversions from
299 * Section 4.1.10 "Implicit Conversions" will be applied to the integer
300 * operand, after which the types must match."
302 * This conversion was added in GLSL 1.20. If the compilation mode is
303 * GLSL 1.10, the conversion is skipped.
305 if (state
->language_version
>= 120) {
306 if ((type_a
->base_type
== GLSL_TYPE_FLOAT
)
307 && (type_b
->base_type
!= GLSL_TYPE_FLOAT
)) {
308 /* FINISHME: Generate the implicit type conversion. */
309 } else if ((type_a
->base_type
!= GLSL_TYPE_FLOAT
)
310 && (type_b
->base_type
== GLSL_TYPE_FLOAT
)) {
311 /* FINISHME: Generate the implicit type conversion. */
315 if (type_a
->base_type
!= type_b
->base_type
)
316 return glsl_type::error_type
;
318 /* "The result is scalar Boolean."
320 return glsl_type::bool_type
;
325 * Validates that a value can be assigned to a location with a specified type
327 * Validates that \c rhs can be assigned to some location. If the types are
328 * not an exact match but an automatic conversion is possible, \c rhs will be
332 * \c NULL if \c rhs cannot be assigned to a location with type \c lhs_type.
333 * Otherwise the actual RHS to be assigned will be returned. This may be
334 * \c rhs, or it may be \c rhs after some type conversion.
337 * In addition to being used for assignments, this function is used to
338 * type-check return values.
341 validate_assignment(const glsl_type
*lhs_type
, ir_rvalue
*rhs
)
343 const glsl_type
*const rhs_type
= rhs
->type
;
345 /* If there is already some error in the RHS, just return it. Anything
346 * else will lead to an avalanche of error message back to the user.
348 if (rhs_type
->is_error())
351 /* FINISHME: For GLSL 1.10, check that the types are not arrays. */
353 /* If the types are identical, the assignment can trivially proceed.
355 if (rhs_type
== lhs_type
)
358 /* FINISHME: Check for and apply automatic conversions. */
364 ast_node::hir(exec_list
*instructions
,
365 struct _mesa_glsl_parse_state
*state
)
375 ast_expression::hir(exec_list
*instructions
,
376 struct _mesa_glsl_parse_state
*state
)
378 static const int operations
[AST_NUM_OPERATORS
] = {
379 -1, /* ast_assign doesn't convert to ir_expression. */
380 -1, /* ast_plus doesn't convert to ir_expression. */
404 /* Note: The following block of expression types actually convert
405 * to multiple IR instructions.
407 ir_binop_mul
, /* ast_mul_assign */
408 ir_binop_div
, /* ast_div_assign */
409 ir_binop_mod
, /* ast_mod_assign */
410 ir_binop_add
, /* ast_add_assign */
411 ir_binop_sub
, /* ast_sub_assign */
412 ir_binop_lshift
, /* ast_ls_assign */
413 ir_binop_rshift
, /* ast_rs_assign */
414 ir_binop_bit_and
, /* ast_and_assign */
415 ir_binop_bit_xor
, /* ast_xor_assign */
416 ir_binop_bit_or
, /* ast_or_assign */
418 -1, /* ast_conditional doesn't convert to ir_expression. */
419 -1, /* ast_pre_inc doesn't convert to ir_expression. */
420 -1, /* ast_pre_dec doesn't convert to ir_expression. */
421 -1, /* ast_post_inc doesn't convert to ir_expression. */
422 -1, /* ast_post_dec doesn't convert to ir_expression. */
423 -1, /* ast_field_selection doesn't conv to ir_expression. */
424 -1, /* ast_array_index doesn't convert to ir_expression. */
425 -1, /* ast_function_call doesn't conv to ir_expression. */
426 -1, /* ast_identifier doesn't convert to ir_expression. */
427 -1, /* ast_int_constant doesn't convert to ir_expression. */
428 -1, /* ast_uint_constant doesn't conv to ir_expression. */
429 -1, /* ast_float_constant doesn't conv to ir_expression. */
430 -1, /* ast_bool_constant doesn't conv to ir_expression. */
431 -1, /* ast_sequence doesn't convert to ir_expression. */
433 ir_rvalue
*result
= NULL
;
435 struct simple_node op_list
;
436 const struct glsl_type
*type
= glsl_type::error_type
;
437 bool error_emitted
= false;
440 loc
= this->get_location();
441 make_empty_list(& op_list
);
443 switch (this->oper
) {
445 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
446 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
448 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
451 if (!error_emitted
) {
454 /* FINISHME: This does not handle 'foo.bar.a.b.c[5].d = 5' */
455 if (!op
[0]->is_lvalue()) {
456 _mesa_glsl_error(& loc
, state
, "non-lvalue in assignment");
457 error_emitted
= true;
458 type
= glsl_type::error_type
;
462 ir_instruction
*rhs
= validate_assignment(op
[0]->type
, op
[1]);
464 type
= glsl_type::error_type
;
468 ir_instruction
*tmp
= new ir_assignment(op
[0], op
[1], NULL
);
469 instructions
->push_tail(tmp
);
476 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
478 error_emitted
= op
[0]->type
->is_error();
479 if (type
->is_error())
486 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
488 type
= unary_arithmetic_result_type(op
[0]->type
);
490 error_emitted
= op
[0]->type
->is_error();
492 result
= new ir_expression(operations
[this->oper
], type
,
500 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
501 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
503 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
504 (this->oper
== ast_mul
),
507 result
= new ir_expression(operations
[this->oper
], type
,
512 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
513 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
515 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
517 type
= modulus_result_type(op
[0]->type
, op
[1]->type
);
519 assert(operations
[this->oper
] == ir_binop_mod
);
521 result
= new ir_expression(operations
[this->oper
], type
,
527 /* FINISHME: Implement bit-shift operators. */
534 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
535 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
537 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
539 type
= relational_result_type(op
[0]->type
, op
[1]->type
, state
);
541 /* The relational operators must either generate an error or result
542 * in a scalar boolean. See page 57 of the GLSL 1.50 spec.
544 assert(type
->is_error()
545 || ((type
->base_type
== GLSL_TYPE_BOOL
)
546 && type
->is_scalar()));
548 result
= new ir_expression(operations
[this->oper
], type
,
554 /* FINISHME: Implement equality operators. */
561 /* FINISHME: Implement bit-wise operators. */
568 /* FINISHME: Implement logical operators. */
574 case ast_sub_assign
: {
575 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
576 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
578 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
580 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
581 (this->oper
== ast_mul_assign
),
584 ir_rvalue
*temp_rhs
= new ir_expression(operations
[this->oper
], type
,
587 /* FINISHME: This is copied from ast_assign above. It should
588 * FINISHME: probably be consolidated.
590 error_emitted
= op
[0]->type
->is_error() || temp_rhs
->type
->is_error();
593 if (!error_emitted
) {
596 if (!op
[0]->is_lvalue()) {
597 _mesa_glsl_error(& loc
, state
, "non-lvalue in assignment");
598 error_emitted
= true;
599 type
= glsl_type::error_type
;
603 ir_rvalue
*rhs
= validate_assignment(op
[0]->type
, temp_rhs
);
605 type
= glsl_type::error_type
;
609 ir_instruction
*tmp
= new ir_assignment(op
[0], rhs
, NULL
);
610 instructions
->push_tail(tmp
);
612 /* GLSL 1.10 does not allow array assignment. However, we don't have to
613 * explicitly test for this because none of the binary expression
614 * operators allow array operands either.
630 case ast_conditional
:
639 case ast_field_selection
:
640 result
= _mesa_ast_field_selection_to_hir(this, instructions
, state
);
644 case ast_array_index
:
647 case ast_function_call
:
648 /* Should *NEVER* get here. ast_function_call should always be handled
649 * by ast_function_expression::hir.
654 case ast_identifier
: {
655 /* ast_identifier can appear several places in a full abstract syntax
656 * tree. This particular use must be at location specified in the grammar
657 * as 'variable_identifier'.
660 state
->symbols
->get_variable(this->primary_expression
.identifier
);
662 result
= new ir_dereference(var
);
667 _mesa_glsl_error(& loc
, state
, "`%s' undeclared",
668 this->primary_expression
.identifier
);
670 error_emitted
= true;
675 case ast_int_constant
:
676 type
= glsl_type::int_type
;
677 result
= new ir_constant(type
, & this->primary_expression
);
680 case ast_uint_constant
:
681 type
= glsl_type::uint_type
;
682 result
= new ir_constant(type
, & this->primary_expression
);
685 case ast_float_constant
:
686 type
= glsl_type::float_type
;
687 result
= new ir_constant(type
, & this->primary_expression
);
690 case ast_bool_constant
:
691 type
= glsl_type::bool_type
;
692 result
= new ir_constant(type
, & this->primary_expression
);
696 struct simple_node
*ptr
;
698 /* It should not be possible to generate a sequence in the AST without
699 * any expressions in it.
701 assert(!is_empty_list(&this->expressions
));
703 /* The r-value of a sequence is the last expression in the sequence. If
704 * the other expressions in the sequence do not have side-effects (and
705 * therefore add instructions to the instruction list), they get dropped
708 foreach (ptr
, &this->expressions
)
709 result
= ((ast_node
*)ptr
)->hir(instructions
, state
);
713 /* Any errors should have already been emitted in the loop above.
715 error_emitted
= true;
720 if (is_error_type(type
) && !error_emitted
)
721 _mesa_glsl_error(& loc
, state
, "type mismatch");
728 ast_expression_statement::hir(exec_list
*instructions
,
729 struct _mesa_glsl_parse_state
*state
)
731 /* It is possible to have expression statements that don't have an
732 * expression. This is the solitary semicolon:
734 * for (i = 0; i < 5; i++)
737 * In this case the expression will be NULL. Test for NULL and don't do
738 * anything in that case.
740 if (expression
!= NULL
)
741 expression
->hir(instructions
, state
);
743 /* Statements do not have r-values.
750 ast_compound_statement::hir(exec_list
*instructions
,
751 struct _mesa_glsl_parse_state
*state
)
753 struct simple_node
*ptr
;
757 state
->symbols
->push_scope();
759 foreach (ptr
, &statements
)
760 ((ast_node
*)ptr
)->hir(instructions
, state
);
763 state
->symbols
->pop_scope();
765 /* Compound statements do not have r-values.
771 static const struct glsl_type
*
772 type_specifier_to_glsl_type(const struct ast_type_specifier
*spec
,
774 struct _mesa_glsl_parse_state
*state
)
776 struct glsl_type
*type
;
778 if (spec
->type_specifier
== ast_struct
) {
779 /* FINISHME: Handle annonymous structures. */
782 type
= state
->symbols
->get_type(spec
->type_name
);
783 *name
= spec
->type_name
;
785 /* FINISHME: Handle array declarations. Note that this requires complete
786 * FINISHME: handling of constant expressions.
795 apply_type_qualifier_to_variable(const struct ast_type_qualifier
*qual
,
796 struct ir_variable
*var
,
797 struct _mesa_glsl_parse_state
*state
)
802 /* FINISHME: Mark 'in' variables at global scope as read-only. */
803 if (qual
->constant
|| qual
->attribute
|| qual
->uniform
804 || (qual
->varying
&& (state
->target
== fragment_shader
)))
810 if (qual
->in
&& qual
->out
)
811 var
->mode
= ir_var_inout
;
812 else if (qual
->attribute
|| qual
->in
813 || (qual
->varying
&& (state
->target
== fragment_shader
)))
814 var
->mode
= ir_var_in
;
815 else if (qual
->out
|| (qual
->varying
&& (state
->target
== vertex_shader
)))
816 var
->mode
= ir_var_out
;
817 else if (qual
->uniform
)
818 var
->mode
= ir_var_uniform
;
820 var
->mode
= ir_var_auto
;
823 var
->interpolation
= ir_var_flat
;
824 else if (qual
->noperspective
)
825 var
->interpolation
= ir_var_noperspective
;
827 var
->interpolation
= ir_var_smooth
;
832 ast_declarator_list::hir(exec_list
*instructions
,
833 struct _mesa_glsl_parse_state
*state
)
835 struct simple_node
*ptr
;
836 const struct glsl_type
*decl_type
;
837 const char *type_name
= NULL
;
840 /* FINISHME: Handle vertex shader "invariant" declarations that do not
841 * FINISHME: include a type. These re-declare built-in variables to be
842 * FINISHME: invariant.
845 decl_type
= type_specifier_to_glsl_type(this->type
->specifier
,
848 foreach (ptr
, &this->declarations
) {
849 struct ast_declaration
*const decl
= (struct ast_declaration
* )ptr
;
850 const struct glsl_type
*var_type
;
851 struct ir_variable
*var
;
854 /* FINISHME: Emit a warning if a variable declaration shadows a
855 * FINISHME: declaration at a higher scope.
858 if ((decl_type
== NULL
) || decl_type
->is_void()) {
861 loc
= this->get_location();
862 if (type_name
!= NULL
) {
863 _mesa_glsl_error(& loc
, state
,
864 "invalid type `%s' in declaration of `%s'",
865 type_name
, decl
->identifier
);
867 _mesa_glsl_error(& loc
, state
,
868 "invalid type in declaration of `%s'",
874 if (decl
->is_array
) {
875 /* FINISHME: Handle array declarations. Note that this requires
876 * FINISHME: complete handling of constant expressions.
879 /* FINISHME: Reject delcarations of multidimensional arrays. */
881 var_type
= decl_type
;
884 var
= new ir_variable(var_type
, decl
->identifier
);
886 /* FINISHME: Variables that are attribute, uniform, varying, in, or
887 * FINISHME: out varibles must be declared either at global scope or
888 * FINISHME: in a parameter list (in and out only).
891 apply_type_qualifier_to_variable(& this->type
->qualifier
, var
, state
);
893 /* Attempt to add the variable to the symbol table. If this fails, it
894 * means the variable has already been declared at this scope.
896 if (state
->symbols
->name_declared_this_scope(decl
->identifier
)) {
897 YYLTYPE loc
= this->get_location();
899 _mesa_glsl_error(& loc
, state
, "`%s' redeclared",
904 const bool added_variable
=
905 state
->symbols
->add_variable(decl
->identifier
, var
);
906 assert(added_variable
);
908 instructions
->push_tail(var
);
910 /* FINISHME: Process the declaration initializer. */
913 /* Variable declarations do not have r-values.
920 ast_parameter_declarator::hir(exec_list
*instructions
,
921 struct _mesa_glsl_parse_state
*state
)
923 const struct glsl_type
*type
;
924 const char *name
= NULL
;
927 type
= type_specifier_to_glsl_type(this->type
->specifier
, & name
, state
);
930 YYLTYPE loc
= this->get_location();
932 _mesa_glsl_error(& loc
, state
,
933 "invalid type `%s' in declaration of `%s'",
934 name
, this->identifier
);
936 _mesa_glsl_error(& loc
, state
,
937 "invalid type in declaration of `%s'",
941 type
= glsl_type::error_type
;
944 ir_variable
*var
= new ir_variable(type
, this->identifier
);
946 /* FINISHME: Handle array declarations. Note that this requires
947 * FINISHME: complete handling of constant expressions.
950 /* Apply any specified qualifiers to the parameter declaration. Note that
951 * for function parameters the default mode is 'in'.
953 apply_type_qualifier_to_variable(& this->type
->qualifier
, var
, state
);
954 if (var
->mode
== ir_var_auto
)
955 var
->mode
= ir_var_in
;
957 instructions
->push_tail(var
);
959 /* Parameter declarations do not have r-values.
966 ast_function_parameters_to_hir(struct simple_node
*ast_parameters
,
967 exec_list
*ir_parameters
,
968 struct _mesa_glsl_parse_state
*state
)
970 struct simple_node
*ptr
;
972 foreach (ptr
, ast_parameters
) {
973 ((ast_node
*)ptr
)->hir(ir_parameters
, state
);
979 parameter_lists_match(exec_list
*list_a
, exec_list
*list_b
)
981 exec_list_iterator iter_a
= list_a
->iterator();
982 exec_list_iterator iter_b
= list_b
->iterator();
984 while (iter_a
.has_next()) {
985 /* If all of the parameters from the other parameter list have been
986 * exhausted, the lists have different length and, by definition,
989 if (!iter_b
.has_next())
992 /* If the types of the parameters do not match, the parameters lists
1007 ast_function_definition::hir(exec_list
*instructions
,
1008 struct _mesa_glsl_parse_state
*state
)
1011 ir_function_signature
*signature
= NULL
;
1012 ir_function
*f
= NULL
;
1013 exec_list parameters
;
1016 /* Convert the list of function parameters to HIR now so that they can be
1017 * used below to compare this function's signature with previously seen
1018 * signatures for functions with the same name.
1020 ast_function_parameters_to_hir(& this->prototype
->parameters
, & parameters
,
1023 const char *return_type_name
;
1024 const glsl_type
*return_type
=
1025 type_specifier_to_glsl_type(this->prototype
->return_type
->specifier
,
1026 & return_type_name
, state
);
1028 assert(return_type
!= NULL
);
1031 /* Verify that this function's signature either doesn't match a previously
1032 * seen signature for a function with the same name, or, if a match is found,
1033 * that the previously seen signature does not have an associated definition.
1035 const char *const name
= this->prototype
->identifier
;
1036 f
= state
->symbols
->get_function(name
);
1038 foreach_iter(exec_list_iterator
, iter
, f
->signatures
) {
1039 signature
= (struct ir_function_signature
*) iter
.get();
1041 /* Compare the parameter list of the function being defined to the
1042 * existing function. If the parameter lists match, then the return
1043 * type must also match and the existing function must not have a
1046 if (parameter_lists_match(& parameters
, & signature
->parameters
)) {
1047 /* FINISHME: Compare return types. */
1049 if (signature
->definition
!= NULL
) {
1050 YYLTYPE loc
= this->get_location();
1052 _mesa_glsl_error(& loc
, state
, "function `%s' redefined", name
);
1061 } else if (state
->symbols
->name_declared_this_scope(name
)) {
1062 /* This function name shadows a non-function use of the same name.
1064 YYLTYPE loc
= this->get_location();
1066 _mesa_glsl_error(& loc
, state
, "function name `%s' conflicts with "
1067 "non-function", name
);
1070 f
= new ir_function(name
);
1071 state
->symbols
->add_function(f
->name
, f
);
1075 /* Finish storing the information about this new function in its signature.
1077 if (signature
== NULL
) {
1078 signature
= new ir_function_signature(return_type
);
1079 f
->signatures
.push_tail(signature
);
1081 /* Destroy all of the previous parameter information. The previous
1082 * parameter information comes from the function prototype, and it can
1083 * either include invalid parameter names or may not have names at all.
1085 foreach_iter(exec_list_iterator
, iter
, signature
->parameters
) {
1086 assert(((ir_instruction
*) iter
.get())->as_variable() != NULL
);
1094 assert(state
->current_function
== NULL
);
1095 state
->current_function
= signature
;
1097 ast_function_parameters_to_hir(& this->prototype
->parameters
,
1098 & signature
->parameters
,
1100 /* FINISHME: Set signature->return_type */
1102 label
= new ir_label(name
);
1103 if (signature
->definition
== NULL
) {
1104 signature
->definition
= label
;
1106 instructions
->push_tail(label
);
1108 /* Add the function parameters to the symbol table. During this step the
1109 * parameter declarations are also moved from the temporary "parameters" list
1110 * to the instruction list. There are other more efficient ways to do this,
1111 * but they involve ugly linked-list gymnastics.
1113 state
->symbols
->push_scope();
1114 foreach_iter(exec_list_iterator
, iter
, parameters
) {
1115 ir_variable
*const var
= (ir_variable
*) iter
.get();
1117 assert(((ir_instruction
*) var
)->as_variable() != NULL
);
1120 instructions
->push_tail(var
);
1122 /* The only way a parameter would "exist" is if two parameters have
1125 if (state
->symbols
->name_declared_this_scope(var
->name
)) {
1126 YYLTYPE loc
= this->get_location();
1128 _mesa_glsl_error(& loc
, state
, "parameter `%s' redeclared", var
->name
);
1130 state
->symbols
->add_variable(var
->name
, var
);
1134 /* Convert the body of the function to HIR, and append the resulting
1135 * instructions to the list that currently consists of the function label
1136 * and the function parameters.
1138 this->body
->hir(instructions
, state
);
1140 state
->symbols
->pop_scope();
1142 assert(state
->current_function
== signature
);
1143 state
->current_function
= NULL
;
1145 /* Function definitions do not have r-values.
1152 ast_jump_statement::hir(exec_list
*instructions
,
1153 struct _mesa_glsl_parse_state
*state
)
1156 if (mode
== ast_return
) {
1159 if (opt_return_value
) {
1160 /* FINISHME: Make sure the enclosing function has a non-void return
1164 ir_expression
*const ret
= (ir_expression
*)
1165 opt_return_value
->hir(instructions
, state
);
1166 assert(ret
!= NULL
);
1168 /* FINISHME: Make sure the type of the return value matches the return
1169 * FINISHME: type of the enclosing function.
1172 inst
= new ir_return(ret
);
1174 /* FINISHME: Make sure the enclosing function has a void return type.
1176 inst
= new ir_return
;
1179 instructions
->push_tail(inst
);
1182 /* Jump instructions do not have r-values.