Coverage Report

Created: 2019-05-19 14:56

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/lld/ELF/ICF.cpp
Line
Count
Source (jump to first uncovered line)
1
//===- ICF.cpp ------------------------------------------------------------===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
// ICF is short for Identical Code Folding. This is a size optimization to
10
// identify and merge two or more read-only sections (typically functions)
11
// that happened to have the same contents. It usually reduces output size
12
// by a few percent.
13
//
14
// In ICF, two sections are considered identical if they have the same
15
// section flags, section data, and relocations. Relocations are tricky,
16
// because two relocations are considered the same if they have the same
17
// relocation types, values, and if they point to the same sections *in
18
// terms of ICF*.
19
//
20
// Here is an example. If foo and bar defined below are compiled to the
21
// same machine instructions, ICF can and should merge the two, although
22
// their relocations point to each other.
23
//
24
//   void foo() { bar(); }
25
//   void bar() { foo(); }
26
//
27
// If you merge the two, their relocations point to the same section and
28
// thus you know they are mergeable, but how do you know they are
29
// mergeable in the first place? This is not an easy problem to solve.
30
//
31
// What we are doing in LLD is to partition sections into equivalence
32
// classes. Sections in the same equivalence class when the algorithm
33
// terminates are considered identical. Here are details:
34
//
35
// 1. First, we partition sections using their hash values as keys. Hash
36
//    values contain section types, section contents and numbers of
37
//    relocations. During this step, relocation targets are not taken into
38
//    account. We just put sections that apparently differ into different
39
//    equivalence classes.
40
//
41
// 2. Next, for each equivalence class, we visit sections to compare
42
//    relocation targets. Relocation targets are considered equivalent if
43
//    their targets are in the same equivalence class. Sections with
44
//    different relocation targets are put into different equivalence
45
//    clases.
46
//
47
// 3. If we split an equivalence class in step 2, two relocations
48
//    previously target the same equivalence class may now target
49
//    different equivalence classes. Therefore, we repeat step 2 until a
50
//    convergence is obtained.
51
//
52
// 4. For each equivalence class C, pick an arbitrary section in C, and
53
//    merge all the other sections in C with it.
54
//
55
// For small programs, this algorithm needs 3-5 iterations. For large
56
// programs such as Chromium, it takes more than 20 iterations.
57
//
58
// This algorithm was mentioned as an "optimistic algorithm" in [1],
59
// though gold implements a different algorithm than this.
60
//
61
// We parallelize each step so that multiple threads can work on different
62
// equivalence classes concurrently. That gave us a large performance
63
// boost when applying ICF on large programs. For example, MSVC link.exe
64
// or GNU gold takes 10-20 seconds to apply ICF on Chromium, whose output
65
// size is about 1.5 GB, but LLD can finish it in less than 2 seconds on a
66
// 2.8 GHz 40 core machine. Even without threading, LLD's ICF is still
67
// faster than MSVC or gold though.
68
//
69
// [1] Safe ICF: Pointer Safe and Unwinding aware Identical Code Folding
70
// in the Gold Linker
71
// http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/36912.pdf
72
//
73
//===----------------------------------------------------------------------===//
74
75
#include "ICF.h"
76
#include "Config.h"
77
#include "SymbolTable.h"
78
#include "Symbols.h"
79
#include "SyntheticSections.h"
80
#include "Writer.h"
81
#include "lld/Common/Threads.h"
82
#include "llvm/ADT/StringExtras.h"
83
#include "llvm/BinaryFormat/ELF.h"
84
#include "llvm/Object/ELF.h"
85
#include "llvm/Support/xxhash.h"
86
#include <algorithm>
87
#include <atomic>
88
89
using namespace lld;
90
using namespace lld::elf;
91
using namespace llvm;
92
using namespace llvm::ELF;
93
using namespace llvm::object;
94
95
namespace {
96
template <class ELFT> class ICF {
97
public:
98
  void run();
99
100
private:
101
  void segregate(size_t Begin, size_t End, bool Constant);
102
103
  template <class RelTy>
104
  bool constantEq(const InputSection *A, ArrayRef<RelTy> RelsA,
105
                  const InputSection *B, ArrayRef<RelTy> RelsB);
106
107
  template <class RelTy>
108
  bool variableEq(const InputSection *A, ArrayRef<RelTy> RelsA,
109
                  const InputSection *B, ArrayRef<RelTy> RelsB);
110
111
  bool equalsConstant(const InputSection *A, const InputSection *B);
112
  bool equalsVariable(const InputSection *A, const InputSection *B);
113
114
  size_t findBoundary(size_t Begin, size_t End);
115
116
  void forEachClassRange(size_t Begin, size_t End,
117
                         llvm::function_ref<void(size_t, size_t)> Fn);
118
119
  void forEachClass(llvm::function_ref<void(size_t, size_t)> Fn);
120
121
  std::vector<InputSection *> Sections;
122
123
  // We repeat the main loop while `Repeat` is true.
124
  std::atomic<bool> Repeat;
125
126
  // The main loop counter.
127
  int Cnt = 0;
128
129
  // We have two locations for equivalence classes. On the first iteration
130
  // of the main loop, Class[0] has a valid value, and Class[1] contains
131
  // garbage. We read equivalence classes from slot 0 and write to slot 1.
132
  // So, Class[0] represents the current class, and Class[1] represents
133
  // the next class. On each iteration, we switch their roles and use them
134
  // alternately.
135
  //
136
  // Why are we doing this? Recall that other threads may be working on
137
  // other equivalence classes in parallel. They may read sections that we
138
  // are updating. We cannot update equivalence classes in place because
139
  // it breaks the invariance that all possibly-identical sections must be
140
  // in the same equivalence class at any moment. In other words, the for
141
  // loop to update equivalence classes is not atomic, and that is
142
  // observable from other threads. By writing new classes to other
143
  // places, we can keep the invariance.
144
  //
145
  // Below, `Current` has the index of the current class, and `Next` has
146
  // the index of the next class. If threading is enabled, they are either
147
  // (0, 1) or (1, 0).
148
  //
149
  // Note on single-thread: if that's the case, they are always (0, 0)
150
  // because we can safely read the next class without worrying about race
151
  // conditions. Using the same location makes this algorithm converge
152
  // faster because it uses results of the same iteration earlier.
153
  int Current = 0;
154
  int Next = 0;
155
};
156
}
157
158
// Returns true if section S is subject of ICF.
159
2.46k
static bool isEligible(InputSection *S) {
160
2.46k
  if (!S->Live || 
S->KeepUnique2.46k
||
!(S->Flags & SHF_ALLOC)2.38k
)
161
149
    return false;
162
2.31k
163
2.31k
  // Don't merge writable sections. .data.rel.ro sections are marked as writable
164
2.31k
  // but are semantically read-only.
165
2.31k
  if ((S->Flags & SHF_WRITE) && 
S->Name != ".data.rel.ro"3
&&
166
2.31k
      
!S->Name.startswith(".data.rel.ro.")2
)
167
1
    return false;
168
2.31k
169
2.31k
  // SHF_LINK_ORDER sections are ICF'd as a unit with their dependent sections,
170
2.31k
  // so we don't consider them for ICF individually.
171
2.31k
  if (S->Flags & SHF_LINK_ORDER)
172
4
    return false;
173
2.30k
174
2.30k
  // Don't merge synthetic sections as their Data member is not valid and empty.
175
2.30k
  // The Data member needs to be valid for ICF as it is used by ICF to determine
176
2.30k
  // the equality of section contents.
177
2.30k
  if (isa<SyntheticSection>(S))
178
9
    return false;
179
2.30k
180
2.30k
  // .init and .fini contains instructions that must be executed to initialize
181
2.30k
  // and finalize the process. They cannot and should not be merged.
182
2.30k
  if (S->Name == ".init" || 
S->Name == ".fini"2.29k
)
183
2
    return false;
184
2.29k
185
2.29k
  // A user program may enumerate sections named with a C identifier using
186
2.29k
  // __start_* and __stop_* symbols. We cannot ICF any such sections because
187
2.29k
  // that could change program semantics.
188
2.29k
  if (isValidCIdentifier(S->Name))
189
2
    return false;
190
2.29k
191
2.29k
  return true;
192
2.29k
}
193
194
// Split an equivalence class into smaller classes.
195
template <class ELFT>
196
2.32k
void ICF<ELFT>::segregate(size_t Begin, size_t End, bool Constant) {
197
2.32k
  // This loop rearranges sections in [Begin, End) so that all sections
198
2.32k
  // that are equal in terms of equals{Constant,Variable} are contiguous
199
2.32k
  // in [Begin, End).
200
2.32k
  //
201
2.32k
  // The algorithm is quadratic in the worst case, but that is not an
202
2.32k
  // issue in practice because the number of the distinct sections in
203
2.32k
  // each range is usually very small.
204
2.32k
205
6.71k
  while (Begin < End) {
206
4.39k
    // Divide [Begin, End) into two. Let Mid be the start index of the
207
4.39k
    // second group.
208
4.39k
    auto Bound =
209
4.39k
        std::stable_partition(Sections.begin() + Begin + 1,
210
2.09M
                              Sections.begin() + End, [&](InputSection *S) {
211
2.09M
                                if (Constant)
212
2.09M
                                  return equalsConstant(Sections[Begin], S);
213
82
                                return equalsVariable(Sections[Begin], S);
214
82
                              });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::segregate(unsigned long, unsigned long, bool)::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
210
6
                              Sections.begin() + End, [&](InputSection *S) {
211
6
                                if (Constant)
212
3
                                  return equalsConstant(Sections[Begin], S);
213
3
                                return equalsVariable(Sections[Begin], S);
214
3
                              });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::segregate(unsigned long, unsigned long, bool)::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::segregate(unsigned long, unsigned long, bool)::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
210
2.09M
                              Sections.begin() + End, [&](InputSection *S) {
211
2.09M
                                if (Constant)
212
2.09M
                                  return equalsConstant(Sections[Begin], S);
213
79
                                return equalsVariable(Sections[Begin], S);
214
79
                              });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::segregate(unsigned long, unsigned long, bool)::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
