aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/ReachingDefAnalysis.cpp
diff options
context:
space:
mode:
authorFlorian Hahn <flo@fhahn.com>2020-08-28 10:31:30 +0100
committerFlorian Hahn <flo@fhahn.com>2020-08-28 11:19:04 +0100
commit43aa7227dfab8f847a346ce6da7318584182ddf1 (patch)
tree942a5d26a6442df9a5d347fcd91f953a5ea66619 /llvm/lib/CodeGen/ReachingDefAnalysis.cpp
parent9b50546b0b4087ec2ee8479d68e70b89c7956aaa (diff)
downloadllvm-43aa7227dfab8f847a346ce6da7318584182ddf1.zip
llvm-43aa7227dfab8f847a346ce6da7318584182ddf1.tar.gz
llvm-43aa7227dfab8f847a346ce6da7318584182ddf1.tar.bz2
[DSE,MemorySSA] Check if Current is valid for elimination first.
This changes getDomMemoryDef to check if a Current is a valid candidate for elimination before checking for reads. Before the change, we were spending a lot of compile-time in checking for read accesses for Current that might not even be removable. This patch flips the logic, so we skip Current if they cannot be removed before checking all their uses. This is much more efficient in practice. It also adds a more aggressive limit for checking partially overlapping stores. The main problem with overlapping stores is that we do not know if they will lead to elimination until seeing all of them. This patch limits adds a new limit for overlapping store candidates, which keeps the number of modified overlapping stores roughly the same. This is another substantial compile-time improvement (while also increasing the number of stores eliminated). Geomean -O3 -0.67%, ReleaseThinLTO -0.97%. http://llvm-compile-time-tracker.com/compare.php?from=0a929b6978a068af8ddb02d0d4714a2843dd8ba9&to=2e630629b43f64b60b282e90f0d96082fde2dacc&stat=instructions Reviewed By: asbirlea Differential Revision: https://reviews.llvm.org/D86487
Diffstat (limited to 'llvm/lib/CodeGen/ReachingDefAnalysis.cpp')
0 files changed, 0 insertions, 0 deletions