/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_lfstack.h | 29 atomic_store(&head_, 0, memory_order_relaxed); 33 return (atomic_load(&head_, memory_order_relaxed) & kPtrMask) == 0; 37 u64 cmp = atomic_load(&head_, memory_order_relaxed); 42 if (atomic_compare_exchange_weak(&head_, &cmp, xch, 49 u64 cmp = atomic_load(&head_, memory_order_acquire); 57 if (atomic_compare_exchange_weak(&head_, &cmp, xch, 69 atomic_uint64_t head_; member in struct:__sanitizer::LFStack
|
/external/v8/src/ |
H A 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();
|
H A D | locked-queue.h | 34 Node* head_; member in class:v8::internal::BASE_EMBEDDED
|
H A D | futex-emulation.cc | 42 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} 50 head_ = node; 63 head_ = node->next_; 200 FutexWaitListNode* node = wait_list_.Pointer()->head_; 227 FutexWaitListNode* node = wait_list_.Pointer()->head_;
|
H A D | futex-emulation.h | 76 FutexWaitListNode* head_; member in class:v8::internal::FutexWaitList
|
H A 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_;
|
H A D | log.cc | 561 if (Succ(head_) == static_cast<int>(base::NoBarrier_Load(&tail_))) { 564 buffer_[head_] = *sample; 565 head_ = Succ(head_); 596 int head_; // Index to the buffer head. member in class:v8::internal::Profiler 664 head_(0),
|
/external/google-breakpad/src/testing/gtest/samples/ |
H A D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 86 QueueNode<E>* node = head_; 96 head_ = last_ = NULL; 105 QueueNode<E>* Head() { return head_; } 106 const QueueNode<E>* Head() const { return head_; } 120 head_ = last_ = new_node; 136 const QueueNode<E>* const old_head = head_; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; nod 163 QueueNode<E>* head_; // The first node of the queue. member in class:Queue [all...] |
/external/googletest/googletest/samples/ |
H A D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 86 QueueNode<E>* node = head_; 96 head_ = last_ = NULL; 105 QueueNode<E>* Head() { return head_; } 106 const QueueNode<E>* Head() const { return head_; } 120 head_ = last_ = new_node; 136 const QueueNode<E>* const old_head = head_; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; nod 163 QueueNode<E>* head_; // The first node of the queue. member in class:Queue [all...] |
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 78 Queue() : head_(NULL), last_(NULL), size_(0) {} 87 QueueNode<E>* node = head_; 97 head_ = last_ = NULL; 106 QueueNode<E>* Head() { return head_; } 107 const QueueNode<E>* Head() const { return head_; } 121 head_ = last_ = new_node; 137 const QueueNode<E>* const old_head = head_; 138 head_ = head_->next_; 156 for (const QueueNode<E>* node = head_; nod 164 QueueNode<E>* head_; // The first node of the queue. member in class:Queue [all...] |
/external/v8/testing/gtest/samples/ |
H A D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 86 QueueNode<E>* node = head_; 96 head_ = last_ = NULL; 105 QueueNode<E>* Head() { return head_; } 106 const QueueNode<E>* Head() const { return head_; } 120 head_ = last_ = new_node; 136 const QueueNode<E>* const old_head = head_; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; nod 163 QueueNode<E>* head_; // The first node of the queue. member in class:Queue [all...] |
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
H A D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 86 QueueNode<E>* node = head_; 96 head_ = last_ = NULL; 105 QueueNode<E>* Head() { return head_; } 106 const QueueNode<E>* Head() const { return head_; } 120 head_ = last_ = new_node; 136 const QueueNode<E>* const old_head = head_; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; nod 163 QueueNode<E>* head_; // The first node of the queue. member in class:Queue [all...] |
/external/libtextclassifier/common/ |
H A D | registry.h | 134 explicit ComponentRegistry(const char *name) : name_(name), head_(nullptr) {} 149 Cell *new_cell = new Cell(key, value, head_); 150 head_ = new_cell; 189 // Finds Cell for indicated key in the singly-linked list pointed to by head_. 195 Cell *c = head_; 206 Cell *head_; member in class:libtextclassifier::nlp_core::internal::ComponentRegistry
|
/external/libchrome/sandbox/linux/bpf_dsl/ |
H A D | cons.h | 76 Cell(const T& head, List<T> tail) : head_(head), tail_(std::move(tail)) {} 79 const T& head() const { return head_; } 85 T head_; member in class:sandbox::cons::Cell
|
/external/v8/src/compiler/ |
H A D | redundancy-elimination.cc | 75 Check* this_head = this->head_; 76 Check* that_head = that->head_; 92 Check* that_head = that->head_; 99 head_ = head_->next; 105 while (head_ != that_head) { 107 DCHECK_NOT_NULL(head_); 109 head_ = head_->next; 117 Check* head = new (zone->New(sizeof(Check))) Check(node, head_); [all...] |
H A D | branch-elimination.cc | 246 BranchCondition* other_condition = other.head_; 252 head_ = head_->next; 258 while (head_ != other_condition) { 262 head_ = head_->next; 274 BranchCondition(condition, is_true, head_); 285 for (BranchCondition* current = head_; current != nullptr; 298 BranchCondition* this_condition = head_; 299 BranchCondition* other_condition = other.head_; [all...] |
H A D | loop-variable-optimizer.cc | 107 head_ = new (zone) Constraint(left, kind, right, head_); 119 const Constraint* other_limit = other->head_; 125 head_ = head_->next(); 131 while (head_ != other_limit) { 135 head_ = head_->next(); 139 const Constraint* head() const { return head_; } 144 : head_(othe 146 const Constraint* head_ = nullptr; member in class:v8::internal::compiler::LoopVariableOptimizer::VariableLimits [all...] |
H A D | redundancy-elimination.h | 40 EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {} 44 Check* head_; member in class:v8::internal::compiler::final::final
|
H A D | branch-elimination.h | 57 : head_(head), condition_count_(condition_count) {} 59 BranchCondition* head_; member in class:v8::internal::compiler::final::ControlPathConditions
|
/external/webp/src/enc/ |
H A D | backward_references_enc.c | 722 CostInterval* head_; member in struct:__anon25842 793 DeleteIntervalList(manager, manager->head_); 794 manager->head_ = NULL; 815 manager->head_ = NULL; 996 manager->head_ = next; 1023 CostInterval* current = manager->head_; 1046 if (previous == NULL) previous = manager->head_; 1058 ConnectIntervals(manager, current, manager->head_); 1136 CostInterval* interval = manager->head_;
|
/external/minijail/ |
H A D | syscall_filter_unittest.cc | 937 head_ = new_filter_block(); 942 free_block_list(head_); 946 struct filter_block *head_; member in class:FileTest 960 policy_file, head_, &arg_blocks_, &labels_, USE_RET_KILL, NO_LOGGING, 0); 967 struct filter_block *curr_block = head_; 995 policy_file, head_, &arg_blocks_, &labels_, USE_RET_KILL, NO_LOGGING, 0); 1000 * labels between |head_| and |arg_blocks_| match. 1003 struct filter_block *curr_block = head_;
|
/external/v8/src/arm/ |
H A D | simulator-arm.cc | 5917 Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {} 5928 for (Processor* iter = head_; iter; iter = iter->next_) { 5939 for (Processor* iter = head_; iter; iter = iter->next_) { 5952 return head_ == processor || processor->next_ || processor->prev_; 5960 if (head_) { 5961 head_->prev_ = processor; 5964 processor->next_ = head_; 5965 head_ = processor; 5977 head_ = processor->next_;
|
H A D | simulator-arm.h | 532 Processor* head_;
|