| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
|
|
|
|
| |
class can be extended to support custom constraints.
For now the allocator still uses the old (internal) construction mechanism by default. This will be phased out soon assuming
no issues with the builder system come up.
To invoke the new construction mechanism just pass '-regalloc=pbqp -pbqp-builder' to llc. To provide custom constraints a
Target just needs to extend PBQPBuilder and pass an instance of their derived builder to the RegAllocPBQP constructor.
llvm-svn: 114272
|
| |
|
|
| |
llvm-svn: 112807
|
| |
|
|
| |
llvm-svn: 108130
|
| |
|
|
| |
llvm-svn: 96779
|
| |
|
|
|
|
|
|
|
|
| |
costs.
* Enabled R1/R2 application for nodes with infinite spill costs in the Briggs heuristic (made
safe by the changes to the normalization proceedure).
* Removed a redundant header.
llvm-svn: 95973
|
| |
|
|
| |
llvm-svn: 95781
|
| |
|
|
|
|
| |
memory access bug in the heuristic solver.
llvm-svn: 95633
|
| |
|
|
|
|
|
|
|
| |
* Fixed a reduction bug which occasionally led to infinite-cost (invalid)
register allocation solutions despite the existence finite-cost solutions.
* Significantly reduced memory usage (>50% reduction).
* Simplified a lot of the solver code.
llvm-svn: 94514
|
| |
|
|
| |
llvm-svn: 92830
|
| |
|
|
| |
llvm-svn: 91764
|
| |
|
|
| |
llvm-svn: 79146
|
| |
|
|
|
|
| |
stuff as it was only meant for debugging the solver.
llvm-svn: 78359
|
|
|
based solver, but I'll be working to improve that. The PBQP allocator has been updated to use the new solver.
llvm-svn: 78354
|
