| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 20 template<typename NodeTy>
22 template <typename NodeTy> struct ilist_embedded_sentinel_traits;
23 template <typename NodeTy> struct ilist_half_embedded_sentinel_traits;
27 template<typename NodeTy>
29 friend struct ilist_traits<NodeTy>;
30 friend struct ilist_half_embedded_sentinel_traits<NodeTy>;
31 NodeTy *Prev;
33 NodeTy *getPrev() { return Prev; }
34 const NodeTy *getPrev() const { return Prev; }
35 void setPrev(NodeTy *P) { Prev = P;
[all...] |
| ilist.h | 49 template<typename NodeTy, typename Traits> class iplist;
50 template<typename NodeTy> class ilist_iterator;
55 template<typename NodeTy>
57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); }
58 static NodeTy *getNext(NodeTy *N) { return N->getNext(); }
59 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); }
60 static const NodeTy *getNext(const NodeTy *N) { return N->getNext();
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ilist_node.h | 20 template<typename NodeTy>
25 template<typename NodeTy>
27 friend struct ilist_traits<NodeTy>;
28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
36 template<typename NodeTy>
42 template<typename NodeTy>
43 class ilist_node : private ilist_half_node<NodeTy> {
[all...] |
| ilist.h | 48 template<typename NodeTy, typename Traits> class iplist;
49 template<typename NodeTy> class ilist_iterator;
54 template<typename NodeTy>
56 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); }
57 static NodeTy *getNext(NodeTy *N) { return N->getNext(); }
58 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); }
59 static const NodeTy *getNext(const NodeTy *N) { return N->getNext();
[all...] |
| /external/llvm/unittests/Analysis/ |
| CallGraphTest.cpp | 20 typedef typename GraphTraits<Ty *>::NodeType NodeTy;
27 static_assert(std::is_same<decltype(*I), NodeTy &>::value,
29 static_assert(std::is_same<decltype(*X), NodeTy &>::value,
31 static_assert(std::is_same<decltype(*E), NodeTy &>::value,
34 NodeTy *N = GraphTraits<Ty *>::getEntryNode(G);
36 auto S = GraphTraits<NodeTy *>::child_begin(N);
37 auto F = GraphTraits<NodeTy *>::child_end(N);
40 static_assert(std::is_same<decltype(*S), NodeTy *>::value,
42 static_assert(std::is_same<decltype(*F), NodeTy *>::value,
|
| /external/llvm/include/llvm/IR/ |
| SymbolTableListTraits.h | 33 template <typename NodeTy> class ilist_iterator;
34 template <typename NodeTy, typename Traits> class iplist;
37 template <typename NodeTy>
39 : public ilist_embedded_sentinel_traits<NodeTy> {};
45 template <typename NodeTy> struct SymbolTableListParentType {};
65 template <typename NodeTy> class SymbolTableList;
119 template <typename NodeTy>
120 class SymbolTableList : public iplist<NodeTy, SymbolTableListTraits<NodeTy>> {};
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| ilist_node.h | 27 template<typename NodeTy>
240 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
242 template <typename NodeTy, typename ParentTy, class... Options>
243 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
248 /// Forward to NodeTy::getParent().
254 return static_cast<const NodeTy *>(this)->getParent();
261 NodeTy *getPrevNode() {
265 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
266 return List.getPrevNode(*static_cast<NodeTy *>(this));
269 const NodeTy *getPrevNode() const
[all...] |
| ilist.h | 41 template <typename NodeTy> struct ilist_alloc_traits {
42 static void deleteNode(NodeTy *V) { delete V; }
57 template <typename NodeTy> struct ilist_noalloc_traits {
58 static void deleteNode(NodeTy *V) {}
65 template <typename NodeTy> struct ilist_callback_traits {
66 void addNodeToList(NodeTy *) {}
67 void removeNodeFromList(NodeTy *) {}
83 template <typename NodeTy>
84 struct ilist_node_traits : ilist_alloc_traits<NodeTy>,
85 ilist_callback_traits<NodeTy> {};
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| ilist_node.h | 27 template<typename NodeTy>
240 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
242 template <typename NodeTy, typename ParentTy, class... Options>
243 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
248 /// Forward to NodeTy::getParent().
254 return static_cast<const NodeTy *>(this)->getParent();
261 NodeTy *getPrevNode() {
265 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
266 return List.getPrevNode(*static_cast<NodeTy *>(this));
269 const NodeTy *getPrevNode() const
[all...] |
| ilist.h | 41 template <typename NodeTy> struct ilist_alloc_traits {
42 static void deleteNode(NodeTy *V) { delete V; }
57 template <typename NodeTy> struct ilist_noalloc_traits {
58 static void deleteNode(NodeTy *V) {}
65 template <typename NodeTy> struct ilist_callback_traits {
66 void addNodeToList(NodeTy *) {}
67 void removeNodeFromList(NodeTy *) {}
83 template <typename NodeTy>
84 struct ilist_node_traits : ilist_alloc_traits<NodeTy>,
85 ilist_callback_traits<NodeTy> {};
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| ilist_node.h | 27 template<typename NodeTy>
240 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
242 template <typename NodeTy, typename ParentTy, class... Options>
243 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
248 /// Forward to NodeTy::getParent().
254 return static_cast<const NodeTy *>(this)->getParent();
261 NodeTy *getPrevNode() {
265 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
266 return List.getPrevNode(*static_cast<NodeTy *>(this));
269 const NodeTy *getPrevNode() const
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| ilist.h | 41 template <typename NodeTy> struct ilist_alloc_traits {
42 static void deleteNode(NodeTy *V) { delete V; }
57 template <typename NodeTy> struct ilist_noalloc_traits {
58 static void deleteNode(NodeTy *V) {}
65 template <typename NodeTy> struct ilist_callback_traits {
66 void addNodeToList(NodeTy *) {}
67 void removeNodeFromList(NodeTy *) {}
83 template <typename NodeTy>
84 struct ilist_node_traits : ilist_alloc_traits<NodeTy>,
85 ilist_callback_traits<NodeTy> {};
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| ilist_node.h | 254 /// Requires \c NodeTy to have \a getParent() to find the parent node, and the
256 template <typename NodeTy, typename ParentTy, class... Options>
257 class ilist_node_with_parent : public ilist_node<NodeTy, Options...> {
262 /// Forward to NodeTy::getParent().
268 return static_cast<const NodeTy *>(this)->getParent();
275 NodeTy *getPrevNode() {
279 getNodeParent()->*(ParentTy::getSublistAccess((NodeTy *)nullptr));
280 return List.getPrevNode(*static_cast<NodeTy *>(this));
284 const NodeTy *getPrevNode() const {
289 NodeTy *getNextNode()
[all...] |
| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 20 template <class NodeTy>
21 void IDFCalculator<NodeTy>::calculate(
67 for (auto SuccIter = GraphTraits<NodeTy>::child_begin(BB),
68 End = GraphTraits<NodeTy>::child_end(BB);
|
