HomeSort by relevance Sort by last modified time
    Searched defs:front_ (Results 1 - 4 of 4) sorted by null

  /external/parameter-framework/asio-1.10.6/include/asio/detail/
op_queue.hpp 49 return q.front_;
66 : front_(0),
74 while (Operation* op = front_)
84 return front_;
90 if (front_)
92 Operation* tmp = front_;
93 front_ = op_queue_access::next(front_);
94 if (front_ == 0)
111 front_ = back_ = h
142 Operation* front_; member in class:asio::detail::op_queue
    [all...]
  /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/
RunQueue.h 41 RunQueue() : front_(0), back_(0) {
55 unsigned front = front_.load(std::memory_order_relaxed);
61 front_.store(front + 1 + (kSize << 1), std::memory_order_relaxed);
70 unsigned front = front_.load(std::memory_order_relaxed);
79 front_.store(front, std::memory_order_relaxed);
160 unsigned front = front_.load(std::memory_order_acquire);
162 unsigned front1 = front_.load(std::memory_order_relaxed);
193 // Low log(kSize) + 1 bits in front_ and back_ contain rolling index of
198 // consistent snapshot of front_/back_ for Size operation using the
200 std::atomic<unsigned> front_; member in class:Eigen::RunQueue
    [all...]
  /external/v8/src/zone/
zone-chunk-list.h 56 front_ = NewChunk(static_cast<uint32_t>(start_mode));
57 back_ = front_;
132 Chunk* front_ = nullptr; member in class:v8::internal::ZoneChunkList::StartMode
212 return ForwardZoneChunkListIterator<T>(list->front_, 0);
288 return front_->items()[0];
305 front_ = NewChunk(static_cast<uint32_t>(StartMode::kSmall));
306 back_ = front_;
335 chunk->next_ = front_;
336 if (front_) {
337 front_->previous_ = chunk
    [all...]
  /external/v8/src/heap/
heap.h 399 : front_(nullptr),
416 return (front_ == rear_) &&
435 struct Entry* front_; member in class:v8::internal::GarbageCollectionReason::PromotionQueue
    [all...]

Completed in 78 milliseconds