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/ralloc.h"
25 #include "util/register_allocate.h"
26 #include "vc4_context.h"
30 #define QPU_R(file, index) { QPU_MUX_##file, index }
32 static const struct qpu_reg vc4_regs
[] = {
104 #define AB_INDEX (ACC_INDEX + 5)
107 vc4_alloc_reg_set(struct vc4_context
*vc4
)
109 assert(vc4_regs
[AB_INDEX
].addr
== 0);
110 assert(vc4_regs
[AB_INDEX
+ 1].addr
== 0);
111 STATIC_ASSERT(ARRAY_SIZE(vc4_regs
) == AB_INDEX
+ 64);
116 vc4
->regs
= ra_alloc_reg_set(vc4
, ARRAY_SIZE(vc4_regs
), true);
118 vc4
->reg_class_any
= ra_alloc_reg_class(vc4
->regs
);
119 vc4
->reg_class_r4_or_a
= ra_alloc_reg_class(vc4
->regs
);
120 vc4
->reg_class_a
= ra_alloc_reg_class(vc4
->regs
);
121 for (uint32_t i
= 0; i
< ARRAY_SIZE(vc4_regs
); i
++) {
122 /* Reserve ra31/rb31 for spilling fixup_raddr_conflict() in
125 if (vc4_regs
[i
].addr
== 31)
128 /* R4 can't be written as a general purpose register. (it's
129 * TMU_NOSWAP as a write address).
131 if (vc4_regs
[i
].mux
== QPU_MUX_R4
) {
132 ra_class_add_reg(vc4
->regs
, vc4
->reg_class_r4_or_a
, i
);
136 ra_class_add_reg(vc4
->regs
, vc4
->reg_class_any
, i
);
139 for (uint32_t i
= AB_INDEX
; i
< AB_INDEX
+ 64; i
+= 2) {
140 ra_class_add_reg(vc4
->regs
, vc4
->reg_class_a
, i
);
141 ra_class_add_reg(vc4
->regs
, vc4
->reg_class_r4_or_a
, i
);
144 ra_set_finalize(vc4
->regs
, NULL
);
147 struct node_to_temp_map
{
153 node_to_temp_priority(const void *in_a
, const void *in_b
)
155 const struct node_to_temp_map
*a
= in_a
;
156 const struct node_to_temp_map
*b
= in_b
;
158 return a
->priority
- b
->priority
;
161 #define CLASS_BIT_A (1 << 0)
162 #define CLASS_BIT_B_OR_ACC (1 << 1)
163 #define CLASS_BIT_R4 (1 << 2)
166 * Returns a mapping from QFILE_TEMP indices to struct qpu_regs.
168 * The return value should be freed by the caller.
171 vc4_register_allocate(struct vc4_context
*vc4
, struct vc4_compile
*c
)
173 struct node_to_temp_map map
[c
->num_temps
];
174 uint32_t temp_to_node
[c
->num_temps
];
175 uint32_t def
[c
->num_temps
];
176 uint32_t use
[c
->num_temps
];
177 uint8_t class_bits
[c
->num_temps
];
178 struct qpu_reg
*temp_registers
= calloc(c
->num_temps
,
179 sizeof(*temp_registers
));
180 memset(def
, 0, sizeof(def
));
181 memset(use
, 0, sizeof(use
));
183 /* If things aren't ever written (undefined values), just read from
186 for (uint32_t i
= 0; i
< c
->num_temps
; i
++)
187 temp_registers
[i
] = qpu_rn(0);
189 vc4_alloc_reg_set(vc4
);
191 struct ra_graph
*g
= ra_alloc_interference_graph(vc4
->regs
,
194 /* Compute the live ranges so we can figure out interference.
197 list_for_each_entry(struct qinst
, inst
, &c
->instructions
, link
) {
198 if (inst
->dst
.file
== QFILE_TEMP
) {
199 def
[inst
->dst
.index
] = ip
;
200 use
[inst
->dst
.index
] = ip
;
203 for (int i
= 0; i
< qir_get_op_nsrc(inst
->op
); i
++) {
204 if (inst
->src
[i
].file
== QFILE_TEMP
)
205 use
[inst
->src
[i
].index
] = ip
;
211 /* The payload registers have values implicitly loaded
212 * at the start of the program.
214 def
[inst
->dst
.index
] = 0;
223 for (uint32_t i
= 0; i
< c
->num_temps
; i
++) {
225 map
[i
].priority
= use
[i
] - def
[i
];
227 qsort(map
, c
->num_temps
, sizeof(map
[0]), node_to_temp_priority
);
228 for (uint32_t i
= 0; i
< c
->num_temps
; i
++) {
229 temp_to_node
[map
[i
].temp
] = i
;
232 /* Figure out our register classes and preallocated registers. We
233 * start with any temp being able to be in any file, then instructions
234 * incrementally remove bits that the temp definitely can't be in.
237 CLASS_BIT_A
| CLASS_BIT_B_OR_ACC
| CLASS_BIT_R4
,
241 list_for_each_entry(struct qinst
, inst
, &c
->instructions
, link
) {
242 if (qir_writes_r4(inst
)) {
243 /* This instruction writes r4 (and optionally moves
244 * its result to a temp), so nothing else can be
245 * stored in r4 across it.
247 for (int i
= 0; i
< c
->num_temps
; i
++) {
248 if (def
[i
] < ip
&& use
[i
] > ip
)
249 class_bits
[i
] &= ~CLASS_BIT_R4
;
252 /* R4 can't be written as a general purpose
253 * register. (it's TMU_NOSWAP as a write address).
255 if (inst
->dst
.file
== QFILE_TEMP
)
256 class_bits
[inst
->dst
.index
] &= ~CLASS_BIT_R4
;
261 ra_set_node_reg(g
, temp_to_node
[inst
->dst
.index
],
262 AB_INDEX
+ QPU_R_FRAG_PAYLOAD_ZW
* 2 + 1);
266 ra_set_node_reg(g
, temp_to_node
[inst
->dst
.index
],
267 AB_INDEX
+ QPU_R_FRAG_PAYLOAD_ZW
* 2);
270 case QOP_PACK_SCALED
:
271 /* The pack flags require an A-file dst register. */
272 class_bits
[inst
->dst
.index
] &= CLASS_BIT_A
;
279 if (qir_src_needs_a_file(inst
)) {
280 class_bits
[inst
->src
[0].index
] &= CLASS_BIT_A
;
285 for (uint32_t i
= 0; i
< c
->num_temps
; i
++) {
286 int node
= temp_to_node
[i
];
288 switch (class_bits
[i
]) {
289 case CLASS_BIT_A
| CLASS_BIT_B_OR_ACC
| CLASS_BIT_R4
:
290 case CLASS_BIT_A
| CLASS_BIT_B_OR_ACC
:
291 ra_set_node_class(g
, node
, vc4
->reg_class_any
);
293 case CLASS_BIT_A
| CLASS_BIT_R4
:
294 ra_set_node_class(g
, node
, vc4
->reg_class_r4_or_a
);
297 ra_set_node_class(g
, node
, vc4
->reg_class_a
);
300 fprintf(stderr
, "temp %d: bad class bits: 0x%x\n",
307 for (uint32_t i
= 0; i
< c
->num_temps
; i
++) {
308 for (uint32_t j
= i
+ 1; j
< c
->num_temps
; j
++) {
309 if (!(def
[i
] >= use
[j
] || def
[j
] >= use
[i
])) {
310 ra_add_node_interference(g
,
317 bool ok
= ra_allocate(g
);
319 fprintf(stderr
, "Failed to register allocate:\n");
324 for (uint32_t i
= 0; i
< c
->num_temps
; i
++) {
325 temp_registers
[i
] = vc4_regs
[ra_get_node_reg(g
, temp_to_node
[i
])];
327 /* If the value's never used, just write to the NOP register
328 * for clarity in debug output.
330 if (def
[i
] == use
[i
])
331 temp_registers
[i
] = qpu_ra(QPU_W_NOP
);
336 return temp_registers
;