|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
unittests/ADT/DirectedGraphTest.cpp 26 class DGTestNode;
References
include/llvm/ADT/DenseMapInfo.h 39 static inline T* getEmptyKey() {
41 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
45 static inline T* getTombstoneKey() {
47 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
51 static unsigned getHashValue(const T *PtrVal) {
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
include/llvm/ADT/DirectedGraph.h 31 explicit DGEdge(NodeType &N) : TargetNode(N) {}
32 explicit DGEdge(const DGEdge<NodeType, EdgeType> &E)
34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
45 const NodeType &getTargetNode() const { return TargetNode; }
46 NodeType &getTargetNode() {
62 NodeType &TargetNode;
77 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {}
78 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {}
80 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
80 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
84 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N) {
84 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N) {
91 bool operator==(const NodeType &N) const { return getDerived().isEqualTo(N); }
92 bool operator!=(const NodeType &N) const { return !operator==(N); }
107 bool findEdgesTo(const NodeType &N, SmallVectorImpl<EdgeType *> &EL) const {
123 bool hasEdgeTo(const NodeType &N) const {
139 bool isEqualTo(const NodeType &N) const { return this == &N; }
142 NodeType &getDerived() { return *static_cast<NodeType *>(this); }
143 const NodeType &getDerived() const {
149 const_iterator findEdgeTo(const NodeType &N) const {
165 using NodeListTy = SmallVector<NodeType *, 10>;
170 using DGraphType = DirectedGraph<NodeType, EdgeType>;
173 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); }
189 const NodeType &front() const { return *Nodes.front(); }
190 NodeType &front() { return *Nodes.front(); }
191 const NodeType &back() const { return *Nodes.back(); }
192 NodeType &back() { return *Nodes.back(); }
197 const_iterator findNode(const NodeType &N) const {
201 iterator findNode(const NodeType &N) {
207 bool addNode(NodeType &N) {
216 bool findIncomingEdgesToNode(const NodeType &N, SmallVectorImpl<EdgeType*> &EL) const {
219 for (auto *Node : Nodes) {
233 bool removeNode(NodeType &N) {
239 for (auto *Node : Nodes) {
255 bool connect(NodeType &Src, NodeType &Dst, EdgeType &E) {
255 bool connect(NodeType &Src, NodeType &Dst, EdgeType &E) {
include/llvm/Support/PointerLikeTypeTraits.h 56 static inline void *getAsVoidPointer(T *P) { return P; }
57 static inline T *getFromVoidPointer(void *P) { return static_cast<T *>(P); }
59 enum { NumLowBitsAvailable = detail::ConstantLog2<alignof(T)>::value };
91 typedef PointerLikeTypeTraits<T *> NonConst;
93 static inline const void *getAsVoidPointer(const T *P) {
96 static inline const T *getFromVoidPointer(const void *P) {
unittests/ADT/DirectedGraphTest.cpp 28 using DGTestNodeBase = DGNode<DGTestNode, DGTestEdge>;
29 using DGTestEdgeBase = DGEdge<DGTestNode, DGTestEdge>;
30 using DGTestBase = DirectedGraph<DGTestNode, DGTestEdge>;
40 DGTestEdge(DGTestNode &N) : DGTestEdgeBase(N) {}
56 using NodeRef = DGTestNode *;
58 static DGTestNode *DGTestGetTargetNode(DGEdge<DGTestNode, DGTestEdge> *P) {
58 static DGTestNode *DGTestGetTargetNode(DGEdge<DGTestNode, DGTestEdge> *P) {
65 mapped_iterator<DGTestNode::iterator, decltype(&DGTestGetTargetNode)>;
66 using ChildEdgeIteratorType = DGTestNode::iterator;
83 struct GraphTraits<DGTestGraph *> : public GraphTraits<DGTestNode *> {
96 DGTestNode N1, N2, N3;
129 DGTestNode N4;
141 DGTestNode N1, N2, N3;
187 DGTestNode N1, N2, N3;
211 DGTestNode N1, N2, N3;
249 DGTestNode N1, N2, N3, N4;
271 using NodeListTy = SmallPtrSet<DGTestNode *, 3>;
usr/include/c++/7.4.0/type_traits 1983 { typedef _Up type; };
utils/unittest/googletest/include/gtest/gtest-printers.h 276 static ::std::string Format(const ToPrint& value) {
351 const T1& value, const T2& /* other_operand */) {
351 const T1& value, const T2& /* other_operand */) {
352 return FormatForComparison<T1, T2>::Format(value);
352 return FormatForComparison<T1, T2>::Format(value);
366 void UniversalPrint(const T& value, ::std::ostream* os);
373 const C& container, ::std::ostream* os) {
377 for (typename C::const_iterator it = container.begin();
439 const T& value, ::std::ostream* os) {
455 void PrintTo(const T& value, ::std::ostream* os) {
478 DefaultPrintTo(IsContainerTest<T>(0), is_pointer<T>(), value, os);
699 static void Print(const T& value, ::std::ostream* os) {
784 static void Print(const T& value, ::std::ostream* os) {
856 typedef T T1;
983 internal::UniversalTersePrinter<T>::Print(value, &ss);
utils/unittest/googletest/include/gtest/gtest.h 1377 const T1& lhs, const T2& rhs) {
1377 const T1& lhs, const T2& rhs) {
1389 const T1& lhs,
1390 const T2& rhs) {
1419 const T1& lhs,
1420 const T2& rhs) {
utils/unittest/googletest/include/gtest/internal/gtest-internal.h 94 ::std::string PrintToString(const T& value);
933 typename C::iterator* /* it */ = NULL,
934 typename C::const_iterator* /* const_it */ = NULL) {