search for: reassociatepass

Displaying 7 results from an estimated 7 matches for "reassociatepass".

2011 Jan 27
1
[LLVMdev] Missing some passes in llvm-ld
Hi All, It seems that I can't force some passes to run in llvm-ld as what I can do with opt. $ ~/opt/bin/llvm-ld -reassociate llvm-ld: Unknown command line argument '-reassociate. Try: 'opt/bin/llvm-ld -help' llvm-ld definitely linked with scalaropts, and RegisterPass<ReassociatePass> is in the library. Running with these passes with opt definitely work, but it'll take some time as my .bc is big (~40M). I'll appreciate any ideas how to make llvm-ld run these passes. Thanks. Cheers, Haohui
2005 Jan 19
1
[LLVMdev] Constant Propagation Problem
...uld find which run on Functions, I don't need the IP optimizers): LowerPackedPass CFGSimplificationPass PromoteMemoryToRegister InstructionCombiningPass CFGSimplificationPass RaisePointerReferencesPass TailDuplicationPass CFGSimplificationPass ScalarReplAggregatesPass InstructionCombiningPass ReassociatePass InstructionCombiningPass TailCallEliminationPass CFGSimplificationPass LICMPass InstructionCombiningPass IndVarSimplifyPass LoopUnrollPass InstructionCombiningPass GCSEPass SCCPPass InstructionCombiningPass DeadStoreEliminationPass AggressiveDCEPass CFGSimplificationPass -------------- next part -...
2011 Jan 19
0
[LLVMdev] How to get the name and argument of a function
Thanks a lot! I finally fix my problem. My code is like this: //CallInst* pCall pCall is a printf called in my situation if( ConstantExpr * pCE = dyn_cast<ConstantExpr>( pCall->getArgOperand(0))){ if( GlobalVariable * pGV = dyn_cast<GlobalVariable>( pCE->getOperand(0))){ if( ConstantArray * pCA = dyn_cast<ConstantArray>(
2011 Jan 17
5
[LLVMdev] How to get the name and argument of a function
Hi everyone: The code I am analyzing is : int main() { int i = 0; printf("hello world!"); printf( "%d" , i ); } I want to get each place where printf is called, and the argument used during that call. so I write llvm pass code like: void Myfunction( Function & F){ for( Function::iterator b = F.begin() , be = F.end() ;
2013 May 02
0
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
...In this project, I plan to spend two weeks to reduce canonicalization > overhead. It was a good idea to write down what you plan to do each week. > Week 1: Profile the compiling overhead of each canonicalization pass, > including PromoteMemoryToRegisterPass, CFGSimplificationPass, > ReassociatePass, LoopRotatePass, InstructionCombiningPass, > IndVarSimplifyPass, CodePreparationPass and LoopSimplifyPass. Week 2: > Remove or improve one or two most expensive canonicalization passes. I > will also try to revise the pass ordering to move some expensive > canonicalization passes later...
2013 Apr 26
4
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
Hi all, I have updated my GSoS proposal: "FastPolly: Reducing LLVM-Polly Compiling overhead" (https://gist.github.com/tanstar/5441808). I think the pass ordering problem you discussed early can be also investigated in this project! Is there any comment or advice about my proposal? I appreciate all your help and advice. Thanks, Star Tan Proposal:
2019 Aug 07
2
Status of the New Pass Manager
On 8/7/19 6:20 PM, Hiroshi Yamauchi wrote: > I basically run "clang > -fexperimental-new-pass-manager -print-after-all ..." > > It's conceivable that something is different in our setup or in clang > (from opt)... I'll see if I can reproduce it outside our setup. Does it depend on machine architecture? I generally use x86... regards,   Fedor. > > Thanks.