1 //===- Miscompilation.cpp - Debug program miscompilations -----------------===//
3 // The LLVM Compiler Infrastructure
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.
8 //===----------------------------------------------------------------------===//
10 // This file implements optimizer and code generation miscompilation debugging
13 //===----------------------------------------------------------------------===//
15 #include "BugDriver.h"
16 #include "ListReducer.h"
17 #include "llvm/Constants.h"
18 #include "llvm/DerivedTypes.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Module.h"
21 #include "llvm/Pass.h"
22 #include "llvm/Analysis/Verifier.h"
23 #include "llvm/Support/Mangler.h"
24 #include "llvm/Transforms/Utils/Cloning.h"
25 #include "llvm/Transforms/Utils/Linker.h"
26 #include "Support/CommandLine.h"
27 #include "Support/FileUtilities.h"
31 extern cl::list<std::string> InputArgv;
35 class ReduceMiscompilingPasses : public ListReducer<const PassInfo*> {
38 ReduceMiscompilingPasses(BugDriver &bd) : BD(bd) {}
40 virtual TestResult doTest(std::vector<const PassInfo*> &Prefix,
41 std::vector<const PassInfo*> &Suffix);
45 /// TestResult - After passes have been split into a test group and a control
46 /// group, see if they still break the program.
48 ReduceMiscompilingPasses::TestResult
49 ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
50 std::vector<const PassInfo*> &Suffix) {
51 // First, run the program with just the Suffix passes. If it is still broken
52 // with JUST the kept passes, discard the prefix passes.
53 std::cout << "Checking to see if '" << getPassesString(Suffix)
54 << "' compile correctly: ";
56 std::string BytecodeResult;
57 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
58 std::cerr << " Error running this sequence of passes"
59 << " on the input program!\n";
60 BD.setPassesToRun(Suffix);
61 BD.EmitProgressBytecode("pass-error", false);
62 exit(BD.debugOptimizerCrash());
65 // Check to see if the finished program matches the reference output...
66 if (BD.diffProgram(BytecodeResult, "", true /*delete bytecode*/)) {
67 std::cout << " nope.\n";
68 return KeepSuffix; // Miscompilation detected!
70 std::cout << " yup.\n"; // No miscompilation!
72 if (Prefix.empty()) return NoFailure;
74 // Next, see if the program is broken if we run the "prefix" passes first,
75 // then separately run the "kept" passes.
76 std::cout << "Checking to see if '" << getPassesString(Prefix)
77 << "' compile correctly: ";
79 // If it is not broken with the kept passes, it's possible that the prefix
80 // passes must be run before the kept passes to break it. If the program
81 // WORKS after the prefix passes, but then fails if running the prefix AND
82 // kept passes, we can update our bytecode file to include the result of the
83 // prefix passes, then discard the prefix passes.
85 if (BD.runPasses(Prefix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
86 std::cerr << " Error running this sequence of passes"
87 << " on the input program!\n";
88 BD.setPassesToRun(Prefix);
89 BD.EmitProgressBytecode("pass-error", false);
90 exit(BD.debugOptimizerCrash());
93 // If the prefix maintains the predicate by itself, only keep the prefix!
94 if (BD.diffProgram(BytecodeResult)) {
95 std::cout << " nope.\n";
96 removeFile(BytecodeResult);
99 std::cout << " yup.\n"; // No miscompilation!
101 // Ok, so now we know that the prefix passes work, try running the suffix
102 // passes on the result of the prefix passes.
104 Module *PrefixOutput = ParseInputFile(BytecodeResult);
105 if (PrefixOutput == 0) {
106 std::cerr << BD.getToolName() << ": Error reading bytecode file '"
107 << BytecodeResult << "'!\n";
110 removeFile(BytecodeResult); // No longer need the file on disk
112 // Don't check if there are no passes in the suffix.
116 std::cout << "Checking to see if '" << getPassesString(Suffix)
117 << "' passes compile correctly after the '"
118 << getPassesString(Prefix) << "' passes: ";
120 Module *OriginalInput = BD.swapProgramIn(PrefixOutput);
121 if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
122 std::cerr << " Error running this sequence of passes"
123 << " on the input program!\n";
124 BD.setPassesToRun(Suffix);
125 BD.EmitProgressBytecode("pass-error", false);
126 exit(BD.debugOptimizerCrash());
130 if (BD.diffProgram(BytecodeResult, "", true/*delete bytecode*/)) {
131 std::cout << " nope.\n";
132 delete OriginalInput; // We pruned down the original input...
136 // Otherwise, we must not be running the bad pass anymore.
137 std::cout << " yup.\n"; // No miscompilation!
138 delete BD.swapProgramIn(OriginalInput); // Restore orig program & free test
143 class ReduceMiscompilingFunctions : public ListReducer<Function*> {
145 bool (*TestFn)(BugDriver &, Module *, Module *);
147 ReduceMiscompilingFunctions(BugDriver &bd,
148 bool (*F)(BugDriver &, Module *, Module *))
149 : BD(bd), TestFn(F) {}
151 virtual TestResult doTest(std::vector<Function*> &Prefix,
152 std::vector<Function*> &Suffix) {
153 if (!Suffix.empty() && TestFuncs(Suffix))
155 if (!Prefix.empty() && TestFuncs(Prefix))
160 bool TestFuncs(const std::vector<Function*> &Prefix);
164 /// TestMergedProgram - Given two modules, link them together and run the
165 /// program, checking to see if the program matches the diff. If the diff
166 /// matches, return false, otherwise return true. If the DeleteInputs argument
167 /// is set to true then this function deletes both input modules before it
170 static bool TestMergedProgram(BugDriver &BD, Module *M1, Module *M2,
172 // Link the two portions of the program back to together.
173 std::string ErrorMsg;
174 if (!DeleteInputs) M1 = CloneModule(M1);
175 if (LinkModules(M1, M2, &ErrorMsg)) {
176 std::cerr << BD.getToolName() << ": Error linking modules together:"
180 if (DeleteInputs) delete M2; // We are done with this module...
182 Module *OldProgram = BD.swapProgramIn(M1);
184 // Execute the program. If it does not match the expected output, we must
186 bool Broken = BD.diffProgram();
188 // Delete the linked module & restore the original
189 BD.swapProgramIn(OldProgram);
194 /// TestFuncs - split functions in a Module into two groups: those that are
195 /// under consideration for miscompilation vs. those that are not, and test
196 /// accordingly. Each group of functions becomes a separate Module.
198 bool ReduceMiscompilingFunctions::TestFuncs(const std::vector<Function*>&Funcs){
199 // Test to see if the function is misoptimized if we ONLY run it on the
200 // functions listed in Funcs.
201 std::cout << "Checking to see if the program is misoptimized when "
202 << (Funcs.size()==1 ? "this function is" : "these functions are")
203 << " run through the pass"
204 << (BD.getPassesToRun().size() == 1 ? "" : "es") << ":";
205 PrintFunctionList(Funcs);
208 // Split the module into the two halves of the program we want.
209 Module *ToNotOptimize = CloneModule(BD.getProgram());
210 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize, Funcs);
212 // Run the predicate, not that the predicate will delete both input modules.
213 return TestFn(BD, ToOptimize, ToNotOptimize);
216 /// DisambiguateGlobalSymbols - Mangle symbols to guarantee uniqueness by
217 /// modifying predominantly internal symbols rather than external ones.
219 static void DisambiguateGlobalSymbols(Module *M) {
220 // Try not to cause collisions by minimizing chances of renaming an
221 // already-external symbol, so take in external globals and functions as-is.
222 // The code should work correctly without disambiguation (assuming the same
223 // mangler is used by the two code generators), but having symbols with the
224 // same name causes warnings to be emitted by the code generator.
226 for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
227 I->setName(Mang.getValueName(I));
228 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
229 I->setName(Mang.getValueName(I));
232 /// ExtractLoops - Given a reduced list of functions that still exposed the bug,
233 /// check to see if we can extract the loops in the region without obscuring the
234 /// bug. If so, it reduces the amount of code identified.
236 static bool ExtractLoops(BugDriver &BD,
237 bool (*TestFn)(BugDriver &, Module *, Module *),
238 std::vector<Function*> &MiscompiledFunctions) {
239 bool MadeChange = false;
241 Module *ToNotOptimize = CloneModule(BD.getProgram());
242 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize,
243 MiscompiledFunctions);
244 Module *ToOptimizeLoopExtracted = BD.ExtractLoop(ToOptimize);
245 if (!ToOptimizeLoopExtracted) {
246 // If the loop extractor crashed or if there were no extractible loops,
247 // then this chapter of our odyssey is over with.
248 delete ToNotOptimize;
253 std::cerr << "Extracted a loop from the breaking portion of the program.\n";
256 // Bugpoint is intentionally not very trusting of LLVM transformations. In
257 // particular, we're not going to assume that the loop extractor works, so
258 // we're going to test the newly loop extracted program to make sure nothing
259 // has broken. If something broke, then we'll inform the user and stop
261 AbstractInterpreter *AI = BD.switchToCBE();
262 if (TestMergedProgram(BD, ToOptimizeLoopExtracted, ToNotOptimize, false)) {
263 BD.switchToInterpreter(AI);
265 // Merged program doesn't work anymore!
266 std::cerr << " *** ERROR: Loop extraction broke the program. :("
267 << " Please report a bug!\n";
268 std::cerr << " Continuing on with un-loop-extracted version.\n";
269 delete ToNotOptimize;
270 delete ToOptimizeLoopExtracted;
273 BD.switchToInterpreter(AI);
275 std::cout << " Testing after loop extraction:\n";
276 // Clone modules, the tester function will free them.
277 Module *TOLEBackup = CloneModule(ToOptimizeLoopExtracted);
278 Module *TNOBackup = CloneModule(ToNotOptimize);
279 if (!TestFn(BD, ToOptimizeLoopExtracted, ToNotOptimize)) {
280 std::cout << "*** Loop extraction masked the problem. Undoing.\n";
281 // If the program is not still broken, then loop extraction did something
282 // that masked the error. Stop loop extraction now.
287 ToOptimizeLoopExtracted = TOLEBackup;
288 ToNotOptimize = TNOBackup;
290 std::cout << "*** Loop extraction successful!\n";
292 // Okay, great! Now we know that we extracted a loop and that loop
293 // extraction both didn't break the program, and didn't mask the problem.
294 // Replace the current program with the loop extracted version, and try to
295 // extract another loop.
296 std::string ErrorMsg;
297 if (LinkModules(ToNotOptimize, ToOptimizeLoopExtracted, &ErrorMsg)) {
298 std::cerr << BD.getToolName() << ": Error linking modules together:"
303 // All of the Function*'s in the MiscompiledFunctions list are in the old
304 // module. Update this list to include all of the functions in the
305 // optimized and loop extracted module.
306 MiscompiledFunctions.clear();
307 for (Module::iterator I = ToOptimizeLoopExtracted->begin(),
308 E = ToOptimizeLoopExtracted->end(); I != E; ++I) {
309 if (!I->isExternal()) {
310 Function *NewF = ToNotOptimize->getFunction(I->getName(),
311 I->getFunctionType());
312 assert(NewF && "Function not found??");
313 MiscompiledFunctions.push_back(NewF);
316 delete ToOptimizeLoopExtracted;
318 BD.setNewProgram(ToNotOptimize);
323 /// DebugAMiscompilation - This is a generic driver to narrow down
324 /// miscompilations, either in an optimization or a code generator.
326 static std::vector<Function*>
327 DebugAMiscompilation(BugDriver &BD,
328 bool (*TestFn)(BugDriver &, Module *, Module *)) {
329 // Okay, now that we have reduced the list of passes which are causing the
330 // failure, see if we can pin down which functions are being
331 // miscompiled... first build a list of all of the non-external functions in
333 std::vector<Function*> MiscompiledFunctions;
334 Module *Prog = BD.getProgram();
335 for (Module::iterator I = Prog->begin(), E = Prog->end(); I != E; ++I)
336 if (!I->isExternal())
337 MiscompiledFunctions.push_back(I);
339 // Do the reduction...
340 ReduceMiscompilingFunctions(BD, TestFn).reduceList(MiscompiledFunctions);
342 std::cout << "\n*** The following function"
343 << (MiscompiledFunctions.size() == 1 ? " is" : "s are")
344 << " being miscompiled: ";
345 PrintFunctionList(MiscompiledFunctions);
348 // See if we can rip any loops out of the miscompiled functions and still
349 // trigger the problem.
350 if (ExtractLoops(BD, TestFn, MiscompiledFunctions)) {
351 // Okay, we extracted some loops and the problem still appears. See if we
352 // can eliminate some of the created functions from being candidates.
354 // Loop extraction can introduce functions with the same name (foo_code).
355 // Make sure to disambiguate the symbols so that when the program is split
356 // apart that we can link it back together again.
357 DisambiguateGlobalSymbols(BD.getProgram());
359 // Do the reduction...
360 ReduceMiscompilingFunctions(BD, TestFn).reduceList(MiscompiledFunctions);
362 std::cout << "\n*** The following function"
363 << (MiscompiledFunctions.size() == 1 ? " is" : "s are")
364 << " being miscompiled: ";
365 PrintFunctionList(MiscompiledFunctions);
369 return MiscompiledFunctions;
372 /// TestOptimizer - This is the predicate function used to check to see if the
373 /// "Test" portion of the program is misoptimized. If so, return true. In any
374 /// case, both module arguments are deleted.
376 static bool TestOptimizer(BugDriver &BD, Module *Test, Module *Safe) {
377 // Run the optimization passes on ToOptimize, producing a transformed version
378 // of the functions being tested.
379 std::cout << " Optimizing functions being tested: ";
380 Module *Optimized = BD.runPassesOn(Test, BD.getPassesToRun(),
381 /*AutoDebugCrashes*/true);
382 std::cout << "done.\n";
385 std::cout << " Checking to see if the merged program executes correctly: ";
386 bool Broken = TestMergedProgram(BD, Optimized, Safe, true);
387 std::cout << (Broken ? " nope.\n" : " yup.\n");
392 /// debugMiscompilation - This method is used when the passes selected are not
393 /// crashing, but the generated output is semantically different from the
396 bool BugDriver::debugMiscompilation() {
397 // Make sure something was miscompiled...
398 if (!ReduceMiscompilingPasses(*this).reduceList(PassesToRun)) {
399 std::cerr << "*** Optimized program matches reference output! No problem "
400 << "detected...\nbugpoint can't help you with your problem!\n";
404 std::cout << "\n*** Found miscompiling pass"
405 << (getPassesToRun().size() == 1 ? "" : "es") << ": "
406 << getPassesString(getPassesToRun()) << "\n";
407 EmitProgressBytecode("passinput");
409 std::vector<Function*> MiscompiledFunctions =
410 DebugAMiscompilation(*this, TestOptimizer);
412 // Output a bunch of bytecode files for the user...
413 std::cout << "Outputting reduced bytecode files which expose the problem:\n";
414 Module *ToNotOptimize = CloneModule(getProgram());
415 Module *ToOptimize = SplitFunctionsOutOfModule(ToNotOptimize,
416 MiscompiledFunctions);
418 std::cout << " Non-optimized portion: ";
419 ToNotOptimize = swapProgramIn(ToNotOptimize);
420 EmitProgressBytecode("tonotoptimize", true);
421 setNewProgram(ToNotOptimize); // Delete hacked module.
423 std::cout << " Portion that is input to optimizer: ";
424 ToOptimize = swapProgramIn(ToOptimize);
425 EmitProgressBytecode("tooptimize");
426 setNewProgram(ToOptimize); // Delete hacked module.
431 /// CleanupAndPrepareModules - Get the specified modules ready for code
432 /// generator testing.
434 static void CleanupAndPrepareModules(BugDriver &BD, Module *&Test,
436 // Clean up the modules, removing extra cruft that we don't need anymore...
437 Test = BD.performFinalCleanups(Test);
439 // If we are executing the JIT, we have several nasty issues to take care of.
440 if (!BD.isExecutingJIT()) return;
442 // First, if the main function is in the Safe module, we must add a stub to
443 // the Test module to call into it. Thus, we create a new function `main'
444 // which just calls the old one.
445 if (Function *oldMain = Safe->getNamedFunction("main"))
446 if (!oldMain->isExternal()) {
448 oldMain->setName("llvm_bugpoint_old_main");
449 // Create a NEW `main' function with same type in the test module.
450 Function *newMain = new Function(oldMain->getFunctionType(),
451 GlobalValue::ExternalLinkage,
453 // Create an `oldmain' prototype in the test module, which will
454 // corresponds to the real main function in the same module.
455 Function *oldMainProto = new Function(oldMain->getFunctionType(),
456 GlobalValue::ExternalLinkage,
457 oldMain->getName(), Test);
458 // Set up and remember the argument list for the main function.
459 std::vector<Value*> args;
460 for (Function::aiterator I = newMain->abegin(), E = newMain->aend(),
461 OI = oldMain->abegin(); I != E; ++I, ++OI) {
462 I->setName(OI->getName()); // Copy argument names from oldMain
466 // Call the old main function and return its result
467 BasicBlock *BB = new BasicBlock("entry", newMain);
468 CallInst *call = new CallInst(oldMainProto, args);
469 BB->getInstList().push_back(call);
471 // If the type of old function wasn't void, return value of call
472 new ReturnInst(oldMain->getReturnType() != Type::VoidTy ? call : 0, BB);
475 // The second nasty issue we must deal with in the JIT is that the Safe
476 // module cannot directly reference any functions defined in the test
477 // module. Instead, we use a JIT API call to dynamically resolve the
480 // Add the resolver to the Safe module.
481 // Prototype: void *getPointerToNamedFunction(const char* Name)
482 Function *resolverFunc =
483 Safe->getOrInsertFunction("getPointerToNamedFunction",
484 PointerType::get(Type::SByteTy),
485 PointerType::get(Type::SByteTy), 0);
487 // Use the function we just added to get addresses of functions we need.
488 for (Module::iterator F = Safe->begin(), E = Safe->end(); F != E; ++F) {
489 if (F->isExternal() && !F->use_empty() && &*F != resolverFunc &&
490 F->getIntrinsicID() == 0 /* ignore intrinsics */) {
491 Function *TestFn = Test->getFunction(F->getName(), F->getFunctionType());
493 // Don't forward functions which are external in the test module too.
494 if (TestFn && !TestFn->isExternal()) {
495 // 1. Add a string constant with its name to the global file
496 Constant *InitArray = ConstantArray::get(F->getName());
497 GlobalVariable *funcName =
498 new GlobalVariable(InitArray->getType(), true /*isConstant*/,
499 GlobalValue::InternalLinkage, InitArray,
500 F->getName() + "_name", Safe);
502 // 2. Use `GetElementPtr *funcName, 0, 0' to convert the string to an
503 // sbyte* so it matches the signature of the resolver function.
505 // GetElementPtr *funcName, ulong 0, ulong 0
506 std::vector<Constant*> GEPargs(2,Constant::getNullValue(Type::IntTy));
508 ConstantExpr::getGetElementPtr(ConstantPointerRef::get(funcName),
510 std::vector<Value*> ResolverArgs;
511 ResolverArgs.push_back(GEP);
513 // Rewrite uses of F in global initializers, etc. to uses of a wrapper
514 // function that dynamically resolves the calls to F via our JIT API
515 if (F->use_begin() != F->use_end()) {
516 // Construct a new stub function that will re-route calls to F
517 const FunctionType *FuncTy = F->getFunctionType();
518 Function *FuncWrapper = new Function(FuncTy,
519 GlobalValue::InternalLinkage,
520 F->getName() + "_wrapper",
522 BasicBlock *Header = new BasicBlock("header", FuncWrapper);
524 // Resolve the call to function F via the JIT API:
526 // call resolver(GetElementPtr...)
527 CallInst *resolve = new CallInst(resolverFunc, ResolverArgs,
529 Header->getInstList().push_back(resolve);
530 // cast the result from the resolver to correctly-typed function
531 CastInst *castResolver =
532 new CastInst(resolve, PointerType::get(F->getFunctionType()),
534 Header->getInstList().push_back(castResolver);
536 // Save the argument list
537 std::vector<Value*> Args;
538 for (Function::aiterator i = FuncWrapper->abegin(),
539 e = FuncWrapper->aend(); i != e; ++i)
542 // Pass on the arguments to the real function, return its result
543 if (F->getReturnType() == Type::VoidTy) {
544 CallInst *Call = new CallInst(castResolver, Args);
545 Header->getInstList().push_back(Call);
546 ReturnInst *Ret = new ReturnInst();
547 Header->getInstList().push_back(Ret);
549 CallInst *Call = new CallInst(castResolver, Args, "redir");
550 Header->getInstList().push_back(Call);
551 ReturnInst *Ret = new ReturnInst(Call);
552 Header->getInstList().push_back(Ret);
555 // Use the wrapper function instead of the old function
556 F->replaceAllUsesWith(FuncWrapper);
562 if (verifyModule(*Test) || verifyModule(*Safe)) {
563 std::cerr << "Bugpoint has a bug, which corrupted a module!!\n";
570 /// TestCodeGenerator - This is the predicate function used to check to see if
571 /// the "Test" portion of the program is miscompiled by the code generator under
572 /// test. If so, return true. In any case, both module arguments are deleted.
574 static bool TestCodeGenerator(BugDriver &BD, Module *Test, Module *Safe) {
575 CleanupAndPrepareModules(BD, Test, Safe);
577 std::string TestModuleBC = getUniqueFilename("bugpoint.test.bc");
578 if (BD.writeProgramToFile(TestModuleBC, Test)) {
579 std::cerr << "Error writing bytecode to `" << TestModuleBC << "'\nExiting.";
584 // Make the shared library
585 std::string SafeModuleBC = getUniqueFilename("bugpoint.safe.bc");
587 if (BD.writeProgramToFile(SafeModuleBC, Safe)) {
588 std::cerr << "Error writing bytecode to `" << SafeModuleBC << "'\nExiting.";
591 std::string SharedObject = BD.compileSharedObject(SafeModuleBC);
594 // Run the code generator on the `Test' code, loading the shared library.
595 // The function returns whether or not the new output differs from reference.
596 int Result = BD.diffProgram(TestModuleBC, SharedObject, false);
599 std::cerr << ": still failing!\n";
601 std::cerr << ": didn't fail.\n";
602 removeFile(TestModuleBC);
603 removeFile(SafeModuleBC);
604 removeFile(SharedObject);
610 /// debugCodeGenerator - debug errors in LLC, LLI, or CBE.
612 bool BugDriver::debugCodeGenerator() {
613 if ((void*)cbe == (void*)Interpreter) {
614 std::string Result = executeProgramWithCBE("bugpoint.cbe.out");
615 std::cout << "\n*** The C backend cannot match the reference diff, but it "
616 << "is used as the 'known good'\n code generator, so I can't"
617 << " debug it. Perhaps you have a front-end problem?\n As a"
618 << " sanity check, I left the result of executing the program "
619 << "with the C backend\n in this file for you: '"
624 DisambiguateGlobalSymbols(Program);
626 std::vector<Function*> Funcs = DebugAMiscompilation(*this, TestCodeGenerator);
628 // Split the module into the two halves of the program we want.
629 Module *ToNotCodeGen = CloneModule(getProgram());
630 Module *ToCodeGen = SplitFunctionsOutOfModule(ToNotCodeGen, Funcs);
632 // Condition the modules
633 CleanupAndPrepareModules(*this, ToCodeGen, ToNotCodeGen);
635 std::string TestModuleBC = getUniqueFilename("bugpoint.test.bc");
636 if (writeProgramToFile(TestModuleBC, ToCodeGen)) {
637 std::cerr << "Error writing bytecode to `" << TestModuleBC << "'\nExiting.";
642 // Make the shared library
643 std::string SafeModuleBC = getUniqueFilename("bugpoint.safe.bc");
644 if (writeProgramToFile(SafeModuleBC, ToNotCodeGen)) {
645 std::cerr << "Error writing bytecode to `" << SafeModuleBC << "'\nExiting.";
648 std::string SharedObject = compileSharedObject(SafeModuleBC);
651 std::cout << "You can reproduce the problem with the command line: \n";
652 if (isExecutingJIT()) {
653 std::cout << " lli -load " << SharedObject << " " << TestModuleBC;
655 std::cout << " llc " << TestModuleBC << " -o " << TestModuleBC << ".s\n";
656 std::cout << " gcc " << SharedObject << " " << TestModuleBC
657 << ".s -o " << TestModuleBC << ".exe -Wl,-R.\n";
658 std::cout << " " << TestModuleBC << ".exe";
660 for (unsigned i=0, e = InputArgv.size(); i != e; ++i)
661 std::cout << " " << InputArgv[i];
663 std::cout << "The shared object was created with:\n llc -march=c "
664 << SafeModuleBC << " -o temporary.c\n"
665 << " gcc -xc temporary.c -O2 -o " << SharedObject
666 #if defined(sparc) || defined(__sparc__) || defined(__sparcv9)
667 << " -G" // Compile a shared library, `-G' for Sparc
669 << " -shared" // `-shared' for Linux/X86, maybe others
671 << " -fno-strict-aliasing\n";