CrashDebugger.cpp revision 47b14a4a6a455c7be169cfd312fcbe796f0ad426
1afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner//===- CrashDebugger.cpp - Debug compilation crashes ----------------------===// 27c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// 37c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// The LLVM Compiler Infrastructure 47c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// 57c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// This file was developed by the LLVM research group and is distributed under 67c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// the University of Illinois Open Source License. See LICENSE.TXT for details. 77c0e022c5c4be4b11e199a53f73bbdd84e34aa80John Criswell// 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" 15aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include "ListReducer.h" 16286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/Constant.h" 1747b14a4a6a455c7be169cfd312fcbe796f0ad426Misha Brukman#include "llvm/Instructions.h" 18e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Module.h" 19e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Pass.h" 20e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/PassManager.h" 21286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/SymbolTable.h" 22e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Type.h" 23286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/Analysis/Verifier.h" 24e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Bytecode/Writer.h" 25e49603d79d220a795bd50684c8b1f503ee40f97fMisha Brukman#include "llvm/Support/CFG.h" 268b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner#include "llvm/Support/ToolRunner.h" 27286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner#include "llvm/Transforms/Scalar.h" 28aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include "llvm/Transforms/Utils/Cloning.h" 293d9cafa003a114bf9974bc80d5b69b0ed1d29290Misha Brukman#include "Support/FileUtilities.h" 30afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner#include <fstream> 31aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner#include <set> 32fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattnerusing namespace llvm; 33afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 34d0fde30ce850b78371fd1386338350591f9ff494Brian Gaekenamespace llvm { 3506905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner class ReducePassList : public ListReducer<const PassInfo*> { 36fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 37fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 3806905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner ReducePassList(BugDriver &bd) : BD(bd) {} 39fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner 40fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // doTest - Return true iff running the "removed" passes succeeds, and 41fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // running the "Kept" passes fail when run on the output of the "removed" 42fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // passes. If we return true, we update the current module of bugpoint. 43fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner // 44fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner virtual TestResult doTest(std::vector<const PassInfo*> &Removed, 45fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner std::vector<const PassInfo*> &Kept); 46fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 47fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 48aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 4906905db7d2a2b83c1b3236d5552629ada2d8d56dChris LattnerReducePassList::TestResult 5006905db7d2a2b83c1b3236d5552629ada2d8d56dChris LattnerReducePassList::doTest(std::vector<const PassInfo*> &Prefix, 5106905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner std::vector<const PassInfo*> &Suffix) { 52aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::string PrefixOutput; 53b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner Module *OrigProgram = 0; 54aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (!Prefix.empty()) { 55aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::cout << "Checking to see if these passes crash: " 56aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner << getPassesString(Prefix) << ": "; 57aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (BD.runPasses(Prefix, PrefixOutput)) 58aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return KeepPrefix; 59b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner 60b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner OrigProgram = BD.Program; 61b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner 62efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner BD.Program = ParseInputFile(PrefixOutput); 63b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner if (BD.Program == 0) { 64b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner std::cerr << BD.getToolName() << ": Error reading bytecode file '" 65b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner << PrefixOutput << "'!\n"; 66b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner exit(1); 67b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner } 68b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner removeFile(PrefixOutput); 69aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 70aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 71aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::cout << "Checking to see if these passes crash: " 72aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner << getPassesString(Suffix) << ": "; 73b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner 74aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (BD.runPasses(Suffix)) { 75aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner delete OrigProgram; // The suffix crashes alone... 76aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return KeepSuffix; 77aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 78aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 79aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Nothing failed, restore state... 80b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner if (OrigProgram) { 81b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner delete BD.Program; 82b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner BD.Program = OrigProgram; 83b417c795d2a8832b5edac321dc0d19eca7e3f2f5Chris Lattner } 84aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return NoFailure; 85aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner} 86aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 87fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattnernamespace llvm { 88efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner class ReduceCrashingFunctions : public ListReducer<Function*> { 89fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 908b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*TestFn)(BugDriver &, Module *); 91fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 928b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingFunctions(BugDriver &bd, 938b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*testFn)(BugDriver &, Module *)) 948b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner : BD(bd), TestFn(testFn) {} 95fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner 96efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner virtual TestResult doTest(std::vector<Function*> &Prefix, 97efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner std::vector<Function*> &Kept) { 98fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Kept.empty() && TestFuncs(Kept)) 99fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepSuffix; 100fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Prefix.empty() && TestFuncs(Prefix)) 101fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepPrefix; 102fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return NoFailure; 103fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner } 104fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner 105efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner bool TestFuncs(std::vector<Function*> &Prefix); 106fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 107fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 108aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 109efdc0b505712d1ca4460def27e51c430f033d58dChris Lattnerbool ReduceCrashingFunctions::TestFuncs(std::vector<Function*> &Funcs) { 110cf00c4ab3ba308d45d98c5ccab87362cf802facbMisha Brukman // Clone the program to try hacking it apart... 11106905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner Module *M = CloneModule(BD.getProgram()); 112aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 113aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Convert list to set for fast lookup... 114aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::set<Function*> Functions; 115aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner for (unsigned i = 0, e = Funcs.size(); i != e; ++i) { 116aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Function *CMF = M->getFunction(Funcs[i]->getName(), 117aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Funcs[i]->getFunctionType()); 118aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner assert(CMF && "Function not in module?!"); 119f607b79bc78fcbfd8cda01d2d5dbda6cd8253a40Chris Lattner Functions.insert(CMF); 120aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 121aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 122efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner std::cout << "Checking for crash with only these functions: "; 123efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner PrintFunctionList(Funcs); 124aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::cout << ": "; 125aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 126aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Loop over and delete any functions which we aren't supposed to be playing 127aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // with... 128aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) 129f607b79bc78fcbfd8cda01d2d5dbda6cd8253a40Chris Lattner if (!I->isExternal() && !Functions.count(I)) 130aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner DeleteFunctionBody(I); 131aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 132aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Try running the hacked up program... 1338b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { 13406905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner BD.setNewProgram(M); // It crashed, keep the trimmed version... 135aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 136aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Make sure to use function pointers that point into the now-current 137aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // module. 138aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Funcs.assign(Functions.begin(), Functions.end()); 139aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return true; 140aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner } 14106905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; 142aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner return false; 143aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner} 144aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 145640f22e66d90439857a97a83896ee68c4f7128c9Chris Lattner 146f913f40be8501738fa4bdcae2015dd196dcbfc50Chris Lattnernamespace { 147fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// ReduceCrashingBlocks reducer - This works by setting the terminators of 148fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// all terminators except the specified basic blocks to a 'ret' instruction, 149fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// then running the simplify-cfg pass. This has the effect of chopping up 150fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// the CFG really fast which can reduce large functions quickly. 151fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner /// 1528b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner class ReduceCrashingBlocks : public ListReducer<const BasicBlock*> { 153fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner BugDriver &BD; 1548b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool (*TestFn)(BugDriver &, Module *); 155fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner public: 1568b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingBlocks(BugDriver &bd, bool (*testFn)(BugDriver &, Module *)) 1578b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner : BD(bd), TestFn(testFn) {} 158286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 1598b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner virtual TestResult doTest(std::vector<const BasicBlock*> &Prefix, 1608b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::vector<const BasicBlock*> &Kept) { 161fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Kept.empty() && TestBlocks(Kept)) 162fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepSuffix; 163fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner if (!Prefix.empty() && TestBlocks(Prefix)) 164fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return KeepPrefix; 165fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner return NoFailure; 166fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner } 167286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 1688b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner bool TestBlocks(std::vector<const BasicBlock*> &Prefix); 169fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner }; 170fa76183e8e28985dfd17b1d6291c939dab4cbe1dChris Lattner} 171286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 1728b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerbool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) { 173cf00c4ab3ba308d45d98c5ccab87362cf802facbMisha Brukman // Clone the program to try hacking it apart... 17406905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner Module *M = CloneModule(BD.getProgram()); 175286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 176286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Convert list to set for fast lookup... 177286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::set<BasicBlock*> Blocks; 178286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (unsigned i = 0, e = BBs.size(); i != e; ++i) { 179286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Convert the basic block from the original module to the new module... 1808b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner const Function *F = BBs[i]->getParent(); 181286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Function *CMF = M->getFunction(F->getName(), F->getFunctionType()); 182286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner assert(CMF && "Function not in module?!"); 183286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 184286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Get the mapped basic block... 185286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Function::iterator CBI = CMF->begin(); 1868b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::advance(CBI, std::distance(F->begin(), 1878b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner Function::const_iterator(BBs[i]))); 188286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Blocks.insert(CBI); 189286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 190286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 191286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::cout << "Checking for crash with only these blocks:"; 19273b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner unsigned NumPrint = Blocks.size(); 19373b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner if (NumPrint > 10) NumPrint = 10; 19473b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner for (unsigned i = 0, e = NumPrint; i != e; ++i) 195286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::cout << " " << BBs[i]->getName(); 19673b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner if (NumPrint < Blocks.size()) 19773b96bd52d9361d5c947e4fb660a46e498f7b407Chris Lattner std::cout << "... <" << Blocks.size() << " total>"; 198286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::cout << ": "; 199286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 200286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Loop over and delete any hack up any blocks that are not listed... 201286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) 202286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (Function::iterator BB = I->begin(), E = I->end(); BB != E; ++BB) 2038bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) { 204286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Loop over all of the successors of this block, deleting any PHI nodes 205286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // that might include it. 206286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 207286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner (*SI)->removePredecessor(BB); 208286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 2098bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner if (BB->getTerminator()->getType() != Type::VoidTy) 2108bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner BB->getTerminator()->replaceAllUsesWith( 2118bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner Constant::getNullValue(BB->getTerminator()->getType())); 2128bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner 213286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Delete the old terminator instruction... 214286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BB->getInstList().pop_back(); 215286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 216286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Add a new return instruction of the appropriate type... 217286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner const Type *RetTy = BB->getParent()->getReturnType(); 2188bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner new ReturnInst(RetTy == Type::VoidTy ? 0 : 2198bc098be0cce48dcc08fea746d28011cac79eef6Chris Lattner Constant::getNullValue(RetTy), BB); 220286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 221286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 222286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // The CFG Simplifier pass may delete one of the basic blocks we are 223286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // interested in. If it does we need to take the block out of the list. Make 224286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // a "persistent mapping" by turning basic blocks into <function, name> pairs. 225286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // This won't work well if blocks are unnamed, but that is just the risk we 226286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // have to take. 227286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner std::vector<std::pair<Function*, std::string> > BlockInfo; 228286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 229286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (std::set<BasicBlock*>::iterator I = Blocks.begin(), E = Blocks.end(); 230286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner I != E; ++I) 231286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BlockInfo.push_back(std::make_pair((*I)->getParent(), (*I)->getName())); 232286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 233286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Now run the CFG simplify pass on the function... 234286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner PassManager Passes; 235286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.add(createCFGSimplificationPass()); 236286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.add(createVerifierPass()); 237286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner Passes.run(*M); 238286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 239286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Try running on the hacked up program... 2408b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { 24106905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner BD.setNewProgram(M); // It crashed, keep the trimmed version... 242286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 243286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Make sure to use basic block pointers that point into the now-current 244286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // module, and that they don't include any deleted blocks. 245286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner BBs.clear(); 246286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner for (unsigned i = 0, e = BlockInfo.size(); i != e; ++i) { 247286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner SymbolTable &ST = BlockInfo[i].first->getSymbolTable(); 2489231ac8b6f2c3f9877bdb7a223f7392061258ab6Reid Spencer SymbolTable::plane_iterator PI = ST.find(Type::LabelTy); 2499231ac8b6f2c3f9877bdb7a223f7392061258ab6Reid Spencer if (PI != ST.plane_end() && PI->second.count(BlockInfo[i].second)) 2509231ac8b6f2c3f9877bdb7a223f7392061258ab6Reid Spencer BBs.push_back(cast<BasicBlock>(PI->second[BlockInfo[i].second])); 251286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 252286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner return true; 253286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner } 25406905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; // It didn't crash, try something else. 255286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner return false; 256286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner} 257286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner 2588b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// DebugACrash - Given a predicate that determines whether a component crashes 2598b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// on a program, try to destructively reduce the program while still keeping 2608b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// the predicate true. 2618b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool DebugACrash(BugDriver &BD, bool (*TestFn)(BugDriver &, Module *)) { 262aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner bool AnyReduction = false; 2635f73e38548c57636ad0ef8c719d040e166761962Chris Lattner 2645f73e38548c57636ad0ef8c719d040e166761962Chris Lattner // See if we can get away with nuking all of the global variable initializers 2655f73e38548c57636ad0ef8c719d040e166761962Chris Lattner // in the program... 2668b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (BD.getProgram()->gbegin() != BD.getProgram()->gend()) { 2678b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner Module *M = CloneModule(BD.getProgram()); 2685f73e38548c57636ad0ef8c719d040e166761962Chris Lattner bool DeletedInit = false; 2695f73e38548c57636ad0ef8c719d040e166761962Chris Lattner for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) 2705f73e38548c57636ad0ef8c719d040e166761962Chris Lattner if (I->hasInitializer()) { 2715f73e38548c57636ad0ef8c719d040e166761962Chris Lattner I->setInitializer(0); 2725f73e38548c57636ad0ef8c719d040e166761962Chris Lattner I->setLinkage(GlobalValue::ExternalLinkage); 2735f73e38548c57636ad0ef8c719d040e166761962Chris Lattner DeletedInit = true; 2745f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 2755f73e38548c57636ad0ef8c719d040e166761962Chris Lattner 2765f73e38548c57636ad0ef8c719d040e166761962Chris Lattner if (!DeletedInit) { 2775f73e38548c57636ad0ef8c719d040e166761962Chris Lattner delete M; // No change made... 2785f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } else { 2795f73e38548c57636ad0ef8c719d040e166761962Chris Lattner // See if the program still causes a crash... 2805f73e38548c57636ad0ef8c719d040e166761962Chris Lattner std::cout << "\nChecking to see if we can delete global inits: "; 2818b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { // Still crashes? 2828b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.setNewProgram(M); 2835f73e38548c57636ad0ef8c719d040e166761962Chris Lattner AnyReduction = true; 2845f73e38548c57636ad0ef8c719d040e166761962Chris Lattner std::cout << "\n*** Able to remove all global initializers!\n"; 2855f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } else { // No longer crashes? 2865f73e38548c57636ad0ef8c719d040e166761962Chris Lattner std::cout << " - Removing all global inits hides problem!\n"; 28706905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; 2885f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 2895f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 2905f73e38548c57636ad0ef8c719d040e166761962Chris Lattner } 291aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner 292aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // Now try to reduce the number of functions in the module to something small. 293efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner std::vector<Function*> Functions; 294efdc0b505712d1ca4460def27e51c430f033d58dChris Lattner for (Module::iterator I = BD.getProgram()->begin(), 2958b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); I != E; ++I) 296afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner if (!I->isExternal()) 297aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner Functions.push_back(I); 298afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 299aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (Functions.size() > 1) { 300aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner std::cout << "\n*** Attempting to reduce the number of functions " 301aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner "in the testcase\n"; 302afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 3038b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner unsigned OldSize = Functions.size(); 3048b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingFunctions(BD, TestFn).reduceList(Functions); 305afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner 306aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner if (Functions.size() < OldSize) { 3078b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.EmitProgressBytecode("reduced-function"); 308aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner AnyReduction = true; 3096520785dcd22012535934098942d57c07c7631c2Chris Lattner } 310218e26ef3583cc3270f5f2a2b9cb1025e5b05ebeChris Lattner } 311218e26ef3583cc3270f5f2a2b9cb1025e5b05ebeChris Lattner 312286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // Attempt to delete entire basic blocks at a time to speed up 313286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // convergence... this actually works by setting the terminator of the blocks 314286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // to a return instruction then running simplifycfg, which can potentially 315286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // shrinks the code dramatically quickly 316286921e8d21d4f0655905ed278d0e140829c7d1fChris Lattner // 31747ae4a1cee5eec5767a11403c0fac7c91ec45461Chris Lattner if (!DisableSimplifyCFG) { 3188b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::vector<const BasicBlock*> Blocks; 3198b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Module::const_iterator I = BD.getProgram()->begin(), 3208b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); I != E; ++I) 3218b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Function::const_iterator FI = I->begin(), E = I->end(); FI !=E; ++FI) 32247ae4a1cee5eec5767a11403c0fac7c91ec45461Chris Lattner Blocks.push_back(FI); 3238b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReduceCrashingBlocks(BD, TestFn).reduceList(Blocks); 32447ae4a1cee5eec5767a11403c0fac7c91ec45461Chris Lattner } 3256520785dcd22012535934098942d57c07c7631c2Chris Lattner 326aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // FIXME: This should use the list reducer to converge faster by deleting 327aae33f9137e4a64394d8f9fe66611ae53a0ef4e8Chris Lattner // larger chunks of instructions at a time! 328b2c180f04e4f71a29c8c4a2478179cb1ddd5d859Chris Lattner unsigned Simplification = 2; 3296520785dcd22012535934098942d57c07c7631c2Chris Lattner do { 3306520785dcd22012535934098942d57c07c7631c2Chris Lattner --Simplification; 3316520785dcd22012535934098942d57c07c7631c2Chris Lattner std::cout << "\n*** Attempting to reduce testcase by deleting instruc" 332eed80e23751ecc50c1fa5604f67be4b826d5b417Misha Brukman << "tions: Simplification Level #" << Simplification << '\n'; 3336520785dcd22012535934098942d57c07c7631c2Chris Lattner 3345560c9d49ccae132cabf1155f18aa0480dce3edaMisha Brukman // Now that we have deleted the functions that are unnecessary for the 3355560c9d49ccae132cabf1155f18aa0480dce3edaMisha Brukman // program, try to remove instructions that are not necessary to cause the 3366520785dcd22012535934098942d57c07c7631c2Chris Lattner // crash. To do this, we loop through all of the instructions in the 3376520785dcd22012535934098942d57c07c7631c2Chris Lattner // remaining functions, deleting them (replacing any values produced with 3386520785dcd22012535934098942d57c07c7631c2Chris Lattner // nulls), and then running ADCE and SimplifyCFG. If the transformed input 3396520785dcd22012535934098942d57c07c7631c2Chris Lattner // still triggers failure, keep deleting until we cannot trigger failure 3406520785dcd22012535934098942d57c07c7631c2Chris Lattner // anymore. 3416520785dcd22012535934098942d57c07c7631c2Chris Lattner // 342f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner unsigned InstructionsToSkipBeforeDeleting = 0; 3436520785dcd22012535934098942d57c07c7631c2Chris Lattner TryAgain: 3446520785dcd22012535934098942d57c07c7631c2Chris Lattner 3456520785dcd22012535934098942d57c07c7631c2Chris Lattner // Loop over all of the (non-terminator) instructions remaining in the 3466520785dcd22012535934098942d57c07c7631c2Chris Lattner // function, attempting to delete them. 347f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner unsigned CurInstructionNum = 0; 3488b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Module::const_iterator FI = BD.getProgram()->begin(), 3498b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner E = BD.getProgram()->end(); FI != E; ++FI) 350f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (!FI->isExternal()) 3518b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (Function::const_iterator BI = FI->begin(), E = FI->end(); BI != E; 3528b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ++BI) 3538b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner for (BasicBlock::const_iterator I = BI->begin(), E = --BI->end(); 354f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner I != E; ++I, ++CurInstructionNum) 355f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (InstructionsToSkipBeforeDeleting) { 356f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner --InstructionsToSkipBeforeDeleting; 357f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } else { 358f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner std::cout << "Checking instruction '" << I->getName() << "': "; 359f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner Module *M = BD.deleteInstructionFromProgram(I, Simplification); 360f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner 361f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // Find out if the pass still crashes on this pass... 362f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (TestFn(BD, M)) { 363f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // Yup, it does, we delete the old module, and continue trying 364f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // to reduce the testcase... 365f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner BD.setNewProgram(M); 366f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner AnyReduction = true; 367f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner InstructionsToSkipBeforeDeleting = CurInstructionNum; 368f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner goto TryAgain; // I wish I had a multi-level break here! 369f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } 370f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner 371f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // This pass didn't crash without this instruction, try the next 372f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner // one. 373f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner delete M; 3746520785dcd22012535934098942d57c07c7631c2Chris Lattner } 375f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner 376f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner if (InstructionsToSkipBeforeDeleting) { 377f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner InstructionsToSkipBeforeDeleting = 0; 378f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner goto TryAgain; 379f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner } 380f66d9069cff9ee8b3658b92d3a13d04d198ada91Chris Lattner 3816520785dcd22012535934098942d57c07c7631c2Chris Lattner } while (Simplification); 382ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 383ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner // Try to clean up the testcase by running funcresolve and globaldce... 384898e0e42e3c09e9f2098bf9a83720b5a33b52fc7Chris Lattner std::cout << "\n*** Attempting to perform final cleanups: "; 3858b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner Module *M = CloneModule(BD.getProgram()); 3868b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner M = BD.performFinalCleanups(M, true); 387ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 388898e0e42e3c09e9f2098bf9a83720b5a33b52fc7Chris Lattner // Find out if the pass still crashes on the cleaned up program... 3898b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner if (TestFn(BD, M)) { 3908b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.setNewProgram(M); // Yup, it does, keep the reduced version... 391898e0e42e3c09e9f2098bf9a83720b5a33b52fc7Chris Lattner AnyReduction = true; 392898e0e42e3c09e9f2098bf9a83720b5a33b52fc7Chris Lattner } else { 39306905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner delete M; 394ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner } 395ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 396f607b79bc78fcbfd8cda01d2d5dbda6cd8253a40Chris Lattner if (AnyReduction) 3978b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.EmitProgressBytecode("reduced-simplified"); 398ba386d943f4a83095d9c625cb0d46c1afe45ed1fChris Lattner 3998b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return false; 4008b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 4018b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 4028b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool TestForOptimizerCrash(BugDriver &BD, Module *M) { 4038b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return BD.runPasses(M); 404afade9294af43c6b947b9aeaa1555883d5f853e3Chris Lattner} 405d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 4068b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// debugOptimizerCrash - This method is called when some pass crashes on input. 4078b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// It attempts to prune down the testcase to something reasonable, and figure 4088b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// out exactly which pass is crashing. 4098b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner/// 4108b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerbool BugDriver::debugOptimizerCrash() { 4118b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::cout << "\n*** Debugging optimizer crash!\n"; 4128b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 4138b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner // Reduce the list of passes which causes the optimizer to crash... 4148b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner unsigned OldSize = PassesToRun.size(); 4158b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner ReducePassList(*this).reduceList(PassesToRun); 4168b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 4178b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::cout << "\n*** Found crashing pass" 4188b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner << (PassesToRun.size() == 1 ? ": " : "es: ") 419eed80e23751ecc50c1fa5604f67be4b826d5b417Misha Brukman << getPassesString(PassesToRun) << '\n'; 420025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 4218b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner EmitProgressBytecode("passinput"); 4228b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 4238b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return DebugACrash(*this, TestForOptimizerCrash); 4248b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 4258b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner 4268b189277bde5f617405dded0bbd6583e6665f4dfChris Lattnerstatic bool TestForCodeGenCrash(BugDriver &BD, Module *M) { 4278b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner try { 428eed80e23751ecc50c1fa5604f67be4b826d5b417Misha Brukman std::cerr << '\n'; 4298b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner BD.compileProgram(M); 430eed80e23751ecc50c1fa5604f67be4b826d5b417Misha Brukman std::cerr << '\n'; 4318b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return false; 4328b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner } catch (ToolExecutionError &TEE) { 4338b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner std::cerr << "<crash>\n"; 4348b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return true; // Tool is still crashing. 4358b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner } 4368b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner} 437025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 438025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// debugCodeGeneratorCrash - This method is called when the code generator 439025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// crashes on an input. It attempts to reduce the input as much as possible 440025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner/// while still causing the code generator to crash. 441025262692a6710de29a48e2b3905672cd12d13d2Chris Lattnerbool BugDriver::debugCodeGeneratorCrash() { 44206905db7d2a2b83c1b3236d5552629ada2d8d56dChris Lattner std::cerr << "*** Debugging code generator crash!\n"; 443025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner 4448b189277bde5f617405dded0bbd6583e6665f4dfChris Lattner return DebugACrash(*this, TestForCodeGenCrash); 445025262692a6710de29a48e2b3905672cd12d13d2Chris Lattner} 446