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