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 "ir.h"
  26 #include "glsl_types.h"
  27 extern "C" {
  28 #include "program/hash_table.h"
  29 }
  30
  31 /**
  32  * Duplicate an IR variable
  33  *
  34  * \note
  35  * This will probably be made \c virtual and moved to the base class
  36  * eventually.
  37  */
  38 ir_variable *
  39 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const
  40 {
  41    ir_variable *var = new(mem_ctx) ir_variable(this->type, this->name,
  42                                                (ir_variable_mode) this->mode);
  43
  44    var->max_array_access = this->max_array_access;
  45    var->read_only = this->read_only;
  46    var->centroid = this->centroid;
  47    var->invariant = this->invariant;
  48    var->shader_in = this->shader_in;
  49    var->shader_out = this->shader_out;
  50    var->interpolation = this->interpolation;
  51    var->array_lvalue = this->array_lvalue;
  52    var->location = this->location;
  53    var->warn_extension = this->warn_extension;
  54    var->origin_upper_left = this->origin_upper_left;
  55    var->pixel_center_integer = this->pixel_center_integer;
  56
  57    if (this->constant_value)
  58       var->constant_value = this->constant_value->clone(mem_ctx, ht);
  59
  60    if (ht) {
  61       hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
  62    }
  63
  64    return var;
  65 }
  66
  67 ir_swizzle *
  68 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
  69 {
  70    return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
  71 }
  72
  73 ir_return *
  74 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
  75 {
  76    ir_rvalue *new_value = NULL;
  77
  78    if (this->value)
  79       new_value = this->value->clone(mem_ctx, ht);
  80
  81    return new(mem_ctx) ir_return(new_value);
  82 }
  83
  84 ir_discard *
  85 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const
  86 {
  87    ir_rvalue *new_condition = NULL;
  88
  89    if (this->condition != NULL)
  90       new_condition = this->condition->clone(mem_ctx, ht);
  91
  92    return new(mem_ctx) ir_discard(new_condition);
  93 }
  94
  95 ir_loop_jump *
  96 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const
  97 {
  98    (void)ht;
  99
 100    return new(mem_ctx) ir_loop_jump(this->mode);
 101 }
 102
 103 ir_if *
 104 ir_if::clone(void *mem_ctx, struct hash_table *ht) const
 105 {
 106    ir_if *new_if = new(mem_ctx) ir_if(this->condition->clone(mem_ctx, ht));
 107
 108    foreach_iter(exec_list_iterator, iter, this->then_instructions) {
 109       ir_instruction *ir = (ir_instruction *)iter.get();
 110       new_if->then_instructions.push_tail(ir->clone(mem_ctx, ht));
 111    }
 112
 113    foreach_iter(exec_list_iterator, iter, this->else_instructions) {
 114       ir_instruction *ir = (ir_instruction *)iter.get();
 115       new_if->else_instructions.push_tail(ir->clone(mem_ctx, ht));
 116    }
 117
 118    return new_if;
 119 }
 120
 121 ir_loop *
 122 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const
 123 {
 124    ir_loop *new_loop = new(mem_ctx) ir_loop();
 125
 126    if (this->from)
 127       new_loop->from = this->from->clone(mem_ctx, ht);
 128    if (this->to)
 129       new_loop->to = this->to->clone(mem_ctx, ht);
 130    if (this->increment)
 131       new_loop->increment = this->increment->clone(mem_ctx, ht);
 132    new_loop->counter = counter;
 133
 134    foreach_iter(exec_list_iterator, iter, this->body_instructions) {
 135       ir_instruction *ir = (ir_instruction *)iter.get();
 136       new_loop->body_instructions.push_tail(ir->clone(mem_ctx, ht));
 137    }
 138
 139    return new_loop;
 140 }
 141
 142 ir_call *
 143 ir_call::clone(void *mem_ctx, struct hash_table *ht) const
 144 {
 145    exec_list new_parameters;
 146
 147    foreach_iter(exec_list_iterator, iter, this->actual_parameters) {
 148       ir_instruction *ir = (ir_instruction *)iter.get();
 149       new_parameters.push_tail(ir->clone(mem_ctx, ht));
 150    }
 151
 152    return new(mem_ctx) ir_call(this->callee, &new_parameters);
 153 }
 154
 155 ir_expression *
 156 ir_expression::clone(void *mem_ctx, struct hash_table *ht) const
 157 {
 158    ir_rvalue *op[2] = {NULL, NULL};
 159    unsigned int i;
 160
 161    for (i = 0; i < get_num_operands(); i++) {
 162       op[i] = this->operands[i]->clone(mem_ctx, ht);
 163    }
 164
 165    return new(mem_ctx) ir_expression(this->operation, this->type, op[0], op[1]);
 166 }
 167
 168 ir_dereference_variable *
 169 ir_dereference_variable::clone(void *mem_ctx, struct hash_table *ht) const
 170 {
 171    ir_variable *new_var;
 172
 173    if (ht) {
 174       new_var = (ir_variable *)hash_table_find(ht, this->var);
 175       if (!new_var)
 176          new_var = this->var;
 177    } else {
 178       new_var = this->var;
 179    }
 180
 181    return new(mem_ctx) ir_dereference_variable(new_var);
 182 }
 183
 184 ir_dereference_array *
 185 ir_dereference_array::clone(void *mem_ctx, struct hash_table *ht) const
 186 {
 187    return new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, ht),
 188                                             this->array_index->clone(mem_ctx,
 189                                                                      ht));
 190 }
 191
 192 ir_dereference_record *
 193 ir_dereference_record::clone(void *mem_ctx, struct hash_table *ht) const
 194 {
 195    return new(mem_ctx) ir_dereference_record(this->record->clone(mem_ctx, ht),
 196                                              this->field);
 197 }
 198
 199 ir_texture *
 200 ir_texture::clone(void *mem_ctx, struct hash_table *ht) const
 201 {
 202    ir_texture *new_tex = new(mem_ctx) ir_texture(this->op);
 203    new_tex->type = this->type;
 204
 205    new_tex->sampler = this->sampler->clone(mem_ctx, ht);
 206    new_tex->coordinate = this->coordinate->clone(mem_ctx, ht);
 207    if (this->projector)
 208       new_tex->projector = this->projector->clone(mem_ctx, ht);
 209    if (this->shadow_comparitor) {
 210       new_tex->shadow_comparitor = this->shadow_comparitor->clone(mem_ctx, ht);
 211    }
 212
 213    for (int i = 0; i < 3; i++)
 214       new_tex->offsets[i] = this->offsets[i];
 215
 216    switch (this->op) {
 217    case ir_tex:
 218       break;
 219    case ir_txb:
 220       new_tex->lod_info.bias = this->lod_info.bias->clone(mem_ctx, ht);
 221       break;
 222    case ir_txl:
 223    case ir_txf:
 224       new_tex->lod_info.lod = this->lod_info.lod->clone(mem_ctx, ht);
 225       break;
 226    case ir_txd:
 227       new_tex->lod_info.grad.dPdx = this->lod_info.grad.dPdx->clone(mem_ctx, ht);
 228       new_tex->lod_info.grad.dPdy = this->lod_info.grad.dPdy->clone(mem_ctx, ht);
 229       break;
 230    }
 231
 232    return new_tex;
 233 }
 234
 235 ir_assignment *
 236 ir_assignment::clone(void *mem_ctx, struct hash_table *ht) const
 237 {
 238    ir_rvalue *new_condition = NULL;
 239
 240    if (this->condition)
 241       new_condition = this->condition->clone(mem_ctx, ht);
 242
 243    return new(mem_ctx) ir_assignment(this->lhs->clone(mem_ctx, ht),
 244                                      this->rhs->clone(mem_ctx, ht),
 245                                      new_condition,
 246                                      this->write_mask);
 247 }
 248
 249 ir_function *
 250 ir_function::clone(void *mem_ctx, struct hash_table *ht) const
 251 {
 252    ir_function *copy = new(mem_ctx) ir_function(this->name);
 253
 254    foreach_list_const(node, &this->signatures) {
 255       const ir_function_signature *const sig =
 256          (const ir_function_signature *const) node;
 257
 258       ir_function_signature *sig_copy = sig->clone(mem_ctx, ht);
 259       copy->add_signature(sig_copy);
 260
 261       if (ht != NULL)
 262          hash_table_insert(ht, sig_copy,
 263                            (void *)const_cast<ir_function_signature *>(sig));
 264    }
 265
 266    return copy;
 267 }
 268
 269 ir_function_signature *
 270 ir_function_signature::clone(void *mem_ctx, struct hash_table *ht) const
 271 {
 272    ir_function_signature *copy =
 273       new(mem_ctx) ir_function_signature(this->return_type);
 274
 275    copy->is_defined = this->is_defined;
 276    copy->is_built_in = this->is_built_in;
 277
 278    /* Clone the parameter list.
 279     */
 280    foreach_list_const(node, &this->parameters) {
 281       const ir_variable *const param = (const ir_variable *) node;
 282
 283       assert(const_cast<ir_variable *>(param)->as_variable() != NULL);
 284
 285       ir_variable *const param_copy = param->clone(mem_ctx, ht);
 286       copy->parameters.push_tail(param_copy);
 287    }
 288
 289    /* Clone the instruction list.
 290     */
 291    foreach_list_const(node, &this->body) {
 292       const ir_instruction *const inst = (const ir_instruction *) node;
 293
 294       ir_instruction *const inst_copy = inst->clone(mem_ctx, ht);
 295       copy->body.push_tail(inst_copy);
 296    }
 297
 298    return copy;
 299 }
 300
 301 ir_constant *
 302 ir_constant::clone(void *mem_ctx, struct hash_table *ht) const
 303 {
 304    (void)ht;
 305
 306    switch (this->type->base_type) {
 307    case GLSL_TYPE_UINT:
 308    case GLSL_TYPE_INT:
 309    case GLSL_TYPE_FLOAT:
 310    case GLSL_TYPE_BOOL:
 311       return new(mem_ctx) ir_constant(this->type, &this->value);
 312
 313    case GLSL_TYPE_STRUCT: {
 314       ir_constant *c = new(mem_ctx) ir_constant;
 315
 316       c->type = this->type;
 317       for (exec_node *node = this->components.head
 318               ; !node->is_tail_sentinel()
 319               ; node = node->next) {
 320          ir_constant *const orig = (ir_constant *) node;
 321
 322          c->components.push_tail(orig->clone(mem_ctx, NULL));
 323       }
 324
 325       return c;
 326    }
 327
 328    case GLSL_TYPE_ARRAY: {
 329       ir_constant *c = new(mem_ctx) ir_constant;
 330
 331       c->type = this->type;
 332       c->array_elements = talloc_array(c, ir_constant *, this->type->length);
 333       for (unsigned i = 0; i < this->type->length; i++) {
 334          c->array_elements[i] = this->array_elements[i]->clone(mem_ctx, NULL);
 335       }
 336       return c;
 337    }
 338
 339    default:
 340       assert(!"Should not get here."); break;
 341       return NULL;
 342    }
 343 }
 344
 345
 346 class fixup_ir_call_visitor : public ir_hierarchical_visitor {
 347 public:
 348    fixup_ir_call_visitor(struct hash_table *ht)
 349    {
 350       this->ht = ht;
 351    }
 352
 353    virtual ir_visitor_status visit_enter(ir_call *ir)
 354    {
 355       /* Try to find the function signature referenced by the ir_call in the
 356        * table.  If it is found, replace it with the value from the table.
 357        */
 358       ir_function_signature *sig =
 359          (ir_function_signature *) hash_table_find(this->ht, ir->get_callee());
 360       if (sig != NULL)
 361          ir->set_callee(sig);
 362
 363       /* Since this may be used before function call parameters are flattened,
 364        * the children also need to be processed.
 365        */
 366       return visit_continue;
 367    }
 368
 369 private:
 370    struct hash_table *ht;
 371 };
 372
 373
 374 static void
 375 fixup_function_calls(struct hash_table *ht, exec_list *instructions)
 376 {
 377    fixup_ir_call_visitor v(ht);
 378    v.run(instructions);
 379 }
 380
 381
 382 void
 383 clone_ir_list(void *mem_ctx, exec_list *out, const exec_list *in)
 384 {
 385    struct hash_table *ht =
 386       hash_table_ctor(0, hash_table_pointer_hash, hash_table_pointer_compare);
 387
 388    foreach_list_const(node, in) {
 389       const ir_instruction *const original = (ir_instruction *) node;
 390       ir_instruction *copy = original->clone(mem_ctx, ht);
 391
 392       out->push_tail(copy);
 393    }
 394
 395    /* Make a pass over the cloned tree to fix up ir_call nodes to point to the
 396     * cloned ir_function_signature nodes.  This cannot be done automatically
 397     * during cloning because the ir_call might be a forward reference (i.e.,
 398     * the function signature that it references may not have been cloned yet).
 399     */
 400    fixup_function_calls(ht, out);
 401
 402    hash_table_dtor(ht);
 403 }