src/gallium/drivers/vc4/vc4_qir.c

   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 #include <stdio.h>
  25
  26 #include "util/u_memory.h"
  27 #include "util/u_simple_list.h"
  28
  29 #include "vc4_qir.h"
  30 #include "vc4_qpu.h"
  31
  32 struct qir_op_info {
  33         const char *name;
  34         uint8_t ndst, nsrc;
  35         bool has_side_effects;
  36 };
  37
  38 static const struct qir_op_info qir_op_info[] = {
  39         [QOP_MOV] = { "mov", 1, 1 },
  40         [QOP_FADD] = { "fadd", 1, 2 },
  41         [QOP_FSUB] = { "fsub", 1, 2 },
  42         [QOP_FMUL] = { "fmul", 1, 2 },
  43         [QOP_FMIN] = { "fmin", 1, 2 },
  44         [QOP_FMAX] = { "fmax", 1, 2 },
  45         [QOP_FMINABS] = { "fminabs", 1, 2 },
  46         [QOP_FMAXABS] = { "fmaxabs", 1, 2 },
  47
  48         [QOP_SEQ] = { "seq", 1, 2 },
  49         [QOP_SNE] = { "sne", 1, 2 },
  50         [QOP_SGE] = { "sge", 1, 2 },
  51         [QOP_SLT] = { "slt", 1, 2 },
  52         [QOP_CMP] = { "cmp", 1, 3 },
  53
  54         [QOP_FTOI] = { "ftoi", 1, 1 },
  55         [QOP_ITOF] = { "itof", 1, 1 },
  56         [QOP_RCP] = { "rcp", 1, 1 },
  57         [QOP_RSQ] = { "rsq", 1, 1 },
  58         [QOP_EXP2] = { "exp2", 1, 2 },
  59         [QOP_LOG2] = { "log2", 1, 2 },
  60         [QOP_PACK_COLORS] = { "pack_colors", 1, 4 },
  61         [QOP_PACK_SCALED] = { "pack_scaled", 1, 2 },
  62         [QOP_VPM_WRITE] = { "vpm_write", 0, 1, true },
  63         [QOP_VPM_READ] = { "vpm_read", 0, 1, true },
  64         [QOP_TLB_COLOR_WRITE] = { "tlb_color", 0, 1, true },
  65         [QOP_VARY_ADD_C] = { "vary_add_c", 1, 1 },
  66 };
  67
  68 static const char *
  69 qir_get_op_name(enum qop qop)
  70 {
  71         if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
  72                 return qir_op_info[qop].name;
  73         else
  74                 return "???";
  75 }
  76
  77 int
  78 qir_get_op_nsrc(enum qop qop)
  79 {
  80         if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
  81                 return qir_op_info[qop].nsrc;
  82         else
  83                 abort();
  84 }
  85
  86 bool
  87 qir_has_side_effects(struct qinst *inst)
  88 {
  89         for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
  90                 if (inst->src[i].file == QFILE_VARY ||
  91                     inst->src[i].file == QFILE_UNIF)
  92                         return true;
  93         }
  94
  95         return qir_op_info[inst->op].has_side_effects;
  96 }
  97
  98 static void
  99 qir_print_reg(struct qreg reg)
 100 {
 101         const char *files[] = {
 102                 [QFILE_TEMP] = "t",
 103                 [QFILE_VARY] = "v",
 104                 [QFILE_UNIF] = "u",
 105         };
 106
 107         if (reg.file == QFILE_NULL)
 108                 fprintf(stderr, "null");
 109         else
 110                 fprintf(stderr, "%s%d", files[reg.file], reg.index);
 111 }
 112
 113 void
 114 qir_dump_inst(struct qinst *inst)
 115 {
 116         fprintf(stderr, "%s ", qir_get_op_name(inst->op));
 117
 118         qir_print_reg(inst->dst);
 119         for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
 120                 fprintf(stderr, ", ");
 121                 qir_print_reg(inst->src[i]);
 122         }
 123 }
 124
 125 void
 126 qir_dump(struct qcompile *c)
 127 {
 128         struct simple_node *node;
 129
 130         foreach(node, &c->instructions) {
 131                 struct qinst *inst = (struct qinst *)node;
 132                 qir_dump_inst(inst);
 133                 fprintf(stderr, "\n");
 134         }
 135 }
 136
 137 struct qreg
 138 qir_get_temp(struct qcompile *c)
 139 {
 140         struct qreg reg;
 141
 142         reg.file = QFILE_TEMP;
 143         reg.index = c->num_temps++;
 144
 145         return reg;
 146 }
 147
 148 struct qinst *
 149 qir_inst(enum qop op, struct qreg dst, struct qreg src0, struct qreg src1)
 150 {
 151         struct qinst *inst = CALLOC_STRUCT(qinst);
 152
 153         inst->op = op;
 154         inst->dst = dst;
 155         inst->src = calloc(2, sizeof(inst->src[0]));
 156         inst->src[0] = src0;
 157         inst->src[1] = src1;
 158
 159         return inst;
 160 }
 161
 162 struct qinst *
 163 qir_inst4(enum qop op, struct qreg dst,
 164           struct qreg a,
 165           struct qreg b,
 166           struct qreg c,
 167           struct qreg d)
 168 {
 169         struct qinst *inst = CALLOC_STRUCT(qinst);
 170
 171         inst->op = op;
 172         inst->dst = dst;
 173         inst->src = calloc(4, sizeof(*inst->src));
 174         inst->src[0] = a;
 175         inst->src[1] = b;
 176         inst->src[2] = c;
 177         inst->src[3] = d;
 178
 179         return inst;
 180 }
 181
 182 void
 183 qir_emit(struct qcompile *c, struct qinst *inst)
 184 {
 185         insert_at_tail(&c->instructions, &inst->link);
 186 }
 187
 188 bool
 189 qir_reg_equals(struct qreg a, struct qreg b)
 190 {
 191         return a.file == b.file && a.index == b.index;
 192 }
 193
 194 struct qcompile *
 195 qir_compile_init(void)
 196 {
 197         struct qcompile *c = CALLOC_STRUCT(qcompile);
 198
 199         make_empty_list(&c->instructions);
 200
 201         return c;
 202 }
 203
 204 void
 205 qir_compile_destroy(struct qcompile *c)
 206 {
 207         free(c);
 208 }
 209
 210 const char *
 211 qir_get_stage_name(enum qstage stage)
 212 {
 213         static const char *names[] = {
 214                 [QSTAGE_FRAG] = "FS",
 215                 [QSTAGE_VERT] = "VS",
 216                 [QSTAGE_COORD] = "CS",
 217         };
 218
 219         return names[stage];
 220 }
 221
 222 #define OPTPASS(func)                                                   \
 223         do {                                                            \
 224                 bool stage_progress = func(c);                          \
 225                 if (stage_progress) {                                   \
 226                         progress = true;                                \
 227                         if (print_opt_debug) {                          \
 228                                 fprintf(stderr,                         \
 229                                         "QIR opt pass %2d: %s progress\n", \
 230                                         pass, #func);                   \
 231                         }                                               \
 232                 }                                                       \
 233         } while (0)
 234
 235 void
 236 qir_optimize(struct qcompile *c)
 237 {
 238         bool print_opt_debug = false;
 239         int pass = 1;
 240
 241         while (true) {
 242                 bool progress = false;
 243
 244                 OPTPASS(qir_opt_algebraic);
 245                 OPTPASS(qir_opt_copy_propagation);
 246                 OPTPASS(qir_opt_dead_code);
 247
 248                 if (!progress)
 249                         break;
 250
 251                 pass++;
 252         }
 253 }