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 #include "glsl_types.h"
28 #include "program/hash_table.h"
32 * Duplicate an IR variable
35 * This will probably be made \c virtual and moved to the base class
39 ir_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
41 ir_variable
*var
= new(mem_ctx
) ir_variable(this->type
, this->name
,
42 (ir_variable_mode
) this->mode
);
44 var
->max_array_access
= this->max_array_access
;
45 var
->read_only
= this->read_only
;
46 var
->centroid
= this->centroid
;
47 var
->invariant
= this->invariant
;
48 var
->shader_in
= this->shader_in
;
49 var
->shader_out
= this->shader_out
;
50 var
->interpolation
= this->interpolation
;
51 var
->array_lvalue
= this->array_lvalue
;
52 var
->location
= this->location
;
53 var
->warn_extension
= this->warn_extension
;
54 var
->origin_upper_left
= this->origin_upper_left
;
55 var
->pixel_center_integer
= this->pixel_center_integer
;
57 if (this->constant_value
)
58 var
->constant_value
= this->constant_value
->clone(mem_ctx
, ht
);
61 hash_table_insert(ht
, var
, (void *)const_cast<ir_variable
*>(this));
68 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
70 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
74 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
76 ir_rvalue
*new_value
= NULL
;
79 new_value
= this->value
->clone(mem_ctx
, ht
);
81 return new(mem_ctx
) ir_return(new_value
);
85 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
87 ir_rvalue
*new_condition
= NULL
;
89 if (this->condition
!= NULL
)
90 new_condition
= this->condition
->clone(mem_ctx
, ht
);
92 return new(mem_ctx
) ir_discard(new_condition
);
96 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
100 return new(mem_ctx
) ir_loop_jump(this->mode
);
104 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
106 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
108 foreach_iter(exec_list_iterator
, iter
, this->then_instructions
) {
109 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
110 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
113 foreach_iter(exec_list_iterator
, iter
, this->else_instructions
) {
114 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
115 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
122 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
124 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
127 new_loop
->from
= this->from
->clone(mem_ctx
, ht
);
129 new_loop
->to
= this->to
->clone(mem_ctx
, ht
);
131 new_loop
->increment
= this->increment
->clone(mem_ctx
, ht
);
132 new_loop
->counter
= counter
;
134 foreach_iter(exec_list_iterator
, iter
, this->body_instructions
) {
135 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
136 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
143 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
145 exec_list new_parameters
;
147 foreach_iter(exec_list_iterator
, iter
, this->actual_parameters
) {
148 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
149 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
152 return new(mem_ctx
) ir_call(this->callee
, &new_parameters
);
156 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
158 ir_rvalue
*op
[2] = {NULL
, NULL
};
161 for (i
= 0; i
< get_num_operands(); i
++) {
162 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
165 return new(mem_ctx
) ir_expression(this->operation
, this->type
, op
[0], op
[1]);
168 ir_dereference_variable
*
169 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
171 ir_variable
*new_var
;
174 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
181 return new(mem_ctx
) ir_dereference_variable(new_var
);
184 ir_dereference_array
*
185 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
187 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
188 this->array_index
->clone(mem_ctx
,
192 ir_dereference_record
*
193 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
195 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
200 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
202 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
203 new_tex
->type
= this->type
;
205 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
206 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
208 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
209 if (this->shadow_comparitor
) {
210 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
213 for (int i
= 0; i
< 3; i
++)
214 new_tex
->offsets
[i
] = this->offsets
[i
];
220 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
224 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
227 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
228 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
236 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
238 ir_rvalue
*new_condition
= NULL
;
241 new_condition
= this->condition
->clone(mem_ctx
, ht
);
243 return new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
244 this->rhs
->clone(mem_ctx
, ht
),
250 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
252 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
254 foreach_list_const(node
, &this->signatures
) {
255 const ir_function_signature
*const sig
=
256 (const ir_function_signature
*const) node
;
258 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
259 copy
->add_signature(sig_copy
);
262 hash_table_insert(ht
, sig_copy
,
263 (void *)const_cast<ir_function_signature
*>(sig
));
269 ir_function_signature
*
270 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
272 ir_function_signature
*copy
=
273 new(mem_ctx
) ir_function_signature(this->return_type
);
275 copy
->is_defined
= this->is_defined
;
276 copy
->is_built_in
= this->is_built_in
;
278 /* Clone the parameter list.
280 foreach_list_const(node
, &this->parameters
) {
281 const ir_variable
*const param
= (const ir_variable
*) node
;
283 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
285 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
286 copy
->parameters
.push_tail(param_copy
);
289 /* Clone the instruction list.
291 foreach_list_const(node
, &this->body
) {
292 const ir_instruction
*const inst
= (const ir_instruction
*) node
;
294 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
295 copy
->body
.push_tail(inst_copy
);
302 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
306 switch (this->type
->base_type
) {
309 case GLSL_TYPE_FLOAT
:
311 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
313 case GLSL_TYPE_STRUCT
: {
314 ir_constant
*c
= new(mem_ctx
) ir_constant
;
316 c
->type
= this->type
;
317 for (exec_node
*node
= this->components
.head
318 ; !node
->is_tail_sentinel()
319 ; node
= node
->next
) {
320 ir_constant
*const orig
= (ir_constant
*) node
;
322 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
328 case GLSL_TYPE_ARRAY
: {
329 ir_constant
*c
= new(mem_ctx
) ir_constant
;
331 c
->type
= this->type
;
332 c
->array_elements
= talloc_array(c
, ir_constant
*, this->type
->length
);
333 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
334 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
340 assert(!"Should not get here."); break;
346 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
348 fixup_ir_call_visitor(struct hash_table
*ht
)
353 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
355 /* Try to find the function signature referenced by the ir_call in the
356 * table. If it is found, replace it with the value from the table.
358 ir_function_signature
*sig
=
359 (ir_function_signature
*) hash_table_find(this->ht
, ir
->get_callee());
363 /* Since this may be used before function call parameters are flattened,
364 * the children also need to be processed.
366 return visit_continue
;
370 struct hash_table
*ht
;
375 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
377 fixup_ir_call_visitor
v(ht
);
383 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
385 struct hash_table
*ht
=
386 hash_table_ctor(0, hash_table_pointer_hash
, hash_table_pointer_compare
);
388 foreach_list_const(node
, in
) {
389 const ir_instruction
*const original
= (ir_instruction
*) node
;
390 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
392 out
->push_tail(copy
);
395 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
396 * cloned ir_function_signature nodes. This cannot be done automatically
397 * during cloning because the ir_call might be a forward reference (i.e.,
398 * the function signature that it references may not have been cloned yet).
400 fixup_function_calls(ht
, out
);