fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-05-07 02:48:06 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

jay: roundrobin RA

Browse source 
Totals:
Instrs: 2827788 -> 2810815 (-0.60%); split: -1.12%, +0.52%
CodeSize: 45449488 -> 45101440 (-0.77%); split: -1.28%, +0.51%
Number of spill instructions: 1984 -> 1982 (-0.10%)
Number of fill instructions: 2272 -> 2270 (-0.09%)

Totals from 2449 (92.52% of 2647) affected shaders:
Instrs: 2818824 -> 2801851 (-0.60%); split: -1.13%, +0.53%
CodeSize: 45314880 -> 44966832 (-0.77%); split: -1.28%, +0.51%
Number of spill instructions: 1984 -> 1982 (-0.10%)
Number of fill instructions: 2272 -> 2270 (-0.09%)

Signed-off-by: Alyssa Rosenzweig <alyssa.rosenzweig@intel.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/40960>
This commit is contained in:
Alyssa Rosenzweig 2026-04-13 13:49:29 -04:00 • committed by Marge Bot
parent 57a00707a1
commit 820e3a9403
1 changed files with 19 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
src/intel/compiler/jay/jay_register_allocate.c
View file

@ -288,6 +288,9 @@ typedef struct jay_ra_state {
/** Size of each register file */
unsigned num_regs[JAY_NUM_RA_FILES];
/** Counter for roundrobin register allocation */
unsigned roundrobin[JAY_NUM_RA_FILES];
/** First GPR that may be used for EOT sends */
unsigned eot_offs;
@ -764,8 +767,23 @@ pick_regs(jay_ra_state *ra,
ra->phi_web[phi_web_find(ra->phi_web, jay_channel(var, 0))].affinity;
assert(alignment >= size && "alignment must be a multiple of size");
unsigned nr = DIV_ROUND_UP((end + 1 - size - first), alignment);
unsigned roundrobin = (ra->roundrobin[file]++) % nr;
unsigned rr_al = roundrobin * alignment, nr_al = nr * alignment;
for (unsigned i = rr_al; i < rr_al + nr_al; i += alignment) {
/* We select registers roundrobin. This has several benefits:
*
* 1. Easier coalescing since we are less likely statistically to allocate
* a register that a future instruction has an affinity.
*
* 2. More freedom for post-RA scheduling thanks to fewer dependencies.
*
* 3. Less stalling due to SWSB annotations from register reuse.
*/
unsigned r = first + (i >= nr_al ? (i - nr_al) : i);
assert(r >= first && r + size <= end);
for (unsigned r = first; r + size <= end; r += alignment) {
unsigned cost = 0;
bool tied = last_killed && last_killed->reg == r;
enum jay_stride stride =