search for: stanier

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

...->getName() == "". As far as I know, llvm-dis just generates numbers in order for un-named instructions. When the instruction has a name (value->getName() == "the_name"), you get %the_name instead of the number. Does that make sense? On Wed, Apr 15, 2009 at 6:20 AM, James Stanier <j.stanier at sussex.ac.uk> wrote: > > 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...

...ownload? 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 regions. http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20100712/104247.html I know James Stanier was once working on a structural analysis pass: j.stanier at sussex.ac.uk He implemented such a pass for LLVM, however the pass required some cleanups and performance optimizations. I am not sure what the current status of this work is. Tobias

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

James Stanier wrote: > 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, a...

Hi folks, A few months back I finished writing and testing a pass which implements "structural analysis" as described originally by Sharir in 1980 ("Structural analysis: A new approach to flow analysis in optimizing compilers") and more recently by Muchnick in Advanced Compiler Design and Implementation. It analyses the CFG and recognises specific region schema, such as

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

...frontend] -> bc bc -> [your tool using llvm bitcode reader writer library, doing whatever mutations to the IR you want and spitting out bc again] -> bc bc -> [llvm backend (llc)/llvm-as/...] -> native code. Doesn't that meet your requirements? On Wed, Mar 25, 2009 at 8:09 PM, jstanier <j.stanier at sussex.ac.uk> wrote: > > Thank you both for your answers. > > The only reason I was interested in not using the built-in parsing library > was that it would give me more flexibility over the language I program in, > but if it means brushing up on my C++ then th...

On Fri, Mar 27, 2009 at 11:18 PM, jstanier <j.stanier at sussex.ac.uk> wrote: > > Hi again everyone... > > After following the "Writing an LLVM Pass" tutorial using LLVM 2.5, there > is > a part that states that: > > "This makefile specifies that all of the .cpp files in the current > directo...

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

Thank you both for your answers. The only reason I was interested in not using the built-in parsing library was that it would give me more flexibility over the language I program in, but if it means brushing up on my C++ then this isn't too much of a problem either. With regards to using the in-memory LLVM, that's also a good approach. However, I was thinking of structuring my thesis

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 s...

Hi again everyone... After following the "Writing an LLVM Pass" tutorial using LLVM 2.5, there is a part that states that: "This makefile specifies that all of the .cpp files in the current directory are to be compiled and linked together into a Debug/lib/Hello.so shared object that can be dynamically loaded by the opt or bugpoint tools via their -load options."

James Stanier wrote: > 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 wri...

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...

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 LoopPa...

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, som...

...to be rediscovered. However, a loop hierarchy optimizer could be applied to MLIR just as well as to LLVM-IR. References ---------- [1] http://llvm.org/devmtg/2018-10/talk-abstracts.html#talk11 [2] https://ieeexplore.ieee.org/abstract/document/5389392/ [3] http://sro.sussex.ac.uk/id/eprint/7576/1/Stanier,_James.pdf [4] https://blogs.msdn.microsoft.com/ericlippert/2012/06/08/persistence-facades-and-roslyns-red-green-trees/ [5] https://github.com/Meinersbur/llvm-project/tree/LOF/llvm/lib/LOF [6] https://llvm.org/devmtg/2017-10/#src2 [7] https://arxiv.org/abs/1811.00632 [8] https://lists.llvm.org/pipe...

Hi everyone, I'm currently in the first year of my PhD, and I'm going to be looking at an experimental IR for my thesis. After looking at a variety of research compilers I've come to the conclusion that LLVM is the nicest to work with for my purposes. I was considering writing the code to construct this experimental IR from LLVM assembly, and then at the end of the process (i.e. new