Searched refs:getPrev (Results 1 – 12 of 12) sorted by relevance
26 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()34 node_base_type *Prev = N.getPrev(); in removeImpl()45 node_base_type *Prev = First.getPrev(); in removeRangeImpl()46 node_base_type *Final = Last.getPrev(); in removeRangeImpl()65 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl()68 First.getPrev()->setNext(&Last); in transferBeforeImpl()69 Last.setPrev(First.getPrev()); in transferBeforeImpl()72 node_base_type &Prev = *Next.getPrev(); in transferBeforeImpl()
63 ilist_node_impl *getPrev() { in getPrev() function64 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()70 const ilist_node_impl *getPrev() const { in getPrev() function71 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()182 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function183 return N.getPrev(); in getPrev()191 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function192 return N.getPrev(); in getPrev()235 bool empty() const { return this == this->getPrev(); } in empty()
44 template <class T> static void decrement(T *&I) { I = Access::getPrev(*I); }48 template <class T> static void increment(T *&I) { I = Access::getPrev(*I); }141 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();145 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
29 ilist_node_base *getPrev() const { return Prev; } in getPrev() function43 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
30 NodeTy *getPrev() { return Prev; }31 const NodeTy *getPrev() const { return Prev; }59 NodeTy *Prev = this->getPrev();70 const NodeTy *Prev = this->getPrev();
56 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev() function58 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); } in getPrev() function97 return ilist_traits<NodeTy>::getPrev(Head); in ensureHead()213 NodePtr = Traits::getPrev(NodePtr);397 return *this->getPrev(getTail());401 return *this->getPrev(getTail());411 NodeTy *PrevNode = this->getPrev(CurNode);436 NodeTy *PrevNode = this->getPrev(Node);484 NodeTy *First = &*first, *Prev = this->getPrev(First);485 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);[all …]
57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev() function59 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); } in getPrev() function98 return ilist_traits<NodeTy>::getPrev(Head); in ensureHead()243 NodePtr = Traits::getPrev(NodePtr);397 return *this->getPrev(getTail());401 return *this->getPrev(getTail());411 NodeTy *PrevNode = this->getPrev(CurNode);436 NodeTy *PrevNode = this->getPrev(Node);505 NodeTy *First = &*first, *Prev = this->getPrev(First);506 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);[all …]
33 NodeTy *getPrev() { return Prev; }34 const NodeTy *getPrev() const { return Prev; }
126 X *getPrev() { return Prev; } // expected-note{{member is declared here}} in getPrev() function in test2::ilist_half_node138 static X *getPrev(X *N) { return N->getPrev(); } in getPrev() function143 static X *getPrev(X *N) { return N->getPrev(); } // \ in getPrev() function
61 IndexListEntry* getPrev() { return prev; } in getPrev() function62 const IndexListEntry* getPrev() const { return prev; } in getPrev() function281 return SlotIndex(entry().getPrev(), SlotIndex::STORE);289 return SlotIndex(entry().getPrev(), getSlot());383 return indexListHead->getPrev();388 return indexListHead->getPrev();406 return getTail()->getPrev();411 return getTail()->getPrev();417 IndexListEntry *prev = itr->getPrev();660 prevEntry = nextEntry->getPrev();
39 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
134 IndexListEntry *start = curEntry->getPrev(); in renumberIndexes()