• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright © 2010 Intel Corporation
3  *
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:
10  *
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
13  * Software.
14  *
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.
22  */
23 
24 #include <string.h>
25 #include "main/compiler.h"
26 #include "ir.h"
27 #include "compiler/glsl_types.h"
28 #include "util/hash_table.h"
29 
30 ir_rvalue *
clone(void * mem_ctx,struct hash_table *) const31 ir_rvalue::clone(void *mem_ctx, struct hash_table *) const
32 {
33    /* The only possible instantiation is the generic error value. */
34    return error_value(mem_ctx);
35 }
36 
37 /**
38  * Duplicate an IR variable
39  */
40 ir_variable *
clone(void * mem_ctx,struct hash_table * ht) const41 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const
42 {
43    ir_variable *var = new(mem_ctx) ir_variable(this->type, this->name,
44 					       (ir_variable_mode) this->data.mode);
45 
46    var->data.max_array_access = this->data.max_array_access;
47    if (this->is_interface_instance()) {
48       var->u.max_ifc_array_access =
49          rzalloc_array(var, int, this->interface_type->length);
50       memcpy(var->u.max_ifc_array_access, this->u.max_ifc_array_access,
51              this->interface_type->length * sizeof(unsigned));
52    }
53 
54    memcpy(&var->data, &this->data, sizeof(var->data));
55 
56    if (this->get_state_slots()) {
57       ir_state_slot *s = var->allocate_state_slots(this->get_num_state_slots());
58       memcpy(s, this->get_state_slots(),
59              sizeof(s[0]) * var->get_num_state_slots());
60    }
61 
62    if (this->constant_value)
63       var->constant_value = this->constant_value->clone(mem_ctx, ht);
64 
65    if (this->constant_initializer)
66       var->constant_initializer =
67 	 this->constant_initializer->clone(mem_ctx, ht);
68 
69    var->interface_type = this->interface_type;
70 
71    if (ht)
72       _mesa_hash_table_insert(ht, (void *)const_cast<ir_variable *>(this), var);
73 
74    return var;
75 }
76 
77 ir_swizzle *
clone(void * mem_ctx,struct hash_table * ht) const78 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
79 {
80    return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
81 }
82 
83 ir_return *
clone(void * mem_ctx,struct hash_table * ht) const84 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
85 {
86    ir_rvalue *new_value = NULL;
87 
88    if (this->value)
89       new_value = this->value->clone(mem_ctx, ht);
90 
91    return new(mem_ctx) ir_return(new_value);
92 }
93 
94 ir_discard *
clone(void * mem_ctx,struct hash_table * ht) const95 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
96 {
97    ir_rvalue *new_condition = NULL;
98 
99    if (this->condition != NULL)
100       new_condition = this->condition->clone(mem_ctx, ht);
101 
102    return new(mem_ctx) ir_discard(new_condition);
103 }
104 
105 ir_loop_jump *
clone(void * mem_ctx,struct hash_table * ht) const106 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
107 {
108    (void)ht;
109 
110    return new(mem_ctx) ir_loop_jump(this->mode);
111 }
112 
113 ir_if *
clone(void * mem_ctx,struct hash_table * ht) const114 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
115 {
116    ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
117 
118    foreach_in_list(ir_instruction, ir, &this->then_instructions) {
119       new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
120    }
121 
122    foreach_in_list(ir_instruction, ir, &this->else_instructions) {
123       new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
124    }
125 
126    return new_if;
127 }
128 
129 ir_loop *
clone(void * mem_ctx,struct hash_table * ht) const130 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
131 {
132    ir_loop *new_loop = new(mem_ctx) ir_loop();
133 
134    foreach_in_list(ir_instruction, ir, &this->body_instructions) {
135       new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
136    }
137 
138    return new_loop;
139 }
140 
141 ir_call *
clone(void * mem_ctx,struct hash_table * ht) const142 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
143 {
144    ir_dereference_variable *new_return_ref = NULL;
145    if (this->return_deref != NULL)
146       new_return_ref = this->return_deref->clone(mem_ctx, ht);
147 
148    exec_list new_parameters;
149 
150    foreach_in_list(ir_instruction, ir, &this->actual_parameters) {
151       new_parameters.push_tail(ir->clone(mem_ctx, ht));
152    }
153 
154    return new(mem_ctx) ir_call(this->callee, new_return_ref, &new_parameters);
155 }
156 
157 ir_expression *
clone(void * mem_ctx,struct hash_table * ht) const158 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
159 {
160    ir_rvalue *op[ARRAY_SIZE(this->operands)] = { NULL, };
161    unsigned int i;
162 
163    for (i = 0; i < get_num_operands(); i++) {
164       op[i] = this->operands[i]->clone(mem_ctx, ht);
165    }
166 
167    return new(mem_ctx) ir_expression(this->operation, this->type,
168 				     op[0], op[1], op[2], op[3]);
169 }
170 
171 ir_dereference_variable *
clone(void * mem_ctx,struct hash_table * ht) const172 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
173 {
174    ir_variable *new_var;
175 
176    if (ht) {
177       hash_entry *entry = _mesa_hash_table_search(ht, this->var);
178       new_var = entry ? (ir_variable *) entry->data : this->var;
179    } else {
180       new_var = this->var;
181    }
182 
183    return new(mem_ctx) ir_dereference_variable(new_var);
184 }
185 
186 ir_dereference_array *
clone(void * mem_ctx,struct hash_table * ht) const187 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
188 {
189    return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
190 					    this->array_index->clone(mem_ctx,
191 								     ht));
192 }
193 
194 ir_dereference_record *
clone(void * mem_ctx,struct hash_table * ht) const195 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
196 {
197    return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
198 					     this->field);
199 }
200 
201 ir_texture *
clone(void * mem_ctx,struct hash_table * ht) const202 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
203 {
204    ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
205    new_tex->type = this->type;
206 
207    new_tex->sampler = this->sampler->clone(mem_ctx, ht);
208    if (this->coordinate)
209       new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
210    if (this->projector)
211       new_tex->projector = this->projector->clone(mem_ctx, ht);
212    if (this->shadow_comparator) {
213       new_tex->shadow_comparator = this->shadow_comparator->clone(mem_ctx, ht);
214    }
215 
216    if (this->offset != NULL)
217       new_tex->offset = this->offset->clone(mem_ctx, ht);
218 
219    switch (this->op) {
220    case ir_tex:
221    case ir_lod:
222    case ir_query_levels:
223    case ir_texture_samples:
224    case ir_samples_identical:
225       break;
226    case ir_txb:
227       new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
228       break;
229    case ir_txl:
230    case ir_txf:
231    case ir_txs:
232       new_tex->lod_info.lod = this->lod_info.lod->clone(mem_ctx, ht);
233       break;
234    case ir_txf_ms:
235       new_tex->lod_info.sample_index = this->lod_info.sample_index->clone(mem_ctx, ht);
236       break;
237    case ir_txd:
238       new_tex->lod_info.grad.dPdx = this->lod_info.grad.dPdx->clone(mem_ctx, ht);
239       new_tex->lod_info.grad.dPdy = this->lod_info.grad.dPdy->clone(mem_ctx, ht);
240       break;
241    case ir_tg4:
242       new_tex->lod_info.component = this->lod_info.component->clone(mem_ctx, ht);
243       break;
244    }
245 
246    return new_tex;
247 }
248 
249 ir_assignment *
clone(void * mem_ctx,struct hash_table * ht) const250 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
251 {
252    ir_rvalue *new_condition = NULL;
253 
254    if (this->condition)
255       new_condition = this->condition->clone(mem_ctx, ht);
256 
257    ir_assignment *cloned =
258       new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
259                                  this->rhs->clone(mem_ctx, ht),
260                                  new_condition);
261    cloned->write_mask = this->write_mask;
262    return cloned;
263 }
264 
265 ir_function *
clone(void * mem_ctx,struct hash_table * ht) const266 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
267 {
268    ir_function *copy = new(mem_ctx) ir_function(this->name);
269 
270    copy->is_subroutine = this->is_subroutine;
271    copy->subroutine_index = this->subroutine_index;
272    copy->num_subroutine_types = this->num_subroutine_types;
273    copy->subroutine_types = ralloc_array(mem_ctx, const struct glsl_type *, copy->num_subroutine_types);
274    for (int i = 0; i < copy->num_subroutine_types; i++)
275      copy->subroutine_types[i] = this->subroutine_types[i];
276 
277    foreach_in_list(const ir_function_signature, sig, &this->signatures) {
278       ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
279       copy->add_signature(sig_copy);
280 
281       if (ht != NULL) {
282          _mesa_hash_table_insert(ht,
283                (void *)const_cast<ir_function_signature *>(sig), sig_copy);
284       }
285    }
286 
287    return copy;
288 }
289 
290 ir_function_signature *
clone(void * mem_ctx,struct hash_table * ht) const291 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
292 {
293    ir_function_signature *copy = this->clone_prototype(mem_ctx, ht);
294 
295    copy->is_defined = this->is_defined;
296 
297    /* Clone the instruction list.
298     */
299    foreach_in_list(const ir_instruction, inst, &this->body) {
300       ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
301       copy->body.push_tail(inst_copy);
302    }
303 
304    return copy;
305 }
306 
307 ir_function_signature *
clone_prototype(void * mem_ctx,struct hash_table * ht) const308 ir_function_signature::clone_prototype(void *mem_ctx, struct hash_table *ht) const
309 {
310    ir_function_signature *copy =
311       new(mem_ctx) ir_function_signature(this->return_type);
312 
313    copy->is_defined = false;
314    copy->builtin_avail = this->builtin_avail;
315    copy->origin = this;
316 
317    /* Clone the parameter list, but NOT the body.
318     */
319    foreach_in_list(const ir_variable, param, &this->parameters) {
320       assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
321 
322       ir_variable *const param_copy = param->clone(mem_ctx, ht);
323       copy->parameters.push_tail(param_copy);
324    }
325 
326    return copy;
327 }
328 
329 ir_constant *
clone(void * mem_ctx,struct hash_table * ht) const330 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
331 {
332    (void)ht;
333 
334    switch (this->type->base_type) {
335    case GLSL_TYPE_UINT:
336    case GLSL_TYPE_INT:
337    case GLSL_TYPE_FLOAT:
338    case GLSL_TYPE_DOUBLE:
339    case GLSL_TYPE_BOOL:
340       return new(mem_ctx) ir_constant(this->type, &this->value);
341 
342    case GLSL_TYPE_STRUCT: {
343       ir_constant *c = new(mem_ctx) ir_constant;
344 
345       c->type = this->type;
346       for (const exec_node *node = this->components.get_head_raw()
347 	      ; !node->is_tail_sentinel()
348 	      ; node = node->next) {
349 	 ir_constant *const orig = (ir_constant *) node;
350 
351 	 c->components.push_tail(orig->clone(mem_ctx, NULL));
352       }
353 
354       return c;
355    }
356 
357    case GLSL_TYPE_ARRAY: {
358       ir_constant *c = new(mem_ctx) ir_constant;
359 
360       c->type = this->type;
361       c->array_elements = ralloc_array(c, ir_constant *, this->type->length);
362       for (unsigned i = 0; i < this->type->length; i++) {
363 	 c->array_elements[i] = this->array_elements[i]->clone(mem_ctx, NULL);
364       }
365       return c;
366    }
367 
368    case GLSL_TYPE_SAMPLER:
369    case GLSL_TYPE_IMAGE:
370    case GLSL_TYPE_ATOMIC_UINT:
371    case GLSL_TYPE_VOID:
372    case GLSL_TYPE_ERROR:
373    case GLSL_TYPE_SUBROUTINE:
374    case GLSL_TYPE_INTERFACE:
375    case GLSL_TYPE_FUNCTION:
376       assert(!"Should not get here.");
377       break;
378    }
379 
380    return NULL;
381 }
382 
383 
384 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
385 public:
fixup_ir_call_visitor(struct hash_table * ht)386    fixup_ir_call_visitor(struct hash_table *ht)
387    {
388       this->ht = ht;
389    }
390 
visit_enter(ir_call * ir)391    virtual ir_visitor_status visit_enter(ir_call *ir)
392    {
393       /* Try to find the function signature referenced by the ir_call in the
394        * table.  If it is found, replace it with the value from the table.
395        */
396       ir_function_signature *sig;
397       hash_entry *entry = _mesa_hash_table_search(this->ht, ir->callee);
398 
399       if (entry != NULL) {
400          sig = (ir_function_signature *) entry->data;
401          ir->callee = sig;
402       }
403 
404       /* Since this may be used before function call parameters are flattened,
405        * the children also need to be processed.
406        */
407       return visit_continue;
408    }
409 
410 private:
411    struct hash_table *ht;
412 };
413 
414 
415 static void
fixup_function_calls(struct hash_table * ht,exec_list * instructions)416 fixup_function_calls(struct hash_table *ht, exec_list *instructions)
417 {
418    fixup_ir_call_visitor v(ht);
419    v.run(instructions);
420 }
421 
422 
423 void
clone_ir_list(void * mem_ctx,exec_list * out,const exec_list * in)424 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
425 {
426    struct hash_table *ht =
427          _mesa_hash_table_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
428 
429    foreach_in_list(const ir_instruction, original, in) {
430       ir_instruction *copy = original->clone(mem_ctx, ht);
431 
432       out->push_tail(copy);
433    }
434 
435    /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
436     * cloned ir_function_signature nodes.  This cannot be done automatically
437     * during cloning because the ir_call might be a forward reference (i.e.,
438     * the function signature that it references may not have been cloned yet).
439     */
440    fixup_function_calls(ht, out);
441 
442    _mesa_hash_table_destroy(ht, NULL);
443 }
444