Retro68/gcc/libsanitizer/sanitizer_common/sanitizer_list.h

145 lines
3.2 KiB
C
Raw Normal View History

2014-09-21 17:33:12 +00:00
//===-- sanitizer_list.h ----------------------------------------*- C++ -*-===//
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file contains implementation of a list class to be used by
// ThreadSanitizer, etc run-times.
//
//===----------------------------------------------------------------------===//
2017-04-10 11:32:00 +00:00
2014-09-21 17:33:12 +00:00
#ifndef SANITIZER_LIST_H
#define SANITIZER_LIST_H
#include "sanitizer_internal_defs.h"
namespace __sanitizer {
// Intrusive singly-linked list with size(), push_back(), push_front()
// pop_front(), append_front() and append_back().
// This class should be a POD (so that it can be put into TLS)
// and an object with all zero fields should represent a valid empty list.
// This class does not have a CTOR, so clear() should be called on all
// non-zero-initialized objects before using.
template<class Item>
struct IntrusiveList {
2015-08-28 15:33:40 +00:00
friend class Iterator;
2014-09-21 17:33:12 +00:00
void clear() {
2017-04-10 11:32:00 +00:00
first_ = last_ = nullptr;
2014-09-21 17:33:12 +00:00
size_ = 0;
}
bool empty() const { return size_ == 0; }
uptr size() const { return size_; }
void push_back(Item *x) {
if (empty()) {
2017-04-10 11:32:00 +00:00
x->next = nullptr;
2014-09-21 17:33:12 +00:00
first_ = last_ = x;
size_ = 1;
} else {
2017-04-10 11:32:00 +00:00
x->next = nullptr;
2014-09-21 17:33:12 +00:00
last_->next = x;
last_ = x;
size_++;
}
}
void push_front(Item *x) {
if (empty()) {
2017-04-10 11:32:00 +00:00
x->next = nullptr;
2014-09-21 17:33:12 +00:00
first_ = last_ = x;
size_ = 1;
} else {
x->next = first_;
first_ = x;
size_++;
}
}
void pop_front() {
CHECK(!empty());
first_ = first_->next;
2017-04-10 11:32:00 +00:00
if (!first_)
last_ = nullptr;
2014-09-21 17:33:12 +00:00
size_--;
}
Item *front() { return first_; }
Item *back() { return last_; }
void append_front(IntrusiveList<Item> *l) {
CHECK_NE(this, l);
if (l->empty())
return;
if (empty()) {
*this = *l;
} else if (!l->empty()) {
l->last_->next = first_;
first_ = l->first_;
size_ += l->size();
}
l->clear();
}
void append_back(IntrusiveList<Item> *l) {
CHECK_NE(this, l);
if (l->empty())
return;
if (empty()) {
*this = *l;
} else {
last_->next = l->first_;
last_ = l->last_;
size_ += l->size();
}
l->clear();
}
void CheckConsistency() {
if (size_ == 0) {
CHECK_EQ(first_, 0);
CHECK_EQ(last_, 0);
} else {
uptr count = 0;
for (Item *i = first_; ; i = i->next) {
count++;
if (i == last_) break;
}
CHECK_EQ(size(), count);
CHECK_EQ(last_->next, 0);
}
}
2017-04-10 11:32:00 +00:00
template<class ListTy, class ItemTy>
class IteratorBase {
2015-08-28 15:33:40 +00:00
public:
2017-04-10 11:32:00 +00:00
explicit IteratorBase(ListTy *list)
2015-08-28 15:33:40 +00:00
: list_(list), current_(list->first_) { }
2017-04-10 11:32:00 +00:00
ItemTy *next() {
ItemTy *ret = current_;
2015-08-28 15:33:40 +00:00
if (current_) current_ = current_->next;
return ret;
}
2017-04-10 11:32:00 +00:00
bool hasNext() const { return current_ != nullptr; }
2015-08-28 15:33:40 +00:00
private:
2017-04-10 11:32:00 +00:00
ListTy *list_;
ItemTy *current_;
2015-08-28 15:33:40 +00:00
};
2017-04-10 11:32:00 +00:00
typedef IteratorBase<IntrusiveList<Item>, Item> Iterator;
typedef IteratorBase<const IntrusiveList<Item>, const Item> ConstIterator;
2014-09-21 17:33:12 +00:00
// private, don't use directly.
uptr size_;
Item *first_;
Item *last_;
};
2017-04-10 11:32:00 +00:00
} // namespace __sanitizer
2014-09-21 17:33:12 +00:00
2017-04-10 11:32:00 +00:00
#endif // SANITIZER_LIST_H