From 236c1ac873be983ccde36bc8af049e48ce40b50c Mon Sep 17 00:00:00 2001 From: "Duncan P. N. Exon Smith" Date: Fri, 1 Aug 2014 22:52:06 +0000 Subject: [PATCH] verify-uselistorder: Make the verification logic easier to reuse git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@214587 91177308-0d34-0410-b5e6-96231b3b80d8 --- .../verify-uselistorder/verify-uselistorder.cpp | 16 ++++++++++------ 1 file changed, 10 insertions(+), 6 deletions(-) diff --git a/tools/verify-uselistorder/verify-uselistorder.cpp b/tools/verify-uselistorder/verify-uselistorder.cpp index a9666ac5284..7b81b4f516c 100644 --- a/tools/verify-uselistorder/verify-uselistorder.cpp +++ b/tools/verify-uselistorder/verify-uselistorder.cpp @@ -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; -- 2.34.1