search for: jdkunk3

...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 developing my register allocation algorithm in Visual Studio, > and I > > am hitting long compile times. I am wondering if there is a way to cut > down > > the time it takes for llc to link? > > Please describe your setup and...

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

...I implemented it, in my RegAllocJDKunk.cpp file. Jeff Kunkel On Fri, Oct 15, 2010 at 1:43 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: > >> - I placed my code in the the existing CodeGen library. > > Ok. > >> - No, it is not in the CMakeLists.txt. The code is separate from the >> rest of the CodeGen code, but it is linked into the code gen library >> automatically throug...

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

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. > > Thanks, > Jeff Kunkel >

...ineOperand * 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 by? > > - Thanks > Jeff Kunkel > --------------...

Jeff Kunkel <jdkunk3 at gmail.com> writes: > I'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 chan...

...ill include it to the CMakeLists.txt. - Thanks - Jeff Kunkel On Fri, Oct 15, 2010 at 11:32 AM, Ó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: > >> I am writing my register allocator directly in the LLVM tree, and I am >> having trouble linking my project on windows msvc 10.0 compiler. The >> error are below, but let me say what I have changed. >> 1. I added "(void) llvm::createJDKu...

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>

...m@@YAPAVFunctionPass at 1@XZ) referenced in function "public: __thiscall `anonymous namespace'::ForcePassLinking::ForcePassLinking(void)" (??0ForcePassLinking@?A0x853fd888@@QAE at XZ) On Fri, Oct 15, 2010 at 3:10 PM, Óscar Fuentes <ofv at wanadoo.es> wrote: > Jeff Kunkel <jdkunk3 at gmail.com> writes: > >> I ran cmake to build the visual studio projects. Then I included my >> code under the Visual Studio interface, but I placed my code separate >> from the CodeGen code. Visual studio was smart enough to compile and >> link in my code into the C...

...ch predictor requires post dominance information. None of the LLVM basic passes require post dominance information (AFAIK), hence it is not available for us to use for free. That's why there is a hidden cost involved with our pass. []z, Andrei On Wed, Nov 3, 2010 at 8:22 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > 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...

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 register allocator. > > The branch predictor of the implementation is not as accurate as the > one from the paper, but it is close enough. Unfortunately, the branc...

I forgot to cc the list On Mon, Oct 11, 2010 at 6:19 PM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > Well this is my 20,000 foot viewpoint of the project you have > described. Also, I would appreciate if someone more knowledgeable > revised my statements. > > First, I would make a mock machine with large register banks for each > kind of operation and si...

...a = 1 + primes[ seed % ( sizeof(primes)/sizeof(primes[0]) ) ]; c = primes[ modulo % ( sizeof(primes)/sizeof(primes[0]) ) ]; } unsigned rand() { return seed = (a*seed + c) % m; } } random_number_gen; -Thanks -Jeff Kunkel On Sat, Oct 9, 2010 at 1:10 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > 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...

I forgot to cc the list. On Sat, Oct 9, 2010 at 10:47 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > On Sat, Oct 9, 2010 at 10:37 AM, Michael Spencer <bigcheesegs at gmail.com> wrote: >>> On Sat, Oct 9, 2010 at 1:10 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: >>>> Hello, does LLVM already have a Random Number Generator built into >...

Jeff Kunkel <jdkunk3 at gmail.com> writes: > I am writing my register allocator directly in the LLVM tree, and I am > having trouble linking my project on windows msvc 10.0 compiler. The > error are below, but let me say what I have changed. > 1. I added "(void) llvm::createJDKunkRegisterAllocator(...

Jeff Kunkel <jdkunk3 at gmail.com> writes: > - I placed my code in the the existing CodeGen library. Ok. > - No, it is not in the CMakeLists.txt. The code is separate from the > rest of the CodeGen code, but it is linked into the code gen library > automatically through the visual studio linker. If y...

Hi, I am developing my register allocation algorithm in Visual Studio, and I am hitting long compile times. I am wondering if there is a way to cut down the time it takes for llc to link? - Thanks - Jeff Kunkel -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20101102/c0c7a2bc/attachment.html>

Jeff Kunkel <jdkunk3 at gmail.com> writes: > Hi, I am developing my register allocation algorithm in Visual Studio, and I > am hitting long compile times. I am wondering if there is a way to cut down > the time it takes for llc to link? Please describe your setup and the precise spot(s) that are slow. Lin...

Le 2 nov. 2010 à 18:59, Óscar Fuentes a écrit : > Jeff Kunkel <jdkunk3 at gmail.com> writes: > >> I'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 co...