Displaying 3 results from an estimated 3 matches for "physregsuseorder".
2007 Jun 22
1
[LLVMdev] BigBlock register allocator
...n things like
instruction selection were simpler. But somewhere, some nasty speed issues
have crept in when compiling huge functions. I'll do my best to try and sift
through these over the next few weeks. (Or at least provide Evan with plenty
of test cases and beg him to fix things. ;)
> - PhysRegsUseOrder - you remove some elements from the middle of this
> vector in removePhysReg. This is not a very efficient operation on the
> vectors, since it need to copy the tail of the vector. I think using a
> list data-structure could be much more efficient for this purpose
Actually, PhysRegsUseOrd...
2007 Jun 22
0
[LLVMdev] BigBlock register allocator
...eadTable. The vector of read occurences can be
shortened every time, you processed the corresponding intruction. This
makes it shorter and makes searches inside this vector faster, thus
making chooseReg much faster. Probably also some other optimizations
can be applied to the chooseReg function.
- PhysRegsUseOrder - you remove some elements from the middle of this
vector in removePhysReg. This is not a very efficient operation on the
vectors, since it need to copy the tail of the vector. I think using a
list data-structure could be much more efficient for this purpose
I think these changes may significantel...
2007 Jun 22
3
[LLVMdev] BigBlock register allocator
Hi everyone,
Quick summary:
LLVM now has a new register allocator particularly suitable for
compiling (very) large, machine-generated functions.
Longer story:
I've recently been using LLVM in an application that involves JITing
fairly large functions that have no control flow - they're just flat
sequences of instructions, anywhere from 100 to 10000+ in size. (The
control flow is