| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_list.h | 33 first_ = last_ = nullptr; in clear()
43 first_ = last_ = x; in push_back()
47 last_->next = x; in push_back()
48 last_ = x; in push_back()
56 first_ = last_ = x; in push_front()
69 last_ = nullptr; in pop_front()
75 Item *back() { return last_; } in back()
76 const Item *back() const { return last_; } in back()
85 l->last_->next = first_; in append_front()
99 last_->next = l->first_; in append_back()
[all …]
|
| /external/v8/src/regexp/ |
| D | regexp-parser.h | 27 BufferedZoneList() : list_(NULL), last_(NULL) {} in BufferedZoneList()
33 if (last_ != NULL) { in Add()
37 list_->Add(last_, zone); in Add()
39 last_ = value; in Add()
43 DCHECK(last_ != NULL); in last()
44 return last_; in last()
48 DCHECK(last_ != NULL); in RemoveLast()
49 T* result = last_; in RemoveLast()
51 last_ = list_->RemoveLast(); in RemoveLast()
53 last_ = NULL; in RemoveLast()
[all …]
|
| /external/v8/testing/gtest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
96 head_ = last_ = NULL; in Clear()
109 QueueNode<E>* Last() { return last_; } in Last()
110 const QueueNode<E>* Last() const { return last_; } in Last()
120 head_ = last_ = new_node; in Enqueue()
123 last_->next_ = new_node; in Enqueue()
124 last_ = new_node; in Enqueue()
140 last_ = NULL; in Dequeue()
164 QueueNode<E>* last_; // The last node of the queue. variable
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
96 head_ = last_ = NULL; in Clear()
109 QueueNode<E>* Last() { return last_; } in Last()
110 const QueueNode<E>* Last() const { return last_; } in Last()
120 head_ = last_ = new_node; in Enqueue()
123 last_->next_ = new_node; in Enqueue()
124 last_ = new_node; in Enqueue()
140 last_ = NULL; in Dequeue()
164 QueueNode<E>* last_; // The last node of the queue. variable
|
| /external/googletest/googletest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
96 head_ = last_ = NULL; in Clear()
109 QueueNode<E>* Last() { return last_; } in Last()
110 const QueueNode<E>* Last() const { return last_; } in Last()
120 head_ = last_ = new_node; in Enqueue()
123 last_->next_ = new_node; in Enqueue()
124 last_ = new_node; in Enqueue()
140 last_ = NULL; in Dequeue()
164 QueueNode<E>* last_; // The last node of the queue. variable
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
96 head_ = last_ = NULL; in Clear()
109 QueueNode<E>* Last() { return last_; } in Last()
110 const QueueNode<E>* Last() const { return last_; } in Last()
120 head_ = last_ = new_node; in Enqueue()
123 last_->next_ = new_node; in Enqueue()
124 last_ = new_node; in Enqueue()
140 last_ = NULL; in Dequeue()
164 QueueNode<E>* last_; // The last node of the queue. variable
|
| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
97 head_ = last_ = NULL; in Clear()
110 QueueNode<E>* Last() { return last_; } in Last()
111 const QueueNode<E>* Last() const { return last_; } in Last()
121 head_ = last_ = new_node; in Enqueue()
124 last_->next_ = new_node; in Enqueue()
125 last_ = new_node; in Enqueue()
141 last_ = NULL; in Dequeue()
165 QueueNode<E>* last_; // The last node of the queue. variable
|
| /external/ImageMagick/Magick++/lib/Magick++/ |
| D | STL.h | 1848 void channelMaskImages(InputIterator first_,InputIterator last_, in channelMaskImages() argument
1855 for (InputIterator iter = first_; iter != last_; ++iter) in channelMaskImages()
1897 bool linkImages(InputIterator first_,InputIterator last_) in linkImages() argument
1908 for (InputIterator iter = first_; iter != last_; ++iter) in linkImages()
1931 void restoreChannelMaskImages(InputIterator first_,InputIterator last_, in restoreChannelMaskImages() argument
1938 for (InputIterator iter = first_; iter != last_; ++iter) in restoreChannelMaskImages()
1951 void unlinkImages(InputIterator first_,InputIterator last_) in unlinkImages() argument
1956 for (InputIterator iter = first_; iter != last_; ++iter) in unlinkImages()
1971 void animateImages( InputIterator first_,InputIterator last_) in animateImages() argument
1973 if (linkImages(first_,last_) == false) in animateImages()
[all …]
|
| /external/v8/src/profiler/ |
| D | unbound-queue-inl.h | 27 divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);
47 if (divider_ == base::Acquire_Load(&last_)) return false;
57 Node*& next = reinterpret_cast<Node*>(last_)->next;
59 base::Release_Store(&last_, reinterpret_cast<base::AtomicWord>(next));
69 return base::NoBarrier_Load(÷r_) == base::NoBarrier_Load(&last_);
75 if (divider_ == base::Acquire_Load(&last_)) return NULL;
|
| D | unbound-queue.h | 39 base::AtomicWord last_; // Node* variable
|
| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_vector.h | 31 , last_() { in Vector()
44 last_ = 0; in Reset()
97 T *last_; variable
102 if (size <= (uptr)(last_ - begin_)) { in EnsureSize()
106 uptr cap0 = last_ - begin_; in EnsureSize()
119 last_ = begin_ + cap; in EnsureSize()
|
| /external/webrtc/webrtc/test/ |
| D | histogram.cc | 26 SampleInfo(const std::string& name) : name_(name), last_(-1), total_(0) {} in SampleInfo()
28 int last_; // Last added sample. member
65 ptr->last_ = sample; in HistogramAdd()
77 return it->second.last_; in LastHistogramSample()
92 it.second.last_ = -1; in ClearHistograms()
|
| /external/google-breakpad/src/common/ |
| D | memory.h | 65 last_(NULL), in PageAllocator()
106 for (PageHeader* header = last_; header; header = header->next) { in OwnsPointer()
135 header->next = last_; in GetNPages()
137 last_ = header; in GetNPages()
145 for (PageHeader *cur = last_; cur; cur = next) { in FreeAll()
157 PageHeader *last_; variable
|
| /external/v8/src/interpreter/ |
| D | bytecode-peephole-optimizer.cc | 16 : next_stage_(next_stage), last_(Bytecode::kIllegal, BytecodeSourceInfo()) { in BytecodePeepholeOptimizer()
62 next_stage_->Write(&last_); in Flush()
68 last_.set_bytecode(Bytecode::kIllegal); in InvalidateLast()
72 return last_.bytecode() != Bytecode::kIllegal; in LastIsValid()
80 last_ = *node; in SetLast()
113 return (!last_.source_info().is_valid() || in CanElideLastBasedOnSourcePosition()
|
| D | bytecode-peephole-optimizer.h | 53 BytecodeNode* last() { return &last_; } in NON_EXPORTED_BASE()
56 BytecodeNode last_; in NON_EXPORTED_BASE() local
|
| /external/vixl/test/ |
| D | test-runner.cc | 35 vixl::Test* vixl::Test::last_ = NULL; member in vixl::Test
63 VIXL_ASSERT(last_ == NULL); in Test()
66 last_->next_ = this; in Test()
68 last_ = this; in Test()
|
| D | test-runner.h | 45 static Test* last() { return last_; } in last()
76 static Test* last_; variable
|
| /external/vulkan-validation-layers/demos/smoke/ |
| D | Simulation.cpp | 147 pos_ += unit_dir_ * (t - last_); in evaluate()
148 last_ = t; in evaluate()
166 last_ = time_start_; in new_segment()
180 float last_; member in __anonaac04e910211::RandomCurve
|
| /external/v8/src/crankshaft/ |
| D | hydrogen.h | 71 HInstruction* last() const { return last_; } in last()
72 void set_last(HInstruction* instr) { last_ = instr; } in set_last()
214 HInstruction* last_; variable
|
| D | hydrogen.cc | 252 last_(NULL), in HBasicBlock()
329 first_ = last_ = entry; in AddInstruction()
331 instr->InsertAfter(last_); in AddInstruction()
|
| /external/bison/ |
| D | ChangeLog-2012 | 11410 (name_, rhs_, prhs_, rline_, token_number_, eof_, last_, nnts_)
|