| /external/llvm-project/llvm/unittests/ADT/ |
| D | IListNodeBaseTest.cpp | 21 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()
39 EXPECT_EQ(nullptr, C.getPrev()); in TEST()
43 EXPECT_EQ(&B, A.getPrev()); in TEST()
45 EXPECT_EQ(nullptr, B.getPrev()); in TEST()
47 EXPECT_EQ(nullptr, C.getPrev()); in TEST()
52 EXPECT_EQ(&TB, TA.getPrev()); in TEST()
54 EXPECT_EQ(nullptr, TB.getPrev()); in TEST()
[all …]
|
| D | IListBaseTest.cpp | 36 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()
69 EXPECT_EQ(nullptr, A.getPrev()); in TYPED_TEST()
74 EXPECT_EQ(&S, S.getPrev()); in TYPED_TEST()
76 EXPECT_EQ(nullptr, B.getPrev()); in TYPED_TEST()
[all …]
|
| D | IListSentinelTest.cpp | 31 using NodeAccess::getPrev;
37 EXPECT_EQ(&S, LocalAccess::getPrev(S)); in TEST()
54 EXPECT_EQ(nullptr, LocalAccess::getPrev(N)); in TEST()
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | ilist_base.h | 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()
|
| D | ilist_node.h | 63 ilist_node_impl *getPrev() { in getPrev() function
64 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()
182 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function
183 return N.getPrev(); in getPrev()
191 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function
192 return N.getPrev(); in getPrev()
235 bool empty() const { return this == this->getPrev(); } in empty()
|
| D | ilist_node_base.h | 29 ilist_node_base *getPrev() const { return Prev; } in getPrev() function
43 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
|
| D | ilist_iterator.h | 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();
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | ilist_base.h | 23 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()
|
| D | ilist_node.h | 61 ilist_node_impl *getPrev() { in getPrev() function
62 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
69 const ilist_node_impl *getPrev() const { in getPrev() function
70 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
188 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function
189 return N.getPrev(); in getPrev()
199 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function
200 return N.getPrev(); in getPrev()
248 bool empty() const { return this == this->getPrev(); } in empty()
|
| D | ilist_node_base.h | 28 ilist_node_base *getPrev() const { return Prev; } in getPrev() function
42 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
|
| D | ilist_iterator.h | 44 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); }
154 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
158 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
|
| /external/llvm-project/llvm/include/llvm/ADT/ |
| D | ilist_base.h | 23 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()
|
| D | ilist_node.h | 61 ilist_node_impl *getPrev() { in getPrev() function
62 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
69 const ilist_node_impl *getPrev() const { in getPrev() function
70 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()
188 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function
189 return N.getPrev(); in getPrev()
199 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function
200 return N.getPrev(); in getPrev()
248 bool empty() const { return this == this->getPrev(); } in empty()
|
| D | ilist_node_base.h | 28 ilist_node_base *getPrev() const { return Prev; } in getPrev() function
42 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
|
| D | ilist_iterator.h | 44 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();
|
| /external/opencensus-java/impl_core/src/main/java/io/opencensus/implcore/trace/internal/ |
| D | ConcurrentIntrusiveList.java | 77 element.getNext() == null && element.getPrev() == null && element != head, in addElement()
97 element.getNext() != null || element.getPrev() != null || element == head, in removeElement()
100 if (element.getPrev() == null) { in removeElement()
111 CheckerFrameworkUtils.castNonNull(element.getPrev()).setNext(null); in removeElement()
114 CheckerFrameworkUtils.castNonNull(element.getPrev()).setNext(element.getNext()); in removeElement()
115 CheckerFrameworkUtils.castNonNull(element.getNext()).setPrev(element.getPrev()); in removeElement()
172 T getPrev(); in getPrev() method
|
| /external/llvm/include/llvm/ADT/ |
| D | ilist.h | 57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev() function
59 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); } in getPrev() function
98 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 …]
|
| D | ilist_node.h | 33 NodeTy *getPrev() { return Prev; }
34 const NodeTy *getPrev() const { return Prev; }
|
| /external/clang/test/CXX/class.access/class.friend/ |
| D | p1.cpp | 126 X *getPrev() { return Prev; } // expected-note{{member is declared here}} in getPrev() function in test2::ilist_half_node
138 static X *getPrev(X *N) { return N->getPrev(); } in getPrev() function
143 static X *getPrev(X *N) { return N->getPrev(); } // \ in getPrev() function
|
| /external/llvm-project/clang/test/CXX/class.access/class.friend/ |
| D | p1.cpp | 128 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
|
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/generic/ |
| D | JsrInstruction.java | 63 while (ih.getPrev() != null) { in physicalSuccessor()
64 ih = ih.getPrev(); in physicalSuccessor()
|
| D | InstructionList.java | 433 final InstructionHandle prev = ih.getPrev(); in insert()
633 final InstructionHandle prev = start.getPrev(); in move()
706 last = next.getPrev(); in remove()
743 remove(ih.getPrev(), ih.getNext()); in delete()
770 remove(from.getPrev(), to.getNext()); in delete()
818 for (InstructionHandle ih = end; ih != null; ih = ih.getPrev()) { in findInstruction2()
1110 for (InstructionHandle ih = end; ih != null; ih = ih.getPrev()) { in dispose()
|
| D | InstructionHandle.java | 66 public final InstructionHandle getPrev() { in getPrev() method in InstructionHandle
|
| /external/opencensus-java/impl_core/src/test/java/io/opencensus/implcore/trace/internal/ |
| D | ConcurrentIntrusiveListTest.java | 114 public FakeElement getPrev() { in getPrev() method in ConcurrentIntrusiveListTest.FakeElement
|
| /external/opencensus-java/impl_core/src/main/java/io/opencensus/implcore/trace/ |
| D | RecordEventsSpanImpl.java | 454 public RecordEventsSpanImpl getPrev() { in getPrev() method in RecordEventsSpanImpl
|