Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DIListNodeBaseTest.cpp21 EXPECT_EQ(nullptr, A.getPrev()); in TEST()
26 EXPECT_EQ(nullptr, TA.getPrev()); in TEST()
35 EXPECT_EQ(&B, A.getPrev()); in TEST()
37 EXPECT_EQ(nullptr, B.getPrev()); in TEST()
43 EXPECT_EQ(&B, A.getPrev()); in TEST()
52 EXPECT_EQ(&TB, TA.getPrev()); in TEST()
60 EXPECT_EQ(&TB, TA.getPrev()); in TEST()
74 EXPECT_EQ(&B, A.getPrev()); in TEST()
79 EXPECT_EQ(&B, A.getPrev()); in TEST()
88 EXPECT_EQ(&TB, TA.getPrev()); in TEST()
[all …]
H A DIListBaseTest.cpp36 EXPECT_EQ(&A, S.getPrev()); in TYPED_TEST()
37 EXPECT_EQ(&S, A.getPrev()); in TYPED_TEST()
43 EXPECT_EQ(&B, S.getPrev()); in TYPED_TEST()
44 EXPECT_EQ(&A, B.getPrev()); in TYPED_TEST()
45 EXPECT_EQ(&S, A.getPrev()); in TYPED_TEST()
65 EXPECT_EQ(&B, S.getPrev()); in TYPED_TEST()
66 EXPECT_EQ(&S, B.getPrev()); in TYPED_TEST()
74 EXPECT_EQ(&S, S.getPrev()); in TYPED_TEST()
96 EXPECT_EQ(&D, S.getPrev()); in TYPED_TEST()
97 EXPECT_EQ(&A, D.getPrev()); in TYPED_TEST()
[all …]
H A DIListSentinelTest.cpp31 using NodeAccess::getPrev;
37 EXPECT_EQ(&S, LocalAccess::getPrev(S)); in TEST()
54 EXPECT_EQ(nullptr, LocalAccess::getPrev(N)); in TEST()
/llvm-project-15.0.7/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.h62 ilist_node_impl *getPrev() { in getPrev() function
63 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
70 const ilist_node_impl *getPrev() const { in getPrev() function
71 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
189 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function
190 return N.getPrev(); in getPrev()
200 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function
201 return N.getPrev(); in getPrev()
249 bool empty() const { return this == this->getPrev(); } in empty()
H A Dilist_node_base.h28 ilist_node_base *getPrev() const { return Prev; } in getPrev() function
42 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
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); }
153 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
157 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
/llvm-project-15.0.7/clang/test/CXX/class.access/class.friend/
H A Dp1.cpp128 X *getPrev() { return Prev; } // expected-note{{member is declared here}} in getPrev() function in test2::ilist_half_node
140 static X *getPrev(X *N) { return N->getPrev(); } in getPrev() function
145 static X *getPrev(X *N) { return N->getPrev(); } // \ in getPrev() function