forked from nodejs/node
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhash.cpp
More file actions
375 lines (297 loc) · 9.06 KB
/
Copy pathhash.cpp
File metadata and controls
375 lines (297 loc) · 9.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
/* Copyright 2017 - 2025 R. Thomas
* Copyright 2017 - 2025 Quarkslab
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "LIEF/MachO/hash.hpp"
#include "LIEF/MachO.hpp"
#include "Object.tcc"
namespace LIEF {
namespace MachO {
Hash::~Hash() = default;
size_t Hash::hash(const Object& obj) {
return LIEF::Hash::hash<LIEF::MachO::Hash>(obj);
}
void Hash::visit(const Binary& binary) {
process(binary.header());
process(std::begin(binary.commands()), std::end(binary.commands()));
process(std::begin(binary.symbols()), std::end(binary.symbols()));
}
void Hash::visit(const Header& header) {
process(header.magic());
process(header.cpu_type());
process(header.cpu_subtype());
process(header.file_type());
process(header.nb_cmds());
process(header.sizeof_cmds());
process(header.flags());
process(header.reserved());
}
void Hash::visit(const LoadCommand& cmd) {
process(cmd.command());
process(cmd.size());
process(cmd.data());
process(cmd.command_offset());
}
void Hash::visit(const UUIDCommand& uuid) {
visit(*uuid.as<LoadCommand>());
process(uuid.uuid());
}
void Hash::visit(const SymbolCommand& symbol) {
visit(*symbol.as<LoadCommand>());
process(symbol.symbol_offset());
process(symbol.numberof_symbols());
process(symbol.strings_offset());
process(symbol.strings_size());
}
void Hash::visit(const SegmentCommand& segment) {
visit(*segment.as<LoadCommand>());
process(segment.name());
process(segment.virtual_address());
process(segment.virtual_size());
process(segment.file_size());
process(segment.file_offset());
process(segment.max_protection());
process(segment.init_protection());
process(segment.numberof_sections());
process(segment.flags());
process(segment.content());
process(std::begin(segment.sections()), std::end(segment.sections()));
}
void Hash::visit(const Section& section) {
process(section.content());
process(section.segment_name());
process(section.address());
process(section.alignment());
process(section.relocation_offset());
process(section.numberof_relocations());
process(section.flags());
process(section.type());
process(section.reserved1());
process(section.reserved2());
process(section.reserved3());
process(section.raw_flags());
process(std::begin(section.relocations()), std::end(section.relocations()));
}
void Hash::visit(const MainCommand& maincmd) {
visit(*maincmd.as<LoadCommand>());
process(maincmd.entrypoint());
process(maincmd.stack_size());
}
void Hash::visit(const NoteCommand& note) {
visit(*note.as<LoadCommand>());
}
void Hash::visit(const DynamicSymbolCommand& dynamic_symbol) {
visit(*dynamic_symbol.as<LoadCommand>());
process(dynamic_symbol.idx_local_symbol());
process(dynamic_symbol.nb_local_symbols());
process(dynamic_symbol.idx_external_define_symbol());
process(dynamic_symbol.nb_external_define_symbols());
process(dynamic_symbol.idx_undefined_symbol());
process(dynamic_symbol.nb_undefined_symbols());
process(dynamic_symbol.toc_offset());
process(dynamic_symbol.nb_toc());
process(dynamic_symbol.module_table_offset());
process(dynamic_symbol.nb_module_table());
process(dynamic_symbol.external_reference_symbol_offset());
process(dynamic_symbol.nb_external_reference_symbols());
process(dynamic_symbol.indirect_symbol_offset());
process(dynamic_symbol.nb_indirect_symbols());
process(dynamic_symbol.external_relocation_offset());
process(dynamic_symbol.nb_external_relocations());
process(dynamic_symbol.local_relocation_offset());
process(dynamic_symbol.nb_local_relocations());
}
void Hash::visit(const DylinkerCommand& dylinker) {
visit(*dylinker.as<LoadCommand>());
process(dylinker.name());
}
void Hash::visit(const DylibCommand& dylib) {
visit(*dylib.as<LoadCommand>());
process(dylib.name());
process(dylib.timestamp());
process(dylib.current_version());
process(dylib.compatibility_version());
}
void Hash::visit(const ThreadCommand& threadcmd) {
visit(*threadcmd.as<LoadCommand>());
process(threadcmd.flavor());
process(threadcmd.count());
process(threadcmd.state());
}
void Hash::visit(const RPathCommand& rpath) {
visit(*rpath.as<LoadCommand>());
process(rpath.path());
}
void Hash::visit(const Routine& routine) {
visit(*routine.as<LoadCommand>());
}
void Hash::visit(const Symbol& symbol) {
process(symbol.name());
process(symbol.value());
process(symbol.size());
process(symbol.type());
process(symbol.numberof_sections());
process(symbol.description());
//if (symbol.has_binding_info()) {
// process(symbol.binding_info());
//}
//if (symbol.has_export_info()) {
// process(symbol.export_info());
//}
}
void Hash::visit(const Relocation& relocation) {
process(relocation.size());
process(relocation.address());
process(static_cast<size_t>(relocation.is_pc_relative()));
process(relocation.type());
process(relocation.origin());
if (relocation.has_symbol()) {
process(relocation.symbol()->name());
}
}
void Hash::visit(const RelocationObject& robject) {
visit(*robject.as<Relocation>());
process(static_cast<size_t>(robject.is_scattered()));
if (robject.is_scattered()) {
process(robject.value());
}
}
void Hash::visit(const RelocationDyld& rdyld) {
visit(*rdyld.as<Relocation>());
}
void Hash::visit(const RelocationFixup& fixup) {
visit(*fixup.as<Relocation>());
process(fixup.target());
}
void Hash::visit(const BindingInfo& binding) {
process(binding.library_ordinal());
process(binding.addend());
process(static_cast<size_t>(binding.is_weak_import()));
process(binding.address());
if (binding.has_symbol()) {
process(binding.symbol()->name());
}
if (binding.has_library()) {
process(*binding.library());
}
}
void Hash::visit(const DyldBindingInfo& binding) {
visit(*binding.as<BindingInfo>());
process(binding.binding_class());
process(binding.binding_type());
}
void Hash::visit(const ChainedBindingInfo& binding) {
visit(*binding.as<BindingInfo>());
process(binding.format());
}
void Hash::visit(const DyldExportsTrie& trie) {
visit(*trie.as<LoadCommand>());
process(trie.data_offset());
process(trie.data_size());
process(trie.content());
}
void Hash::visit(const ExportInfo& einfo) {
process(einfo.node_offset());
process(einfo.flags());
process(einfo.address());
if (einfo.has_symbol()) {
process(einfo.symbol()->name());
}
}
void Hash::visit(const FunctionStarts& fs) {
visit(*fs.as<LoadCommand>());
process(fs.data_offset());
process(fs.data_size());
process(fs.functions());
}
void Hash::visit(const CodeSignature& cs) {
visit(*cs.as<LoadCommand>());
process(cs.data_offset());
process(cs.data_size());
}
void Hash::visit(const DataInCode& dic) {
visit(*dic.as<LoadCommand>());
process(dic.data_offset());
process(dic.data_size());
process(std::begin(dic.entries()), std::end(dic.entries()));
}
void Hash::visit(const DataCodeEntry& dce) {
process(dce.offset());
process(dce.length());
process(dce.type());
}
void Hash::visit(const VersionMin& vmin) {
visit(*vmin.as<LoadCommand>());
process(vmin.version());
process(vmin.sdk());
}
void Hash::visit(const UnknownCommand& ukn) {
visit(*ukn.as<LoadCommand>());
process(ukn.original_command());
}
void Hash::visit(const SourceVersion& sv) {
visit(*sv.as<LoadCommand>());
process(sv.version());
}
void Hash::visit(const SegmentSplitInfo& ssi) {
visit(*ssi.as<LoadCommand>());
process(ssi.data_offset());
process(ssi.data_size());
}
void Hash::visit(const SubFramework& sf) {
visit(*sf.as<LoadCommand>());
process(sf.umbrella());
}
void Hash::visit(const DyldEnvironment& de) {
visit(*de.as<LoadCommand>());
process(de.value());
}
void Hash::visit(const EncryptionInfo& e) {
visit(*e.as<LoadCommand>());
process(e.crypt_offset());
process(e.crypt_size());
process(e.crypt_id());
}
void Hash::visit(const BuildVersion& e) {
BuildVersion::tools_list_t tools = e.tools();
visit(*e.as<LoadCommand>());
process(e.platform());
process(e.minos());
process(e.sdk());
process(std::begin(tools), std::end(tools));
}
void Hash::visit(const BuildToolVersion& e) {
process(e.tool());
process(e.version());
}
void Hash::visit(const FilesetCommand& e) {
process(e.name());
process(e.virtual_address());
process(e.file_offset());
}
void Hash::visit(const CodeSignatureDir& e) {
process(e.data_offset());
process(e.data_size());
process(e.content());
}
void Hash::visit(const TwoLevelHints& e) {
process(e.content());
}
void Hash::visit(const LinkerOptHint& e) {
process(e.data_offset());
process(e.data_size());
process(e.content());
}
} // namespace MachO
} // namespace LIEF