search for: pldi

Dear all, I am trying to reproduce the "Percent May Alias" result described in PLDI 07's paper "Making Context-Sensitive Points-to Analysis with Heap Cloning Practical For The Real World" (http://llvm.org/pubs/2007-06-10-PLDI-DSA.html ). However, my "Percent May Alias" for all the benchmarks is much greater, especially "bzip2". The DSA code I us...

...ar, no one has had sufficient desire/motivation to > design and implement the improvements. > > Regards, > > John Criswell > > > > On 4/6/15 4:56 PM, Wan Zhiyuan wrote: > > Dear all, > I am trying to reproduce the "Percent May Alias" result described in PLDI > 07's paper "Making Context-Sensitive Points-to Analysis with Heap Cloning > Practical For The Real World" ( > http://llvm.org/pubs/2007-06-10-PLDI-DSA.html). > > However, my "Percent May Alias" for all the benchmarks is much greater, > especially "b...

...removing them after assembly code generation. It turned out that such sc-preserving compilation only caused ~4% slowdown for 18 benchmarks on average on a Intel Xeon machine. The result surprised me a lot because it was reported that such naive way of compilation can cause 20% slowdown in a recent PLDI paper (they also use LLVM), so I posted this question. I will try to examine if the generated binary code really respects sc fences. Yuelu ________________________________________ From: 陳韋任 (Wei-Ren Chen) [chenwj at iis.sinica.edu.tw] Sent: Wednesday, October 17, 2012 9:00 AM To: Duan, Yue Lu Cc:...

Hi, all I just downloaded the latest version of llvm. I am interested in the data structure analysis of llvm described in this year PLDI paper, titled "Making Context-Sensitive Points-to Analysis with Heap Cloning Practical For The Real World". However, I could not find any source code that seem to do the analysis. I noticed that in llvm 1.9 release, there is a subdirectory named "DataStructure" under "lib/A...

...removing them after assembly code generation. It turned out that such sc-preserving compilation only caused ~4% slowdown for 18 benchmarks on average on a Intel Xeon machine. The result surprised me a lot because it was reported that such naive way of compilation can cause 20% slowdown in a recent PLDI paper (they also use LLVM), so I posted this question. I will try to examine if the generated binary code really respects sc fences. Perhaps I'm misunderstanding something, but why are you removing the fences before code generation? I would think that removing the fences would permit the hardw...

On Aug 22, 2007, at 8:12 PM, Haifeng He wrote: > Hi, all > > I just downloaded the latest version of llvm. I am interested in the > data structure analysis of llvm described in this year PLDI paper, > titled "Making Context-Sensitive Points-to Analysis with Heap Cloning > Practical For The Real World". However, I could not find any source > code that seem to do the analysis. I noticed that in llvm 1.9 release, > there is a subdirectory named "DataStructure&quo...

Hi, The paper is "A Case for an SC-Preserving Compiler" from PLDI 2011. What I did is following their "naive SC preserving compilation", that restricts the compiler to do any reordering for potentially shared load/store instructions. The paper says the resulting code running on x86 machine (SC-preserving binary run on non-SC hardware) will get 22% slowd...

... A Generalized Algorithm for Graph-Coloring Register Allocation by Michael D. Smith, Norman Ramsey and Glenn Holloway      http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html 2) Register allocation by puzzle solving by Fernando Magno Quintão Pereira, Jens Palsberg      http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdf I think I've seen a few more papers on this topic, but cannot remember them at the moment. If I find more papers in my collection I'll let you know. /Roman >________________________________ >Von: Jakob Stoklund Olesen <stoklund at 2pi.dk> >An: Leo Roman...

On Sep 27, 2011, at 12:11 AM, Leo Romanoff wrote: > Quite some of these register allocation proposals are also able to handle overlapping register classes. That's interesting. Do you have any references? /jakob -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110927/e4b1f13d/attachment.html>

Hi, I'm a student who is going to make a countermeasure for dangling pointers in c for his thesis. I need to make my source transformation using llvm. Nobody in my university already used LLVM. I already read a some documentation about llvm but i'm still lost. Do there exist some " examples/Tutorials" for making small source transformations. Or is there somebody who can help

