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.
25 #include "main/compiler.h"
27 #include "glsl_types.h"
28 #include "program/hash_table.h"
31 ir_rvalue::clone(void *mem_ctx
, struct hash_table
*ht
) const
33 /* The only possible instantiation is the generic error value. */
34 return error_value(mem_ctx
);
38 * Duplicate an IR variable
41 ir_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
43 ir_variable
*var
= new(mem_ctx
) ir_variable(this->type
, this->name
,
44 (ir_variable_mode
) this->mode
);
46 var
->max_array_access
= this->max_array_access
;
47 var
->read_only
= this->read_only
;
48 var
->centroid
= this->centroid
;
49 var
->invariant
= this->invariant
;
50 var
->interpolation
= this->interpolation
;
51 var
->location
= this->location
;
52 var
->index
= this->index
;
53 var
->binding
= this->binding
;
54 var
->warn_extension
= this->warn_extension
;
55 var
->origin_upper_left
= this->origin_upper_left
;
56 var
->pixel_center_integer
= this->pixel_center_integer
;
57 var
->explicit_location
= this->explicit_location
;
58 var
->explicit_index
= this->explicit_index
;
59 var
->explicit_binding
= this->explicit_binding
;
60 var
->has_initializer
= this->has_initializer
;
61 var
->depth_layout
= this->depth_layout
;
62 var
->assigned
= this->assigned
;
63 var
->used
= this->used
;
65 var
->num_state_slots
= this->num_state_slots
;
66 if (this->state_slots
) {
67 /* FINISHME: This really wants to use something like talloc_reference, but
68 * FINISHME: ralloc doesn't have any similar function.
70 var
->state_slots
= ralloc_array(var
, ir_state_slot
,
71 this->num_state_slots
);
72 memcpy(var
->state_slots
, this->state_slots
,
73 sizeof(this->state_slots
[0]) * var
->num_state_slots
);
76 if (this->constant_value
)
77 var
->constant_value
= this->constant_value
->clone(mem_ctx
, ht
);
79 if (this->constant_initializer
)
80 var
->constant_initializer
=
81 this->constant_initializer
->clone(mem_ctx
, ht
);
83 var
->interface_type
= this->interface_type
;
86 hash_table_insert(ht
, var
, (void *)const_cast<ir_variable
*>(this));
93 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
95 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
99 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
101 ir_rvalue
*new_value
= NULL
;
104 new_value
= this->value
->clone(mem_ctx
, ht
);
106 return new(mem_ctx
) ir_return(new_value
);
110 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
112 ir_rvalue
*new_condition
= NULL
;
114 if (this->condition
!= NULL
)
115 new_condition
= this->condition
->clone(mem_ctx
, ht
);
117 return new(mem_ctx
) ir_discard(new_condition
);
121 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
125 return new(mem_ctx
) ir_loop_jump(this->mode
);
129 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
131 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
133 foreach_iter(exec_list_iterator
, iter
, this->then_instructions
) {
134 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
135 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
138 foreach_iter(exec_list_iterator
, iter
, this->else_instructions
) {
139 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
140 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
147 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
149 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
152 new_loop
->from
= this->from
->clone(mem_ctx
, ht
);
154 new_loop
->to
= this->to
->clone(mem_ctx
, ht
);
156 new_loop
->increment
= this->increment
->clone(mem_ctx
, ht
);
157 new_loop
->counter
= counter
;
159 foreach_iter(exec_list_iterator
, iter
, this->body_instructions
) {
160 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
161 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
164 new_loop
->cmp
= this->cmp
;
169 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
171 ir_dereference_variable
*new_return_ref
= NULL
;
172 if (this->return_deref
!= NULL
)
173 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
175 exec_list new_parameters
;
177 foreach_iter(exec_list_iterator
, iter
, this->actual_parameters
) {
178 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
179 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
182 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
186 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
188 ir_rvalue
*op
[Elements(this->operands
)] = { NULL
, };
191 for (i
= 0; i
< get_num_operands(); i
++) {
192 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
195 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
196 op
[0], op
[1], op
[2], op
[3]);
199 ir_dereference_variable
*
200 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
202 ir_variable
*new_var
;
205 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
212 return new(mem_ctx
) ir_dereference_variable(new_var
);
215 ir_dereference_array
*
216 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
218 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
219 this->array_index
->clone(mem_ctx
,
223 ir_dereference_record
*
224 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
226 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
231 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
233 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
234 new_tex
->type
= this->type
;
236 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
237 if (this->coordinate
)
238 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
240 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
241 if (this->shadow_comparitor
) {
242 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
245 if (this->offset
!= NULL
)
246 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
252 case ir_query_levels
:
255 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
260 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
263 new_tex
->lod_info
.sample_index
= this->lod_info
.sample_index
->clone(mem_ctx
, ht
);
266 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
267 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
275 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
277 ir_rvalue
*new_condition
= NULL
;
280 new_condition
= this->condition
->clone(mem_ctx
, ht
);
282 return new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
283 this->rhs
->clone(mem_ctx
, ht
),
289 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
291 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
293 foreach_list_const(node
, &this->signatures
) {
294 const ir_function_signature
*const sig
=
295 (const ir_function_signature
*const) node
;
297 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
298 copy
->add_signature(sig_copy
);
301 hash_table_insert(ht
, sig_copy
,
302 (void *)const_cast<ir_function_signature
*>(sig
));
308 ir_function_signature
*
309 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
311 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
313 copy
->is_defined
= this->is_defined
;
315 /* Clone the instruction list.
317 foreach_list_const(node
, &this->body
) {
318 const ir_instruction
*const inst
= (const ir_instruction
*) node
;
320 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
321 copy
->body
.push_tail(inst_copy
);
327 ir_function_signature
*
328 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
330 ir_function_signature
*copy
=
331 new(mem_ctx
) ir_function_signature(this->return_type
);
333 copy
->is_defined
= false;
334 copy
->builtin_avail
= this->builtin_avail
;
337 /* Clone the parameter list, but NOT the body.
339 foreach_list_const(node
, &this->parameters
) {
340 const ir_variable
*const param
= (const ir_variable
*) node
;
342 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
344 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
345 copy
->parameters
.push_tail(param_copy
);
352 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
356 switch (this->type
->base_type
) {
359 case GLSL_TYPE_FLOAT
:
361 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
363 case GLSL_TYPE_STRUCT
: {
364 ir_constant
*c
= new(mem_ctx
) ir_constant
;
366 c
->type
= this->type
;
367 for (exec_node
*node
= this->components
.head
368 ; !node
->is_tail_sentinel()
369 ; node
= node
->next
) {
370 ir_constant
*const orig
= (ir_constant
*) node
;
372 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
378 case GLSL_TYPE_ARRAY
: {
379 ir_constant
*c
= new(mem_ctx
) ir_constant
;
381 c
->type
= this->type
;
382 c
->array_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
383 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
384 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
389 case GLSL_TYPE_SAMPLER
:
391 case GLSL_TYPE_ERROR
:
392 case GLSL_TYPE_INTERFACE
:
393 assert(!"Should not get here.");
401 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
403 fixup_ir_call_visitor(struct hash_table
*ht
)
408 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
410 /* Try to find the function signature referenced by the ir_call in the
411 * table. If it is found, replace it with the value from the table.
413 ir_function_signature
*sig
=
414 (ir_function_signature
*) hash_table_find(this->ht
, ir
->callee
);
418 /* Since this may be used before function call parameters are flattened,
419 * the children also need to be processed.
421 return visit_continue
;
425 struct hash_table
*ht
;
430 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
432 fixup_ir_call_visitor
v(ht
);
438 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
440 struct hash_table
*ht
=
441 hash_table_ctor(0, hash_table_pointer_hash
, hash_table_pointer_compare
);
443 foreach_list_const(node
, in
) {
444 const ir_instruction
*const original
= (ir_instruction
*) node
;
445 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
447 out
->push_tail(copy
);
450 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
451 * cloned ir_function_signature nodes. This cannot be done automatically
452 * during cloning because the ir_call might be a forward reference (i.e.,
453 * the function signature that it references may not have been cloned yet).
455 fixup_function_calls(ht
, out
);