search for: toplas

...lementation of the ProfileInfo that estimates a profile as proposed in [Ball94]. (It distributes incoming flow in an block equally to the successor edges and assumes an loop iteration count of 10.) Andi [Ball94] Thomas Ball, James R. Larus: "Optimally profiling and tracing programs" ACM TOPLAS, Volume 16, Issue 4, 1994 http://portal.acm.org/citation.cfm?id=183527

I found the chapters in Engineering a Compiler (Cooper and Torczon) perfectly match the code generator of LLVM. And this paper: Lengauer and Tarjan, A Fast Algorithm for Finding Dominators in a Flowgraph, ACM TOPLAS, Vol 1 , No.1, July 1979 I also would like to know more papers/books whose algorithms are implemented in LLVM. 在 星期二 19 十二月 2006 22:13，Fredrik Svensson 写道： > Hi, > > As Christmas approaches rapidly I would like to get some suggestions for > interesting compiler books, papers and other...

...ted in seeing support for stack/context switching in LLVM, if only for prototyping language ideas. I'm particularly interested in mechanisms that would make it possible to implement full asymmetric coroutines as described in "Revisiting Coroutines" (Moura & Ierusalimschy, Feb 2009 TOPLAS). From skimming the thread and looking at the llvm-stack-switch wiki, it looks like you're headed more in the direction of symmetric coroutines. I've read that there is a Lua JIT based on LLVM, but haven't looked into the details of how coroutines are implemented there. In skimming th...

On Mon, Apr 12, 2010 at 6:15 AM, Kenneth Uildriks <kennethuil at gmail.com> wrote: > I created a wiki at http://code.google.com/p/llvm-stack-switch/ > > Right now I just copied and formatted the document as-is... I'll go > back over it with your comments in mind soon.  One more question, > which you can answer here or there: > >> Point 4 is a bit confusing.

...to the official repository. If you have any comments, experiences, or advice on that matter, I would be happy to hear them upfront. Best Regards, Andreas Neustifter Vienna University of Technology [Ball94] Thomas Ball, James R. Larus: "Optimally profiling and tracing programs" ACM TOPLAS, Volume 16, Issue 4, 1994 http://portal.acm.org/citation.cfm?id=183527 [Wu94] Youfeng Wu, James R. Larus: Procedings of the 27th ACM International Symposium on Microarchitecture, 1994 http://portal.acm.org/citation.cfm?id=192724.192725

Hi, I found that LLVM 3.1 says Dominance frontier is deprecated. Can anyone please tell me, if there is any replacement for Dominance frontier & Postdominance frontier in LLVM? What are the options if we need to use them? Thanks, Swarup. -------------- next part -------------- An HTML attachment was scrubbed... URL:

...not include added files, I hope the format is readable enough (it should be...) I ran "make check" and there are not additional errors introduced by the patch. Grettings, Andreas Neustifter [Ball94] Thomas Ball, James R. Larus: "Optimally profiling and tracing programs" ACM TOPLAS, Volume 16, Issue 4, 1994 http://portal.acm.org/citation.cfm?id=183527 -------------- next part -------------- A non-text attachment was scrubbed... Name: llvm-r74306.optimal_profiling.patch Type: text/x-patch Size: 85518 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/a...

Okay thanks for the info. The term program termination was probably a poor choice of words. I'm really just trying to build an inter-procedural BasicBlock graph, and then look for postdominance as Scott suggested. I'll go about making my own since it doesn't sound like there is one out there already. Thanks, -Stephen On Tue, Oct 2, 2012 at 5:06 PM, Scott Moore <sdmoore at

...uce.cpp The optimization is based on the algorithm described within the paper that can be found here: http://portal.acm.org/citation.cfm?id=504709.504710 Keith D. Cooper , L. Taylor Simpson , Christopher A. Vick, Operator strength reduction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.5, p.603-625, September 2001. I have embedded the paper's pseudo code into comment blocks within the code. The algorithm finds reduction opportunities in both array accesses and explicit multiplications within loops. Next, I plan on writing the regression tests. thanks, Brian Bri...

