| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| D | 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,
64 PointerIntPair<NodeRef, 2, ItMode> Node;
76 NodeRef getNode() const { return Node.getPointer(); } in getNode()
83 NodeRef getISucc(BlockT *BB) const { in getISucc()
84 NodeRef succ; in getISucc()
102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
106 inline RNSuccIterator(NodeRef node) in RNSuccIterator()
[all …]
|
| D | LoopIterator.h | 42 using NodeRef = std::pair<const Loop *, BasicBlock *>; member
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 { in operator()
75 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode()
77 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
85 static ChildIteratorType child_end(NodeRef Node) { in child_end()
|
| D | 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); }
|
| D | 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 …]
|
| D | SyntheticCountsUtils.h | 35 using NodeRef = typename CGT::NodeRef; variable
37 using SccTy = std::vector<NodeRef>;
40 using GetCountTy = function_ref<uint64_t(NodeRef)>;
41 using AddCountTy = function_ref<void(NodeRef, uint64_t)>;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | PostOrderIterator.h | 63 template <typename NodeRef>
64 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
69 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
89 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
97 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
99 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
100 using NodeRef = typename GT::NodeRef; variable
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
[all …]
|
| D | SCCIterator.h | 45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef; variable
48 using SccTy = std::vector<NodeRef>;
53 NodeRef Node; ///< The current node pointer.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement()
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
75 std::vector<NodeRef> SCCNodeStack;
85 void DFSVisitOne(NodeRef N);
93 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator()
136 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode()
[all …]
|
| D | 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; variable
57 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>;
67 inline bf_iterator(NodeRef Node) { in bf_iterator()
81 NodeRef Node = H.first; in toNext()
87 NodeRef Next = *(*ChildIt)++; in toNext()
[all …]
|
| D | 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); } in insert()
78 void completed(NodeRef) {} in completed()
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; variable
96 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
[all …]
|
| D | IntervalMap.h | 490 class NodeRef {
500 NodeRef() = default;
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef() function
520 NodeRef &subtree(unsigned i) const { in subtree()
521 return reinterpret_cast<NodeRef*>(pip.getPointer())[i]; in subtree()
530 bool operator==(const NodeRef &RHS) const {
537 bool operator!=(const NodeRef &RHS) const {
700 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree()
706 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
| D | CallGraphTest.cpp | 20 typedef typename GraphTraits<Ty *>::NodeRef NodeRef; in canSpecializeGraphTraitsIterators() typedef
27 static_assert(std::is_same<decltype(*I), NodeRef>::value, in canSpecializeGraphTraitsIterators()
29 static_assert(std::is_same<decltype(*X), NodeRef>::value, in canSpecializeGraphTraitsIterators()
31 static_assert(std::is_same<decltype(*E), NodeRef>::value, in canSpecializeGraphTraitsIterators()
34 NodeRef N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
36 auto S = GraphTraits<NodeRef>::child_begin(N); in canSpecializeGraphTraitsIterators()
37 auto F = GraphTraits<NodeRef>::child_end(N); in canSpecializeGraphTraitsIterators()
40 static_assert(std::is_same<decltype(*S), NodeRef>::value, in canSpecializeGraphTraitsIterators()
42 static_assert(std::is_same<decltype(*F), NodeRef>::value, in canSpecializeGraphTraitsIterators()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| D | 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 …]
|
| D | 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(); }
|
| D | 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(); }
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| D | IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
28 return NodeRef(); in getLeftSibling()
37 return NodeRef(); in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
78 return NodeRef(); in getRightSibling()
87 return NodeRef(); in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
| D | IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
28 return NodeRef(); in getLeftSibling()
37 return NodeRef(); in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
78 return NodeRef(); in getRightSibling()
87 return NodeRef(); in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
|
| /external/llvm/lib/Support/ |
| D | IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
28 return NodeRef(); in getLeftSibling()
37 return NodeRef(); in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
78 return NodeRef(); in getRightSibling()
87 return NodeRef(); in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | 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(); }
|
| D | 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) {
|
| D | MachineBasicBlock.h | 841 using NodeRef = MachineBasicBlock *;
844 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
845 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
846 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
850 using NodeRef = const MachineBasicBlock *;
853 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
854 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
855 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
865 using NodeRef = MachineBasicBlock *;
868 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
[all …]
|
| D | MachineDominators.h | 261 using NodeRef = Node *; member
264 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
265 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin()
266 static ChildIteratorType child_end(NodeRef N) { return N->end(); } in child_end()
284 static NodeRef getEntryNode(MachineDominatorTree *DT) {
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
| D | 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/include/llvm/ADT/ |
| D | IntervalMap.h | 466 class NodeRef {
476 NodeRef() {} in NodeRef() function
483 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef() function
496 NodeRef &subtree(unsigned i) const { in subtree()
497 return reinterpret_cast<NodeRef*>(pip.getPointer())[i]; in subtree()
506 bool operator==(const NodeRef &RHS) const {
513 bool operator!=(const NodeRef &RHS) const {
677 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
680 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree()
683 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 487 class NodeRef {
497 NodeRef() {} in NodeRef() function
504 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef() function
517 NodeRef &subtree(unsigned i) const { in subtree()
518 return reinterpret_cast<NodeRef*>(pip.getPointer())[i]; in subtree()
527 bool operator==(const NodeRef &RHS) const {
534 bool operator!=(const NodeRef &RHS) const {
698 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
701 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree()
704 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/ |
| D | VPlan.h | 1255 using NodeRef = VPBlockBase *;
1258 static NodeRef getEntryNode(NodeRef N) { return N; }
1260 static inline ChildIteratorType child_begin(NodeRef N) {
1264 static inline ChildIteratorType child_end(NodeRef N) {
1270 using NodeRef = const VPBlockBase *;
1273 static NodeRef getEntryNode(NodeRef N) { return N; }
1275 static inline ChildIteratorType child_begin(NodeRef N) {
1279 static inline ChildIteratorType child_end(NodeRef N) {
1287 using NodeRef = VPBlockBase *;
1290 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
[all …]
|