...ysis pass, correct? The inter-procedural part is in the Bottom Up, > Complete Bottom Up, and Top Down passes. > Ok, I read Chris's thesis, and only knew the basic framework, so i want to debug the code to > learn that in more depth. > You can also get information on DSA from the PLDI 2007 paper (http://llvm.org/pubs/2007-06-10-PLDI-DSA.html). -- John T. > -- John T. > > Tianwei wrote: > >> Hi, all: >> Recently I am debugging the DSA and want to learn how it work, and now I am checking the local datastructure analysis. >> I use the followin...

...ave incorporated it into their commercial products, reflecting its simplicity, flexibility, and versatility. Lattner joined Apple, Inc. in 2005, and is currently the chief architect of the Apple Compiler Group. He is to receive the award at the 2010 Programming Language Design and Implementation (PLDI) conference in Toronto, Canada, June 5 to 10. Read more about it here: http://www.acm.org/press-room/news-releases/2010/sigplan-software-award/view Congratulations to Chris on this well-deserved award! - Doug -------------- next part -------------- An HTML attachment was scrubbed... URL: &l...

/* 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...

...ng of LLVM off and on for a while. I’m trying to understand the current status of the LLVM undef/poison semantics from a frontend/verification perspective. I saw there was a lot of interest in a proposed semantics in late 2016 and mid-2017. Perhaps this was due to the “Taming Undefined..." PLDI paper, which seemed like a nice writeup. I'd like to formalize this in a theorem prover or Cryptol. Since the mid 2017 discussion, is there an emerging consensus of the semantics of undef/poison? If so, is there a newer writeup than the PLDI paper? The paper semantics in Section 4 on bitvec...

I sent this Email to Chris Lattner and he suggested that I send it to this group. >>After reading your PLDI paper, I found the LLVM Alias Analysis >>Infrastructure page. >> >>It says that there is an implementation of Steensgaard's algorithm >>and your DSA algorithm in the >>"optional poolalloc module". I have searched all over the LLVM >>web site, a...

...1MemoryDependenceAnalysis.html. For DSA, you will want to read the documentation 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 point...

On Wed, Apr 23, 2008 at 11:59 PM, John Criswell <criswell at cs.uiuc.edu> wrote: > Dear Tianwei, > > You can use the -analyze option to the opt tool to tell the DSA passes > to store their results in files. When you use the -analyze option, the > DSA passes will create a separate file for each function (and possible > one file to hold the globals graph). For this reason,

...eng On 8/22/07, Chris Lattner <sabre at nondot.org> wrote: > > On Aug 22, 2007, at 8:12 PM, Haifeng He wrote: > > > Hi, all > > > > I just downloaded the latest version of llvm. I am interested in the > > data structure analysis of llvm described in this year PLDI paper, > > titled "Making Context-Sensitive Points-to Analysis with Heap Cloning > > Practical For The Real World". However, I could not find any source > > code that seem to do the analysis. I noticed that in llvm 1.9 release, > > there is a subdirectory named &qu...

...- I believe it's not possible to make newgvn correct with undef. See for example the discussion here: https://bugs.llvm.org/show_bug.cgi?id=33165 - A bunch of optimizations are correct with poison but not with undef (see John's blog posts, my talk at LLVM conf last year, our recent paper on PLDI, etc) This proposal is not very radical; it's just to change a few error behaviors to poison and shouldn't have any practical effect for the time being. (so the change is documentation only) Later we can continue the work until we have completely removed undef. Even if we don't go the...

...ase check with lib/CodeGen/StrongPHIElimination.cpp and the papers like Budimlic, et al. Fast copy coalescing and live-range identification. // In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language // Design and Implementation (Berlin, Germany, June 17 - 19, 2002). // PLDI '02. ACM, New York, NY, 25-32. Boissinot, et al. Revisiting Out-of-SSA Translation for Correctness, Code // Quality and Efficiency, // In Proceedings of the 7th annual IEEE/ACM International Symposium on Code // Generation and Optimization (Seattle, Washington, March 22 - 25, 2009). //...