similar to: [LLVMdev] Converting Machine code to LLVM IR

On 04/04/2012 07:08 AM, Charles Davis wrote: > Hi, > > Here's one of my proposals for GSoC 2012. What do you think? > > Chip > > Project Title: Table-Driven Decompilation > > Abstract: > Over the years, the LLVM family has grown to include nearly every type of build tool in existence. One of the few missing is a decompiler. LLVM's TableGen tool could

On 11/18/2011 01:36 PM, Marcello Maggioni wrote: > 2011/11/18 Marcello Maggioni<hayarms at gmail.com>: >> The patch is attached. >> >> The patch to correct the test runs on OSX will be posted shortly after >> this one (I preferred to separate the two so that a problem with >> either one of the two wouldn't give problems to the other and also to >>

On 03/28/2011 12:15 PM, Nipun Arora wrote: > Hi, > > I have been trying to run the memdep analysis using opt with the > following command: opt -analyze -memdep <*.bc>. > However, I keep getting the following error: Pass::print not implemented > for pass: 'Memory Dependence Analysis' ! . > I get similar errors for a lot of the analyses passes, which seem as if

On 08/05/2010 01:45 AM, David Greene wrote: > Do pushes to the LLVM git mirror get forwarded to the svn trunk > automatically? For various reasons it may be more convenient > for me to work on LLVM through git but I don't want to go through > a lot of pain to send patches to trunk via git. It should be > easy. > > Does anyone do their primary development via the git

On 01/08/2011 07:34 PM, Renato Golin wrote: > On 9 January 2011 00:07, Tobias Grosser<grosser at fim.uni-passau.de> wrote: >> Matching the target vector width in our heuristics will obviously give the >> best performance. So to get optimal performance Polly needs to take target >> data into account. > > Indeed! And even if you lack target information, you

On Mon, Mar 28, 2011 at 10:19 PM, Tobias Grosser <grosser at fim.uni-passau.de>wrote: > On 03/28/2011 09:12 AM, Justin Holewinski wrote: > >> Hi All, >> >> I am going to submit a GSoC proposal for LLVM this year, and I would >> like to first post it here to get constructive feedback before I submit >> it before the April 8 deadline. This is the first

Hi Tobi, Thanks for the response, could you point me to the source files of the memory dependence pass? Thanks Nipun On Mon, Mar 28, 2011 at 2:46 PM, Tobias Grosser <grosser at fim.uni-passau.de>wrote: > On 03/28/2011 12:15 PM, Nipun Arora wrote: > > Hi, > > > > I have been trying to run the memdep analysis using opt with the > > following command: opt -analyze

Hi, In fact I have some theory on instruction level parallelism( i have a partitioning algorithm), then first of all, i want to generate a multithreaded code from LLVM IR (in assembly level) with a given partitioning. My problem is how can i use a thread library(like Pthread) or OS system calls in LLVM IR to create and manage threads? --- On Tue, 10/5/10, Tobias Grosser <grosser at

On 12/06/2010 03:33 PM, Bob Wilson wrote: > > On Dec 6, 2010, at 10:40 AM, Tobias Grosser wrote: > >> Hi, >> >> I have been following the development of the /zorg/trunk/lnt project for >> a while and am wondering if there is some regular LLVM performance >> testing using LNT that can be accessed online? Are there any plans to >> create an officially

On 01/27/2011 12:48 AM, Vu Le wrote: > Hi Tobias, > If the PHI node at exit block of region R has multiple inputs from the R, > I split the exit block into 2. > The first block contains all PHI nodes whose input are all from the region. > The second is the new exit node. > > All branches (outside R) to the old exit now point the new exit. > All regions whose exit is the old

Oh, yes. My algorithm extracts regions in a top-down manner. I modified your RegionPass so that it only visits 2nd level regions. Those regions are extracted into functions and the process continues for the new functions. It's kind of messy since I've just played with LLVM. I'll modify the algorithm so it can extract regions bottom-up. Vu On Wed, Jan 26, 2011 at 10:10 PM, Tobias

2011/11/18 Marcello Maggioni <hayarms at gmail.com>: > 2011/11/15 Marcello Maggioni <hayarms at gmail.com>: >> 2011/11/14 Tobias Grosser <tobias at grosser.es>: >>> On 11/14/2011 02:45 PM, Marcello Maggioni wrote: >>>> >>>> 2011/11/14 Tobias Grosser<tobias at grosser.es>: >>>>> >>>>> On 11/14/2011 01:24

I guess even kaleidoscope would serve as a good tutorial -sanjiv On 24 May 2011 17:23, "Tobias Grosser" <grosser at fim.uni-passau.de> wrote: > > On 05/24/2011 05:18 AM, Christian Plessl wrote: > > > > On 28.02.2011, at 15:44, Tobias Grosser wrote: > > > >> On 02/28/2011 05:27 AM, Christian Plessl wrote: > >>> Hi everyone >

On 01/08/2011 06:52 PM, Renato Golin wrote: > On 8 January 2011 18:27, Tobias Grosser<grosser at fim.uni-passau.de> wrote: >> OK. First of all to agree on a name, we decided to call the Polyhedral >> analysis we develop PoLLy, as in Polly the parrot. ;-) Maybe it was a >> misleading choice? > > I never realised... ;) Polly it is! > > >> In general as I

On 09/19/2010 03:48 PM, Ben Laurie wrote: > Another suggestion I've been given is this: > http://gcc.gnu.org/wiki/CompileFarm. You wouldn't even have to supply > hardware. The compile farm is a set of machines that is shared between different users. They are great to try your code on different architectures, but the level of control is a lot lower than the level you get from

On 10/27/2010 01:59 PM, Xinliang David Li wrote: > A dumb question -- is there a way to dump cfg after each pass, something > like: --print-cfg-after=sccp, or is there a standard post-processing script > that builds the cfg vcg/dot file from the ir dump? You can use to create a dot file of everyfunction for an normal llvm-ir.ll file. opt -dot-cfg llvm-ir.ll If you store the dump in a

On 01/27/2011 02:27 PM, Vu Le wrote: > Oh, yes. > My algorithm extracts regions in a top-down manner. > I modified your RegionPass so that it only visits 2nd level regions. > Those regions are extracted into functions and the process > continues for the new functions. > It's kind of messy since I've just played with LLVM. > I'll modify the algorithm so it can

On 10/05/2010 09:42 AM, hamed hamzehi wrote: > Hi > yes, I'm asking for any advice, I want to implement multithreaded code > generator in LLVM. > tnx Hi, this generally depends which kind of code you want to multithread, because generally this is a difficult problem. However, if you limit yourself for the moment to loops that fit into the polyhedral model, you can take

Hi Tobias, If the PHI node at exit block of region R has multiple inputs from the R, I split the exit block into 2. The first block contains all PHI nodes whose input are all from the region. The second is the new exit node. All branches (outside R) to the old exit now point the new exit. All regions whose exit is the old exit are also updated with the new exit node. It works like a charm.

On 9 January 2011 00:07, Tobias Grosser <grosser at fim.uni-passau.de> wrote: > Matching the target vector width in our heuristics will obviously give the > best performance. So to get optimal performance Polly needs to take target > data into account. Indeed! And even if you lack target information, you won't generate wrong code. ;) > Talking about OpenCL. The lowering