Home
last modified time | relevance | path

Searched refs:first_ (Results 1 – 22 of 22) sorted by relevance

/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_list.h32 first_ = last_ = 0; in clear()
42 first_ = last_ = x; in push_back()
55 first_ = last_ = x; in push_front()
58 x->next = first_; in push_front()
59 first_ = x; in push_front()
66 first_ = first_->next; in pop_front()
67 if (first_ == 0) in pop_front()
72 Item *front() { return first_; } in front()
82 l->last_->next = first_; in append_front()
83 first_ = l->first_; in append_front()
[all …]
/external/webrtc/src/system_wrappers/source/
Dlist_no_stl.cc49 first_(0), in ListWrapper()
71 return !first_ && !last_; in Empty()
113 return Erase(first_); in PopFront()
123 return first_; in First()
215 first_ = new_item; in InsertBefore()
236 first_ = next_item; in Erase()
262 first_ = item; in PushBackImpl()
278 first_ = item; in PushFrontImpl()
284 item->next_ = first_; in PushFrontImpl()
285 first_->prev_ = item; in PushFrontImpl()
[all …]
Dmap_no_stl.cc51 first_(0), in MapNoStl()
79 MapNoStlItem* item = first_; in Insert()
83 first_ = new_item; in Insert()
97 if (item == first_) in Insert()
99 first_ = new_item; in Insert()
119 return first_; in First()
175 MapNoStlItem* item = first_; in Locate()
199 first_ = next_item; in Remove()
Dmap_no_stl.h63 MapNoStlItem* first_; variable
Dlist_no_stl.h72 ListNoStlItem* first_; variable
/external/v8/src/
Dunbound-queue-inl.h26 first_ = new Node(Record());
27 divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);
33 while (first_ != NULL) DeleteFirst();
39 Node* tmp = first_;
40 first_ = tmp->next;
61 while (first_ != reinterpret_cast<Node*>(base::Acquire_Load(&divider_))) {
Dhydrogen-removable-simulates.cc15 : zone_(zone), mergelist_(2, zone), first_(true), mode_(NORMAL) { } in State()
58 if (first_) { in Process()
59 first_ = false; in Process()
99 state->first_ = true; in Finish()
107 first_(other.first_), in State()
158 bool first_; member in v8::internal::State
Dunbound-queue.h37 Node* first_; variable
Dcode-stubs.cc484 explicit SimpleListPrinter(OStream& os) : os_(os), first_(true) {} in SimpleListPrinter()
487 if (first_) { in Add()
488 first_ = false; in Add()
497 bool first_; member in v8::internal::SimpleListPrinter
Djsregexp.h298 OutSet() : first_(0), remaining_(NULL), successors_(NULL) { } in OutSet()
315 : first_(first), remaining_(remaining), successors_(NULL) { } in OutSet()
316 uint32_t first_; variable
Djsregexp.cc4464 : first_(true), in TableEntryHeaderPrinter()
4467 if (first_) { in Call()
4468 first_ = false; in Call()
4486 bool first_; member in v8::internal::TableEntryHeaderPrinter
4495 first_(true) {} in AttributePrinter()
4497 if (first_) { in PrintSeparator()
4498 first_ = false; in PrintSeparator()
4516 bool first_; member in v8::internal::AttributePrinter
5586 OutSet* result = new(zone) OutSet(first_, remaining_); in Extend()
5595 first_ |= (1 << value); in Set()
[all …]
Dhydrogen.h46 HInstruction* first() const { return first_; } in first()
193 HInstruction* first_; variable
Dhydrogen.cc73 first_(NULL), in HBasicBlock()
141 if (first_ == NULL) { in AddInstruction()
152 first_ = last_ = entry; in AddInstruction()
343 DCHECK(IsLoopHeader() || first_ == NULL); in RegisterPredecessor()
/external/openfst/src/include/fst/
Dstring-weight.h137 void Init() { first_ = 0; } in Init()
140 void Clear() { first_ = 0; rest_.clear(); } in Clear()
142 size_t Size() const { return first_ ? rest_.size() + 1 : 0; } in Size()
145 if (first_) in PushFront()
146 rest_.push_front(first_); in PushFront()
147 first_ = l; in PushFront()
151 if (!first_) in PushBack()
152 first_ = l; in PushBack()
158 L first_; // first label in string (0 if empty)
168 : first_(w.first_), rest_(w.rest_), init_(true), in StringWeightIterator()
[all …]
Dsparse-tuple-weight.h113 ReadType(strm, &first_); in Read()
119 WriteType(strm, first_); in Write()
173 first_.first = kNoKey; in Init()
180 if (first_.first == kNoKey) in Size()
192 if (first_.first == kNoKey) {
193 first_ = p;
218 Pair first_; variable
233 : first_(w.first_), rest_(w.rest_), init_(true), in SparseTupleWeightIterator()
238 return first_.first == SparseTupleWeight<W, K>::kNoKey; in Done()
243 const Pair& Value() const { return init_ ? first_ : *iter_; } in Value()
[all …]
Dbi-table.h489 ErasableBiTable() : first_(0) {} in ErasableBiTable()
496 id_ref = id2entry_.size() + first_;
504 const T &FindEntry(I s) const { return id2entry_[s - first_]; } in FindEntry()
509 T &entry = id2entry_[s - first_]; in Erase()
513 id2entry_[s - first_] = empty_entry_; in Erase()
516 ++first_; in Erase()
524 I first_; // I of first element in the deque; variable
/external/vixl/test/
Dtest-runner.cc33 vixl::Test* vixl::Test::first_ = NULL; member in vixl::Test
57 if (first_ == NULL) { in Test()
59 first_ = this; in Test()
Dtest-runner.h44 static Test* first() { return first_; } in first()
69 static Test* first_; variable
/external/webrtc/src/system_wrappers/interface/
Dlist_wrapper.h101 ListItem* first_; variable
/external/v8/test/cctest/
Dcctest.h250 prev_ = first_; in RegisterThreadedTest()
251 first_ = this; in RegisterThreadedTest()
257 RegisterThreadedTest* current = first_; in nth()
269 static RegisterThreadedTest* first_;
Dcctest.cc235 RegisterThreadedTest *RegisterThreadedTest::first_ = NULL; member in RegisterThreadedTest
/external/google-breakpad/src/testing/include/gmock/
Dgmock-matchers.h2654 first_(first), count_(count) {}
2662 return MakeMatcher(new ElementsAreMatcherImpl<Container>(first_, count_));
2666 const T* const first_;