93f97c219f7b42dac97071ed220d1648b2f9e172
[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 "util/u_memory.h"
25 #include "util/u_simple_list.h"
26
27 #include "vc4_qir.h"
28 #include "vc4_qpu.h"
29
30 struct qir_op_info {
31 const char *name;
32 uint8_t ndst, nsrc;
33 bool has_side_effects;
34 };
35
36 static const struct qir_op_info qir_op_info[] = {
37 [QOP_MOV] = { "mov", 1, 1 },
38 [QOP_FADD] = { "fadd", 1, 2 },
39 [QOP_FSUB] = { "fsub", 1, 2 },
40 [QOP_FMUL] = { "fmul", 1, 2 },
41 [QOP_MUL24] = { "mul24", 1, 2 },
42 [QOP_FMIN] = { "fmin", 1, 2 },
43 [QOP_FMAX] = { "fmax", 1, 2 },
44 [QOP_FMINABS] = { "fminabs", 1, 2 },
45 [QOP_FMAXABS] = { "fmaxabs", 1, 2 },
46 [QOP_FTOI] = { "ftoi", 1, 1 },
47 [QOP_ITOF] = { "itof", 1, 1 },
48 [QOP_ADD] = { "add", 1, 2 },
49 [QOP_SUB] = { "sub", 1, 2 },
50 [QOP_SHR] = { "shr", 1, 2 },
51 [QOP_ASR] = { "asr", 1, 2 },
52 [QOP_SHL] = { "shl", 1, 2 },
53 [QOP_MIN] = { "min", 1, 2 },
54 [QOP_MAX] = { "max", 1, 2 },
55 [QOP_AND] = { "and", 1, 2 },
56 [QOP_OR] = { "or", 1, 2 },
57 [QOP_XOR] = { "xor", 1, 2 },
58 [QOP_NOT] = { "not", 1, 1 },
59
60 [QOP_SF] = { "sf", 0, 1 },
61 [QOP_SEL_X_0_NS] = { "fsel_x_0_ns", 1, 1 },
62 [QOP_SEL_X_0_NC] = { "fsel_x_0_nc", 1, 1 },
63 [QOP_SEL_X_0_ZS] = { "fsel_x_0_zs", 1, 1 },
64 [QOP_SEL_X_0_ZC] = { "fsel_x_0_zc", 1, 1 },
65 [QOP_SEL_X_Y_NS] = { "fsel_x_y_ns", 1, 2 },
66 [QOP_SEL_X_Y_NC] = { "fsel_x_y_nc", 1, 2 },
67 [QOP_SEL_X_Y_ZS] = { "fsel_x_y_zs", 1, 2 },
68 [QOP_SEL_X_Y_ZC] = { "fsel_x_y_zc", 1, 2 },
69
70 [QOP_RCP] = { "rcp", 1, 1 },
71 [QOP_RSQ] = { "rsq", 1, 1 },
72 [QOP_EXP2] = { "exp2", 1, 2 },
73 [QOP_LOG2] = { "log2", 1, 2 },
74 [QOP_PACK_COLORS] = { "pack_colors", 1, 4 },
75 [QOP_PACK_SCALED] = { "pack_scaled", 1, 2 },
76 [QOP_VPM_WRITE] = { "vpm_write", 0, 1, true },
77 [QOP_VPM_READ] = { "vpm_read", 0, 1, true },
78 [QOP_TLB_DISCARD_SETUP] = { "discard", 0, 1, true },
79 [QOP_TLB_PASSTHROUGH_Z_WRITE] = { "tlb_passthrough_z", 0, 0, true },
80 [QOP_TLB_COLOR_WRITE] = { "tlb_color", 0, 1, true },
81 [QOP_TLB_COLOR_READ] = { "tlb_color_read", 0, 0, true },
82 [QOP_VARY_ADD_C] = { "vary_add_c", 1, 1 },
83
84 [QOP_FRAG_X] = { "frag_x", 1, 0 },
85 [QOP_FRAG_Y] = { "frag_y", 1, 0 },
86 [QOP_FRAG_Z] = { "frag_z", 1, 0 },
87 [QOP_FRAG_RCP_W] = { "frag_rcp_w", 1, 0 },
88
89 [QOP_TEX_S] = { "tex_s", 0, 2 },
90 [QOP_TEX_T] = { "tex_t", 0, 2 },
91 [QOP_TEX_R] = { "tex_r", 0, 2 },
92 [QOP_TEX_B] = { "tex_b", 0, 2 },
93 [QOP_TEX_RESULT] = { "tex_result", 0, 0 },
94 [QOP_R4_UNPACK_A] = { "r4_unpack_a", 1, 0 },
95 [QOP_R4_UNPACK_B] = { "r4_unpack_b", 1, 0 },
96 [QOP_R4_UNPACK_C] = { "r4_unpack_c", 1, 0 },
97 [QOP_R4_UNPACK_D] = { "r4_unpack_d", 1, 0 },
98 };
99
100 static const char *
101 qir_get_op_name(enum qop qop)
102 {
103 if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
104 return qir_op_info[qop].name;
105 else
106 return "???";
107 }
108
109 int
110 qir_get_op_nsrc(enum qop qop)
111 {
112 if (qop < ARRAY_SIZE(qir_op_info) && qir_op_info[qop].name)
113 return qir_op_info[qop].nsrc;
114 else
115 abort();
116 }
117
118 bool
119 qir_has_side_effects(struct qinst *inst)
120 {
121 for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
122 if (inst->src[i].file == QFILE_VARY ||
123 inst->src[i].file == QFILE_UNIF)
124 return true;
125 }
126
127 return qir_op_info[inst->op].has_side_effects;
128 }
129
130 static void
131 qir_print_reg(struct qreg reg)
132 {
133 const char *files[] = {
134 [QFILE_TEMP] = "t",
135 [QFILE_VARY] = "v",
136 [QFILE_UNIF] = "u",
137 };
138
139 if (reg.file == QFILE_NULL)
140 fprintf(stderr, "null");
141 else
142 fprintf(stderr, "%s%d", files[reg.file], reg.index);
143 }
144
145 void
146 qir_dump_inst(struct qinst *inst)
147 {
148 fprintf(stderr, "%s ", qir_get_op_name(inst->op));
149
150 qir_print_reg(inst->dst);
151 for (int i = 0; i < qir_get_op_nsrc(inst->op); i++) {
152 fprintf(stderr, ", ");
153 qir_print_reg(inst->src[i]);
154 }
155 }
156
157 void
158 qir_dump(struct qcompile *c)
159 {
160 struct simple_node *node;
161
162 foreach(node, &c->instructions) {
163 struct qinst *inst = (struct qinst *)node;
164 qir_dump_inst(inst);
165 fprintf(stderr, "\n");
166 }
167 }
168
169 struct qreg
170 qir_get_temp(struct qcompile *c)
171 {
172 struct qreg reg;
173
174 reg.file = QFILE_TEMP;
175 reg.index = c->num_temps++;
176
177 return reg;
178 }
179
180 struct qinst *
181 qir_inst(enum qop op, struct qreg dst, struct qreg src0, struct qreg src1)
182 {
183 struct qinst *inst = CALLOC_STRUCT(qinst);
184
185 inst->op = op;
186 inst->dst = dst;
187 inst->src = calloc(2, sizeof(inst->src[0]));
188 inst->src[0] = src0;
189 inst->src[1] = src1;
190
191 return inst;
192 }
193
194 struct qinst *
195 qir_inst4(enum qop op, struct qreg dst,
196 struct qreg a,
197 struct qreg b,
198 struct qreg c,
199 struct qreg d)
200 {
201 struct qinst *inst = CALLOC_STRUCT(qinst);
202
203 inst->op = op;
204 inst->dst = dst;
205 inst->src = calloc(4, sizeof(*inst->src));
206 inst->src[0] = a;
207 inst->src[1] = b;
208 inst->src[2] = c;
209 inst->src[3] = d;
210
211 return inst;
212 }
213
214 void
215 qir_emit(struct qcompile *c, struct qinst *inst)
216 {
217 insert_at_tail(&c->instructions, &inst->link);
218 }
219
220 bool
221 qir_reg_equals(struct qreg a, struct qreg b)
222 {
223 return a.file == b.file && a.index == b.index;
224 }
225
226 struct qcompile *
227 qir_compile_init(void)
228 {
229 struct qcompile *c = CALLOC_STRUCT(qcompile);
230
231 make_empty_list(&c->instructions);
232
233 return c;
234 }
235
236 void
237 qir_compile_destroy(struct qcompile *c)
238 {
239 free(c);
240 }
241
242 const char *
243 qir_get_stage_name(enum qstage stage)
244 {
245 static const char *names[] = {
246 [QSTAGE_FRAG] = "FS",
247 [QSTAGE_VERT] = "VS",
248 [QSTAGE_COORD] = "CS",
249 };
250
251 return names[stage];
252 }
253
254 #define OPTPASS(func) \
255 do { \
256 bool stage_progress = func(c); \
257 if (stage_progress) { \
258 progress = true; \
259 if (print_opt_debug) { \
260 fprintf(stderr, \
261 "QIR opt pass %2d: %s progress\n", \
262 pass, #func); \
263 } \
264 } \
265 } while (0)
266
267 void
268 qir_optimize(struct qcompile *c)
269 {
270 bool print_opt_debug = false;
271 int pass = 1;
272
273 while (true) {
274 bool progress = false;
275
276 OPTPASS(qir_opt_algebraic);
277 OPTPASS(qir_opt_copy_propagation);
278 OPTPASS(qir_opt_dead_code);
279
280 if (!progress)
281 break;
282
283 pass++;
284 }
285 }