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"
29 #include "program/hash_table.h"
33 * Duplicate an IR variable
36 * This will probably be made \c virtual and moved to the base class
40 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const
42 ir_variable *var = new(mem_ctx) ir_variable(this->type, this->name,
43 (ir_variable_mode) this->mode);
45 var->max_array_access = this->max_array_access;
46 var->read_only = this->read_only;
47 var->centroid = this->centroid;
48 var->invariant = this->invariant;
49 var->interpolation = this->interpolation;
50 var->location = this->location;
51 var->warn_extension = this->warn_extension;
52 var->origin_upper_left = this->origin_upper_left;
53 var->pixel_center_integer = this->pixel_center_integer;
54 var->explicit_location = this->explicit_location;
56 var->num_state_slots = this->num_state_slots;
57 if (this->state_slots) {
58 /* FINISHME: This really wants to use something like talloc_reference, but
59 * FINISHME: ralloc doesn't have any similar function.
61 var->state_slots = ralloc_array(var, ir_state_slot,
62 this->num_state_slots);
63 memcpy(var->state_slots, this->state_slots,
64 sizeof(this->state_slots[0]) * var->num_state_slots);
67 if (this->explicit_location)
68 var->location = this->location;
70 if (this->constant_value)
71 var->constant_value = this->constant_value->clone(mem_ctx, ht);
74 hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
81 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
83 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
87 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
89 ir_rvalue *new_value = NULL;
92 new_value = this->value->clone(mem_ctx, ht);
94 return new(mem_ctx) ir_return(new_value);
98 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
100 ir_rvalue *new_condition = NULL;
102 if (this->condition != NULL)
103 new_condition = this->condition->clone(mem_ctx, ht);
105 return new(mem_ctx) ir_discard(new_condition);
109 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
113 return new(mem_ctx) ir_loop_jump(this->mode);
117 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
119 ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
121 foreach_iter(exec_list_iterator, iter, this->then_instructions) {
122 ir_instruction *ir = (ir_instruction *)iter.get();
123 new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
126 foreach_iter(exec_list_iterator, iter, this->else_instructions) {
127 ir_instruction *ir = (ir_instruction *)iter.get();
128 new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
135 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
137 ir_loop *new_loop = new(mem_ctx) ir_loop();
140 new_loop->from = this->from->clone(mem_ctx, ht);
142 new_loop->to = this->to->clone(mem_ctx, ht);
144 new_loop->increment = this->increment->clone(mem_ctx, ht);
145 new_loop->counter = counter;
147 foreach_iter(exec_list_iterator, iter, this->body_instructions) {
148 ir_instruction *ir = (ir_instruction *)iter.get();
149 new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
152 new_loop->cmp = this->cmp;
157 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
159 if (this->type == glsl_type::error_type)
160 return ir_call::get_error_instruction(mem_ctx);
162 exec_list new_parameters;
164 foreach_iter(exec_list_iterator, iter, this->actual_parameters) {
165 ir_instruction *ir = (ir_instruction *)iter.get();
166 new_parameters.push_tail(ir->clone(mem_ctx, ht));
169 return new(mem_ctx) ir_call(this->callee, &new_parameters);
173 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
175 ir_rvalue *op[Elements(this->operands)] = { NULL, };
178 for (i = 0; i < get_num_operands(); i++) {
179 op[i] = this->operands[i]->clone(mem_ctx, ht);
182 return new(mem_ctx) ir_expression(this->operation, this->type,
183 op[0], op[1], op[2], op[3]);
186 ir_dereference_variable *
187 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
189 ir_variable *new_var;
192 new_var = (ir_variable *)hash_table_find(ht, this->var);
199 return new(mem_ctx) ir_dereference_variable(new_var);
202 ir_dereference_array *
203 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
205 return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
206 this->array_index->clone(mem_ctx,
210 ir_dereference_record *
211 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
213 return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
218 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
220 ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
221 new_tex->type = this->type;
223 new_tex->sampler = this->sampler->clone(mem_ctx, ht);
224 new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
226 new_tex->projector = this->projector->clone(mem_ctx, ht);
227 if (this->shadow_comparitor) {
228 new_tex->shadow_comparitor = this->shadow_comparitor->clone(mem_ctx, ht);
231 if (this->offset != NULL)
232 new_tex->offset = this->offset->clone(mem_ctx, ht);
238 new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
242 new_tex->lod_info.lod = this->lod_info.lod->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);
254 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
256 ir_rvalue *new_condition = NULL;
259 new_condition = this->condition->clone(mem_ctx, ht);
261 return new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
262 this->rhs->clone(mem_ctx, ht),
268 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
270 ir_function *copy = new(mem_ctx) ir_function(this->name);
272 foreach_list_const(node, &this->signatures) {
273 const ir_function_signature *const sig =
274 (const ir_function_signature *const) node;
276 ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
277 copy->add_signature(sig_copy);
280 hash_table_insert(ht, sig_copy,
281 (void *)const_cast<ir_function_signature *>(sig));
287 ir_function_signature *
288 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
290 ir_function_signature *copy = this->clone_prototype(mem_ctx, ht);
292 copy->is_defined = this->is_defined;
294 /* Clone the instruction list.
296 foreach_list_const(node, &this->body) {
297 const ir_instruction *const inst = (const ir_instruction *) node;
299 ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
300 copy->body.push_tail(inst_copy);
306 ir_function_signature *
307 ir_function_signature::clone_prototype(void *mem_ctx, struct hash_table *ht) const
309 ir_function_signature *copy =
310 new(mem_ctx) ir_function_signature(this->return_type);
312 copy->is_defined = false;
313 copy->is_builtin = this->is_builtin;
315 /* Clone the parameter list, but NOT the body.
317 foreach_list_const(node, &this->parameters) {
318 const ir_variable *const param = (const ir_variable *) node;
320 assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
322 ir_variable *const param_copy = param->clone(mem_ctx, ht);
323 copy->parameters.push_tail(param_copy);
330 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
334 switch (this->type->base_type) {
337 case GLSL_TYPE_FLOAT:
339 return new(mem_ctx) ir_constant(this->type, &this->value);
341 case GLSL_TYPE_STRUCT: {
342 ir_constant *c = new(mem_ctx) ir_constant;
344 c->type = this->type;
345 for (exec_node *node = this->components.head
346 ; !node->is_tail_sentinel()
347 ; node = node->next) {
348 ir_constant *const orig = (ir_constant *) node;
350 c->components.push_tail(orig->clone(mem_ctx, NULL));
356 case GLSL_TYPE_ARRAY: {
357 ir_constant *c = new(mem_ctx) ir_constant;
359 c->type = this->type;
360 c->array_elements = ralloc_array(c, ir_constant *, this->type->length);
361 for (unsigned i = 0; i < this->type->length; i++) {
362 c->array_elements[i] = this->array_elements[i]->clone(mem_ctx, NULL);
368 assert(!"Should not get here.");
374 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
376 fixup_ir_call_visitor(struct hash_table *ht)
381 virtual ir_visitor_status visit_enter(ir_call *ir)
383 /* Try to find the function signature referenced by the ir_call in the
384 * table. If it is found, replace it with the value from the table.
386 ir_function_signature *sig =
387 (ir_function_signature *) hash_table_find(this->ht, ir->get_callee());
391 /* Since this may be used before function call parameters are flattened,
392 * the children also need to be processed.
394 return visit_continue;
398 struct hash_table *ht;
403 fixup_function_calls(struct hash_table *ht, exec_list *instructions)
405 fixup_ir_call_visitor v(ht);
411 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
413 struct hash_table *ht =
414 hash_table_ctor(0, hash_table_pointer_hash, hash_table_pointer_compare);
416 foreach_list_const(node, in) {
417 const ir_instruction *const original = (ir_instruction *) node;
418 ir_instruction *copy = original->clone(mem_ctx, ht);
420 out->push_tail(copy);
423 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
424 * cloned ir_function_signature nodes. This cannot be done automatically
425 * during cloning because the ir_call might be a forward reference (i.e.,
426 * the function signature that it references may not have been cloned yet).
428 fixup_function_calls(ht, out);