1 /* -*- mode: C++; c-basic-offset: 4; tab-width: 4 -*-*
3 * Copyright (c) 2009 Apple Inc. All rights reserved.
5 * @APPLE_LICENSE_HEADER_START@
7 * This file contains Original Code and/or Modifications of Original Code
8 * as defined in and that are subject to the Apple Public Source License
9 * Version 2.0 (the 'License'). You may not use this file except in
10 * compliance with the License. Please obtain a copy of the License at
11 * http://www.opensource.apple.com/apsl/ and read it before using this
14 * The Original Code and all software distributed under the License are
15 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
19 * Please see the License for the specific language governing rights and
20 * limitations under the License.
22 * @APPLE_LICENSE_HEADER_END@
25 #ifndef __SYMBOL_TABLE_H__
26 #define __SYMBOL_TABLE_H__
29 #include <sys/types.h>
32 #include <sys/sysctl.h>
37 #include <mach/mach_time.h>
38 #include <mach/vm_statistics.h>
39 #include <mach/mach_init.h>
40 #include <mach/mach_host.h>
42 #include <mach-o/dyld.h>
45 #include <unordered_map>
54 class SymbolTable
: public ld::IndirectBindingTable
57 typedef uint32_t IndirectBindingSlot
;
60 typedef std::unordered_map
<const char*, IndirectBindingSlot
, CStringHash
, CStringEquals
> NameToSlot
;
64 size_t operator()(const ld::Atom
*) const;
65 bool operator()(const ld::Atom
* left
, const ld::Atom
* right
) const;
67 typedef std::unordered_map
<const ld::Atom
*, IndirectBindingSlot
, ContentFuncs
, ContentFuncs
> ContentToSlot
;
69 class ReferencesHashFuncs
{
71 size_t operator()(const ld::Atom
*) const;
72 bool operator()(const ld::Atom
* left
, const ld::Atom
* right
) const;
74 typedef std::unordered_map
<const ld::Atom
*, IndirectBindingSlot
, ReferencesHashFuncs
, ReferencesHashFuncs
> ReferencesToSlot
;
76 class CStringHashFuncs
{
78 size_t operator()(const ld::Atom
*) const;
79 bool operator()(const ld::Atom
* left
, const ld::Atom
* right
) const;
81 typedef std::unordered_map
<const ld::Atom
*, IndirectBindingSlot
, CStringHashFuncs
, CStringHashFuncs
> CStringToSlot
;
83 class UTF16StringHashFuncs
{
85 size_t operator()(const ld::Atom
*) const;
86 bool operator()(const ld::Atom
* left
, const ld::Atom
* right
) const;
88 typedef std::unordered_map
<const ld::Atom
*, IndirectBindingSlot
, UTF16StringHashFuncs
, UTF16StringHashFuncs
> UTF16StringToSlot
;
90 typedef std::map
<IndirectBindingSlot
, const char*> SlotToName
;
91 typedef std::unordered_map
<const char*, CStringToSlot
*, CStringHash
, CStringEquals
> NameToMap
;
93 typedef std::vector
<const ld::Atom
*> DuplicatedSymbolAtomList
;
94 typedef std::map
<const char *, DuplicatedSymbolAtomList
* > DuplicateSymbols
;
98 class byNameIterator
{
100 byNameIterator
& operator++(int) { ++_nameTableIterator
; return *this; }
101 const ld::Atom
* operator*() { return _slotTable
[_nameTableIterator
->second
]; }
102 bool operator!=(const byNameIterator
& lhs
) { return _nameTableIterator
!= lhs
._nameTableIterator
; }
105 friend class SymbolTable
;
106 byNameIterator(NameToSlot::iterator it
, std::vector
<const ld::Atom
*>& indirectTable
)
107 : _nameTableIterator(it
), _slotTable(indirectTable
) {}
109 NameToSlot::iterator _nameTableIterator
;
110 std::vector
<const ld::Atom
*>& _slotTable
;
113 SymbolTable(const Options
& opts
, std::vector
<const ld::Atom
*>& ibt
);
115 bool add(const ld::Atom
& atom
, bool ignoreDuplicates
);
116 IndirectBindingSlot
findSlotForName(const char* name
);
117 IndirectBindingSlot
findSlotForContent(const ld::Atom
* atom
, const ld::Atom
** existingAtom
);
118 IndirectBindingSlot
findSlotForReferences(const ld::Atom
* atom
, const ld::Atom
** existingAtom
);
119 const ld::Atom
* atomForSlot(IndirectBindingSlot s
) { return _indirectBindingTable
[s
]; }
120 unsigned int updateCount() { return _indirectBindingTable
.size(); }
121 void undefines(std::vector
<const char*>& undefines
);
122 void tentativeDefs(std::vector
<const char*>& undefines
);
123 void removeDeadAtoms();
124 bool hasName(const char* name
);
125 bool hasExternalTentativeDefinitions() { return _hasExternalTentativeDefinitions
; }
126 byNameIterator
begin() { return byNameIterator(_byNameTable
.begin(),_indirectBindingTable
); }
127 byNameIterator
end() { return byNameIterator(_byNameTable
.end(),_indirectBindingTable
); }
128 void printStatistics();
130 // from ld::IndirectBindingTable
131 virtual const char* indirectName(IndirectBindingSlot slot
) const;
132 virtual const ld::Atom
* indirectAtom(IndirectBindingSlot slot
) const;
134 // Prints the duplicated symbols to stderr and throws. Only valid to call if hasDuplicateSymbols() returns true.
135 void checkDuplicateSymbols() const;
139 bool addByName(const ld::Atom
& atom
, bool ignoreDuplicates
);
140 bool addByContent(const ld::Atom
& atom
);
141 bool addByReferences(const ld::Atom
& atom
);
142 void markCoalescedAway(const ld::Atom
* atom
);
144 // Tracks duplicated symbols. Each call adds file to the list of files defining symbol.
145 // The file list is uniqued per symbol, so calling multiple times for the same symbol/file pair is permitted.
146 void addDuplicateSymbol(const char *symbol
, const ld::Atom
* atom
);
148 const Options
& _options
;
149 NameToSlot _byNameTable
;
150 SlotToName _byNameReverseTable
;
151 ContentToSlot _literal4Table
;
152 ContentToSlot _literal8Table
;
153 ContentToSlot _literal16Table
;
154 UTF16StringToSlot _utf16Table
;
155 CStringToSlot _cstringTable
;
156 NameToMap _nonStdCStringSectionToMap
;
157 ReferencesToSlot _nonLazyPointerTable
;
158 ReferencesToSlot _cfStringTable
;
159 ReferencesToSlot _objc2ClassRefTable
;
160 ReferencesToSlot _pointerToCStringTable
;
161 std::vector
<const ld::Atom
*>& _indirectBindingTable
;
162 bool _hasExternalTentativeDefinitions
;
164 DuplicateSymbols _duplicateSymbols
;
172 #endif // __SYMBOL_TABLE_H__