| commit | d25c150d1c1b97bb5f583dadc376904c1b80f15b | [log] [tgz] |
|---|---|---|
| author | Martin Storsjo <martin@martin.st> | Tue Feb 05 08:16:10 2019 +0000 |
| committer | Martin Storsjo <martin@martin.st> | Tue Feb 05 08:16:10 2019 +0000 |
| tree | e13dc115ba04ee4a077fd58b8586aca6b262ab8f | |
| parent | 3b0c327a39fa1b19d01eabdef869281485fd6bef [diff] |
[COFF] Avoid O(n^2) accesses into PartialSections For MinGW, unique partial sections are much more common, e.g. comdat functions get sections named e.g. text$symbol. A moderate sized example of this contains over 200K Chunks which create 174K unique PartialSections. Prior to SVN r352928 (D57574), linking this took around 1,5 seconds for me, while it afterwards takes around 13 minutes. After this patch, the linking time is back to what it was before. The std::find_if in findPartialSection will do a linear scan of the whole container until a match is found. To use something like binary_search or the std::set container's own methods, we'd need to already have a PartialSection*. Reinstate a proper map instead of having a set with a custom sorting comparator. Differential Revision: https://reviews.llvm.org/D57666 git-svn-id: https://llvm.org/svn/llvm-project/lld/trunk@353146 91177308-0d34-0410-b5e6-96231b3b80d8
This directory and its subdirectories contain source code for the LLVM Linker, a modular cross platform linker which is built as part of the LLVM compiler infrastructure project.
lld is open source software. You may freely distribute it under the terms of the license agreement found in LICENSE.txt.
In order to make sure various developers can evaluate patches over the same tests, we create a collection of self contained programs.
It is hosted at https://s3-us-west-2.amazonaws.com/linker-tests/lld-speed-test.tar.xz
The current sha256 is 10eec685463d5a8bbf08d77f4ca96282161d396c65bd97dc99dbde644a31610f.