215
4.39k
    size_t Mid = Bound - Sections.begin();
216
4.39k
217
4.39k
    // Now we split [Begin, End) into [Begin, Mid) and [Mid, End) by
218
4.39k
    // updating the sections in [Begin, Mid). We use Mid as an equivalence
219
4.39k
    // class ID because every group ends with a unique index.
220
8.95k
    for (size_t I = Begin; I < Mid; 
++I4.56k
)
221
4.56k
      Sections[I]->Class[Next] = Mid;
222
4.39k
223
4.39k
    // If we created a group, we need to iterate the main loop again.
224
4.39k
    if (Mid != End)
225
2.06k
      Repeat = true;
226
4.39k
227
4.39k
    Begin = Mid;
228
4.39k
  }
229
2.32k
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::segregate(unsigned long, unsigned long, bool)
Line
Count
Source
196
20
void ICF<ELFT>::segregate(size_t Begin, size_t End, bool Constant) {
197
20
  // This loop rearranges sections in [Begin, End) so that all sections
198
20
  // that are equal in terms of equals{Constant,Variable} are contiguous
199
20
  // in [Begin, End).
200
20
  //
201
20
  // The algorithm is quadratic in the worst case, but that is not an
202
20
  // issue in practice because the number of the distinct sections in
203
20
  // each range is usually very small.
204
20
205
40
  while (Begin < End) {
206
20
    // Divide [Begin, End) into two. Let Mid be the start index of the
207
20
    // second group.
208
20
    auto Bound =
209
20
        std::stable_partition(Sections.begin() + Begin + 1,
210
20
                              Sections.begin() + End, [&](InputSection *S) {
211
20
                                if (Constant)
212
20
                                  return equalsConstant(Sections[Begin], S);
213
20
                                return equalsVariable(Sections[Begin], S);
214
20
                              });
215
20
    size_t Mid = Bound - Sections.begin();
216
20
217
20
    // Now we split [Begin, End) into [Begin, Mid) and [Mid, End) by
218
20
    // updating the sections in [Begin, Mid). We use Mid as an equivalence
219
20
    // class ID because every group ends with a unique index.
220
46
    for (size_t I = Begin; I < Mid; 
++I26
)
221
26
      Sections[I]->Class[Next] = Mid;
222
20
223
20
    // If we created a group, we need to iterate the main loop again.
224
20
    if (Mid != End)
225
0
      Repeat = true;
226
20
227
20
    Begin = Mid;
228
20
  }
229
20
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::segregate(unsigned long, unsigned long, bool)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::segregate(unsigned long, unsigned long, bool)
Line
Count
Source
196
2.30k
void ICF<ELFT>::segregate(size_t Begin, size_t End, bool Constant) {
197
2.30k
  // This loop rearranges sections in [Begin, End) so that all sections
198
2.30k
  // that are equal in terms of equals{Constant,Variable} are contiguous
199
2.30k
  // in [Begin, End).
200
2.30k
  //
201
2.30k
  // The algorithm is quadratic in the worst case, but that is not an
202
2.30k
  // issue in practice because the number of the distinct sections in
203
2.30k
  // each range is usually very small.
204
2.30k
205
6.67k
  while (Begin < End) {
206
4.37k
    // Divide [Begin, End) into two. Let Mid be the start index of the
207
4.37k
    // second group.
208
4.37k
    auto Bound =
209
4.37k
        std::stable_partition(Sections.begin() + Begin + 1,
210
4.37k
                              Sections.begin() + End, [&](InputSection *S) {
211
4.37k
                                if (Constant)
212
4.37k
                                  return equalsConstant(Sections[Begin], S);
213
4.37k
                                return equalsVariable(Sections[Begin], S);
214
4.37k
                              });
215
4.37k
    size_t Mid = Bound - Sections.begin();
216
4.37k
217
4.37k
    // Now we split [Begin, End) into [Begin, Mid) and [Mid, End) by
218
4.37k
    // updating the sections in [Begin, Mid). We use Mid as an equivalence
219
4.37k
    // class ID because every group ends with a unique index.
220
8.91k
    for (size_t I = Begin; I < Mid; 
++I4.54k
)
221
4.54k
      Sections[I]->Class[Next] = Mid;
222
4.37k
223
4.37k
    // If we created a group, we need to iterate the main loop again.
224
4.37k
    if (Mid != End)
225
2.06k
      Repeat = true;
226
4.37k
227
4.37k
    Begin = Mid;
228
4.37k
  }
229
2.30k
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::segregate(unsigned long, unsigned long, bool)
230
231
// Compare two lists of relocations.
232
template <class ELFT>
233
template <class RelTy>
234
bool ICF<ELFT>::constantEq(const InputSection *SecA, ArrayRef<RelTy> RA,
235
91
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
236
104
  for (size_t I = 0; I < RA.size(); 
++I13
) {
237
22
    if (RA[I].r_offset != RB[I].r_offset ||
238
22
        
RA[I].getType(Config->IsMips64EL) != RB[I].getType(Config->IsMips64EL)21
)
239
1
      return false;
240
21
241
21
    uint64_t AddA = getAddend<ELFT>(RA[I]);
242
21
    uint64_t AddB = getAddend<ELFT>(RB[I]);
243
21
244
21
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
245
21
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
246
21
    if (&SA == &SB) {
247
7
      if (AddA == AddB)
248
6
        continue;
249
1
      return false;
250
1
    }
251
14
252
14
    auto *DA = dyn_cast<Defined>(&SA);
253
14
    auto *DB = dyn_cast<Defined>(&SB);
254
14
255
14
    // Placeholder symbols generated by linker scripts look the same now but
256
14
    // may have different values later.
257
14
    if (!DA || !DB || DA->ScriptDefined || 
DB->ScriptDefined13
)
258
1
      return false;
259
13
260
13
    // Relocations referring to absolute symbols are constant-equal if their
261
13
    // values are equal.
262
13
    if (!DA->Section && 
!DB->Section2
&&
DA->Value + AddA == DB->Value + AddB2
)
263
1
      continue;
264
12
    if (!DA->Section || 
!DB->Section11
)
265
1
      return false;
266
11
267
11
    if (DA->Section->kind() != DB->Section->kind())
268
0
      return false;
269
11
270
11
    // Relocations referring to InputSections are constant-equal if their
271
11
    // section offsets are equal.
272
11
    if (isa<InputSection>(DA->Section)) {
273
5
      if (DA->Value + AddA == DB->Value + AddB)
274
4
        continue;
275
1
      return false;
276
1
    }
277
6
278
6
    // Relocations referring to MergeInputSections are constant-equal if their
279
6
    // offsets in the output section are equal.
280
6
    auto *X = dyn_cast<MergeInputSection>(DA->Section);
281
6
    if (!X)
282
1
      return false;
283
5
    auto *Y = cast<MergeInputSection>(DB->Section);
284
5
    if (X->getParent() != Y->getParent())
285
1
      return false;
286
4
287
4
    uint64_t OffsetA =
288
4
        SA.isSection() ? 
X->getOffset(AddA)1
:
X->getOffset(DA->Value) + AddA3
;
289
4
    uint64_t OffsetB =
290
4
        SB.isSection() ? 
Y->getOffset(AddB)1
:
Y->getOffset(DB->Value) + AddB3
;
291
4
    if (OffsetA != OffsetB)
292
2
      return false;
293
4
  }
294
91
295
91
  
return true82
;
296
91
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >)
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >)
Line
Count
Source
235
3
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
236
4
  for (size_t I = 0; I < RA.size(); 
++I1
) {
237
1
    if (RA[I].r_offset != RB[I].r_offset ||
238
1
        RA[I].getType(Config->IsMips64EL) != RB[I].getType(Config->IsMips64EL))
239
0
      return false;
240
1
241
1
    uint64_t AddA = getAddend<ELFT>(RA[I]);
242
1
    uint64_t AddB = getAddend<ELFT>(RB[I]);
243
1
244
1
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
245
1
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
246
1
    if (&SA == &SB) {
247
1
      if (AddA == AddB)
248
1
        continue;
249
0
      return false;
250
0
    }
251
0
252
0
    auto *DA = dyn_cast<Defined>(&SA);
253
0
    auto *DB = dyn_cast<Defined>(&SB);
254
0
255
0
    // Placeholder symbols generated by linker scripts look the same now but
256
0
    // may have different values later.
257
0
    if (!DA || !DB || DA->ScriptDefined || DB->ScriptDefined)
258
0
      return false;
259
0
260
0
    // Relocations referring to absolute symbols are constant-equal if their
261
0
    // values are equal.
262
0
    if (!DA->Section && !DB->Section && DA->Value + AddA == DB->Value + AddB)
263
0
      continue;
264
0
    if (!DA->Section || !DB->Section)
265
0
      return false;
266
0
267
0
    if (DA->Section->kind() != DB->Section->kind())
268
0
      return false;
269
0
270
0
    // Relocations referring to InputSections are constant-equal if their
271
0
    // section offsets are equal.
272
0
    if (isa<InputSection>(DA->Section)) {
273
0
      if (DA->Value + AddA == DB->Value + AddB)
274
0
        continue;
275
0
      return false;
276
0
    }
277
0
278
0
    // Relocations referring to MergeInputSections are constant-equal if their
279
0
    // offsets in the output section are equal.
280
0
    auto *X = dyn_cast<MergeInputSection>(DA->Section);
281
0
    if (!X)
282
0
      return false;
283
0
    auto *Y = cast<MergeInputSection>(DB->Section);
284
0
    if (X->getParent() != Y->getParent())
285
0
      return false;
286
0
287
0
    uint64_t OffsetA =
288
0
        SA.isSection() ? X->getOffset(AddA) : X->getOffset(DA->Value) + AddA;
289
0
    uint64_t OffsetB =
290
0
        SB.isSection() ? Y->getOffset(AddB) : Y->getOffset(DB->Value) + AddB;
291
0
    if (OffsetA != OffsetB)
292
0
      return false;
293
0
  }
294
3
295
3
  return true;
296
3
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >)
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >)
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >)
Line
Count
Source
235
20
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
236
32
  for (size_t I = 0; I < RA.size(); 
++I12
) {
237
21
    if (RA[I].r_offset != RB[I].r_offset ||
238
21
        
RA[I].getType(Config->IsMips64EL) != RB[I].getType(Config->IsMips64EL)20
)
239
1
      return false;
240
20
241
20
    uint64_t AddA = getAddend<ELFT>(RA[I]);
242
20
    uint64_t AddB = getAddend<ELFT>(RB[I]);
243
20
244
20
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
245
20
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
246
20
    if (&SA == &SB) {
247
6
      if (AddA == AddB)
248
5
        continue;
249
1
      return false;
250
1
    }
251
14
252
14
    auto *DA = dyn_cast<Defined>(&SA);
253
14
    auto *DB = dyn_cast<Defined>(&SB);
254
14
255
14
    // Placeholder symbols generated by linker scripts look the same now but
256
14
    // may have different values later.
257
14
    if (!DA || !DB || DA->ScriptDefined || 
DB->ScriptDefined13
)
258
1
      return false;
259
13
260
13
    // Relocations referring to absolute symbols are constant-equal if their
261
13
    // values are equal.
262
13
    if (!DA->Section && 
!DB->Section2
&&
DA->Value + AddA == DB->Value + AddB2
)
263
1
      continue;
264
12
    if (!DA->Section || 
!DB->Section11
)
265
1
      return false;
266
11
267
11
    if (DA->Section->kind() != DB->Section->kind())
268
0
      return false;
269
11
270
11
    // Relocations referring to InputSections are constant-equal if their
271
11
    // section offsets are equal.
272
11
    if (isa<InputSection>(DA->Section)) {
273
5
      if (DA->Value + AddA == DB->Value + AddB)
274
4
        continue;
275
1
      return false;
276
1
    }
277
6
278
6
    // Relocations referring to MergeInputSections are constant-equal if their
279
6
    // offsets in the output section are equal.
280
6
    auto *X = dyn_cast<MergeInputSection>(DA->Section);
281
6
    if (!X)
282
1
      return false;
283
5
    auto *Y = cast<MergeInputSection>(DB->Section);
284
5
    if (X->getParent() != Y->getParent())
285
1
      return false;
286
4
287
4
    uint64_t OffsetA =
288
4
        SA.isSection() ? 
X->getOffset(AddA)1
:
X->getOffset(DA->Value) + AddA3
;
289
4
    uint64_t OffsetB =
290
4
        SB.isSection() ? 
Y->getOffset(AddB)1
:
Y->getOffset(DB->Value) + AddB3
;
291
4
    if (OffsetA != OffsetB)
292
2
      return false;
293
4
  }
