RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-26 23:38:31 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

verify-uselistorder: Make the verification logic easier to reuse

Browse Source 
llvm-svn: 214587
This commit is contained in:
Duncan P. N. Exon Smith 2014-08-01 22:52:06 +00:00
parent 48a07cae49
commit 6c93809cf2
1 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
tools/verify-uselistorder/verify-uselistorder.cpp
View File

@ -359,6 +359,15 @@ static bool verifyAssemblyUseListOrder(const Module &M) {
return matches(ValueMapping(M), ValueMapping(*OtherM));
}
static void verifyUseListOrder(const Module &M) {
if (!verifyBitcodeUseListOrder(M))
report_fatal_error("bitcode use-list order changed");
if (shouldPreserveAssemblyUseListOrder())
if (!verifyAssemblyUseListOrder(M))
report_fatal_error("assembly use-list order changed");
}
int main(int argc, char **argv) {
sys::PrintStackTraceOnErrorSignal();
llvm::PrettyStackTraceProgram X(argc, argv);
@ -397,12 +406,7 @@ int main(int argc, char **argv) {
// Shuffle with a different seed each time so that use-lists that aren't
// modified the first time are likely to be modified the next time.
shuffleUseLists(*M, I);
if (!verifyBitcodeUseListOrder(*M))
report_fatal_error("bitcode use-list order changed");
if (shouldPreserveAssemblyUseListOrder())
if (!verifyAssemblyUseListOrder(*M))
report_fatal_error("assembly use-list order changed");
verifyUseListOrder(*M);
}
return 0;