| /external/chromium/net/disk_cache/ |
| H A D | mem_rankings.cc | 13 DCHECK(!head_ && !tail_);
17 if (head_)
18 head_->set_prev(node);
24 node->set_next(head_);
25 head_ = node;
32 if (head_ == node)
33 head_ = next;
55 return head_;
|
| H A D | mem_rankings.h | 20 MemRankings() : head_(NULL), tail_(NULL) {}
37 MemEntryImpl* head_; member in class:disk_cache::MemRankings
|
| /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/chromium/testing/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/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/libvpx/libvpx/third_party/googletest/src/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/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/src/ |
| H A D | d8-debug.h | 60 head_(NULL), tail_(NULL) {}
90 RemoteDebuggerEvent* head_; member in class:v8::RemoteDebugger
|
| H A D | d8-debug.cc | 249 if (head_ == NULL) {
251 head_ = event;
264 ASSERT(head_ != NULL);
265 RemoteDebuggerEvent* result = head_;
266 head_ = head_->next();
267 if (head_ == NULL) {
|
| H A D | log.cc | 94 if (Succ(head_) == tail_) {
97 buffer_[head_] = *sample;
98 head_ = Succ(head_);
129 int head_; // Index to the buffer head. member in class:v8::internal::Profiler
272 head_(0),
|
| /external/chromium/sdch/open-vcdiff/src/gtest/src/ |
| H A D | gtest-internal-inl.h | 196 List() : head_(NULL), last_(NULL), size_(0) {}
205 ListNode<E> * node = head_;
215 head_ = last_ = NULL;
227 ListNode<E> * Head() { return head_; }
228 const ListNode<E> * Head() const { return head_; }
242 head_ = last_ = new_node;
256 head_ = last_ = new_node;
259 new_node->next_ = head_;
260 head_ = new_node;
273 *result = head_
370 ListNode<E>* head_; // The first node of the list. member in class:testing::internal::List
[all...] |