Subversion Repositories Kolibri OS

Rev

Blame | Last modification | View Log | RSS feed

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