Home
last modified time | relevance | path

Searched refs:getPrev (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_base.h23 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()
31 node_base_type *Prev = N.getPrev(); in removeImpl()
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
43 node_base_type *Final = Last.getPrev(); in removeRangeImpl()
62 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
69 node_base_type &Prev = *Next.getPrev(); in transferBeforeImpl()
H A Dilist_node.h114 ilist_node_impl *getPrev() { in getPrev() function
115 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
122 const ilist_node_impl *getPrev() const { in getPrev() function
123 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
259 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function
260 return N.getPrev(); in getPrev()
270 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function
271 return N.getPrev(); in getPrev()
319 bool empty() const { return this == this->getPrev(); } in empty()
H A Dilist_iterator.h44 template <class T> static void decrement(T *&I) { I = Access::getPrev(*I); }
49 template <class T> static void increment(T *&I) { I = Access::getPrev(*I); }
183 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
187 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
339 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
345 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
H A Dilist_node_base.h27 NodeBase *getPrev() const { return Prev; } in getPrev() function
41 NodeBase *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dlist.h43 T *getPrev(T *X) const { return X->Prev; } in getPrev() function
82 T *getPrev(T *X) const { in getPrev() function
269 using IntrusiveList<T>::getPrev;
277 DCHECK_EQ(getPrev(First), nullptr); in push_front()
289 T *Prev = getPrev(Y); in insert()
327 T *Prev = getPrev(X); in remove()
334 CHECK_EQ(getPrev(Next), X); in remove()