294
20
295
20
  
return true11
;
296
20
}
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >)
Line
Count
Source
235
68
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
236
68
  for (size_t I = 0; I < RA.size(); 
++I0
) {
237
0
    if (RA[I].r_offset != RB[I].r_offset ||
238
0
        RA[I].getType(Config->IsMips64EL) != RB[I].getType(Config->IsMips64EL))
239
0
      return false;
240
0
241
0
    uint64_t AddA = getAddend<ELFT>(RA[I]);
242
0
    uint64_t AddB = getAddend<ELFT>(RB[I]);
243
0
244
0
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
245
0
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
246
0
    if (&SA == &SB) {
247
0
      if (AddA == AddB)
248
0
        continue;
249
0
      return false;
250
0
    }
251
0
252
0
    auto *DA = dyn_cast<Defined>(&SA);
253
0
    auto *DB = dyn_cast<Defined>(&SB);
254
0
255
0
    // Placeholder symbols generated by linker scripts look the same now but
256
0
    // may have different values later.
257
0
    if (!DA || !DB || DA->ScriptDefined || DB->ScriptDefined)
258
0
      return false;
259
0
260
0
    // Relocations referring to absolute symbols are constant-equal if their
261
0
    // values are equal.
262
0
    if (!DA->Section && !DB->Section && DA->Value + AddA == DB->Value + AddB)
263
0
      continue;
264
0
    if (!DA->Section || !DB->Section)
265
0
      return false;
266
0
267
0
    if (DA->Section->kind() != DB->Section->kind())
268
0
      return false;
269
0
270
0
    // Relocations referring to InputSections are constant-equal if their
271
0
    // section offsets are equal.
272
0
    if (isa<InputSection>(DA->Section)) {
273
0
      if (DA->Value + AddA == DB->Value + AddB)
274
0
        continue;
275
0
      return false;
276
0
    }
277
0
278
0
    // Relocations referring to MergeInputSections are constant-equal if their
279
0
    // offsets in the output section are equal.
280
0
    auto *X = dyn_cast<MergeInputSection>(DA->Section);
281
0
    if (!X)
282
0
      return false;
283
0
    auto *Y = cast<MergeInputSection>(DB->Section);
284
0
    if (X->getParent() != Y->getParent())
285
0
      return false;
286
0
287
0
    uint64_t OffsetA =
288
0
        SA.isSection() ? X->getOffset(AddA) : X->getOffset(DA->Value) + AddA;
289
0
    uint64_t OffsetB =
290
0
        SB.isSection() ? Y->getOffset(AddB) : Y->getOffset(DB->Value) + AddB;
291
0
    if (OffsetA != OffsetB)
292
0
      return false;
293
0
  }
