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