| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
87 QueueNode<E>* node = head_; in Clear()
97 head_ = last_ = NULL; in Clear()
106 QueueNode<E>* Head() { return head_; } in Head()
107 const QueueNode<E>* Head() const { return head_; } in Head()
121 head_ = last_ = new_node; in Enqueue()
137 const QueueNode<E>* const old_head = head_; in Dequeue()
138 head_ = head_->next_; in Dequeue()
156 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) { in Map()
164 QueueNode<E>* head_; // The first node of the queue.
|
| /external/v8/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/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 | 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/vulkan-validation-layers/tests/gtest-1.7.0/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/v8/src/ |
| D | locked-queue-inl.h | 24 head_ = new Node();
25 CHECK(head_ != nullptr);
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 | 42 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} in FutexWaitList()
50 head_ = node; in AddNode()
63 head_ = node->next_; in RemoveNode()
200 FutexWaitListNode* node = wait_list_.Pointer()->head_; in Wake()
227 FutexWaitListNode* node = wait_list_.Pointer()->head_; in NumWaitersForTesting()
|
| D | utils.h | 1622 ThreadedList() : head_(nullptr), tail_(&head_) {}
1631 head_ = nullptr;
1632 tail_ = &head_;
1677 Iterator begin() { return Iterator(&head_); }
1680 ConstIterator begin() const { return ConstIterator(&head_); }
1697 bool is_empty() const { return head_ == nullptr; }
1712 T* head_;
|
| D | locked-queue.h | 34 Node* head_; variable
|
| D | futex-emulation.h | 76 FutexWaitListNode* head_; variable
|
| D | log.cc | 561 if (Succ(head_) == static_cast<int>(base::NoBarrier_Load(&tail_))) { in Insert()
564 buffer_[head_] = *sample; in Insert()
565 head_ = Succ(head_); in Insert()
596 int head_; // Index to the buffer head. member in v8::internal::Profiler
664 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 | 195 CuckooPathQueue() : head_(0), tail_(0) {} in CuckooPathQueue()
203 CuckooPathEntry& e = queue_[head_]; in pop_front()
204 head_ = (head_ + 1) % kMaxQueueSize; in pop_front()
208 bool empty() const { return head_ == tail_; } in empty()
210 bool full() const { return ((tail_ + 1) % kMaxQueueSize) == head_; } in full()
212 void reset() { head_ = tail_ = 0; } in reset()
216 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 | 75 Check* this_head = this->head_; in Equals()
76 Check* that_head = that->head_; in Equals()
92 Check* that_head = that->head_; in Merge()
99 head_ = head_->next; in Merge()
105 while (head_ != that_head) { in Merge()
107 DCHECK_NOT_NULL(head_); in Merge()
109 head_ = head_->next; in Merge()
117 Check* head = new (zone->New(sizeof(Check))) Check(node, head_); in AddCheck()
142 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupCheck()
153 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupBoundsCheckFor()
|
| D | branch-elimination.cc | 246 BranchCondition* other_condition = other.head_; in Merge()
252 head_ = head_->next; in Merge()
258 while (head_ != other_condition) { in Merge()
262 head_ = head_->next; in Merge()
274 BranchCondition(condition, is_true, head_); in AddCondition()
285 for (BranchCondition* current = head_; current != nullptr; in LookupCondition()
298 BranchCondition* this_condition = head_; in operator ==()
299 BranchCondition* other_condition = other.head_; in operator ==()
|
| D | loop-variable-optimizer.cc | 107 head_ = new (zone) Constraint(left, kind, right, head_); in Add()
119 const Constraint* other_limit = other->head_; in Merge()
125 head_ = head_->next(); in Merge()
131 while (head_ != other_limit) { in Merge()
135 head_ = head_->next(); in Merge()
139 const Constraint* head() const { return head_; } in head()
144 : head_(other->head_), limit_count_(other->limit_count_) {} in VariableLimits()
146 const Constraint* head_ = nullptr; member in v8::internal::compiler::LoopVariableOptimizer::VariableLimits
|
| D | redundancy-elimination.h | 40 EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {} in EffectPathChecks()
44 Check* head_; variable
|
| D | branch-elimination.h | 57 : head_(head), condition_count_(condition_count) {} in NON_EXPORTED_BASE()
59 BranchCondition* head_; in NON_EXPORTED_BASE() local
|
| /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 | 896 head_ = new_filter_block(); in SetUp()
901 free_block_list(head_); in TearDown()
905 struct filter_block *head_; member in FileTest
915 int res = compile_file("policy", policy_file, head_, &arg_blocks_, &labels_, in TEST_F()
932 int res = compile_file("policy", policy_file, head_, &arg_blocks_, &labels_, in TEST_F()
948 int res = compile_file("policy", policy_file, head_, &arg_blocks_, &labels_, in TEST_F()
967 int res = compile_file("policy", policy_file, head_, &arg_blocks_, &labels_, in TEST_F()
975 struct filter_block *curr_block = head_; in TEST_F()
1002 int res = compile_file("policy", policy_file, head_, &arg_blocks_, &labels_, in TEST_F()
1011 struct filter_block *curr_block = head_; in TEST_F()
|
| /external/v8/src/arm/ |
| D | simulator-arm.cc | 5917 Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {} in GlobalMonitor()
5928 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
5939 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStoreExcl_Locked()
5952 return head_ == processor || processor->next_ || processor->prev_; in IsProcessorInLinkedList_Locked()
5960 if (head_) { in PrependProcessor_Locked()
5961 head_->prev_ = processor; in PrependProcessor_Locked()
5964 processor->next_ = head_; in PrependProcessor_Locked()
5965 head_ = processor; in PrependProcessor_Locked()
5977 head_ = processor->next_; in RemoveProcessor()
|
| D | simulator-arm.h | 532 Processor* head_; variable
|
| /external/protobuf/gtest/ |
| D | configure | 9175 …exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0…
14146 …exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Z…
|