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->warn_extension = this->warn_extension;
54 var->origin_upper_left = this->origin_upper_left;
55 var->pixel_center_integer = this->pixel_center_integer;
56 var->explicit_location = this->explicit_location;
57 var->explicit_index = this->explicit_index;
58 var->has_initializer = this->has_initializer;
59 var->depth_layout = this->depth_layout;
61 var->num_state_slots = this->num_state_slots;
62 if (this->state_slots) {
63 /* FINISHME: This really wants to use something like talloc_reference, but
64 * FINISHME: ralloc doesn't have any similar function.
66 var->state_slots = ralloc_array(var, ir_state_slot,
67 this->num_state_slots);
68 memcpy(var->state_slots, this->state_slots,
69 sizeof(this->state_slots[0]) * var->num_state_slots);
72 if (this->constant_value)
73 var->constant_value = this->constant_value->clone(mem_ctx, ht);
75 if (this->constant_initializer)
76 var->constant_initializer =
77 this->constant_initializer->clone(mem_ctx, ht);
79 var->interface_type = this->interface_type;
82 hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
89 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
91 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
95 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
97 ir_rvalue *new_value = NULL;
100 new_value = this->value->clone(mem_ctx, ht);
102 return new(mem_ctx) ir_return(new_value);
106 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
108 ir_rvalue *new_condition = NULL;
110 if (this->condition != NULL)
111 new_condition = this->condition->clone(mem_ctx, ht);
113 return new(mem_ctx) ir_discard(new_condition);
117 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
121 return new(mem_ctx) ir_loop_jump(this->mode);
125 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
127 ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
129 foreach_iter(exec_list_iterator, iter, this->then_instructions) {
130 ir_instruction *ir = (ir_instruction *)iter.get();
131 new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
134 foreach_iter(exec_list_iterator, iter, this->else_instructions) {
135 ir_instruction *ir = (ir_instruction *)iter.get();
136 new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
143 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
145 ir_loop *new_loop = new(mem_ctx) ir_loop();
148 new_loop->from = this->from->clone(mem_ctx, ht);
150 new_loop->to = this->to->clone(mem_ctx, ht);
152 new_loop->increment = this->increment->clone(mem_ctx, ht);
153 new_loop->counter = counter;
155 foreach_iter(exec_list_iterator, iter, this->body_instructions) {
156 ir_instruction *ir = (ir_instruction *)iter.get();
157 new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
160 new_loop->cmp = this->cmp;
165 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
167 ir_dereference_variable *new_return_ref = NULL;
168 if (this->return_deref != NULL)
169 new_return_ref = this->return_deref->clone(mem_ctx, ht);
171 exec_list new_parameters;
173 foreach_iter(exec_list_iterator, iter, this->actual_parameters) {
174 ir_instruction *ir = (ir_instruction *)iter.get();
175 new_parameters.push_tail(ir->clone(mem_ctx, ht));
178 return new(mem_ctx) ir_call(this->callee, new_return_ref, &new_parameters);
182 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
184 ir_rvalue *op[Elements(this->operands)] = { NULL, };
187 for (i = 0; i < get_num_operands(); i++) {
188 op[i] = this->operands[i]->clone(mem_ctx, ht);
191 return new(mem_ctx) ir_expression(this->operation, this->type,
192 op[0], op[1], op[2], op[3]);
195 ir_dereference_variable *
196 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
198 ir_variable *new_var;
201 new_var = (ir_variable *)hash_table_find(ht, this->var);
208 return new(mem_ctx) ir_dereference_variable(new_var);
211 ir_dereference_array *
212 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
214 return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
215 this->array_index->clone(mem_ctx,
219 ir_dereference_record *
220 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
222 return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
227 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
229 ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
230 new_tex->type = this->type;
232 new_tex->sampler = this->sampler->clone(mem_ctx, ht);
233 if (this->coordinate)
234 new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
236 new_tex->projector = this->projector->clone(mem_ctx, ht);
237 if (this->shadow_comparitor) {
238 new_tex->shadow_comparitor = this->shadow_comparitor->clone(mem_ctx, ht);
241 if (this->offset != NULL)
242 new_tex->offset = this->offset->clone(mem_ctx, ht);
249 new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
254 new_tex->lod_info.lod = this->lod_info.lod->clone(mem_ctx, ht);
257 new_tex->lod_info.sample_index = this->lod_info.sample_index->clone(mem_ctx, ht);
260 new_tex->lod_info.grad.dPdx = this->lod_info.grad.dPdx->clone(mem_ctx, ht);
261 new_tex->lod_info.grad.dPdy = this->lod_info.grad.dPdy->clone(mem_ctx, ht);
269 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
271 ir_rvalue *new_condition = NULL;
274 new_condition = this->condition->clone(mem_ctx, ht);
276 return new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
277 this->rhs->clone(mem_ctx, ht),
283 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
285 ir_function *copy = new(mem_ctx) ir_function(this->name);
287 foreach_list_const(node, &this->signatures) {
288 const ir_function_signature *const sig =
289 (const ir_function_signature *const) node;
291 ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
292 copy->add_signature(sig_copy);
295 hash_table_insert(ht, sig_copy,
296 (void *)const_cast<ir_function_signature *>(sig));
302 ir_function_signature *
303 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
305 ir_function_signature *copy = this->clone_prototype(mem_ctx, ht);
307 copy->is_defined = this->is_defined;
309 /* Clone the instruction list.
311 foreach_list_const(node, &this->body) {
312 const ir_instruction *const inst = (const ir_instruction *) node;
314 ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
315 copy->body.push_tail(inst_copy);
321 ir_function_signature *
322 ir_function_signature::clone_prototype(void *mem_ctx, struct hash_table *ht) const
324 ir_function_signature *copy =
325 new(mem_ctx) ir_function_signature(this->return_type);
327 copy->is_defined = false;
328 copy->is_builtin = this->is_builtin;
331 /* Clone the parameter list, but NOT the body.
333 foreach_list_const(node, &this->parameters) {
334 const ir_variable *const param = (const ir_variable *) node;
336 assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
338 ir_variable *const param_copy = param->clone(mem_ctx, ht);
339 copy->parameters.push_tail(param_copy);
346 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
350 switch (this->type->base_type) {
353 case GLSL_TYPE_FLOAT:
355 return new(mem_ctx) ir_constant(this->type, &this->value);
357 case GLSL_TYPE_STRUCT: {
358 ir_constant *c = new(mem_ctx) ir_constant;
360 c->type = this->type;
361 for (exec_node *node = this->components.head
362 ; !node->is_tail_sentinel()
363 ; node = node->next) {
364 ir_constant *const orig = (ir_constant *) node;
366 c->components.push_tail(orig->clone(mem_ctx, NULL));
372 case GLSL_TYPE_ARRAY: {
373 ir_constant *c = new(mem_ctx) ir_constant;
375 c->type = this->type;
376 c->array_elements = ralloc_array(c, ir_constant *, this->type->length);
377 for (unsigned i = 0; i < this->type->length; i++) {
378 c->array_elements[i] = this->array_elements[i]->clone(mem_ctx, NULL);
383 case GLSL_TYPE_SAMPLER:
385 case GLSL_TYPE_ERROR:
386 case GLSL_TYPE_INTERFACE:
387 assert(!"Should not get here.");
395 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
397 fixup_ir_call_visitor(struct hash_table *ht)
402 virtual ir_visitor_status visit_enter(ir_call *ir)
404 /* Try to find the function signature referenced by the ir_call in the
405 * table. If it is found, replace it with the value from the table.
407 ir_function_signature *sig =
408 (ir_function_signature *) hash_table_find(this->ht, ir->callee);
412 /* Since this may be used before function call parameters are flattened,
413 * the children also need to be processed.
415 return visit_continue;
419 struct hash_table *ht;
424 fixup_function_calls(struct hash_table *ht, exec_list *instructions)
426 fixup_ir_call_visitor v(ht);
432 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
434 struct hash_table *ht =
435 hash_table_ctor(0, hash_table_pointer_hash, hash_table_pointer_compare);
437 foreach_list_const(node, in) {
438 const ir_instruction *const original = (ir_instruction *) node;
439 ir_instruction *copy = original->clone(mem_ctx, ht);
441 out->push_tail(copy);
444 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
445 * cloned ir_function_signature nodes. This cannot be done automatically
446 * during cloning because the ir_call might be a forward reference (i.e.,
447 * the function signature that it references may not have been cloned yet).
449 fixup_function_calls(ht, out);