diff options
| author | 2025-01-30 15:48:55 +0000 | |
|---|---|---|
| committer | 2025-02-11 04:53:55 -0800 | |
| commit | 321bf229a512c1d93b2ad9212b7c4863d551e36c (patch) | |
| tree | 6334fdca835d0177a09e1cefe76586a22b4cd01c /compiler/compiler_reflection_test.cc | |
| parent | 7c2bfb75a878a145c854ae0c2cb70864afd20df6 (diff) | |
Optimize FindVisitedBlockWithRecyclableSet
By adding extra bookkeeping, we can speed up the ValueSet reusable
algorithm of GVN. A block's ValueSet is reused if it will not be
used again in the future. This happens when said blocks last
dominated block or successor is visited, since we visit blocks
in RPO. This lets us create a list of free sets to be reused and
skip iterating through all visited blocks. This optimization is
better the bigger the graph.
Based on local compiles, this speeds up GVN by 12-27% and overall
compilation times by 0.6-1.6%.
Bug: 393108375
Test: art/test/testrunner/testrunner.py --host --64 -b --optimizing
Change-Id: I3731e67796a2055907b795656146aaea4f448614
Diffstat (limited to 'compiler/compiler_reflection_test.cc')
0 files changed, 0 insertions, 0 deletions