blob: 6524f7a8aead1bd3b5a7bc614a268a0ac9ebfc6d [file] [log] [blame]
Chris Lattner4a106452002-12-23 23:50:16 +00001//===- Miscompilation.cpp - Debug program miscompilations -----------------===//
John Criswell7c0e0222003-10-20 17:47:21 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
Chris Lattner4a106452002-12-23 23:50:16 +00009//
10// This file implements program miscompilation debugging support.
11//
12//===----------------------------------------------------------------------===//
13
14#include "BugDriver.h"
Chris Lattner126840f2003-04-24 20:16:29 +000015#include "ListReducer.h"
Chris Lattner4a106452002-12-23 23:50:16 +000016#include "llvm/Module.h"
Misha Brukmane49603d2003-08-07 21:19:30 +000017#include "llvm/Pass.h"
Chris Lattner640f22e2003-04-24 17:02:17 +000018#include "llvm/Transforms/Utils/Cloning.h"
19#include "llvm/Transforms/Utils/Linker.h"
Misha Brukman3d9cafa2003-08-07 21:42:28 +000020#include "Support/FileUtilities.h"
Chris Lattnerfa761832004-01-14 03:38:37 +000021using namespace llvm;
Chris Lattner4a106452002-12-23 23:50:16 +000022
Chris Lattnerefdc0b52004-03-14 20:50:42 +000023namespace {
Chris Lattnerfa761832004-01-14 03:38:37 +000024 class ReduceMiscompilingPasses : public ListReducer<const PassInfo*> {
25 BugDriver &BD;
26 public:
27 ReduceMiscompilingPasses(BugDriver &bd) : BD(bd) {}
28
29 virtual TestResult doTest(std::vector<const PassInfo*> &Prefix,
30 std::vector<const PassInfo*> &Suffix);
31 };
32}
Chris Lattner640f22e2003-04-24 17:02:17 +000033
34ReduceMiscompilingPasses::TestResult
Chris Lattner39aebca2003-04-24 22:24:22 +000035ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
Chris Lattner06943ad2003-04-25 03:16:05 +000036 std::vector<const PassInfo*> &Suffix) {
37 // First, run the program with just the Suffix passes. If it is still broken
Chris Lattner640f22e2003-04-24 17:02:17 +000038 // with JUST the kept passes, discard the prefix passes.
Chris Lattner06943ad2003-04-25 03:16:05 +000039 std::cout << "Checking to see if '" << getPassesString(Suffix)
Chris Lattner640f22e2003-04-24 17:02:17 +000040 << "' compile correctly: ";
41
42 std::string BytecodeResult;
Chris Lattner06943ad2003-04-25 03:16:05 +000043 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +000044 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +000045 << " on the input program!\n";
Chris Lattner5ef681c2003-10-17 23:07:47 +000046 BD.setPassesToRun(Suffix);
47 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +000048 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +000049 }
50
51 // Check to see if the finished program matches the reference output...
Misha Brukman50733362003-07-24 18:17:43 +000052 if (BD.diffProgram(BytecodeResult, "", true /*delete bytecode*/)) {
Chris Lattner640f22e2003-04-24 17:02:17 +000053 std::cout << "nope.\n";
54 return KeepSuffix; // Miscompilation detected!
55 }
56 std::cout << "yup.\n"; // No miscompilation!
57
58 if (Prefix.empty()) return NoFailure;
59
Chris Lattner06943ad2003-04-25 03:16:05 +000060 // Next, see if the program is broken if we run the "prefix" passes first,
Misha Brukmanbc0e9982003-07-14 17:20:40 +000061 // then separately run the "kept" passes.
Chris Lattner640f22e2003-04-24 17:02:17 +000062 std::cout << "Checking to see if '" << getPassesString(Prefix)
63 << "' compile correctly: ";
64
65 // If it is not broken with the kept passes, it's possible that the prefix
66 // passes must be run before the kept passes to break it. If the program
67 // WORKS after the prefix passes, but then fails if running the prefix AND
68 // kept passes, we can update our bytecode file to include the result of the
69 // prefix passes, then discard the prefix passes.
70 //
71 if (BD.runPasses(Prefix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +000072 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +000073 << " on the input program!\n";
Chris Lattner9c6cfe12003-10-17 23:03:16 +000074 BD.setPassesToRun(Prefix);
75 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +000076 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +000077 }
78
79 // If the prefix maintains the predicate by itself, only keep the prefix!
Misha Brukman50733362003-07-24 18:17:43 +000080 if (BD.diffProgram(BytecodeResult)) {
Chris Lattner640f22e2003-04-24 17:02:17 +000081 std::cout << "nope.\n";
82 removeFile(BytecodeResult);
83 return KeepPrefix;
84 }
85 std::cout << "yup.\n"; // No miscompilation!
86
87 // Ok, so now we know that the prefix passes work, try running the suffix
88 // passes on the result of the prefix passes.
89 //
Chris Lattnerefdc0b52004-03-14 20:50:42 +000090 Module *PrefixOutput = ParseInputFile(BytecodeResult);
Chris Lattner640f22e2003-04-24 17:02:17 +000091 if (PrefixOutput == 0) {
92 std::cerr << BD.getToolName() << ": Error reading bytecode file '"
93 << BytecodeResult << "'!\n";
94 exit(1);
95 }
96 removeFile(BytecodeResult); // No longer need the file on disk
97
Chris Lattner06943ad2003-04-25 03:16:05 +000098 std::cout << "Checking to see if '" << getPassesString(Suffix)
Chris Lattner640f22e2003-04-24 17:02:17 +000099 << "' passes compile correctly after the '"
100 << getPassesString(Prefix) << "' passes: ";
101
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000102 Module *OriginalInput = BD.swapProgramIn(PrefixOutput);
Chris Lattner06943ad2003-04-25 03:16:05 +0000103 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +0000104 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +0000105 << " on the input program!\n";
Chris Lattner5ef681c2003-10-17 23:07:47 +0000106 BD.setPassesToRun(Suffix);
Chris Lattner9c6cfe12003-10-17 23:03:16 +0000107 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +0000108 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +0000109 }
110
111 // Run the result...
Misha Brukman50733362003-07-24 18:17:43 +0000112 if (BD.diffProgram(BytecodeResult, "", true/*delete bytecode*/)) {
Chris Lattner640f22e2003-04-24 17:02:17 +0000113 std::cout << "nope.\n";
114 delete OriginalInput; // We pruned down the original input...
Chris Lattner06943ad2003-04-25 03:16:05 +0000115 return KeepSuffix;
Chris Lattner640f22e2003-04-24 17:02:17 +0000116 }
117
118 // Otherwise, we must not be running the bad pass anymore.
119 std::cout << "yup.\n"; // No miscompilation!
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000120 delete BD.swapProgramIn(OriginalInput); // Restore orig program & free test
Chris Lattner640f22e2003-04-24 17:02:17 +0000121 return NoFailure;
122}
123
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000124namespace {
Chris Lattnerfa761832004-01-14 03:38:37 +0000125 class ReduceMiscompilingFunctions : public ListReducer<Function*> {
126 BugDriver &BD;
127 public:
128 ReduceMiscompilingFunctions(BugDriver &bd) : BD(bd) {}
129
130 virtual TestResult doTest(std::vector<Function*> &Prefix,
131 std::vector<Function*> &Suffix) {
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000132 if (!Suffix.empty() && TestFuncs(Suffix))
Chris Lattnerfa761832004-01-14 03:38:37 +0000133 return KeepSuffix;
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000134 if (!Prefix.empty() && TestFuncs(Prefix))
Chris Lattnerfa761832004-01-14 03:38:37 +0000135 return KeepPrefix;
136 return NoFailure;
137 }
138
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000139 bool TestFuncs(const std::vector<Function*> &Prefix);
Chris Lattnerfa761832004-01-14 03:38:37 +0000140 };
141}
Chris Lattner640f22e2003-04-24 17:02:17 +0000142
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000143/// TestMergedProgram - Given two modules, link them together and run the
144/// program, checking to see if the program matches the diff. If the diff
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000145/// matches, return false, otherwise return true. If the DeleteInputs argument
146/// is set to true then this function deletes both input modules before it
147/// returns.
148static bool TestMergedProgram(BugDriver &BD, Module *M1, Module *M2,
149 bool DeleteInputs) {
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000150 // Link the two portions of the program back to together.
151 std::string ErrorMsg;
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000152 if (!DeleteInputs) M1 = CloneModule(M1);
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000153 if (LinkModules(M1, M2, &ErrorMsg)) {
154 std::cerr << BD.getToolName() << ": Error linking modules together:"
155 << ErrorMsg << "\n";
156 exit(1);
157 }
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000158 if (DeleteInputs) delete M2; // We are done with this module...
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000159
160 Module *OldProgram = BD.swapProgramIn(M1);
161
162 // Execute the program. If it does not match the expected output, we must
163 // return true.
164 bool Broken = BD.diffProgram();
165
166 // Delete the linked module & restore the original
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000167 BD.swapProgramIn(OldProgram);
168 if (DeleteInputs) delete M1;
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000169 return Broken;
170}
171
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000172bool ReduceMiscompilingFunctions::TestFuncs(const std::vector<Function*>&Funcs){
Chris Lattner640f22e2003-04-24 17:02:17 +0000173 // Test to see if the function is misoptimized if we ONLY run it on the
174 // functions listed in Funcs.
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000175 std::cout << "Checking to see if the program is misoptimized when "
176 << (Funcs.size()==1 ? "this function is" : "these functions are")
177 << " run through the pass"
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000178 << (BD.getPassesToRun().size() == 1 ? "" : "es") << ":";
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000179 PrintFunctionList(Funcs);
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000180 std::cout << "\n";
Chris Lattner640f22e2003-04-24 17:02:17 +0000181
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000182 // Split the module into the two halves of the program we want.
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000183 Module *ToNotOptimize = CloneModule(BD.getProgram());
184 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize, Funcs);
Chris Lattner640f22e2003-04-24 17:02:17 +0000185
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000186 // Run the optimization passes on ToOptimize, producing a transformed version
187 // of the functions being tested.
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000188 std::cout << " Optimizing functions being tested: ";
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000189 Module *Optimized = BD.runPassesOn(ToOptimize, BD.getPassesToRun(),
190 /*AutoDebugCrashes*/true);
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000191 std::cout << "done.\n";
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000192 delete ToOptimize;
Chris Lattner640f22e2003-04-24 17:02:17 +0000193
Chris Lattner640f22e2003-04-24 17:02:17 +0000194
Chris Lattner640f22e2003-04-24 17:02:17 +0000195 std::cout << " Checking to see if the merged program executes correctly: ";
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000196 bool Broken = TestMergedProgram(BD, Optimized, ToNotOptimize, true);
Chris Lattnerde9750d2003-12-07 02:43:09 +0000197 std::cout << (Broken ? " nope.\n" : " yup.\n");
Chris Lattner640f22e2003-04-24 17:02:17 +0000198 return Broken;
199}
200
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000201/// ExtractLoops - Given a reduced list of functions that still exposed the bug,
202/// check to see if we can extract the loops in the region without obscuring the
203/// bug. If so, it reduces the amount of code identified.
204static bool ExtractLoops(BugDriver &BD,
205 std::vector<Function*> &MiscompiledFunctions) {
206 bool MadeChange = false;
207 while (1) {
208 Module *ToNotOptimize = CloneModule(BD.getProgram());
209 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize,
210 MiscompiledFunctions);
211 Module *ToOptimizeLoopExtracted = BD.ExtractLoop(ToOptimize);
212 if (!ToOptimizeLoopExtracted) {
213 // If the loop extractor crashed or if there were no extractible loops,
214 // then this chapter of our odyssey is over with.
215 delete ToNotOptimize;
216 delete ToOptimize;
217 return MadeChange;
218 }
219
220 std::cerr << "Extracted a loop from the breaking portion of the program.\n";
221 delete ToOptimize;
222
223 // Bugpoint is intentionally not very trusting of LLVM transformations. In
224 // particular, we're not going to assume that the loop extractor works, so
225 // we're going to test the newly loop extracted program to make sure nothing
226 // has broken. If something broke, then we'll inform the user and stop
227 // extraction.
228 if (TestMergedProgram(BD, ToOptimizeLoopExtracted, ToNotOptimize, false)) {
229 // Merged program doesn't work anymore!
230 std::cerr << " *** ERROR: Loop extraction broke the program. :("
231 << " Please report a bug!\n";
232 std::cerr << " Continuing on with un-loop-extracted version.\n";
233 delete ToNotOptimize;
234 delete ToOptimizeLoopExtracted;
235 return MadeChange;
236 }
237
238 // Okay, the loop extractor didn't break the program. Run the series of
239 // optimizations on the loop extracted portion and see if THEY still break
240 // the program. If so, it was safe to extract these loops!
241 std::cout << " Running optimizations on loop extracted portion: ";
242 Module *Optimized = BD.runPassesOn(ToOptimizeLoopExtracted,
243 BD.getPassesToRun(),
244 /*AutoDebugCrashes*/true);
245 std::cout << "done.\n";
246
247 std::cout << " Checking to see if the merged program executes correctly: ";
Chris Lattner002dbdd2004-03-16 01:51:54 +0000248 bool Broken = TestMergedProgram(BD, Optimized, ToNotOptimize, false);
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000249 delete Optimized;
250 if (!Broken) {
251 std::cout << "yup: loop extraction masked the problem. Undoing.\n";
252 // If the program is not still broken, then loop extraction did something
253 // that masked the error. Stop loop extraction now.
254 delete ToNotOptimize;
255 delete ToOptimizeLoopExtracted;
256 return MadeChange;
257 }
258 std::cout << "nope: loop extraction successful!\n";
259
260 // Okay, great! Now we know that we extracted a loop and that loop
261 // extraction both didn't break the program, and didn't mask the problem.
262 // Replace the current program with the loop extracted version, and try to
263 // extract another loop.
264 std::string ErrorMsg;
265 if (LinkModules(ToNotOptimize, ToOptimizeLoopExtracted, &ErrorMsg)) {
266 std::cerr << BD.getToolName() << ": Error linking modules together:"
267 << ErrorMsg << "\n";
268 exit(1);
269 }
270 delete ToOptimizeLoopExtracted;
Chris Lattnerd3a533d2004-03-17 17:42:09 +0000271
272 // All of the Function*'s in the MiscompiledFunctions list are in the old
273 // module. Make sure to update them to point to the corresponding functions
274 // in the new module.
275 for (unsigned i = 0, e = MiscompiledFunctions.size(); i != e; ++i) {
276 Function *OldF = MiscompiledFunctions[i];
277 Function *NewF =
278 ToNotOptimize->getFunction(OldF->getName(), OldF->getFunctionType());
279 MiscompiledFunctions[i] = NewF;
280 }
281
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000282 BD.setNewProgram(ToNotOptimize);
283 MadeChange = true;
284 }
285}
286
Chris Lattner4a106452002-12-23 23:50:16 +0000287/// debugMiscompilation - This method is used when the passes selected are not
288/// crashing, but the generated output is semantically different from the
289/// input.
290///
291bool BugDriver::debugMiscompilation() {
Chris Lattner4a106452002-12-23 23:50:16 +0000292 // Make sure something was miscompiled...
Misha Brukmanbe6bf562003-07-30 20:15:56 +0000293 if (!ReduceMiscompilingPasses(*this).reduceList(PassesToRun)) {
Chris Lattner4a106452002-12-23 23:50:16 +0000294 std::cerr << "*** Optimized program matches reference output! No problem "
295 << "detected...\nbugpoint can't help you with your problem!\n";
296 return false;
297 }
298
Chris Lattner640f22e2003-04-24 17:02:17 +0000299 std::cout << "\n*** Found miscompiling pass"
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000300 << (getPassesToRun().size() == 1 ? "" : "es") << ": "
301 << getPassesString(getPassesToRun()) << "\n";
Chris Lattner640f22e2003-04-24 17:02:17 +0000302 EmitProgressBytecode("passinput");
Chris Lattner4a106452002-12-23 23:50:16 +0000303
Chris Lattner640f22e2003-04-24 17:02:17 +0000304 // Okay, now that we have reduced the list of passes which are causing the
305 // failure, see if we can pin down which functions are being
306 // miscompiled... first build a list of all of the non-external functions in
307 // the program.
308 std::vector<Function*> MiscompiledFunctions;
309 for (Module::iterator I = Program->begin(), E = Program->end(); I != E; ++I)
310 if (!I->isExternal())
311 MiscompiledFunctions.push_back(I);
312
313 // Do the reduction...
314 ReduceMiscompilingFunctions(*this).reduceList(MiscompiledFunctions);
315
Chris Lattnerde9750d2003-12-07 02:43:09 +0000316 std::cout << "\n*** The following function"
317 << (MiscompiledFunctions.size() == 1 ? " is" : "s are")
318 << " being miscompiled: ";
Chris Lattner640f22e2003-04-24 17:02:17 +0000319 PrintFunctionList(MiscompiledFunctions);
320 std::cout << "\n";
321
Chris Lattnera1cf1c82004-03-14 22:08:00 +0000322 // See if we can rip any loops out of the miscompiled functions and still
323 // trigger the problem.
324 if (ExtractLoops(*this, MiscompiledFunctions)) {
325 // Okay, we extracted some loops and the problem still appears. See if we
326 // can eliminate some of the created functions from being candidates.
327
328 // Do the reduction...
329 ReduceMiscompilingFunctions(*this).reduceList(MiscompiledFunctions);
330
331 std::cout << "\n*** The following function"
332 << (MiscompiledFunctions.size() == 1 ? " is" : "s are")
333 << " being miscompiled: ";
334 PrintFunctionList(MiscompiledFunctions);
335 std::cout << "\n";
336 }
337
Chris Lattner640f22e2003-04-24 17:02:17 +0000338 // Output a bunch of bytecode files for the user...
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000339 std::cout << "Outputting reduced bytecode files which expose the problem:\n";
Chris Lattnerefdc0b52004-03-14 20:50:42 +0000340 Module *ToNotOptimize = CloneModule(getProgram());
341 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize,
342 MiscompiledFunctions);
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000343
344 std::cout << " Non-optimized portion: ";
345 std::swap(Program, ToNotOptimize);
346 EmitProgressBytecode("tonotoptimize", true);
347 setNewProgram(ToNotOptimize); // Delete hacked module.
348
349 std::cout << " Portion that is input to optimizer: ";
350 std::swap(Program, ToOptimize);
351 EmitProgressBytecode("tooptimize");
352 setNewProgram(ToOptimize); // Delete hacked module.
Chris Lattner4a106452002-12-23 23:50:16 +0000353
Chris Lattner4a106452002-12-23 23:50:16 +0000354 return false;
355}
Brian Gaeked0fde302003-11-11 22:41:34 +0000356