similar to: [LLVMdev] Mapping of class derivated and interfaces

> Hi! i'm tring to figure out how classes and dependencies > can be mapped to llvm. > [snip] > how do i encode a function that takes "base" type > so that it also takes "derived" ? You'll notice that your function doesn't take an object of type base, but a pointer to it. This is important - in a language such as LLVM where actual structures can be

> 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

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 http://nondot.org/sabre/LLVMNotes/MSILObjectModel2.txt Which

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 > > using that. > > Umm ok, but i've the

Hi folks, I''m overriding some resource attribute in a subclass. It seems that specifying a resource by its alias doesn''t work in a subclass. Looks like a bug, no ? === module-classes.pp === class module::base { file {"/tmp/test-module": alias => test-module, content => "module::base", } } class

Spamming lists is probably the best reason to keep releases going. It's a great way to find new users :) By the way, are any distributions currently carrying LLVM? I couldn't find it in the Debian repositories. -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Vikram S. Adve Sent: Tuesday, October 11, 2005 10:36 AM To:

Hi, I am generating following code: %base = getelementptr inbounds %ravi.CallInfo* %6, i32 0, i32 4, i32 0 %7 = load %ravi.TValue** %base %8 = bitcast %ravi.TValue* %7 to i8* %9 = bitcast %ravi.TValue* %5 to i8* call void @llvm.memcpy.p0i8.p0i8.i32(i8* %8, i8* %9, i32 16, i32 8, i1 false) %10 = load %ravi.CallInfo** %L_ci %base1 = getelementptr inbounds %ravi.CallInfo* %10, i32 0,

Sorry. It's kinda embarrassing but I don't know how to follow a thread. As you can see: http://lists.cs.uiuc.edu/pipermail/llvmdev/2005-September/thread.html My follow-up posts are not threaded. What is the subject I should use to continue a pre-existing thread? dependence analyzer for machine code? Re: dependence analyzer for machine code? [LLVMdev] Re: dependence analyzer for machine

Ancient inline assembler that manipulates descriptor tables is unreadable and has no type checking. Doing this in C actually generates better code, saves code space, and improves readability. The fact that you must cast descriptors to (char *) for the inline assembler to work properly caused me no end of grief working on these patches. Note that GCC does not generate rotations to utilize

Ancient inline assembler that manipulates descriptor tables is unreadable and has no type checking. Doing this in C actually generates better code, saves code space, and improves readability. The fact that you must cast descriptors to (char *) for the inline assembler to work properly caused me no end of grief working on these patches. Note that GCC does not generate rotations to utilize

Hello, I have an R script that I use as a template to perform a task for multiple files (in this case, multiple chromosomes). What I would like to do is to utilize a simple loop to parse through each chromosome number so that I don't have to type the same code over and over again in the R console. I've tried using: for(i in 1:22){ etc.. } and replacing each chromosome number with

By Andi Kleen's suggestion, this patch removes pack_ldt() and pack_tss() wrappers in favour of a general wrapper. It saves us an ifdef and some lines of code, but more importantly, it's more elegant. No functional change is made. Signed-off-by: Glauber de Oliveira Costa <gcosta@redhat.com> --- include/asm-x86/desc.h | 55 ++++++++++++++--------------------------------- 1 files

By Andi Kleen's suggestion, this patch removes pack_ldt() and pack_tss() wrappers in favour of a general wrapper. It saves us an ifdef and some lines of code, but more importantly, it's more elegant. No functional change is made. Signed-off-by: Glauber de Oliveira Costa <gcosta@redhat.com> --- include/asm-x86/desc.h | 55 ++++++++++++++--------------------------------- 1 files

This patch series introduces a backend for kvm to run on IBM System z machines that uses the mainframe's sie virtualization capability. This work runs 64bit guests on z800/z890/z900/z990/z9/z10 class machines with a 64bit linux host. Userspace will follow once we're done brushing it over. The patch queue consists of the following patches, which can be applied in sequence on top of kvm.git

This patch series introduces a backend for kvm to run on IBM System z machines that uses the mainframe's sie virtualization capability. This work runs 64bit guests on z800/z890/z900/z990/z9/z10 class machines with a 64bit linux host. Userspace will follow once we're done brushing it over. The patch queue consists of the following patches, which can be applied in sequence on top of kvm.git

Hi, I recently ran into the problem that I needed a Siegel-Tukey test for equal variability based on ranks. Maybe there is a package that has it implemented, but I could not find it. So I programmed an R function to do it. The Siegel-Tukey test requires to recode the ranks so that they express variability rather than ascending order. This is essentially what the code further below does. After the

Hi, I'm trying to enable the pre-decrementing and post-incrementing based addressing modes for my target. So far without any success :( I enabled these modes in my TargetLowering class using setIndexedLoadAction and setIndexedStoreAction calls. I also defined getPreIndexedAddressParts and getPostIndexedAddressParts. And I can see that DAGCombiner::CombineToPostIndexedLoadStore is invoked.

Hi useR, I am trying to find how to schedule an automatic run of R periodically, I have written some scripts to extract data which are updated monthly on another server, my os is xp. The goal is that my script will run at a scheduled time every month and record the results to some directories. Now the scripts are done, only thing I need is to know how to let R run my scripts at a certain time,

Hello, Is there a simple way to take an input, and convert the decimal integers to binary? In this case, I have a CSV file, and I need to convert the first column of every line to binary. Thanks. -- Jason Thibodeau [[alternative HTML version deleted]]

Hi Chris, --- Chris Lattner <sabre at nondot.org> wrote: > On Wed, 29 Nov 2006, Roman Levenstein wrote: > > Thanks, this is a good idea. > > > > But I cannot figure out how to make a machine function pass run > > _BEFORE_ the RA. I guess I'm missing something very obvious. > > In your target's TargetMachine::addInstSelector method, add it to the