| commit | a268c67b74ed31856f0c29a302fde6075b702df7 | [log] [tgz] |
|---|---|---|
| author | David Srbecky <dsrbecky@google.com> | Mon Nov 16 16:51:08 2020 +0000 |
| committer | David Srbecky <dsrbecky@google.com> | Wed Nov 25 15:36:34 2020 +0000 |
| tree | f57b75b9543aa2ad9185507bdf90edb19c727066 | |
| parent | 405dc60de2c80c42e78cf7aeeb53a52d81b462d6 [diff] |
Refactor symbol caching. The O(1) hashmap lookup still showed up in profiles. (because it is in the hot O(log n) binary search loop) Refactor the caching to use O(log n) map for the cache, but pull it outside the binary search loop. This speeds up the symbol lookup by 2x in perfetto. Same speed up for BM_symbol_find_single_many_times. Bug: 169745438 Test: libunwindstack_test Change-Id: Icbe16bd77b8fa72269f2c71c67740b663efee507