Merge pull request #11916 from JosJuice/ppcanalyst-reorder-loop

PPCAnalyst: Reduce number of iterations in ReorderInstructionsCore
This commit is contained in:
Admiral H. Curtiss 2023-07-01 01:06:53 +02:00 committed by GitHub
commit ed4403537f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 57 additions and 35 deletions

View File

@ -470,27 +470,41 @@ static bool isCror(const CodeOp& a)
void PPCAnalyzer::ReorderInstructionsCore(u32 instructions, CodeOp* code, bool reverse, void PPCAnalyzer::ReorderInstructionsCore(u32 instructions, CodeOp* code, bool reverse,
ReorderType type) const ReorderType type) const
{ {
// Bubbling an instruction sometimes reveals another opportunity to bubble an instruction, so do
// multiple passes.
while (true)
{
// Instruction Reordering Pass // Instruction Reordering Pass
// Carry pass: bubble carry-using instructions as close to each other as possible, so we can // Carry pass: bubble carry-using instructions as close to each other as possible, so we can avoid
// avoid
// storing the carry flag. // storing the carry flag.
// Compare pass: bubble compare instructions next to branches, so they can be merged. // Compare pass: bubble compare instructions next to branches, so they can be merged.
bool swapped = false;
int increment = reverse ? -1 : 1; const int start = reverse ? instructions - 1 : 0;
int start = reverse ? instructions - 1 : 0; const int end = reverse ? 0 : instructions - 1;
int end = reverse ? 0 : instructions - 1; const int increment = reverse ? -1 : 1;
for (int i = start; i != end; i += increment)
int i = start;
int next = start;
bool go_backwards = false;
while (true)
{ {
if (go_backwards)
{
i -= increment;
go_backwards = false;
}
else
{
i = next;
next += increment;
}
if (i == end)
break;
CodeOp& a = code[i]; CodeOp& a = code[i];
CodeOp& b = code[i + increment]; CodeOp& b = code[i + increment];
// Reorder integer compares, rlwinm., and carry-affecting ops // Reorder integer compares, rlwinm., and carry-affecting ops
// (if we add more merged branch instructions, add them here!) // (if we add more merged branch instructions, add them here!)
if ((type == ReorderType::CROR && isCror(a)) || if ((type == ReorderType::CROR && isCror(a)) || (type == ReorderType::Carry && isCarryOp(a)) ||
(type == ReorderType::Carry && isCarryOp(a)) ||
(type == ReorderType::CMP && (isCmp(a) || a.outputCR[0]))) (type == ReorderType::CMP && (isCmp(a) || a.outputCR[0])))
{ {
// once we're next to a carry instruction, don't move away! // once we're next to a carry instruction, don't move away!
@ -499,23 +513,31 @@ void PPCAnalyzer::ReorderInstructionsCore(u32 instructions, CodeOp* code, bool r
// if we read the CA flag, and the previous instruction sets it, don't move away. // if we read the CA flag, and the previous instruction sets it, don't move away.
if (!reverse && (a.opinfo->flags & FL_READ_CA) && if (!reverse && (a.opinfo->flags & FL_READ_CA) &&
(code[i - increment].opinfo->flags & FL_SET_CA)) (code[i - increment].opinfo->flags & FL_SET_CA))
{
continue; continue;
}
// if we set the CA flag, and the next instruction reads it, don't move away. // if we set the CA flag, and the next instruction reads it, don't move away.
if (reverse && (a.opinfo->flags & FL_SET_CA) && if (reverse && (a.opinfo->flags & FL_SET_CA) &&
(code[i - increment].opinfo->flags & FL_READ_CA)) (code[i - increment].opinfo->flags & FL_READ_CA))
{
continue; continue;
} }
}
if (CanSwapAdjacentOps(a, b)) if (CanSwapAdjacentOps(a, b))
{ {
// Alright, let's bubble it! // Alright, let's bubble it!
std::swap(a, b); std::swap(a, b);
swapped = true;
if (i != start)
{
// Bubbling an instruction sometimes reveals another opportunity to bubble an instruction,
// so go one step backwards and check if we have such an opportunity.
go_backwards = true;
} }
} }
} }
if (!swapped)
return;
} }
} }