RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-11 05:35:11 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Diagnose non-structural differences in the case where blocks were

Browse Source 
structurally identical.



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@109743 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
John McCall 2010-07-29 09:04:45 +00:00
parent 02e116cb06
commit e2921432b6
1 changed files with 16 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
tools/llvm-diff/DifferenceEngine.cpp
View File

@ -194,7 +194,7 @@ class FunctionDifferenceEngine {
// If the instructions differ, start the more sophisticated diff
// algorithm at the start of the block.
if (diff(LeftI, RightI, false, true)) {
if (diff(LeftI, RightI, false, false)) {
TentativeValues.clear();
return runBlockDiff(L->begin(), R->begin());
}
@ -207,11 +207,22 @@ class FunctionDifferenceEngine {
} while (LI != LE); // This is sufficient: we can't get equality of
// terminators if there are residual instructions.
// Make all the tentative pairs solid.
for (llvm::DenseSet<std::pair<Value*,Value*> >::iterator
I = TentativeValues.begin(), E = TentativeValues.end(); I != E; ++I)
Values[I->first] = I->second;
TentativeValues.clear();
// Do another pass over the block, this time in complaints mode.
LI = L->begin(); RI = R->begin();
do {
assert(LI != LE && RI != RE);
bool Result = diff(&*LI, &*RI, true, true);
assert(!Result && "structural differences second time around?");
(void) Result;
// Make the mapping non-tentative this time.
if (!LI->use_empty())
Values[&*LI] = &*RI;
++LI, ++RI;
} while (LI != LE);
}
bool matchForBlockDiff(Instruction *L, Instruction *R);