commit | 8d659669e5f2125d2a9bf67a3f9358bbd940889d | [log] [tgz] |
---|---|---|
author | Fangrui Song <maskray@google.com> | Fri Oct 04 07:56:54 2019 +0000 |
committer | Fangrui Song <maskray@google.com> | Fri Oct 04 07:56:54 2019 +0000 |
tree | 51d59ce97099aab9fe4e772e958dd171ca06597f | |
parent | da418fcf9d440fb8006255ac208c5497496a222d [diff] |
[ELF] Use union-find set and doubly linked list in Call-Chain Clustering (C³) heuristic Before, SecToClusters[*] was used to track the belonged cluster. During a merge (From -> Into), every element of From has to be updated. Use a union-find set to speed up this use case. Also, replace `std::vector<int> Sections;` with a doubly-linked pointers: int Next, Prev; Reviewed By: Bigcheese Differential Revision: https://reviews.llvm.org/D46228 git-svn-id: https://llvm.org/svn/llvm-project/lld/trunk@373708 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.