v8  3.14.5(node0.10.28)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
unbound-queue-inl.h
Go to the documentation of this file.
1 // Copyright 2010 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
28 #ifndef V8_UNBOUND_QUEUE_INL_H_
29 #define V8_UNBOUND_QUEUE_INL_H_
30 
31 #include "unbound-queue.h"
32 
33 namespace v8 {
34 namespace internal {
35 
36 template<typename Record>
37 struct UnboundQueue<Record>::Node: public Malloced {
38  explicit Node(const Record& value)
39  : value(value), next(NULL) {
40  }
41 
42  Record value;
43  Node* next;
44 };
45 
46 
47 template<typename Record>
48 UnboundQueue<Record>::UnboundQueue() {
49  first_ = new Node(Record());
50  divider_ = last_ = reinterpret_cast<AtomicWord>(first_);
51 }
52 
53 
54 template<typename Record>
55 UnboundQueue<Record>::~UnboundQueue() {
56  while (first_ != NULL) DeleteFirst();
57 }
58 
59 
60 template<typename Record>
61 void UnboundQueue<Record>::DeleteFirst() {
62  Node* tmp = first_;
63  first_ = tmp->next;
64  delete tmp;
65 }
66 
67 
68 template<typename Record>
69 void UnboundQueue<Record>::Dequeue(Record* rec) {
70  ASSERT(divider_ != last_);
71  Node* next = reinterpret_cast<Node*>(divider_)->next;
72  *rec = next->value;
73  OS::ReleaseStore(&divider_, reinterpret_cast<AtomicWord>(next));
74 }
75 
76 
77 template<typename Record>
78 void UnboundQueue<Record>::Enqueue(const Record& rec) {
79  Node*& next = reinterpret_cast<Node*>(last_)->next;
80  next = new Node(rec);
81  OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next));
82  while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst();
83 }
84 
85 
86 template<typename Record>
87 Record* UnboundQueue<Record>::Peek() {
88  ASSERT(divider_ != last_);
89  Node* next = reinterpret_cast<Node*>(divider_)->next;
90  return &next->value;
91 }
92 
93 } } // namespace v8::internal
94 
95 #endif // V8_UNBOUND_QUEUE_INL_H_
ASSERT
#define ASSERT(condition)
Definition: checks.h:270
v8::internal::OS::ReleaseStore
static void ReleaseStore(volatile AtomicWord *ptr, AtomicWord value)
Definition: platform-cygwin.cc:81
v8::internal::AtomicWord
intptr_t AtomicWord
Definition: atomicops.h:75
v8::internal::NULL
activate correct semantics for inheriting readonliness enable harmony semantics for typeof enable harmony enable harmony proxies enable all harmony harmony_scoping harmony_proxies harmony_scoping tracks arrays with only smi values automatically unbox arrays of doubles use crankshaft use hydrogen range analysis use hydrogen global value numbering use function inlining maximum number of AST nodes considered for a single inlining loop invariant code motion print statistics for hydrogen trace generated IR for specified phases trace register allocator trace range analysis trace representation types environment for every instruction put a break point before deoptimizing polymorphic inlining perform array bounds checks elimination use dead code elimination trace on stack replacement optimize closures cache optimized code for closures functions with arguments object loop weight for representation inference allow uint32 values on optimize frames if they are used only in safe operations track parallel recompilation enable all profiler experiments number of stack frames inspected by the profiler call recompile stub directly when self optimizing trigger profiler ticks based on counting instead of timing weight back edges by jump distance for interrupt triggering percentage of ICs that must have type info to allow optimization watch_ic_patching retry_self_opt interrupt_at_exit extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of SAHF instruction if enable use of VFP3 instructions if available this implies enabling ARMv7 and VFP2 enable use of VFP2 instructions if available enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of MIPS FPU instructions if NULL
Definition: flags.cc:301
i::UnboundQueue::Node::Node
Node(const Record &value)
Definition: unbound-queue-inl.h:38