Home
last modified time | relevance | path

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

123

/external/libchrome/base/task/sequence_manager/
Dlazily_deallocated_deque.h64 for (const Ring* iter = head_.get(); iter; iter = iter->next_.get()) { in capacity()
71 while (head_) { in clear()
72 head_ = std::move(head_->next_); in clear()
81 if (!head_) { in push_front()
82 head_ = std::make_unique<Ring>(kMinimumRingSize); in push_front()
83 tail_ = head_.get(); in push_front()
87 if (!head_->CanPush()) { in push_front()
89 new_ring->next_ = std::move(head_); in push_front()
90 head_ = std::move(new_ring); in push_front()
93 head_->push_front(std::move(t)); in push_front()
[all …]
/external/pigweed/pw_trace_tokenized/public/pw_trace_tokenized/
Dtrace_tokenized.h68 event_queue_[head_].trace_token = trace_token; in TryPushBack()
69 event_queue_[head_].event_type = event_type; in TryPushBack()
70 event_queue_[head_].module = module; in TryPushBack()
71 event_queue_[head_].trace_id = trace_id; in TryPushBack()
72 event_queue_[head_].flags = flags; in TryPushBack()
73 event_queue_[head_].data_size = data_size; in TryPushBack()
75 event_queue_[head_].data_buffer[i] = in TryPushBack()
78 head_ = (head_ + 1) % kSize; in TryPushBack()
93 is_empty_ = (tail_ == head_); in PopFront()
98 head_ = 0; in Clear()
[all …]
/external/rust/crates/quiche/deps/boringssl/src/third_party/googletest/samples/
Dsample3-inl.h76 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue()
85 QueueNode<E>* node = head_; in Clear()
95 head_ = last_ = nullptr; in Clear()
104 QueueNode<E>* Head() { return head_; } in Head()
105 const QueueNode<E>* Head() const { return head_; } in Head()
119 head_ = last_ = new_node; in Enqueue()
135 const QueueNode<E>* const old_head = head_; in Dequeue()
136 head_ = head_->next_; in Dequeue()
154 for (const QueueNode<E>* node = head_; node != nullptr; in Map()
163 QueueNode<E>* head_; // The first node of the queue.
/external/googletest/googletest/samples/
Dsample3-inl.h76 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue()
85 QueueNode<E>* node = head_; in Clear()
95 head_ = last_ = nullptr; in Clear()
104 QueueNode<E>* Head() { return head_; } in Head()
105 const QueueNode<E>* Head() const { return head_; } in Head()
119 head_ = last_ = new_node; in Enqueue()
135 const QueueNode<E>* const old_head = head_; in Dequeue()
136 head_ = head_->next_; in Dequeue()
154 for (const QueueNode<E>* node = head_; node != nullptr; in Map()
163 QueueNode<E>* head_; // The first node of the queue.
/external/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_lfstack.h28 atomic_store(&head_, 0, memory_order_relaxed); in Clear()
32 return (atomic_load(&head_, memory_order_relaxed) & kPtrMask) == 0; in Empty()
36 u64 cmp = atomic_load(&head_, memory_order_relaxed); in Push()
41 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Push()
48 u64 cmp = atomic_load(&head_, memory_order_acquire); in Pop()
56 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Pop()
68 atomic_uint64_t head_; member
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_lfstack.h29 atomic_store(&head_, 0, memory_order_relaxed); in Clear()
33 return (atomic_load(&head_, memory_order_relaxed) & kPtrMask) == 0; in Empty()
37 u64 cmp = atomic_load(&head_, memory_order_relaxed); in Push()
42 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Push()
49 u64 cmp = atomic_load(&head_, memory_order_acquire); in Pop()
57 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Pop()
69 atomic_uint64_t head_; member
/external/tensorflow/tensorflow/lite/micro/
Dsimple_memory_allocator.cc35 head_(buffer_head), in SimpleMemoryAllocator()
65 if (head_ != temp_) { in SetHeadBufferSize()
82 head_ = aligned_result + size; in SetHeadBufferSize()
83 temp_ = head_; in SetHeadBufferSize()
91 if (aligned_result < head_) { in AllocateFromTail()
93 const size_t missing_memory = head_ - aligned_result; in AllocateFromTail()
119 void SimpleMemoryAllocator::ResetTempAllocations() { temp_ = head_; } in ResetTempAllocations()
124 return head_ - buffer_head_; in GetHeadUsedBytes()
145 uint8_t* SimpleMemoryAllocator::head() const { return head_; } in head()
Dsimple_memory_allocator.h103 uint8_t* head_; variable
/external/pigweed/pw_containers/public/pw_containers/internal/
Dintrusive_list_impl.h98 constexpr List() : head_(end()) {} in List()
125 constexpr Item* before_begin() noexcept { return &head_; } in before_begin()
126 constexpr const Item* before_begin() const noexcept { return &head_; } in before_begin()
128 constexpr Item* begin() noexcept { return head_.next_; } in begin()
129 constexpr const Item* begin() const noexcept { return head_.next_; } in begin()
133 constexpr Item* end() noexcept { return &head_; } in end()
134 constexpr const Item* end() const noexcept { return &head_; } in end()
146 Item head_; variable
151 Item* current = &head_; in AssignFromIterator()
/external/tensorflow/tensorflow/core/util/
Dutil.cc48 head_(0), in MovingAverage()
57 head_ = 0; in Clear()
72 head_ = count_; in AddValue()
75 if (window_ == ++head_) { in AddValue()
76 head_ = 0; in AddValue()
79 sum_ -= data_[head_]; in AddValue()
81 data_[head_] = v; in AddValue()
Dpresized_cuckoo_map.h205 CuckooPathQueue() : head_(0), tail_(0) {} in CuckooPathQueue()
213 CuckooPathEntry& e = queue_[head_]; in pop_front()
214 head_ = (head_ + 1) % kMaxQueueSize; in pop_front()
218 bool empty() const { return head_ == tail_; } in empty()
220 bool full() const { return ((tail_ + 1) % kMaxQueueSize) == head_; } in full()
222 void reset() { head_ = tail_ = 0; } in reset()
226 int head_; variable
Dutil.h46 int head_; // Offset of the newest statistic in data_ variable
/external/libtextclassifier/native/lang_id/common/
Dregistry.h151 explicit ComponentRegistry(const char *name) : name_(name), head_(nullptr) {} in ComponentRegistry()
166 Cell *new_cell = new Cell(key, value, head_); in Add()
167 head_ = new_cell; in Add()
190 for (const Cell *c = head_; c!= nullptr; c = c->next()) { in GetComponentNames()
221 const Cell *c = head_; in FindCell()
232 Cell *head_; variable
/external/protobuf/src/google/protobuf/
Darena.cc226 head_->set_pos(head_->size() - (limit_ - ptr_)); in AllocateAlignedFallback()
228 head_ = arena_->NewBlock(head_, n); in AllocateAlignedFallback()
229 ptr_ = head_->Pointer(head_->pos()); in AllocateAlignedFallback()
230 limit_ = head_->Pointer(head_->size()); in AllocateAlignedFallback()
254 uint64 space_used = ptr_ - head_->Pointer(kBlockHeaderSize); in SpaceUsed()
256 for (Block* b = head_->next(); b; b = b->next()) { in SpaceUsed()
290 for (Block* b = serial->head_; b;) { in Free()
356 serial->head_ = b; in New()
/external/angle/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_ring.cc86 << ", head = " << rep.head_ << ", tail = " << rep.tail_ in operator <<()
114 Filler(CordRepRing* rep, index_type pos) : rep_(rep), head_(pos), pos_(pos) {} in Filler()
116 index_type head() const { return head_; } in head()
128 index_type head_; member in absl::cord_internal::CordRepRing::Filler
140 if (head_ >= capacity_ || tail_ >= capacity_) { in IsValid()
141 output << "head " << head_ << " and/or tail " << tail_ << "exceed capacity " in IsValid()
155 index_type head = head_; in IsValid()
252 head_ = 0; in Fill()
316 CordRep* child = entry_child(head_); in GetPrependBuffer()
317 size_t data_offset = entry_data_offset(head_); in GetPrependBuffer()
[all …]
Dcord_rep_ring.h118 index_type head() const { return head_; } in head()
123 index_type entries() const { return entries(head_, tail_); } in entries()
272 return (index == head_) ? begin_pos_ : entry_end_pos(retreat(index)); in entry_begin_pos()
344 ForEach(head_, tail_, std::forward<F>(f)); in ForEach()
478 index_type head_; variable
536 return (tail_ > head_) ? (index >= head_ && index < tail_) in IsValidIndex()
537 : (index >= head_ || index < tail_); in IsValidIndex()
549 return (offset == 0) ? Position{head_, 0} : FindSlow(head_, offset); in Find()
556 return (offset == 0) ? Position{head_, 0} : FindSlow(head, offset); in Find()
561 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head_, offset); in FindTail()
/external/rust/crates/grpcio-sys/grpc/src/core/lib/iomgr/
Dexec_ctx.h318 while (head_ != nullptr) { in ~ApplicationCallbackExecCtx()
319 auto* f = head_; in ~ApplicationCallbackExecCtx()
320 head_ = f->internal_next; in ~ApplicationCallbackExecCtx()
331 GPR_DEBUG_ASSERT(head_ == nullptr); in ~ApplicationCallbackExecCtx()
359 if (ctx->head_ == nullptr) { in Enqueue()
360 ctx->head_ = functor; in Enqueue()
378 grpc_experimental_completion_queue_functor* head_{nullptr};
/external/rust/crates/grpcio-sys/grpc/src/core/lib/gprpp/
Dmpscq.h41 MultiProducerSingleConsumerQueue() : head_{&stub_}, tail_(&stub_) {} in MultiProducerSingleConsumerQueue()
43 GPR_ASSERT(head_.Load(MemoryOrder::RELAXED) == &stub_); in ~MultiProducerSingleConsumerQueue()
64 Atomic<Node*> head_; member
Dmpscq.cc31 Node* prev = head_.Exchange(node, MemoryOrder::ACQ_REL); in Push()
61 Node* head = head_.Load(MemoryOrder::ACQUIRE); in PopAndCheckEnd()
/external/grpc-grpc/src/core/ext/filters/client_channel/resolver/dns/c_ares/
Dgrpc_ares_ev_driver_windows.cc401 GPR_ASSERT(head_ == nullptr); in ~SockToPolledFdMap()
407 new_node->next = head_; in AddNewSocket()
408 head_ = new_node; in AddNewSocket()
412 for (SockToPolledFdEntry* node = head_; node != nullptr; in LookupPolledFd()
423 GPR_ASSERT(head_ != nullptr); in RemoveEntry()
424 SockToPolledFdEntry** prev = &head_; in RemoveEntry()
425 for (SockToPolledFdEntry* node = head_; node != nullptr; in RemoveEntry()
494 SockToPolledFdEntry* head_ = nullptr; member in grpc_core::SockToPolledFdMap
/external/webp/src/enc/
Dbackward_references_cost_enc.c186 CostInterval* head_; member
240 DeleteIntervalList(manager, manager->head_); in CostManagerClear()
241 manager->head_ = NULL; in CostManagerClear()
258 manager->head_ = NULL; in CostManagerInit()
348 manager->head_ = next; in ConnectIntervals()
376 CostInterval* current = manager->head_; in UpdateCostAtIndex()
400 if (previous == NULL) previous = manager->head_; in PositionOrphanInterval()
412 ConnectIntervals(manager, current, manager->head_); in PositionOrphanInterval()
463 CostInterval* interval = manager->head_; in PushInterval()
/external/pigweed/pw_containers/
Dintrusive_list.cc73 Item* item = head_.next_; in size()
74 while (item != &head_) { in size()
/external/rust/crates/grpcio-sys/grpc/src/core/ext/filters/client_channel/resolver/dns/c_ares/
Dgrpc_ares_ev_driver_windows.cc707 ~SockToPolledFdMap() { GPR_ASSERT(head_ == nullptr); } in ~SockToPolledFdMap()
711 new_node->next = head_; in AddNewSocket()
712 head_ = new_node; in AddNewSocket()
716 for (SockToPolledFdEntry* node = head_; node != nullptr; in LookupPolledFd()
727 GPR_ASSERT(head_ != nullptr); in RemoveEntry()
728 SockToPolledFdEntry** prev = &head_; in RemoveEntry()
729 for (SockToPolledFdEntry* node = head_; node != nullptr; in RemoveEntry()
818 SockToPolledFdEntry* head_ = nullptr; member in grpc_core::SockToPolledFdMap
/external/minijail/
Dsyscall_filter_unittest.cc1085 head_ = new_filter_block(); in SetUp()
1090 free_block_list(head_); in TearDown()
1094 struct filter_block *head_; member in __anon9b0ce3870211::FileTest
1106 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1123 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1139 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1158 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1166 struct filter_block *curr_block = head_; in TEST_F()
1193 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1202 struct filter_block *curr_block = head_; in TEST_F()
[all …]
/external/vulkan-validation-layers/tests/
Dlayer_validation_tests.h644 const void *head_ = nullptr; variable
660 obj.pNext = head_; in Add()
661 head_ = &obj; in Add()

123