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