similar to: [LLVMdev] Something about the andersens pass

Hi All, I have installed llvm-gcc4 patch to enable various llvm optimizations at -O1/-O2/-O3. This means instead of $ llvm-gcc4 --emit-llvm foo.c -o foo.bc $ opt foo.bc -o foo_optimized.bc $ llc foo_optimized.bc -o foo.o One can directly use $ llvm-gcc4 -O2 foo.c -o foo.o to get optimized foo.o - Devang + + if (optimize > 0) { + + +

I have a problem where I add an Andersens AA pass to the pass manager, but it appears to get invalidated by another pass, and never rerun. My understanding from reading the documentation is that when a pass gets invalidated, it should be rerun before any other passes that requires it. Here is a simple example of the problem I am seeing: PassManager passManager; passManager.add(new

Hi! My llvm version is 3.0 release. I have a module generated by clang. When I optimize it, I first add an inlining pass (llvm::createFunctionInliningPass), then these passes: - own FunctionPass - llvm::createPromoteMemoryToRegisterPass - llvm::createInstructionCombiningPass - llvm::createDeadInstEliminationPass - llvm::createDeadStoreEliminationPass - new llvm::DominatorTree() - new

This is the beginning of a new implementation of Andersen's. So far, it has been converted to use a new solver algorithm, support field sensitivity (not yet implemented in the constraint building, but the solver supports it) and to use SparseBitVectors. It is roughly 100x faster than the old implementation on larger testcases. This is just the beginning, work is being done to change the

Hello, How do apply the LLVM Andersens alias analysis direclty to a Module object. I'm trying to avoid using the PassManager. Max -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090518/aec81e30/attachment.html>

Hello, How do apply the LLVM Andersens alias analysis direclty to a Module object. I'm trying to avoid using the PassManager. Max -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090518/1a9d9a89/attachment.html>

Hi all, I was trying to find the equivalent analysis of Andersens on LLVM. I found it only on LLVM 2.6 on 'Analysis/IPA' folder. Is it removed/renamed on later versions? I'm mostly interested in 3.4 version or later. Thank you in advance, -- Irini -------------- next part -------------- An HTML attachment was scrubbed... URL:

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

I've written an optimization loop, with the following form: PassManager lpm; lpm.add(createLoopDeletionPass()); lpm.add(createSCCPPass()); lpm.add(createAggressiveDCEPass()); lpm.add(createGlobalOptimizerPass()); lpm.add(createGlobalDCEPass()); lpm.add(createDeadStoreEliminationPass()); lpm.add(createLoopDeletionPass());

Hi Jochen, > My llvm version is 3.0 release. > I have a module generated by clang. When I optimize it, I first add an > inlining pass (llvm::createFunctionInliningPass), then these passes: > - own FunctionPass > - llvm::createPromoteMemoryToRegisterPass > - llvm::createInstructionCombiningPass > - llvm::createDeadInstEliminationPass > - llvm::createDeadStoreEliminationPass

I can't build llvm-gcc from working directories updated an hour ago. -Dave /tools/llvm-tools/i686-pc-linux-gnu/bin/g++ -c -g -DENABLE_CHECKING -DENABLE_ASSERT_CHECKING -DIN_GCC -W -Wall -Wwrite-strings -pedantic -Wno-long-long -Wno-variadic-macros -fno-common -DHAVE_CONFIG_H -Wno-unused -DTARGET_NAME=\"i686-pc-linux-gnu\" -DENABLE_LLVM

Hi, Sean: I'm sorry I lie. I didn't mean to lie. I did try to avoid making a *BIG* change to the IPO pass-ordering for now. However, when I make a minor change to populateLTOPassManager() by separating module-pass and non-module-passes, I saw quite a few performance difference, most of them are degradations. Attacking these degradations one by one in a piecemeal manner is wasting

At one point it handled function pointers. As chris says, it's buggy and probably broken. Some function pointers also do point to the universal set (like global function pointers). On Wed, Aug 26, 2009 at 10:11 PM, Chris Lattner<clattner at apple.com> wrote: > On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: >> Hello, >> >> Does the LLVM Andersens alias analysis

Might I suggest the following patch, because this issue has bite me too? You're lured in by the initial good results from the Andersens alias analysis, only to discover the bugs later on. Robert Zeh On Aug 26, 2009, at 9:11 PM, Chris Lattner wrote: > On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: >> Hello, >> >> Does the LLVM Andersens alias analysis handle

Hi, I was working on alias analysis using LLVM-2.6 previously. But I just downloaded LLVM-2.7 and found AndersenAA is not there. What happened for andersen's IPA alias analysis? Has it been deleted for some reason? Thanks. Lei -------------- next part -------------- An HTML attachment was scrubbed... URL:

On 9/19/11 9:12 PM, Manish Gupta wrote: > Dear All, > > I am curious to know the reason for removal of andersen pointer > analysis. Is it because of some issues? We need it on llvm-2.9, if > possible. > > Do we have some better version of pointer analysis on llvm-2.9? The Data Structure Analysis pass (DSA) is a unification-style points-to analysis. It should work with

Hello, I am researching a more efficient approach to subset-based alias analysis in the style of Andersen's algorithm, and I noticed that there used to be an implementation of that for LLVM back in 2.6 (-anders-aa) which was removed because it was "not being actively maintained and had substantial problems". I'd be interested in knowing what was wrong with it (other than

Hello, I am writing to let the community know that I am working on a new implementation of Andersen alias analysis for LLVM. The code is quite young and not useful yet, but you can see what I have at https://github.com/TristanSchmelcher/llvm-andersen.

Dear all, I use the Andersen plot to check for proportional hazards assumption for a factor (say x) in the Cox regression model and obtained a straight line that pass through the origin. However, the formal test done by the R-function cox.zph, which is based on the plot of Schonefeld residuals against time, indicates that proportional hazards assumption is violated. Further, a plot of the score

Hi all, I'm getting more impressed by LLVM day by day, but what's a bit unclear to me now is the order of optimization passes, and their performance. I think I have a pretty solid understanding of what each pass does at a high level, but I couldn't find any documentation about how they interact at a lower level. I'd like to use LLVM for generating high-performance stream