reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
41 static void deleteNode(NodeTy *V) { delete V; } 65 void addNodeToList(NodeTy *) {} 66 void removeNodeFromList(NodeTy *) {} 82 struct ilist_node_traits : ilist_alloc_traits<NodeTy>, 83 ilist_callback_traits<NodeTy> {}; 89 struct ilist_traits : public ilist_node_traits<NodeTy> {}; 96 template <class T> T &make(); 106 static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0); 136 static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0); 144 static const bool value = HasGetNext<TraitsT, NodeT>::value || 146 HasCreateNode<TraitsT, NodeT>::value; 389 : public iplist_impl<simple_ilist<T, Options...>, ilist_traits<T>> { 389 : public iplist_impl<simple_ilist<T, Options...>, ilist_traits<T>> {include/llvm/ADT/ilist_node.h
150 typename ilist_detail::compute_node_options<T, Options...>::type> {
include/llvm/ADT/ilist_node_options.h108 typedef T value_type; 109 typedef T *pointer; 110 typedef T &reference; 111 typedef const T *const_pointer; 112 typedef const T &const_reference; 122 typedef node_options<T, extract_sentinel_tracking<Options...>::value,include/llvm/ADT/simple_ilist.h
79 : ilist_detail::compute_node_options<T, Options...>::type::list_base_type, 81 typename ilist_detail::compute_node_options<T, Options...>::type> { 85 typename ilist_detail::compute_node_options<T, Options...>::type;unittests/ADT/IListTest.cpp
19 struct Node : ilist_node<Node> { 24 Node(const Node&) = default; 29 ilist<Node> List; 30 List.push_back(new Node(1)); 35 List.push_back(new Node(2)); 40 const ilist<Node> &ConstList = List; 47 Node L1Nodes[] = {Node(0), Node(1)}; 48 Node L2Nodes[] = {Node(0), Node(1)}; 49 ilist<Node> L1, L2, L3; 59 L3.push_back(new Node(7)); 60 L3.cloneFrom(L1, [](const Node &N) { return new Node(N); }); 78 ilist<Node> List; 79 List.push_back(new Node(1)); 88 List.push_back(new Node(2)); 89 List.push_back(new Node(3)); 98 ilist<Node> L; 99 Node N0(0); 100 Node N1(1); 114 ilist<Node> L; 115 Node N0(0); 116 Node N1(1); 130 ilist<Node> List; 137 ilist<Node>::iterator E = List.end(); 144 List.push_back(new Node(1)); 146 Node *N = &*List.begin(); 154 List.push_back(new Node(5)); 155 List.push_back(new Node(6)); 164 static_assert(!ilist_detail::HasObsoleteCustomization<Empty, Node>::value, 169 Node *getNext(Node *); 169 Node *getNext(Node *); 172 static_assert(ilist_detail::HasGetNext<GetNext, Node>::value, 174 static_assert(ilist_detail::HasObsoleteCustomization<GetNext, Node>::value, 178 static_assert(!ilist_detail::HasGetNext<Empty, Node>::value, 183 Node *createSentinel(); 189 ilist_detail::HasObsoleteCustomization<CreateSentinel, Node>::value,utils/unittest/googletest/include/gtest/gtest-printers.h
407 T* p, ::std::ostream* os) { 416 if (IsTrue(ImplicitlyConvertible<T*, const void*>::value)) {utils/unittest/googletest/include/gtest/gtest.h
1475 T* rhs) {