similar to: [LLVMdev] Seeking advice on Structural Analysis pass

On Mar 13, 2010, at 11:54 AM, James Stanier wrote: > It > analyses the CFG and recognises specific region schema, such as if- > then, > if-then-else, while-loop, etc., and builds a "control tree" which > represents > the hierarchical structure of the input program. I am not sure if my definition of a control flow tree is the same as yours, but if it is, I am very

On 03/13/2010 08:54 PM, James Stanier wrote: > > Hi folks, Hi James, I have also been working on such a pass for the last couple of month. The pass itself is finished and ether has written some further LLVM support implementing a RegionPass class, that can be used to implement region passes that work like the existing LoopPasses today, but use a region instead of a loop or function as

On 03/16/2010 05:02 PM, James Stanier wrote: > > Hi Trevor, > > I just studied your diagrams -- I *think* that the "control tree" of > structural analysis is not same as the "control flow tree" from your own > Java work. However, as you understand your work more than I do, I present > you with some fancy coloured diagrams that I drew that might help you

Hi Trevor, I just studied your diagrams -- I *think* that the "control tree" of structural analysis is not same as the "control flow tree" from your own Java work. However, as you understand your work more than I do, I present you with some fancy coloured diagrams that I drew that might help you (and others!) understand what structural analysis does a bit better than the

Hi everyone, I have a terrible feeling I'm doing something really silly here, but I can't seem to solve the problem after a day of trying now. I'm currently writing my own pass which I am running by loading it into the opt tool. Everything I had written in the pass so far had worked, until I started declaring an #include of some extra header files which I had written myself (they are

On 03/15/2010 05:51 PM, James Stanier wrote: > > Hi Tobias, Hi, > > Thanks for getting back to me. I have just had a peek at the documentation > for your region pass, and it looks really cool, and thanks also for the > pointers to the literature. > > If you want an overview of how structural analysis works, some of the pages > from Muchnick's textbook are available

On Apr 3, 2007, at 10:55 AM, Andrew Lenharth wrote: > On 4/2/07, Fabian Scheler <fabian.scheler at gmail.com> wrote: >> Hello everybody, >> >> I'm curious whether there have been any attempts to perform >> performance analysis on the LLVA level. I am interested in the >> derivation of flow-facts (loop bounds etc. - what about the >>

On 07/20/10 02:24, Jianzhou Zhao wrote: > Hi, > > Is the structural analysis pass discussed in > http://comments.gmane.org/gmane.comp.compilers.llvm.devel/30213 still > available to download? Hi, I recently proposed the RegionInfo pass for LLVM. It is not a complete structural analysis pass, however it builds an sese region tree and can probably be extended to classify the

> > LLVA specifically is refering to a research project offshoot of llvm. > > LLVM instructions do not have 1:1 mappings to native instructions > > (sometimes multiple llvm instructions map to fewer native insts, > > sometimes the other way around). > > That's correct, and furthermore, LLVA (now called SVA = Secure > Virtual Architecture) uses essentially the

Hi fellows, I am writing to ask what is the algorithm implemented in LLVM's RegionInfo.h/cpp. In the header file "RegionInfo.h", it says "Calculates a program structure tree built out of single entry single exit regions (defined in a 1994 paper called "The Program Structure Tree"). ... ... The algorithm to calculate these data structures however is COMPLETELY

Hi Tobias, Thanks a lot for the detailed reply. I am working on several new optimizations for OpenCL kernels for a DSP architecture. The project itself has an NDA associated with it, so I cannot go into more details, but the source will be open to public after completion. One of the first steps is to serialize the work-items in a work-group (e.g., insert nested loops around REGIONs in

hi all, On 2010-1-7 0:11, John Mosby wrote: > In LLVM we could add support for generalized CFG regions and > RegionPasses. A region is a part of the CFG. The only information we > have is, that it has one entry and one exit, this it can be optimized > separately. > I think this is the best way to add region analysis. I must admit > this approach > helps me on another,

Hi Tobi, I have one additional question about the RegionInfo::isRegion function. In the second case (i.e. Entry dominates Exit), why is checking the following two conditions are equivalent to checking it's a refined region: For any BB in DF(exit), 1) BB should be in DF(entry) 2) BB reachable only from entry through a path passing exit.

I''ve started working on a new tool that should help with modifying the configuration of a system under the control of puppet. The tool is called cft (pronounced ''sift'') and is inspired by Gnome''s Sabayon[1] in taht it watches how an admin changes a system and spits out a puppet manifest based on its observations. Cft''s website is

hi,all does some one had use the cft tool to build manifest for puppet on the debian os ? I just test it,can''t work ,so sad. huangmingyou --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Puppet Users" group. To post to this group, send email to puppet-users@googlegroups.com To unsubscribe

Hi everyone, I'm currently trying to run a study on irreducibility of C programs, and I've implemented structural analysis (original paper by Sharir, algorithm in Muchnick's book) as an LLVM pass. When my implementation becomes a bit less buggy I'll certainly look into including it in the LLVM project. As a test for the algorithm I've been producing LLVM bitcode for C files

Hello everyone, I'm currently constructing a graph from LLVM bitcode, and I have a question about accessing the names of the variables shown in the .ll assembly file, assuming it's possible... For example, with %2 = load i32* %x_addr, align 4 ; <i32> [#uses=1] I can retrieve the opcodeName() from the Instruction object, which is "load". I can also access the operand

Hi Tobias, My RegionSimplify pass adds new exit node for refined regions to convert them into simple region. However, the RegionInfo pass does not seem to recognize those changes. For example, in the attached file, bb4.region is supposed to be in the first region. My RegionExtractor pass required the extracted region to be simple. Should we modify RegionInfo or is their away to preserve the

Tobias, Thanks for taking the time to summarize all this. It's a great writeup. I'm moving the thread to llvm-dev. My responses below. On May 21, 2012, at 5:06 AM, Tobias Grosser <tobias at grosser.es> wrote: > First of all some information about the RegionInfo pass: > > ======================================================================= > The very first paper I

On Fri, May 2, 2014 at 5:30 PM, Tobias Grosser <tobias at grosser.es> wrote: > On 03/05/2014 00:15, Paul Vario wrote: > >> Hi Tobias, >> >> Thanks so much for the quick response. Your approach fixes the >> issue. >> On a bigger context, would it make more sense to make the region >> exit >> part of the region? For example, a while