blob: 29274c9df018c5e3a753b3232c0ba2194375705b [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
Brian Gaeked0fde302003-11-11 22:41:34 +000023namespace llvm {
24
Chris Lattnerfa761832004-01-14 03:38:37 +000025 class ReduceMiscompilingPasses : public ListReducer<const PassInfo*> {
26 BugDriver &BD;
27 public:
28 ReduceMiscompilingPasses(BugDriver &bd) : BD(bd) {}
29
30 virtual TestResult doTest(std::vector<const PassInfo*> &Prefix,
31 std::vector<const PassInfo*> &Suffix);
32 };
33}
Chris Lattner640f22e2003-04-24 17:02:17 +000034
35ReduceMiscompilingPasses::TestResult
Chris Lattner39aebca2003-04-24 22:24:22 +000036ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
Chris Lattner06943ad2003-04-25 03:16:05 +000037 std::vector<const PassInfo*> &Suffix) {
38 // First, run the program with just the Suffix passes. If it is still broken
Chris Lattner640f22e2003-04-24 17:02:17 +000039 // with JUST the kept passes, discard the prefix passes.
Chris Lattner06943ad2003-04-25 03:16:05 +000040 std::cout << "Checking to see if '" << getPassesString(Suffix)
Chris Lattner640f22e2003-04-24 17:02:17 +000041 << "' compile correctly: ";
42
43 std::string BytecodeResult;
Chris Lattner06943ad2003-04-25 03:16:05 +000044 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +000045 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +000046 << " on the input program!\n";
Chris Lattner5ef681c2003-10-17 23:07:47 +000047 BD.setPassesToRun(Suffix);
48 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +000049 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +000050 }
51
52 // Check to see if the finished program matches the reference output...
Misha Brukman50733362003-07-24 18:17:43 +000053 if (BD.diffProgram(BytecodeResult, "", true /*delete bytecode*/)) {
Chris Lattner640f22e2003-04-24 17:02:17 +000054 std::cout << "nope.\n";
55 return KeepSuffix; // Miscompilation detected!
56 }
57 std::cout << "yup.\n"; // No miscompilation!
58
59 if (Prefix.empty()) return NoFailure;
60
Chris Lattner06943ad2003-04-25 03:16:05 +000061 // Next, see if the program is broken if we run the "prefix" passes first,
Misha Brukmanbc0e9982003-07-14 17:20:40 +000062 // then separately run the "kept" passes.
Chris Lattner640f22e2003-04-24 17:02:17 +000063 std::cout << "Checking to see if '" << getPassesString(Prefix)
64 << "' compile correctly: ";
65
66 // If it is not broken with the kept passes, it's possible that the prefix
67 // passes must be run before the kept passes to break it. If the program
68 // WORKS after the prefix passes, but then fails if running the prefix AND
69 // kept passes, we can update our bytecode file to include the result of the
70 // prefix passes, then discard the prefix passes.
71 //
72 if (BD.runPasses(Prefix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +000073 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +000074 << " on the input program!\n";
Chris Lattner9c6cfe12003-10-17 23:03:16 +000075 BD.setPassesToRun(Prefix);
76 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +000077 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +000078 }
79
80 // If the prefix maintains the predicate by itself, only keep the prefix!
Misha Brukman50733362003-07-24 18:17:43 +000081 if (BD.diffProgram(BytecodeResult)) {
Chris Lattner640f22e2003-04-24 17:02:17 +000082 std::cout << "nope.\n";
83 removeFile(BytecodeResult);
84 return KeepPrefix;
85 }
86 std::cout << "yup.\n"; // No miscompilation!
87
88 // Ok, so now we know that the prefix passes work, try running the suffix
89 // passes on the result of the prefix passes.
90 //
91 Module *PrefixOutput = BD.ParseInputFile(BytecodeResult);
92 if (PrefixOutput == 0) {
93 std::cerr << BD.getToolName() << ": Error reading bytecode file '"
94 << BytecodeResult << "'!\n";
95 exit(1);
96 }
97 removeFile(BytecodeResult); // No longer need the file on disk
98
Chris Lattner06943ad2003-04-25 03:16:05 +000099 std::cout << "Checking to see if '" << getPassesString(Suffix)
Chris Lattner640f22e2003-04-24 17:02:17 +0000100 << "' passes compile correctly after the '"
101 << getPassesString(Prefix) << "' passes: ";
102
103 Module *OriginalInput = BD.Program;
104 BD.Program = PrefixOutput;
Chris Lattner06943ad2003-04-25 03:16:05 +0000105 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +0000106 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +0000107 << " on the input program!\n";
Chris Lattner5ef681c2003-10-17 23:07:47 +0000108 BD.setPassesToRun(Suffix);
Chris Lattner9c6cfe12003-10-17 23:03:16 +0000109 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +0000110 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +0000111 }
112
113 // Run the result...
Misha Brukman50733362003-07-24 18:17:43 +0000114 if (BD.diffProgram(BytecodeResult, "", true/*delete bytecode*/)) {
Chris Lattner640f22e2003-04-24 17:02:17 +0000115 std::cout << "nope.\n";
116 delete OriginalInput; // We pruned down the original input...
Chris Lattner06943ad2003-04-25 03:16:05 +0000117 return KeepSuffix;
Chris Lattner640f22e2003-04-24 17:02:17 +0000118 }
119
120 // Otherwise, we must not be running the bad pass anymore.
121 std::cout << "yup.\n"; // No miscompilation!
122 BD.Program = OriginalInput; // Restore original program
123 delete PrefixOutput; // Free experiment
124 return NoFailure;
125}
126
Chris Lattnerfa761832004-01-14 03:38:37 +0000127namespace llvm {
128 class ReduceMiscompilingFunctions : public ListReducer<Function*> {
129 BugDriver &BD;
130 public:
131 ReduceMiscompilingFunctions(BugDriver &bd) : BD(bd) {}
132
133 virtual TestResult doTest(std::vector<Function*> &Prefix,
134 std::vector<Function*> &Suffix) {
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000135 if (!Suffix.empty() && TestFuncs(Suffix))
Chris Lattnerfa761832004-01-14 03:38:37 +0000136 return KeepSuffix;
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000137 if (!Prefix.empty() && TestFuncs(Prefix))
Chris Lattnerfa761832004-01-14 03:38:37 +0000138 return KeepPrefix;
139 return NoFailure;
140 }
141
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000142 bool TestFuncs(const std::vector<Function*> &Prefix);
Chris Lattnerfa761832004-01-14 03:38:37 +0000143 };
144}
Chris Lattner640f22e2003-04-24 17:02:17 +0000145
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000146bool ReduceMiscompilingFunctions::TestFuncs(const std::vector<Function*>&Funcs){
Chris Lattner640f22e2003-04-24 17:02:17 +0000147 // Test to see if the function is misoptimized if we ONLY run it on the
148 // functions listed in Funcs.
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000149 std::cout << "Checking to see if the program is misoptimized when "
150 << (Funcs.size()==1 ? "this function is" : "these functions are")
151 << " run through the pass"
152 << (BD.PassesToRun.size() == 1 ? "" : "es") << ": ";
153 BD.PrintFunctionList(Funcs);
154 std::cout << "\n";
Chris Lattner640f22e2003-04-24 17:02:17 +0000155
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000156 // Split the module into the two halves of the program we want.
Chris Lattnerf913f402004-02-18 21:29:46 +0000157 Module *ToOptimize = CloneModule(BD.getProgram());
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000158 Module *ToNotOptimize = SplitFunctionsOutOfModule(ToOptimize, Funcs);
Chris Lattner640f22e2003-04-24 17:02:17 +0000159
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000160 // Run the optimization passes on ToOptimize, producing a transformed version
161 // of the functions being tested.
Chris Lattner640f22e2003-04-24 17:02:17 +0000162 Module *OldProgram = BD.Program;
163 BD.Program = ToOptimize;
164
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000165 std::cout << " Optimizing functions being tested: ";
Chris Lattner640f22e2003-04-24 17:02:17 +0000166 std::string BytecodeResult;
167 if (BD.runPasses(BD.PassesToRun, BytecodeResult, false/*delete*/,
168 true/*quiet*/)) {
Chris Lattner9f71e792003-10-18 00:05:05 +0000169 std::cerr << " Error running this sequence of passes"
Chris Lattner640f22e2003-04-24 17:02:17 +0000170 << " on the input program!\n";
Chris Lattner5ef681c2003-10-17 23:07:47 +0000171 BD.EmitProgressBytecode("pass-error", false);
Chris Lattner02526262004-02-18 21:02:04 +0000172 exit(BD.debugOptimizerCrash());
Chris Lattner640f22e2003-04-24 17:02:17 +0000173 }
174
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000175 std::cout << "done.\n";
Chris Lattner640f22e2003-04-24 17:02:17 +0000176
Chris Lattnerf913f402004-02-18 21:29:46 +0000177 delete BD.getProgram(); // Delete the old "ToOptimize" module
Chris Lattner640f22e2003-04-24 17:02:17 +0000178 BD.Program = BD.ParseInputFile(BytecodeResult);
179
Chris Lattner640f22e2003-04-24 17:02:17 +0000180 if (BD.Program == 0) {
181 std::cerr << BD.getToolName() << ": Error reading bytecode file '"
182 << BytecodeResult << "'!\n";
183 exit(1);
184 }
185 removeFile(BytecodeResult); // No longer need the file on disk
186
187 // Seventh step: Link the optimized part of the program back to the
188 // unoptimized part of the program.
189 //
190 if (LinkModules(BD.Program, ToNotOptimize, &BytecodeResult)) {
191 std::cerr << BD.getToolName() << ": Error linking modules together:"
192 << BytecodeResult << "\n";
193 exit(1);
194 }
195 delete ToNotOptimize; // We are done with this module...
196
Chris Lattner640f22e2003-04-24 17:02:17 +0000197 std::cout << " Checking to see if the merged program executes correctly: ";
198
199 // Eighth step: Execute the program. If it does not match the expected
200 // output, then 'Funcs' are being misoptimized!
Misha Brukman50733362003-07-24 18:17:43 +0000201 bool Broken = BD.diffProgram();
Chris Lattner640f22e2003-04-24 17:02:17 +0000202
Chris Lattnerf913f402004-02-18 21:29:46 +0000203 delete BD.Program; // Delete the hacked up program
Chris Lattner640f22e2003-04-24 17:02:17 +0000204 BD.Program = OldProgram; // Restore the original
205
Chris Lattnerde9750d2003-12-07 02:43:09 +0000206 std::cout << (Broken ? " nope.\n" : " yup.\n");
Chris Lattner640f22e2003-04-24 17:02:17 +0000207 return Broken;
208}
209
Chris Lattner4a106452002-12-23 23:50:16 +0000210/// debugMiscompilation - This method is used when the passes selected are not
211/// crashing, but the generated output is semantically different from the
212/// input.
213///
214bool BugDriver::debugMiscompilation() {
Chris Lattner4a106452002-12-23 23:50:16 +0000215 // Make sure something was miscompiled...
Misha Brukmanbe6bf562003-07-30 20:15:56 +0000216 if (!ReduceMiscompilingPasses(*this).reduceList(PassesToRun)) {
Chris Lattner4a106452002-12-23 23:50:16 +0000217 std::cerr << "*** Optimized program matches reference output! No problem "
218 << "detected...\nbugpoint can't help you with your problem!\n";
219 return false;
220 }
221
Chris Lattner640f22e2003-04-24 17:02:17 +0000222 std::cout << "\n*** Found miscompiling pass"
223 << (PassesToRun.size() == 1 ? "" : "es") << ": "
224 << getPassesString(PassesToRun) << "\n";
225 EmitProgressBytecode("passinput");
Chris Lattner4a106452002-12-23 23:50:16 +0000226
Chris Lattner640f22e2003-04-24 17:02:17 +0000227 // Okay, now that we have reduced the list of passes which are causing the
228 // failure, see if we can pin down which functions are being
229 // miscompiled... first build a list of all of the non-external functions in
230 // the program.
231 std::vector<Function*> MiscompiledFunctions;
232 for (Module::iterator I = Program->begin(), E = Program->end(); I != E; ++I)
233 if (!I->isExternal())
234 MiscompiledFunctions.push_back(I);
235
236 // Do the reduction...
237 ReduceMiscompilingFunctions(*this).reduceList(MiscompiledFunctions);
238
Chris Lattnerde9750d2003-12-07 02:43:09 +0000239 std::cout << "\n*** The following function"
240 << (MiscompiledFunctions.size() == 1 ? " is" : "s are")
241 << " being miscompiled: ";
Chris Lattner640f22e2003-04-24 17:02:17 +0000242 PrintFunctionList(MiscompiledFunctions);
243 std::cout << "\n";
244
245 // Output a bunch of bytecode files for the user...
Chris Lattnerbe21ca52004-03-14 19:27:19 +0000246 std::cout << "Outputting reduced bytecode files which expose the problem:\n";
247 Module *ToOptimize = CloneModule(getProgram());
248 Module *ToNotOptimize = SplitFunctionsOutOfModule(ToOptimize,
249 MiscompiledFunctions);
250
251 std::cout << " Non-optimized portion: ";
252 std::swap(Program, ToNotOptimize);
253 EmitProgressBytecode("tonotoptimize", true);
254 setNewProgram(ToNotOptimize); // Delete hacked module.
255
256 std::cout << " Portion that is input to optimizer: ";
257 std::swap(Program, ToOptimize);
258 EmitProgressBytecode("tooptimize");
259 setNewProgram(ToOptimize); // Delete hacked module.
Chris Lattner4a106452002-12-23 23:50:16 +0000260
Chris Lattner4a106452002-12-23 23:50:16 +0000261 return false;
262}
Brian Gaeked0fde302003-11-11 22:41:34 +0000263