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
|
// Copyright 2010 Google Inc. All Rights Reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// static_map-inl.h: StaticMap implementation.
//
// See static_map.h for documentation.
//
// Author: Siyang Xie (lambxsy@google.com)
#ifndef PROCESSOR_STATIC_MAP_INL_H__
#define PROCESSOR_STATIC_MAP_INL_H__
#include "processor/static_map.h"
#include "processor/static_map_iterator-inl.h"
#include "processor/logging.h"
namespace google_breakpad {
template<typename Key, typename Value, typename Compare>
StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data)
: raw_data_(raw_data),
compare_() {
// First 4 Bytes store the number of nodes.
num_nodes_ = *(reinterpret_cast<const uint32_t*>(raw_data_));
offsets_ = reinterpret_cast<const uint32_t*>(
raw_data_ + sizeof(num_nodes_));
keys_ = reinterpret_cast<const Key*>(
raw_data_ + (1 + num_nodes_) * sizeof(uint32_t));
}
// find(), lower_bound() and upper_bound() implement binary search algorithm.
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>
StaticMap<Key, Value, Compare>::find(const Key &key) const {
int begin = 0;
int end = num_nodes_;
int middle;
int compare_result;
while (begin < end) {
middle = begin + (end - begin) / 2;
compare_result = compare_(key, GetKeyAtIndex(middle));
if (compare_result == 0)
return IteratorAtIndex(middle);
if (compare_result < 0) {
end = middle;
} else {
begin = middle + 1;
}
}
return this->end();
}
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>
StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const {
int begin = 0;
int end = num_nodes_;
int middle;
int comp_result;
while (begin < end) {
middle = begin + (end - begin) / 2;
comp_result = compare_(key, GetKeyAtIndex(middle));
if (comp_result == 0)
return IteratorAtIndex(middle);
if (comp_result < 0) {
end = middle;
} else {
begin = middle + 1;
}
}
return IteratorAtIndex(begin);
}
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>
StaticMap<Key, Value, Compare>::upper_bound(const Key &key) const {
int begin = 0;
int end = num_nodes_;
int middle;
int compare_result;
while (begin < end) {
middle = begin + (end - begin) / 2;
compare_result = compare_(key, GetKeyAtIndex(middle));
if (compare_result == 0)
return IteratorAtIndex(middle + 1);
if (compare_result < 0) {
end = middle;
} else {
begin = middle + 1;
}
}
return IteratorAtIndex(begin);
}
template<typename Key, typename Value, typename Compare>
bool StaticMap<Key, Value, Compare>::ValidateInMemoryStructure() const {
// check the number of nodes is non-negative:
if (!raw_data_) return false;
int32_t num_nodes = *(reinterpret_cast<const int32_t*>(raw_data_));
if (num_nodes < 0) {
BPLOG(INFO) << "StaticMap check failed: negative number of nodes";
return false;
}
int node_index = 0;
if (num_nodes_) {
uint64_t first_offset = sizeof(int32_t) * (num_nodes_ + 1)
+ sizeof(Key) * num_nodes_;
// Num_nodes_ is too large.
if (first_offset > 0xffffffffUL) {
BPLOG(INFO) << "StaticMap check failed: size exceeds limit";
return false;
}
if (offsets_[node_index] != static_cast<uint32_t>(first_offset)) {
BPLOG(INFO) << "StaticMap check failed: first node offset is incorrect";
return false;
}
}
for (node_index = 1; node_index < num_nodes_; ++node_index) {
// Check offsets[i] is strictly increasing:
if (offsets_[node_index] <= offsets_[node_index - 1]) {
BPLOG(INFO) << "StaticMap check failed: node offsets non-increasing";
return false;
}
// Check Key[i] is strictly increasing as no duplicate keys are allowed.
if (compare_(GetKeyAtIndex(node_index),
GetKeyAtIndex(node_index - 1)) <= 0) {
BPLOG(INFO) << "StaticMap check failed: node keys non-increasing";
return false;
}
}
return true;
}
template<typename Key, typename Value, typename Compare>
const Key StaticMap<Key, Value, Compare>::GetKeyAtIndex(int index) const {
if (index < 0 || index >= num_nodes_) {
BPLOG(ERROR) << "Key index out of range error";
// Key type is required to be primitive type. Return 0 if index is invalid.
return 0;
}
return keys_[index];
}
} // namespace google_breakpad
#endif // PROCESSOR_STATIC_MAP_INL_H__
|
