fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-01-29 18:10:23 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 5

pan/bi: Add helpers for working with singletons

Browse source 
Clauses with exactly one instruction (not canonical terminology to my
knowledge, but the notation is suggestive). Since these are isomorphic
to the instructions themselves, we want helpers to go between the forms.

Signed-off-by: Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/7206>
This commit is contained in:
Alyssa Rosenzweig 2020-10-14 20:36:21 -04:00 • committed by Marge Bot
parent 1db83fc75d
commit 82dbc4ea78
1 changed files with 40 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

40
src/panfrost/bifrost/bi_ra.c
View file

@ -229,6 +229,46 @@ bi_fill(unsigned node, uint64_t offset, unsigned channels)
return load;
}
/* Get the single instruction in a singleton clause. Precondition: clause
* contains exactly 1 instruction.
*
* More complex scheduling implies tougher constraints on spilling. We'll cross
* that bridge when we get to it. For now, just grab the one and only
* instruction in the clause */
static bi_instruction *
bi_unwrap_singleton(bi_clause *clause)
{
assert(clause->bundle_count == 1);
assert((clause->bundles[0].fma != NULL) ^ (clause->bundles[0].add != NULL));
return clause->bundles[0].fma ? clause->bundles[0].fma
: clause->bundles[0].add;
}
static inline void
bi_insert_singleton(void *memctx, bi_clause *cursor, bi_block *block,
bi_instruction ins, bool before)
{
bi_instruction *uins = rzalloc(memctx, bi_instruction);
memcpy(uins, &ins, sizeof(ins));
/* Get the instruction to pivot around. Should be first/last of clause
* depending on before setting, those coincide for singletons */
bi_instruction *cursor_ins = bi_unwrap_singleton(cursor);
bi_clause *clause = bi_make_singleton(memctx, uins,
block, 0, (1 << 0), true);
if (before) {
list_addtail(&clause->link, &cursor->link);
list_addtail(&uins->link, &cursor_ins->link);
} else {
list_add(&clause->link, &cursor->link);
list_add(&uins->link, &cursor_ins->link);
}
}
/* If register allocation fails, find the best spill node */
static signed