unbound-queue-inl.h 1.97 KB
Newer Older
1
// Copyright 2010 the V8 project authors. All rights reserved.
2 3
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
4

5 6
#ifndef V8_PROFILER_UNBOUND_QUEUE_INL_H_
#define V8_PROFILER_UNBOUND_QUEUE_INL_H_
7

8
#include "src/profiler/unbound-queue.h"
9 10 11 12 13 14

namespace v8 {
namespace internal {

template<typename Record>
struct UnboundQueue<Record>::Node: public Malloced {
15
  explicit Node(const Record& value) : value(value), next(nullptr) {}
16 17 18 19 20 21 22 23 24

  Record value;
  Node* next;
};


template<typename Record>
UnboundQueue<Record>::UnboundQueue() {
  first_ = new Node(Record());
25
  divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);
26 27 28 29 30
}


template<typename Record>
UnboundQueue<Record>::~UnboundQueue() {
31
  while (first_ != nullptr) DeleteFirst();
32 33 34 35 36 37 38 39 40 41 42 43
}


template<typename Record>
void UnboundQueue<Record>::DeleteFirst() {
  Node* tmp = first_;
  first_ = tmp->next;
  delete tmp;
}


template<typename Record>
44
bool UnboundQueue<Record>::Dequeue(Record* rec) {
45
  if (divider_ == base::Acquire_Load(&last_)) return false;
46 47
  Node* next = reinterpret_cast<Node*>(divider_)->next;
  *rec = next->value;
48
  base::Release_Store(&divider_, reinterpret_cast<base::AtomicWord>(next));
49
  return true;
50 51 52 53 54 55 56
}


template<typename Record>
void UnboundQueue<Record>::Enqueue(const Record& rec) {
  Node*& next = reinterpret_cast<Node*>(last_)->next;
  next = new Node(rec);
57
  base::Release_Store(&last_, reinterpret_cast<base::AtomicWord>(next));
58

59
  while (first_ != reinterpret_cast<Node*>(base::Acquire_Load(&divider_))) {
60 61 62 63 64 65 66
    DeleteFirst();
  }
}


template<typename Record>
bool UnboundQueue<Record>::IsEmpty() const {
67
  return base::Relaxed_Load(&divider_) == base::Relaxed_Load(&last_);
68 69
}

70 71

template<typename Record>
72
Record* UnboundQueue<Record>::Peek() const {
73
  if (divider_ == base::Acquire_Load(&last_)) return nullptr;
74 75 76 77
  Node* next = reinterpret_cast<Node*>(divider_)->next;
  return &next->value;
}

78 79
}  // namespace internal
}  // namespace v8
80

81
#endif  // V8_PROFILER_UNBOUND_QUEUE_INL_H_