summaryrefslogtreecommitdiffstats
path: root/lldb/packages/Python/lldbsuite/test/python_api/frame/main.c
diff options
context:
space:
mode:
authorZachary Turner <zturner@google.com>2017-05-04 23:53:29 +0000
committerZachary Turner <zturner@google.com>2017-05-04 23:53:29 +0000
commit1eb9a0297cb639323e97ca7f02123b035bf0b24b (patch)
treeddb035ff414d6531ae8e47e0b070b1996c302422 /lldb/packages/Python/lldbsuite/test/python_api/frame/main.c
parent20d773c4af45411a77c1715857c2559ffe3a9f09 (diff)
downloadbcm5719-llvm-1eb9a0297cb639323e97ca7f02123b035bf0b24b.tar.gz
bcm5719-llvm-1eb9a0297cb639323e97ca7f02123b035bf0b24b.zip
[PDB] Don't build the entire source file list up front.
I tried to run llvm-pdbdump on a very large (~1.5GB) PDB to try and identify show-stopping performance problems. This patch addresses the first such problem. When loading the DBI stream, before anyone has even tried to access a single record, we build an in memory map of every source file for every module. In the particular PDB I was using, this was over 85 million files. Specifically, the complexity is O(m*n) where m is the number of modules and n is the average number of source files (including headers) per module. The whole reason for doing this was so that we could have constant time access to any module and any of its source file lists. However, we can still get O(1) access to the source file list for a given module with a simple O(m) precomputation, and access to the list of modules is already O(1) anyway. So this patches reduces the O(m*n) up-front precomputation to an O(m) one, where n is ~6,500 and n*m is about 85 million in my pathological test case. Differential Revision: https://reviews.llvm.org/D32870 llvm-svn: 302205
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/python_api/frame/main.c')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud