revert between 56095 -> 55830 in arch
[AROS.git] / workbench / libs / mesa / src / glsl / ir_clone.cpp
blob069bb85e8ded0978e477359e612bd45fd60a8a23
1 /*
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
13 * Software.
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.
24 #include <string.h>
25 #include "main/compiler.h"
26 #include "ir.h"
27 #include "glsl_types.h"
28 extern "C" {
29 #include "program/hash_table.h"
32 /**
33 * Duplicate an IR variable
35 * \note
36 * This will probably be made \c virtual and moved to the base class
37 * eventually.
39 ir_variable *
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->array_lvalue = this->array_lvalue;
51 var->location = this->location;
52 var->warn_extension = this->warn_extension;
53 var->origin_upper_left = this->origin_upper_left;
54 var->pixel_center_integer = this->pixel_center_integer;
55 var->explicit_location = this->explicit_location;
57 var->num_state_slots = this->num_state_slots;
58 if (this->state_slots) {
59 /* FINISHME: This really wants to use something like talloc_reference, but
60 * FINISHME: ralloc doesn't have any similar function.
62 var->state_slots = ralloc_array(var, ir_state_slot,
63 this->num_state_slots);
64 memcpy(var->state_slots, this->state_slots,
65 sizeof(this->state_slots[0]) * var->num_state_slots);
68 if (this->explicit_location)
69 var->location = this->location;
71 if (this->constant_value)
72 var->constant_value = this->constant_value->clone(mem_ctx, ht);
74 if (ht) {
75 hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
78 return var;
81 ir_swizzle *
82 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
84 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
87 ir_return *
88 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
90 ir_rvalue *new_value = NULL;
92 if (this->value)
93 new_value = this->value->clone(mem_ctx, ht);
95 return new(mem_ctx) ir_return(new_value);
98 ir_discard *
99 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
101 ir_rvalue *new_condition = NULL;
103 if (this->condition != NULL)
104 new_condition = this->condition->clone(mem_ctx, ht);
106 return new(mem_ctx) ir_discard(new_condition);
109 ir_loop_jump *
110 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
112 (void)ht;
114 return new(mem_ctx) ir_loop_jump(this->mode);
117 ir_if *
118 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
120 ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
122 foreach_iter(exec_list_iterator, iter, this->then_instructions) {
123 ir_instruction *ir = (ir_instruction *)iter.get();
124 new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
127 foreach_iter(exec_list_iterator, iter, this->else_instructions) {
128 ir_instruction *ir = (ir_instruction *)iter.get();
129 new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
132 return new_if;
135 ir_loop *
136 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
138 ir_loop *new_loop = new(mem_ctx) ir_loop();
140 if (this->from)
141 new_loop->from = this->from->clone(mem_ctx, ht);
142 if (this->to)
143 new_loop->to = this->to->clone(mem_ctx, ht);
144 if (this->increment)
145 new_loop->increment = this->increment->clone(mem_ctx, ht);
146 new_loop->counter = counter;
148 foreach_iter(exec_list_iterator, iter, this->body_instructions) {
149 ir_instruction *ir = (ir_instruction *)iter.get();
150 new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
153 new_loop->cmp = this->cmp;
154 return new_loop;
157 ir_call *
158 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
160 if (this->type == glsl_type::error_type)
161 return ir_call::get_error_instruction(mem_ctx);
163 exec_list new_parameters;
165 foreach_iter(exec_list_iterator, iter, this->actual_parameters) {
166 ir_instruction *ir = (ir_instruction *)iter.get();
167 new_parameters.push_tail(ir->clone(mem_ctx, ht));
170 return new(mem_ctx) ir_call(this->callee, &new_parameters);
173 ir_expression *
174 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
176 ir_rvalue *op[Elements(this->operands)] = { NULL, };
177 unsigned int i;
179 for (i = 0; i < get_num_operands(); i++) {
180 op[i] = this->operands[i]->clone(mem_ctx, ht);
183 return new(mem_ctx) ir_expression(this->operation, this->type,
184 op[0], op[1], op[2], op[3]);
187 ir_dereference_variable *
188 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
190 ir_variable *new_var;
192 if (ht) {
193 new_var = (ir_variable *)hash_table_find(ht, this->var);
194 if (!new_var)
195 new_var = this->var;
196 } else {
197 new_var = this->var;
200 return new(mem_ctx) ir_dereference_variable(new_var);
203 ir_dereference_array *
204 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
206 return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
207 this->array_index->clone(mem_ctx,
208 ht));
211 ir_dereference_record *
212 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
214 return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
215 this->field);
218 ir_texture *
219 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
221 ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
222 new_tex->type = this->type;
224 new_tex->sampler = this->sampler->clone(mem_ctx, ht);
225 new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
226 if (this->projector)
227 new_tex->projector = this->projector->clone(mem_ctx, ht);
228 if (this->shadow_comparitor) {
229 new_tex->shadow_comparitor = this->shadow_comparitor->clone(mem_ctx, ht);
232 if (this->offset != NULL)
233 new_tex->offset = this->offset->clone(mem_ctx, ht);
235 switch (this->op) {
236 case ir_tex:
237 break;
238 case ir_txb:
239 new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
240 break;
241 case ir_txl:
242 case ir_txf:
243 new_tex->lod_info.lod = this->lod_info.lod->clone(mem_ctx, ht);
244 break;
245 case ir_txd:
246 new_tex->lod_info.grad.dPdx = this->lod_info.grad.dPdx->clone(mem_ctx, ht);
247 new_tex->lod_info.grad.dPdy = this->lod_info.grad.dPdy->clone(mem_ctx, ht);
248 break;
251 return new_tex;
254 ir_assignment *
255 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
257 ir_rvalue *new_condition = NULL;
259 if (this->condition)
260 new_condition = this->condition->clone(mem_ctx, ht);
262 return new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
263 this->rhs->clone(mem_ctx, ht),
264 new_condition,
265 this->write_mask);
268 ir_function *
269 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
271 ir_function *copy = new(mem_ctx) ir_function(this->name);
273 foreach_list_const(node, &this->signatures) {
274 const ir_function_signature *const sig =
275 (const ir_function_signature *const) node;
277 ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
278 copy->add_signature(sig_copy);
280 if (ht != NULL)
281 hash_table_insert(ht, sig_copy,
282 (void *)const_cast<ir_function_signature *>(sig));
285 return copy;
288 ir_function_signature *
289 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
291 ir_function_signature *copy = this->clone_prototype(mem_ctx, ht);
293 copy->is_defined = this->is_defined;
295 /* Clone the instruction list.
297 foreach_list_const(node, &this->body) {
298 const ir_instruction *const inst = (const ir_instruction *) node;
300 ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
301 copy->body.push_tail(inst_copy);
304 return copy;
307 ir_function_signature *
308 ir_function_signature::clone_prototype(void *mem_ctx, struct hash_table *ht) const
310 ir_function_signature *copy =
311 new(mem_ctx) ir_function_signature(this->return_type);
313 copy->is_defined = false;
314 copy->is_builtin = this->is_builtin;
316 /* Clone the parameter list, but NOT the body.
318 foreach_list_const(node, &this->parameters) {
319 const ir_variable *const param = (const ir_variable *) node;
321 assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
323 ir_variable *const param_copy = param->clone(mem_ctx, ht);
324 copy->parameters.push_tail(param_copy);
327 return copy;
330 ir_constant *
331 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
333 (void)ht;
335 switch (this->type->base_type) {
336 case GLSL_TYPE_UINT:
337 case GLSL_TYPE_INT:
338 case GLSL_TYPE_FLOAT:
339 case GLSL_TYPE_BOOL:
340 return new(mem_ctx) ir_constant(this->type, &this->value);
342 case GLSL_TYPE_STRUCT: {
343 ir_constant *c = new(mem_ctx) ir_constant;
345 c->type = this->type;
346 for (exec_node *node = this->components.head
347 ; !node->is_tail_sentinel()
348 ; node = node->next) {
349 ir_constant *const orig = (ir_constant *) node;
351 c->components.push_tail(orig->clone(mem_ctx, NULL));
354 return c;
357 case GLSL_TYPE_ARRAY: {
358 ir_constant *c = new(mem_ctx) ir_constant;
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);
365 return c;
368 default:
369 assert(!"Should not get here.");
370 return NULL;
375 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
376 public:
377 fixup_ir_call_visitor(struct hash_table *ht)
379 this->ht = ht;
382 virtual ir_visitor_status visit_enter(ir_call *ir)
384 /* Try to find the function signature referenced by the ir_call in the
385 * table. If it is found, replace it with the value from the table.
387 ir_function_signature *sig =
388 (ir_function_signature *) hash_table_find(this->ht, ir->get_callee());
389 if (sig != NULL)
390 ir->set_callee(sig);
392 /* Since this may be used before function call parameters are flattened,
393 * the children also need to be processed.
395 return visit_continue;
398 private:
399 struct hash_table *ht;
403 static void
404 fixup_function_calls(struct hash_table *ht, exec_list *instructions)
406 fixup_ir_call_visitor v(ht);
407 v.run(instructions);
411 void
412 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
414 struct hash_table *ht =
415 hash_table_ctor(0, hash_table_pointer_hash, hash_table_pointer_compare);
417 foreach_list_const(node, in) {
418 const ir_instruction *const original = (ir_instruction *) node;
419 ir_instruction *copy = original->clone(mem_ctx, ht);
421 out->push_tail(copy);
424 /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
425 * cloned ir_function_signature nodes. This cannot be done automatically
426 * during cloning because the ir_call might be a forward reference (i.e.,
427 * the function signature that it references may not have been cloned yet).
429 fixup_function_calls(ht, out);
431 hash_table_dtor(ht);