similar to: [LLVMdev] How to get the PostDominanceFr

When analysing a function "fn", my FunctionPass needs some PostDominanceFrontier information of functions which are called by function "fn". getAnalysis<PostDominanceFrontier>() cannot give the information, because it only gives the PostDominanceFrontier information of "fn", not the PostDominanceFrontier information of functions called by "fn".

On 4/12/13 3:19 PM, Arsen wrote: > Thank you John. > Actually the opt tool (from LLVM 3.2 version) can generate the needed graphs > (with pass "-domfrontier"). > But I just want to surely know is there some pass or builder which can be > integrated somehow so it will be possible directly to generate CDG? Yes and no. There's isn't a control dependence pass in LLVM

A while ago I reported a bug in the computation of the post-dominance frontier (PDF). I submitted it as http://llvm.org/bugs/show_bug.cgi?id=1069, and it is now marked as a duplicate of http://llvm.org/bugs/show_bug.cgi?id=1098, which is still an open bug. I needed the PDF to compute control dependencies for code on which I'm working. I was not familiar with the algorithm used in LLVM

Hi all, Does anyone know how to recreate the DominanceFronter and PostDominanceFrontier structures using the API of the latest release? To my knowledge, these are needed to implement a PRE pass (as done in the past<https://llvm.org/svn/llvm-project/llvm/tags/RELEASE_13/lib/Transforms/Scalar/PRE.cpp>), but they were removed a while ago for efficiency reasons. Is there a better way to

On Fri, 20 Apr 2007, Ryan M. Lefever wrote: > Please advise on how I should proceed. Even though, as I mentioned, the > code does not follow the LLVM coding standards and does not adhere to > the llvm::PostDominanceFrontier interface, I figured it would be better > to a working PDF than to not have it. Perhaps if you don't want to > insert it into the regular LLVM code base,

Hi, I'm not able to answer your question. I'm wondering if you can create your own if it is just your own hobby project, or a project that you don't have to commit to the main repository. Creating DominatorFrontier seems to be expensive. However, if you are using bit-vector to represent a basic-block-set, I guess it can be done in linear time in practice. Following is the

Thank you John. Actually the opt tool (from LLVM 3.2 version) can generate the needed graphs (with pass "-domfrontier"). But I just want to surely know is there some pass or builder which can be integrated somehow so it will be possible directly to generate CDG? -- View this message in context: http://llvm.1065342.n5.nabble.com/Control-Dependence-Graph-builder-tp56687p56689.html Sent

Hi Arsen, I wrote a pass that computes a control dependence graph as described in Ferrante et al's "The Program Dependence Graph and Its Use in Optimization." It is available at https://github.com/thinkmoore/llvm-analysis. Cheers, Scott On Fri, Apr 12, 2013 at 5:04 PM, John Criswell <criswell at illinois.edu>wrote: > On 4/12/13 3:19 PM, Arsen wrote: > >> Thank

Hi, When I compile httpd-2.0, llvmgcc reports many struct types and macros undeclared, but gnu-gcc can compile httpd-2.0 completely.

Hi Has anybody tell me how to create some new type qualifies in LVM? A type qualify, like "const" in C, is useful for program analysis. I hope that I can set/get the type qualify of any value in a program analysed. Or, if I could add a property to the value class and set/get the property, it is same to add some new type qualifies. So, I simply insert a "int" private

Xia, LLVM doesn't really use type qualifiers the way you're thinking about it. In LLVM parlance, types are neither const nor non-const, they just define the fundamental nature of a value. However, LLVM fully supports Constant Values (see include/llvm/Constant.h) and constant global variables (see include/llvm/GlobalVariable.h). You might want to read up on the LLVM IR a bit here:

Is there a reason this is better than the modified algorithm created by Ferrante? It looks like yours has as bad a worst case time bound in reality. That is, the algorithm runs in O(sum of the size of all the dominance frontiers). http://www.cs.rice.edu/~keith/Embed/dom.pdf See figure 5. It will only touch nodes actually in the dominance frontier. This is what GCC uses. There are actually real

The llvm I using is llvm-1.2, its cfrontend should be based on gcc-3.4, the system I using is RedHat Linux 9.0, I desire to compile httpd-2.0.51. Xia ______________________________________ ע������30��������䣨 http://mail.sina.com.cn/chooseMode.html �� =================================================================== ��ɽ��կ���������������ջ�֮�ã�

Hello All, I am interested in Control Dependence Graph building using the CFG and Dominance Frontier provided by corresponding passes. Just wandering whether LLVM provides some kind of pass or builder which will generate the Control Dependence Graph? Thanks, Arsen -- View this message in context: http://llvm.1065342.n5.nabble.com/Control-Dependence-Graph-builder-tp56687.html Sent from the

On 4/12/13 2:37 PM, Arsen wrote: > Hello All, > > I am interested in Control Dependence Graph building using the CFG and > Dominance Frontier provided by corresponding passes. Just wandering whether > LLVM provides some kind of pass or builder which will generate the Control > Dependence Graph? I think the PostDominanceFrontier analysis was removed from LLVM, but the

On Aug 5, 2004, at 5:30 PM, Chris Lattner wrote: > On Thu, 5 Aug 2004, Michael McCracken wrote: > >> Hi, I have a hopefully quick question. I'm writing a Pass that needs >> to >> see a whole module at a time and keep some state, so I subclassed >> Pass. >> However, I want to be able to see the Loops in each Function. Roughly, > > ok. > >>

On Sun, Nov 3, 2013 at 1:02 AM, Daniel Berlin <dberlin at dberlin.org> wrote: > Is there a reason this is better than the modified algorithm created > by Ferrante? > It looks like yours has as bad a worst case time bound in reality. > That is, the algorithm runs in O(sum of the size of all the dominance > frontiers). > > http://www.cs.rice.edu/~keith/Embed/dom.pdf >

On Sun, Nov 3, 2013 at 1:02 AM, Daniel Berlin <dberlin at dberlin.org> wrote: > As for a "better" way to implement PRE, it depends on what algorithm > you want to use. If you just want to write a PRE pass, that's easy > enough without dominance frontiers. > I simply want to write a PRE pass to get a better understanding of the transformation. Any tips on where to

On Sun, Nov 3, 2013 at 9:19 AM, Christopher Wood <christopherwood07 at gmail.com> wrote: > On Sun, Nov 3, 2013 at 1:02 AM, Daniel Berlin <dberlin at dberlin.org> wrote: >> >> As for a "better" way to implement PRE, it depends on what algorithm >> you want to use. If you just want to write a PRE pass, that's easy >> enough without dominance

Hi Tanya, I was spelunking through bugzilla and ran into an old mailing list link http://lists.cs.uiuc.edu/pipermail/llvmdev/2006-January/005137.html (found in PR36). I expect this link to be broken since our servers are not on that domain. No big deal, just change it to lists.llvm.org: http://lists.llvm.org/pipermail/llvmdev/2006-January/005137.html Looks like that doesn't exist, as the