commit 4a90d5fbbb6802c59093b866f3478a814bf02b95
author Ben Murdoch <benm@google.com> Tue Mar 22 12:00:34 2016 +0000
committer Dirk Vogt <dirk@fairphone.com> Fri Mar 17 16:05:42 2017 +0100
tree 486867e3a04e7f17454c94a4c97891bb0e237f1f
parent 3821a70061b1b2077ee51c70eda717bddac94f58

Upgrade V8 to version 4.9.385.28

https://chromium.googlesource.com/v8/v8/+/4.9.385.28

FPIIM-449

Change-Id: I4b2e74289d4bf3667f2f3dc8aa2e541f63e26eb4

src/profiler/unbound-queue-inl.h

diff --git a/src/profiler/unbound-queue-inl.h b/src/profiler/unbound-queue-inl.h
new file mode 100644
index 0000000..8c45d09
--- /dev/null
+++ b/src/profiler/unbound-queue-inl.h
@@ -0,0 +1,83 @@
+// Copyright 2010 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_PROFILER_UNBOUND_QUEUE_INL_H_
+#define V8_PROFILER_UNBOUND_QUEUE_INL_H_
+
+#include "src/profiler/unbound-queue.h"
+
+namespace v8 {
+namespace internal {
+
+template<typename Record>
+struct UnboundQueue<Record>::Node: public Malloced {
+  explicit Node(const Record& value)
+      : value(value), next(NULL) {
+  }
+
+  Record value;
+  Node* next;
+};
+
+
+template<typename Record>
+UnboundQueue<Record>::UnboundQueue() {
+  first_ = new Node(Record());
+  divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);
+}
+
+
+template<typename Record>
+UnboundQueue<Record>::~UnboundQueue() {
+  while (first_ != NULL) DeleteFirst();
+}
+
+
+template<typename Record>
+void UnboundQueue<Record>::DeleteFirst() {
+  Node* tmp = first_;
+  first_ = tmp->next;
+  delete tmp;
+}
+
+
+template<typename Record>
+bool UnboundQueue<Record>::Dequeue(Record* rec) {
+  if (divider_ == base::Acquire_Load(&last_)) return false;
+  Node* next = reinterpret_cast<Node*>(divider_)->next;
+  *rec = next->value;
+  base::Release_Store(&divider_, reinterpret_cast<base::AtomicWord>(next));
+  return true;
+}
+
+
+template<typename Record>
+void UnboundQueue<Record>::Enqueue(const Record& rec) {
+  Node*& next = reinterpret_cast<Node*>(last_)->next;
+  next = new Node(rec);
+  base::Release_Store(&last_, reinterpret_cast<base::AtomicWord>(next));
+
+  while (first_ != reinterpret_cast<Node*>(base::Acquire_Load(&divider_))) {
+    DeleteFirst();
+  }
+}
+
+
+template<typename Record>
+bool UnboundQueue<Record>::IsEmpty() const {
+  return base::NoBarrier_Load(&divider_) == base::NoBarrier_Load(&last_);
+}
+
+
+template<typename Record>
+Record* UnboundQueue<Record>::Peek() const {
+  if (divider_ == base::Acquire_Load(&last_)) return NULL;
+  Node* next = reinterpret_cast<Node*>(divider_)->next;
+  return &next->value;
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_PROFILER_UNBOUND_QUEUE_INL_H_