summaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorLuo, Yuanke <yuanke.luo@intel.com>2022-06-29 19:13:16 +0800
committerLuo, Yuanke <yuanke.luo@intel.com>2022-06-30 11:12:05 +0800
commitfa8656d28d795a45dd76f5ca6030c5eef4c7003a (patch)
treed9833414c8db5742d98d2221a8e6c4a6e7d3caa1 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent1b8cde9b633841c7199b345132423dd3d6bdf3e7 (diff)
[greedyalloc] Return early when there is no register to allocate.
In X86 we split greddy register allocation into 2 passes. The 1st pass is to allocate tile register, and the 2nd pass is to allocate the rest of virtual register. In most cases there is no tile register, so the 1st pass is unnecessary. To improve the compiling time, we check if there is any register need to be allocated by invoking callback `ShouldAllocateClass`. If there is no register to be allocated, just return false in the pass. This would improve the 1st greed RA pass for normal cases. Differential Revision: https://reviews.llvm.org/D128804
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions