similar to: [LLVMdev] Guidance to understand the Vectorization framework of LLVM

Nick Lewycky wrote: > Andreas Bolka wrote: >> Hi all, >> >> I'd like to have a first stab at a loop-based auto-vectorization pass as >> part of 2009's Google Summer of Code program. As far as I can tell from >> searching the mailing list archives, no work on such an auto-vectorizer >> seems to be currently in progress. > > Hi Andreas, >

On Mar 31, 2009, at 5:27 PM, Andreas Bolka wrote: > Hi all, > I'd like to have a first stab at a loop-based auto-vectorization > pass as > part of 2009's Google Summer of Code program. As far as I can tell > from > searching the mailing list archives, no work on such an auto- > vectorizer > seems to be currently in progress. Hi Andreas, This would be a very

The GVN algorithm used in LLVM currently (I'm rewriting it) is the basic hash based RPO algorithm. The new one i'm writing is based on http://dl.acm.org/citation.cfm?id=512536 (see https://github.com/dberlin/llvm-gvn-rewrite) LLVM has different algorithms for both scalar PRE and load PRE. They are basically variants of standard PRE algorithms transformed into SSA, but with some

On Mon, Feb 14, 2011 at 3:49 PM, Peter Lawrence <peterl95124 at sbcglobal.net> wrote: > Andrew, >                your response highlights a naming problem in LLVM, > which is that  "array" and "vector" > mean the same thing in normal computer language and compiler theory > usage, so it is > inconvenient and misleading within LLVM to give one a very

Ralf, Ok, thanks, I'll have a look. The paper I was referencing was http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.668 from '90 I believe. There is also an Intel paper the expands on this for the Itanium. On Fri, Jan 6, 2012 at 12:34 PM, Ralf Karrenberg < karrenberg at cdl.uni-saarland.de> wrote: > Hi, > > I am not sure if I know the paper you mentioned, but

Hi, On Nov 29, 2007 6:19 PM, Chris Lattner <sabre at nondot.org> wrote: > On Thu, 29 Nov 2007, Wojciech Matyjewicz wrote: > > As for the dependence analysis, I need this piece for my project, and I > > am preparing myself to write it. > > Great! > > > I am currently studying some papers, but haven't yet decided on the > > method. Maybe some of you

Actually i have to implement strength reduction, for that i have to first detect induction variables using ALLEN-COCKE-KENNEDY algorithm. To find out induction variables, i need the name of the instruction. Thanks for the reply. Devang Patel-2 wrote: > > On Fri, Mar 26, 2010 at 6:53 AM, help__me_please > <krishnadhan at cse.iitb.ac.in> wrote: >> >> Can anyone tell how

1. I have a list of lm (linear model) objects. Is it possible to select, through subscripts, a particular element (say, the intercept) from all the models? I've tried something like this: List[[1:length(list)]][1] All members of the list are similar. My goal is to have a list of the intercepts and lists of other estimated parameters. Is it better to convert to a matrix? How to do this? 2.

>> Yes, I'd strongly suggest implementing one of the approaches based >> on the >> chrec analysis we have in the scev pass. >> > > Yup, just get the array accesses under scev form, and set a constraint > system from these. Once you set up the constraint systems for the > dependence distance vectors, you're almost done. You can look at how > this

Hi all! I have recently finished the first prototype of data dependence analysis for LLVM. Now that I have some more time I would like to prepare a "production" version. In this post I'll try to describe the current state and propose a work plan. Currently, the analysis has a very simplified interface (it allows to query for dependence between two given instructions or whether a

Hi, As Christmas approaches rapidly I would like to get some suggestions for interesting compiler books, papers and other type of information that one can read the few slow days over Christmas. Any recommendations ? I have the dragon book, but it would be fun to read something on what is happening in modern compilers. /Fred

Hi, > Actually i have to implement strength reduction, for that i have to first > detect induction variables using ALLEN-COCKE-KENNEDY algorithm. To find out > induction variables, i need the name of the instruction. I suspect you are confused. Surely you only need a way of referring to each instruction. For this you can use a pointer to the instruction. Ciao, Duncan.

On 6/29/15 5:16 AM, Evgeny Astigeevich wrote: > Hi Anirudh, > > 'x' has a control dependency on 'y' because the value assigned to 'x' > depends on a path selected. This dependency can be converted into a data > dependency by means of a 'select' instruction because the control flow is > simple. Just an FYI, there is an optimization called

Hi all, I'd like to have a first stab at a loop-based auto-vectorization pass as part of 2009's Google Summer of Code program. As far as I can tell from searching the mailing list archives, no work on such an auto-vectorizer seems to be currently in progress. Whereas auto-vectorization is a well-researched topic, complexity seems to quickly explode once more advanced loop constructs are

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

It seems like single file flac with embedded cuesheet is a pretty good solution to archiving a cd collection and avoids issues with track gaps etc. What's the situation with player support for these files? It seems that most players I've seen assume 1 file == 1 song. Stephen.

I would be very glad of pointers to information on how the concepts of packages, namespaces and environments are interrelated in R. I am trying to get a handle on this both so I can delve further into understanding other people's code and so I can organize my own in a more coherent manner. From my reading about environments it seems they function as what I would intuitively call

Hi. I am a little unclear about the ARM JIT support status. Is it working as of LLVM 3.1? If not, is it on the roadmap for LLVM 3.2? I am not currently interested in NEON support so if thats unimplemented, thats fine. thanks, Rahul

Hi, I am trying to understand and change the network buffering that is being used by Remus, the HA solution present in Xen. From what i understood from reading the code, Remus calls the postsuspend method of the BufferedNIC after it suspends the domain that sends TC_PLUG_CHECKPOINT message and start the buffering and then calls the commit method of BufferedNIC after it gets the acknowledgement

I'd like to plot data that's in the form of a table such as this: 1 2 4 6 8 12 a 10 11 12 14 15 30 b 2 3 3 4 5 5 c 1 1 2 2 3 3 Where the row headers are the results for different series of tests, and the column headers are the x-values. I'd like to plot this as a set of lines, one each for "a", "b", and "c". I can rearrange the data as needed, but