similar to: [LLVMdev] [GSoC] Interface layer for optimizers

On 3/23/2011 6:07 AM, Крылов Владислав wrote: > Hi folks, > > I like open technologies, epecially LLVM compiler. I want to implement > a new interface layer in LLVM to plug-in optimizers as a part of GSoC, > and then load the interface with optimizers. LLVM already has a plug-in framework for loading new analysis and optimization passes

Hello. Guys, sorry for delay, I thinked about things, overlooked LLVM project in search of a suitable case. I have noticed that at this time in LLVM you actively implement the possibility of automatic parallelization. I am interested in this direction and I would like participate in a project Polly as my GSoC project. I have looked over todo list [1]. I really want to implement "Increase

Hello, I want to present my project for GSoC 2011 for LLVM below. It would be very nice to hear suggestions and your opinion, thanks! Superoptimization for LLVM IR Objective This project focuses on implementing superoptimization algorithms targeted at the LLVM IR. The project uses arbitrary LLVM bitcode as a training set to discover new peephole optimizations that can be later integrated into

We (the folks working on Souper) would appreciate any feedback on these IR-level superoptimizer results: http://blog.regehr.org/extra_files/souper-jul-15.html My impression is that while there's clearly plenty of material in here that doesn't want to get implemented in an opt pass, there are a number of gems hiding in there that are worth implementing. Blog post containing

Here's an idea for a research project that I thought I'd put out there since probably nobody in my group will have time to follow up on it. It would be interesting to take ideas from this superoptimizer for x86: http://theory.stanford.edu/~aiken/publications/papers/asplos06.pdf http://theory.stanford.edu/~sbansal/superoptimizer.html and adapt them to run on LLVM code. It would

Hi guys, In next three years I'm going to get the scientific degree in System programming. That's why I'm looking for the interesting and actual theme not like a new bicycle with square rings. My degree work in university was connected with value range propagation (VRP) functionality in clang static analyzer based on AST. I founded it rather interesting and want to follow this

One thing that is important to consider is where in the pipeline these kinds of optimizations fit. We normally try to put the IR into a canonical simplified form in the mid-level optimizer. This form is supposed to be whatever is most useful for exposing other optimizations, and for lowering, but only in a generic sense. We do have some optimizations near the end of our pipeline (vectorization,

A bit of feedback on this proposal: It worries me that you talk about "extending the number of transformations." The point of a superoptimizer is that it has no specific model of transformations. Rather, it is simply looking for cheap code fragments that are equivalent to expensive ones. You have not specified how you will perform equivalence checking between code sequences. The

Hi Guys, I checked the open projects on LLVM site, and superoptimizer theme seems to be quite interesting for me. So im going to write the LLVM superoptimizer (http://theory.stanford.edu/~aiken/publications/papers/asplos06.pdf) :) Is this theme still actual? Could you please advise me some usefull articles? -- Best regards, Sergey 2012/5/26 Serg Anohovsky <serg.anohovsky at gmail.com>: >

On 07/22/2015 01:28 PM, Sean Silva wrote: > > > On Wed, Jul 22, 2015 at 12:54 PM, Hal Finkel <hfinkel at anl.gov > <mailto:hfinkel at anl.gov>> wrote: > > One thing that is important to consider is where in the pipeline > these kinds of optimizations fit. We normally try to put the IR > into a canonical simplified form in the mid-level optimizer.

Hello all, thanks for the feedback! It sounds like you are planning to follow the approach of Joshi, Nelson and > Randall ("Denali: A Goal-directed Superoptimizer") in that you don't intend > to exhaustively enumerate all possible code sequences, and see if they are > the same as the original only better; but instead start from the original > code > sequence and

> example (x+y)-x -> y. Here the right-hand side "y" is a particularly simple > subexpression of the original :) Yeah. We have not found a lot of this kind of thing-- it looks like you and others scooped up a lot of the low-hanging fruit! John

Hi, In browsing through the LLVM source, I don't currently see an implementation for a control dependence graph builder. Am I overlooking something? It doesn't look like LLVM currently provides a way to build the post-dominance frontier of the reverse CFG, either. Dominators.h mentions forward dominators, but I believe all this is referring to is dominators as opposed to post-dominators,

Hi All, I'm relatively new to LLVM (but not optimizing compilers), and have been reading docs and browsing code. I noticed in the 2.4 release notes that a sparse propagation framework had been added based on the SCCP algorithm. I might have a need for exactly this kind of framework in order to prototype an analysis I have in mind. I also noticed, however, that this doesn't appear to be

Hi, On 23/07/15 19:11, Philip Reames wrote: > > > On 07/23/2015 07:24 AM, John Regehr wrote: >>> I guess another way to select interesting transformations could be to look >>> for sequences where the >>> result uses a "subset" of the input instruction sequence. >> >> Yeah, I had been noticing those subsets too. It sounds like it's

IMO super optimizer would yield less benefits on LLVM compared to other compilers. If you check the patch of the instcombine pass, you'll find out people keep dragging "correct" optimization out, not because the optimization violates the semantic of LLVM IR, but it will generate wrong code sequences when lowering to machine code. An example: %3 = fcmp %1, %2 %6 = fcmp %4, %5 %7 =

I tried to join a samba4 to a win2008r2 level domain (OS level 2012) running exchange 2010. The join succeeds but the later replication is broken due to schema differences. In order to to find the cause, I started a test setup with: * a win2008r2 DC w/ minimal AD * upgraded the schema and the OS to 2012 (function level is still 2008r2) * and added a exchange server to the domain. And that is

On 07/23/2015 07:24 AM, John Regehr wrote: >> I guess another way to select interesting transformations could be to >> look for sequences where the >> result uses a "subset" of the input instruction sequence. > > Yeah, I had been noticing those subsets too. It sounds like it's > worth a try doing a run that looks only for those. > > One nice thing

> I guess another way to select interesting transformations could be to look for sequences where the > result uses a "subset" of the input instruction sequence. Yeah, I had been noticing those subsets too. It sounds like it's worth a try doing a run that looks only for those. One nice thing is that if we're just looking for subsets, we will not even give the

On Wed, May 27, 2009 at 5:26 PM, Mark Lacey <superoptimizer at gmail.com> wrote: > Hi All, > Hi Mark, > I'm relatively new to LLVM (but not optimizing compilers), and have been > reading docs and browsing code. > Bienvenue! > I noticed in the 2.4 release notes that a sparse propagation framework had > been added based on the SCCP algorithm. I might have a need for