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.
24 #include "main/core.h" /* for MAX2 */
26 #include "ir_visitor.h"
27 #include "glsl_types.h"
29 ir_rvalue::ir_rvalue()
31 this->type
= glsl_type::error_type
;
35 * Modify the swizzle make to move one component to another
37 * \param m IR swizzle to be modified
38 * \param from Component in the RHS that is to be swizzled
39 * \param to Desired swizzle location of \c from
42 update_rhs_swizzle(ir_swizzle_mask
&m
, unsigned from
, unsigned to
)
45 case 0: m
.x
= from
; break;
46 case 1: m
.y
= from
; break;
47 case 2: m
.z
= from
; break;
48 case 3: m
.w
= from
; break;
49 default: assert(!"Should not get here.");
52 m
.num_components
= MAX2(m
.num_components
, (to
+ 1));
56 ir_assignment::set_lhs(ir_rvalue
*lhs
)
59 ir_swizzle
*swiz
= lhs
->as_swizzle();
64 unsigned write_mask
= 0;
65 ir_swizzle_mask rhs_swiz
= { 0, 0, 0, 0, 0, 0 };
67 for (unsigned i
= 0; i
< swiz
->mask
.num_components
; i
++) {
71 case 0: c
= swiz
->mask
.x
; break;
72 case 1: c
= swiz
->mask
.y
; break;
73 case 2: c
= swiz
->mask
.z
; break;
74 case 3: c
= swiz
->mask
.w
; break;
75 default: assert(!"Should not get here.");
78 write_mask
|= (((this->write_mask
>> i
) & 1) << c
);
79 update_rhs_swizzle(rhs_swiz
, i
, c
);
82 this->write_mask
= write_mask
;
85 this->rhs
= new(this) ir_swizzle(this->rhs
, rhs_swiz
);
88 assert((lhs
== NULL
) || lhs
->as_dereference());
90 this->lhs
= (ir_dereference
*) lhs
;
94 ir_assignment::whole_variable_written()
96 ir_variable
*v
= this->lhs
->whole_variable_referenced();
101 if (v
->type
->is_scalar())
104 if (v
->type
->is_vector()) {
105 const unsigned mask
= (1U << v
->type
->vector_elements
) - 1;
107 if (mask
!= this->write_mask
)
111 /* Either all the vector components are assigned or the variable is some
112 * composite type (and the whole thing is assigned.
117 ir_assignment::ir_assignment(ir_dereference
*lhs
, ir_rvalue
*rhs
,
118 ir_rvalue
*condition
, unsigned write_mask
)
120 this->ir_type
= ir_type_assignment
;
121 this->condition
= condition
;
124 this->write_mask
= write_mask
;
127 ir_assignment::ir_assignment(ir_rvalue
*lhs
, ir_rvalue
*rhs
,
128 ir_rvalue
*condition
)
130 this->ir_type
= ir_type_assignment
;
131 this->condition
= condition
;
134 /* If the RHS is a vector type, assume that all components of the vector
135 * type are being written to the LHS. The write mask comes from the RHS
136 * because we can have a case where the LHS is a vec4 and the RHS is a
137 * vec3. In that case, the assignment is:
139 * (assign (...) (xyz) (var_ref lhs) (var_ref rhs))
141 if (rhs
->type
->is_vector())
142 this->write_mask
= (1U << rhs
->type
->vector_elements
) - 1;
143 else if (rhs
->type
->is_scalar())
144 this->write_mask
= 1;
146 this->write_mask
= 0;
152 ir_expression::ir_expression(int op
, const struct glsl_type
*type
,
153 ir_rvalue
*op0
, ir_rvalue
*op1
)
155 this->ir_type
= ir_type_expression
;
157 this->operation
= ir_expression_operation(op
);
158 this->operands
[0] = op0
;
159 this->operands
[1] = op1
;
163 ir_expression::get_num_operands(ir_expression_operation op
)
165 /* Update ir_print_visitor.cpp when updating this list. */
166 const int num_operands
[] = {
167 1, /* ir_unop_bit_not */
168 1, /* ir_unop_logic_not */
171 1, /* ir_unop_sign */
174 1, /* ir_unop_sqrt */
177 1, /* ir_unop_exp2 */
178 1, /* ir_unop_log2 */
188 1, /* ir_unop_trunc */
189 1, /* ir_unop_ceil */
190 1, /* ir_unop_floor */
191 1, /* ir_unop_fract */
196 1, /* ir_unop_dFdx */
197 1, /* ir_unop_dFdy */
199 2, /* ir_binop_add */
200 2, /* ir_binop_sub */
201 2, /* ir_binop_mul */
202 2, /* ir_binop_div */
203 2, /* ir_binop_mod */
205 2, /* ir_binop_less */
206 2, /* ir_binop_greater */
207 2, /* ir_binop_lequal */
208 2, /* ir_binop_gequal */
209 2, /* ir_binop_equal */
210 2, /* ir_binop_nequal */
212 2, /* ir_binop_lshift */
213 2, /* ir_binop_rshift */
214 2, /* ir_binop_bit_and */
215 2, /* ir_binop_bit_xor */
216 2, /* ir_binop_bit_or */
218 2, /* ir_binop_logic_and */
219 2, /* ir_binop_logic_xor */
220 2, /* ir_binop_logic_or */
222 2, /* ir_binop_dot */
223 2, /* ir_binop_cross */
224 2, /* ir_binop_min */
225 2, /* ir_binop_max */
227 2, /* ir_binop_pow */
230 assert(sizeof(num_operands
) / sizeof(num_operands
[0]) == ir_binop_pow
+ 1);
232 return num_operands
[op
];
235 static const char *const operator_strs
[] = {
290 const char *ir_expression::operator_string()
292 assert((unsigned int) operation
<=
293 sizeof(operator_strs
) / sizeof(operator_strs
[0]));
294 return operator_strs
[operation
];
297 ir_expression_operation
298 ir_expression::get_operator(const char *str
)
300 const int operator_count
= sizeof(operator_strs
) / sizeof(operator_strs
[0]);
301 for (int op
= 0; op
< operator_count
; op
++) {
302 if (strcmp(str
, operator_strs
[op
]) == 0)
303 return (ir_expression_operation
) op
;
305 return (ir_expression_operation
) -1;
308 ir_constant::ir_constant()
310 this->ir_type
= ir_type_constant
;
313 ir_constant::ir_constant(const struct glsl_type
*type
,
314 const ir_constant_data
*data
)
316 assert((type
->base_type
>= GLSL_TYPE_UINT
)
317 && (type
->base_type
<= GLSL_TYPE_BOOL
));
319 this->ir_type
= ir_type_constant
;
321 memcpy(& this->value
, data
, sizeof(this->value
));
324 ir_constant::ir_constant(float f
)
326 this->ir_type
= ir_type_constant
;
327 this->type
= glsl_type::float_type
;
328 this->value
.f
[0] = f
;
331 ir_constant::ir_constant(unsigned int u
)
333 this->ir_type
= ir_type_constant
;
334 this->type
= glsl_type::uint_type
;
335 this->value
.u
[0] = u
;
338 ir_constant::ir_constant(int i
)
340 this->ir_type
= ir_type_constant
;
341 this->type
= glsl_type::int_type
;
342 this->value
.i
[0] = i
;
345 ir_constant::ir_constant(bool b
)
347 this->ir_type
= ir_type_constant
;
348 this->type
= glsl_type::bool_type
;
349 this->value
.b
[0] = b
;
352 ir_constant::ir_constant(const ir_constant
*c
, unsigned i
)
354 this->ir_type
= ir_type_constant
;
355 this->type
= c
->type
->get_base_type();
357 switch (this->type
->base_type
) {
358 case GLSL_TYPE_UINT
: this->value
.u
[0] = c
->value
.u
[i
]; break;
359 case GLSL_TYPE_INT
: this->value
.i
[0] = c
->value
.i
[i
]; break;
360 case GLSL_TYPE_FLOAT
: this->value
.f
[0] = c
->value
.f
[i
]; break;
361 case GLSL_TYPE_BOOL
: this->value
.b
[0] = c
->value
.b
[i
]; break;
362 default: assert(!"Should not get here."); break;
366 ir_constant::ir_constant(const struct glsl_type
*type
, exec_list
*value_list
)
368 this->ir_type
= ir_type_constant
;
371 assert(type
->is_scalar() || type
->is_vector() || type
->is_matrix()
372 || type
->is_record() || type
->is_array());
374 if (type
->is_array()) {
375 this->array_elements
= talloc_array(this, ir_constant
*, type
->length
);
377 foreach_list(node
, value_list
) {
378 ir_constant
*value
= (ir_constant
*) node
;
379 assert(value
->as_constant() != NULL
);
381 this->array_elements
[i
++] = value
;
386 /* If the constant is a record, the types of each of the entries in
387 * value_list must be a 1-for-1 match with the structure components. Each
388 * entry must also be a constant. Just move the nodes from the value_list
389 * to the list in the ir_constant.
391 /* FINISHME: Should there be some type checking and / or assertions here? */
392 /* FINISHME: Should the new constant take ownership of the nodes from
393 * FINISHME: value_list, or should it make copies?
395 if (type
->is_record()) {
396 value_list
->move_nodes_to(& this->components
);
401 ir_constant
*value
= (ir_constant
*) (value_list
->head
);
403 /* Use each component from each entry in the value_list to initialize one
404 * component of the constant being constructed.
406 for (unsigned i
= 0; i
< type
->components(); /* empty */) {
407 assert(value
->as_constant() != NULL
);
408 assert(!value
->is_tail_sentinel());
410 for (unsigned j
= 0; j
< value
->type
->components(); j
++) {
411 switch (type
->base_type
) {
413 this->value
.u
[i
] = value
->get_uint_component(j
);
416 this->value
.i
[i
] = value
->get_int_component(j
);
418 case GLSL_TYPE_FLOAT
:
419 this->value
.f
[i
] = value
->get_float_component(j
);
422 this->value
.b
[i
] = value
->get_bool_component(j
);
425 /* FINISHME: What to do? Exceptions are not the answer.
431 if (i
>= type
->components())
435 value
= (ir_constant
*) value
->next
;
440 ir_constant::zero(void *mem_ctx
, const glsl_type
*type
)
442 assert(type
->is_numeric());
444 ir_constant
*c
= new(mem_ctx
) ir_constant
;
446 memset(&c
->value
, 0, sizeof(c
->value
));
452 ir_constant::get_bool_component(unsigned i
) const
454 switch (this->type
->base_type
) {
455 case GLSL_TYPE_UINT
: return this->value
.u
[i
] != 0;
456 case GLSL_TYPE_INT
: return this->value
.i
[i
] != 0;
457 case GLSL_TYPE_FLOAT
: return ((int)this->value
.f
[i
]) != 0;
458 case GLSL_TYPE_BOOL
: return this->value
.b
[i
];
459 default: assert(!"Should not get here."); break;
462 /* Must return something to make the compiler happy. This is clearly an
469 ir_constant::get_float_component(unsigned i
) const
471 switch (this->type
->base_type
) {
472 case GLSL_TYPE_UINT
: return (float) this->value
.u
[i
];
473 case GLSL_TYPE_INT
: return (float) this->value
.i
[i
];
474 case GLSL_TYPE_FLOAT
: return this->value
.f
[i
];
475 case GLSL_TYPE_BOOL
: return this->value
.b
[i
] ? 1.0 : 0.0;
476 default: assert(!"Should not get here."); break;
479 /* Must return something to make the compiler happy. This is clearly an
486 ir_constant::get_int_component(unsigned i
) const
488 switch (this->type
->base_type
) {
489 case GLSL_TYPE_UINT
: return this->value
.u
[i
];
490 case GLSL_TYPE_INT
: return this->value
.i
[i
];
491 case GLSL_TYPE_FLOAT
: return (int) this->value
.f
[i
];
492 case GLSL_TYPE_BOOL
: return this->value
.b
[i
] ? 1 : 0;
493 default: assert(!"Should not get here."); break;
496 /* Must return something to make the compiler happy. This is clearly an
503 ir_constant::get_uint_component(unsigned i
) const
505 switch (this->type
->base_type
) {
506 case GLSL_TYPE_UINT
: return this->value
.u
[i
];
507 case GLSL_TYPE_INT
: return this->value
.i
[i
];
508 case GLSL_TYPE_FLOAT
: return (unsigned) this->value
.f
[i
];
509 case GLSL_TYPE_BOOL
: return this->value
.b
[i
] ? 1 : 0;
510 default: assert(!"Should not get here."); break;
513 /* Must return something to make the compiler happy. This is clearly an
520 ir_constant::get_array_element(unsigned i
) const
522 assert(this->type
->is_array());
524 /* From page 35 (page 41 of the PDF) of the GLSL 1.20 spec:
526 * "Behavior is undefined if a shader subscripts an array with an index
527 * less than 0 or greater than or equal to the size the array was
530 * Most out-of-bounds accesses are removed before things could get this far.
531 * There are cases where non-constant array index values can get constant
536 else if (i
>= this->type
->length
)
537 i
= this->type
->length
- 1;
539 return array_elements
[i
];
543 ir_constant::get_record_field(const char *name
)
545 int idx
= this->type
->field_index(name
);
550 if (this->components
.is_empty())
553 exec_node
*node
= this->components
.head
;
554 for (int i
= 0; i
< idx
; i
++) {
557 /* If the end of the list is encountered before the element matching the
558 * requested field is found, return NULL.
560 if (node
->is_tail_sentinel())
564 return (ir_constant
*) node
;
569 ir_constant::has_value(const ir_constant
*c
) const
571 if (this->type
!= c
->type
)
574 if (this->type
->is_array()) {
575 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
576 if (this->array_elements
[i
]->has_value(c
->array_elements
[i
]))
582 if (this->type
->base_type
== GLSL_TYPE_STRUCT
) {
583 const exec_node
*a_node
= this->components
.head
;
584 const exec_node
*b_node
= c
->components
.head
;
586 while (!a_node
->is_tail_sentinel()) {
587 assert(!b_node
->is_tail_sentinel());
589 const ir_constant
*const a_field
= (ir_constant
*) a_node
;
590 const ir_constant
*const b_field
= (ir_constant
*) b_node
;
592 if (!a_field
->has_value(b_field
))
595 a_node
= a_node
->next
;
596 b_node
= b_node
->next
;
602 for (unsigned i
= 0; i
< this->type
->components(); i
++) {
603 switch (this->type
->base_type
) {
605 if (this->value
.u
[i
] != c
->value
.u
[i
])
609 if (this->value
.i
[i
] != c
->value
.i
[i
])
612 case GLSL_TYPE_FLOAT
:
613 if (this->value
.f
[i
] != c
->value
.f
[i
])
617 if (this->value
.b
[i
] != c
->value
.b
[i
])
621 assert(!"Should not get here.");
629 ir_dereference_variable::ir_dereference_variable(ir_variable
*var
)
631 this->ir_type
= ir_type_dereference_variable
;
633 this->type
= (var
!= NULL
) ? var
->type
: glsl_type::error_type
;
637 ir_dereference_array::ir_dereference_array(ir_rvalue
*value
,
638 ir_rvalue
*array_index
)
640 this->ir_type
= ir_type_dereference_array
;
641 this->array_index
= array_index
;
642 this->set_array(value
);
646 ir_dereference_array::ir_dereference_array(ir_variable
*var
,
647 ir_rvalue
*array_index
)
649 void *ctx
= talloc_parent(var
);
651 this->ir_type
= ir_type_dereference_array
;
652 this->array_index
= array_index
;
653 this->set_array(new(ctx
) ir_dereference_variable(var
));
658 ir_dereference_array::set_array(ir_rvalue
*value
)
661 this->type
= glsl_type::error_type
;
663 if (this->array
!= NULL
) {
664 const glsl_type
*const vt
= this->array
->type
;
666 if (vt
->is_array()) {
667 type
= vt
->element_type();
668 } else if (vt
->is_matrix()) {
669 type
= vt
->column_type();
670 } else if (vt
->is_vector()) {
671 type
= vt
->get_base_type();
677 ir_dereference_record::ir_dereference_record(ir_rvalue
*value
,
680 this->ir_type
= ir_type_dereference_record
;
681 this->record
= value
;
682 this->field
= talloc_strdup(this, field
);
683 this->type
= (this->record
!= NULL
)
684 ? this->record
->type
->field_type(field
) : glsl_type::error_type
;
688 ir_dereference_record::ir_dereference_record(ir_variable
*var
,
691 void *ctx
= talloc_parent(var
);
693 this->ir_type
= ir_type_dereference_record
;
694 this->record
= new(ctx
) ir_dereference_variable(var
);
695 this->field
= talloc_strdup(this, field
);
696 this->type
= (this->record
!= NULL
)
697 ? this->record
->type
->field_type(field
) : glsl_type::error_type
;
702 ir_dereference::is_lvalue()
704 ir_variable
*var
= this->variable_referenced();
706 /* Every l-value derference chain eventually ends in a variable.
708 if ((var
== NULL
) || var
->read_only
)
711 if (this->type
->is_array() && !var
->array_lvalue
)
718 const char *tex_opcode_strs
[] = { "tex", "txb", "txl", "txd", "txf" };
720 const char *ir_texture::opcode_string()
722 assert((unsigned int) op
<=
723 sizeof(tex_opcode_strs
) / sizeof(tex_opcode_strs
[0]));
724 return tex_opcode_strs
[op
];
728 ir_texture::get_opcode(const char *str
)
730 const int count
= sizeof(tex_opcode_strs
) / sizeof(tex_opcode_strs
[0]);
731 for (int op
= 0; op
< count
; op
++) {
732 if (strcmp(str
, tex_opcode_strs
[op
]) == 0)
733 return (ir_texture_opcode
) op
;
735 return (ir_texture_opcode
) -1;
740 ir_texture::set_sampler(ir_dereference
*sampler
)
742 assert(sampler
!= NULL
);
743 this->sampler
= sampler
;
745 switch (sampler
->type
->sampler_type
) {
746 case GLSL_TYPE_FLOAT
:
747 this->type
= glsl_type::vec4_type
;
750 this->type
= glsl_type::ivec4_type
;
753 this->type
= glsl_type::uvec4_type
;
760 ir_swizzle::init_mask(const unsigned *comp
, unsigned count
)
762 assert((count
>= 1) && (count
<= 4));
764 memset(&this->mask
, 0, sizeof(this->mask
));
765 this->mask
.num_components
= count
;
767 unsigned dup_mask
= 0;
770 assert(comp
[3] <= 3);
771 dup_mask
|= (1U << comp
[3])
772 & ((1U << comp
[0]) | (1U << comp
[1]) | (1U << comp
[2]));
773 this->mask
.w
= comp
[3];
776 assert(comp
[2] <= 3);
777 dup_mask
|= (1U << comp
[2])
778 & ((1U << comp
[0]) | (1U << comp
[1]));
779 this->mask
.z
= comp
[2];
782 assert(comp
[1] <= 3);
783 dup_mask
|= (1U << comp
[1])
785 this->mask
.y
= comp
[1];
788 assert(comp
[0] <= 3);
789 this->mask
.x
= comp
[0];
792 this->mask
.has_duplicates
= dup_mask
!= 0;
794 /* Based on the number of elements in the swizzle and the base type
795 * (i.e., float, int, unsigned, or bool) of the vector being swizzled,
796 * generate the type of the resulting value.
798 type
= glsl_type::get_instance(val
->type
->base_type
, mask
.num_components
, 1);
801 ir_swizzle::ir_swizzle(ir_rvalue
*val
, unsigned x
, unsigned y
, unsigned z
,
802 unsigned w
, unsigned count
)
805 const unsigned components
[4] = { x
, y
, z
, w
};
806 this->ir_type
= ir_type_swizzle
;
807 this->init_mask(components
, count
);
810 ir_swizzle::ir_swizzle(ir_rvalue
*val
, const unsigned *comp
,
814 this->ir_type
= ir_type_swizzle
;
815 this->init_mask(comp
, count
);
818 ir_swizzle::ir_swizzle(ir_rvalue
*val
, ir_swizzle_mask mask
)
820 this->ir_type
= ir_type_swizzle
;
823 this->type
= glsl_type::get_instance(val
->type
->base_type
,
824 mask
.num_components
, 1);
833 ir_swizzle::create(ir_rvalue
*val
, const char *str
, unsigned vector_length
)
835 void *ctx
= talloc_parent(val
);
837 /* For each possible swizzle character, this table encodes the value in
838 * \c idx_map that represents the 0th element of the vector. For invalid
839 * swizzle characters (e.g., 'k'), a special value is used that will allow
840 * detection of errors.
842 static const unsigned char base_idx
[26] = {
843 /* a b c d e f g h i j k l m */
844 R
, R
, I
, I
, I
, I
, R
, I
, I
, I
, I
, I
, I
,
845 /* n o p q r s t u v w x y z */
846 I
, I
, S
, S
, R
, S
, S
, I
, I
, X
, X
, X
, X
849 /* Each valid swizzle character has an entry in the previous table. This
850 * table encodes the base index encoded in the previous table plus the actual
851 * index of the swizzle character. When processing swizzles, the first
852 * character in the string is indexed in the previous table. Each character
853 * in the string is indexed in this table, and the value found there has the
854 * value form the first table subtracted. The result must be on the range
857 * For example, the string "wzyx" will get X from the first table. Each of
858 * the charcaters will get X+3, X+2, X+1, and X+0 from this table. After
859 * subtraction, the swizzle values are { 3, 2, 1, 0 }.
861 * The string "wzrg" will get X from the first table. Each of the characters
862 * will get X+3, X+2, R+0, and R+1 from this table. After subtraction, the
863 * swizzle values are { 3, 2, 4, 5 }. Since 4 and 5 are outside the range
864 * [0,3], the error is detected.
866 static const unsigned char idx_map
[26] = {
867 /* a b c d e f g h i j k l m */
868 R
+3, R
+2, 0, 0, 0, 0, R
+1, 0, 0, 0, 0, 0, 0,
869 /* n o p q r s t u v w x y z */
870 0, 0, S
+2, S
+3, R
+0, S
+0, S
+1, 0, 0, X
+3, X
+0, X
+1, X
+2
873 int swiz_idx
[4] = { 0, 0, 0, 0 };
877 /* Validate the first character in the swizzle string and look up the base
878 * index value as described above.
880 if ((str
[0] < 'a') || (str
[0] > 'z'))
883 const unsigned base
= base_idx
[str
[0] - 'a'];
886 for (i
= 0; (i
< 4) && (str
[i
] != '\0'); i
++) {
887 /* Validate the next character, and, as described above, convert it to a
890 if ((str
[i
] < 'a') || (str
[i
] > 'z'))
893 swiz_idx
[i
] = idx_map
[str
[i
] - 'a'] - base
;
894 if ((swiz_idx
[i
] < 0) || (swiz_idx
[i
] >= (int) vector_length
))
901 return new(ctx
) ir_swizzle(val
, swiz_idx
[0], swiz_idx
[1], swiz_idx
[2],
911 ir_swizzle::variable_referenced()
913 return this->val
->variable_referenced();
917 ir_variable::ir_variable(const struct glsl_type
*type
, const char *name
,
918 ir_variable_mode mode
)
919 : max_array_access(0), read_only(false), centroid(false), invariant(false),
920 mode(mode
), interpolation(ir_var_smooth
), array_lvalue(false)
922 this->ir_type
= ir_type_variable
;
924 this->name
= talloc_strdup(this, name
);
926 this->warn_extension
= NULL
;
927 this->constant_value
= NULL
;
928 this->origin_upper_left
= false;
929 this->pixel_center_integer
= false;
931 if (type
&& type
->base_type
== GLSL_TYPE_SAMPLER
)
932 this->read_only
= true;
937 ir_variable::interpolation_string() const
939 switch (this->interpolation
) {
940 case ir_var_smooth
: return "smooth";
941 case ir_var_flat
: return "flat";
942 case ir_var_noperspective
: return "noperspective";
945 assert(!"Should not get here.");
951 ir_variable::component_slots() const
953 /* FINISHME: Sparsely accessed arrays require fewer slots. */
954 return this->type
->component_slots();
958 ir_function_signature::ir_function_signature(const glsl_type
*return_type
)
959 : return_type(return_type
), is_defined(false), _function(NULL
)
961 this->ir_type
= ir_type_function_signature
;
962 this->is_built_in
= false;
967 ir_function_signature::qualifiers_match(exec_list
*params
)
969 exec_list_iterator iter_a
= parameters
.iterator();
970 exec_list_iterator iter_b
= params
->iterator();
972 /* check that the qualifiers match. */
973 while (iter_a
.has_next()) {
974 ir_variable
*a
= (ir_variable
*)iter_a
.get();
975 ir_variable
*b
= (ir_variable
*)iter_b
.get();
977 if (a
->read_only
!= b
->read_only
||
978 a
->mode
!= b
->mode
||
979 a
->interpolation
!= b
->interpolation
||
980 a
->centroid
!= b
->centroid
) {
982 /* parameter a's qualifiers don't match */
994 ir_function_signature::replace_parameters(exec_list
*new_params
)
996 /* Destroy all of the previous parameter information. If the previous
997 * parameter information comes from the function prototype, it may either
998 * specify incorrect parameter names or not have names at all.
1000 foreach_iter(exec_list_iterator
, iter
, parameters
) {
1001 assert(((ir_instruction
*) iter
.get())->as_variable() != NULL
);
1006 new_params
->move_nodes_to(¶meters
);
1010 ir_function::ir_function(const char *name
)
1012 this->ir_type
= ir_type_function
;
1013 this->name
= talloc_strdup(this, name
);
1018 ir_call::get_error_instruction(void *ctx
)
1020 ir_call
*call
= new(ctx
) ir_call
;
1022 call
->type
= glsl_type::error_type
;
1027 ir_call::set_callee(ir_function_signature
*sig
)
1029 assert((this->type
== NULL
) || (this->type
== sig
->return_type
));
1035 visit_exec_list(exec_list
*list
, ir_visitor
*visitor
)
1037 foreach_iter(exec_list_iterator
, iter
, *list
) {
1038 ((ir_instruction
*)iter
.get())->accept(visitor
);
1044 steal_memory(ir_instruction
*ir
, void *new_ctx
)
1046 ir_variable
*var
= ir
->as_variable();
1047 ir_constant
*constant
= ir
->as_constant();
1048 if (var
!= NULL
&& var
->constant_value
!= NULL
)
1049 steal_memory(var
->constant_value
, ir
);
1051 /* The components of aggregate constants are not visited by the normal
1052 * visitor, so steal their values by hand.
1054 if (constant
!= NULL
) {
1055 if (constant
->type
->is_record()) {
1056 foreach_iter(exec_list_iterator
, iter
, constant
->components
) {
1057 ir_constant
*field
= (ir_constant
*)iter
.get();
1058 steal_memory(field
, ir
);
1060 } else if (constant
->type
->is_array()) {
1061 for (unsigned int i
= 0; i
< constant
->type
->length
; i
++) {
1062 steal_memory(constant
->array_elements
[i
], ir
);
1067 talloc_steal(new_ctx
, ir
);
1072 reparent_ir(exec_list
*list
, void *mem_ctx
)
1074 foreach_list(node
, list
) {
1075 visit_tree((ir_instruction
*) node
, steal_memory
, mem_ctx
);