Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2025-03-02 07:16:29 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

[ELF] CallGraphSort: replace vector<int> with unique_ptr<int[]>. NFC

Browse Source 
We can't use C++20 make_unique_for_overwrite yet.
This commit is contained in:
Fangrui Song 2022-07-29 00:59:47 -07:00
parent f1fcd06a2a
commit a041ce3eb1
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lld/ELF/CallGraphSort.cpp
View File

@ -156,7 +156,7 @@ static bool isNewDensityBad(Cluster &a, Cluster &b) {
// Find the leader of V's belonged cluster (represented as an equivalence // Find the leader of V's belonged cluster (represented as an equivalence
// class). We apply union-find path-halving technique (simple to implement) in // class). We apply union-find path-halving technique (simple to implement) in
// the meantime as it decreases depths and the time complexity. // the meantime as it decreases depths and the time complexity.
static int getLeader(std::vector<int> &leaders, int v) { static int getLeader(int *leaders, int v) {
while (leaders[v] != v) { while (leaders[v] != v) {
leaders[v] = leaders[leaders[v]]; leaders[v] = leaders[leaders[v]];
v = leaders[v]; v = leaders[v];
@ -181,9 +181,9 @@ static void mergeClusters(std::vector<Cluster> &cs, Cluster &into, int intoIdx,
// then sort the clusters by density. // then sort the clusters by density.
DenseMap<const InputSectionBase *, int> CallGraphSort::run() { DenseMap<const InputSectionBase *, int> CallGraphSort::run() {
std::vector<int> sorted(clusters.size()); std::vector<int> sorted(clusters.size());
std::vector<int> leaders(clusters.size()); std::unique_ptr<int[]> leaders(new int[clusters.size()]);
std::iota(leaders.begin(), leaders.end(), 0); std::iota(leaders.get(), leaders.get() + clusters.size(), 0);
std::iota(sorted.begin(), sorted.end(), 0); std::iota(sorted.begin(), sorted.end(), 0);
llvm::stable_sort(sorted, [&](int a, int b) { llvm::stable_sort(sorted, [&](int a, int b) {
return clusters[a].getDensity() > clusters[b].getDensity(); return clusters[a].getDensity() > clusters[b].getDensity();
@ -198,7 +198,7 @@ DenseMap<const InputSectionBase *, int> CallGraphSort::run() {
if (c.bestPred.from == -1 || c.bestPred.weight * 10 <= c.initialWeight) if (c.bestPred.from == -1 || c.bestPred.weight * 10 <= c.initialWeight)
continue; continue;
int predL = getLeader(leaders, c.bestPred.from); int predL = getLeader(leaders.get(), c.bestPred.from);
if (l == predL) if (l == predL)
continue; continue;