1 //===- SymbolSize.cpp -----------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Object/SymbolSize.h"
11 #include "llvm/ADT/STLExtras.h"
12 #include "llvm/Object/COFF.h"
13 #include "llvm/Object/ELFObjectFile.h"
14 #include "llvm/Object/MachO.h"
17 using namespace object;
28 static int compareAddress(const SymEntry *A, const SymEntry *B) {
29 if (A->SectionID != B->SectionID)
30 return A->SectionID - B->SectionID;
31 return A->Address - B->Address;
34 static int compareNumber(const SymEntry *A, const SymEntry *B) {
35 return A->Number - B->Number;
38 static unsigned getSectionID(const ObjectFile &O, SectionRef Sec) {
39 if (auto *M = dyn_cast<MachOObjectFile>(&O))
40 return M->getSectionID(Sec);
41 return cast<COFFObjectFile>(O).getSectionID(Sec);
44 static unsigned getSymbolSectionID(const ObjectFile &O, SymbolRef Sym) {
45 if (auto *M = dyn_cast<MachOObjectFile>(&O))
46 return M->getSymbolSectionID(Sym);
47 return cast<COFFObjectFile>(O).getSymbolSectionID(Sym);
50 std::vector<std::pair<SymbolRef, uint64_t>>
51 llvm::object::computeSymbolSizes(const ObjectFile &O) {
52 std::vector<std::pair<SymbolRef, uint64_t>> Ret;
54 if (const auto *E = dyn_cast<ELFObjectFileBase>(&O)) {
55 for (SymbolRef Sym : E->symbols())
56 Ret.push_back({Sym, E->getSymbolSize(Sym)});
60 // Collect sorted symbol addresses. Include dummy addresses for the end
62 std::vector<SymEntry> Addresses;
64 for (symbol_iterator I = O.symbol_begin(), E = O.symbol_end(); I != E; ++I) {
66 uint64_t Value = Sym.getValue();
67 Addresses.push_back({I, Value, SymNum, getSymbolSectionID(O, Sym)});
70 for (SectionRef Sec : O.sections()) {
71 uint64_t Address = Sec.getAddress();
72 uint64_t Size = Sec.getSize();
74 {O.symbol_end(), Address + Size, 0, getSectionID(O, Sec)});
76 array_pod_sort(Addresses.begin(), Addresses.end(), compareAddress);
78 // Compute the size as the gap to the next symbol
79 for (unsigned I = 0, N = Addresses.size() - 1; I < N; ++I) {
80 auto &P = Addresses[I];
81 if (P.I == O.symbol_end())
84 // If multiple symbol have the same address, give both the same size.
85 unsigned NextI = I + 1;
86 while (NextI < N && Addresses[NextI].Address == P.Address)
89 uint64_t Size = Addresses[NextI].Address - P.Address;
93 // Put back in the original order and copy the result
94 array_pod_sort(Addresses.begin(), Addresses.end(), compareNumber);
95 for (SymEntry &P : Addresses) {
96 if (P.I == O.symbol_end())
98 Ret.push_back({*P.I, P.Address});