HomeSort by relevance Sort by last modified time
    Searched refs:Passes (Results 1 - 15 of 15) sorted by null

  /external/llvm/unittests/IR/
PassManagerTest.cpp 298 PassManager Passes;
299 Passes.add(new DataLayout(&M));
300 Passes.add(mNDM2);
301 Passes.add(mNDM);
302 Passes.add(mNDNM);
303 Passes.add(mDNM);
305 Passes.run(M);
322 PassManager Passes;
323 Passes.add(new DataLayout(&M));
324 Passes.add(mNDM)
    [all...]
DominatorTreeTest.cpp 195 PassManager Passes;
196 Passes.add(P);
197 Passes.run(*M);
  /external/llvm/tools/opt/
opt.cpp 51 // The OptimizationList is automatically populated with registered Passes by the
95 cl::desc("Do not run any optimization passes"));
159 // ---------- Define Printers for module and function passes ------------
418 /// AddOptimizationPasses - This routine adds optimization passes
462 // -std-compile-opts adds the same module passes as -O3.
566 // Initialize passes
630 // Create a PassManager to hold and optimize the collection of passes we are
633 PassManager Passes;
641 Passes.add(TLI);
652 Passes.add(TD)
    [all...]
  /external/llvm/tools/llvm-extract/
llvm-extract.cpp 255 PassManager Passes;
256 Passes.add(new DataLayout(M.get())); // Use correct DataLayout
260 Passes.add(createGVExtractionPass(Gvs, DeleteFn));
262 Passes.add(createGlobalDCEPass()); // Delete unreachable globals
263 Passes.add(createStripDeadDebugInfoPass()); // Remove dead debug info
264 Passes.add(createStripDeadPrototypesPass()); // Remove dead func decls
275 Passes.add(createPrintModulePass(&Out.os()));
277 Passes.add(createBitcodeWriterPass(Out.os()));
279 Passes.run(*M.get());
  /external/llvm/tools/bugpoint/
OptimizerDriver.cpp 1 //===- OptimizerDriver.cpp - Allow BugPoint to run passes safely ----------===//
10 // This file defines an interface that allows bugpoint to run various passes
95 cl::opt<bool> SilencePasses("silence-passes",
96 cl::desc("Suppress output of running passes (both stdout and stderr)"));
102 /// runPasses - Run the specified passes on Program, outputting a bitcode file
111 const std::vector<std::string> &Passes,
180 for (std::vector<std::string>::const_iterator I = Passes.begin(),
181 E = Passes.end(); I != E; ++I )
211 // If we are supposed to delete the bitcode file or if the passes crashed,
243 const std::vector<std::string> &Passes,
    [all...]
BugDriver.cpp 56 /// getPassesString - Turn a list of passes into a string which indicates the
57 /// command line options that must be passed to add the passes.
59 std::string llvm::getPassesString(const std::vector<std::string> &Passes) {
61 for (unsigned i = 0, e = Passes.size(); i != e; ++i) {
64 Result += Passes[i];
151 // Rearrange the passes and apply them to the program. Repeat this process
159 // decision by trying to run all of the passes on the input program,
164 outs() << "Running selected passes on program to test for crash: ";
ExtractFunction.cpp 86 /// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code which
116 std::vector<std::string> Passes;
120 Passes.push_back("dce");
122 Passes.push_back("simplifycfg"); // Delete dead control flow
124 Passes.push_back("verify");
125 Module *New = runPassesOn(Clone, Passes);
CrashDebugger.cpp 51 // doTest - Return true iff running the "removed" passes succeeds, and
52 // running the "Kept" passes fail when run on the output of the "removed"
53 // passes. If we return true, we update the current module of bugpoint.
68 outs() << "Checking to see if these passes crash: "
86 outs() << "Checking to see if these passes crash: "
323 std::vector<std::string> Passes;
324 Passes.push_back("simplifycfg");
325 Passes.push_back("verify");
326 Module *New = BD.runPassesOn(M, Passes);
413 PassManager Passes;
    [all...]
BugDriver.h 96 bool debugOptimizerCrash(const std::string &ID = "passes");
103 /// debugMiscompilation - This method is used when the passes selected are not
132 /// runPasses - Run all of the passes in the "PassesToRun" list, discard the
133 /// output, and return true if any of the passes crashed.
215 /// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code
245 Module *runPassesOn(Module *M, const std::vector<std::string> &Passes,
249 /// runPasses - Run the specified passes on Program, outputting a bitcode
265 /// combinations of passes to compile the program with. Compile the program with
266 /// each set and mark test to see if it compiled correctly. If the passes
267 /// compiled correctly output nothing and rearrange the passes into a new order
    [all...]
  /external/llvm/lib/Target/R600/
AMDGPUTargetMachine.cpp 23 #include "llvm/Analysis/Passes.h"
27 #include "llvm/CodeGen/Passes.h"
34 #include <llvm/CodeGen/Passes.h>
  /external/valgrind/main/perf/
ffbench.c 18 This benchmark executes a specified number of passes (default
35 follows: Float = double, Asize = 256, Passes = 20, CAPOUT not
153 #define Passes 20 /* Number of FFT/Inverse passes */
240 int i, j, k, l, m, npasses = Passes, faedge;
322 fprintf(stdout, "%d passes. No errors in results.\n", npasses);
324 fprintf(stdout, "%d passes. %d errors in results.\n",
  /external/llvm/lib/CodeGen/
Android.mk 73 Passes.cpp \
  /frameworks/compile/mclinker/lib/CodeGen/
MCLDTargetMachine.cpp 21 #include <llvm/Analysis/Passes.h>
28 #include <llvm/CodeGen/Passes.h>
  /external/llvm/tools/llvm-stress/
llvm-stress.cpp 711 PassManager Passes;
712 Passes.add(createVerifierPass());
713 Passes.add(createPrintModulePass(&Out->os()));
714 Passes.run(*M.get());
  /frameworks/compile/libbcc/lib/Core/
Compiler.cpp 19 #include <llvm/Analysis/Passes.h>
175 // We now create passes list performing LTO. These are copied from
177 // Only a subset of these LTO passes are enabled in optimization level 0 as
180 // FIXME: Figure out which passes (if any) makes sense for levels 1 and 2.
223 // The IPO passes may leave cruft around. Clean up after them.
251 // Delete basic blocks, which optimization passes may have killed.
264 // Invokde "beforeExecuteLTOPasses" before executing the passes.
301 // Add passes to the pass manager to emit machine code through MC layer.
313 // Invokde "beforeExecuteCodeGenPasses" before executing the passes.

Completed in 216 milliseconds