/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 41 : public std::iterator<std::forward_iterator_tag, NodeRef> { 42 using super = std::iterator<std::forward_iterator_tag, NodeRef>; 57 static_assert(std::is_pointer<NodeRef>::value, 58 "FIXME: Currently RNSuccIterator only supports NodeRef as " 64 PointerIntPair<NodeRef, 2, ItMode> Node; 76 NodeRef getNode() const { return Node.getPointer(); } 83 NodeRef getISucc(BlockT *BB) const { 84 NodeRef succ; 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT> [all...] |
SyntheticCountsUtils.h | 35 using NodeRef = typename CGT::NodeRef; 37 using SccTy = std::vector<NodeRef>; 40 using GetCountTy = function_ref<uint64_t(NodeRef)>; 41 using AddCountTy = function_ref<void(NodeRef, uint64_t)>;
|
Interval.h | 121 using NodeRef = Interval *; 124 static NodeRef getEntryNode(Interval *I) { return I; } 127 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 128 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 132 using NodeRef = Interval *; 135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; } 136 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); } 137 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
LoopIterator.h | 42 using NodeRef = std::pair<const Loop *, BasicBlock *>; 50 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> { 54 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>; 62 NodeRef operator*() const { return {L, *I}; } 66 bool operator()(NodeRef N) const { 75 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; [all...] |
CallGraph.h | 408 using NodeRef = CallGraphNode *; 411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; } 417 static ChildIteratorType child_begin(NodeRef N) { 421 static ChildIteratorType child_end(NodeRef N) { 427 using NodeRef = const CallGraphNode *; 431 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; } 438 static ChildIteratorType child_begin(NodeRef N) { 442 static ChildIteratorType child_end(NodeRef N) { 446 static ChildEdgeIteratorType child_edge_begin(NodeRef N) { 449 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
CallGraphTest.cpp | 20 typedef typename GraphTraits<Ty *>::NodeRef NodeRef; 27 static_assert(std::is_same<decltype(*I), NodeRef>::value, 29 static_assert(std::is_same<decltype(*X), NodeRef>::value, 31 static_assert(std::is_same<decltype(*E), NodeRef>::value, 34 NodeRef N = GraphTraits<Ty *>::getEntryNode(G); 36 auto S = GraphTraits<NodeRef>::child_begin(N); 37 auto F = GraphTraits<NodeRef>::child_end(N); 40 static_assert(std::is_same<decltype(*S), NodeRef>::value, 42 static_assert(std::is_same<decltype(*F), NodeRef>::value [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
BreadthFirstIterator.h | 40 template <typename NodeRef, unsigned SmallSize = 8> 41 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>; 46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 53 using NodeRef = typename GT::NodeRef; 57 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>; 67 inline bf_iterator(NodeRef Node) { 81 NodeRef Node = H.first [all...] |
PostOrderIterator.h | 63 template <typename NodeRef> 64 bool insertEdge(Optional<NodeRef> From, NodeRef To) { 69 template <typename NodeRef> void finishPostorder(NodeRef BB) {} 84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { 89 template <class NodeRef> void finishPostorder(NodeRef BB) { [all...] |
SCCIterator.h | 45 const std::vector<typename GT::NodeRef>, ptrdiff_t> { 46 using NodeRef = typename GT::NodeRef; 48 using SccTy = std::vector<NodeRef>; 53 NodeRef Node; ///< The current node pointer. 57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) 72 DenseMap<NodeRef, unsigned> nodeVisitNumbers; 75 std::vector<NodeRef> SCCNodeStack; 85 void DFSVisitOne(NodeRef N); 93 scc_iterator(NodeRef entryN) : visitNum(0) [all...] |
DepthFirstIterator.h | 69 template <typename NodeRef, unsigned SmallSize=8> 70 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> { 71 using BaseSet = SmallPtrSet<NodeRef, SmallSize>; 74 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } 78 void completed(NodeRef) {} 84 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 87 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 89 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 90 using NodeRef = typename GT::NodeRef; [all...] |
GraphTraits.h | 32 // typedef NodeRef - Type of Node token in the graph, which should 35 // dereference to a NodeRef. 37 // static NodeRef getEntryNode(const GraphType &) 40 // static ChildIteratorType child_begin(NodeRef) 41 // static ChildIteratorType child_end (NodeRef) 45 // typedef ...iterator nodes_iterator; - dereference to a NodeRef 55 // static ChildEdgeIteratorType child_edge_begin(NodeRef) 56 // static ChildEdgeIteratorType child_edge_end(NodeRef) 60 // static NodeRef edge_dest(EdgeRef) 72 using NodeRef = typename GraphType::UnknownGraphTypeError [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
CFG.h | 169 using NodeRef = BasicBlock *; 172 static NodeRef getEntryNode(BasicBlock *BB) { return BB; } 173 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 174 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 178 using NodeRef = const BasicBlock *; 181 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; } 183 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 184 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 193 using NodeRef = BasicBlock *; 196 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; [all...] |
Dominators.h | 187 using NodeRef = Node *; 191 static NodeRef getEntryNode(NodeRef N) { return N; } 192 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 193 static ChildIteratorType child_end(NodeRef N) { return N->end(); } 195 static nodes_iterator nodes_begin(NodeRef N) { 199 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); } 213 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
|
Type.h | 475 using NodeRef = Type *; 478 static NodeRef getEntryNode(Type *T) { return T; } 479 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); } 480 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); } 484 using NodeRef = const Type *; 487 static NodeRef getEntryNode(NodeRef T) { return T; } 488 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); } 489 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
MachineLoopInfo.h | 174 using NodeRef = const MachineLoop *; 177 static NodeRef getEntryNode(const MachineLoop *L) { return L; } 178 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 179 static ChildIteratorType child_end(NodeRef N) { return N->end(); } 183 using NodeRef = MachineLoop *; 186 static NodeRef getEntryNode(MachineLoop *L) { return L; } 187 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 188 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
|
MachineRegionInfo.h | 140 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>, 141 false, GraphTraits<FlatIt<NodeRef>>>; 143 static NodeRef getEntryNode(MachineRegionInfo *RI) { 160 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>, 161 false, GraphTraits<FlatIt<NodeRef>>>; 163 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
|
MachineDominators.h | 261 using NodeRef = Node *; 264 static NodeRef getEntryNode(NodeRef N) { return N; } 265 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 266 static ChildIteratorType child_end(NodeRef N) { return N->end(); } 284 static NodeRef getEntryNode(MachineDominatorTree *DT) {
|
MachineBasicBlock.h | [all...] |
/external/llvm/lib/Support/ |
IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { 28 return NodeRef(); 37 return NodeRef(); 40 NodeRef NR = path[l].subtree(path[l].offset - 1); 65 NodeRef NR = subtree(l); 75 NodeRef Path::getRightSibling(unsigned Level) const { 78 return NodeRef(); 87 return NodeRef(); 90 NodeRef NR = path[l].subtree(path[l].offset + 1); 110 NodeRef NR = subtree(l) [all...] |
/external/swiftshader/third_party/LLVM/lib/Support/ |
IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { 28 return NodeRef(); 37 return NodeRef(); 40 NodeRef NR = path[l].subtree(path[l].offset - 1); 65 NodeRef NR = subtree(l); 75 NodeRef Path::getRightSibling(unsigned Level) const { 78 return NodeRef(); 87 return NodeRef(); 90 NodeRef NR = path[l].subtree(path[l].offset + 1); 110 NodeRef NR = subtree(l) [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { 28 return NodeRef(); 37 return NodeRef(); 40 NodeRef NR = path[l].subtree(path[l].offset - 1); 65 NodeRef NR = subtree(l); 75 NodeRef Path::getRightSibling(unsigned Level) const { 78 return NodeRef(); 87 return NodeRef(); 90 NodeRef NR = path[l].subtree(path[l].offset + 1); 110 NodeRef NR = subtree(l) [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
SyntheticCountsUtils.cpp | 32 SmallPtrSet<NodeRef, 8> SCCNodes; 33 SmallVector<std::pair<NodeRef, EdgeRef>, 8> SCCEdges, NonSCCEdges; 57 DenseMap<NodeRef, uint64_t> AdditionalCounts;
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
Type.h | 443 typedef Type *NodeRef; 446 static NodeRef getEntryNode(Type *T) { return T; } 447 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); } 448 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); } 452 typedef const Type *NodeRef; 455 static NodeRef getEntryNode(NodeRef T) { return T; } 456 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); } 457 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
TestGraph.h | 237 typedef typename Graph<N>::NodeType *NodeRef; 240 static NodeRef getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } 241 static ChildIteratorType child_begin(NodeRef Node) { 244 static ChildIteratorType child_end(NodeRef Node) {
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
GraphWriter.h | 72 using NodeRef = typename GTraits::NodeRef; 77 static_assert(std::is_pointer<NodeRef>::value, 78 "FIXME: Currently GraphWriter requires the NodeRef type to be " 84 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { 161 bool isNodeHidden(NodeRef Node) { 165 void writeNode(NodeRef Node) { 238 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { 239 if (NodeRef TargetNode = *EI) {
|