I think you're looking for an inter-procedural post dominator analysis. I don't think there is one in LLVM already, but it should be relatively straightforward. This gives a sound approximation (i.e. no false positives) of something sort-of equivalent to the halting problem: if the program terminates, then block Y was executed. Cheers, Scott On Tue, Oct 2, 2012 at 7:43 PM, Jim Grosbach

Hello all, I would like to participate in this year's Google Summer of Code and I am sending you a short description of my proposal. I have written the formal proposal already and if someone is interested I can send him the pdf. One of the open projects in the LLVM list is to enhance LLVM with static profiling capabilities. LLVM already provides a unified structure for writing pro

.... Douglas do Couto Teixeira and Fernando Magno Quintao Pereira ( http://homepages.dcc.ufmg.br/~douglas/projects/RangeAnalysis/RangeAnalysis.paper.pdf ) 5. Constant propagation with conditional branches. Mark N. Wegman and F. Kenneth Zadeck, In ACM Transactions on Programming Languages and Systems (TOPLAS), 181-210, 1991. 6. Efficient SSI Conversion. André Luiz C. Tavares, Fernando Magno Quintão Pereira, Mariza A. S. Bigonha and Roberto S. Bigonha. Simpósio Brasileiro de Linguagens de Programação. 2010. 7. ABCD: eliminating array bounds checks on demand, Rajkslav Bodik, Rajiv Gupta and Vivek Sarka...

...ysis/RangeAnalysis.paper.pdf > <http://homepages.dcc.ufmg.br/%7Edouglas/projects/RangeAnalysis/RangeAnalysis.paper.pdf>) > > 5. Constant propagation with conditional branches. Mark N. Wegman and > F. Kenneth Zadeck, In ACM Transactions on Programming Languages and > Systems (TOPLAS), 181-210, 1991. > > 6. Efficient SSI Conversion.André Luiz C. Tavares, Fernando Magno > Quintão Pereira, Mariza A. S. Bigonha and Roberto S. Bigonha. Simpósio > Brasileiro de Linguagens de Programação. 2010. > > 7. ABCD: eliminating array bounds checks on demand, Rajkslav Bodik...

On Wed, Mar 23, 2011 at 6:24 PM, John Criswell <criswell at illinois.edu> wrote: > > > On 3/23/11 8:06 AM, Douglas do Couto Teixeira wrote: > > > > the execution of a program. Thus, for each integer variable, a range > > analysis determines its lower and upper limits. A very simple range analysis > > > would, for instance, map each variable to the limits

...ation if there is interest on the mailing list. Thanks, Snehasish Kumar School of Computing Science Simon Fraser University References : [Ball94] Ball, Thomas. "Efficiently counting program events with support for on-line queries." ACM Transactions on Programming Languages and Systems (TOPLAS) 16.5 (1994): 1399-1410. [Ball96] Ball, Thomas, and James R. Larus. "Efficient path profiling." Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture. IEEE Computer Society, 1996. [Young98] Young, Cliff, and Michael D. Smith. "Better global scheduling u...

...able enough (it should be...) > > I ran "make check" and there are not additional errors introduced > by the patch. > > Grettings, > > Andreas Neustifter > > [Ball94] Thomas Ball, James R. Larus: > "Optimally profiling and tracing programs" > ACM TOPLAS, Volume 16, Issue 4, 1994 > http://portal.acm.org/citation.cfm?id=183527 > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > >

Hi Daniel, Daniel Dunbar wrote: > Hi Andreas, > > First, thanks again for undertaking this work and submitting it back. There is a > lot of good stuff here and it would be great to see it get back into the tree. Thanks for taking the time to review this, I know its a huge patch. I still have a few questions on how you would like this patch to be re-factored and split up. > [...]