Upgrade V8 to version 4.9.385.28
https://chromium.googlesource.com/v8/v8/+/4.9.385.28
FPIIM-449
Change-Id: I4b2e74289d4bf3667f2f3dc8aa2e541f63e26eb4
diff --git a/src/locked-queue.h b/src/locked-queue.h
new file mode 100644
index 0000000..5bb97c8
--- /dev/null
+++ b/src/locked-queue.h
@@ -0,0 +1,43 @@
+// Copyright 2015 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_LOCKED_QUEUE_
+#define V8_LOCKED_QUEUE_
+
+#include "src/allocation.h"
+#include "src/base/platform/platform.h"
+
+namespace v8 {
+namespace internal {
+
+// Simple lock-based unbounded size queue (multi producer; multi consumer) based
+// on "Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue
+// Algorithms" by M. Scott and M. Michael.
+// See:
+// https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html
+template <typename Record>
+class LockedQueue final BASE_EMBEDDED {
+ public:
+ inline LockedQueue();
+ inline ~LockedQueue();
+ inline void Enqueue(const Record& record);
+ inline bool Dequeue(Record* record);
+ inline bool IsEmpty() const;
+ inline bool Peek(Record* record) const;
+
+ private:
+ struct Node;
+
+ mutable base::Mutex head_mutex_;
+ base::Mutex tail_mutex_;
+ Node* head_;
+ Node* tail_;
+
+ DISALLOW_COPY_AND_ASSIGN(LockedQueue);
+};
+
+} // namespace internal
+} // namespace v8
+
+#endif // V8_LOCKED_QUEUE_