V8 Project
circular-queue-inl.h
Go to the documentation of this file.
1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4 
5 #ifndef V8_CIRCULAR_QUEUE_INL_H_
6 #define V8_CIRCULAR_QUEUE_INL_H_
7 
8 #include "src/circular-queue.h"
9 
10 namespace v8 {
11 namespace internal {
12 
13 template<typename T, unsigned L>
14 SamplingCircularQueue<T, L>::SamplingCircularQueue()
15  : enqueue_pos_(buffer_),
16  dequeue_pos_(buffer_) {
17 }
18 
19 
20 template<typename T, unsigned L>
21 SamplingCircularQueue<T, L>::~SamplingCircularQueue() {
22 }
23 
24 
25 template<typename T, unsigned L>
26 T* SamplingCircularQueue<T, L>::Peek() {
27  base::MemoryBarrier();
28  if (base::Acquire_Load(&dequeue_pos_->marker) == kFull) {
29  return &dequeue_pos_->record;
30  }
31  return NULL;
32 }
33 
34 
35 template<typename T, unsigned L>
36 void SamplingCircularQueue<T, L>::Remove() {
37  base::Release_Store(&dequeue_pos_->marker, kEmpty);
38  dequeue_pos_ = Next(dequeue_pos_);
39 }
40 
41 
42 template<typename T, unsigned L>
43 T* SamplingCircularQueue<T, L>::StartEnqueue() {
44  base::MemoryBarrier();
45  if (base::Acquire_Load(&enqueue_pos_->marker) == kEmpty) {
46  return &enqueue_pos_->record;
47  }
48  return NULL;
49 }
50 
51 
52 template<typename T, unsigned L>
53 void SamplingCircularQueue<T, L>::FinishEnqueue() {
54  base::Release_Store(&enqueue_pos_->marker, kFull);
55  enqueue_pos_ = Next(enqueue_pos_);
56 }
57 
58 
59 template<typename T, unsigned L>
60 typename SamplingCircularQueue<T, L>::Entry* SamplingCircularQueue<T, L>::Next(
61  Entry* entry) {
62  Entry* next = entry + 1;
63  if (next == &buffer_[L]) return buffer_;
64  return next;
65 }
66 
67 } } // namespace v8::internal
68 
69 #endif // V8_CIRCULAR_QUEUE_INL_H_
NULL
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be NULL
Definition: flag-definitions.h:407
v8::base::Acquire_Load
Atomic32 Acquire_Load(volatile const Atomic32 *ptr)
Definition: atomicops_internals_arm64_gcc.h:154
v8::base::Release_Store
void Release_Store(volatile Atomic32 *ptr, Atomic32 value)
Definition: atomicops_internals_arm64_gcc.h:137
v8
Debugger support for the V8 JavaScript engine.
Definition: accessors.cc:20
T
#define T(name, string, precedence)
Definition: token.cc:25