Home
last modified time | relevance | path

Searched refs:NodeRef (Results 1 – 25 of 46) sorted by relevance

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionIterator.h38 template <class NodeRef, class BlockT, class RegionT>
40 : public std::iterator<std::forward_iterator_tag, NodeRef> {
41 using super = std::iterator<std::forward_iterator_tag, NodeRef>;
56 static_assert(std::is_pointer<NodeRef>::value,
63 PointerIntPair<NodeRef, 2, ItMode> Node;
75 NodeRef getNode() const { return Node.getPointer(); } in getNode()
82 NodeRef getISucc(BlockT *BB) const { in getISucc()
83 NodeRef succ; in getISucc()
101 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
105 inline RNSuccIterator(NodeRef node) in RNSuccIterator()
[all …]
DLoopIterator.h41 using NodeRef = std::pair<const Loop *, BasicBlock *>; member
49 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> {
53 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>;
61 NodeRef operator*() const { return {L, *I}; }
65 bool operator()(NodeRef N) const { in operator()
74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode()
76 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
84 static ChildIteratorType child_end(NodeRef Node) { in child_end()
DInterval.h120 using NodeRef = Interval *;
123 static NodeRef getEntryNode(Interval *I) { return I; }
126 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
131 using NodeRef = Interval *;
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
135 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
136 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
DCallGraph.h408 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 …]
DSyntheticCountsUtils.h34 using NodeRef = typename CGT::NodeRef; variable
36 using SccTy = std::vector<NodeRef>;
40 using GetProfCountTy = function_ref<Optional<Scaled64>(NodeRef, EdgeRef)>;
41 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
DDDG.h432 using NodeRef = DDGNode *;
444 static NodeRef getEntryNode(NodeRef N) { return N; }
445 static ChildIteratorType child_begin(NodeRef N) {
448 static ChildIteratorType child_end(NodeRef N) {
452 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
455 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }
461 static NodeRef getEntryNode(DataDependenceGraph *DG) {
472 using NodeRef = const DDGNode *;
484 static NodeRef getEntryNode(NodeRef N) { return N; }
485 static ChildIteratorType child_begin(NodeRef N) {
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DPostOrderIterator.h62 template <typename NodeRef>
63 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
68 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
83 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
88 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
93 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
96 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
98 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
99 using NodeRef = typename GT::NodeRef; variable
104 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
[all …]
DSCCIterator.h44 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
45 using NodeRef = typename GT::NodeRef; variable
47 using SccTy = std::vector<NodeRef>;
52 NodeRef Node; ///< The current node pointer.
56 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement()
71 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
74 std::vector<NodeRef> SCCNodeStack;
84 void DFSVisitOne(NodeRef N);
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator()
135 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode()
[all …]
DBreadthFirstIterator.h39 template <typename NodeRef, unsigned SmallSize = 8>
40 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
48 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
50 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
52 using NodeRef = typename GT::NodeRef; variable
56 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>;
66 inline bf_iterator(NodeRef Node) { in bf_iterator()
80 NodeRef Node = H.first; in toNext()
86 NodeRef Next = *(*ChildIt)++; in toNext()
[all …]
DDepthFirstIterator.h68 template <typename NodeRef, unsigned SmallSize=8>
69 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } in insert()
77 void completed(NodeRef) {} in completed()
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
88 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
89 using NodeRef = typename GT::NodeRef; variable
95 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
[all …]
Diterator.h343 template <typename ItType, typename NodeRef, typename DataRef>
346 WrappedPairNodeDataIterator<ItType, NodeRef, DataRef>, ItType,
347 typename std::iterator_traits<ItType>::iterator_category, NodeRef,
348 std::ptrdiff_t, NodeRef *, NodeRef &> {
351 typename std::iterator_traits<ItType>::iterator_category, NodeRef,
352 std::ptrdiff_t, NodeRef *, NodeRef &>;
355 mutable NodeRef NR;
363 NodeRef &operator*() const {
DIntervalMap.h490 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 …]
DGraphTraits.h78 using NodeRef = typename GraphType::UnknownGraphTypeError; member
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
128 inverse_children(const typename GraphTraits<GraphType>::NodeRef &G) {
135 children_edges(const typename GraphTraits<GraphType>::NodeRef &G) {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFGDiff.h160 using NodeRef = std::pair<DataRef, BasicBlock *>; member
163 WrappedPairNodeDataIterator<succ_iterator, NodeRef, DataRef>;
167 bool operator()(NodeRef N) const { in operator()
176 WrappedPairNodeDataIterator<vec_iterator, NodeRef, DataRef>;
178 concat_iterator<NodeRef, FilterExistingChildrenIterator,
181 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
192 return concat_iterator<NodeRef, FilterExistingChildrenIterator, in child_begin()
196 static ChildIteratorType child_end(NodeRef N) { in child_end()
207 return concat_iterator<NodeRef, FilterExistingChildrenIterator, in child_end()
214 using NodeRef = std::pair<DataRef, BasicBlock *>; member
[all …]
DCFG.h299 using NodeRef = BasicBlock *;
302 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
303 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
304 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
308 using NodeRef = const BasicBlock *;
311 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
313 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
314 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
323 using NodeRef = BasicBlock *;
326 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
[all …]
DDominators.h192 using NodeRef = Node *;
196 static NodeRef getEntryNode(NodeRef N) { return N; }
197 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
198 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
200 static nodes_iterator nodes_begin(NodeRef N) {
204 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
218 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DIntervalMap.cpp24 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
27 return NodeRef(); in getLeftSibling()
36 return NodeRef(); in getLeftSibling()
39 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
64 NodeRef NR = subtree(l); in moveLeft()
74 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
77 return NodeRef(); in getRightSibling()
86 return NodeRef(); in getRightSibling()
89 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
109 NodeRef NR = subtree(l); in moveRight()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h177 using NodeRef = const MachineLoop *;
180 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
181 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
182 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
186 using NodeRef = MachineLoop *;
189 static NodeRef getEntryNode(MachineLoop *L) { return L; }
190 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
191 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
DMachineRegionInfo.h139 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
140 false, GraphTraits<FlatIt<NodeRef>>>;
142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
159 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
160 false, GraphTraits<FlatIt<NodeRef>>>;
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
DMachineBasicBlock.h871 using NodeRef = MachineBasicBlock *;
874 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
875 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
876 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
880 using NodeRef = const MachineBasicBlock *;
883 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
884 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
885 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
895 using NodeRef = MachineBasicBlock *;
898 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
[all …]
DMachineDominators.h260 using NodeRef = Node *; member
263 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
264 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin()
265 static ChildIteratorType child_end(NodeRef N) { return N->end(); } in child_end()
283 static NodeRef getEntryNode(MachineDominatorTree *DT) {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/
DType.h443 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(); }
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGraphWriter.h72 using NodeRef = typename GTraits::NodeRef; variable
77 static_assert(std::is_pointer<NodeRef>::value,
84 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { in getEdgeSourceLabels()
161 bool isNodeHidden(NodeRef Node) { in isNodeHidden()
165 void writeNode(NodeRef Node) { in writeNode()
238 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
239 if (NodeRef TargetNode = *EI) { in writeEdge()
DGenericIteratedDominanceFrontier.h40 using NodeRef = typename GraphTraits<NodeTy>::NodeRef; member
41 using ChildrenTy = SmallVector<NodeRef, 8>;
43 ChildrenTy get(const NodeRef &N);
120 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) { in get()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPlan.h1232 using NodeRef = VPBlockBase *;
1235 static NodeRef getEntryNode(NodeRef N) { return N; }
1237 static inline ChildIteratorType child_begin(NodeRef N) {
1241 static inline ChildIteratorType child_end(NodeRef N) {
1247 using NodeRef = const VPBlockBase *;
1250 static NodeRef getEntryNode(NodeRef N) { return N; }
1252 static inline ChildIteratorType child_begin(NodeRef N) {
1256 static inline ChildIteratorType child_end(NodeRef N) {
1264 using NodeRef = VPBlockBase *;
1267 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
[all …]

12