2 * Copyright © 2014 Broadcom
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:
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
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
24 #include "util/u_memory.h"
25 #include "util/u_simple_list.h"
33 bool has_side_effects
;
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_FMIN
] = { "fmin", 1, 2 },
42 [QOP_FMAX
] = { "fmax", 1, 2 },
43 [QOP_FMINABS
] = { "fminabs", 1, 2 },
44 [QOP_FMAXABS
] = { "fmaxabs", 1, 2 },
46 [QOP_SEQ
] = { "seq", 1, 2 },
47 [QOP_SNE
] = { "sne", 1, 2 },
48 [QOP_SGE
] = { "sge", 1, 2 },
49 [QOP_SLT
] = { "slt", 1, 2 },
50 [QOP_CMP
] = { "cmp", 1, 3 },
52 [QOP_FTOI
] = { "ftoi", 1, 1 },
53 [QOP_ITOF
] = { "itof", 1, 1 },
54 [QOP_RCP
] = { "rcp", 1, 1 },
55 [QOP_RSQ
] = { "rsq", 1, 1 },
56 [QOP_EXP2
] = { "exp2", 1, 2 },
57 [QOP_LOG2
] = { "log2", 1, 2 },
58 [QOP_PACK_COLORS
] = { "pack_colors", 1, 4 },
59 [QOP_PACK_SCALED
] = { "pack_scaled", 1, 2 },
60 [QOP_VPM_WRITE
] = { "vpm_write", 0, 1, true },
61 [QOP_VPM_READ
] = { "vpm_read", 0, 1, true },
62 [QOP_TLB_PASSTHROUGH_Z_WRITE
] = { "tlb_passthrough_z", 0, 0, true },
63 [QOP_TLB_COLOR_WRITE
] = { "tlb_color", 0, 1, true },
64 [QOP_TLB_COLOR_READ
] = { "tlb_color_read", 0, 0, true },
65 [QOP_VARY_ADD_C
] = { "vary_add_c", 1, 1 },
67 [QOP_FRAG_X
] = { "frag_x", 1, 0 },
68 [QOP_FRAG_Y
] = { "frag_y", 1, 0 },
69 [QOP_FRAG_Z
] = { "frag_z", 1, 0 },
70 [QOP_FRAG_RCP_W
] = { "frag_rcp_w", 1, 0 },
72 [QOP_TEX_S
] = { "tex_s", 0, 2 },
73 [QOP_TEX_T
] = { "tex_t", 0, 2 },
74 [QOP_TEX_R
] = { "tex_r", 0, 2 },
75 [QOP_TEX_B
] = { "tex_b", 0, 2 },
76 [QOP_TEX_RESULT
] = { "tex_result", 0, 0 },
77 [QOP_R4_UNPACK_A
] = { "r4_unpack_a", 1, 0 },
78 [QOP_R4_UNPACK_B
] = { "r4_unpack_b", 1, 0 },
79 [QOP_R4_UNPACK_C
] = { "r4_unpack_c", 1, 0 },
80 [QOP_R4_UNPACK_D
] = { "r4_unpack_d", 1, 0 },
84 qir_get_op_name(enum qop qop
)
86 if (qop
< ARRAY_SIZE(qir_op_info
) && qir_op_info
[qop
].name
)
87 return qir_op_info
[qop
].name
;
93 qir_get_op_nsrc(enum qop qop
)
95 if (qop
< ARRAY_SIZE(qir_op_info
) && qir_op_info
[qop
].name
)
96 return qir_op_info
[qop
].nsrc
;
102 qir_has_side_effects(struct qinst
*inst
)
104 for (int i
= 0; i
< qir_get_op_nsrc(inst
->op
); i
++) {
105 if (inst
->src
[i
].file
== QFILE_VARY
||
106 inst
->src
[i
].file
== QFILE_UNIF
)
110 return qir_op_info
[inst
->op
].has_side_effects
;
114 qir_print_reg(struct qreg reg
)
116 const char *files
[] = {
122 if (reg
.file
== QFILE_NULL
)
123 fprintf(stderr
, "null");
125 fprintf(stderr
, "%s%d", files
[reg
.file
], reg
.index
);
129 qir_dump_inst(struct qinst
*inst
)
131 fprintf(stderr
, "%s ", qir_get_op_name(inst
->op
));
133 qir_print_reg(inst
->dst
);
134 for (int i
= 0; i
< qir_get_op_nsrc(inst
->op
); i
++) {
135 fprintf(stderr
, ", ");
136 qir_print_reg(inst
->src
[i
]);
141 qir_dump(struct qcompile
*c
)
143 struct simple_node
*node
;
145 foreach(node
, &c
->instructions
) {
146 struct qinst
*inst
= (struct qinst
*)node
;
148 fprintf(stderr
, "\n");
153 qir_get_temp(struct qcompile
*c
)
157 reg
.file
= QFILE_TEMP
;
158 reg
.index
= c
->num_temps
++;
164 qir_inst(enum qop op
, struct qreg dst
, struct qreg src0
, struct qreg src1
)
166 struct qinst
*inst
= CALLOC_STRUCT(qinst
);
170 inst
->src
= calloc(2, sizeof(inst
->src
[0]));
178 qir_inst4(enum qop op
, struct qreg dst
,
184 struct qinst
*inst
= CALLOC_STRUCT(qinst
);
188 inst
->src
= calloc(4, sizeof(*inst
->src
));
198 qir_emit(struct qcompile
*c
, struct qinst
*inst
)
200 insert_at_tail(&c
->instructions
, &inst
->link
);
204 qir_reg_equals(struct qreg a
, struct qreg b
)
206 return a
.file
== b
.file
&& a
.index
== b
.index
;
210 qir_compile_init(void)
212 struct qcompile
*c
= CALLOC_STRUCT(qcompile
);
214 make_empty_list(&c
->instructions
);
220 qir_compile_destroy(struct qcompile
*c
)
226 qir_get_stage_name(enum qstage stage
)
228 static const char *names
[] = {
229 [QSTAGE_FRAG
] = "FS",
230 [QSTAGE_VERT
] = "VS",
231 [QSTAGE_COORD
] = "CS",
237 #define OPTPASS(func) \
239 bool stage_progress = func(c); \
240 if (stage_progress) { \
242 if (print_opt_debug) { \
244 "QIR opt pass %2d: %s progress\n", \
251 qir_optimize(struct qcompile
*c
)
253 bool print_opt_debug
= false;
257 bool progress
= false;
259 OPTPASS(qir_opt_algebraic
);
260 OPTPASS(qir_opt_copy_propagation
);
261 OPTPASS(qir_opt_dead_code
);