Home
last modified time | relevance | path

Searched refs:tail_ (Results 1 – 25 of 25) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/perf/
Dcyclic_array.h121 CyclicArray() : buf_(nullptr), head_(0), tail_(0), size_(0), capacity_(0) {} in CyclicArray()
126 … : buf_(std::make_unique<T[]>(capacity + 1)), head_(0), tail_(0), size_(0), capacity_(capacity) {} in CyclicArray()
131 tail_(rhs.tail_), in CyclicArray()
145 Iterator end() { return Iterator(tail_, buf_.get(), capacity_, head_); } in end()
150 Iterator end() const { return Iterator(tail_, buf_.get(), capacity_, head_); } in end()
155 tail_ = 0; in clear()
168 buf_[tail_] = val; in push_back()
170 (tail_ != capacity_) ? tail_++ : tail_ = 0; in push_back()
173 tail_++; in push_back()
191 dsize_t tail_; variable
/third_party/boost/boost/lockfree/
Dqueue.hpp149 tail_.store(dummy_node, memory_order_release); in initialize()
178 return head_.is_lock_free() && tail_.is_lock_free() && pool.is_lock_free(); in is_lock_free()
187 tail_(tagged_node_handle(0, 0)), in queue()
203 tail_(tagged_node_handle(0, 0)), in queue()
216 tail_(tagged_node_handle(0, 0)), in queue()
233 tail_(tagged_node_handle(0, 0)), in queue()
251 tail_(tagged_node_handle(0, 0)), in queue()
291 return pool.get_handle(head_.load()) == pool.get_handle(tail_.load()); in empty()
333 tagged_node_handle tail = tail_.load(memory_order_acquire); in do_push()
338 tagged_node_handle tail2 = tail_.load(memory_order_acquire); in do_push()
[all …]
/third_party/boost/boost/spirit/home/classic/utility/
Ddistinct.hpp49 explicit distinct_parser(parser<TailT> const & tail_) in distinct_parser() argument
50 : tail(tail_.derived()) in distinct_parser()
98 explicit distinct_directive(parser<TailT> const & tail_) in distinct_directive() argument
99 : tail(tail_.derived()) in distinct_directive()
148 explicit dynamic_distinct_parser(parser<ParserT> const & tail_) in dynamic_distinct_parser() argument
149 : tail(tail_.derived()) in dynamic_distinct_parser()
203 explicit dynamic_distinct_directive(parser<ParserT> const & tail_) in dynamic_distinct_directive() argument
204 : tail(tail_.derived()) in dynamic_distinct_directive()
/third_party/boost/boost/xpressive/detail/dynamic/
Dsequence.hpp34 , tail_(0) in sequence()
46 , tail_(&xpr->next_) in sequence()
58 , tail_(&xpr->next_) in sequence()
77 *this->tail_ = that.head_; in operator +=()
78 this->tail_ = that.tail_; in operator +=()
156 shared_matchable<BidiIter> *tail_; member
/third_party/node/src/
Dcallback_queue-inl.h24 tail_ = nullptr; // The queue is now empty. in Shift()
32 Callback* prev_tail = tail_; in Push()
35 tail_ = cb.get(); in Push()
45 if (tail_ != nullptr) in ConcatMove()
46 tail_->set_next(std::move(other.head_)); in ConcatMove()
49 tail_ = other.tail_; in ConcatMove()
50 other.tail_ = nullptr; in ConcatMove()
Dcallback_queue.h71 Callback* tail_ = nullptr; variable
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/
Dqueue.h48 …: sz_(sz), arr_(Services::GetAllocator<T>()), head_(0), tail_(0), my_name_(Services::GetUniqueID()… in Queue()
61 size_t v = tail_ - head_; in size()
67 bool empty() const { return head_ == tail_; } in empty()
77 auto k = tail_++ % sz_; in Add()
92 auto k = tail_++ % sz_; in Add()
108 auto k = tail_++ % sz_; in EmplaceBack()
138 for (auto i = head_; i < tail_; ++i) { in ResetQue()
149 tail_ = 0; in ResetQue()
166 size_t tail_; variable
Dcircular_pool.cc35 tail_ = b.get(); in AddOneArena()
68 cur_tail_ = dp_->tail_; in Reset()
101 (void)atomic_compare_exchange_weak(&tail_, &expected, ba); in Allocate()
Dcircular_pool.h98 std::atomic<Arena *> tail_{};
/third_party/mindspore/mindspore/ccsrc/runtime/device/gpu/
Dblocking_queue.cc29 tail_(0), in GpuQueue()
54 void *addr = reinterpret_cast<unsigned char *>(buffer_) + tail_ * len_ + offset; in Push()
61 node_info_[tail_].event_.reset(new cudaEvent_t()); in Push()
62 …CHECK_CUDA_RET_WITH_ERROR(cudaEventCreate(&(*(node_info_[tail_].event_))), "Cuda Create Event Fail… in Push()
63 …CHECK_CUDA_RET_WITH_ERROR(cudaEventRecord(*(node_info_[tail_].event_), stream_), "Cuda Create Even… in Push()
64 node_info_[tail_].data_ = data; in Push()
65 tail_ = (tail_ + 1) % (capacity_); in Push()
Dblocking_queue.h67 size_t tail_; variable
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_ring.cc86 << ", head = " << rep.head_ << ", tail = " << rep.tail_ in operator <<()
140 if (head_ >= capacity_ || tail_ >= capacity_) { in IsValid()
141 output << "head " << head_ << " and/or tail " << tail_ << "exceed capacity " in IsValid()
146 const index_type back = retreat(tail_); in IsValid()
187 } while (head != tail_); in IsValid()
253 tail_ = advance(0, src->entries(head, tail)); in Fill()
296 index_type back = retreat(tail_); in GetAppendBuffer()
333 rep->tail_ = rep->advance(0); in CreateFromLeaf()
386 Filler filler(rep, append ? rep->tail_ : rep->retreat(rep->head_, entries)); in AddRing()
398 if (tail.index != ring->tail_) UnrefEntries(ring, tail.index, ring->tail_); in AddRing()
[all …]
Dcord_rep_ring.h119 index_type tail() const { return tail_; } in tail()
123 index_type entries() const { return entries(head_, tail_); } in entries()
344 ForEach(head_, tail_, std::forward<F>(f)); in ForEach()
479 index_type tail_; variable
536 return (tail_ > head_) ? (index >= head_ && index < tail_) in IsValidIndex()
537 : (index >= head_ || index < tail_); in IsValidIndex()
561 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head_, offset); in FindTail()
568 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head, offset); in FindTail()
/third_party/grpc/src/core/lib/gprpp/
Dmpscq.cc44 Node* tail = tail_; in PopAndCheckEnd()
45 Node* next = tail_->next.Load(MemoryOrder::ACQUIRE); in PopAndCheckEnd()
52 tail_ = next; in PopAndCheckEnd()
58 tail_ = next; in PopAndCheckEnd()
71 tail_ = next; in PopAndCheckEnd()
Dmpscq.h41 MultiProducerSingleConsumerQueue() : head_{&stub_}, tail_(&stub_) {} in MultiProducerSingleConsumerQueue()
44 GPR_ASSERT(tail_ == &stub_); in ~MultiProducerSingleConsumerQueue()
66 Node* tail_; variable
/third_party/boost/boost/asio/impl/
Dcompose.hpp129 tail_(tail...) in composed_io_executors()
136 tail_.reset(); in reset()
141 composed_io_executors<void(Tail...)> tail_; member
160 tail_(BOOST_ASIO_VARIADIC_BYVAL_ARGS(n)) \
167 tail_.reset(); \
172 composed_io_executors<void(BOOST_ASIO_VARIADIC_TARGS(n))> tail_; \
240 tail_(ex.tail_) in composed_work()
247 tail_.reset(); in reset()
252 composed_work<void(Tail...)> tail_; member
266 tail_(ex.tail_) \
[all …]
/third_party/boost/libs/asio/include/boost/asio/impl/
Dcompose.hpp129 tail_(tail...) in composed_io_executors()
136 tail_.reset(); in reset()
141 composed_io_executors<void(Tail...)> tail_; member
160 tail_(BOOST_ASIO_VARIADIC_BYVAL_ARGS(n)) \
167 tail_.reset(); \
172 composed_io_executors<void(BOOST_ASIO_VARIADIC_TARGS(n))> tail_; \
240 tail_(ex.tail_) in composed_work()
247 tail_.reset(); in reset()
252 composed_work<void(Tail...)> tail_; member
266 tail_(ex.tail_) \
[all …]
/third_party/grpc/src/core/lib/iomgr/
Dexec_ctx.h322 tail_ = nullptr; in ~ApplicationCallbackExecCtx()
332 GPR_DEBUG_ASSERT(tail_ == nullptr); in ~ApplicationCallbackExecCtx()
362 if (ctx->tail_ != nullptr) { in Enqueue()
363 ctx->tail_->internal_next = functor; in Enqueue()
365 ctx->tail_ = functor; in Enqueue()
379 grpc_experimental_completion_queue_functor* tail_{nullptr};
/third_party/skia/third_party/externals/libwebp/src/enc/
Dbackward_references_enc.c88 if (refs->tail_ != NULL) { in VP8LClearBackwardRefs()
89 *refs->tail_ = refs->free_blocks_; // recycle all blocks at once in VP8LClearBackwardRefs()
92 refs->tail_ = &refs->refs_; in VP8LClearBackwardRefs()
111 (refs1->tail_ != NULL && refs1->tail_ == &refs1->refs_); in BackwardRefsSwap()
113 (refs2->tail_ != NULL && refs2->tail_ == &refs2->refs_); in BackwardRefsSwap()
117 if (point_to_refs2) refs1->tail_ = &refs1->refs_; in BackwardRefsSwap()
118 if (point_to_refs1) refs2->tail_ = &refs2->refs_; in BackwardRefsSwap()
124 refs->tail_ = &refs->refs_; in VP8LBackwardRefsInit()
164 *refs->tail_ = b; in BackwardRefsNewBlock()
165 refs->tail_ = &b->next_; in BackwardRefsNewBlock()
Dbackward_references_enc.h175 PixOrCopyBlock** tail_; // for list recycling member
/third_party/boost/libs/core/doc/
Dexchange.qbk34 , tail_(boost::exchange(other.tail_, nullptr)) { }
/third_party/boost/libs/atomic/doc/
Dexamples.qbk240 ringbuffer() : head_(0), tail_(0) {}
246 if (next_head == tail_.load(boost::memory_order_acquire))
254 size_t tail = tail_.load(boost::memory_order_relaxed);
258 tail_.store(next(tail), boost::memory_order_release);
267 boost::atomic<size_t> head_, tail_;
301 rewriting this element with a new value by accessing [^tail_]
/third_party/flutter/skia/third_party/externals/libwebp/src/enc/
Dbackward_references_enc.c87 if (refs->tail_ != NULL) { in VP8LClearBackwardRefs()
88 *refs->tail_ = refs->free_blocks_; // recycle all blocks at once in VP8LClearBackwardRefs()
91 refs->tail_ = &refs->refs_; in VP8LClearBackwardRefs()
109 refs->tail_ = &refs->refs_; in VP8LBackwardRefsInit()
149 *refs->tail_ = b; in BackwardRefsNewBlock()
150 refs->tail_ = &b->next_; in BackwardRefsNewBlock()
Dbackward_references_enc.h174 PixOrCopyBlock** tail_; // for list recycling member
/third_party/boost/boost/mpl/set/aux_/
Diterator.hpp43 typedef Tail tail_; typedef