search for: lugato

...there's something wrong in the way i use the opt command. How can i tell him to optimize at best, whitout specifing each pass? I'm not using c/c++ frontend, just the assembler. Thanks in advance On 2/14/07, Chris Lattner <sabre at nondot.org> wrote: > On Tue, 13 Feb 2007, Nicola Lugato wrote: > > Hi, i have some code that allocate some memory, store the pointer to a > > variable, read it back and deallocates it, like this: > > ok > > > i expected the optimized to remove everything, but after running it > > the code i get is: > > > > in...

Hi Nicola, On Wed, 2007-02-14 at 18:54 +0100, Nicola Lugato wrote: > I've made some other test and it looks like it don't remove even > simple malloc/free couple. Maybe there's something wrong in the way i > use the opt command. No, there's not. LLVM doesn't provide the transform you want. As Chris mentioned, if you open a Bugz...

On Thu, 25 Aug 2005, Nicola Lugato wrote: > Another question: > What's the best way in general to implement interfaces (like java ones > for example)? Any hint ? I'm just in the dark with this. Along with what the others said, you might find these notes useful: http://nondot.org/sabre/LLVMNotes/MSILObjectModel1.txt...

On Tue, 13 Feb 2007, Nicola Lugato wrote: > Hi, i have some code that allocate some memory, store the pointer to a > variable, read it back and deallocates it, like this: ok > i expected the optimized to remove everything, but after running it > the code i get is: > > int %main(int %argc, ubyte** %argv) { > %...

Hi, i have some code that allocate some memory, store the pointer to a variable, read it back and deallocates it, like this: int %main(int %argc, ubyte** %argv) { %c_19 = alloca ubyte* %malloc_206 = malloc ubyte, uint 10 store ubyte* %malloc_206, ubyte** %c_19 %tmp_207 = load ubyte** %c_19 free ubyte* %tmp_207 ret int 0 } i expected the optimized to remove everything, but after running it the

On Fri, 2005-08-26 at 09:24 +0200, Nicola Lugato wrote: > > In any case when you > > want to obtain a base pointer to a "derived" object (where derivation > > is implemented as you showed - with nesting) it's simply a matter of > > using getelementptr to obtain a pointer to the nested base object and > &gt...

Hi Jonas. I'm very interested in an llvm backend for freepascal. Could you give some more details? Is there already something to try and test? Will the code be avaiable on svn? Thanks, Nicola On 6/7/07, Jonas Maebe <jonas.maebe at elis.ugent.be> wrote: > > Hello, > > I'm looking into creating an llvm backend for the Free Pascal > Compiler

Hi! i'm tring to figure out how classes and dependencies can be mapped to llvm. I've read on docs that nesting can be used: class base { int Y; }; class derived : base { short Z; }; becomes: %base = type { int } %derived = type { %base, short } That's ok, but now the question is: how do i encode a function that takes "base" type so that it also takes "derived"

Reid Spencer wrote: > On Wed, 2007-02-14 at 18:54 +0100, Nicola Lugato wrote: > >>I've made some other test and it looks like it don't remove even >>simple malloc/free couple. Maybe there's something wrong in the way i >>use the opt command. > > No, there's not. LLVM doesn't provide the transform you want. As Chris >...

I don't like very much mithology or fantasy names. A portmanteau is more professional (even if it sounds funny). For now IMHO the best proposal is Omnipiler and OmniC, even if the last one reminds too much of C. Maybe Omnic (with the lowercase c), or Omnip are better. Simple, elegant and somehow reminds of something technological (to me at least :P). So my idea is to list some key words and

me22 wrote: > One of the nicer project names I've seen recently is Alexandria, for a > book database program ( http://alexandria.rubyforge.org/ ). It > unfortunately fails the searchability test, but does brilliantly at > reminding you what it is. Along these lines, is there any mythical characters or historical persons which are associated with translation (which is the primary

> In any case when you > want to obtain a base pointer to a "derived" object (where derivation > is implemented as you showed - with nesting) it's simply a matter of > using getelementptr to obtain a pointer to the nested base object and > using that. Umm ok, but i've the strange feeling that i'm missing something.. First a simple question: getelementptr with

Hello, I'm looking into creating an llvm backend for the Free Pascal Compiler (<http://www.freepascal.org>). After reading a bit through the documentation and looking at some code generated by llvm-gcc, I have a couple of questions: 1) is there a way to specify ranges in the switch statement? Pascal supports switch statements (called "case" statements there) which

try here: http://sourceforge.net/projects/inger this project have a ebook (Compiler Construction: A Practical Approach) that covers some backend code generation techniques. On 2/1/07, Seung Jae Lee <lee225 at uiuc.edu> wrote: > Can you recommend any good book or reference for backend implementation? I skimmed some compiler books but it seemed to be more about front-end, parsing,