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
|
// 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_iterator-inl.h: StaticMapIterator implementation.
//
// See static_map_iterator.h for documentation.
//
// Author: Siyang Xie (lambxsy@google.com)
#ifndef PROCESSOR_STATIC_MAP_ITERATOR_INL_H__
#define PROCESSOR_STATIC_MAP_ITERATOR_INL_H__
#include "processor/static_map_iterator.h"
#include "processor/logging.h"
namespace google_breakpad {
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base,
const int &index):
index_(index), base_(base) {
// See static_map.h for documentation on
// bytes format of serialized StaticMap data.
num_nodes_ = *(reinterpret_cast<const int32_t*>(base_));
offsets_ = reinterpret_cast<const uint32_t*>(base_ + sizeof(num_nodes_));
keys_ = reinterpret_cast<const Key*>(
base_ + (1 + num_nodes_) * sizeof(num_nodes_));
}
// Increment & Decrement operators:
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>&
StaticMapIterator<Key, Value, Compare>::operator++() {
if (!IsValid()) {
BPLOG(ERROR) << "operator++ on invalid iterator";
return *this;
}
if (++index_ > num_nodes_) index_ = num_nodes_;
return *this;
}
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>
StaticMapIterator<Key, Value, Compare>::operator++(int postfix_operator) {
if (!IsValid()) {
BPLOG(ERROR) << "operator++ on invalid iterator";
return *this;
}
StaticMapIterator<Key, Value, Compare> tmp = *this;
if (++index_ > num_nodes_) index_ = num_nodes_;
return tmp;
}
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>&
StaticMapIterator<Key, Value, Compare>::operator--() {
if (!IsValid()) {
BPLOG(ERROR) << "operator++ on invalid iterator";
return *this;
}
if (--index_ < 0) index_ = 0;
return *this;
}
template<typename Key, typename Value, typename Compare>
StaticMapIterator<Key, Value, Compare>
StaticMapIterator<Key, Value, Compare>::operator--(int postfix_operator) {
if (!IsValid()) {
BPLOG(ERROR) << "operator++ on invalid iterator";
return *this;
}
StaticMapIterator<Key, Value, Compare> tmp = *this;
if (--index_ < 0) index_ = 0;
return tmp;
}
template<typename Key, typename Value, typename Compare>
const Key* StaticMapIterator<Key, Value, Compare>::GetKeyPtr() const {
if (!IsValid()) {
BPLOG(ERROR) << "call GetKeyPtr() on invalid iterator";
return NULL;
}
return &(keys_[index_]);
}
template<typename Key, typename Value, typename Compare>
const char* StaticMapIterator<Key, Value, Compare>::GetValueRawPtr() const {
if (!IsValid()) {
BPLOG(ERROR) << "call GetValuePtr() on invalid iterator";
return NULL;
}
return base_ + offsets_[index_];
}
template<typename Key, typename Value, typename Compare>
bool StaticMapIterator<Key, Value, Compare>::operator==(
const StaticMapIterator<Key, Value, Compare>& x) const {
return base_ == x.base_ && index_ == x.index_;
}
template<typename Key, typename Value, typename Compare>
bool StaticMapIterator<Key, Value, Compare>::operator!=(
const StaticMapIterator<Key, Value, Compare>& x) const {
// Only need to compare base_ and index_.
// Other data members are auxiliary.
return base_ != x.base_ || index_ != x.index_;
}
template<typename Key, typename Value, typename Compare>
bool StaticMapIterator<Key, Value, Compare>::IsValid() const {
if (!base_ || index_ < 0 || index_ > num_nodes_)
return false;
return true;
}
} // namespace google_breakpad
#endif // PROCESSOR_STATIC_MAP_ITERATOR_INL_H__
|
