similar to: [LLVMdev] Comparison of Alias Analysis in LLVM

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?

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

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:

On Jan 3, 2012, at 1:53 PM, Jianzhou Zhao wrote: > I see. I asked the question because LLVM provides several alias > analysis, and I was wondering how to decide which one should be used > for compiling most programs. > > I think the basicaa is the default one, but by looking into its code, > it is not inter-procedural or context-sensitive (I am not 100% sure), > so does not

On Tue, Jan 3, 2012 at 4:55 PM, Chris Lattner <clattner at apple.com> wrote: > On Jan 3, 2012, at 1:53 PM, Jianzhou Zhao wrote: >> I see. I asked the question because LLVM provides several alias >> analysis, and I was wondering how to decide which one should be used >> for compiling most programs. >> >> I think the basicaa is the default one, but by looking

On Wed, Jan 4, 2012 at 12:10 PM, David Gardner <daveg at xmos.com> wrote: > Jianzhou Zhao <jianzhou <at> seas.upenn.edu> writes: >> The documents say that all the aa analysis are chained, and give an >> example like opt -basicaa -ds-aa -licm. In this case, does ds-aa >> automatically call basicaa for the case when ds-aa can only return >> MayAlias? This

On 6/24/11 5:20 AM, Andreas Wilhelm wrote: > > Where can I find some information about MemoryDependenceAnalysis and > DataStructureAnalysis? > It would be interesting which kinds of dependence they're able to find > and which not. I haven't used MemoryDependenceAnalysis myself, but I recommend that you read its doxygen documentation:

Jianzhou Zhao <jianzhou <at> seas.upenn.edu> writes: > At this level, I can understand how it works. I was confused because I > have been looking at the source code for implementing them. All the > globalmodref, scev-aa, steenaa and ds-aa are only subclasses of the > AliasAnalysis class, so I cannot see how ds-aa can automatically call > basicaa. There's some magic

Jianzhou Zhao <jianzhou <at> seas.upenn.edu> writes: > The documents say that all the aa analysis are chained, and give an > example like opt -basicaa -ds-aa -licm. In this case, does ds-aa > automatically call basicaa for the case when ds-aa can only return > MayAlias? This looks magic to me. Is this handled by AnalysisGroup > magically? As I understand it, the

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/

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

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

Hi, I am using alias analysis to determine whether two values are alias or not. But I am not able to figure out the algorithm that is being used to determine May , Must and No Alias. Thanks and Regards Tarun Agrawal -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120225/e06daae7/attachment.html>

On Sat, Feb 25, 2012 at 8:44 AM, tarun agrawal <tarun at cse.iitb.ac.in> wrote: > Hi, > > I am using alias analysis to determine whether two values are alias or not. > But I am not able to figure out the algorithm that is being used to > determine > May , Must and No Alias. Here is the algorithm in high-level: http://llvm.org/docs/AliasAnalysis.html#exist > > >

Hey, I am currently working on a VM which is based on LLVM and I would like to use its optimizer, but it somehow it can't detect something very simple (I guess.) This is the LLVM IR: target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128" target triple = "i386-unknown-linux-gnu" %struct.regs = type { i32, i32, i32 } define void @Test(%struct.regs* noalias

On 06/20/2017 03:26 AM, Hal Finkel wrote: > Hi, Adrien, Hello Hal! Thanks for your answer! > Thanks for reporting this. I recommend that you file a bug report at > https://bugs.llvm.org/ Will do! > Whenever I see reports of missed optimization opportunities in the face > of ptrtoint/inttoptr, my first question is: why are these instructions > present in the first place? At

Hi all, This talk includes the performance comparison between LLVM and GCC (page 30/31): LLVM wins a lot for both compilation and execution time. http://llvm.org/pubs/2008-10-04-ACAT-LLVM-Intro.pdf That talk and data were in 2008, I was wondering if there is any updated performance evaluation between the latest LLVM and GCC? Thanks. -- Jianzhou

On Sun, Mar 15, 2015 at 4:34 PM Olivier Sallenave <ol.sall at gmail.com> wrote: > Hi Daniel, > > Thanks for your feedback. I would prefer not to write a new AA. Can't we > directly implement that traversal in BasicAA? > Can I ask why? Outside of the "well, it's another pass", i mean? BasicAA is stateless, so you can't cache, and you really don't

Dear all, I would like to share a paper I co-authored with Prof. Alper Sen. This paper describes an algorithm to generate testbenches from SystemC models represented with LLVM IR. It was accepted and presented at International Conference on Hardware/Software Codesign and System Synthesis (CODES/ISSS), 2012. A link to the paper is accessible from acm or Alper's website: