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->data
.mode
);
46 var
->data
.max_array_access
= this->data
.max_array_access
;
47 if (this->is_interface_instance()) {
48 var
->max_ifc_array_access
=
49 rzalloc_array(var
, unsigned, this->interface_type
->length
);
50 memcpy(var
->max_ifc_array_access
, this->max_ifc_array_access
,
51 this->interface_type
->length
* sizeof(unsigned));
54 memcpy(&var
->data
, &this->data
, sizeof(var
->data
));
56 var
->warn_extension
= this->warn_extension
;
58 var
->num_state_slots
= this->num_state_slots
;
59 if (this->state_slots
) {
60 /* FINISHME: This really wants to use something like talloc_reference, but
61 * FINISHME: ralloc doesn't have any similar function.
63 var
->state_slots
= ralloc_array(var
, ir_state_slot
,
64 this->num_state_slots
);
65 memcpy(var
->state_slots
, this->state_slots
,
66 sizeof(this->state_slots
[0]) * var
->num_state_slots
);
69 if (this->constant_value
)
70 var
->constant_value
= this->constant_value
->clone(mem_ctx
, ht
);
72 if (this->constant_initializer
)
73 var
->constant_initializer
=
74 this->constant_initializer
->clone(mem_ctx
, ht
);
76 var
->interface_type
= this->interface_type
;
79 hash_table_insert(ht
, var
, (void *)const_cast<ir_variable
*>(this));
86 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
88 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
92 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
94 ir_rvalue
*new_value
= NULL
;
97 new_value
= this->value
->clone(mem_ctx
, ht
);
99 return new(mem_ctx
) ir_return(new_value
);
103 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
105 ir_rvalue
*new_condition
= NULL
;
107 if (this->condition
!= NULL
)
108 new_condition
= this->condition
->clone(mem_ctx
, ht
);
110 return new(mem_ctx
) ir_discard(new_condition
);
114 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
118 return new(mem_ctx
) ir_loop_jump(this->mode
);
122 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
124 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
126 foreach_list(n
, &this->then_instructions
) {
127 ir_instruction
*ir
= (ir_instruction
*) n
;
128 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
131 foreach_list(n
, &this->else_instructions
) {
132 ir_instruction
*ir
= (ir_instruction
*) n
;
133 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
140 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
142 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
144 foreach_list(n
, &this->body_instructions
) {
145 ir_instruction
*ir
= (ir_instruction
*) n
;
146 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
153 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
155 ir_dereference_variable
*new_return_ref
= NULL
;
156 if (this->return_deref
!= NULL
)
157 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
159 exec_list new_parameters
;
161 foreach_list(n
, &this->actual_parameters
) {
162 ir_instruction
*ir
= (ir_instruction
*) n
;
163 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
166 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
170 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
172 ir_rvalue
*op
[Elements(this->operands
)] = { NULL
, };
175 for (i
= 0; i
< get_num_operands(); i
++) {
176 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
179 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
180 op
[0], op
[1], op
[2], op
[3]);
183 ir_dereference_variable
*
184 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
186 ir_variable
*new_var
;
189 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
196 return new(mem_ctx
) ir_dereference_variable(new_var
);
199 ir_dereference_array
*
200 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
202 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
203 this->array_index
->clone(mem_ctx
,
207 ir_dereference_record
*
208 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
210 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
215 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
217 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
218 new_tex
->type
= this->type
;
220 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
221 if (this->coordinate
)
222 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
224 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
225 if (this->shadow_comparitor
) {
226 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
229 if (this->offset
!= NULL
)
230 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
235 case ir_query_levels
:
238 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
243 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
246 new_tex
->lod_info
.sample_index
= this->lod_info
.sample_index
->clone(mem_ctx
, ht
);
249 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
250 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
253 new_tex
->lod_info
.component
= this->lod_info
.component
->clone(mem_ctx
, ht
);
261 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
263 ir_rvalue
*new_condition
= NULL
;
266 new_condition
= this->condition
->clone(mem_ctx
, ht
);
268 return new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
269 this->rhs
->clone(mem_ctx
, ht
),
275 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
277 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
279 foreach_list_const(node
, &this->signatures
) {
280 const ir_function_signature
*const sig
=
281 (const ir_function_signature
*const) node
;
283 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
284 copy
->add_signature(sig_copy
);
287 hash_table_insert(ht
, sig_copy
,
288 (void *)const_cast<ir_function_signature
*>(sig
));
294 ir_function_signature
*
295 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
297 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
299 copy
->is_defined
= this->is_defined
;
301 /* Clone the instruction list.
303 foreach_list_const(node
, &this->body
) {
304 const ir_instruction
*const inst
= (const ir_instruction
*) node
;
306 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
307 copy
->body
.push_tail(inst_copy
);
313 ir_function_signature
*
314 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
316 ir_function_signature
*copy
=
317 new(mem_ctx
) ir_function_signature(this->return_type
);
319 copy
->is_defined
= false;
320 copy
->builtin_avail
= this->builtin_avail
;
323 /* Clone the parameter list, but NOT the body.
325 foreach_list_const(node
, &this->parameters
) {
326 const ir_variable
*const param
= (const ir_variable
*) node
;
328 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
330 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
331 copy
->parameters
.push_tail(param_copy
);
338 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
342 switch (this->type
->base_type
) {
345 case GLSL_TYPE_FLOAT
:
347 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
349 case GLSL_TYPE_STRUCT
: {
350 ir_constant
*c
= new(mem_ctx
) ir_constant
;
352 c
->type
= this->type
;
353 for (exec_node
*node
= this->components
.head
354 ; !node
->is_tail_sentinel()
355 ; node
= node
->next
) {
356 ir_constant
*const orig
= (ir_constant
*) node
;
358 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
364 case GLSL_TYPE_ARRAY
: {
365 ir_constant
*c
= new(mem_ctx
) ir_constant
;
367 c
->type
= this->type
;
368 c
->array_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
369 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
370 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
375 case GLSL_TYPE_SAMPLER
:
376 case GLSL_TYPE_ATOMIC_UINT
:
378 case GLSL_TYPE_ERROR
:
379 case GLSL_TYPE_INTERFACE
:
380 assert(!"Should not get here.");
388 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
390 fixup_ir_call_visitor(struct hash_table
*ht
)
395 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
397 /* Try to find the function signature referenced by the ir_call in the
398 * table. If it is found, replace it with the value from the table.
400 ir_function_signature
*sig
=
401 (ir_function_signature
*) hash_table_find(this->ht
, ir
->callee
);
405 /* Since this may be used before function call parameters are flattened,
406 * the children also need to be processed.
408 return visit_continue
;
412 struct hash_table
*ht
;
417 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
419 fixup_ir_call_visitor
v(ht
);
425 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
427 struct hash_table
*ht
=
428 hash_table_ctor(0, hash_table_pointer_hash
, hash_table_pointer_compare
);
430 foreach_list_const(node
, in
) {
431 const ir_instruction
*const original
= (ir_instruction
*) node
;
432 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
434 out
->push_tail(copy
);
437 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
438 * cloned ir_function_signature nodes. This cannot be done automatically
439 * during cloning because the ir_call might be a forward reference (i.e.,
440 * the function signature that it references may not have been cloned yet).
442 fixup_function_calls(ht
, out
);