similar to: [LLVMdev] Re: LLVM to SUIF-MACH VM binary (Chris Lattner, John Cortes)

Nikolaos Kavvadias wrote: > Dear friends, > > I have been using the SUIF Machine infrastructure for sometime. Some > optimizations are available without using a target machine, i.e. at the > SUIFvm level. At this level you have "infinite" registers. Other > optimizations, including analyses as for profiling require the use of a > target library, a complete

On Thu, Jan 20, 2005 at 02:38:39AM -0800, John Cortes wrote: > I tried including the SUIFvm header files and got more errors than I > bargained for. Looks like it hasn't been updated to be portable. I > need some help in getting these suifvm references into the code I'm > writing. While I understand that your current goal is translating LLVM -> SUIF, it seems that

On Tue, 18 Jan 2005, John Cortes wrote: >> Can you say a little bit about MACH-SUIF? With a brief google search, I >> didn't turn up anything that described the architecture. Is it a RISC-like >> machine with 32-bit instruction words? >> > > It's another VM representation. I haven't really gotten to know the nitty > gritty of the language so

Chris Lattner wrote: > On Tue, 18 Jan 2005, John Cortes wrote: > >> Hi Chris, > > > Hi! I'm CC'ing the llvmdev list for the benefit of others. > >> Since I see you're very involved in LLVM, I need a little guidance on >> getting from C to MACH-SUIF. >> >> I've been given the task of using LLVM to translate C code to another

Chris Lattner wrote: > On Tue, 18 Jan 2005, John Cortes wrote: > >>> Can you say a little bit about MACH-SUIF? With a brief google >>> search, I didn't turn up anything that described the architecture. >>> Is it a RISC-like machine with 32-bit instruction words? >>> >> >> It's another VM representation. I haven't really gotten

On Tue, 18 Jan 2005, John Cortes wrote: > Hi Chris, Hi! I'm CC'ing the llvmdev list for the benefit of others. > Since I see you're very involved in LLVM, I need a little guidance on getting > from C to MACH-SUIF. > > I've been given the task of using LLVM to translate C code to another VM > architecture known as MACH-SUIF. For this architecture, i don't

A couple notes on this: 1. We also need to be able to *read* .o files for linking. Right now we just assume that any symbol not found in a bytcode file is implemented in some native library and will be resolved at runtime. This isn't the greatest assumption. To resolve native binary symbols we need to be able to read native .a, .so, and .o files to ensure the symbols are

--- David Greene <greened at obbligato.org> wrote: > Roman Levenstein wrote: > > The allocator does not handle register aliases and register classes > > correctly, which makes it rather unusable for most architectures. > One > > idea that can be used for improving handling of irregular > architectures > > is described in the "A Generalized Algorithm for

Hi there, I have a question on the LLVM internals. Is it possible to dump an InstructionList (i.e. a (possibly) naively scheduled assembly) prior register allocation? Does LLVM use infinite (virtual) registers similar to MachSUIF? This is, of course, meant for a given target in contrast to MachSUIF that features the SUIFvm ISA as low-level IR and such a dump is possible at this point. Plus:

Roman Levenstein wrote: > Yes, the SUIF allocator (or at least one of them) implements the > Smith/Ramsey/Holloway algorithm. This is what I understand by looking > at the coloring reggister allocator code in the SUIF distribution. The > SUIF code of this allocator is not very well commented, but I'm pretty > sure. Do you have a pointer? I'm interested in this algorithm

> > Message: 2 > Date: Fri, 15 Jun 2007 12:16:32 -0700 (PDT) > From: Chris Lattner <sabre at nondot.org> > Subject: Re: [LLVMdev] Partial evaluation and LLVM (2) > To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > Message-ID: <Pine.LNX.4.62.0706151213090.7416 at nondot.org> > Content-Type: text/plain; charset="x-unknown" > > On

> For the JIT and a couple of optimizers on x86 (suitably stripped etc), > we see it taking ~2M uncompressed. Additionally, as you say, this is > very compressible for an install image. 2mByte for PC apps is "nothing" these days. The app I have in mind is 50-200mByte depending on install options. To be able to write llvm DLLs and ship intermediate code would definitely be

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

> > Message: 3 > Date: Fri, 15 Jun 2007 12:24:52 -0700 (PDT) > From: Chris Lattner <sabre at nondot.org> > Subject: Re: [LLVMdev] Strategy to compile for LLVM IR > To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > Message-ID: <Pine.LNX.4.62.0706151218030.7416 at nondot.org> > Content-Type: text/plain; charset="x-unknown" > > On

Hi, --- Anton Vayvod <avayvod at gmail.com> wrote: > On 4/3/07, David Greene <greened at obbligato.org> wrote: > > > > I'm just starting to dive into llvm, hoping to implement a > > good graph coloring register allocator. I gather that this > > has been discussed before. > > > > What is the RegAllocGraphColoring.cpp currently in the >

Roman Levenstein wrote: > The allocator does not handle register aliases and register classes > correctly, which makes it rather unusable for most architectures. One > idea that can be used for improving handling of irregular architectures > is described in the "A Generalized Algorithm for Graph-Coloring > Register Allocation" by Michael D. Smith, Norman Ramsey and Glenn

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

Hi, Thanks so much at first. > Here are some observations: > > > for C level, > > > > char a[]="global string test"; > > for(i=0;i<strlen(a);i++){ > > a[i]= a[i]^RANDMON; > > } > > If you compile this C code, "global string test" will occur in the program > binary, so you have not obfuscated anything. You can

Hi all, As per the instructions here <http://llvm.org/docs/DeveloperPolicy.html#obtaining-commit-access>, I contacted Chris Lattner to obtain commit access but haven't received a response (either positive or negative). What's the expected turnaround time for this (I contacted him five days ago)? In case he's currently unavailable, is there someone else I could contact? Thanks,

national compiler infrastructure - http://www.cs.virginia.edu/nci/ is there any on-going efforts to integrate llvm with other nci projects?