search for: ep_loopoptimizerstart

Tobias Grosser wrote: > As said before, we could probably add it in between those two passes: > > MPM.add(createReassociatePass()); // Reassociate expressions > + addExtensionsToPM(EP_LoopOptimizerStart, MPM); > MPM.add(createLoopRotatePass()); // Rotate Loop As this is in the middle of other LNO passes, can you please rename s/EP_LoopOptimizerStart/EP_Polly_LNO/ or anything other than LoopOptimizerStart? Thanks, Sebastian -- Qualcomm Innovation Center, Inc. is a member of Code Aurora F...

On 04/17/2013 09:04 PM, Sebastian Pop wrote: > Tobias Grosser wrote: >> As said before, we could probably add it in between those two passes: >> >> MPM.add(createReassociatePass()); // Reassociate expressions >> + addExtensionsToPM(EP_LoopOptimizerStart, MPM); >> MPM.add(createLoopRotatePass()); // Rotate Loop > > As this is in the middle of other LNO passes, can you please rename > s/EP_LoopOptimizerStart/EP_Polly_LNO/ or anything other than LoopOptimizerStart? It is in the middle? The passes executed before are: MPM.add(cr...

...uality of the generated code this >> seems to be a good choice, but it obviously will increase the >> compile time compared to a run without Polly. What we could aim for >> is to run Polly at the beginning of the loop transformations e.g. by >> adding an extension point 'EP_LoopOptimizerStart'. Meaning before >> vectorization, before loop invariant code motion and before the loop >> idiom recognition. However, we would then need to evaluate what >> cleanup passes we need to run after Polly. For the classical code >> generation strategy we probably need a coup...

...p coverage and quality of the generated code this > seems to be a good choice, but it obviously will increase the > compile time compared to a run without Polly. What we could aim for > is to run Polly at the beginning of the loop transformations e.g. by > adding an extension point 'EP_LoopOptimizerStart'. Meaning before > vectorization, before loop invariant code motion and before the loop > idiom recognition. However, we would then need to evaluate what > cleanup passes we need to run after Polly. For the classical code > generation strategy we probably need a couple of scalar cle...

...In terms of scop coverage and quality of the generated code this seems to be a good choice, but it obviously will increase the compile time compared to a run without Polly. What we could aim for is to run Polly at the beginning of the loop transformations e.g. by adding an extension point 'EP_LoopOptimizerStart'. Meaning before vectorization, before loop invariant code motion and before the loop idiom recognition. However, we would then need to evaluate what cleanup passes we need to run after Polly. For the classical code generation strategy we probably need a couple of scalar cleanups, with the...

Hi, polly is run very early and schedules the following passes before it runs: /// @brief Schedule a set of canonicalization passes to prepare for Polly /// /// The set of optimization passes was partially taken/copied from the /// set of default optimization passes in LLVM. It is used to bring the code /// into a canonical form that simplifies the analysis and optimization passes /// of Polly.

...quality of the generated code this > seems > to be a good choice, but it obviously will increase the compile time > compared to a run without Polly. What we could aim for is to run > Polly > at the beginning of the loop transformations e.g. by adding an > extension > point 'EP_LoopOptimizerStart'. Meaning before vectorization, before > loop > invariant code motion and before the loop idiom recognition. However, > we > would then need to evaluate what cleanup passes we need to run after > Polly. For the classical code generation strategy we probably need a > couple of...