294
68
295
68
  return true;
296
68
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >)
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::constantEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >)
297
298
// Compare "non-moving" part of two InputSections, namely everything
299
// except relocation targets.
300
template <class ELFT>
301
2.09M
bool ICF<ELFT>::equalsConstant(const InputSection *A, const InputSection *B) {
302
2.09M
  if (A->NumRelocations != B->NumRelocations || A->Flags != B->Flags ||
303
2.09M
      
A->getSize() != B->getSize()2.09M
||
A->data() != B->data()2.09M
)
304
2
    return false;
305
2.09M
306
2.09M
  // If two sections have different output sections, we cannot merge them.
307
2.09M
  // FIXME: This doesn't do the right thing in the case where there is a linker
308
2.09M
  // script. We probably need to move output section assignment before ICF to
309
2.09M
  // get the correct behaviour here.
310
2.09M
  if (getOutputSectionName(A) != getOutputSectionName(B))
311
2.09M
    return false;
312
91
313
91
  if (A->AreRelocsRela)
314
20
    return constantEq(A, A->template relas<ELFT>(), B,
315
20
                      B->template relas<ELFT>());
316
71
  return constantEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
317
71
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::equalsConstant(lld::elf::InputSection const*, lld::elf::InputSection const*)
Line
Count
Source
301
3
bool ICF<ELFT>::equalsConstant(const InputSection *A, const InputSection *B) {
302
3
  if (A->NumRelocations != B->NumRelocations || A->Flags != B->Flags ||
303
3
      A->getSize() != B->getSize() || A->data() != B->data())
304
0
    return false;
305
3
306
3
  // If two sections have different output sections, we cannot merge them.
307
3
  // FIXME: This doesn't do the right thing in the case where there is a linker
308
3
  // script. We probably need to move output section assignment before ICF to
309
3
  // get the correct behaviour here.
310
3
  if (getOutputSectionName(A) != getOutputSectionName(B))
311
0
    return false;
312
3
313
3
  if (A->AreRelocsRela)
314
0
    return constantEq(A, A->template relas<ELFT>(), B,
315
0
                      B->template relas<ELFT>());
316
3
  return constantEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
317
3
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::equalsConstant(lld::elf::InputSection const*, lld::elf::InputSection const*)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::equalsConstant(lld::elf::InputSection const*, lld::elf::InputSection const*)
Line
Count
Source
301
2.09M
bool ICF<ELFT>::equalsConstant(const InputSection *A, const InputSection *B) {
302
2.09M
  if (A->NumRelocations != B->NumRelocations || A->Flags != B->Flags ||
303
2.09M
      
A->getSize() != B->getSize()2.09M
||
A->data() != B->data()2.09M
)
304
2
    return false;
305
2.09M
306
2.09M
  // If two sections have different output sections, we cannot merge them.
307
2.09M
  // FIXME: This doesn't do the right thing in the case where there is a linker
308
2.09M
  // script. We probably need to move output section assignment before ICF to
309
2.09M
  // get the correct behaviour here.
310
2.09M
  if (getOutputSectionName(A) != getOutputSectionName(B))
311
2.09M
    return false;
312
88
313
88
  if (A->AreRelocsRela)
314
20
    return constantEq(A, A->template relas<ELFT>(), B,
315
20
                      B->template relas<ELFT>());
316
68
  return constantEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
317
68
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::equalsConstant(lld::elf::InputSection const*, lld::elf::InputSection const*)
318
319
// Compare two lists of relocations. Returns true if all pairs of
320
// relocations point to the same section in terms of ICF.
321
template <class ELFT>
322
template <class RelTy>
323
bool ICF<ELFT>::variableEq(const InputSection *SecA, ArrayRef<RelTy> RA,
324
82
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
325
82
  assert(RA.size() == RB.size());
326
82
327
94
  for (size_t I = 0; I < RA.size(); 
++I12
) {
328
13
    // The two sections must be identical.
329
13
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
330
13
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
331
13
    if (&SA == &SB)
332
6
      continue;
333
7
334
7
    auto *DA = cast<Defined>(&SA);
335
7
    auto *DB = cast<Defined>(&SB);
336
7
337
7
    // We already dealt with absolute and non-InputSection symbols in
338
7
    // constantEq, and for InputSections we have already checked everything
339
7
    // except the equivalence class.
340
7
    if (!DA->Section)
341
1
      continue;
342
6
    auto *X = dyn_cast<InputSection>(DA->Section);
343
6
    if (!X)
344
2
      continue;
345
4
    auto *Y = cast<InputSection>(DB->Section);
346
4
347
4
    // Ineligible sections are in the special equivalence class 0.
348
4
    // They can never be the same in terms of the equivalence class.
349
4
    if (X->Class[Current] == 0)
350
1
      return false;
351
3
    if (X->Class[Current] != Y->Class[Current])
352
0
      return false;
353
81
  };
354
81
355
81
  return true;
356
82
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >)
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >)
Line
Count
Source
324
3
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
325
3
  assert(RA.size() == RB.size());
326
3
327
4
  for (size_t I = 0; I < RA.size(); 
++I1
) {
328
1
    // The two sections must be identical.
329
1
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
330
1
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
331
1
    if (&SA == &SB)
332
1
      continue;
333
0
334
0
    auto *DA = cast<Defined>(&SA);
335
0
    auto *DB = cast<Defined>(&SB);
336
0
337
0
    // We already dealt with absolute and non-InputSection symbols in
338
0
    // constantEq, and for InputSections we have already checked everything
339
0
    // except the equivalence class.
340
0
    if (!DA->Section)
341
0
      continue;
342
0
    auto *X = dyn_cast<InputSection>(DA->Section);
343
0
    if (!X)
344
0
      continue;
345
0
    auto *Y = cast<InputSection>(DB->Section);
346
0
347
0
    // Ineligible sections are in the special equivalence class 0.
348
0
    // They can never be the same in terms of the equivalence class.
349
0
    if (X->Class[Current] == 0)
350
0
      return false;
351
0
    if (X->Class[Current] != Y->Class[Current])
352
0
      return false;
353
3
  };
354
3
355
3
  return true;
356
3
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >)
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >)
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >)
Line
Count
Source
324
11
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
325
11
  assert(RA.size() == RB.size());
