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 "util/compiler.h"
27 #include "compiler/glsl_types.h"
28 #include "util/hash_table.h"
31 ir_rvalue::clone(void *mem_ctx
, struct hash_table
*) 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->data
.mode
);
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));
54 memcpy(&var
->data
, &this->data
, sizeof(var
->data
));
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());
62 if (this->constant_value
)
63 var
->constant_value
= this->constant_value
->clone(mem_ctx
, ht
);
65 if (this->constant_initializer
)
66 var
->constant_initializer
=
67 this->constant_initializer
->clone(mem_ctx
, ht
);
69 var
->interface_type
= this->interface_type
;
72 _mesa_hash_table_insert(ht
, (void *)const_cast<ir_variable
*>(this), var
);
78 ir_swizzle::clone(void *mem_ctx
, struct hash_table
*ht
) const
80 return new(mem_ctx
) ir_swizzle(this->val
->clone(mem_ctx
, ht
), this->mask
);
84 ir_return::clone(void *mem_ctx
, struct hash_table
*ht
) const
86 ir_rvalue
*new_value
= NULL
;
89 new_value
= this->value
->clone(mem_ctx
, ht
);
91 return new(mem_ctx
) ir_return(new_value
);
95 ir_discard::clone(void *mem_ctx
, struct hash_table
*ht
) const
97 ir_rvalue
*new_condition
= NULL
;
99 if (this->condition
!= NULL
)
100 new_condition
= this->condition
->clone(mem_ctx
, ht
);
102 return new(mem_ctx
) ir_discard(new_condition
);
106 ir_demote::clone(void *mem_ctx
, struct hash_table
*ht
) const
108 return new(mem_ctx
) ir_demote();
112 ir_loop_jump::clone(void *mem_ctx
, struct hash_table
*ht
) const
116 return new(mem_ctx
) ir_loop_jump(this->mode
);
120 ir_if::clone(void *mem_ctx
, struct hash_table
*ht
) const
122 ir_if
*new_if
= new(mem_ctx
) ir_if(this->condition
->clone(mem_ctx
, ht
));
124 foreach_in_list(ir_instruction
, ir
, &this->then_instructions
) {
125 new_if
->then_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
128 foreach_in_list(ir_instruction
, ir
, &this->else_instructions
) {
129 new_if
->else_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
136 ir_loop::clone(void *mem_ctx
, struct hash_table
*ht
) const
138 ir_loop
*new_loop
= new(mem_ctx
) ir_loop();
140 foreach_in_list(ir_instruction
, ir
, &this->body_instructions
) {
141 new_loop
->body_instructions
.push_tail(ir
->clone(mem_ctx
, ht
));
148 ir_call::clone(void *mem_ctx
, struct hash_table
*ht
) const
150 ir_dereference_variable
*new_return_ref
= NULL
;
151 if (this->return_deref
!= NULL
)
152 new_return_ref
= this->return_deref
->clone(mem_ctx
, ht
);
154 exec_list new_parameters
;
156 foreach_in_list(ir_instruction
, ir
, &this->actual_parameters
) {
157 new_parameters
.push_tail(ir
->clone(mem_ctx
, ht
));
160 return new(mem_ctx
) ir_call(this->callee
, new_return_ref
, &new_parameters
);
164 ir_expression::clone(void *mem_ctx
, struct hash_table
*ht
) const
166 ir_rvalue
*op
[ARRAY_SIZE(this->operands
)] = { NULL
, };
169 for (i
= 0; i
< num_operands
; i
++) {
170 op
[i
] = this->operands
[i
]->clone(mem_ctx
, ht
);
173 return new(mem_ctx
) ir_expression(this->operation
, this->type
,
174 op
[0], op
[1], op
[2], op
[3]);
177 ir_dereference_variable
*
178 ir_dereference_variable::clone(void *mem_ctx
, struct hash_table
*ht
) const
180 ir_variable
*new_var
;
183 hash_entry
*entry
= _mesa_hash_table_search(ht
, this->var
);
184 new_var
= entry
? (ir_variable
*) entry
->data
: this->var
;
189 return new(mem_ctx
) ir_dereference_variable(new_var
);
192 ir_dereference_array
*
193 ir_dereference_array::clone(void *mem_ctx
, struct hash_table
*ht
) const
195 return new(mem_ctx
) ir_dereference_array(this->array
->clone(mem_ctx
, ht
),
196 this->array_index
->clone(mem_ctx
,
200 ir_dereference_record
*
201 ir_dereference_record::clone(void *mem_ctx
, struct hash_table
*ht
) const
203 assert(this->field_idx
>= 0);
204 const char *field_name
=
205 this->record
->type
->fields
.structure
[this->field_idx
].name
;
206 return new(mem_ctx
) ir_dereference_record(this->record
->clone(mem_ctx
, ht
),
211 ir_texture::clone(void *mem_ctx
, struct hash_table
*ht
) const
213 ir_texture
*new_tex
= new(mem_ctx
) ir_texture(this->op
);
214 new_tex
->type
= this->type
;
216 new_tex
->sampler
= this->sampler
->clone(mem_ctx
, ht
);
217 if (this->coordinate
)
218 new_tex
->coordinate
= this->coordinate
->clone(mem_ctx
, ht
);
220 new_tex
->projector
= this->projector
->clone(mem_ctx
, ht
);
221 if (this->shadow_comparator
) {
222 new_tex
->shadow_comparator
= this->shadow_comparator
->clone(mem_ctx
, ht
);
225 if (this->offset
!= NULL
)
226 new_tex
->offset
= this->offset
->clone(mem_ctx
, ht
);
231 case ir_query_levels
:
232 case ir_texture_samples
:
233 case ir_samples_identical
:
236 new_tex
->lod_info
.bias
= this->lod_info
.bias
->clone(mem_ctx
, ht
);
241 new_tex
->lod_info
.lod
= this->lod_info
.lod
->clone(mem_ctx
, ht
);
244 new_tex
->lod_info
.sample_index
= this->lod_info
.sample_index
->clone(mem_ctx
, ht
);
247 new_tex
->lod_info
.grad
.dPdx
= this->lod_info
.grad
.dPdx
->clone(mem_ctx
, ht
);
248 new_tex
->lod_info
.grad
.dPdy
= this->lod_info
.grad
.dPdy
->clone(mem_ctx
, ht
);
251 new_tex
->lod_info
.component
= this->lod_info
.component
->clone(mem_ctx
, ht
);
259 ir_assignment::clone(void *mem_ctx
, struct hash_table
*ht
) const
261 ir_rvalue
*new_condition
= NULL
;
264 new_condition
= this->condition
->clone(mem_ctx
, ht
);
266 ir_assignment
*cloned
=
267 new(mem_ctx
) ir_assignment(this->lhs
->clone(mem_ctx
, ht
),
268 this->rhs
->clone(mem_ctx
, ht
),
270 cloned
->write_mask
= this->write_mask
;
275 ir_function::clone(void *mem_ctx
, struct hash_table
*ht
) const
277 ir_function
*copy
= new(mem_ctx
) ir_function(this->name
);
279 copy
->is_subroutine
= this->is_subroutine
;
280 copy
->subroutine_index
= this->subroutine_index
;
281 copy
->num_subroutine_types
= this->num_subroutine_types
;
282 copy
->subroutine_types
= ralloc_array(mem_ctx
, const struct glsl_type
*, copy
->num_subroutine_types
);
283 for (int i
= 0; i
< copy
->num_subroutine_types
; i
++)
284 copy
->subroutine_types
[i
] = this->subroutine_types
[i
];
286 foreach_in_list(const ir_function_signature
, sig
, &this->signatures
) {
287 ir_function_signature
*sig_copy
= sig
->clone(mem_ctx
, ht
);
288 copy
->add_signature(sig_copy
);
291 _mesa_hash_table_insert(ht
,
292 (void *)const_cast<ir_function_signature
*>(sig
), sig_copy
);
299 ir_function_signature
*
300 ir_function_signature::clone(void *mem_ctx
, struct hash_table
*ht
) const
302 ir_function_signature
*copy
= this->clone_prototype(mem_ctx
, ht
);
304 copy
->is_defined
= this->is_defined
;
306 /* Clone the instruction list.
308 foreach_in_list(const ir_instruction
, inst
, &this->body
) {
309 ir_instruction
*const inst_copy
= inst
->clone(mem_ctx
, ht
);
310 copy
->body
.push_tail(inst_copy
);
316 ir_function_signature
*
317 ir_function_signature::clone_prototype(void *mem_ctx
, struct hash_table
*ht
) const
319 ir_function_signature
*copy
=
320 new(mem_ctx
) ir_function_signature(this->return_type
);
322 copy
->is_defined
= false;
323 copy
->builtin_avail
= this->builtin_avail
;
326 /* Clone the parameter list, but NOT the body.
328 foreach_in_list(const ir_variable
, param
, &this->parameters
) {
329 assert(const_cast<ir_variable
*>(param
)->as_variable() != NULL
);
331 ir_variable
*const param_copy
= param
->clone(mem_ctx
, ht
);
332 copy
->parameters
.push_tail(param_copy
);
339 ir_constant::clone(void *mem_ctx
, struct hash_table
*ht
) const
343 switch (this->type
->base_type
) {
346 case GLSL_TYPE_FLOAT
:
347 case GLSL_TYPE_FLOAT16
:
348 case GLSL_TYPE_DOUBLE
:
350 case GLSL_TYPE_UINT64
:
351 case GLSL_TYPE_INT64
:
352 case GLSL_TYPE_UINT16
:
353 case GLSL_TYPE_INT16
:
354 case GLSL_TYPE_UINT8
:
356 case GLSL_TYPE_SAMPLER
:
357 case GLSL_TYPE_IMAGE
:
358 return new(mem_ctx
) ir_constant(this->type
, &this->value
);
360 case GLSL_TYPE_STRUCT
:
361 case GLSL_TYPE_ARRAY
: {
362 ir_constant
*c
= new(mem_ctx
) ir_constant
;
364 c
->type
= this->type
;
365 c
->const_elements
= ralloc_array(c
, ir_constant
*, this->type
->length
);
366 for (unsigned i
= 0; i
< this->type
->length
; i
++) {
367 c
->const_elements
[i
] = this->const_elements
[i
]->clone(mem_ctx
, NULL
);
372 case GLSL_TYPE_ATOMIC_UINT
:
374 case GLSL_TYPE_ERROR
:
375 case GLSL_TYPE_SUBROUTINE
:
376 case GLSL_TYPE_INTERFACE
:
377 case GLSL_TYPE_FUNCTION
:
378 assert(!"Should not get here.");
386 class fixup_ir_call_visitor
: public ir_hierarchical_visitor
{
388 fixup_ir_call_visitor(struct hash_table
*ht
)
393 virtual ir_visitor_status
visit_enter(ir_call
*ir
)
395 /* Try to find the function signature referenced by the ir_call in the
396 * table. If it is found, replace it with the value from the table.
398 ir_function_signature
*sig
;
399 hash_entry
*entry
= _mesa_hash_table_search(this->ht
, ir
->callee
);
402 sig
= (ir_function_signature
*) entry
->data
;
406 /* Since this may be used before function call parameters are flattened,
407 * the children also need to be processed.
409 return visit_continue
;
413 struct hash_table
*ht
;
418 fixup_function_calls(struct hash_table
*ht
, exec_list
*instructions
)
420 fixup_ir_call_visitor
v(ht
);
426 clone_ir_list(void *mem_ctx
, exec_list
*out
, const exec_list
*in
)
428 struct hash_table
*ht
= _mesa_pointer_hash_table_create(NULL
);
430 foreach_in_list(const ir_instruction
, original
, in
) {
431 ir_instruction
*copy
= original
->clone(mem_ctx
, ht
);
433 out
->push_tail(copy
);
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).
441 fixup_function_calls(ht
, out
);
443 _mesa_hash_table_destroy(ht
, NULL
);