Retro68/gcc/libsanitizer/sanitizer_common/sanitizer_vector.h

128 lines
2.5 KiB
C
Raw Normal View History

2019-06-02 15:48:37 +00:00
//===-- sanitizer_vector.h -------------------------------------*- C++ -*-===//
2014-09-21 17:33:12 +00:00
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
2019-06-02 15:48:37 +00:00
// This file is shared between sanitizers run-time libraries.
2014-09-21 17:33:12 +00:00
//
//===----------------------------------------------------------------------===//
// Low-fat STL-like vector container.
2019-06-02 15:48:37 +00:00
#ifndef SANITIZER_VECTOR_H
#define SANITIZER_VECTOR_H
2014-09-21 17:33:12 +00:00
2019-06-02 15:48:37 +00:00
#include "sanitizer_common/sanitizer_allocator_internal.h"
#include "sanitizer_common/sanitizer_libc.h"
2014-09-21 17:33:12 +00:00
2019-06-02 15:48:37 +00:00
namespace __sanitizer {
2014-09-21 17:33:12 +00:00
template<typename T>
class Vector {
public:
2019-06-02 15:48:37 +00:00
explicit Vector()
: begin_()
2014-09-21 17:33:12 +00:00
, end_()
, last_() {
}
~Vector() {
if (begin_)
2019-06-02 15:48:37 +00:00
InternalFree(begin_);
2014-09-21 17:33:12 +00:00
}
void Reset() {
if (begin_)
2019-06-02 15:48:37 +00:00
InternalFree(begin_);
2014-09-21 17:33:12 +00:00
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];
}
2015-08-28 15:33:40 +00:00
T *PushBack() {
2014-09-21 17:33:12 +00:00
EnsureSize(Size() + 1);
2015-08-28 15:33:40 +00:00
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;
2014-09-21 17:33:12 +00:00
}
void PopBack() {
DCHECK_GT(end_, begin_);
end_--;
}
void Resize(uptr size) {
2015-08-28 15:33:40 +00:00
if (size == 0) {
end_ = begin_;
return;
}
2014-09-21 17:33:12 +00:00
uptr old_size = Size();
2019-06-02 15:48:37 +00:00
if (size <= old_size) {
end_ = begin_ + size;
return;
}
2014-09-21 17:33:12 +00:00
EnsureSize(size);
if (old_size < size) {
for (uptr i = old_size; i < size; i++)
2015-08-28 15:33:40 +00:00
internal_memset(&begin_[i], 0, sizeof(begin_[i]));
2014-09-21 17:33:12 +00:00
}
}
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_;
2015-08-28 15:33:40 +00:00
uptr cap = cap0 * 5 / 4; // 25% growth
2014-09-21 17:33:12 +00:00
if (cap == 0)
cap = 16;
if (cap < size)
cap = size;
2019-06-02 15:48:37 +00:00
T *p = (T*)InternalAlloc(cap * sizeof(T));
2014-09-21 17:33:12 +00:00
if (cap0) {
internal_memcpy(p, begin_, cap0 * sizeof(T));
2019-06-02 15:48:37 +00:00
InternalFree(begin_);
2014-09-21 17:33:12 +00:00
}
begin_ = p;
end_ = begin_ + size;
last_ = begin_ + cap;
}
Vector(const Vector&);
void operator=(const Vector&);
};
2019-06-02 15:48:37 +00:00
} // namespace __sanitizer
2014-09-21 17:33:12 +00:00
2019-06-02 15:48:37 +00:00
#endif // #ifndef SANITIZER_VECTOR_H