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
*) 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->data
.mode
);
46 var
->data
.max_array_access
= this->data
.max_array_access
;
47 if (this->is_interface_instance()) {
48 var
->u
.max_ifc_array_access
=
49 rzalloc_array(var
, unsigned, this->interface_type
->length
);
50 memcpy(var
->u
.max_ifc_array_access
, this->u
.max_ifc_array_access
,
51 this->interface_type
->length
* sizeof(unsigned));
54 memcpy(&var
->data
, &this->data
, sizeof(var
->data
));
56 if (this->get_state_slots()) {
57 ir_state_slot
*s
= var
->allocate_state_slots(this->get_num_state_slots());
58 memcpy(s
, this->get_state_slots(),
59 sizeof(s
[0]) * var
->get_num_state_slots());
62 if (this->constant_value
)
63 var
->constant_value
= this->constant_value
->clone(mem_ctx
, ht
);
65 if (this->constant_initializer
)
66 var
->constant_initializer
=
67 this->constant_initializer
->clone(mem_ctx
, ht
);
69 var
->interface_type
= this->interface_type
;
72 hash_table_insert(ht
, var
, (void *)const_cast<ir_variable
*>(this));
79 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
81 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
85 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
87 ir_rvalue
*new_value
= NULL
;
90 new_value
= this->value
->clone(mem_ctx
, ht
);
92 return new(mem_ctx
) ir_return(new_value
);
96 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
98 ir_rvalue
*new_condition
= NULL
;
100 if (this->condition
!= NULL
)
101 new_condition
= this->condition
->clone(mem_ctx
, ht
);
103 return new(mem_ctx
) ir_discard(new_condition
);
107 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
111 return new(mem_ctx
) ir_loop_jump(this->mode
);
115 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
117 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
119 foreach_in_list(ir_instruction
, ir
, &this->then_instructions
) {
120 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
123 foreach_in_list(ir_instruction
, ir
, &this->else_instructions
) {
124 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
131 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
133 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
135 foreach_in_list(ir_instruction
, ir
, &this->body_instructions
) {
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 ir_dereference_variable
*new_return_ref
= NULL
;
146 if (this->return_deref
!= NULL
)
147 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
149 exec_list new_parameters
;
151 foreach_in_list(ir_instruction
, ir
, &this->actual_parameters
) {
152 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
155 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
159 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
161 ir_rvalue
*op
[Elements(this->operands
)] = { NULL
, };
164 for (i
= 0; i
< get_num_operands(); i
++) {
165 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
168 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
169 op
[0], op
[1], op
[2], op
[3]);
172 ir_dereference_variable
*
173 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
175 ir_variable
*new_var
;
178 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
185 return new(mem_ctx
) ir_dereference_variable(new_var
);
188 ir_dereference_array
*
189 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
191 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
192 this->array_index
->clone(mem_ctx
,
196 ir_dereference_record
*
197 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
199 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
204 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
206 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
207 new_tex
->type
= this->type
;
209 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
210 if (this->coordinate
)
211 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
213 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
214 if (this->shadow_comparitor
) {
215 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
218 if (this->offset
!= NULL
)
219 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
224 case ir_query_levels
:
227 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
232 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
235 new_tex
->lod_info
.sample_index
= this->lod_info
.sample_index
->clone(mem_ctx
, ht
);
238 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
239 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
242 new_tex
->lod_info
.component
= this->lod_info
.component
->clone(mem_ctx
, ht
);
250 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
252 ir_rvalue
*new_condition
= NULL
;
255 new_condition
= this->condition
->clone(mem_ctx
, ht
);
257 ir_assignment
*cloned
=
258 new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
259 this->rhs
->clone(mem_ctx
, ht
),
261 cloned
->write_mask
= this->write_mask
;
266 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
268 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
270 foreach_in_list(const ir_function_signature
, sig
, &this->signatures
) {
271 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
272 copy
->add_signature(sig_copy
);
275 hash_table_insert(ht
, sig_copy
,
276 (void *)const_cast<ir_function_signature
*>(sig
));
282 ir_function_signature
*
283 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
285 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
287 copy
->is_defined
= this->is_defined
;
289 /* Clone the instruction list.
291 foreach_in_list(const ir_instruction
, inst
, &this->body
) {
292 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
293 copy
->body
.push_tail(inst_copy
);
299 ir_function_signature
*
300 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
302 ir_function_signature
*copy
=
303 new(mem_ctx
) ir_function_signature(this->return_type
);
305 copy
->is_defined
= false;
306 copy
->builtin_avail
= this->builtin_avail
;
309 /* Clone the parameter list, but NOT the body.
311 foreach_in_list(const ir_variable
, param
, &this->parameters
) {
312 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
314 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
315 copy
->parameters
.push_tail(param_copy
);
322 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
326 switch (this->type
->base_type
) {
329 case GLSL_TYPE_FLOAT
:
331 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
333 case GLSL_TYPE_STRUCT
: {
334 ir_constant
*c
= new(mem_ctx
) ir_constant
;
336 c
->type
= this->type
;
337 for (exec_node
*node
= this->components
.head
338 ; !node
->is_tail_sentinel()
339 ; node
= node
->next
) {
340 ir_constant
*const orig
= (ir_constant
*) node
;
342 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
348 case GLSL_TYPE_ARRAY
: {
349 ir_constant
*c
= new(mem_ctx
) ir_constant
;
351 c
->type
= this->type
;
352 c
->array_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
353 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
354 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
359 case GLSL_TYPE_SAMPLER
:
360 case GLSL_TYPE_IMAGE
:
361 case GLSL_TYPE_ATOMIC_UINT
:
363 case GLSL_TYPE_ERROR
:
364 case GLSL_TYPE_INTERFACE
:
365 assert(!"Should not get here.");
373 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
375 fixup_ir_call_visitor(struct hash_table
*ht
)
380 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
382 /* Try to find the function signature referenced by the ir_call in the
383 * table. If it is found, replace it with the value from the table.
385 ir_function_signature
*sig
=
386 (ir_function_signature
*) hash_table_find(this->ht
, ir
->callee
);
390 /* Since this may be used before function call parameters are flattened,
391 * the children also need to be processed.
393 return visit_continue
;
397 struct hash_table
*ht
;
402 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
404 fixup_ir_call_visitor
v(ht
);
410 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
412 struct hash_table
*ht
=
413 hash_table_ctor(0, hash_table_pointer_hash
, hash_table_pointer_compare
);
415 foreach_in_list(const ir_instruction
, original
, in
) {
416 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
418 out
->push_tail(copy
);
421 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
422 * cloned ir_function_signature nodes. This cannot be done automatically
423 * during cloning because the ir_call might be a forward reference (i.e.,
424 * the function signature that it references may not have been cloned yet).
426 fixup_function_calls(ht
, out
);