2 * Copyright © 2013 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 "ir_builder.h"
25 #include "ir_rvalue_visitor.h"
26 #include "ir_optimization.h"
28 using namespace ir_builder
;
30 class vector_insert_visitor
: public ir_rvalue_visitor
{
32 vector_insert_visitor(bool lower_nonconstant_index
)
33 : progress(false), lower_nonconstant_index(lower_nonconstant_index
)
35 factory
.instructions
= &factory_instructions
;
38 virtual ~vector_insert_visitor()
40 assert(factory_instructions
.is_empty());
43 virtual void handle_rvalue(ir_rvalue
**rv
);
46 exec_list factory_instructions
;
48 bool lower_nonconstant_index
;
53 vector_insert_visitor::handle_rvalue(ir_rvalue
**rv
)
55 if (*rv
== NULL
|| (*rv
)->ir_type
!= ir_type_expression
)
58 ir_expression
*const expr
= (ir_expression
*) *rv
;
60 if (likely(expr
->operation
!= ir_triop_vector_insert
))
63 factory
.mem_ctx
= ralloc_parent(expr
);
65 ir_constant
*const idx
= expr
->operands
[2]->constant_expression_value();
67 /* Replace (vector_insert (vec) (scalar) (index)) with a dereference of
68 * a new temporary. The new temporary gets assigned as
73 * where mask is the component selected by index.
75 ir_variable
*const temp
=
76 factory
.make_temp(expr
->operands
[0]->type
, "vec_tmp");
78 const int mask
= 1 << idx
->value
.i
[0];
80 factory
.emit(assign(temp
, expr
->operands
[0]));
81 factory
.emit(assign(temp
, expr
->operands
[1], mask
));
83 this->progress
= true;
84 *rv
= new(factory
.mem_ctx
) ir_dereference_variable(temp
);
85 } else if (this->lower_nonconstant_index
) {
86 /* Replace (vector_insert (vec) (scalar) (index)) with a dereference of
87 * a new temporary. The new temporary gets assigned as
99 ir_variable
*const temp
=
100 factory
.make_temp(expr
->operands
[0]->type
, "vec_tmp");
102 ir_variable
*const src_temp
=
103 factory
.make_temp(expr
->operands
[1]->type
, "src_temp");
105 factory
.emit(assign(temp
, expr
->operands
[0]));
106 factory
.emit(assign(src_temp
, expr
->operands
[1]));
108 for (unsigned i
= 0; i
< expr
->type
->vector_elements
; i
++) {
109 ir_constant
*const cmp_index
=
110 new(factory
.mem_ctx
) ir_constant(int(i
));
112 ir_variable
*const cmp_result
=
113 factory
.make_temp(glsl_type::bool_type
, "index_condition");
115 factory
.emit(assign(cmp_result
,
116 equal(expr
->operands
[2]->clone(factory
.mem_ctx
,
120 factory
.emit(if_tree(cmp_result
,
121 assign(temp
, src_temp
, WRITEMASK_X
<< i
)));
124 this->progress
= true;
125 *rv
= new(factory
.mem_ctx
) ir_dereference_variable(temp
);
128 base_ir
->insert_before(factory
.instructions
);
132 lower_vector_insert(exec_list
*instructions
, bool lower_nonconstant_index
)
134 vector_insert_visitor
v(lower_nonconstant_index
);
136 visit_list_elements(&v
, instructions
);