/external/chromium_org/net/disk_cache/memory/ |
H A D | mem_rankings.h | 19 MemRankings() : head_(NULL), tail_(NULL) {} 36 MemEntryImpl* head_; member in class:disk_cache::MemRankings
|
/external/chromium_org/media/formats/common/ |
H A D | offset_byte_queue.h | 49 int64 head() { return head_; } 50 int64 tail() { return head_ + size_; } 59 int64 head_; member in class:media::OffsetByteQueue
|
/external/chromium_org/third_party/android_crazy_linker/src/src/ |
H A D | crazy_linker_library_list.h | 105 SharedLibrary* head_; member in class:crazy::LibraryList
|
/external/chromium_org/sandbox/linux/bpf_dsl/ |
H A D | cons.h | 23 const T& head() const { return head_; } 34 Cons(const T& head, List tail) : head_(head), tail_(tail) {} 37 T head_; member in class:sandbox::Cons
|
/external/chromium_org/net/websockets/ |
H A D | websocket_inflater.h | 87 size_t head_; member in class:net::WebSocketInflater::OutputBuffer
|
/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_org/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/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/chromium_org/ppapi/tests/ |
H A D | testing_instance.cc | 19 TestCaseFactory* TestCaseFactory::head_ = NULL; member in class:TestCaseFactory 243 TestCaseFactory* iter = TestCaseFactory::head_; 267 TestCaseFactory* iter = TestCaseFactory::head_;
|
H A D | test_case.h | 262 : next_(head_), 265 head_ = this; 275 static TestCaseFactory* head_; member in class:TestCaseFactory
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | 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/ |
H A D | log.cc | 608 if (Succ(head_) == tail_) { 611 buffer_[head_] = *sample; 612 head_ = Succ(head_); 642 int head_; // Index to the buffer head. member in class:v8::internal::Profiler 699 head_(0),
|