| /external/chromium/testing/gtest/samples/ |
| 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_; node != NULL; node = node->next_)
164 QueueNode<E>* head_; \/\/ The first node of the queue. member in class:Queue
[all...] |
| /external/gtest/samples/ |
| 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_; node != NULL; node = node->next_)
164 QueueNode<E>* head_; \/\/ The first node of the queue. member in class:Queue
[all...] |
| /external/protobuf/gtest/samples/ |
| 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_; node != NULL; node = node->next_)
164 QueueNode<E> * head_; \/\/ The first node of the queue. member in class:Queue
[all...] |
| /external/chromium/net/disk_cache/ |
| 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_;
|
| mem_rankings.h | 20 MemRankings() : head_(NULL), tail_(NULL) {}
37 MemEntryImpl* head_; member in class:disk_cache::MemRankings
|
| /external/chromium_org/net/disk_cache/ |
| 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_;
|
| mem_rankings.h | 19 MemRankings() : head_(NULL), tail_(NULL) {}
36 MemEntryImpl* head_; member in class:disk_cache::MemRankings
|
| /external/compiler-rt/lib/sanitizer_common/ |
| 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_org/media/mp4/ |
| offset_byte_queue.h | 49 int64 head() { return head_; }
50 int64 tail() { return head_ + size_; }
59 int64 head_; member in class:media::OffsetByteQueue
|
| offset_byte_queue.cc | 12 OffsetByteQueue::OffsetByteQueue() : buf_(NULL), size_(0), head_(0) {}
19 head_ = 0;
35 head_ += count;
51 if (max_offset < head_) return true;
56 Pop(max_offset - head_);
|
| /external/chromium_org/testing/gtest/samples/ |
| 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_; node != NULL; node = node->next_)
163 QueueNode<E>* head_; \/\/ The first node of the queue. member in class:Queue
[all...] |
| /ndk/sources/third_party/googletest/googletest/samples/ |
| 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_; node != NULL; node = node->next_)
163 QueueNode<E>* head_; \/\/ The first node of the queue. member in class:Queue
[all...] |
| /frameworks/ex/variablespeed/jni/ |
| ring_buffer.cc | 58 head_ = 0;
86 if (head_ + num_frames <= size_) {
87 memcpy(samples_ + head_ * num_channels_, samples,
89 head_ += num_frames;
91 int overhead = size_ - head_;
92 memcpy(samples_ + head_ * num_channels_, samples,
94 head_ = num_frames - overhead;
96 num_channels_ * head_ * sizeof(samples[0]));
|
| ring_buffer.h | 107 int head_; member in class:video_editing::RingBuffer
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| skiplist.h | 101 Node* const head_; member in class:leveldb::SkipList
130 // Return head_ if there is no such node.
134 // Return head_ if list is empty.
216 if (node_ == list_->head_) {
228 node_ = list_->head_->Next(0);
234 if (node_ == list_->head_) {
261 Node* x = head_;
283 Node* x = head_;
286 assert(x == head_ || compare_(x->key, key) < 0);
304 Node* x = head_;
[all...] |
| /external/chromium_org/v8/src/ |
| d8-debug.h | 58 head_(NULL), tail_(NULL) {}
89 RemoteDebuggerEvent* head_; member in class:v8::RemoteDebugger
|
| d8-debug.cc | 252 if (head_ == NULL) {
254 head_ = event;
267 ASSERT(head_ != NULL);
268 RemoteDebuggerEvent* result = head_;
269 head_ = head_->next();
270 if (head_ == NULL) {
|
| log.cc | 554 if (Succ(head_) == tail_) {
557 buffer_[head_] = *sample;
558 head_ = Succ(head_);
589 int head_; // Index to the buffer head. member in class:v8::internal::Profiler
645 head_(0),
[all...] |
| /external/v8/src/ |
| d8-debug.h | 60 head_(NULL), tail_(NULL) {}
90 RemoteDebuggerEvent* head_; member in class:v8::RemoteDebugger
|
| 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) {
|
| /external/chromium/sdch/open-vcdiff/src/gtest/src/ |
| 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_->element_
370 ListNode<E>* head_; \/\/ The first node of the list. member in class:testing::internal::List
[all...] |
| /sdk/emulator/qtools/ |
| trace_reader.cpp | 92 for (ptr = head_; ptr; prev = ptr, ptr = ptr->next) {
98 future->next = head_;
99 head_ = future;
139 head_ = NULL;
163 if (is_eof_ && head_ == NULL) {
175 if (head_) {
177 head_,
178 head_->bb->bb_rec.bb_num, head_->bb->bb_rec.start_time,
179 head_->bb->bb_rec.time_diff, head_->bb->bb_rec.repeat
[all...] |
| trace_reader_base.h | 184 Future *head_; member in class:BBReader
|
| /external/chromium_org/ppapi/tests/ |
| test_case.h | 260 : next_(head_),
263 head_ = this;
273 static TestCaseFactory* head_; member in class:TestCaseFactory
|
| testing_instance.cc | 19 TestCaseFactory* TestCaseFactory::head_ = NULL; member in class:TestCaseFactory
232 TestCaseFactory* iter = TestCaseFactory::head_;
256 TestCaseFactory* iter = TestCaseFactory::head_;
|
