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
->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_in_list(ir_instruction
, ir
, &this->then_instructions
) {
127 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
130 foreach_in_list(ir_instruction
, ir
, &this->else_instructions
) {
131 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
138 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
140 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
142 foreach_in_list(ir_instruction
, ir
, &this->body_instructions
) {
143 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
150 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
152 ir_dereference_variable
*new_return_ref
= NULL
;
153 if (this->return_deref
!= NULL
)
154 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
156 exec_list new_parameters
;
158 foreach_in_list(ir_instruction
, ir
, &this->actual_parameters
) {
159 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
162 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
166 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
168 ir_rvalue
*op
[Elements(this->operands
)] = { NULL
, };
171 for (i
= 0; i
< get_num_operands(); i
++) {
172 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
175 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
176 op
[0], op
[1], op
[2], op
[3]);
179 ir_dereference_variable
*
180 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
182 ir_variable
*new_var
;
185 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
192 return new(mem_ctx
) ir_dereference_variable(new_var
);
195 ir_dereference_array
*
196 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
198 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
199 this->array_index
->clone(mem_ctx
,
203 ir_dereference_record
*
204 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
206 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
211 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
213 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
214 new_tex
->type
= this->type
;
216 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
217 if (this->coordinate
)
218 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
220 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
221 if (this->shadow_comparitor
) {
222 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
225 if (this->offset
!= NULL
)
226 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
231 case ir_query_levels
:
234 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
239 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
242 new_tex
->lod_info
.sample_index
= this->lod_info
.sample_index
->clone(mem_ctx
, ht
);
245 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
246 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
249 new_tex
->lod_info
.component
= this->lod_info
.component
->clone(mem_ctx
, ht
);
257 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
259 ir_rvalue
*new_condition
= NULL
;
262 new_condition
= this->condition
->clone(mem_ctx
, ht
);
264 ir_assignment
*cloned
=
265 new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
266 this->rhs
->clone(mem_ctx
, ht
),
268 cloned
->write_mask
= this->write_mask
;
273 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
275 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
277 foreach_list_const(node
, &this->signatures
) {
278 const ir_function_signature
*const sig
=
279 (const ir_function_signature
*const) node
;
281 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
282 copy
->add_signature(sig_copy
);
285 hash_table_insert(ht
, sig_copy
,
286 (void *)const_cast<ir_function_signature
*>(sig
));
292 ir_function_signature
*
293 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
295 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
297 copy
->is_defined
= this->is_defined
;
299 /* Clone the instruction list.
301 foreach_list_const(node
, &this->body
) {
302 const ir_instruction
*const inst
= (const ir_instruction
*) node
;
304 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
305 copy
->body
.push_tail(inst_copy
);
311 ir_function_signature
*
312 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
314 ir_function_signature
*copy
=
315 new(mem_ctx
) ir_function_signature(this->return_type
);
317 copy
->is_defined
= false;
318 copy
->builtin_avail
= this->builtin_avail
;
321 /* Clone the parameter list, but NOT the body.
323 foreach_list_const(node
, &this->parameters
) {
324 const ir_variable
*const param
= (const ir_variable
*) node
;
326 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
328 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
329 copy
->parameters
.push_tail(param_copy
);
336 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
340 switch (this->type
->base_type
) {
343 case GLSL_TYPE_FLOAT
:
345 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
347 case GLSL_TYPE_STRUCT
: {
348 ir_constant
*c
= new(mem_ctx
) ir_constant
;
350 c
->type
= this->type
;
351 for (exec_node
*node
= this->components
.head
352 ; !node
->is_tail_sentinel()
353 ; node
= node
->next
) {
354 ir_constant
*const orig
= (ir_constant
*) node
;
356 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
362 case GLSL_TYPE_ARRAY
: {
363 ir_constant
*c
= new(mem_ctx
) ir_constant
;
365 c
->type
= this->type
;
366 c
->array_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
367 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
368 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
373 case GLSL_TYPE_SAMPLER
:
374 case GLSL_TYPE_IMAGE
:
375 case GLSL_TYPE_ATOMIC_UINT
:
377 case GLSL_TYPE_ERROR
:
378 case GLSL_TYPE_INTERFACE
:
379 assert(!"Should not get here.");
387 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
389 fixup_ir_call_visitor(struct hash_table
*ht
)
394 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
396 /* Try to find the function signature referenced by the ir_call in the
397 * table. If it is found, replace it with the value from the table.
399 ir_function_signature
*sig
=
400 (ir_function_signature
*) hash_table_find(this->ht
, ir
->callee
);
404 /* Since this may be used before function call parameters are flattened,
405 * the children also need to be processed.
407 return visit_continue
;
411 struct hash_table
*ht
;
416 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
418 fixup_ir_call_visitor
v(ht
);
424 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
426 struct hash_table
*ht
=
427 hash_table_ctor(0, hash_table_pointer_hash
, hash_table_pointer_compare
);
429 foreach_list_const(node
, in
) {
430 const ir_instruction
*const original
= (ir_instruction
*) node
;
431 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
433 out
->push_tail(copy
);
436 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
437 * cloned ir_function_signature nodes. This cannot be done automatically
438 * during cloning because the ir_call might be a forward reference (i.e.,
439 * the function signature that it references may not have been cloned yet).
441 fixup_function_calls(ht
, out
);