| /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/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/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 | 41 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} in FutexWaitList()
49 head_ = node; in AddNode()
62 head_ = node->next_; in RemoveNode()
200 FutexWaitListNode* node = wait_list_.Pointer()->head_; in Wake()
225 FutexWaitListNode* node = wait_list_.Pointer()->head_; in NumWaitersForTesting()
|
| D | locked-queue.h | 34 Node* head_; variable
|
| D | futex-emulation.h | 75 FutexWaitListNode* head_; variable
|
| D | utils.h | 1607 ThreadedList() : head_(nullptr), tail_(&head_) {}
1616 head_ = nullptr;
1617 tail_ = &head_;
1643 Iterator begin() { return Iterator(&head_); }
1660 bool is_empty() const { return head_ == nullptr; }
1675 T* head_;
|
| 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/v8/src/compiler/ |
| D | redundancy-elimination.cc | 67 Check* this_head = this->head_; in Equals()
68 Check* that_head = that->head_; in Equals()
84 Check* that_head = that->head_; in Merge()
91 head_ = head_->next; in Merge()
97 while (head_ != that_head) { in Merge()
99 DCHECK_NOT_NULL(head_); in Merge()
101 head_ = head_->next; in Merge()
109 Check* head = new (zone->New(sizeof(Check))) Check(node, head_); in AddCheck()
127 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupCheck()
|
| D | branch-elimination.cc | 238 BranchCondition* other_condition = other.head_; in Merge()
244 head_ = head_->next; in Merge()
250 while (head_ != other_condition) { in Merge()
254 head_ = head_->next; in Merge()
266 BranchCondition(condition, is_true, head_); in AddCondition()
277 for (BranchCondition* current = head_; current != nullptr; in LookupCondition()
290 BranchCondition* this_condition = head_; in operator ==()
291 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 | 39 EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {} in EffectPathChecks()
43 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/libtextclassifier/common/ |
| D | registry.h | 134 explicit ComponentRegistry(const char *name) : name_(name), head_(nullptr) {} in ComponentRegistry()
149 Cell *new_cell = new Cell(key, value, head_); in Add()
150 head_ = new_cell; in Add()
195 Cell *c = head_; in FindCell()
206 Cell *head_; variable
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| D | cons.h | 76 Cell(const T& head, List<T> tail) : head_(head), tail_(std::move(tail)) {} in Cell()
79 const T& head() const { return head_; } in head()
85 T head_;
|
| /external/webp/src/enc/ |
| D | backward_references_enc.c | 722 CostInterval* head_; member
793 DeleteIntervalList(manager, manager->head_); in CostManagerClear()
794 manager->head_ = NULL; in CostManagerClear()
815 manager->head_ = NULL; in CostManagerInit()
996 manager->head_ = next; in ConnectIntervals()
1023 CostInterval* current = manager->head_; in UpdateCostPerIndex()
1046 if (previous == NULL) previous = manager->head_; in PositionOrphanInterval()
1058 ConnectIntervals(manager, current, manager->head_); in PositionOrphanInterval()
1136 CostInterval* interval = manager->head_; in PushInterval()
|
| /external/minijail/ |
| D | syscall_filter_unittest.cc | 937 head_ = new_filter_block(); in SetUp()
942 free_block_list(head_); in TearDown()
946 struct filter_block *head_; member in FileTest
960 policy_file, head_, &arg_blocks_, &labels_, USE_RET_KILL, NO_LOGGING, 0); in TEST_F()
967 struct filter_block *curr_block = head_; in TEST_F()
995 policy_file, head_, &arg_blocks_, &labels_, USE_RET_KILL, NO_LOGGING, 0); in TEST_F()
1003 struct filter_block *curr_block = head_; in TEST_F()
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/ |
| D | configure | 8985 …exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0…
13970 …exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Z…
|
| /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…
|
| /external/protobuf/ |
| D | configure | 9720 …exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0…
14691 …exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Z…
|
| /external/libcap-ng/libcap-ng-0.7/m4/ |
| D | libtool.m4 | 4581 …_LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-…
4756 …_LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-…
|