search for: kunkel

I have a live interval, and I would like to find out what SlotIndex the next use the register will occur? Is there any way to map a live interval back into instructions or SlotIndexes or blocks used by? - Thanks Jeff Kunkel -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110120/fd429dbd/attachment.html>

How do I find the profiling or run time information for machine basic blocks from a machine function? There are quite a few optimization that may be preformed with this information, when it exists. Thanks, Jeff Kunkel

Hello, does LLVM already have a Random Number Generator built into it's library somewhere? I know code generation is suppose to be deterministic, but when producing a random number can be deterministic if the random number generator is also deterministic. - Thanks - Jeff Kunkel

...e, my question. The trouble I foresee is that the reg17777 and reg18888 can both be on the stack. Then, at the end of the mbb 11, reg18888 must be stored not only in it's own slot, but also in reg16666's slot. I am wondering, do I need to communicate this information somehow? Thanks, Jeff Kunkel On Tue, Oct 5, 2010 at 4:35 PM, Cameron Zwarich <zwarich at apple.com> wrote: > At the moment, phi elimination happens before register allocation, so there can be no phis between memory locations. > > Cameron > > On Oct 5, 2010, at 4:19 PM, Jeff Kunkel wrote: > >> Wh...

How do I get the total number of machine registers? I have currently a MachineFunction and some derivatives. How are the machine registers ordered internally? Can I index them off of a zero based array or do I have to create a map to have them be zero based? Thanks, Jeff Kunkel -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100903/05733725/attachment.html>

...// For each basic block bb in blocks in order of insersion: // 1. Remove basic blocks in the block vector from the machine function. // 2. Remove the jump from the start block if it exists. // 3. Add the instruction from bb into the start block. } Thanks, Jeff Kunkel On Wed, Oct 6, 2010 at 7:49 PM, Bob Wilson <bob.wilson at apple.com> wrote: > > On Oct 6, 2010, at 4:31 PM, Jeff Kunkel wrote: > >> Has anyone written a pass at the MachineFunction level which combines >> machine basic blocks which is guaranteed to be the single predeces...

...RegisterInfo> RegisterIndexes; vector. Then when a register is used I can assign it easily. I know about alias register and those are taken care of ever so cleverly. If this can be done without an extra lookup, it would improve performance. I have one too many as is in some parts. Thanks, Jeff Kunkel On Fri, Sep 3, 2010 at 12:57 PM, Jim Grosbach <grosbach at apple.com> wrote: > TargetRegisterInfo::getNumRegs(). > > Generally, it's best not to make any assumptions about the internal > ordering or numbering if you can avoid it. What are you looking to do? > > -Jim &g...

Bump: Does profiling / run time information exist when dealing with machine basic blocks? Thanks, Jeff Kunkel On Tue, Sep 28, 2010 at 9:51 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > How do I find the profiling or run time information for machine basic > blocks from a machine function? There are quite a few optimization > that may be preformed with this information, when it exists. >...

