As far as I can tell, the keys of the map are unique by pointer address, so there's no need to use the llvm::less comparator. This allows us to use DenseMap instead, which reduces tblgen time by 20% on my stress test.
Details
Details
Diff Detail
Diff Detail
- Repository
- rL LLVM
Event Timeline
Comment Actions
Added checking of uniqueness to one loop that would potentially change iteration order here. I'd prefer *not* to add checking to computeSubRegs() in CodeGenRegisters.cpp because the checking would be quite heavyweight, the method is very hot, and I am explicitly trying to improve LLVM build times in Release+Asserts configs here.