search for: createscalarreplaggregatespass

...0); llvm::createVerifierPass(); - llvm::WriteBitcodeToFile(0, llvm::cout); + llvm::CreateBitcodeWriterPass(*llvm::cout); + llvm::WriteBitcodeToFile(0, *llvm::cout); llvm::ParseBitcodeFile(NULL); + llvm::MemoryBuffer::getNewMemBuffer(0); llvm::createInstructionCombiningPass(); llvm::createScalarReplAggregatesPass();

...rmally used. If you're looking at the opt output, beware that some of those passes are analysis passes that get added automatically and shouldn't be added manually. To avoid -scalarrepl, just pretend it says -mem2reg instead of -scalarrepl (or createPromoteMemoryToRegisterPass() instead of createScalarReplAggregatesPass(...), if you're reading the header). Alternatively, you could volunteer to rewrite the C backend to use the common backend infrastructure used by most of the other backends (as has been proposed on this list before). That would enable it to handle wide integers: they would "automatically...

On 01.07.2011 12:03, Eli Friedman wrote: > On Fri, Jul 1, 2011 at 12:53 AM, Корчагин Василий > <vasiliy.korchagin at gmail.com> wrote: >> Hello, LLVMdev. >> >> The problem is that C backend doesn't support integers wider than 64 >> bits, but I need to use it on programs with wide integers in LLVM IR. My >> question is how to deny LLVM to generate wide

...MPM.add(Inliner); + Inliner = 0; + } + MPM.add(createArgumentPromotionPass()); // Scalarize uninlined fn args + } + + // Start of function pass. + { + if (UseNewSROA) + MPM.add(createSROAPass(/*RequiresDomTree*/ false)); + else + MPM.add(createScalarReplAggregatesPass(-1, false)); + + MPM.add(createEarlyCSEPass()); // Catch trivial redundancies + MPM.add(createJumpThreadingPass()); // Thread jumps. + MPM.add(createCorrelatedValuePropagationPass());// Propagate conditionals + MPM.add(createCFGSimplificationPass());...

...t;add(createRaisePointerReferencesPass());// Recover type information + } + + PerModulePasses->add(createTailDuplicationPass()); // Simplify cfg by copying code + PerModulePasses->add(createCFGSimplificationPass()); // Merge & remove BBs + PerModulePasses->add(createScalarReplAggregatesPass()); // Break up aggregate allocas + PerModulePasses->add(createInstructionCombiningPass()); // Combine silly seq's + PerModulePasses->add(createCondPropagationPass()); // Propagate conditionals + PerModulePasses->add(createTailCallEliminationPass()); // Eliminate...

...gt; - llvm::WriteBitcodeToFile(0, llvm::cout); > + llvm::CreateBitcodeWriterPass(*llvm::cout); > + llvm::WriteBitcodeToFile(0, *llvm::cout); > llvm::ParseBitcodeFile(NULL); > + llvm::MemoryBuffer::getNewMemBuffer(0); > > llvm::createInstructionCombiningPass(); > llvm::createScalarReplAggregatesPass(); > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > -Chris -- http://nondot.org/sabre/ http://llvm.org/

...ing disabled because of undefined symbols /usr/bin/ld: Undefined symbols: llvm::createGVNPass() llvm::createGVNPREPass() llvm::createLoopUnswitchPass(bool) llvm::createLoopIndexSplitPass() llvm::CheckBitcodeOutputToConsole(std::basic_ostream<char, std::char_traits<char> >*, bool) llvm::createScalarReplAggregatesPass(int) llvm::createRedundantLoadEliminationPass() collect2: ld returned 1 exit status

Andy and I briefly discussed this the other day, we have not yet got chance to list a detailed pass order for the pre- and post- IPO scalar optimizations. This is wish-list in our mind: pre-IPO: based on the ordering he propose, get rid of the inlining (or just inline tiny func), get rid of all loop xforms... post-IPO: get rid of inlining, or maybe we still need it, only

Hi All, llvm-gcc-4-2 development branch is now open for development at llvm.org/svn/llvm-project/llvm-gcc-4-2 It is not yet ready, it can not even bootstrap. I welcome LLVM developers to test and apply fixes! However, first take a note of ground rules : 1) LLVM developers, use your write access as judiciously as you use it for LLVM development and follow same check-in procedure. 2)

I'm translating llvm's intermediate representation, after optimization, to the intermediate representation of another optimizer. One of the problems I've run into is that llvm sometimes (although rarely) produces strangely sized integers after an opt pass with -O3 (in this example, 832 bits). I need to use 8, 16, or 32 bit integers for the other intermediate language. In short,

...9;m compiling is comparable to C (without any exception handling or garbage collection, so none of the related passes are needed). My first attempt at collecting useful optimizations looks like this: passManager->add(new TargetData(*executionEngine->getTargetData())); passManager->add(createScalarReplAggregatesPass()); // Convert to SSA form passManager->add(createSCCPPass()); // Propagate constants passManager->add(createInstructionCombiningPass()); // Peephole optimization passManager->add(createDeadStoreEliminationPass()); // Dead store elimination passManager->add(c...

Hi Duncan & Tobi, Thanks a lot for your interest, and for pointing out differences in GIMPLE I missed. Attached is simplified test case. Is it good? Tobi, regarding runtime alias analysis: in KernelGen we already do it along with runtime values substitution. For example: <------------------ __kernelgen_main_loop_17: compile started ---------------------> Integer args substituted:

...(); // Run optimization passes. // std::vector<const char *> exportList; // llvm::PassManager Passes; // Passes.add(new llvm::DataLayout(rtlib)); // Passes.add(llvm::createDemoteRegisterToMemoryPass()); // Passes.add(llvm::createInternalizePass(exportList)); // Passes.add(llvm::createScalarReplAggregatesPass()); // Passes.add(llvm::createInstructionCombiningPass()); // Passes.add(llvm::createGlobalOptimizerPass()); // Passes.add(llvm::createFunctionInliningPass()); // Passes.run(*rtlib); // Create the JIT llvm::InitializeNativeTarget(); llvm::ExecutionEngine * jit = llvm::EngineBuilder(r...

On 01/01/2013 02:45 PM, Duncan Sands wrote: > Hi Dmitry, > >> >> In our compiler we use a modified version LLVM Polly, which is very >> sensitive to >> proper code generation. Among the number of limitations, the loop region >> (enclosed by phi node on induction variable and branch) is required to >> be free >> of additional memory-dependent

...const char *> exportList; > > // llvm::PassManager Passes; > > // Passes.add(new llvm::DataLayout(rtlib)); > > // Passes.add(llvm::createDemoteRegisterToMemoryPass()); > > // Passes.add(llvm::createInternalizePass(exportList)); > > // Passes.add(llvm::createScalarReplAggregatesPass()); > > // Passes.add(llvm::createInstructionCombiningPass()); > > // Passes.add(llvm::createGlobalOptimizerPass()); > > // Passes.add(llvm::createFunctionInliningPass()); > > // Passes.run(*rtlib); > > // Create the JIT > > llvm::InitializeNati...

...// llvm::PassManager Passes; > > > > // Passes.add(new llvm::DataLayout(rtlib)); > > > > // Passes.add(llvm::createDemoteRegisterToMemoryPass()); > > > > // Passes.add(llvm::createInternalizePass(exportList)); > > > > // Passes.add(llvm::createScalarReplAggregatesPass()); > > > > // Passes.add(llvm::createInstructionCombiningPass()); > > > > // Passes.add(llvm::createGlobalOptimizerPass()); > > > > // Passes.add(llvm::createFunctionInliningPass()); > > > > // Passes.run(*rtlib); > > > > /...

...-gcc/gcc/llvm-backend.cpp:267: error: `createCFGSimplificationPass' was not declared in this scope /projects/compiler/llvm-gcc/gcc/llvm-backend.cpp:269: error: `createPromoteMemoryToRegisterPass' was not declared in this scope /projects/compiler/llvm-gcc/gcc/llvm-backend.cpp:271: error: `createScalarReplAggregatesPass' was not declared in this scope /projects/compiler/llvm-gcc/gcc/llvm-backend.cpp:272: error: `createInstructionCombiningPass' was not declared in this scope /projects/compiler/llvm-gcc/gcc/llvm-backend.cpp:277: error: `PerModulePasses' was not declared in this scope /projects/compiler...

...ch/tpondich/ParallelAssert/llvm-objects/tools/opt/Debug+Asserts/opt.o llvm::createLoopSimplifyPass() /n/fs/scratch/tpondich/ParallelAssert/llvm-objects/tools/opt/Debug+Asserts/opt.o llvm::Pass::~Pass() /n/fs/scratch/tpondich/ParallelAssert/llvm-objects/tools/opt/Debug+Asserts/GraphPrinters.o llvm::createScalarReplAggregatesPass(int, bool)/n/fs/scratch/tpondich/ParallelAssert/llvm-objects/tools/opt/Debug+Asserts/opt.o llvm::DominanceFrontier::ID /n/fs/scratch/tpondich/ParallelAssert/llvm-objects/tools/opt/Debug+Asserts/GraphPrinters.o llvm::createRegionOnlyPrinterPass() /n/fs/scratch/tpondich/ParallelAssert/llvm-objects/to...