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

ir3/spill: Fix simplify_phi_nodes with multiple loop nesting

Browse source 
Once we simplified a phi node, we never updated the definition it points
to, which meant that it could become out of date if that definition were
also simplified, and we didn't check that when rewriting sources. That
could happen when there are multiple nested loops with phi nodes at the
header.

Fix it by updating the phi's pointer. Since we always update sources
after visiting the definition it points to, when we go to rewrite a
source, if that source points to a simplified phi, the phi's pointer
can't be pointing to a simplified phi because we already visited the phi
earlier in the pass and updated it, or else it's been simplified in the
meantime and this isn't the last pass. This way we don't need to
keep recursing when rewriting sources.

Fixes: 613eaac7b5 ("ir3: Initial support for spilling non-shared registers")
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/15035>
(cherry picked from commit 3ef858a6f6)
This commit is contained in:
Connor Abbott 2021-11-24 17:51:19 +01:00 • committed by Eric Engestrom
parent abba5cdf86
commit 7b99e1d859
2 changed files with 33 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
.pick_status.json
View file

@ -2245,7 +2245,7 @@
"description": "ir3/spill: Fix simplify_phi_nodes with multiple loop nesting",
"nominated": true,
"nomination_type": 1,
"resolution": 0,
"resolution": 1,
"main_sha": null,
"because_sha": "613eaac7b53bfbfcd6ef536412be6c9c63cdea4f"
},

42
src/freedreno/ir3/ir3_spill.c
View file

@ -1783,15 +1783,31 @@ simplify_phi_node(struct ir3_instruction *phi)
return true;
}
static struct ir3_register *
simplify_phi_def(struct ir3_register *def)
{
if (def->instr->opc == OPC_META_PHI) {
struct ir3_instruction *phi = def->instr;
/* Note: this function is always called at least once after visiting the
* phi, so either there has been a simplified phi in the meantime, in
* which case we will set progress=true and visit the definition again, or
* phi->data already has the most up-to-date value. Therefore we don't
* have to recursively check phi->data.
*/
if (phi->data)
return phi->data;
}
return def;
}
static void
simplify_phi_srcs(struct ir3_instruction *instr)
{
foreach_src (src, instr) {
if (src->def && src->def->instr->opc == OPC_META_PHI) {
struct ir3_instruction *phi = src->def->instr;
if (phi->data)
src->def = phi->data;
}
if (src->def)
src->def = simplify_phi_def(src->def);
}
}
@ -1821,6 +1837,10 @@ simplify_phi_nodes(struct ir3 *ir)
simplify_phi_srcs(instr);
}
/* Visit phi nodes in the sucessors to make sure that phi sources are
* always visited at least once after visiting the definition they
* point to. See note in simplify_phi_def() for why this is necessary.
*/
for (unsigned i = 0; i < 2; i++) {
struct ir3_block *succ = block->successors[i];
if (!succ)
@ -1828,11 +1848,13 @@ simplify_phi_nodes(struct ir3 *ir)
foreach_instr (instr, &succ->instr_list) {
if (instr->opc != OPC_META_PHI)
break;
if (instr->flags & IR3_INSTR_UNUSED)
continue;
simplify_phi_srcs(instr);
progress |= simplify_phi_node(instr);
if (instr->flags & IR3_INSTR_UNUSED) {
if (instr->data)
instr->data = simplify_phi_def(instr->data);
} else {
simplify_phi_srcs(instr);
progress |= simplify_phi_node(instr);
}
}
}
}