326
11
327
22
  for (size_t I = 0; I < RA.size(); 
++I11
) {
328
12
    // The two sections must be identical.
329
12
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
330
12
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
331
12
    if (&SA == &SB)
332
5
      continue;
333
7
334
7
    auto *DA = cast<Defined>(&SA);
335
7
    auto *DB = cast<Defined>(&SB);
336
7
337
7
    // We already dealt with absolute and non-InputSection symbols in
338
7
    // constantEq, and for InputSections we have already checked everything
339
7
    // except the equivalence class.
340
7
    if (!DA->Section)
341
1
      continue;
342
6
    auto *X = dyn_cast<InputSection>(DA->Section);
343
6
    if (!X)
344
2
      continue;
345
4
    auto *Y = cast<InputSection>(DB->Section);
346
4
347
4
    // Ineligible sections are in the special equivalence class 0.
348
4
    // They can never be the same in terms of the equivalence class.
349
4
    if (X->Class[Current] == 0)
350
1
      return false;
351
3
    if (X->Class[Current] != Y->Class[Current])
352
0
      return false;
353
10
  };
354
10
355
10
  return true;
356
11
}
ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >)
Line
Count
Source
324
68
                           const InputSection *SecB, ArrayRef<RelTy> RB) {
325
68
  assert(RA.size() == RB.size());
326
68
327
68
  for (size_t I = 0; I < RA.size(); 
++I0
) {
328
0
    // The two sections must be identical.
329
0
    Symbol &SA = SecA->template getFile<ELFT>()->getRelocTargetSym(RA[I]);
330
0
    Symbol &SB = SecB->template getFile<ELFT>()->getRelocTargetSym(RB[I]);
331
0
    if (&SA == &SB)
332
0
      continue;
333
0
334
0
    auto *DA = cast<Defined>(&SA);
335
0
    auto *DB = cast<Defined>(&SB);
336
0
337
0
    // We already dealt with absolute and non-InputSection symbols in
338
0
    // constantEq, and for InputSections we have already checked everything
339
0
    // except the equivalence class.
340
0
    if (!DA->Section)
341
0
      continue;
342
0
    auto *X = dyn_cast<InputSection>(DA->Section);
343
0
    if (!X)
344
0
      continue;
345
0
    auto *Y = cast<InputSection>(DB->Section);
346
0
347
0
    // Ineligible sections are in the special equivalence class 0.
348
0
    // They can never be the same in terms of the equivalence class.
349
0
    if (X->Class[Current] == 0)
350
0
      return false;
351
0
    if (X->Class[Current] != Y->Class[Current])
352
0
      return false;
353
68
  };
354
68
355
68
  return true;
356
68
}
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >)
Unexecuted instantiation: ICF.cpp:bool (anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::variableEq<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >(lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >, lld::elf::InputSection const*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >)
357
358
// Compare "moving" part of two InputSections, namely relocation targets.
359
template <class ELFT>
360
82
bool ICF<ELFT>::equalsVariable(const InputSection *A, const InputSection *B) {
361
82
  if (A->AreRelocsRela)
362
11
    return variableEq(A, A->template relas<ELFT>(), B,
363
11
                      B->template relas<ELFT>());
364
71
  return variableEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
365
71
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::equalsVariable(lld::elf::InputSection const*, lld::elf::InputSection const*)
Line
Count
Source
360
3
bool ICF<ELFT>::equalsVariable(const InputSection *A, const InputSection *B) {
361
3
  if (A->AreRelocsRela)
362
0
    return variableEq(A, A->template relas<ELFT>(), B,
363
0
                      B->template relas<ELFT>());
364
3
  return variableEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
365
3
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::equalsVariable(lld::elf::InputSection const*, lld::elf::InputSection const*)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::equalsVariable(lld::elf::InputSection const*, lld::elf::InputSection const*)
Line
Count
Source
360
79
bool ICF<ELFT>::equalsVariable(const InputSection *A, const InputSection *B) {
361
79
  if (A->AreRelocsRela)
362
11
    return variableEq(A, A->template relas<ELFT>(), B,
363
11
                      B->template relas<ELFT>());
364
68
  return variableEq(A, A->template rels<ELFT>(), B, B->template rels<ELFT>());
365
68
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::equalsVariable(lld::elf::InputSection const*, lld::elf::InputSection const*)
366
367
5.05k
template <class ELFT> size_t ICF<ELFT>::findBoundary(size_t Begin, size_t End) {
368
5.05k
  uint32_t Class = Sections[Begin]->Class[Current];
369
185k
  for (size_t I = Begin + 1; I < End; 
++I180k
)
370
184k
    if (Class != Sections[I]->Class[Current])
371
4.37k
      return I;
372
5.05k
  
return End685
;
373
5.05k
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::findBoundary(unsigned long, unsigned long)
Line
Count
Source
367
30
template <class ELFT> size_t ICF<ELFT>::findBoundary(size_t Begin, size_t End) {
368
30
  uint32_t Class = Sections[Begin]->Class[Current];
369
39
  for (size_t I = Begin + 1; I < End; 
++I9
)
370
30
    if (Class != Sections[I]->Class[Current])
371
21
      return I;
372
30
  
return End9
;
373
30
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::findBoundary(unsigned long, unsigned long)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::findBoundary(unsigned long, unsigned long)
Line
Count
Source
367
5.02k
template <class ELFT> size_t ICF<ELFT>::findBoundary(size_t Begin, size_t End) {
368
5.02k
  uint32_t Class = Sections[Begin]->Class[Current];
369
185k
  for (size_t I = Begin + 1; I < End; 
++I180k
)
370
184k
    if (Class != Sections[I]->Class[Current])
371
4.35k
      return I;
372
5.02k
  
return End676
;
373
5.02k
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::findBoundary(unsigned long, unsigned long)
374
375
// Sections in the same equivalence class are contiguous in Sections
376
// vector. Therefore, Sections vector can be considered as contiguous
377
// groups of sections, grouped by the class.
378
//
379
// This function calls Fn on every group within [Begin, End).
380
template <class ELFT>
381
void ICF<ELFT>::forEachClassRange(size_t Begin, size_t End,
382
434
                                  llvm::function_ref<void(size_t, size_t)> Fn) {
383
4.98k
  while (Begin < End) {
384
4.54k
    size_t Mid = findBoundary(Begin, End);
385
4.54k
    Fn(Begin, Mid);
386
4.54k
    Begin = Mid;
387
4.54k
  }
388
434
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::forEachClassRange(unsigned long, unsigned long, llvm::function_ref<void (unsigned long, unsigned long)>)
Line
Count
Source
382
9
                                  llvm::function_ref<void(size_t, size_t)> Fn) {
383
39
  while (Begin < End) {
384
30
    size_t Mid = findBoundary(Begin, End);
385
30
    Fn(Begin, Mid);
386
30
    Begin = Mid;
387
30
  }
388
9
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::forEachClassRange(unsigned long, unsigned long, llvm::function_ref<void (unsigned long, unsigned long)>)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::forEachClassRange(unsigned long, unsigned long, llvm::function_ref<void (unsigned long, unsigned long)>)
Line
Count
Source
382
425
                                  llvm::function_ref<void(size_t, size_t)> Fn) {
383
4.94k
  while (Begin < End) {
384
4.51k
    size_t Mid = findBoundary(Begin, End);
385
4.51k
    Fn(Begin, Mid);
386
4.51k
    Begin = Mid;
387
4.51k
  }
388
425
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::forEachClassRange(unsigned long, unsigned long, llvm::function_ref<void (unsigned long, unsigned long)>)
389
390
// Call Fn on each equivalence class.
391
template <class ELFT>
392
121
void ICF<ELFT>::forEachClass(llvm::function_ref<void(size_t, size_t)> Fn) {
393
121
  // If threading is disabled or the number of sections are
394
121
  // too small to use threading, call Fn sequentially.
395
121
  if (!ThreadsEnabled || Sections.size() < 1024) {
396
119
    forEachClassRange(0, Sections.size(), Fn);
397
119
    ++Cnt;
398
119
    return;
399
119
  }
400
2
401
2
  Current = Cnt % 2;
402
2
  Next = (Cnt + 1) % 2;
403
2
404
2
  // Shard into non-overlapping intervals, and call Fn in parallel.
405
2
  // The sharding must be completed before any calls to Fn are made
406
2
  // so that Fn can modify the Chunks in its shard without causing data
407
2
  // races.
408
2
  const size_t NumShards = 256;
409
2
  size_t Step = Sections.size() / NumShards;
410
2
  size_t Boundaries[NumShards + 1];
411
2
  Boundaries[0] = 0;
412
2
  Boundaries[NumShards] = Sections.size();
413
2
414
510
  parallelForEachN(1, NumShards, [&](size_t I) {
415
510
    Boundaries[I] = findBoundary((I - 1) * Step, Sections.size());
416
510
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda'(unsigned long)::operator()(unsigned long) const
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda'(unsigned long)::operator()(unsigned long) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda'(unsigned long)::operator()(unsigned long) const
Line
Count
Source
414
510
  parallelForEachN(1, NumShards, [&](size_t I) {
415
510
    Boundaries[I] = findBoundary((I - 1) * Step, Sections.size());
416
510
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda'(unsigned long)::operator()(unsigned long) const
417
2
418
510
  parallelForEachN(1, NumShards + 1, [&](size_t I) {
419
510
    if (Boundaries[I - 1] < Boundaries[I])
420
255
      forEachClassRange(Boundaries[I - 1], Boundaries[I], Fn);
421
510
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda0'(unsigned long)::operator()(unsigned long) const
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda0'(unsigned long)::operator()(unsigned long) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda0'(unsigned long)::operator()(unsigned long) const
Line
Count
Source
418
510
  parallelForEachN(1, NumShards + 1, [&](size_t I) {
419
510
    if (Boundaries[I - 1] < Boundaries[I])
420
255
      forEachClassRange(Boundaries[I - 1], Boundaries[I], Fn);
421
510
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)::'lambda0'(unsigned long)::operator()(unsigned long) const
422
2
  ++Cnt;
423
2
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)
Line
Count
Source
392
6
void ICF<ELFT>::forEachClass(llvm::function_ref<void(size_t, size_t)> Fn) {
393
6
  // If threading is disabled or the number of sections are
394
6
  // too small to use threading, call Fn sequentially.
395
6
  if (!ThreadsEnabled || Sections.size() < 1024) {
396
6
    forEachClassRange(0, Sections.size(), Fn);
397
6
    ++Cnt;
398
6
    return;
399
6
  }
400
0
401
0
  Current = Cnt % 2;
402
0
  Next = (Cnt + 1) % 2;
403
0
404
0
  // Shard into non-overlapping intervals, and call Fn in parallel.
405
0
  // The sharding must be completed before any calls to Fn are made
406
0
  // so that Fn can modify the Chunks in its shard without causing data
407
0
  // races.
408
0
  const size_t NumShards = 256;
409
0
  size_t Step = Sections.size() / NumShards;
410
0
  size_t Boundaries[NumShards + 1];
411
0
  Boundaries[0] = 0;
412
0
  Boundaries[NumShards] = Sections.size();
413
0
414
0
  parallelForEachN(1, NumShards, [&](size_t I) {
415
0
    Boundaries[I] = findBoundary((I - 1) * Step, Sections.size());
416
0
  });
417
0
418
0
  parallelForEachN(1, NumShards + 1, [&](size_t I) {
419
0
    if (Boundaries[I - 1] < Boundaries[I])
420
0
      forEachClassRange(Boundaries[I - 1], Boundaries[I], Fn);
421
0
  });
422
0
  ++Cnt;
423
0
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)
Line
Count
Source
392
115
void ICF<ELFT>::forEachClass(llvm::function_ref<void(size_t, size_t)> Fn) {
393
115
  // If threading is disabled or the number of sections are
394
115
  // too small to use threading, call Fn sequentially.
395
115
  if (!ThreadsEnabled || Sections.size() < 1024) {
396
113
    forEachClassRange(0, Sections.size(), Fn);
397
113
    ++Cnt;
398
113
    return;
399
113
  }
400
2
401
2
  Current = Cnt % 2;
402
2
  Next = (Cnt + 1) % 2;
403
2
404
2
  // Shard into non-overlapping intervals, and call Fn in parallel.
405
2
  // The sharding must be completed before any calls to Fn are made
406
2
  // so that Fn can modify the Chunks in its shard without causing data
407
2
  // races.
408
2
  const size_t NumShards = 256;
409
2
  size_t Step = Sections.size() / NumShards;
410
2
  size_t Boundaries[NumShards + 1];
411
2
  Boundaries[0] = 0;
412
2
  Boundaries[NumShards] = Sections.size();
413
2
414
2
  parallelForEachN(1, NumShards, [&](size_t I) {
415
2
    Boundaries[I] = findBoundary((I - 1) * Step, Sections.size());
416
2
  });
417
2
418
2
  parallelForEachN(1, NumShards + 1, [&](size_t I) {
419
2
    if (Boundaries[I - 1] < Boundaries[I])
420
2
      forEachClassRange(Boundaries[I - 1], Boundaries[I], Fn);
421
2
  });
422
2
  ++Cnt;
423
2
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::forEachClass(llvm::function_ref<void (unsigned long, unsigned long)>)
424
425
// Combine the hashes of the sections referenced by the given section into its
426
// hash.
427
template <class ELFT, class RelTy>
428
static void combineRelocHashes(unsigned Cnt, InputSection *IS,
429
4.58k
                               ArrayRef<RelTy> Rels) {
430
4.58k
  uint32_t Hash = IS->Class[Cnt % 2];
431
4.58k
  for (RelTy Rel : Rels) {
432
134
    Symbol &S = IS->template getFile<ELFT>()->getRelocTargetSym(Rel);
433
134
    if (auto *D = dyn_cast<Defined>(&S))
434
107
      if (auto *RelSec = dyn_cast_or_null<InputSection>(D->Section))
435
66
        Hash += RelSec->Class[Cnt % 2];
436
134
  }
437
4.58k
  // Set MSB to 1 to avoid collisions with non-hash IDs.
438
4.58k
  IS->Class[(Cnt + 1) % 2] = Hash | (1U << 31);
439
4.58k
}
Unexecuted instantiation: ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)1, false>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, true> >)
ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)1, false>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, false>, false> >)
Line
Count
Source
429
26
                               ArrayRef<RelTy> Rels) {
430
26
  uint32_t Hash = IS->Class[Cnt % 2];
431
26
  for (RelTy Rel : Rels) {
432
14
    Symbol &S = IS->template getFile<ELFT>()->getRelocTargetSym(Rel);
433
14
    if (auto *D = dyn_cast<Defined>(&S))
434
8
      if (auto *RelSec = dyn_cast_or_null<InputSection>(D->Section))
435
8
        Hash += RelSec->Class[Cnt % 2];
436
14
  }
437
26
  // Set MSB to 1 to avoid collisions with non-hash IDs.
438
26
  IS->Class[(Cnt + 1) % 2] = Hash | (1U << 31);
439
26
}
Unexecuted instantiation: ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)0, false>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, true> >)
Unexecuted instantiation: ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)0, false>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, false>, false> >)
ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)1, true>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, true> >)
Line
Count
Source
429
112
                               ArrayRef<RelTy> Rels) {
430
112
  uint32_t Hash = IS->Class[Cnt % 2];
431
120
  for (RelTy Rel : Rels) {
432
120
    Symbol &S = IS->template getFile<ELFT>()->getRelocTargetSym(Rel);
433
120
    if (auto *D = dyn_cast<Defined>(&S))
434
99
      if (auto *RelSec = dyn_cast_or_null<InputSection>(D->Section))
435
58
        Hash += RelSec->Class[Cnt % 2];
436
120
  }
437
112
  // Set MSB to 1 to avoid collisions with non-hash IDs.
438
112
  IS->Class[(Cnt + 1) % 2] = Hash | (1U << 31);
439
112
}
ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)1, true>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)1, true>, false> >)
Line
Count
Source
429
4.44k
                               ArrayRef<RelTy> Rels) {
430
4.44k
  uint32_t Hash = IS->Class[Cnt % 2];
431
4.44k
  for (RelTy Rel : Rels) {
432
0
    Symbol &S = IS->template getFile<ELFT>()->getRelocTargetSym(Rel);
433
0
    if (auto *D = dyn_cast<Defined>(&S))
434
0
      if (auto *RelSec = dyn_cast_or_null<InputSection>(D->Section))
435
0
        Hash += RelSec->Class[Cnt % 2];
436
0
  }
437
4.44k
  // Set MSB to 1 to avoid collisions with non-hash IDs.
438
4.44k
  IS->Class[(Cnt + 1) % 2] = Hash | (1U << 31);
439
4.44k
}
Unexecuted instantiation: ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)0, true>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, true> >)
Unexecuted instantiation: ICF.cpp:void combineRelocHashes<llvm::object::ELFType<(llvm::support::endianness)0, true>, llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >(unsigned int, lld::elf::InputSection*, llvm::ArrayRef<llvm::object::Elf_Rel_Impl<llvm::object::ELFType<(llvm::support::endianness)0, true>, false> >)
440
441
141
static void print(const Twine &S) {
442
141
  if (Config->PrintIcfSections)
443
98
    message(S);
444
141
}
445
446
// The main function of ICF.
447
60
template <class ELFT> void ICF<ELFT>::run() {
448
60
  // Collect sections to merge.
449
60
  for (InputSectionBase *Sec : InputSections)
450
2.46k
    if (auto *S = dyn_cast<InputSection>(Sec))
451
2.46k
      if (isEligible(S))
452
2.29k
        Sections.push_back(S);
453
60
454
60
  // Initially, we use hash values to partition sections.
455
2.29k
  parallelForEach(Sections, [&](InputSection *S) {
456
2.29k
    S->Class[0] = xxHash64(S->data());
457
2.29k
  });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
455
13
  parallelForEach(Sections, [&](InputSection *S) {
456
13
    S->Class[0] = xxHash64(S->data());
457
13
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
455
2.28k
  parallelForEach(Sections, [&](InputSection *S) {
456
2.28k
    S->Class[0] = xxHash64(S->data());
457
2.28k
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
458
60
459
180
  for (unsigned Cnt = 0; Cnt != 2; 
++Cnt120
) {
460
4.58k
    parallelForEach(Sections, [&](InputSection *S) {
461
4.58k
      if (S->AreRelocsRela)
462
112
        combineRelocHashes<ELFT>(Cnt, S, S->template relas<ELFT>());
463
4.47k
      else
464
4.47k
        combineRelocHashes<ELFT>(Cnt, S, S->template rels<ELFT>());
465
4.58k
    });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda0'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
460
26
    parallelForEach(Sections, [&](InputSection *S) {
461
26
      if (S->AreRelocsRela)
462
0
        combineRelocHashes<ELFT>(Cnt, S, S->template relas<ELFT>());
463
26
      else
464
26
        combineRelocHashes<ELFT>(Cnt, S, S->template rels<ELFT>());
465
26
    });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda0'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda0'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
Line
Count
Source
460
4.55k
    parallelForEach(Sections, [&](InputSection *S) {
461
4.55k
      if (S->AreRelocsRela)
462
112
        combineRelocHashes<ELFT>(Cnt, S, S->template relas<ELFT>());
463
4.44k
      else
464
4.44k
        combineRelocHashes<ELFT>(Cnt, S, S->template rels<ELFT>());
465
4.55k
    });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda0'(lld::elf::InputSection*)::operator()(lld::elf::InputSection*) const
466
120
  }
467
60
468
60
  // From now on, sections in Sections vector are ordered so that sections
469
60
  // in the same equivalence class are consecutive in the vector.
470
6.66k
  llvm::stable_sort(Sections, [](const InputSection *A, const InputSection *B) {
471
6.66k
    return A->Class[0] < B->Class[0];
472
6.66k
  });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda'(lld::elf::InputSection const*, lld::elf::InputSection const*)::operator()(lld::elf::InputSection const*, lld::elf::InputSection const*) const
Line
Count
Source
470
16
  llvm::stable_sort(Sections, [](const InputSection *A, const InputSection *B) {
471
16
    return A->Class[0] < B->Class[0];
472
16
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda'(lld::elf::InputSection const*, lld::elf::InputSection const*)::operator()(lld::elf::InputSection const*, lld::elf::InputSection const*) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda'(lld::elf::InputSection const*, lld::elf::InputSection const*)::operator()(lld::elf::InputSection const*, lld::elf::InputSection const*) const
Line
Count
Source
470
6.64k
  llvm::stable_sort(Sections, [](const InputSection *A, const InputSection *B) {
471
6.64k
    return A->Class[0] < B->Class[0];
472
6.64k
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda'(lld::elf::InputSection const*, lld::elf::InputSection const*)::operator()(lld::elf::InputSection const*, lld::elf::InputSection const*) const
473
60
474
60
  // Compare static contents and assign unique IDs for each static content.
475
153
  forEachClass([&](size_t Begin, size_t End) { segregate(Begin, End, true); });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
475
10
  forEachClass([&](size_t Begin, size_t End) { segregate(Begin, End, true); });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
475
143
  forEachClass([&](size_t Begin, size_t End) { segregate(Begin, End, true); });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
476
60
477
60
  // Split groups by comparing relocations until convergence is obtained.
478
61
  do {
479
61
    Repeat = false;
480
61
    forEachClass(
481
2.18k
        [&](size_t Begin, size_t End) { segregate(Begin, End, false); });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda0'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
481
10
        [&](size_t Begin, size_t End) { segregate(Begin, End, false); });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda0'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda0'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
481
2.17k
        [&](size_t Begin, size_t End) { segregate(Begin, End, false); });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda0'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
482
61
  } while (Repeat);
483
60
484
60
  log("ICF needed " + Twine(Cnt) + " iterations");
485
60
486
60
  // Merge sections by the equivalence class.
487
2.21k
  forEachClassRange(0, Sections.size(), [&](size_t Begin, size_t End) {
488
2.21k
    if (End - Begin == 1)
489
2.15k
      return;
490
60
    print("selected section " + toString(Sections[Begin]));
491
141
    for (size_t I = Begin + 1; I < End; 
++I81
) {
492
81
      print("  removing identical section " + toString(Sections[I]));
493
81
      Sections[Begin]->replace(Sections[I]);
494
81
495
81
      // At this point we know sections merged are fully identical and hence
496
81
      // we want to remove duplicate implicit dependencies such as link order
497
81
      // and relocation sections.
498
81
      for (InputSection *IS : Sections[I]->DependentSections)
499
4
        IS->Live = false;
500
81
    }
501
60
  });
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()::'lambda1'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
487
10
  forEachClassRange(0, Sections.size(), [&](size_t Begin, size_t End) {
488
10
    if (End - Begin == 1)
489
7
      return;
490
3
    print("selected section " + toString(Sections[Begin]));
491
6
    for (size_t I = Begin + 1; I < End; 
++I3
) {
492
3
      print("  removing identical section " + toString(Sections[I]));
493
3
      Sections[Begin]->replace(Sections[I]);
494
3
495
3
      // At this point we know sections merged are fully identical and hence
496
3
      // we want to remove duplicate implicit dependencies such as link order
497
3
      // and relocation sections.
498
3
      for (InputSection *IS : Sections[I]->DependentSections)
499
1
        IS->Live = false;
500
3
    }
501
3
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()::'lambda1'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()::'lambda1'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
Line
Count
Source
487
2.20k
  forEachClassRange(0, Sections.size(), [&](size_t Begin, size_t End) {
488
2.20k
    if (End - Begin == 1)
489
2.14k
      return;
490
57
    print("selected section " + toString(Sections[Begin]));
491
135
    for (size_t I = Begin + 1; I < End; 
++I78
) {
492
78
      print("  removing identical section " + toString(Sections[I]));
493
78
      Sections[Begin]->replace(Sections[I]);
494
78
495
78
      // At this point we know sections merged are fully identical and hence
496
78
      // we want to remove duplicate implicit dependencies such as link order
497
78
      // and relocation sections.
498
78
      for (InputSection *IS : Sections[I]->DependentSections)
499
3
        IS->Live = false;
500
78
    }
501
57
  });
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()::'lambda1'(unsigned long, unsigned long)::operator()(unsigned long, unsigned long) const
502
60
}
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, false> >::run()
Line
Count
Source
447
3
template <class ELFT> void ICF<ELFT>::run() {
448
3
  // Collect sections to merge.
449
3
  for (InputSectionBase *Sec : InputSections)
450
19
    if (auto *S = dyn_cast<InputSection>(Sec))
451
19
      if (isEligible(S))
452
13
        Sections.push_back(S);
453
3
454
3
  // Initially, we use hash values to partition sections.
455
3
  parallelForEach(Sections, [&](InputSection *S) {
456
3
    S->Class[0] = xxHash64(S->data());
457
3
  });
458
3
459
9
  for (unsigned Cnt = 0; Cnt != 2; 
++Cnt6
) {
460
6
    parallelForEach(Sections, [&](InputSection *S) {
461
6
      if (S->AreRelocsRela)
462
6
        combineRelocHashes<ELFT>(Cnt, S, S->template relas<ELFT>());
463
6
      else
464
6
        combineRelocHashes<ELFT>(Cnt, S, S->template rels<ELFT>());
465
6
    });
466
6
  }
467
3
468
3
  // From now on, sections in Sections vector are ordered so that sections
469
3
  // in the same equivalence class are consecutive in the vector.
470
3
  llvm::stable_sort(Sections, [](const InputSection *A, const InputSection *B) {
471
3
    return A->Class[0] < B->Class[0];
472
3
  });
473
3
474
3
  // Compare static contents and assign unique IDs for each static content.
475
3
  forEachClass([&](size_t Begin, size_t End) { segregate(Begin, End, true); });
476
3
477
3
  // Split groups by comparing relocations until convergence is obtained.
478
3
  do {
479
3
    Repeat = false;
480
3
    forEachClass(
481
3
        [&](size_t Begin, size_t End) { segregate(Begin, End, false); });
482
3
  } while (Repeat);
483
3
484
3
  log("ICF needed " + Twine(Cnt) + " iterations");
485
3
486
3
  // Merge sections by the equivalence class.
487
3
  forEachClassRange(0, Sections.size(), [&](size_t Begin, size_t End) {
488
3
    if (End - Begin == 1)
489
3
      return;
490
3
    print("selected section " + toString(Sections[Begin]));
491
3
    for (size_t I = Begin + 1; I < End; ++I) {
492
3
      print("  removing identical section " + toString(Sections[I]));
493
3
      Sections[Begin]->replace(Sections[I]);
494
3
495
3
      // At this point we know sections merged are fully identical and hence
496
3
      // we want to remove duplicate implicit dependencies such as link order
497
3
      // and relocation sections.
498
3
      for (InputSection *IS : Sections[I]->DependentSections)
499
3
        IS->Live = false;
500
3
    }
501
3
  });
502
3
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, false> >::run()
ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)1, true> >::run()
Line
Count
Source
447
57
template <class ELFT> void ICF<ELFT>::run() {
448
57
  // Collect sections to merge.
449
57
  for (InputSectionBase *Sec : InputSections)
450
2.44k
    if (auto *S = dyn_cast<InputSection>(Sec))
451
2.44k
      if (isEligible(S))
452
2.28k
        Sections.push_back(S);
453
57
454
57
  // Initially, we use hash values to partition sections.
455
57
  parallelForEach(Sections, [&](InputSection *S) {
456
57
    S->Class[0] = xxHash64(S->data());
457
57
  });
458
57
459
171
  for (unsigned Cnt = 0; Cnt != 2; 
++Cnt114
) {
460
114
    parallelForEach(Sections, [&](InputSection *S) {
461
114
      if (S->AreRelocsRela)
462
114
        combineRelocHashes<ELFT>(Cnt, S, S->template relas<ELFT>());
463
114
      else
464
114
        combineRelocHashes<ELFT>(Cnt, S, S->template rels<ELFT>());
465
114
    });
466
114
  }
467
57
468
57
  // From now on, sections in Sections vector are ordered so that sections
469
57
  // in the same equivalence class are consecutive in the vector.
470
57
  llvm::stable_sort(Sections, [](const InputSection *A, const InputSection *B) {
471
57
    return A->Class[0] < B->Class[0];
472
57
  });
473
57
474
57
  // Compare static contents and assign unique IDs for each static content.
475
57
  forEachClass([&](size_t Begin, size_t End) { segregate(Begin, End, true); });
476
57
477
57
  // Split groups by comparing relocations until convergence is obtained.
478
58
  do {
479
58
    Repeat = false;
480
58
    forEachClass(
481
58
        [&](size_t Begin, size_t End) { segregate(Begin, End, false); });
482
58
  } while (Repeat);
483
57
484
57
  log("ICF needed " + Twine(Cnt) + " iterations");
485
57
486
57
  // Merge sections by the equivalence class.
487
57
  forEachClassRange(0, Sections.size(), [&](size_t Begin, size_t End) {
488
57
    if (End - Begin == 1)
489
57
      return;
490
57
    print("selected section " + toString(Sections[Begin]));
491
57
    for (size_t I = Begin + 1; I < End; ++I) {
492
57
      print("  removing identical section " + toString(Sections[I]));
493
57
      Sections[Begin]->replace(Sections[I]);
494
57
495
57
      // At this point we know sections merged are fully identical and hence
496
57
      // we want to remove duplicate implicit dependencies such as link order
497
57
      // and relocation sections.
498
57
      for (InputSection *IS : Sections[I]->DependentSections)
499
57
        IS->Live = false;
500
57
    }
501
57
  });
502
57
}
Unexecuted instantiation: ICF.cpp:(anonymous namespace)::ICF<llvm::object::ELFType<(llvm::support::endianness)0, true> >::run()
503
504
// ICF entry point function.
505
60
template <class ELFT> void elf::doIcf() { ICF<ELFT>().run(); }
void lld::elf::doIcf<llvm::object::ELFType<(llvm::support::endianness)1, false> >()
Line
Count
Source
505
3
template <class ELFT> void elf::doIcf() { ICF<ELFT>().run(); }
Unexecuted instantiation: void lld::elf::doIcf<llvm::object::ELFType<(llvm::support::endianness)0, false> >()
void lld::elf::doIcf<llvm::object::ELFType<(llvm::support::endianness)1, true> >()
Line
Count
Source
505
57
template <class ELFT> void elf::doIcf() { ICF<ELFT>().run(); }
Unexecuted instantiation: void lld::elf::doIcf<llvm::object::ELFType<(llvm::support::endianness)0, true> >()
506
507
template void elf::doIcf<ELF32LE>();
508
template void elf::doIcf<ELF32BE>();
509
template void elf::doIcf<ELF64LE>();
510
template void elf::doIcf<ELF64BE>();