similar to: [LLVMdev] Graph coloring register allocation

First-Time SIGPLAN Award to Apple's Chris Lattner for Developing Popular LLVM Infrastructure with Applications in Commercial, Research, Teaching, and Open Source Projects From the press release: June 7, 2010 – The ACM Special Interest Group on Programming Languages (SIGPLAN) today presents its first-ever Programming Languages Software Award to Chris Lattner of Apple Inc. for his design

Sorry for double-posting to the list, The citation is the following (this time with a url to the paper): K. Sagonas, C. Stavrakakis, and Y. Tsiouris. "ErLLVM: An LLVM backend for Erlang"[1]. In Eleventh ACM SIGPLAN Erlang Workshop, September 2012. ACM Press. Thanks! Yiannis [1]: http://erllvm.softlab.ntua.gr/files/erlang03-sagonas.pdf On 09/07/2012 08:13 PM, Yiannis Tsiouris wrote:

ping. :-) On 09/07/2012 08:24 PM, Yiannis Tsiouris wrote: > [...] > The citation is the following (this time with a url to the paper): K. > Sagonas, C. Stavrakakis, and Y. Tsiouris. "ErLLVM: An LLVM backend > for Erlang"[1]. In Eleventh ACM SIGPLAN Erlang Workshop, September > 2012. ACM Press. > > [1]: http://erllvm.softlab.ntua.gr/files/erlang03-sagonas.pdf >

My congratulations to Chris as well! For those who don't follow the ACM world much, SIGPLAN is the primary research organization for PL and Compilers, and I expect this award to become one of the most prestigious awards in the field. It's quite a coup for Chris and for LLVM to have won it, and moreover to win it in the first year of the award. And it's remarkable that it has

Hi! As the title suggests, I'd like to generalize llvm::IDFCalculator to be able to calculate control dependencies on clang's CFG. The issue is however, that many data structures it uses are "hardcoded" to use llvm::BasicBlock, and requires a lot of code to turn it into template arguments. I managed to pull this off by hammering the code until it compiled, and it works

Try putting !!! (three exclamation symbols) in front of which(...)==.... The non-standard evaluation in the tidyverse can cause confusion. Bill Dunlap TIBCO Software wdunlap tibco.com On Thu, Aug 24, 2017 at 4:32 AM, Eugeny Melamud < Eugeny.Melamud at lanit-tercom.com> wrote: > Hi all! > > The following code (executed in console)... > somevar <- data.frame(v1 = 1:5,

Ralf Schneider wrote: > A little bit off topic: Has anybody tried building a concurrent GC - > running in a different _process_, instead of a thread? > The idea: To perform a collection you do a fork(). The child process > collects all unreferenced memory regions and reports them back to the > parent process. I remember reading a paper in ACM Sigplan Notices (I think) many years

LLVM developers, Can you add the following paper to the publication list? "Formal Verification of SSA Optimizations for LLVM" Jianzhou Zhao, Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2013 link to ACM DL:

Hi all! The following code (executed in console)... somevar <- data.frame(v1 = 1:5, somestring = 6:10, v3 = 11:15, v4 = 16:20); somevar %>% gather(key = var, value = val, which(names(somevar) == "somestring"):length(somevar)) %>% head(2); throws... Error in which(names(somevar) == "somestring") : could not find function "which" if I change

Hi RamShankar, On top of Rafael mentioned ,Please 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,

A polite ping, could someone please share a thought about this? On Sat, 8 Jun 2019 at 21:21, Kristóf Umann <dkszelethus at gmail.com> wrote: > A polite ping on this matter :) > > On Tue, 4 Jun 2019 at 01:51, Kristóf Umann <dkszelethus at gmail.com> wrote: > >> Hi! >> >> As the title suggests, I'd like to generalize llvm::IDFCalculator to be >>

Hello! I have such trouble: I like R, but often I don't have administrator permissions to install R on some (not mine) computers. Could you give me shell on any server with R installed in order to apply R without installing it (simply with PuTTY). Great thanks! -- Best regards, Altshuler Eugeny

I have configured and working this.But ! Very slow ! A lot of cpu usage by smbd. What can I do ? Other disk/cdrom shared works perfectly. 10tx. Eugeny.

On Thu, 6 Nov 2003, Michelle Strout wrote: > Those of us working on the OpenAnalysis project have been looking at > LLVM recently (excellent job on the website BTW). Thanks! I'm just one of the many people who have worked on it though, the praise belongs to them as much as it does to me. :) > This includes researchers at Rice, Argonne, and LLNL. Great! > John Mellor-Crummey

hi*& ppl, can anyone help me? I haven't problems with NT clients to samba PDC. But I can not setup win95/98 clients to user based security, because win95/98 never can retrieve user list from samba pdc. Is it released? I can find any info about this problem. Thanks, Eugeny.

Can you describe quickly (or point to references for the inclined) what this pass will do and what other stuff it might enable for LLVM? I'm just curious. -- Christopher Lamb -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080324/46829334/attachment.html>

Hi, I am a newbie to llvm. I am wondering what approach is used when coming out of SSA form. I also appreciate pointers on where to look in the source code for this phase. Best regards, Ram Ramshankar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120824/87feb1d3/attachment.html>

On 24 August 2012 02:27, Ramanarayanan, Ramshankar <Ramshankar.Ramanarayanan at amd.com> wrote: > Hi, > > > > I am a newbie to llvm. I am wondering what approach is used when coming out > of SSA form. I also appreciate pointers on where to look in the source code > for this phase. > lib/CodeGen/PHIElimination.cpp is probably what you want. > > Best regards,

------------------------------------------------------------------------------------------------ CALL FOR PAPERS 15th International Conference on Managed Languages & Runtimes (ManLang'18) September 10-14, 2018, Linz, Austria http://ssw.jku.at/manlang18/ ------------------------------------------------------------------------------------------------ ManLang (formerly PPPJ) is a

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