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 * This will probably be made \c virtual and moved to the base class
45 ir_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
47 ir_variable
*var
= new(mem_ctx
) ir_variable(this->type
, this->name
,
48 (ir_variable_mode
) this->mode
);
50 var
->max_array_access
= this->max_array_access
;
51 var
->read_only
= this->read_only
;
52 var
->centroid
= this->centroid
;
53 var
->invariant
= this->invariant
;
54 var
->interpolation
= this->interpolation
;
55 var
->location
= this->location
;
56 var
->index
= this->index
;
57 var
->warn_extension
= this->warn_extension
;
58 var
->origin_upper_left
= this->origin_upper_left
;
59 var
->pixel_center_integer
= this->pixel_center_integer
;
60 var
->explicit_location
= this->explicit_location
;
61 var
->explicit_index
= this->explicit_index
;
62 var
->has_initializer
= this->has_initializer
;
63 var
->depth_layout
= this->depth_layout
;
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
);
84 hash_table_insert(ht
, var
, (void *)const_cast<ir_variable
*>(this));
91 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
93 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
97 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
99 ir_rvalue
*new_value
= NULL
;
102 new_value
= this->value
->clone(mem_ctx
, ht
);
104 return new(mem_ctx
) ir_return(new_value
);
108 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
110 ir_rvalue
*new_condition
= NULL
;
112 if (this->condition
!= NULL
)
113 new_condition
= this->condition
->clone(mem_ctx
, ht
);
115 return new(mem_ctx
) ir_discard(new_condition
);
119 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
123 return new(mem_ctx
) ir_loop_jump(this->mode
);
127 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
129 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
131 foreach_iter(exec_list_iterator
, iter
, this->then_instructions
) {
132 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
133 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
136 foreach_iter(exec_list_iterator
, iter
, this->else_instructions
) {
137 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
138 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
145 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
147 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
150 new_loop
->from
= this->from
->clone(mem_ctx
, ht
);
152 new_loop
->to
= this->to
->clone(mem_ctx
, ht
);
154 new_loop
->increment
= this->increment
->clone(mem_ctx
, ht
);
155 new_loop
->counter
= counter
;
157 foreach_iter(exec_list_iterator
, iter
, this->body_instructions
) {
158 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
159 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
162 new_loop
->cmp
= this->cmp
;
167 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
169 ir_dereference_variable
*new_return_ref
= NULL
;
170 if (this->return_deref
!= NULL
)
171 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
173 exec_list new_parameters
;
175 foreach_iter(exec_list_iterator
, iter
, this->actual_parameters
) {
176 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
177 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
180 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
184 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
186 ir_rvalue
*op
[Elements(this->operands
)] = { NULL
, };
189 for (i
= 0; i
< get_num_operands(); i
++) {
190 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
193 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
194 op
[0], op
[1], op
[2], op
[3]);
197 ir_dereference_variable
*
198 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
200 ir_variable
*new_var
;
203 new_var
= (ir_variable
*)hash_table_find(ht
, this->var
);
210 return new(mem_ctx
) ir_dereference_variable(new_var
);
213 ir_dereference_array
*
214 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
216 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
217 this->array_index
->clone(mem_ctx
,
221 ir_dereference_record
*
222 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
224 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
229 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
231 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
232 new_tex
->type
= this->type
;
234 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
235 if (this->coordinate
)
236 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
238 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
239 if (this->shadow_comparitor
) {
240 new_tex
->shadow_comparitor
= this->shadow_comparitor
->clone(mem_ctx
, ht
);
243 if (this->offset
!= NULL
)
244 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
250 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
255 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
258 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
259 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
267 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
269 ir_rvalue
*new_condition
= NULL
;
272 new_condition
= this->condition
->clone(mem_ctx
, ht
);
274 return new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
275 this->rhs
->clone(mem_ctx
, ht
),
281 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
283 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
285 foreach_list_const(node
, &this->signatures
) {
286 const ir_function_signature
*const sig
=
287 (const ir_function_signature
*const) node
;
289 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
290 copy
->add_signature(sig_copy
);
293 hash_table_insert(ht
, sig_copy
,
294 (void *)const_cast<ir_function_signature
*>(sig
));
300 ir_function_signature
*
301 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
303 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
305 copy
->is_defined
= this->is_defined
;
307 /* Clone the instruction list.
309 foreach_list_const(node
, &this->body
) {
310 const ir_instruction
*const inst
= (const ir_instruction
*) node
;
312 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
313 copy
->body
.push_tail(inst_copy
);
319 ir_function_signature
*
320 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
322 ir_function_signature
*copy
=
323 new(mem_ctx
) ir_function_signature(this->return_type
);
325 copy
->is_defined
= false;
326 copy
->is_builtin
= this->is_builtin
;
329 /* Clone the parameter list, but NOT the body.
331 foreach_list_const(node
, &this->parameters
) {
332 const ir_variable
*const param
= (const ir_variable
*) node
;
334 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
336 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
337 copy
->parameters
.push_tail(param_copy
);
344 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
348 switch (this->type
->base_type
) {
351 case GLSL_TYPE_FLOAT
:
353 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
355 case GLSL_TYPE_STRUCT
: {
356 ir_constant
*c
= new(mem_ctx
) ir_constant
;
358 c
->type
= this->type
;
359 for (exec_node
*node
= this->components
.head
360 ; !node
->is_tail_sentinel()
361 ; node
= node
->next
) {
362 ir_constant
*const orig
= (ir_constant
*) node
;
364 c
->components
.push_tail(orig
->clone(mem_ctx
, NULL
));
370 case GLSL_TYPE_ARRAY
: {
371 ir_constant
*c
= new(mem_ctx
) ir_constant
;
373 c
->type
= this->type
;
374 c
->array_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
375 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
376 c
->array_elements
[i
] = this->array_elements
[i
]->clone(mem_ctx
, NULL
);
382 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
);