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
| //===-- sanitizer_vector.h -------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file is shared between sanitizers run-time libraries.
//
//===----------------------------------------------------------------------===//
// Low-fat STL-like vector container.
#ifndef SANITIZER_VECTOR_H
#define SANITIZER_VECTOR_H
#include "sanitizer_common/sanitizer_allocator_internal.h"
#include "sanitizer_common/sanitizer_libc.h"
namespace __sanitizer {
template<typename T>
class Vector {
public:
Vector() : begin_(), end_(), last_() {}
~Vector() {
if (begin_)
InternalFree(begin_);
}
void Reset() {
if (begin_)
InternalFree(begin_);
begin_ = 0;
end_ = 0;
last_ = 0;
}
uptr Size() const {
return end_ - begin_;
}
T &operator[](uptr i) {
DCHECK_LT(i, end_ - begin_);
return begin_[i];
}
const T &operator[](uptr i) const {
DCHECK_LT(i, end_ - begin_);
return begin_[i];
}
T *PushBack() {
EnsureSize(Size() + 1);
T *p = &end_[-1];
internal_memset(p, 0, sizeof(*p));
return p;
}
T *PushBack(const T& v) {
EnsureSize(Size() + 1);
T *p = &end_[-1];
internal_memcpy(p, &v, sizeof(*p));
return p;
}
void PopBack() {
DCHECK_GT(end_, begin_);
end_--;
}
void Resize(uptr size) {
if (size == 0) {
end_ = begin_;
return;
}
uptr old_size = Size();
if (size <= old_size) {
end_ = begin_ + size;
return;
}
EnsureSize(size);
if (old_size < size) {
for (uptr i = old_size; i < size; i++)
internal_memset(&begin_[i], 0, sizeof(begin_[i]));
}
}
private:
T *begin_;
T *end_;
T *last_;
void EnsureSize(uptr size) {
if (size <= Size())
return;
if (size <= (uptr)(last_ - begin_)) {
end_ = begin_ + size;
return;
}
uptr cap0 = last_ - begin_;
uptr cap = cap0 * 5 / 4; // 25% growth
if (cap == 0)
cap = 16;
if (cap < size)
cap = size;
T *p = (T*)InternalAlloc(cap * sizeof(T));
if (cap0) {
internal_memcpy(p, begin_, cap0 * sizeof(T));
InternalFree(begin_);
}
begin_ = p;
end_ = begin_ + size;
last_ = begin_ + cap;
}
Vector(const Vector&);
void operator=(const Vector&);
};
} // namespace __sanitizer
#endif // #ifndef SANITIZER_VECTOR_H
|