CrashDebugger.cpp revision 1d0be15f89cb5056e20e2d24faa8d6afb1573bca
1afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner//===- CrashDebugger.cpp - Debug compilation crashes ----------------------===// 23da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman// 37c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// The LLVM Compiler Infrastructure 47c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// 521c62da287237d39d0d95004881ea4baae3be6daChris Lattner// This file is distributed under the University of Illinois Open Source 621c62da287237d39d0d95004881ea4baae3be6daChris Lattner// License. See LICENSE.TXT for details. 73da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman// 87c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell//===----------------------------------------------------------------------===// 9afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner// 10afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner// This file defines the bugpoint internals that narrow down compilation crashes 11afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner// 12afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner//===----------------------------------------------------------------------===// 13afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 14afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner#include "BugDriver.h" 15f1b20d8620b05abaa52f40ac6d21f839b265fb00Chris Lattner#include "ToolRunner.h" 16aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include "ListReducer.h" 17e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner#include "llvm/Constants.h" 184e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling#include "llvm/DerivedTypes.h" 1947b14a4a6a455c7be169cfd312fcbe796f0ad426Misha Brukman#include "llvm/Instructions.h" 20e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Module.h" 21e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Pass.h" 22e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/PassManager.h" 23ef9b9a793949469cdaa4ab6d0173136229dcab7bReid Spencer#include "llvm/ValueSymbolTable.h" 24e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky#include "llvm/ADT/SmallPtrSet.h" 25286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/Analysis/Verifier.h" 26e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Support/CFG.h" 27286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/Transforms/Scalar.h" 28aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include "llvm/Transforms/Utils/Cloning.h" 29551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/FileUtilities.h" 307c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth#include "llvm/Support/CommandLine.h" 31aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include <set> 32fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattnerusing namespace llvm; 33afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 347c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharthnamespace { 357c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth cl::opt<bool> 367c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth KeepMain("keep-main", 377c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth cl::desc("Force function reduction to keep main"), 387c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth cl::init(false)); 3923d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin cl::opt<bool> 4023d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin NoGlobalRM ("disable-global-remove", 4123d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin cl::desc("Do not remove global variables"), 4223d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin cl::init(false)); 437c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth} 447c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth 45d0fde30ce850b78371fd1386338350591f9ff494Brian Gaekenamespace llvm { 4606905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner class ReducePassList : public ListReducer<const PassInfo*> { 47fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 48fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 4906905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner ReducePassList(BugDriver &bd) : BD(bd) {} 503da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 51fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // doTest - Return true iff running the "removed" passes succeeds, and 52fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // running the "Kept" passes fail when run on the output of the "removed" 53fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // passes. If we return true, we update the current module of bugpoint. 54fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // 55fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner virtual TestResult doTest(std::vector<const PassInfo*> &Removed, 56fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner std::vector<const PassInfo*> &Kept); 57fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 58fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 59aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 6006905db7d2a2b83c1b3236d5552629ada2d8d56dChris LattnerReducePassList::TestResult 6106905db7d2a2b83c1b3236d5552629ada2d8d56dChris LattnerReducePassList::doTest(std::vector<const PassInfo*> &Prefix, 6206905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner std::vector<const PassInfo*> &Suffix) { 635f76760c880e6d61c229d2058c5699b033caeae1Reid Spencer sys::Path PrefixOutput; 64b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner Module *OrigProgram = 0; 65aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (!Prefix.empty()) { 66ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking to see if these passes crash: " 67ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman << getPassesString(Prefix) << ": "; 685f76760c880e6d61c229d2058c5699b033caeae1Reid Spencer std::string PfxOutput; 695f76760c880e6d61c229d2058c5699b033caeae1Reid Spencer if (BD.runPasses(Prefix, PfxOutput)) 70aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return KeepPrefix; 71b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner 72dd04df0ec33a903ee7fc747701bafde622f77d8bReid Spencer PrefixOutput.set(PfxOutput); 73b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner OrigProgram = BD.Program; 74b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner 758b477ed579794ba6d76915d56b3f448a7dd20120Owen Anderson BD.Program = ParseInputFile(PrefixOutput.toString(), BD.getContext()); 76b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner if (BD.Program == 0) { 7765f57c233cd4499e2e8b52a503201e64edfd6a9eDan Gohman errs() << BD.getToolName() << ": Error reading bitcode file '" 7865f57c233cd4499e2e8b52a503201e64edfd6a9eDan Gohman << PrefixOutput << "'!\n"; 79b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner exit(1); 80b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner } 81a229c5cce75209047db32c6039aa0b0fd481f049Reid Spencer PrefixOutput.eraseFromDisk(); 82aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 83aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 84ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking to see if these passes crash: " 85ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman << getPassesString(Suffix) << ": "; 863da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 87aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (BD.runPasses(Suffix)) { 88aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner delete OrigProgram; // The suffix crashes alone... 89aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return KeepSuffix; 90aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 91aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 92aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Nothing failed, restore state... 93b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner if (OrigProgram) { 94b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner delete BD.Program; 95b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner BD.Program = OrigProgram; 96b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner } 97aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return NoFailure; 98aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner} 99aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 1004e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendlingnamespace { 1014e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// ReduceCrashingGlobalVariables - This works by removing the global 1024e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// variable's initializer and seeing if the program still crashes. If it 1034e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// does, then we keep that program and try again. 1044e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// 1054e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling class ReduceCrashingGlobalVariables : public ListReducer<GlobalVariable*> { 1064e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling BugDriver &BD; 1074e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling bool (*TestFn)(BugDriver &, Module *); 1084e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling public: 1094e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling ReduceCrashingGlobalVariables(BugDriver &bd, 1104e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling bool (*testFn)(BugDriver&, Module*)) 1114e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling : BD(bd), TestFn(testFn) {} 1124e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1134e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling virtual TestResult doTest(std::vector<GlobalVariable*>& Prefix, 1144e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling std::vector<GlobalVariable*>& Kept) { 1154e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling if (!Kept.empty() && TestGlobalVariables(Kept)) 1164e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling return KeepSuffix; 1174e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1184e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling if (!Prefix.empty() && TestGlobalVariables(Prefix)) 1194e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling return KeepPrefix; 1204e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1214e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling return NoFailure; 1224e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling } 1234e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1244e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling bool TestGlobalVariables(std::vector<GlobalVariable*>& GVs); 1254e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling }; 1264e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling} 1274e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1284e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendlingbool 1294e3be89cb5cde6e2df294c64db3bc28133b67594Bill WendlingReduceCrashingGlobalVariables::TestGlobalVariables( 1304e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling std::vector<GlobalVariable*>& GVs) { 1314e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Clone the program to try hacking it apart... 132df4613ced2d5d1025575f70a16f1fac9bcc2669dAndrew Lenharth DenseMap<const Value*, Value*> ValueMap; 133df4613ced2d5d1025575f70a16f1fac9bcc2669dAndrew Lenharth Module *M = CloneModule(BD.getProgram(), ValueMap); 1344e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1354e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Convert list to set for fast lookup... 1364e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling std::set<GlobalVariable*> GVSet; 1374e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1384e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling for (unsigned i = 0, e = GVs.size(); i != e; ++i) { 139df4613ced2d5d1025575f70a16f1fac9bcc2669dAndrew Lenharth GlobalVariable* CMGV = cast<GlobalVariable>(ValueMap[GVs[i]]); 1404e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling assert(CMGV && "Global Variable not in module?!"); 1414e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling GVSet.insert(CMGV); 1424e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling } 1434e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 144ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking for crash with only these global variables: "; 1454e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling PrintGlobalVariableList(GVs); 146ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << ": "; 1474e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1484e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Loop over and delete any global variables which we aren't supposed to be 1494e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // playing with... 1504e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling for (Module::global_iterator I = M->global_begin(), E = M->global_end(); 1514e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling I != E; ++I) 152028839db09eb47424cd3955471f2c32c68fee74dNick Lewycky if (I->hasInitializer() && !GVSet.count(I)) { 1534e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling I->setInitializer(0); 1544e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling I->setLinkage(GlobalValue::ExternalLinkage); 1554e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling } 1564e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1574e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Try running the hacked up program... 1584e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling if (TestFn(BD, M)) { 1594e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling BD.setNewProgram(M); // It crashed, keep the trimmed version... 1604e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1614e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Make sure to use global variable pointers that point into the now-current 1624e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // module. 1634e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling GVs.assign(GVSet.begin(), GVSet.end()); 1644e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling return true; 1654e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling } 1664e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 1674e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling delete M; 1684e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling return false; 1694e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling} 1704e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 171fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattnernamespace llvm { 1724e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// ReduceCrashingFunctions reducer - This works by removing functions and 1734e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// seeing if the program still crashes. If it does, then keep the newer, 1744e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// smaller program. 1754e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling /// 176efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner class ReduceCrashingFunctions : public ListReducer<Function*> { 177fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 1788b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*TestFn)(BugDriver &, Module *); 179fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 1808b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingFunctions(BugDriver &bd, 1818b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*testFn)(BugDriver &, Module *)) 1828b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner : BD(bd), TestFn(testFn) {} 1833da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 184efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner virtual TestResult doTest(std::vector<Function*> &Prefix, 185efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner std::vector<Function*> &Kept) { 186fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Kept.empty() && TestFuncs(Kept)) 187fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepSuffix; 188fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Prefix.empty() && TestFuncs(Prefix)) 189fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepPrefix; 190fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return NoFailure; 191fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner } 1923da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 193efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner bool TestFuncs(std::vector<Function*> &Prefix); 194fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 195fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 196aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 197efdc0b505712d1ca4460def27e51c430f033d58dChris Lattnerbool ReduceCrashingFunctions::TestFuncs(std::vector<Function*> &Funcs) { 1987c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth 1997c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth //if main isn't present, claim there is no problem 2004e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling if (KeepMain && find(Funcs.begin(), Funcs.end(), 201688b0490e22eb67623f5aaa24406209be74efcb2Reid Spencer BD.getProgram()->getFunction("main")) == Funcs.end()) 2027c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth return false; 2037c0a93785e283110ff05e4a95062990fd32a8389Andrew Lenharth 204cf00c4ab3ba308d45d98c5ccab87362cf802facbMisha Brukman // Clone the program to try hacking it apart... 205f6dd0eb5c4a1c4824d7f83fa39586478da618ffdDan Gohman DenseMap<const Value*, Value*> ValueMap; 206f6dd0eb5c4a1c4824d7f83fa39586478da618ffdDan Gohman Module *M = CloneModule(BD.getProgram(), ValueMap); 2073da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 208aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Convert list to set for fast lookup... 209aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::set<Function*> Functions; 210aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner for (unsigned i = 0, e = Funcs.size(); i != e; ++i) { 211f6dd0eb5c4a1c4824d7f83fa39586478da618ffdDan Gohman Function *CMF = cast<Function>(ValueMap[Funcs[i]]); 212aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner assert(CMF && "Function not in module?!"); 213ef9b9a793949469cdaa4ab6d0173136229dcab7bReid Spencer assert(CMF->getFunctionType() == Funcs[i]->getFunctionType() && "wrong ty"); 214f6dd0eb5c4a1c4824d7f83fa39586478da618ffdDan Gohman assert(CMF->getName() == Funcs[i]->getName() && "wrong name"); 215f607b79bc78fcbfd8cda01d2d5dbda6cd8253a40Chris Lattner Functions.insert(CMF); 216aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 217aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 218ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking for crash with only these functions: "; 219efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner PrintFunctionList(Funcs); 220ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << ": "; 221aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 222aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Loop over and delete any functions which we aren't supposed to be playing 223aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // with... 224aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) 2255cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (!I->isDeclaration() && !Functions.count(I)) 226aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner DeleteFunctionBody(I); 227aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 228aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Try running the hacked up program... 2298b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { 23006905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner BD.setNewProgram(M); // It crashed, keep the trimmed version... 231aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 232aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Make sure to use function pointers that point into the now-current 233aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // module. 234aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Funcs.assign(Functions.begin(), Functions.end()); 235aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return true; 236aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 23706905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; 238aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return false; 239aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner} 240aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 241640f22e66d90439857a97a83896ee68c4f7128c9Chris Lattner 242f913f40be8501738fa4bdcae2015dd196dcbfc50Chris Lattnernamespace { 243fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// ReduceCrashingBlocks reducer - This works by setting the terminators of 244fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// all terminators except the specified basic blocks to a 'ret' instruction, 245fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// then running the simplify-cfg pass. This has the effect of chopping up 246fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// the CFG really fast which can reduce large functions quickly. 247fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// 2488b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner class ReduceCrashingBlocks : public ListReducer<const BasicBlock*> { 249fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 2508b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*TestFn)(BugDriver &, Module *); 251fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 2528b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingBlocks(BugDriver &bd, bool (*testFn)(BugDriver &, Module *)) 2538b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner : BD(bd), TestFn(testFn) {} 2543da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 2558b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner virtual TestResult doTest(std::vector<const BasicBlock*> &Prefix, 2568b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::vector<const BasicBlock*> &Kept) { 257fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Kept.empty() && TestBlocks(Kept)) 258fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepSuffix; 259fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Prefix.empty() && TestBlocks(Prefix)) 260fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepPrefix; 261fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return NoFailure; 262fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner } 2633da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 2648b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool TestBlocks(std::vector<const BasicBlock*> &Prefix); 265fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 266fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 267286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 2688b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerbool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) { 269cf00c4ab3ba308d45d98c5ccab87362cf802facbMisha Brukman // Clone the program to try hacking it apart... 270ef0ff140a72c18893529c33cee8e7cd634b008bdDan Gohman DenseMap<const Value*, Value*> ValueMap; 271ef0ff140a72c18893529c33cee8e7cd634b008bdDan Gohman Module *M = CloneModule(BD.getProgram(), ValueMap); 2723da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 273286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Convert list to set for fast lookup... 274e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky SmallPtrSet<BasicBlock*, 8> Blocks; 275e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky for (unsigned i = 0, e = BBs.size(); i != e; ++i) 276e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky Blocks.insert(cast<BasicBlock>(ValueMap[BBs[i]])); 277286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 278ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking for crash with only these blocks:"; 27973b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner unsigned NumPrint = Blocks.size(); 28073b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner if (NumPrint > 10) NumPrint = 10; 28173b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner for (unsigned i = 0, e = NumPrint; i != e; ++i) 282ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << " " << BBs[i]->getName(); 28373b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner if (NumPrint < Blocks.size()) 284ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "... <" << Blocks.size() << " total>"; 285ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << ": "; 286286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 287286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Loop over and delete any hack up any blocks that are not listed... 288286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) 289286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (Function::iterator BB = I->begin(), E = I->end(); BB != E; ++BB) 2908bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) { 291286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Loop over all of the successors of this block, deleting any PHI nodes 292286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // that might include it. 293286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 294286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner (*SI)->removePredecessor(BB); 295286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 296e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner TerminatorInst *BBTerm = BB->getTerminator(); 297e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner 298e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner if (isa<StructType>(BBTerm->getType())) 299e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner BBTerm->replaceAllUsesWith(UndefValue::get(BBTerm->getType())); 3001d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson else if (BB->getTerminator()->getType() != 3011d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson Type::getVoidTy(BB->getContext())) 302a7235ea7245028a0723e8ab7fd011386b3900777Owen Anderson BBTerm->replaceAllUsesWith(Constant::getNullValue(BBTerm->getType())); 3038bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner 304e78109eb3a3d177d03cea40b46d9dcfc9bf32210Chris Lattner // Replace the old terminator instruction. 305286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BB->getInstList().pop_back(); 3061d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson new UnreachableInst(BB->getContext(), BB); 307286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 308286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 309286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // The CFG Simplifier pass may delete one of the basic blocks we are 310286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // interested in. If it does we need to take the block out of the list. Make 311286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // a "persistent mapping" by turning basic blocks into <function, name> pairs. 312286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // This won't work well if blocks are unnamed, but that is just the risk we 313286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // have to take. 314286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::vector<std::pair<Function*, std::string> > BlockInfo; 315286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 316e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky for (SmallPtrSet<BasicBlock*, 8>::iterator I = Blocks.begin(), 317e032590f58e400ba25e416da5bee10a85ad6d114Nick Lewycky E = Blocks.end(); I != E; ++I) 318286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BlockInfo.push_back(std::make_pair((*I)->getParent(), (*I)->getName())); 319286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 320286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Now run the CFG simplify pass on the function... 321286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner PassManager Passes; 322286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.add(createCFGSimplificationPass()); 323286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.add(createVerifierPass()); 324286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.run(*M); 325286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 326286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Try running on the hacked up program... 3278b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { 32806905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner BD.setNewProgram(M); // It crashed, keep the trimmed version... 329286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 330286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Make sure to use basic block pointers that point into the now-current 331286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // module, and that they don't include any deleted blocks. 332286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BBs.clear(); 333286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (unsigned i = 0, e = BlockInfo.size(); i != e; ++i) { 334ef9b9a793949469cdaa4ab6d0173136229dcab7bReid Spencer ValueSymbolTable &ST = BlockInfo[i].first->getValueSymbolTable(); 335ef9b9a793949469cdaa4ab6d0173136229dcab7bReid Spencer Value* V = ST.lookup(BlockInfo[i].second); 3361d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson if (V && V->getType() == Type::getLabelTy(V->getContext())) 337ef9b9a793949469cdaa4ab6d0173136229dcab7bReid Spencer BBs.push_back(cast<BasicBlock>(V)); 338286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 339286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner return true; 340286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 34106905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; // It didn't crash, try something else. 342286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner return false; 343286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner} 344286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 3454c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewyckynamespace { 3464c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky /// ReduceCrashingInstructions reducer - This works by removing the specified 3474c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky /// non-terminator instructions and replacing them with undef. 3484c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky /// 3494c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky class ReduceCrashingInstructions : public ListReducer<const Instruction*> { 3504c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky BugDriver &BD; 3514c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky bool (*TestFn)(BugDriver &, Module *); 3524c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky public: 3534c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky ReduceCrashingInstructions(BugDriver &bd, bool (*testFn)(BugDriver &, 3544c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Module *)) 3554c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky : BD(bd), TestFn(testFn) {} 3564c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 3574c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky virtual TestResult doTest(std::vector<const Instruction*> &Prefix, 3584c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky std::vector<const Instruction*> &Kept) { 3594c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (!Kept.empty() && TestInsts(Kept)) 3604c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky return KeepSuffix; 3614c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (!Prefix.empty() && TestInsts(Prefix)) 3624c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky return KeepPrefix; 3634c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky return NoFailure; 3644c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 3654c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 3664c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky bool TestInsts(std::vector<const Instruction*> &Prefix); 3674c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky }; 3684c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky} 3694c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 3704c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewyckybool ReduceCrashingInstructions::TestInsts(std::vector<const Instruction*> 3714c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky &Insts) { 3724c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Clone the program to try hacking it apart... 3734c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky DenseMap<const Value*, Value*> ValueMap; 3744c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Module *M = CloneModule(BD.getProgram(), ValueMap); 3754c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 3764c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Convert list to set for fast lookup... 3774c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky SmallPtrSet<Instruction*, 64> Instructions; 3784c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (unsigned i = 0, e = Insts.size(); i != e; ++i) { 3794c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky assert(!isa<TerminatorInst>(Insts[i])); 3804c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Instructions.insert(cast<Instruction>(ValueMap[Insts[i]])); 3814c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 3824c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 383ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking for crash with only " << Instructions.size(); 3844c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (Instructions.size() == 1) 385ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << " instruction: "; 3864c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky else 387ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << " instructions: "; 3884c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 3894c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (Module::iterator MI = M->begin(), ME = M->end(); MI != ME; ++MI) 3904c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (Function::iterator FI = MI->begin(), FE = MI->end(); FI != FE; ++FI) 3914c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (BasicBlock::iterator I = FI->begin(), E = FI->end(); I != E;) { 3924c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Instruction *Inst = I++; 3934c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (!Instructions.count(Inst) && !isa<TerminatorInst>(Inst)) { 3941d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson if (Inst->getType() != Type::getVoidTy(Inst->getContext())) 3954c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Inst->replaceAllUsesWith(UndefValue::get(Inst->getType())); 3964c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Inst->eraseFromParent(); 3974c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 3984c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 3994c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 4004c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Verify that this is still valid. 4014c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky PassManager Passes; 4024c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Passes.add(createVerifierPass()); 4034c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Passes.run(*M); 4044c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 4054c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Try running on the hacked up program... 4064c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (TestFn(BD, M)) { 4074c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky BD.setNewProgram(M); // It crashed, keep the trimmed version... 4084c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 4094c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Make sure to use instruction pointers that point into the now-current 4104c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // module, and that they don't include any deleted blocks. 4114c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Insts.clear(); 4124c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (SmallPtrSet<Instruction*, 64>::const_iterator I = Instructions.begin(), 4134c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky E = Instructions.end(); I != E; ++I) 4144c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Insts.push_back(*I); 4154c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky return true; 4164c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 4174c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky delete M; // It didn't crash, try something else. 4184c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky return false; 4194c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky} 4204c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 4218b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// DebugACrash - Given a predicate that determines whether a component crashes 4228b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// on a program, try to destructively reduce the program while still keeping 4238b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// the predicate true. 4248b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool DebugACrash(BugDriver &BD, bool (*TestFn)(BugDriver &, Module *)) { 4254e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // See if we can get away with nuking some of the global variable initializers 4265f73e38548c57636ad0ef8c719d040e166761962Chris Lattner // in the program... 42723d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin if (!NoGlobalRM && 42823d471f62eed3518fe7737dbccee52faec4ffe75Torok Edwin BD.getProgram()->global_begin() != BD.getProgram()->global_end()) { 4294e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // Now try to reduce the number of global variable initializers in the 4304e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling // module to something small. 431b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling Module *M = CloneModule(BD.getProgram()); 432b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling bool DeletedInit = false; 433b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling 434b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling for (Module::global_iterator I = M->global_begin(), E = M->global_end(); 435b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling I != E; ++I) 436b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (I->hasInitializer()) { 437b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling I->setInitializer(0); 438b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling I->setLinkage(GlobalValue::ExternalLinkage); 439b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling DeletedInit = true; 440b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling } 441b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling 442b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (!DeletedInit) { 443b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling delete M; // No change made... 444b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling } else { 445b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling // See if the program still causes a crash... 446ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\nChecking to see if we can delete global inits: "; 447b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling 448b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (TestFn(BD, M)) { // Still crashes? 449b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling BD.setNewProgram(M); 450ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Able to remove all global initializers!\n"; 451b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling } else { // No longer crashes? 452ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << " - Removing all global inits hides problem!\n"; 453b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling delete M; 454b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling 455b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling std::vector<GlobalVariable*> GVs; 4563da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 457b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling for (Module::global_iterator I = BD.getProgram()->global_begin(), 458b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling E = BD.getProgram()->global_end(); I != E; ++I) 459b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (I->hasInitializer()) 460b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling GVs.push_back(I); 4614e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 462b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (GVs.size() > 1 && !BugpointIsInterrupted) { 463ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Attempting to reduce the number of global " 464b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling << "variables in the testcase\n"; 4654e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 466b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling unsigned OldSize = GVs.size(); 467b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling ReduceCrashingGlobalVariables(BD, TestFn).reduceList(GVs); 4684e3be89cb5cde6e2df294c64db3bc28133b67594Bill Wendling 469b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling if (GVs.size() < OldSize) 4708ff70c2635bfd4e02c0140a5dc9ca909fffba35aGabor Greif BD.EmitProgressBitcode("reduced-global-variables"); 471b3d83a3ed5e99cc858141ee4da61fe9f80ec4b00Bill Wendling } 47222706e82d57fd37150d494881a8f90b4043d42a1Bill Wendling } 4735f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 4745f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 4753da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 476aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Now try to reduce the number of functions in the module to something small. 477efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner std::vector<Function*> Functions; 478efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner for (Module::iterator I = BD.getProgram()->begin(), 4798b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); I != E; ++I) 4805cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (!I->isDeclaration()) 481aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Functions.push_back(I); 482afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 483f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (Functions.size() > 1 && !BugpointIsInterrupted) { 484ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Attempting to reduce the number of functions " 485aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner "in the testcase\n"; 486afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 4878b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner unsigned OldSize = Functions.size(); 4888b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingFunctions(BD, TestFn).reduceList(Functions); 489afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 490f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (Functions.size() < OldSize) 4918ff70c2635bfd4e02c0140a5dc9ca909fffba35aGabor Greif BD.EmitProgressBitcode("reduced-function"); 492218e26ef3583cc3270f5f2a2b9cb1025e5b05ebeChris Lattner } 493218e26ef3583cc3270f5f2a2b9cb1025e5b05ebeChris Lattner 494286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Attempt to delete entire basic blocks at a time to speed up 495286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // convergence... this actually works by setting the terminator of the blocks 496286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // to a return instruction then running simplifycfg, which can potentially 497286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // shrinks the code dramatically quickly 498286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // 499f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (!DisableSimplifyCFG && !BugpointIsInterrupted) { 5008b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::vector<const BasicBlock*> Blocks; 5018b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Module::const_iterator I = BD.getProgram()->begin(), 5028b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); I != E; ++I) 5038b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Function::const_iterator FI = I->begin(), E = I->end(); FI !=E; ++FI) 50447ae4a1cee5eec5767a11403c0fac7c91ec45461Chris Lattner Blocks.push_back(FI); 5052c235010312f72622acd4b7bb70f87cf31a982f6Torok Edwin unsigned OldSize = Blocks.size(); 5068b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingBlocks(BD, TestFn).reduceList(Blocks); 5072c235010312f72622acd4b7bb70f87cf31a982f6Torok Edwin if (Blocks.size() < OldSize) 5082c235010312f72622acd4b7bb70f87cf31a982f6Torok Edwin BD.EmitProgressBitcode("reduced-blocks"); 50947ae4a1cee5eec5767a11403c0fac7c91ec45461Chris Lattner } 5106520785dcd22012535934098942d57c07c7631c2Chris Lattner 5114c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // Attempt to delete instructions using bisection. This should help out nasty 5124c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky // cases with large basic blocks where the problem is at one end. 5134c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (!BugpointIsInterrupted) { 5144c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky std::vector<const Instruction*> Insts; 5154c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (Module::const_iterator MI = BD.getProgram()->begin(), 5164c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky ME = BD.getProgram()->end(); MI != ME; ++MI) 5174c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (Function::const_iterator FI = MI->begin(), FE = MI->end(); FI != FE; 5184c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky ++FI) 5194c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky for (BasicBlock::const_iterator I = FI->begin(), E = FI->end(); 5204c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky I != E; ++I) 5214c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky if (!isa<TerminatorInst>(I)) 5224c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky Insts.push_back(I); 5234c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 5244c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky ReduceCrashingInstructions(BD, TestFn).reduceList(Insts); 5254c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky } 5264c8f9af6e0c264a99b41817b2ee78c2297930165Nick Lewycky 527aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // FIXME: This should use the list reducer to converge faster by deleting 528aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // larger chunks of instructions at a time! 529b2c180f04e4f71a29c8c4a2478179cb1ddd5d859Chris Lattner unsigned Simplification = 2; 5306520785dcd22012535934098942d57c07c7631c2Chris Lattner do { 531f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (BugpointIsInterrupted) break; 5326520785dcd22012535934098942d57c07c7631c2Chris Lattner --Simplification; 533ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Attempting to reduce testcase by deleting instruc" 534ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman << "tions: Simplification Level #" << Simplification << '\n'; 5356520785dcd22012535934098942d57c07c7631c2Chris Lattner 5365560c9d49ccae132cabf1155f18aa0480dce3edaMisha Brukman // Now that we have deleted the functions that are unnecessary for the 5375560c9d49ccae132cabf1155f18aa0480dce3edaMisha Brukman // program, try to remove instructions that are not necessary to cause the 5386520785dcd22012535934098942d57c07c7631c2Chris Lattner // crash. To do this, we loop through all of the instructions in the 5396520785dcd22012535934098942d57c07c7631c2Chris Lattner // remaining functions, deleting them (replacing any values produced with 5406520785dcd22012535934098942d57c07c7631c2Chris Lattner // nulls), and then running ADCE and SimplifyCFG. If the transformed input 5416520785dcd22012535934098942d57c07c7631c2Chris Lattner // still triggers failure, keep deleting until we cannot trigger failure 5426520785dcd22012535934098942d57c07c7631c2Chris Lattner // anymore. 5436520785dcd22012535934098942d57c07c7631c2Chris Lattner // 544f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner unsigned InstructionsToSkipBeforeDeleting = 0; 5456520785dcd22012535934098942d57c07c7631c2Chris Lattner TryAgain: 5463da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 5476520785dcd22012535934098942d57c07c7631c2Chris Lattner // Loop over all of the (non-terminator) instructions remaining in the 5486520785dcd22012535934098942d57c07c7631c2Chris Lattner // function, attempting to delete them. 549f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner unsigned CurInstructionNum = 0; 5508b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Module::const_iterator FI = BD.getProgram()->begin(), 5518b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); FI != E; ++FI) 5525cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (!FI->isDeclaration()) 5538b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Function::const_iterator BI = FI->begin(), E = FI->end(); BI != E; 5548b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ++BI) 5558b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (BasicBlock::const_iterator I = BI->begin(), E = --BI->end(); 556f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner I != E; ++I, ++CurInstructionNum) 557f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (InstructionsToSkipBeforeDeleting) { 558f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner --InstructionsToSkipBeforeDeleting; 559f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } else { 560f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (BugpointIsInterrupted) goto ExitLoops; 561f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner 562ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "Checking instruction: " << *I; 563f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner Module *M = BD.deleteInstructionFromProgram(I, Simplification); 5643da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 565f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // Find out if the pass still crashes on this pass... 566f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (TestFn(BD, M)) { 567f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // Yup, it does, we delete the old module, and continue trying 568f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // to reduce the testcase... 569f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner BD.setNewProgram(M); 570f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner InstructionsToSkipBeforeDeleting = CurInstructionNum; 571f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner goto TryAgain; // I wish I had a multi-level break here! 572f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } 5733da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 574f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // This pass didn't crash without this instruction, try the next 575f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // one. 576f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner delete M; 5776520785dcd22012535934098942d57c07c7631c2Chris Lattner } 578f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner 579f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (InstructionsToSkipBeforeDeleting) { 580f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner InstructionsToSkipBeforeDeleting = 0; 581f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner goto TryAgain; 582f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } 5833da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 5846520785dcd22012535934098942d57c07c7631c2Chris Lattner } while (Simplification); 585f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris LattnerExitLoops: 586ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 587ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner // Try to clean up the testcase by running funcresolve and globaldce... 588f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (!BugpointIsInterrupted) { 589ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Attempting to perform final cleanups: "; 590f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner Module *M = CloneModule(BD.getProgram()); 591f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner M = BD.performFinalCleanups(M, true); 5923da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman 593f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner // Find out if the pass still crashes on the cleaned up program... 594f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (TestFn(BD, M)) { 595f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner BD.setNewProgram(M); // Yup, it does, keep the reduced version... 596f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner } else { 597f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner delete M; 598f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner } 599ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner } 600ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 6018ff70c2635bfd4e02c0140a5dc9ca909fffba35aGabor Greif BD.EmitProgressBitcode("reduced-simplified"); 602ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 6033da94aec4d429b2ba0f65fa040c33650cade196bMisha Brukman return false; 6048b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 6058b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 6068b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool TestForOptimizerCrash(BugDriver &BD, Module *M) { 6078b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return BD.runPasses(M); 608afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner} 609d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 6108b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// debugOptimizerCrash - This method is called when some pass crashes on input. 6118b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// It attempts to prune down the testcase to something reasonable, and figure 6128b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// out exactly which pass is crashing. 6138b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// 6146a3f31cb707972ebde1e45a61fa8f5bcff132ebaPatrick Jenkinsbool BugDriver::debugOptimizerCrash(const std::string &ID) { 615ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Debugging optimizer crash!\n"; 6168b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 6178b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner // Reduce the list of passes which causes the optimizer to crash... 618f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner if (!BugpointIsInterrupted) 619f9aaae06cd2109082cda2b09ef3f23e0e1cff47bChris Lattner ReducePassList(*this).reduceList(PassesToRun); 6208b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 621ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman outs() << "\n*** Found crashing pass" 622ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman << (PassesToRun.size() == 1 ? ": " : "es: ") 623ac95cc79ac0b899d566cc29c0f646f39c2fa35c0Dan Gohman << getPassesString(PassesToRun) << '\n'; 624025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 6258ff70c2635bfd4e02c0140a5dc9ca909fffba35aGabor Greif EmitProgressBitcode(ID); 6268b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 6278b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return DebugACrash(*this, TestForOptimizerCrash); 6288b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 6298b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 6308b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool TestForCodeGenCrash(BugDriver &BD, Module *M) { 6318b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner try { 6328b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.compileProgram(M); 63365f57c233cd4499e2e8b52a503201e64edfd6a9eDan Gohman errs() << '\n'; 6348b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return false; 63583881957edee0b1cb89428fa1a3b022d7d84ee13Jeff Cohen } catch (ToolExecutionError &) { 63665f57c233cd4499e2e8b52a503201e64edfd6a9eDan Gohman errs() << "<crash>\n"; 6378b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return true; // Tool is still crashing. 6388b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner } 6398b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 640025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 641025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// debugCodeGeneratorCrash - This method is called when the code generator 642025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// crashes on an input. It attempts to reduce the input as much as possible 643025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// while still causing the code generator to crash. 644025262692a6710de29a48e2b3905672cd12d13d2Chris Lattnerbool BugDriver::debugCodeGeneratorCrash() { 64565f57c233cd4499e2e8b52a503201e64edfd6a9eDan Gohman errs() << "*** Debugging code generator crash!\n"; 646025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 6478b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return DebugACrash(*this, TestForCodeGenCrash); 648025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner} 649