search for: lattnerphdthesi

For anyone who is interested: http://llvm.cs.uiuc.edu/pubs/2005-05-04-LattnerPHDThesis.html -Chris -- http://nondot.org/sabre/ http://llvm.cs.uiuc.edu/

Hi, Chapter 4 in http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html compares the precision of alias analysis in LLVM at that time. Does the latest LLVM still follow the similar results? I was also wondering how the globalmodred-aa and scev-aa that were not discussed in the PhD thesis are compared with others? Thanks and Happy New Year! -- Jianzhou

Hi Jianzhou, The best source of documentation for the poolalloc project remains Chris Lattner's dissertation: http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html Chapter 5 specifically if you'd like information on the poolalloc transformation. In addition to the thesis, there is also a brief manual for information on data structure analysis: http://llvm.org/svn/llvm-project/poolalloc/trunk/dsa-manual/ Tarek

On Jan 2, 2012, at 9:42 PM, Jianzhou Zhao wrote: > Hi, > > Chapter 4 in http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html > compares the precision of alias analysis in LLVM at that time. Does > the latest LLVM still follow the similar results? I was also wondering > how the globalmodred-aa and scev-aa that were not discussed in the PhD > thesis are compared with others? Thanks and Happy New Year! Hi...

On Thu, 5 May 2005, Markus F.X.J. Oberhumer wrote: > Chris, > Chris Lattner wrote: >> For anyone who is interested: >> http://llvm.cs.uiuc.edu/pubs/2005-05-04-LattnerPHDThesis.html > > many congrats, and best wishes for the future! Thanks all! > And I hope you still will have some time to look after LLVM and won't > get too distracted by some new exciting other projects :-) I was fortunate enough to find a position where I can continue llvm hacking....

...in the docs subdirectory of the poolalloc project (if you don't know how to download poolalloc, please feel free to ask on the list). You may also want to read the paper on DSA (http://llvm.org/pubs/2007-06-10-PLDI-DSA.html) and Chris Lattner's thesis (http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html). Note that DSA is a unification-based points-to analysis (among other things): it will generate for you a graph in which each node represents an abstract memory object and the edges represent pointers between memory objects (for example, it can tell you that field 5 of abstract memory o...

...in pointer analyses will benefit what kinds of optimization passes? >> Yes. >> Chris did many years ago, and i've done one more recently. > > Great! Are they published somewhere? Can the data be shared somehow? My results are published here: http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html <http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html> Sadly, they are over a decade out of date, and some things have changed since then :-) >> PS2: If no such evaluation exists in the past, I'd happy to do that myself and report back my findings if anyone here is interest...

On 22.06.2011, at 17:03, John Criswell wrote: > On 6/22/11 5:34 AM, Andreas Wilhelm wrote: >> >> Hello, >> >> I'm looking for a way to identify dependencies of function-pairs (memory-dependency, control-dependency...) in order to parallelize them. >> For aliasing problems I use the DataStructureAnalysis. > > I'm assuming that this is the DSA

On Tuesday 23 June 2009 18:36:06 John Criswell wrote: > The Automatic Pool Allocation transform is publicly available (though > not as well publicized as LLVM). What exactly is it? (just curious!) -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e

/* snip topic */ What exactly does poolalloc do? I did a quick look through the svn code and readme and it looks like it hooks functions that llvm compiles in some-way...

On Tue, Jan 3, 2012 at 3:54 PM, Chris Lattner <clattner at apple.com> wrote: > > On Jan 2, 2012, at 9:42 PM, Jianzhou Zhao wrote: > >> Hi, >> >> Chapter 4 in http://llvm.org/pubs/2005-05-04-LattnerPHDThesis.html >> compares the precision of alias analysis in LLVM at that time. Does >> the latest LLVM still follow the similar results? I was also wondering >> how the globalmodred-aa and scev-aa that were not discussed in the PhD >> thesis are compared with others? Thanks and Hap...

> > > For the example to work here the CSE pass itself needs to be > flow-sensitive and context-sensitive. I don't think that's how most > optimizations in LLVM work. If it is, then I agree with all you said. But > if it isn't, there's no point in bumping up the context sensitivity just > for the pointer analysis. > > As Daniel mentioned earlier in this

Right now I am writing passes just to look for arrays & structs I am trying to identify the array by parsing the memory description(use regex's) ex./ { [20 x i8], i32 } *- for a struct. is a structure with a character array of size 20 and an integer. I'm not sure if llvm provides an easier way to do this? The type id for most arrays comes out to be a pointer rather than an array, its

...g Apple Computer's Compiler and Tools group, where I will continue open-source LLVM development. Stay tuned for good things to come! Oh yeah, if you are interested in some of the nifty things that can be done with LLVM, take a look at my thesis: :) http://llvm.cs.uiuc.edu/pubs/2005-05-04-LattnerPHDThesis.html -Chris -- http://nondot.org/sabre/ http://llvm.cs.uiuc.edu/

Hi Daniel, On 03/21/2016 11:05 AM, Daniel Berlin wrote: > > > On Tue, Mar 15, 2016 at 1:37 PM, Jia Chen via llvm-dev > <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: > > Dear llvm devs, > > tl;dr: What prevents llvm from switching to a fancier pointer > analysis? > > > Nothing. > > > Currently,

On 03/28/2016 12:37 AM, Chris Lattner wrote: > It changes all the time. Here’s a trivial example, assume no inlining > and no AA other than the one in question: > > std::vector<int> V1 = { 1, 2, 3 }; > std::vector<int> V2 = { 4, 5, 6 }; > > V1.pop_back(); // Mutates *this > > auto length = V1.size(); > > V2.pop_back(); //