| /external/libchrome/base/task/sequence_manager/ |
| D | lazily_deallocated_deque.h | 64 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/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
86 QueueNode<E>* node = head_; in Clear()
96 head_ = last_ = NULL; in Clear()
105 QueueNode<E>* Head() { return head_; } in Head()
106 const QueueNode<E>* Head() const { return head_; } in Head()
120 head_ = last_ = new_node; in Enqueue()
136 const QueueNode<E>* const old_head = head_; in Dequeue()
137 head_ = head_->next_; in Dequeue()
155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) { in Map()
163 QueueNode<E>* head_; // The first node of the queue.
|
| /external/googletest/googletest/samples/ |
| D | sample3-inl.h | 76 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/v8/src/ |
| D | locked-queue-inl.h | 24 head_ = new Node();
25 CHECK_NOT_NULL(head_);
26 tail_ = head_;
34 Node* cur_node = head_;
61 old_head = head_;
62 Node* const next_node = head_->next.Value();
65 head_ = next_node;
75 return head_->next.Value() == nullptr;
82 Node* const next_node = head_->next.Value();
|
| D | futex-emulation.cc | 44 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} in FutexWaitList()
52 head_ = node; in AddNode()
65 head_ = node->next_; in RemoveNode()
247 FutexWaitListNode* node = wait_list_.Pointer()->head_; in Wake()
272 FutexWaitListNode* node = wait_list_.Pointer()->head_; in NumWaitersForTesting()
|
| D | locked-queue.h | 34 Node* head_; variable
|
| D | utils.h | 1620 ThreadedList() : head_(nullptr), tail_(&head_) {} in ThreadedList()
1629 head_ = nullptr; in Clear()
1630 tail_ = &head_; in Clear()
1676 Iterator begin() { return Iterator(&head_); } in begin()
1679 ConstIterator begin() const { return ConstIterator(&head_); } in begin()
1696 bool is_empty() const { return head_ == nullptr; } in is_empty()
1711 T* head_;
|
| D | futex-emulation.h | 93 FutexWaitListNode* head_; variable
|
| D | log.cc | 788 if (Succ(head_) == static_cast<int>(base::Relaxed_Load(&tail_))) { in Insert()
791 buffer_[head_] = *sample; in Insert()
792 head_ = Succ(head_); in Insert()
823 int head_; // Index to the buffer head. member in v8::internal::Profiler
890 head_(0), in Profiler()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_lfstack.h | 29 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/core/util/ |
| D | util.cc | 48 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()
|
| D | presized_cuckoo_map.h | 205 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
|
| D | util.h | 46 int head_; // Offset of the newest statistic in data_ variable
|
| /external/v8/src/compiler/ |
| D | redundancy-elimination.cc | 88 Check* this_head = this->head_; in Equals()
89 Check* that_head = that->head_; in Equals()
105 Check* that_head = that->head_; in Merge()
112 head_ = head_->next; in Merge()
118 while (head_ != that_head) { in Merge()
120 DCHECK_NOT_NULL(head_); in Merge()
122 head_ = head_->next; in Merge()
130 Check* head = new (zone->New(sizeof(Check))) Check(node, head_); in AddCheck()
185 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupCheck()
196 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupBoundsCheckFor()
|
| D | redundancy-elimination.h | 42 EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {} in EffectPathChecks()
46 Check* head_; variable
|
| /external/libtextclassifier/lang_id/common/ |
| D | registry.h | 151 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/grpc-grpc/src/core/ext/filters/client_channel/resolver/dns/c_ares/ |
| D | grpc_ares_ev_driver_windows.cc | 401 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/ |
| D | backward_references_cost_enc.c | 186 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/minijail/ |
| D | syscall_filter_unittest.cc | 1098 head_ = new_filter_block(); in SetUp()
1103 free_block_list(head_); in TearDown()
1107 struct filter_block *head_; member in __anon96e970e90211::FileTest
1119 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1136 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1152 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1171 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1179 struct filter_block *curr_block = head_; in TEST_F()
1206 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1215 struct filter_block *curr_block = head_; in TEST_F()
[all …]
|
| /external/v8/src/ppc/ |
| D | simulator-ppc.cc | 4243 Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {} in GlobalMonitor()
4254 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
4265 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStoreExcl_Locked()
4278 return head_ == processor || processor->next_ || processor->prev_; in IsProcessorInLinkedList_Locked()
4286 if (head_) { in PrependProcessor_Locked()
4287 head_->prev_ = processor; in PrependProcessor_Locked()
4290 processor->next_ = head_; in PrependProcessor_Locked()
4291 head_ = processor; in PrependProcessor_Locked()
4303 head_ = processor->next_; in RemoveProcessor()
|
| D | simulator-ppc.h | 425 Processor* head_; variable
|
| /external/v8/src/arm/ |
| D | simulator-arm.h | 490 Processor* head_; variable
|
| D | simulator-arm.cc | 6022 Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {} in GlobalMonitor()
6033 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
6044 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStoreExcl_Locked()
6057 return head_ == processor || processor->next_ || processor->prev_; in IsProcessorInLinkedList_Locked()
6065 if (head_) { in PrependProcessor_Locked()
6066 head_->prev_ = processor; in PrependProcessor_Locked()
6069 processor->next_ = head_; in PrependProcessor_Locked()
6070 head_ = processor; in PrependProcessor_Locked()
6082 head_ = processor->next_; in RemoveProcessor()
|
| /external/v8/src/arm64/ |
| D | simulator-arm64.cc | 5815 Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {} in GlobalMonitor()
5825 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
5836 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStoreExcl_Locked()
5849 return head_ == processor || processor->next_ || processor->prev_; in IsProcessorInLinkedList_Locked()
5857 if (head_) { in PrependProcessor_Locked()
5858 head_->prev_ = processor; in PrependProcessor_Locked()
5861 processor->next_ = head_; in PrependProcessor_Locked()
5862 head_ = processor; in PrependProcessor_Locked()
5874 head_ = processor->next_; in RemoveProcessor()
|
| D | simulator-arm64.h | 2272 Processor* head_; variable
|