Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Blame | Last modification | View Log | RSS feed

  1. /*
  2.  * Copyright © 2014 Broadcom
  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 DEALINGS
  21.  * IN THE SOFTWARE.
  22.  */
  23.  
  24. /**
  25.  * @file vc4_opt_copy_propagation.c
  26.  *
  27.  * This implements simple copy propagation for QIR without control flow.
  28.  *
  29.  * For each temp, it keeps a qreg of which source it was MOVed from, if it
  30.  * was.  If we see that used later, we can just reuse the source value, since
  31.  * we know we don't have control flow, and we have SSA for our values so
  32.  * there's no killing to worry about.
  33.  */
  34.  
  35. #include "vc4_qir.h"
  36.  
  37. bool
  38. qir_opt_copy_propagation(struct vc4_compile *c)
  39. {
  40.         bool progress = false;
  41.         struct simple_node *node;
  42.         bool debug = false;
  43.         struct qreg *movs = calloc(c->num_temps, sizeof(struct qreg));
  44.  
  45.         foreach(node, &c->instructions) {
  46.                 struct qinst *inst = (struct qinst *)node;
  47.  
  48.                 for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
  49.                         int index = inst->src[i].index;
  50.                         if (inst->src[i].file == QFILE_TEMP &&
  51.                             (movs[index].file == QFILE_TEMP ||
  52.                              movs[index].file == QFILE_UNIF)) {
  53.                                 if (debug) {
  54.                                         fprintf(stderr, "Copy propagate: ");
  55.                                         qir_dump_inst(c, inst);
  56.                                         fprintf(stderr, "\n");
  57.                                 }
  58.  
  59.                                 inst->src[i] = movs[index];
  60.  
  61.                                 if (debug) {
  62.                                         fprintf(stderr, "to: ");
  63.                                         qir_dump_inst(c, inst);
  64.                                         fprintf(stderr, "\n");
  65.                                 }
  66.  
  67.                                 progress = true;
  68.                         }
  69.                 }
  70.  
  71.                 if (inst->op == QOP_MOV &&
  72.                     inst->dst.file == QFILE_TEMP &&
  73.                     inst->src[0].file != QFILE_VPM &&
  74.                     !(inst->src[0].file == QFILE_TEMP &&
  75.                       (c->defs[inst->src[0].index]->op == QOP_TEX_RESULT ||
  76.                        c->defs[inst->src[0].index]->op == QOP_TLB_COLOR_READ))) {
  77.                         movs[inst->dst.index] = inst->src[0];
  78.                 }
  79.         }
  80.  
  81.         free(movs);
  82.         return progress;
  83. }
  84.