projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 2cfbe93) | patch
[LLD][ELF] - Simplify Call-Chain Clustering implementation a bit.
authorGeorge Rimar <grimar@accesssoftek.com>
Tue, 28 Aug 2018 08:49:40 +0000 (08:49 +0000)
committerGeorge Rimar <grimar@accesssoftek.com>
Tue, 28 Aug 2018 08:49:40 +0000 (08:49 +0000)
commitf0eedbce4418cfde0ee3bb18fcbd44fcb7f2da2d
treeed841d0e8e60a84650d82bd578945dfc7f0bf218tree | snapshot
parent2cfbe933a133aac80052cb8707c11b9beff4cc26commit | diff
[LLD][ELF] - Simplify Call-Chain Clustering implementation a bit.

Looking at the current implementation and algorithm description,
it does not seem we need to keep vector with all edges for
each cluster and can just remember the best one. This is NFC change.

Differential revision: https://reviews.llvm.org/D50609

llvm-svn: 340806
lld/ELF/CallGraphSort.cpp diff | blob | history
Domain: System / Toolchain;