9462da586608521d8a8056906c78bb24a796871e
[mesa.git] / 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_PASSTHROUGH_Z_WRITE] = { "tlb_passthrough_z", 0, 0, true },
65 [QOP_TLB_COLOR_WRITE] = { "tlb_color", 0, 1, true },
66 [QOP_VARY_ADD_C] = { "vary_add_c", 1, 1 },
67
68 [QOP_TEX_S] = { "tex_s", 0, 2 },
69 [QOP_TEX_T] = { "tex_t", 0, 2 },
70 [QOP_TEX_R] = { "tex_r", 0, 2 },
71 [QOP_TEX_B] = { "tex_b", 0, 2 },
72 [QOP_TEX_RESULT] = { "tex_result", 0, 0 },
73 [QOP_R4_UNPACK_A] = { "r4_unpack_a", 1, 0 },
74 [QOP_R4_UNPACK_B] = { "r4_unpack_b", 1, 0 },
75 [QOP_R4_UNPACK_C] = { "r4_unpack_c", 1, 0 },
76 [QOP_R4_UNPACK_D] = { "r4_unpack_d", 1, 0 },
77 };
78
79 static const char *
80 qir_get_op_name(enum qop qop)
81 {
82 if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
83 return qir_op_info[qop].name;
84 else
85 return "???";
86 }
87
88 int
89 qir_get_op_nsrc(enum qop qop)
90 {
91 if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
92 return qir_op_info[qop].nsrc;
93 else
94 abort();
95 }
96
97 bool
98 qir_has_side_effects(struct qinst *inst)
99 {
100 for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
101 if (inst->src[i].file == QFILE_VARY ||
102 inst->src[i].file == QFILE_UNIF)
103 return true;
104 }
105
106 return qir_op_info[inst->op].has_side_effects;
107 }
108
109 static void
110 qir_print_reg(struct qreg reg)
111 {
112 const char *files[] = {
113 [QFILE_TEMP] = "t",
114 [QFILE_VARY] = "v",
115 [QFILE_UNIF] = "u",
116 };
117
118 if (reg.file == QFILE_NULL)
119 fprintf(stderr, "null");
120 else
121 fprintf(stderr, "%s%d", files[reg.file], reg.index);
122 }
123
124 void
125 qir_dump_inst(struct qinst *inst)
126 {
127 fprintf(stderr, "%s ", qir_get_op_name(inst->op));
128
129 qir_print_reg(inst->dst);
130 for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
131 fprintf(stderr, ", ");
132 qir_print_reg(inst->src[i]);
133 }
134 }
135
136 void
137 qir_dump(struct qcompile *c)
138 {
139 struct simple_node *node;
140
141 foreach(node, &c->instructions) {
142 struct qinst *inst = (struct qinst *)node;
143 qir_dump_inst(inst);
144 fprintf(stderr, "\n");
145 }
146 }
147
148 struct qreg
149 qir_get_temp(struct qcompile *c)
150 {
151 struct qreg reg;
152
153 reg.file = QFILE_TEMP;
154 reg.index = c->num_temps++;
155
156 return reg;
157 }
158
159 struct qinst *
160 qir_inst(enum qop op, struct qreg dst, struct qreg src0, struct qreg src1)
161 {
162 struct qinst *inst = CALLOC_STRUCT(qinst);
163
164 inst->op = op;
165 inst->dst = dst;
166 inst->src = calloc(2, sizeof(inst->src[0]));
167 inst->src[0] = src0;
168 inst->src[1] = src1;
169
170 return inst;
171 }
172
173 struct qinst *
174 qir_inst4(enum qop op, struct qreg dst,
175 struct qreg a,
176 struct qreg b,
177 struct qreg c,
178 struct qreg d)
179 {
180 struct qinst *inst = CALLOC_STRUCT(qinst);
181
182 inst->op = op;
183 inst->dst = dst;
184 inst->src = calloc(4, sizeof(*inst->src));
185 inst->src[0] = a;
186 inst->src[1] = b;
187 inst->src[2] = c;
188 inst->src[3] = d;
189
190 return inst;
191 }
192
193 void
194 qir_emit(struct qcompile *c, struct qinst *inst)
195 {
196 insert_at_tail(&c->instructions, &inst->link);
197 }
198
199 bool
200 qir_reg_equals(struct qreg a, struct qreg b)
201 {
202 return a.file == b.file && a.index == b.index;
203 }
204
205 struct qcompile *
206 qir_compile_init(void)
207 {
208 struct qcompile *c = CALLOC_STRUCT(qcompile);
209
210 make_empty_list(&c->instructions);
211
212 return c;
213 }
214
215 void
216 qir_compile_destroy(struct qcompile *c)
217 {
218 free(c);
219 }
220
221 const char *
222 qir_get_stage_name(enum qstage stage)
223 {
224 static const char *names[] = {
225 [QSTAGE_FRAG] = "FS",
226 [QSTAGE_VERT] = "VS",
227 [QSTAGE_COORD] = "CS",
228 };
229
230 return names[stage];
231 }
232
233 #define OPTPASS(func) \
234 do { \
235 bool stage_progress = func(c); \
236 if (stage_progress) { \
237 progress = true; \
238 if (print_opt_debug) { \
239 fprintf(stderr, \
240 "QIR opt pass %2d: %s progress\n", \
241 pass, #func); \
242 } \
243 } \
244 } while (0)
245
246 void
247 qir_optimize(struct qcompile *c)
248 {
249 bool print_opt_debug = false;
250 int pass = 1;
251
252 while (true) {
253 bool progress = false;
254
255 OPTPASS(qir_opt_algebraic);
256 OPTPASS(qir_opt_copy_propagation);
257 OPTPASS(qir_opt_dead_code);
258
259 if (!progress)
260 break;
261
262 pass++;
263 }
264 }