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 (!type
->is_numeric())
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 (!type_a
->is_numeric()
293 || !type_b
->is_numeric()
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. */
363 do_assignment(exec_list
*instructions
, struct _mesa_glsl_parse_state
*state
,
364 ir_rvalue
*lhs
, ir_rvalue
*rhs
,
367 bool error_emitted
= (lhs
->type
->is_error() || rhs
->type
->is_error());
369 if (!error_emitted
) {
370 /* FINISHME: This does not handle 'foo.bar.a.b.c[5].d = 5' */
371 if (!lhs
->is_lvalue()) {
372 _mesa_glsl_error(& lhs_loc
, state
, "non-lvalue in assignment");
373 error_emitted
= true;
377 ir_rvalue
*new_rhs
= validate_assignment(lhs
->type
, rhs
);
378 if (new_rhs
== NULL
) {
379 _mesa_glsl_error(& lhs_loc
, state
, "type mismatch");
384 ir_instruction
*tmp
= new ir_assignment(lhs
, rhs
, NULL
);
385 instructions
->push_tail(tmp
);
391 get_lvalue_copy(exec_list
*instructions
, struct _mesa_glsl_parse_state
*state
,
392 ir_rvalue
*lvalue
, YYLTYPE loc
)
395 ir_rvalue
*var_deref
;
397 /* FINISHME: Give unique names to the temporaries. */
398 var
= new ir_variable(lvalue
->type
, "_internal_tmp");
399 var
->mode
= ir_var_auto
;
401 var_deref
= new ir_dereference(var
);
402 do_assignment(instructions
, state
, var_deref
, lvalue
, loc
);
404 /* Once we've created this temporary, mark it read only so it's no
405 * longer considered an lvalue.
407 var
->read_only
= true;
414 ast_node::hir(exec_list
*instructions
,
415 struct _mesa_glsl_parse_state
*state
)
425 ast_expression::hir(exec_list
*instructions
,
426 struct _mesa_glsl_parse_state
*state
)
428 static const int operations
[AST_NUM_OPERATORS
] = {
429 -1, /* ast_assign doesn't convert to ir_expression. */
430 -1, /* ast_plus doesn't convert to ir_expression. */
454 /* Note: The following block of expression types actually convert
455 * to multiple IR instructions.
457 ir_binop_mul
, /* ast_mul_assign */
458 ir_binop_div
, /* ast_div_assign */
459 ir_binop_mod
, /* ast_mod_assign */
460 ir_binop_add
, /* ast_add_assign */
461 ir_binop_sub
, /* ast_sub_assign */
462 ir_binop_lshift
, /* ast_ls_assign */
463 ir_binop_rshift
, /* ast_rs_assign */
464 ir_binop_bit_and
, /* ast_and_assign */
465 ir_binop_bit_xor
, /* ast_xor_assign */
466 ir_binop_bit_or
, /* ast_or_assign */
468 -1, /* ast_conditional doesn't convert to ir_expression. */
469 ir_binop_add
, /* ast_pre_inc. */
470 ir_binop_sub
, /* ast_pre_dec. */
471 ir_binop_add
, /* ast_post_inc. */
472 ir_binop_sub
, /* ast_post_dec. */
473 -1, /* ast_field_selection doesn't conv to ir_expression. */
474 -1, /* ast_array_index doesn't convert to ir_expression. */
475 -1, /* ast_function_call doesn't conv to ir_expression. */
476 -1, /* ast_identifier doesn't convert to ir_expression. */
477 -1, /* ast_int_constant doesn't convert to ir_expression. */
478 -1, /* ast_uint_constant doesn't conv to ir_expression. */
479 -1, /* ast_float_constant doesn't conv to ir_expression. */
480 -1, /* ast_bool_constant doesn't conv to ir_expression. */
481 -1, /* ast_sequence doesn't convert to ir_expression. */
483 ir_rvalue
*result
= NULL
;
485 struct simple_node op_list
;
486 const struct glsl_type
*type
= glsl_type::error_type
;
487 bool error_emitted
= false;
490 loc
= this->get_location();
491 make_empty_list(& op_list
);
493 switch (this->oper
) {
495 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
496 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
498 result
= do_assignment(instructions
, state
, op
[0], op
[1],
499 this->subexpressions
[0]->get_location());
500 error_emitted
= result
->type
->is_error();
506 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
508 error_emitted
= op
[0]->type
->is_error();
509 if (type
->is_error())
516 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
518 type
= unary_arithmetic_result_type(op
[0]->type
);
520 error_emitted
= op
[0]->type
->is_error();
522 result
= new ir_expression(operations
[this->oper
], type
,
530 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
531 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
533 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
534 (this->oper
== ast_mul
),
537 result
= new ir_expression(operations
[this->oper
], type
,
542 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
543 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
545 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
547 type
= modulus_result_type(op
[0]->type
, op
[1]->type
);
549 assert(operations
[this->oper
] == ir_binop_mod
);
551 result
= new ir_expression(operations
[this->oper
], type
,
557 /* FINISHME: Implement bit-shift operators. */
564 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
565 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
567 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
569 type
= relational_result_type(op
[0]->type
, op
[1]->type
, state
);
571 /* The relational operators must either generate an error or result
572 * in a scalar boolean. See page 57 of the GLSL 1.50 spec.
574 assert(type
->is_error()
575 || ((type
->base_type
== GLSL_TYPE_BOOL
)
576 && type
->is_scalar()));
578 result
= new ir_expression(operations
[this->oper
], type
,
584 /* FINISHME: Implement equality operators. */
591 /* FINISHME: Implement bit-wise operators. */
598 /* FINISHME: Implement logical operators. */
604 case ast_sub_assign
: {
605 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
606 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
608 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
609 (this->oper
== ast_mul_assign
),
612 ir_rvalue
*temp_rhs
= new ir_expression(operations
[this->oper
], type
,
615 result
= do_assignment(instructions
, state
, op
[0], temp_rhs
,
616 this->subexpressions
[0]->get_location());
618 error_emitted
= (op
[0]->type
->is_error());
620 /* GLSL 1.10 does not allow array assignment. However, we don't have to
621 * explicitly test for this because none of the binary expression
622 * operators allow array operands either.
628 case ast_mod_assign
: {
629 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
630 op
[1] = this->subexpressions
[1]->hir(instructions
, state
);
632 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
634 type
= modulus_result_type(op
[0]->type
, op
[1]->type
);
636 assert(operations
[this->oper
] == ir_binop_mod
);
638 struct ir_rvalue
*temp_rhs
;
639 temp_rhs
= new ir_expression(operations
[this->oper
], type
,
642 result
= do_assignment(instructions
, state
, op
[0], temp_rhs
,
643 this->subexpressions
[0]->get_location());
645 error_emitted
= op
[0]->type
->is_error();
656 case ast_conditional
:
660 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
661 if (op
[0]->type
->base_type
== GLSL_TYPE_FLOAT
)
662 op
[1] = new ir_constant(1.0f
);
664 op
[1] = new ir_constant(1);
666 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
669 struct ir_rvalue
*temp_rhs
;
670 temp_rhs
= new ir_expression(operations
[this->oper
], type
,
673 result
= do_assignment(instructions
, state
, op
[0], temp_rhs
,
674 this->subexpressions
[0]->get_location());
676 error_emitted
= op
[0]->type
->is_error();
682 op
[0] = this->subexpressions
[0]->hir(instructions
, state
);
683 if (op
[0]->type
->base_type
== GLSL_TYPE_FLOAT
)
684 op
[1] = new ir_constant(1.0f
);
686 op
[1] = new ir_constant(1);
688 error_emitted
= op
[0]->type
->is_error() || op
[1]->type
->is_error();
690 type
= arithmetic_result_type(op
[0]->type
, op
[1]->type
,
693 struct ir_rvalue
*temp_rhs
;
694 temp_rhs
= new ir_expression(operations
[this->oper
], type
,
697 /* Get a temporary of a copy of the lvalue before it's modified.
698 * This may get thrown away later.
700 result
= get_lvalue_copy(instructions
, state
, op
[0],
701 this->subexpressions
[0]->get_location());
703 (void)do_assignment(instructions
, state
, op
[0], temp_rhs
,
704 this->subexpressions
[0]->get_location());
707 error_emitted
= op
[0]->type
->is_error();
711 case ast_field_selection
:
712 result
= _mesa_ast_field_selection_to_hir(this, instructions
, state
);
716 case ast_array_index
:
719 case ast_function_call
:
720 /* Should *NEVER* get here. ast_function_call should always be handled
721 * by ast_function_expression::hir.
726 case ast_identifier
: {
727 /* ast_identifier can appear several places in a full abstract syntax
728 * tree. This particular use must be at location specified in the grammar
729 * as 'variable_identifier'.
732 state
->symbols
->get_variable(this->primary_expression
.identifier
);
734 result
= new ir_dereference(var
);
739 _mesa_glsl_error(& loc
, state
, "`%s' undeclared",
740 this->primary_expression
.identifier
);
742 error_emitted
= true;
747 case ast_int_constant
:
748 type
= glsl_type::int_type
;
749 result
= new ir_constant(type
, & this->primary_expression
);
752 case ast_uint_constant
:
753 type
= glsl_type::uint_type
;
754 result
= new ir_constant(type
, & this->primary_expression
);
757 case ast_float_constant
:
758 type
= glsl_type::float_type
;
759 result
= new ir_constant(type
, & this->primary_expression
);
762 case ast_bool_constant
:
763 type
= glsl_type::bool_type
;
764 result
= new ir_constant(type
, & this->primary_expression
);
768 struct simple_node
*ptr
;
770 /* It should not be possible to generate a sequence in the AST without
771 * any expressions in it.
773 assert(!is_empty_list(&this->expressions
));
775 /* The r-value of a sequence is the last expression in the sequence. If
776 * the other expressions in the sequence do not have side-effects (and
777 * therefore add instructions to the instruction list), they get dropped
780 foreach (ptr
, &this->expressions
)
781 result
= ((ast_node
*)ptr
)->hir(instructions
, state
);
785 /* Any errors should have already been emitted in the loop above.
787 error_emitted
= true;
792 if (type
->is_error() && !error_emitted
)
793 _mesa_glsl_error(& loc
, state
, "type mismatch");
800 ast_expression_statement::hir(exec_list
*instructions
,
801 struct _mesa_glsl_parse_state
*state
)
803 /* It is possible to have expression statements that don't have an
804 * expression. This is the solitary semicolon:
806 * for (i = 0; i < 5; i++)
809 * In this case the expression will be NULL. Test for NULL and don't do
810 * anything in that case.
812 if (expression
!= NULL
)
813 expression
->hir(instructions
, state
);
815 /* Statements do not have r-values.
822 ast_compound_statement::hir(exec_list
*instructions
,
823 struct _mesa_glsl_parse_state
*state
)
825 struct simple_node
*ptr
;
829 state
->symbols
->push_scope();
831 foreach (ptr
, &statements
)
832 ((ast_node
*)ptr
)->hir(instructions
, state
);
835 state
->symbols
->pop_scope();
837 /* Compound statements do not have r-values.
843 static const struct glsl_type
*
844 type_specifier_to_glsl_type(const struct ast_type_specifier
*spec
,
846 struct _mesa_glsl_parse_state
*state
)
848 struct glsl_type
*type
;
850 if (spec
->type_specifier
== ast_struct
) {
851 /* FINISHME: Handle annonymous structures. */
854 type
= state
->symbols
->get_type(spec
->type_name
);
855 *name
= spec
->type_name
;
857 /* FINISHME: Handle array declarations. Note that this requires complete
858 * FINISHME: handling of constant expressions.
867 apply_type_qualifier_to_variable(const struct ast_type_qualifier
*qual
,
868 struct ir_variable
*var
,
869 struct _mesa_glsl_parse_state
*state
)
874 /* FINISHME: Mark 'in' variables at global scope as read-only. */
875 if (qual
->constant
|| qual
->attribute
|| qual
->uniform
876 || (qual
->varying
&& (state
->target
== fragment_shader
)))
882 if (qual
->in
&& qual
->out
)
883 var
->mode
= ir_var_inout
;
884 else if (qual
->attribute
|| qual
->in
885 || (qual
->varying
&& (state
->target
== fragment_shader
)))
886 var
->mode
= ir_var_in
;
887 else if (qual
->out
|| (qual
->varying
&& (state
->target
== vertex_shader
)))
888 var
->mode
= ir_var_out
;
889 else if (qual
->uniform
)
890 var
->mode
= ir_var_uniform
;
892 var
->mode
= ir_var_auto
;
895 var
->interpolation
= ir_var_flat
;
896 else if (qual
->noperspective
)
897 var
->interpolation
= ir_var_noperspective
;
899 var
->interpolation
= ir_var_smooth
;
904 ast_declarator_list::hir(exec_list
*instructions
,
905 struct _mesa_glsl_parse_state
*state
)
907 struct simple_node
*ptr
;
908 const struct glsl_type
*decl_type
;
909 const char *type_name
= NULL
;
912 /* FINISHME: Handle vertex shader "invariant" declarations that do not
913 * FINISHME: include a type. These re-declare built-in variables to be
914 * FINISHME: invariant.
917 decl_type
= type_specifier_to_glsl_type(this->type
->specifier
,
920 foreach (ptr
, &this->declarations
) {
921 struct ast_declaration
*const decl
= (struct ast_declaration
* )ptr
;
922 const struct glsl_type
*var_type
;
923 struct ir_variable
*var
;
926 /* FINISHME: Emit a warning if a variable declaration shadows a
927 * FINISHME: declaration at a higher scope.
930 if ((decl_type
== NULL
) || decl_type
->is_void()) {
933 loc
= this->get_location();
934 if (type_name
!= NULL
) {
935 _mesa_glsl_error(& loc
, state
,
936 "invalid type `%s' in declaration of `%s'",
937 type_name
, decl
->identifier
);
939 _mesa_glsl_error(& loc
, state
,
940 "invalid type in declaration of `%s'",
946 if (decl
->is_array
) {
947 /* FINISHME: Handle array declarations. Note that this requires
948 * FINISHME: complete handling of constant expressions.
950 var_type
= glsl_type::error_type
;
952 /* FINISHME: Reject delcarations of multidimensional arrays. */
954 var_type
= decl_type
;
957 var
= new ir_variable(var_type
, decl
->identifier
);
959 /* FINISHME: Variables that are attribute, uniform, varying, in, or
960 * FINISHME: out varibles must be declared either at global scope or
961 * FINISHME: in a parameter list (in and out only).
964 apply_type_qualifier_to_variable(& this->type
->qualifier
, var
, state
);
966 /* Attempt to add the variable to the symbol table. If this fails, it
967 * means the variable has already been declared at this scope.
969 if (state
->symbols
->name_declared_this_scope(decl
->identifier
)) {
970 YYLTYPE loc
= this->get_location();
972 _mesa_glsl_error(& loc
, state
, "`%s' redeclared",
977 const bool added_variable
=
978 state
->symbols
->add_variable(decl
->identifier
, var
);
979 assert(added_variable
);
981 instructions
->push_tail(var
);
983 /* FINISHME: Process the declaration initializer. */
986 /* Variable declarations do not have r-values.
993 ast_parameter_declarator::hir(exec_list
*instructions
,
994 struct _mesa_glsl_parse_state
*state
)
996 const struct glsl_type
*type
;
997 const char *name
= NULL
;
1000 type
= type_specifier_to_glsl_type(this->type
->specifier
, & name
, state
);
1003 YYLTYPE loc
= this->get_location();
1005 _mesa_glsl_error(& loc
, state
,
1006 "invalid type `%s' in declaration of `%s'",
1007 name
, this->identifier
);
1009 _mesa_glsl_error(& loc
, state
,
1010 "invalid type in declaration of `%s'",
1014 type
= glsl_type::error_type
;
1017 ir_variable
*var
= new ir_variable(type
, this->identifier
);
1019 /* FINISHME: Handle array declarations. Note that this requires
1020 * FINISHME: complete handling of constant expressions.
1023 /* Apply any specified qualifiers to the parameter declaration. Note that
1024 * for function parameters the default mode is 'in'.
1026 apply_type_qualifier_to_variable(& this->type
->qualifier
, var
, state
);
1027 if (var
->mode
== ir_var_auto
)
1028 var
->mode
= ir_var_in
;
1030 instructions
->push_tail(var
);
1032 /* Parameter declarations do not have r-values.
1039 ast_function_parameters_to_hir(struct simple_node
*ast_parameters
,
1040 exec_list
*ir_parameters
,
1041 struct _mesa_glsl_parse_state
*state
)
1043 struct simple_node
*ptr
;
1045 foreach (ptr
, ast_parameters
) {
1046 ((ast_node
*)ptr
)->hir(ir_parameters
, state
);
1052 parameter_lists_match(exec_list
*list_a
, exec_list
*list_b
)
1054 exec_list_iterator iter_a
= list_a
->iterator();
1055 exec_list_iterator iter_b
= list_b
->iterator();
1057 while (iter_a
.has_next()) {
1058 /* If all of the parameters from the other parameter list have been
1059 * exhausted, the lists have different length and, by definition,
1062 if (!iter_b
.has_next())
1065 /* If the types of the parameters do not match, the parameters lists
1080 ast_function_definition::hir(exec_list
*instructions
,
1081 struct _mesa_glsl_parse_state
*state
)
1084 ir_function_signature
*signature
= NULL
;
1085 ir_function
*f
= NULL
;
1086 exec_list parameters
;
1089 /* Convert the list of function parameters to HIR now so that they can be
1090 * used below to compare this function's signature with previously seen
1091 * signatures for functions with the same name.
1093 ast_function_parameters_to_hir(& this->prototype
->parameters
, & parameters
,
1096 const char *return_type_name
;
1097 const glsl_type
*return_type
=
1098 type_specifier_to_glsl_type(this->prototype
->return_type
->specifier
,
1099 & return_type_name
, state
);
1101 assert(return_type
!= NULL
);
1104 /* Verify that this function's signature either doesn't match a previously
1105 * seen signature for a function with the same name, or, if a match is found,
1106 * that the previously seen signature does not have an associated definition.
1108 const char *const name
= this->prototype
->identifier
;
1109 f
= state
->symbols
->get_function(name
);
1111 foreach_iter(exec_list_iterator
, iter
, f
->signatures
) {
1112 signature
= (struct ir_function_signature
*) iter
.get();
1114 /* Compare the parameter list of the function being defined to the
1115 * existing function. If the parameter lists match, then the return
1116 * type must also match and the existing function must not have a
1119 if (parameter_lists_match(& parameters
, & signature
->parameters
)) {
1120 /* FINISHME: Compare return types. */
1122 if (signature
->definition
!= NULL
) {
1123 YYLTYPE loc
= this->get_location();
1125 _mesa_glsl_error(& loc
, state
, "function `%s' redefined", name
);
1134 } else if (state
->symbols
->name_declared_this_scope(name
)) {
1135 /* This function name shadows a non-function use of the same name.
1137 YYLTYPE loc
= this->get_location();
1139 _mesa_glsl_error(& loc
, state
, "function name `%s' conflicts with "
1140 "non-function", name
);
1143 f
= new ir_function(name
);
1144 state
->symbols
->add_function(f
->name
, f
);
1148 /* Finish storing the information about this new function in its signature.
1150 if (signature
== NULL
) {
1151 signature
= new ir_function_signature(return_type
);
1152 f
->signatures
.push_tail(signature
);
1154 /* Destroy all of the previous parameter information. The previous
1155 * parameter information comes from the function prototype, and it can
1156 * either include invalid parameter names or may not have names at all.
1158 foreach_iter(exec_list_iterator
, iter
, signature
->parameters
) {
1159 assert(((ir_instruction
*) iter
.get())->as_variable() != NULL
);
1167 assert(state
->current_function
== NULL
);
1168 state
->current_function
= signature
;
1170 ast_function_parameters_to_hir(& this->prototype
->parameters
,
1171 & signature
->parameters
,
1173 /* FINISHME: Set signature->return_type */
1175 label
= new ir_label(name
);
1176 if (signature
->definition
== NULL
) {
1177 signature
->definition
= label
;
1179 instructions
->push_tail(label
);
1181 /* Add the function parameters to the symbol table. During this step the
1182 * parameter declarations are also moved from the temporary "parameters" list
1183 * to the instruction list. There are other more efficient ways to do this,
1184 * but they involve ugly linked-list gymnastics.
1186 state
->symbols
->push_scope();
1187 foreach_iter(exec_list_iterator
, iter
, parameters
) {
1188 ir_variable
*const var
= (ir_variable
*) iter
.get();
1190 assert(((ir_instruction
*) var
)->as_variable() != NULL
);
1193 instructions
->push_tail(var
);
1195 /* The only way a parameter would "exist" is if two parameters have
1198 if (state
->symbols
->name_declared_this_scope(var
->name
)) {
1199 YYLTYPE loc
= this->get_location();
1201 _mesa_glsl_error(& loc
, state
, "parameter `%s' redeclared", var
->name
);
1203 state
->symbols
->add_variable(var
->name
, var
);
1207 /* Convert the body of the function to HIR, and append the resulting
1208 * instructions to the list that currently consists of the function label
1209 * and the function parameters.
1211 this->body
->hir(instructions
, state
);
1213 state
->symbols
->pop_scope();
1215 assert(state
->current_function
== signature
);
1216 state
->current_function
= NULL
;
1218 /* Function definitions do not have r-values.
1225 ast_jump_statement::hir(exec_list
*instructions
,
1226 struct _mesa_glsl_parse_state
*state
)
1229 if (mode
== ast_return
) {
1232 if (opt_return_value
) {
1233 /* FINISHME: Make sure the enclosing function has a non-void return
1237 ir_expression
*const ret
= (ir_expression
*)
1238 opt_return_value
->hir(instructions
, state
);
1239 assert(ret
!= NULL
);
1241 /* FINISHME: Make sure the type of the return value matches the return
1242 * FINISHME: type of the enclosing function.
1245 inst
= new ir_return(ret
);
1247 /* FINISHME: Make sure the enclosing function has a void return type.
1249 inst
= new ir_return
;
1252 instructions
->push_tail(inst
);
1255 /* Jump instructions do not have r-values.