...ndIndex( LiveInterval* li, SlotIndex Min ) ... for( MachineOperand * mo = MRI->getRegUseDefListHead(li->reg); mo; mo = mo->getNextOperandForReg() ) { SlotIndex si = SI->getInstructionIndex( use.getOperand().getParent() ); if( Min.distance(si) >= 0 ) ... - Thanks Jeff Kunkel On Thu, Jan 20, 2011 at 8:37 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > I have a live interval, and I would like to find out what SlotIndex the > next use the register will occur? Is there any way to map a live interval > back into instructions or SlotIndexes or blocks used b...

It is at the end allowing for oddities like debug info and multiple branches. You might want to look at AnalyzeBranch. On Sep 2, 2010, at 4:19 PMPDT, Jeff Kunkel wrote: > Is there any way to tell where in the Instruction list, the branch > to the other MachineBasicBlock happens? I know in the BasicBlock had > a nice api for it. > > Thanks, > Jeff Kunkel > > On Thu, Sep 2, 2010 at 5:56 PM, Dale Johannesen <dalej at apple.com&g...

...sters defined in the block started at the aligned size and ending at the aligned size plus the request register alpha's size. The final step is to weigh and choose a block to put alpha into. How do I model the registers R and register blocks r to obtain my desired information? - Thanks - Jeff Kunkel -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100902/2b2dc1b8/attachment.html>

...;m just running VS 10 in debug mode. In a step by step set up: 1. I download the svn 2. I make my changes 3. I compile the libraries 4. I make changes to the code within my project 5. I compile my code, and I re-link llc with my changed files. 6. I repeat 4,5, and 6 until it finally works. - Jeff Kunkel On Tue, Nov 2, 2010 at 1:21 PM, Óscar Fuentes <ofv at wanadoo.es> wrote: > The following message is a courtesy copy of an article > that has been posted to gmane.comp.compilers.llvm.devel as well. > > Jeff Kunkel <jdkunk3 at gmail.com> writes: > > > Hi, I am devel...

...2.12.1 (2010-10-15) vs 2.12.0 has slowed down 8 fold for dual core and 17 fold for dual-core-dual-processor Macs. I have checked this result on 3 different macs using the following R-script: Using Version 2.12.0 on a dual core dual processor Mac: > source("http://www.bio.umass.edu/biology/kunkel/pub/R/CuriousResult.R") matrix multiplication 43.543 1.308 14.788 tcrossprod 41.147 1.286 11.9 transposition and reuse 40.407 3.525 43.606 elementwise after reshape 21.474 1.828 23.124 columnwise sapply 34.695 32.35 66.592 for loop over col...

On Sep 2, 2010, at 2:44 PMPDT, Jeff Kunkel wrote: > I need to track which MachineBasicBlocks branch into other > MachineBasicBlocks. How do I do it? Look at the Predecessor/Successor lists, which are target-independent > I see a MachineOperand can hold a MachineBasicBlock*. Does this mean > the instruction may branch to th...

...need to be sequentialized. This is a somewhat different problem than normal phi elimination before register allocation. > > I am also writing an SSA-based register allocator for LLVM; perhaps we can share some code in common passes. > > Cameron > > On Oct 5, 2010, at 6:02 PM, Jeff Kunkel wrote: > >> Aye, between all current register allocators the >> 'AU.addRequiredID(PHIEliminationID);' will cause phi's to be >> eliminated to copies, but this misses the point of my question. >> >> What I am asking, is how does stack know that the value...

On Sep 3, 2010, at 10:46 AM, Jeff Kunkel wrote: > It's not too much of a problem then. I can make a DenseMap between the registers and my registers. It's just one more intermediate step for a lookup. > > I wish to mimic all the of the registers on the machine with my std::vector<RegisterInfo> RegisterIndexes; vect...

You said it was expensive, but if you had to put a big-o estimate on it, what would it be? -Thanks Jeff Kunkel On Tue, Nov 2, 2010 at 8:54 PM, Andrei Alvares <logytech at gmail.com> wrote: > Hello Jeff, > > On Tue, Nov 2, 2010 at 9:17 PM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > > My god! I would love a branch predictor! It would simplify many aspects > of > > my reg...

...ng / coalescing heuristic like IRC. The best quality for the least amount of implementation effort is probably a dominator tree scan with register preferences, so I'll try that first: http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun10cc.pdf Cameron On Oct 5, 2010, at 7:43 PM, Jeff Kunkel wrote: > The allocator you are building, is it the Hack's and Goos's polynomial > time algorithm? > > On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote: >> There is nothing that currently handles this properly, as far as I know. If you ha...

...se registers are combined in a phi, the values the registers point to needs to be moved, combined, or otherwise taken care of. I understand this is the job of the stack space colorer, but when doing phi elimination, does one need to tell the stack space colorer that the phi did exist? Thanks, Jeff Kunkel

...ies on incoming edges that need to be sequentialized. This is a somewhat different problem than normal phi elimination before register allocation. I am also writing an SSA-based register allocator for LLVM; perhaps we can share some code in common passes. Cameron On Oct 5, 2010, at 6:02 PM, Jeff Kunkel wrote: > Aye, between all current register allocators the > 'AU.addRequiredID(PHIEliminationID);' will cause phi's to be > eliminated to copies, but this misses the point of my question. > > What I am asking, is how does stack know that the value of the > variable wh...