1 //===- SymbolTable.cpp ----------------------------------------------------===//
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Symbol table is a bag of all known symbols. We put all symbols of
11 // all input files to the symbol table. The symbol table is basically
12 // a hash table with the logic to resolve symbol name conflicts using
15 //===----------------------------------------------------------------------===//
17 #include "SymbolTable.h"
20 #include "LinkerScript.h"
23 #include "llvm/ADT/STLExtras.h"
26 using namespace llvm::object;
27 using namespace llvm::ELF;
30 using namespace lld::elf;
32 // All input object files must be for the same architecture
33 // (e.g. it does not make sense to link x86 object files with
34 // MIPS object files.) This function checks for that error.
35 template <class ELFT> static bool isCompatible(InputFile *F) {
36 if (!isa<ELFFileBase<ELFT>>(F) && !isa<BitcodeFile>(F))
39 if (F->EKind == Config->EKind && F->EMachine == Config->EMachine) {
40 if (Config->EMachine != EM_MIPS)
42 if (isMipsN32Abi(F) == Config->MipsN32Abi)
46 if (!Config->Emulation.empty())
47 error(toString(F) + " is incompatible with " + Config->Emulation);
49 error(toString(F) + " is incompatible with " + toString(Config->FirstElf));
53 // Add symbols in File to the symbol table.
54 template <class ELFT> void SymbolTable<ELFT>::addFile(InputFile *File) {
55 if (!Config->FirstElf && isa<ELFFileBase<ELFT>>(File))
56 Config->FirstElf = File;
58 if (!isCompatible<ELFT>(File))
62 if (auto *F = dyn_cast<BinaryFile>(File)) {
63 BinaryFiles.push_back(F);
69 if (auto *F = dyn_cast<ArchiveFile>(File)) {
75 if (auto *F = dyn_cast<LazyObjectFile>(File)) {
81 message(toString(File));
84 if (auto *F = dyn_cast<SharedFile<ELFT>>(File)) {
85 // DSOs are uniquified not by filename but by soname.
87 if (ErrorCount || !SoNames.insert(F->SoName).second)
89 SharedFiles.push_back(F);
95 if (auto *F = dyn_cast<BitcodeFile>(File)) {
96 BitcodeFiles.push_back(F);
97 F->parse<ELFT>(ComdatGroups);
101 // Regular object file
102 auto *F = cast<ObjectFile<ELFT>>(File);
103 ObjectFiles.push_back(F);
104 F->parse(ComdatGroups);
107 // This function is where all the optimizations of link-time
108 // optimization happens. When LTO is in use, some input files are
109 // not in native object file format but in the LLVM bitcode format.
110 // This function compiles bitcode files into a few big native files
111 // using LLVM functions and replaces bitcode symbols with the results.
112 // Because all bitcode files that consist of a program are passed
113 // to the compiler at once, it can do whole-program optimization.
114 template <class ELFT> void SymbolTable<ELFT>::addCombinedLTOObject() {
115 if (BitcodeFiles.empty())
118 // Compile bitcode files and replace bitcode symbols.
119 LTO.reset(new BitcodeCompiler);
120 for (BitcodeFile *F : BitcodeFiles)
123 for (InputFile *File : LTO->compile()) {
124 ObjectFile<ELFT> *Obj = cast<ObjectFile<ELFT>>(File);
125 DenseSet<CachedHashStringRef> DummyGroups;
126 Obj->parse(DummyGroups);
127 ObjectFiles.push_back(Obj);
131 template <class ELFT>
132 DefinedRegular *SymbolTable<ELFT>::addAbsolute(StringRef Name,
136 addRegular(Name, Visibility, STT_NOTYPE, 0, 0, Binding, nullptr, nullptr);
137 return cast<DefinedRegular>(Sym->body());
140 // Add Name as an "ignored" symbol. An ignored symbol is a regular
141 // linker-synthesized defined symbol, but is only defined if needed.
142 template <class ELFT>
143 DefinedRegular *SymbolTable<ELFT>::addIgnored(StringRef Name,
144 uint8_t Visibility) {
145 SymbolBody *S = find(Name);
146 if (!S || S->isInCurrentDSO())
148 return addAbsolute(Name, Visibility);
151 // Set a flag for --trace-symbol so that we can print out a log message
152 // if a new symbol with the same name is inserted into the symbol table.
153 template <class ELFT> void SymbolTable<ELFT>::trace(StringRef Name) {
154 Symtab.insert({CachedHashStringRef(Name), {-1, true}});
157 // Rename SYM as __wrap_SYM. The original symbol is preserved as __real_SYM.
158 // Used to implement --wrap.
159 template <class ELFT> void SymbolTable<ELFT>::wrap(StringRef Name) {
160 SymbolBody *B = find(Name);
163 Symbol *Sym = B->symbol();
164 Symbol *Real = addUndefined(Saver.save("__real_" + Name));
165 Symbol *Wrap = addUndefined(Saver.save("__wrap_" + Name));
167 // We rename symbols by replacing the old symbol's SymbolBody with the new
168 // symbol's SymbolBody. This causes all SymbolBody pointers referring to the
169 // old symbol to instead refer to the new symbol.
170 memcpy(Real->Body.buffer, Sym->Body.buffer, sizeof(Sym->Body));
171 memcpy(Sym->Body.buffer, Wrap->Body.buffer, sizeof(Wrap->Body));
174 // Creates alias for symbol. Used to implement --defsym=ALIAS=SYM.
175 template <class ELFT>
176 void SymbolTable<ELFT>::alias(StringRef Alias, StringRef Name) {
177 SymbolBody *B = find(Name);
179 error("-defsym: undefined symbol: " + Name);
182 Symbol *Sym = B->symbol();
183 Symbol *AliasSym = addUndefined(Alias);
184 memcpy(AliasSym->Body.buffer, Sym->Body.buffer, sizeof(AliasSym->Body));
187 static uint8_t getMinVisibility(uint8_t VA, uint8_t VB) {
188 if (VA == STV_DEFAULT)
190 if (VB == STV_DEFAULT)
192 return std::min(VA, VB);
195 // Find an existing symbol or create and insert a new one.
196 template <class ELFT>
197 std::pair<Symbol *, bool> SymbolTable<ELFT>::insert(StringRef Name) {
198 auto P = Symtab.insert(
199 {CachedHashStringRef(Name), SymIndex((int)SymVector.size(), false)});
200 SymIndex &V = P.first->second;
201 bool IsNew = P.second;
205 V = SymIndex((int)SymVector.size(), true);
210 Sym = make<Symbol>();
211 Sym->InVersionScript = false;
212 Sym->Binding = STB_WEAK;
213 Sym->Visibility = STV_DEFAULT;
214 Sym->IsUsedInRegularObj = false;
215 Sym->ExportDynamic = false;
216 Sym->Traced = V.Traced;
217 Sym->VersionId = Config->DefaultSymbolVersion;
218 SymVector.push_back(Sym);
220 Sym = SymVector[V.Idx];
225 // Find an existing symbol or create and insert a new one, then apply the given
227 template <class ELFT>
228 std::pair<Symbol *, bool>
229 SymbolTable<ELFT>::insert(StringRef Name, uint8_t Type, uint8_t Visibility,
230 bool CanOmitFromDynSym, InputFile *File) {
231 bool IsUsedInRegularObj = !File || File->kind() == InputFile::ObjectKind;
234 std::tie(S, WasInserted) = insert(Name);
236 // Merge in the new symbol's visibility.
237 S->Visibility = getMinVisibility(S->Visibility, Visibility);
239 if (!CanOmitFromDynSym && (Config->Shared || Config->ExportDynamic))
240 S->ExportDynamic = true;
242 if (IsUsedInRegularObj)
243 S->IsUsedInRegularObj = true;
245 if (!WasInserted && S->body()->Type != SymbolBody::UnknownType &&
246 ((Type == STT_TLS) != S->body()->isTls())) {
247 error("TLS attribute mismatch: " + toString(*S->body()) +
248 "\n>>> defined in " + toString(S->body()->File) +
249 "\n>>> defined in " + toString(File));
252 return {S, WasInserted};
255 template <class ELFT> Symbol *SymbolTable<ELFT>::addUndefined(StringRef Name) {
256 return addUndefined(Name, /*IsLocal=*/false, STB_GLOBAL, STV_DEFAULT,
258 /*CanOmitFromDynSym*/ false, /*File*/ nullptr);
261 static uint8_t getVisibility(uint8_t StOther) { return StOther & 3; }
263 template <class ELFT>
264 Symbol *SymbolTable<ELFT>::addUndefined(StringRef Name, bool IsLocal,
265 uint8_t Binding, uint8_t StOther,
266 uint8_t Type, bool CanOmitFromDynSym,
270 uint8_t Visibility = getVisibility(StOther);
271 std::tie(S, WasInserted) =
272 insert(Name, Type, Visibility, CanOmitFromDynSym, File);
273 // An undefined symbol with non default visibility must be satisfied
276 (isa<SharedSymbol>(S->body()) && Visibility != STV_DEFAULT)) {
277 S->Binding = Binding;
278 replaceBody<Undefined>(S, Name, IsLocal, StOther, Type, File);
281 if (Binding != STB_WEAK) {
282 SymbolBody *B = S->body();
283 if (B->isShared() || B->isLazy() || B->isUndefined())
284 S->Binding = Binding;
285 if (auto *SS = dyn_cast<SharedSymbol>(B))
286 cast<SharedFile<ELFT>>(SS->File)->IsUsed = true;
288 if (auto *L = dyn_cast<Lazy>(S->body())) {
289 // An undefined weak will not fetch archive members, but we have to remember
290 // its type. See also comment in addLazyArchive.
293 else if (InputFile *F = L->fetch())
299 // We have a new defined symbol with the specified binding. Return 1 if the new
300 // symbol should win, -1 if the new symbol should lose, or 0 if both symbols are
301 // strong defined symbols.
302 static int compareDefined(Symbol *S, bool WasInserted, uint8_t Binding) {
305 SymbolBody *Body = S->body();
306 if (Body->isLazy() || !Body->isInCurrentDSO())
308 if (Binding == STB_WEAK)
315 // We have a new non-common defined symbol with the specified binding. Return 1
316 // if the new symbol should win, -1 if the new symbol should lose, or 0 if there
317 // is a conflict. If the new symbol wins, also update the binding.
318 template <typename ELFT>
319 static int compareDefinedNonCommon(Symbol *S, bool WasInserted, uint8_t Binding,
320 bool IsAbsolute, typename ELFT::uint Value) {
321 if (int Cmp = compareDefined(S, WasInserted, Binding)) {
323 S->Binding = Binding;
326 SymbolBody *B = S->body();
327 if (isa<DefinedCommon>(B)) {
328 // Non-common symbols take precedence over common symbols.
329 if (Config->WarnCommon)
330 warn("common " + S->body()->getName() + " is overridden");
332 } else if (auto *R = dyn_cast<DefinedRegular>(B)) {
333 if (R->Section == nullptr && Binding == STB_GLOBAL && IsAbsolute &&
340 template <class ELFT>
341 Symbol *SymbolTable<ELFT>::addCommon(StringRef N, uint64_t Size,
342 uint32_t Alignment, uint8_t Binding,
343 uint8_t StOther, uint8_t Type,
347 std::tie(S, WasInserted) = insert(N, Type, getVisibility(StOther),
348 /*CanOmitFromDynSym*/ false, File);
349 int Cmp = compareDefined(S, WasInserted, Binding);
351 S->Binding = Binding;
352 replaceBody<DefinedCommon>(S, N, Size, Alignment, StOther, Type, File);
353 } else if (Cmp == 0) {
354 auto *C = dyn_cast<DefinedCommon>(S->body());
356 // Non-common symbols take precedence over common symbols.
357 if (Config->WarnCommon)
358 warn("common " + S->body()->getName() + " is overridden");
362 if (Config->WarnCommon)
363 warn("multiple common of " + S->body()->getName());
365 Alignment = C->Alignment = std::max(C->Alignment, Alignment);
367 replaceBody<DefinedCommon>(S, N, Size, Alignment, StOther, Type, File);
372 static void warnOrError(const Twine &Msg) {
373 if (Config->AllowMultipleDefinition)
379 static void reportDuplicate(SymbolBody *Sym, InputFile *NewFile) {
380 warnOrError("duplicate symbol: " + toString(*Sym) +
381 "\n>>> defined in " + toString(Sym->File) +
382 "\n>>> defined in " + toString(NewFile));
385 template <class ELFT>
386 static void reportDuplicate(SymbolBody *Sym, InputSectionBase *ErrSec,
387 typename ELFT::uint ErrOffset) {
388 DefinedRegular *D = dyn_cast<DefinedRegular>(Sym);
389 if (!D || !D->Section || !ErrSec) {
390 reportDuplicate(Sym, ErrSec ? ErrSec->getFile<ELFT>() : nullptr);
394 // Construct and print an error message in the form of:
396 // ld.lld: error: duplicate symbol: foo
397 // >>> defined at bar.c:30
398 // >>> bar.o (/home/alice/src/bar.o)
399 // >>> defined at baz.c:563
400 // >>> baz.o in archive libbaz.a
401 auto *Sec1 = cast<InputSectionBase>(D->Section);
402 std::string Src1 = Sec1->getSrcMsg<ELFT>(D->Value);
403 std::string Obj1 = Sec1->getObjMsg<ELFT>(D->Value);
404 std::string Src2 = ErrSec->getSrcMsg<ELFT>(ErrOffset);
405 std::string Obj2 = ErrSec->getObjMsg<ELFT>(ErrOffset);
407 std::string Msg = "duplicate symbol: " + toString(*Sym) + "\n>>> defined at ";
409 Msg += Src1 + "\n>>> ";
410 Msg += Obj1 + "\n>>> defined at ";
412 Msg += Src2 + "\n>>> ";
417 template <typename ELFT>
418 Symbol *SymbolTable<ELFT>::addRegular(StringRef Name, uint8_t StOther,
419 uint8_t Type, uint64_t Value,
420 uint64_t Size, uint8_t Binding,
421 SectionBase *Section, InputFile *File) {
424 std::tie(S, WasInserted) = insert(Name, Type, getVisibility(StOther),
425 /*CanOmitFromDynSym*/ false, File);
426 int Cmp = compareDefinedNonCommon<ELFT>(S, WasInserted, Binding,
427 Section == nullptr, Value);
429 replaceBody<DefinedRegular>(S, Name, /*IsLocal=*/false, StOther, Type,
430 Value, Size, Section, File);
432 reportDuplicate<ELFT>(S->body(),
433 dyn_cast_or_null<InputSectionBase>(Section), Value);
437 template <typename ELFT>
438 void SymbolTable<ELFT>::addShared(SharedFile<ELFT> *File, StringRef Name,
440 const typename ELFT::Verdef *Verdef) {
441 // DSO symbols do not affect visibility in the output, so we pass STV_DEFAULT
442 // as the visibility, which will leave the visibility in the symbol table
446 std::tie(S, WasInserted) = insert(Name, Sym.getType(), STV_DEFAULT,
447 /*CanOmitFromDynSym*/ true, File);
448 // Make sure we preempt DSO symbols with default visibility.
449 if (Sym.getVisibility() == STV_DEFAULT)
450 S->ExportDynamic = true;
452 SymbolBody *Body = S->body();
453 // An undefined symbol with non default visibility must be satisfied
456 (isa<Undefined>(Body) && Body->getVisibility() == STV_DEFAULT)) {
457 replaceBody<SharedSymbol>(S, File, Name, Sym.st_other, Sym.getType(), &Sym,
464 template <class ELFT>
465 Symbol *SymbolTable<ELFT>::addBitcode(StringRef Name, uint8_t Binding,
466 uint8_t StOther, uint8_t Type,
467 bool CanOmitFromDynSym, BitcodeFile *F) {
470 std::tie(S, WasInserted) =
471 insert(Name, Type, getVisibility(StOther), CanOmitFromDynSym, F);
472 int Cmp = compareDefinedNonCommon<ELFT>(S, WasInserted, Binding,
473 /*IsAbs*/ false, /*Value*/ 0);
475 replaceBody<DefinedRegular>(S, Name, /*IsLocal=*/false, StOther, Type, 0, 0,
478 reportDuplicate(S->body(), F);
482 template <class ELFT> SymbolBody *SymbolTable<ELFT>::find(StringRef Name) {
483 auto It = Symtab.find(CachedHashStringRef(Name));
484 if (It == Symtab.end())
486 SymIndex V = It->second;
489 return SymVector[V.Idx]->body();
492 template <class ELFT>
493 SymbolBody *SymbolTable<ELFT>::findInCurrentDSO(StringRef Name) {
494 if (SymbolBody *S = find(Name))
495 if (S->isInCurrentDSO())
500 template <class ELFT>
501 void SymbolTable<ELFT>::addLazyArchive(ArchiveFile *F,
502 const object::Archive::Symbol Sym) {
505 StringRef Name = Sym.getName();
506 std::tie(S, WasInserted) = insert(Name);
508 replaceBody<LazyArchive>(S, *F, Sym, SymbolBody::UnknownType);
511 if (!S->body()->isUndefined())
514 // Weak undefined symbols should not fetch members from archives. If we were
515 // to keep old symbol we would not know that an archive member was available
516 // if a strong undefined symbol shows up afterwards in the link. If a strong
517 // undefined symbol never shows up, this lazy symbol will get to the end of
518 // the link and must be treated as the weak undefined one. We already marked
519 // this symbol as used when we added it to the symbol table, but we also need
520 // to preserve its type. FIXME: Move the Type field to Symbol.
522 replaceBody<LazyArchive>(S, *F, Sym, S->body()->Type);
525 std::pair<MemoryBufferRef, uint64_t> MBInfo = F->getMember(&Sym);
526 if (!MBInfo.first.getBuffer().empty())
527 addFile(createObjectFile(MBInfo.first, F->getName(), MBInfo.second));
530 template <class ELFT>
531 void SymbolTable<ELFT>::addLazyObject(StringRef Name, LazyObjectFile &Obj) {
534 std::tie(S, WasInserted) = insert(Name);
536 replaceBody<LazyObject>(S, Name, Obj, SymbolBody::UnknownType);
539 if (!S->body()->isUndefined())
542 // See comment for addLazyArchive above.
544 replaceBody<LazyObject>(S, Name, Obj, S->body()->Type);
545 else if (InputFile *F = Obj.fetch())
549 // Process undefined (-u) flags by loading lazy symbols named by those flags.
550 template <class ELFT> void SymbolTable<ELFT>::scanUndefinedFlags() {
551 for (StringRef S : Config->Undefined)
552 if (auto *L = dyn_cast_or_null<Lazy>(find(S)))
553 if (InputFile *File = L->fetch())
557 // This function takes care of the case in which shared libraries depend on
558 // the user program (not the other way, which is usual). Shared libraries
559 // may have undefined symbols, expecting that the user program provides
560 // the definitions for them. An example is BSD's __progname symbol.
561 // We need to put such symbols to the main program's .dynsym so that
562 // shared libraries can find them.
563 // Except this, we ignore undefined symbols in DSOs.
564 template <class ELFT> void SymbolTable<ELFT>::scanShlibUndefined() {
565 for (SharedFile<ELFT> *File : SharedFiles) {
566 for (StringRef U : File->getUndefinedSymbols()) {
567 SymbolBody *Sym = find(U);
568 if (!Sym || !Sym->isDefined())
570 Sym->symbol()->ExportDynamic = true;
572 // If -dynamic-list is given, the default version is set to
573 // VER_NDX_LOCAL, which prevents a symbol to be exported via .dynsym.
574 // Set to VER_NDX_GLOBAL so the symbol will be handled as if it were
575 // specified by -dynamic-list.
576 Sym->symbol()->VersionId = VER_NDX_GLOBAL;
581 // Initialize DemangledSyms with a map from demangled symbols to symbol
582 // objects. Used to handle "extern C++" directive in version scripts.
584 // The map will contain all demangled symbols. That can be very large,
585 // and in LLD we generally want to avoid do anything for each symbol.
586 // Then, why are we doing this? Here's why.
588 // Users can use "extern C++ {}" directive to match against demangled
589 // C++ symbols. For example, you can write a pattern such as
590 // "llvm::*::foo(int, ?)". Obviously, there's no way to handle this
591 // other than trying to match a pattern against all demangled symbols.
592 // So, if "extern C++" feature is used, we need to demangle all known
594 template <class ELFT>
595 StringMap<std::vector<SymbolBody *>> &SymbolTable<ELFT>::getDemangledSyms() {
596 if (!DemangledSyms) {
597 DemangledSyms.emplace();
598 for (Symbol *Sym : SymVector) {
599 SymbolBody *B = Sym->body();
600 if (B->isUndefined())
602 if (Optional<std::string> S = demangle(B->getName()))
603 (*DemangledSyms)[*S].push_back(B);
605 (*DemangledSyms)[B->getName()].push_back(B);
608 return *DemangledSyms;
611 template <class ELFT>
612 std::vector<SymbolBody *> SymbolTable<ELFT>::findByVersion(SymbolVersion Ver) {
614 return getDemangledSyms().lookup(Ver.Name);
615 if (SymbolBody *B = find(Ver.Name))
616 if (!B->isUndefined())
621 template <class ELFT>
622 std::vector<SymbolBody *>
623 SymbolTable<ELFT>::findAllByVersion(SymbolVersion Ver) {
624 std::vector<SymbolBody *> Res;
625 StringMatcher M(Ver.Name);
627 if (Ver.IsExternCpp) {
628 for (auto &P : getDemangledSyms())
629 if (M.match(P.first()))
630 Res.insert(Res.end(), P.second.begin(), P.second.end());
634 for (Symbol *Sym : SymVector) {
635 SymbolBody *B = Sym->body();
636 if (!B->isUndefined() && M.match(B->getName()))
642 // If there's only one anonymous version definition in a version
643 // script file, the script does not actually define any symbol version,
644 // but just specifies symbols visibilities.
645 template <class ELFT> void SymbolTable<ELFT>::handleAnonymousVersion() {
646 for (SymbolVersion &Ver : Config->VersionScriptGlobals)
647 assignExactVersion(Ver, VER_NDX_GLOBAL, "global");
648 for (SymbolVersion &Ver : Config->VersionScriptGlobals)
649 assignWildcardVersion(Ver, VER_NDX_GLOBAL);
650 for (SymbolVersion &Ver : Config->VersionScriptLocals)
651 assignExactVersion(Ver, VER_NDX_LOCAL, "local");
652 for (SymbolVersion &Ver : Config->VersionScriptLocals)
653 assignWildcardVersion(Ver, VER_NDX_LOCAL);
656 // Set symbol versions to symbols. This function handles patterns
657 // containing no wildcard characters.
658 template <class ELFT>
659 void SymbolTable<ELFT>::assignExactVersion(SymbolVersion Ver, uint16_t VersionId,
660 StringRef VersionName) {
664 // Get a list of symbols which we need to assign the version to.
665 std::vector<SymbolBody *> Syms = findByVersion(Ver);
667 if (Config->NoUndefinedVersion)
668 error("version script assignment of '" + VersionName + "' to symbol '" +
669 Ver.Name + "' failed: symbol not defined");
673 // Assign the version.
674 for (SymbolBody *B : Syms) {
675 Symbol *Sym = B->symbol();
676 if (Sym->InVersionScript)
677 warn("duplicate symbol '" + Ver.Name + "' in version script");
678 Sym->VersionId = VersionId;
679 Sym->InVersionScript = true;
683 template <class ELFT>
684 void SymbolTable<ELFT>::assignWildcardVersion(SymbolVersion Ver,
685 uint16_t VersionId) {
686 if (!Ver.HasWildcard)
688 std::vector<SymbolBody *> Syms = findAllByVersion(Ver);
690 // Exact matching takes precendence over fuzzy matching,
691 // so we set a version to a symbol only if no version has been assigned
692 // to the symbol. This behavior is compatible with GNU.
693 for (SymbolBody *B : Syms)
694 if (B->symbol()->VersionId == Config->DefaultSymbolVersion)
695 B->symbol()->VersionId = VersionId;
698 // This function processes version scripts by updating VersionId
699 // member of symbols.
700 template <class ELFT> void SymbolTable<ELFT>::scanVersionScript() {
701 // Symbol themselves might know their versions because symbols
702 // can contain versions in the form of <name>@<version>.
703 // Let them parse their names.
704 if (!Config->VersionDefinitions.empty())
705 for (Symbol *Sym : SymVector)
706 Sym->body()->parseSymbolVersion();
708 // Handle edge cases first.
709 handleAnonymousVersion();
711 if (Config->VersionDefinitions.empty())
714 // Now we have version definitions, so we need to set version ids to symbols.
715 // Each version definition has a glob pattern, and all symbols that match
716 // with the pattern get that version.
718 // First, we assign versions to exact matching symbols,
719 // i.e. version definitions not containing any glob meta-characters.
720 for (VersionDefinition &V : Config->VersionDefinitions)
721 for (SymbolVersion &Ver : V.Globals)
722 assignExactVersion(Ver, V.Id, V.Name);
724 // Next, we assign versions to fuzzy matching symbols,
725 // i.e. version definitions containing glob meta-characters.
726 // Note that because the last match takes precedence over previous matches,
727 // we iterate over the definitions in the reverse order.
728 for (VersionDefinition &V : llvm::reverse(Config->VersionDefinitions))
729 for (SymbolVersion &Ver : V.Globals)
730 assignWildcardVersion(Ver, V.Id);
733 template class elf::SymbolTable<ELF32LE>;
734 template class elf::SymbolTable<ELF32BE>;
735 template class elf::SymbolTable<ELF64LE>;
736 template class elf::SymbolTable<ELF64BE>;