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
147 lines (120 loc) · 3.41 KB
/
Copy pathhash.cpp
File metadata and controls
147 lines (120 loc) · 3.41 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
/* 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/DEX/hash.hpp"
#include "LIEF/DEX/Class.hpp"
#include "LIEF/DEX/Field.hpp"
#include "LIEF/DEX/File.hpp"
#include "LIEF/DEX/Header.hpp"
#include "LIEF/DEX/MapItem.hpp"
#include "LIEF/DEX/MapList.hpp"
#include "LIEF/DEX/Method.hpp"
#include "LIEF/DEX/Prototype.hpp"
namespace LIEF {
namespace DEX {
Hash::~Hash() = default;
size_t Hash::hash(const Object& obj) {
return LIEF::Hash::hash<LIEF::DEX::Hash>(obj);
}
void Hash::visit(const File& file) {
process(file.location());
process(file.header());
process(std::begin(file.classes()), std::end(file.classes()));
process(std::begin(file.methods()), std::end(file.methods()));
process(std::begin(file.strings()), std::end(file.strings()));
}
void Hash::visit(const Header& header) {
process(header.magic());
process(header.checksum());
process(header.signature());
process(header.file_size());
process(header.header_size());
process(header.endian_tag());
process(header.strings());
process(header.link());
process(header.types());
process(header.prototypes());
process(header.fields());
process(header.methods());
process(header.classes());
process(header.data());
}
void Hash::visit(const CodeInfo& /*code_info*/) {
}
void Hash::visit(const Class& cls) {
Class::it_const_fields fields = cls.fields();
Class::it_const_methods methods = cls.methods();
process(cls.fullname());
process(cls.source_filename());
process(cls.access_flags());
process(std::begin(fields), std::end(fields));
process(std::begin(methods), std::end(methods));
}
void Hash::visit(const Field& field) {
process(field.name());
if (const Type* t = field.type()) {
process(*t);
}
}
void Hash::visit(const Method& method) {
process(method.name());
process(method.bytecode());
if (const auto* p = method.prototype()) {
process(*p);
}
}
void Hash::visit(const Type& type) {
switch (type.type()) {
case Type::TYPES::ARRAY:
{
process(type.dim());
process(type.underlying_array_type());
break;
}
case Type::TYPES::PRIMITIVE:
{
process(type.primitive());
break;
}
case Type::TYPES::CLASS:
{
process(type.cls().fullname());
break;
}
case Type::TYPES::UNKNOWN:
default:
{
process(Type::TYPES::UNKNOWN);
}
}
}
void Hash::visit(const Prototype& type) {
if (const auto* rty = type.return_type()) {
process(*rty);
}
process(std::begin(type.parameters_type()),
std::end(type.parameters_type()));
}
void Hash::visit(const MapItem& item) {
process(item.size());
process(item.offset());
process(item.reserved());
process(item.type());
}
void Hash::visit(const MapList& list) {
process(std::begin(list.items()), std::end(list.items()));
}
} // namespace DEX
} // namespace LIEF