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