similar to: [LLVMdev] Goog test-cases for a new register allocator

On Wednesday 02 April 2008 03:06, Roman Levenstein wrote: > Hi, > > As I mentioned some time ago on the mailing list, I'm working on the > implementation of the Sarkar's Extended Linear Scan algorithm for LLVM. Cool! > For testing and debugging of this algorithm, I need some good > test-cases that check different functionalities of the register > allocator, e.g.:

On Apr 2, 2008, at 4:47 PM, David Greene wrote: >> I think these requirements are not specific for my allocator only, >> but >> are important for checking any register allocator. May be someone >> (Fernando? David? Evan?) who was working on register allocators has >> found a good set of examples covering some of the topics? Or may be >> someone knows good

Hi, I'm trying to sketch an LLVM-based implementation of the Extended Linear Scan algorithm, described in this Vivek Sarkar's paper: http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf Sarkar reports that this version of Linear Scan produces better code than graph-coloring regallocs and is also much faster (15x to 68x). I already started work on the implementation of this algorithm and have a few

On Apr 2, 2008, at 9:58 PM, Chris Lattner wrote: > > Could these be added to llvm-test? > > -Chris I just added the two C benchmarks as MultiSource/Benchmarks/NPB-serial. --Owen -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 2555 bytes Desc: not available URL:

Hi David, --- David Greene <dag at cray.com> schrieb: > On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > > > I already started work on the implementation of this algorithm and > have > > a few hopefully rather simple questions: > > Roman, > > I'm excited to hear that you are working on this algorithm. Do you > plan to contribute it

On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > I already started work on the implementation of this algorithm and have > a few hopefully rather simple questions: Roman, I'm excited to hear that you are working on this algorithm. Do you plan to contribute it to the public llvm repository? -Dave

Hi, Roman, we have an implementation of an allocator for LLVM that, like Sarkar's, allows to split live ranges at any program point. You can find its description here: http://compilers.cs.ucla.edu/fernando/publications/drafts/long_PereiraPalsberg07.pdf We handle register classes using an abstraction called puzzles. Also, we perform register allocation while the program is still in

Hi, While profiling LLVM using my test-cases with huge MBBs, I noticed that FoldingSetNodeID operations (ComputeHash,insertion,etc) may become really inefficient for the nodes, which have very many operands. I can give you an example of what is meant by "very many". In my test-case (you can fetch it from here http://llvm.org/bugs/attachment.cgi?id=1275), which is just one HUGE MBB

Hi Roman, > I already started work on the implementation of this algorithm and have > a few hopefully rather simple questions: > > 1) What is the easiest way to understand which MBB a given instruction > index belongs to? All the required information is available in the > MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful to add > a small function

Hi, I have a survey dataset of about 20000 observations where for 2 factor variables I have about 200 missing values each. I want to impute these using 10 possibly explanatory variables which are a mixture of integers and factors. Since I was quite intrigued by the concept of rrp I wanted to use it but it takes ages and terminates with an error. First time it stopped complaining about too little

Hi Evan, I have a few questions about current implementation of live intervals spilling, which is required for the implementation of Extended Linear Scan algorithm. --- Evan Cheng <evan.cheng at apple.com> wrote: > > On Wednesday 23 January 2008 02:01, Evan Cheng wrote: > >> On Jan 22, 2008, at 12:23 PM, David Greene wrote: > >>> Evan, > >>> >

Hi Fernando, > Hi, Roman, > > we have an implementation of an allocator for LLVM that, like > Sarkar's, allows to split live ranges at any program point. You can > find > its description here: > > http://compilers.cs.ucla.edu/fernando/publications/drafts/long_PereiraPalsberg07.pdf > I've read your paper already. It is a very interesting approach! But

On Jan 31, 2008, at 5:05 AM, Roman Levenstein wrote: > Hi, > > I'm trying to sketch an LLVM-based implementation of the Extended > Linear Scan algorithm, described in this Vivek Sarkar's paper: > http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf > Sarkar reports that this version of Linear Scan produces better code > than graph-coloring regallocs and is also much faster (15x

Dear LLVMers OK, when I signed up for this mailing list, I asked for a once-daily digest. This is the fourth digest I receive today, and there are about that many each day. The only reason I subscribe to the mailing list is so I can post to it. But I don't need to receive the emails, because I can fully well read them in the archive online, and I certainly don't want to get spammed

Dear R-users I intend to create a function which calls some smaller other functions in return. Some of these smaller functions all call some functions. I do not know a good way to do this. I tried using the source() function to include the smaller functions within the main functions before they are called. This does not work, or maybe i am not doing the right thing. For example: the

Hi, Roman, maybe I can try to answer this. I think that all boils down to having register to reload spilled values. Once a register is spilled, its live range is split into smaller pieces. These pieces most be contained into registers, and it is the task of the allocator to find these registers. Imagine that you have something like: Before After allocation: allocation: a

> On Sun, 2 Jul 2006, Fernando Magno Quintao Pereira wrote: > > > MachineBasicBlock::iterator iter = mbb.getFirstTerminator(); > > const TargetRegisterClass *rc = mf.getSSARegMap()->getRegClass(dst); > > const MRegisterInfo * reg_info = mf.getTarget().getRegisterInfo(); > > reg_info->copyRegToReg(mbb, iter, dst, src, rc); > > } > > >

Hi all, Yesterday, i changed from samba 2.2.3 to samba 3.0, and also i changed the machines which samba is running on. Samba worked and should work as a PDC. It runs on a Debian sid, the test client is a notebook with XP Professional. Yesterday, immediately after migrating, everything worked fine. Even after several reboots, i could logon as a domain user, and i could use the shares. Today, i

Hey all, is there a simple way to alternate between different register allocators at run time? I would like to decide dynamically which register allocator to use. The decision is based on information that is produced by a pass that executes before register allocation takes place. Is it possible to modify RegisterRegAlloc::Registry to take into consideration this information? Is there

On 11/23/07, Fernando Magno Quintao Pereira <fernando at cs.ucla.edu> wrote: > > > Hi, Sanjiv, > > those passes operate on the whole machine function. Each machine > function contains many basic blocks. If a program has many functions, the > register allocator will be called as many times, i.e it does not do > interprocedural allocation. > > best, > >