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