86a620552aa77fe598510f9fbbbcbfaf5aca9bde
[mesa.git] / src / glsl / ir_clone.cpp
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 "glsl_types.h"
28 #include "program/hash_table.h"
29
30 ir_rvalue *
31 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 *
41 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->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));
52 }
53
54 memcpy(&var->data, &this->data, sizeof(var->data));
55
56 var->warn_extension = this->warn_extension;
57
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.
62 */
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);
67 }
68
69 if (this->constant_value)
70 var->constant_value = this->constant_value->clone(mem_ctx, ht);
71
72 if (this->constant_initializer)
73 var->constant_initializer =
74 this->constant_initializer->clone(mem_ctx, ht);
75
76 var->interface_type = this->interface_type;
77
78 if (ht) {
79 hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
80 }
81
82 return var;
83 }
84
85 ir_swizzle *
86 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
87 {
88 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
89 }
90
91 ir_return *
92 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
93 {
94 ir_rvalue *new_value = NULL;
95
96 if (this->value)
97 new_value = this->value->clone(mem_ctx, ht);
98
99 return new(mem_ctx) ir_return(new_value);
100 }
101
102 ir_discard *
103 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
104 {
105 ir_rvalue *new_condition = NULL;
106
107 if (this->condition != NULL)
108 new_condition = this->condition->clone(mem_ctx, ht);
109
110 return new(mem_ctx) ir_discard(new_condition);
111 }
112
113 ir_loop_jump *
114 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
115 {
116 (void)ht;
117
118 return new(mem_ctx) ir_loop_jump(this->mode);
119 }
120
121 ir_if *
122 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
123 {
124 ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
125
126 foreach_in_list(ir_instruction, ir, &this->then_instructions) {
127 new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
128 }
129
130 foreach_in_list(ir_instruction, ir, &this->else_instructions) {
131 new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
132 }
133
134 return new_if;
135 }
136
137 ir_loop *
138 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
139 {
140 ir_loop *new_loop = new(mem_ctx) ir_loop();
141
142 foreach_in_list(ir_instruction, ir, &this->body_instructions) {
143 new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
144 }
145
146 return new_loop;
147 }
148
149 ir_call *
150 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
151 {
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);
155
156 exec_list new_parameters;
157
158 foreach_in_list(ir_instruction, ir, &this->actual_parameters) {
159 new_parameters.push_tail(ir->clone(mem_ctx, ht));
160 }
161
162 return new(mem_ctx) ir_call(this->callee, new_return_ref, &new_parameters);
163 }
164
165 ir_expression *
166 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
167 {
168 ir_rvalue *op[Elements(this->operands)] = { NULL, };
169 unsigned int i;
170
171 for (i = 0; i < get_num_operands(); i++) {
172 op[i] = this->operands[i]->clone(mem_ctx, ht);
173 }
174
175 return new(mem_ctx) ir_expression(this->operation, this->type,
176 op[0], op[1], op[2], op[3]);
177 }
178
179 ir_dereference_variable *
180 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
181 {
182 ir_variable *new_var;
183
184 if (ht) {
185 new_var = (ir_variable *)hash_table_find(ht, this->var);
186 if (!new_var)
187 new_var = this->var;
188 } else {
189 new_var = this->var;
190 }
191
192 return new(mem_ctx) ir_dereference_variable(new_var);
193 }
194
195 ir_dereference_array *
196 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
197 {
198 return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
199 this->array_index->clone(mem_ctx,
200 ht));
201 }
202
203 ir_dereference_record *
204 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
205 {
206 return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
207 this->field);
208 }
209
210 ir_texture *
211 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
212 {
213 ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
214 new_tex->type = this->type;
215
216 new_tex->sampler = this->sampler->clone(mem_ctx, ht);
217 if (this->coordinate)
218 new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
219 if (this->projector)
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);
223 }
224
225 if (this->offset != NULL)
226 new_tex->offset = this->offset->clone(mem_ctx, ht);
227
228 switch (this->op) {
229 case ir_tex:
230 case ir_lod:
231 case ir_query_levels:
232 break;
233 case ir_txb:
234 new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
235 break;
236 case ir_txl:
237 case ir_txf:
238 case ir_txs:
239 new_tex->lod_info.lod = this->lod_info.lod->clone(mem_ctx, ht);
240 break;
241 case ir_txf_ms:
242 new_tex->lod_info.sample_index = this->lod_info.sample_index->clone(mem_ctx, ht);
243 break;
244 case ir_txd:
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);
247 break;
248 case ir_tg4:
249 new_tex->lod_info.component = this->lod_info.component->clone(mem_ctx, ht);
250 break;
251 }
252
253 return new_tex;
254 }
255
256 ir_assignment *
257 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
258 {
259 ir_rvalue *new_condition = NULL;
260
261 if (this->condition)
262 new_condition = this->condition->clone(mem_ctx, ht);
263
264 ir_assignment *cloned =
265 new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
266 this->rhs->clone(mem_ctx, ht),
267 new_condition);
268 cloned->write_mask = this->write_mask;
269 return cloned;
270 }
271
272 ir_function *
273 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
274 {
275 ir_function *copy = new(mem_ctx) ir_function(this->name);
276
277 foreach_list_const(node, &this->signatures) {
278 const ir_function_signature *const sig =
279 (const ir_function_signature *const) node;
280
281 ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
282 copy->add_signature(sig_copy);
283
284 if (ht != NULL)
285 hash_table_insert(ht, sig_copy,
286 (void *)const_cast<ir_function_signature *>(sig));
287 }
288
289 return copy;
290 }
291
292 ir_function_signature *
293 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
294 {
295 ir_function_signature *copy = this->clone_prototype(mem_ctx, ht);
296
297 copy->is_defined = this->is_defined;
298
299 /* Clone the instruction list.
300 */
301 foreach_list_const(node, &this->body) {
302 const ir_instruction *const inst = (const ir_instruction *) node;
303
304 ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
305 copy->body.push_tail(inst_copy);
306 }
307
308 return copy;
309 }
310
311 ir_function_signature *
312 ir_function_signature::clone_prototype(void *mem_ctx, struct hash_table *ht) const
313 {
314 ir_function_signature *copy =
315 new(mem_ctx) ir_function_signature(this->return_type);
316
317 copy->is_defined = false;
318 copy->builtin_avail = this->builtin_avail;
319 copy->origin = this;
320
321 /* Clone the parameter list, but NOT the body.
322 */
323 foreach_list_const(node, &this->parameters) {
324 const ir_variable *const param = (const ir_variable *) node;
325
326 assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
327
328 ir_variable *const param_copy = param->clone(mem_ctx, ht);
329 copy->parameters.push_tail(param_copy);
330 }
331
332 return copy;
333 }
334
335 ir_constant *
336 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
337 {
338 (void)ht;
339
340 switch (this->type->base_type) {
341 case GLSL_TYPE_UINT:
342 case GLSL_TYPE_INT:
343 case GLSL_TYPE_FLOAT:
344 case GLSL_TYPE_BOOL:
345 return new(mem_ctx) ir_constant(this->type, &this->value);
346
347 case GLSL_TYPE_STRUCT: {
348 ir_constant *c = new(mem_ctx) ir_constant;
349
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;
355
356 c->components.push_tail(orig->clone(mem_ctx, NULL));
357 }
358
359 return c;
360 }
361
362 case GLSL_TYPE_ARRAY: {
363 ir_constant *c = new(mem_ctx) ir_constant;
364
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);
369 }
370 return c;
371 }
372
373 case GLSL_TYPE_SAMPLER:
374 case GLSL_TYPE_IMAGE:
375 case GLSL_TYPE_ATOMIC_UINT:
376 case GLSL_TYPE_VOID:
377 case GLSL_TYPE_ERROR:
378 case GLSL_TYPE_INTERFACE:
379 assert(!"Should not get here.");
380 break;
381 }
382
383 return NULL;
384 }
385
386
387 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
388 public:
389 fixup_ir_call_visitor(struct hash_table *ht)
390 {
391 this->ht = ht;
392 }
393
394 virtual ir_visitor_status visit_enter(ir_call *ir)
395 {
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.
398 */
399 ir_function_signature *sig =
400 (ir_function_signature *) hash_table_find(this->ht, ir->callee);
401 if (sig != NULL)
402 ir->callee = sig;
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
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
424 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
425 {
426 struct hash_table *ht =
427 hash_table_ctor(0, hash_table_pointer_hash, hash_table_pointer_compare);
428
429 foreach_list_const(node, in) {
430 const ir_instruction *const original = (ir_instruction *) node;
431 ir_instruction *copy = original->clone(mem_ctx, ht);
432
433 out->push_tail(copy);
434 }
435
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).
440 */
441 fixup_function_calls(ht, out);
442
443 hash_table_dtor(ht);
444 }