summaryrefslogtreecommitdiff
path: root/runtime/reference_table.cc
diff options
context:
space:
mode:
author Santiago Aboy Solanes <solanes@google.com> 2024-02-05 16:13:28 +0000
committer Santiago Aboy Solanes <solanes@google.com> 2024-02-06 15:15:13 +0000
commit1969e59e7eba03ac246171b88eea56ad36bfc9f0 (patch)
treec119bffd2a1c51d1d903260a50ef1cd1d0c3ada2 /runtime/reference_table.cc
parenta9b2bf7f7261e2a1be244a182dbbadf6fd4c6d93 (diff)
Improve data structure use in RemoveUnneededTries
1) The new/malloc were taking an important part of the runtime. By using scope allocator on local compiles, the method is now ~33% faster. 2) Use BitVectors instead of sets in TryBelongingInformation which avoids tree rebalancing after set merging. This improves the method a further ~20%, for a total of ~55% combined with 1). Test: art/test/testrunner/testrunner.py --host --64 --optimizing -b Change-Id: If9ad005d0d6f89656ba5aa0e37e3061af272ba07
Diffstat (limited to 'runtime/reference_table.cc')
0 files changed, 0 insertions, 0 deletions