Lines Matching defs:GraphT
51 template <class GraphT>
52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
53 typename GraphT::NodeRef V, unsigned N) {
55 typename GraphT::NodeRef,
56 typename DominatorTreeBaseByGraphTraits<GraphT>::InfoRec>
61 typename GraphT::NodeRef BB = *I;
78 template <class GraphT>
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
80 typename GraphT::NodeRef V, unsigned N) {
82 typename GraphT::NodeRef,
83 typename DominatorTreeBaseByGraphTraits<GraphT>::InfoRec>
87 typename GraphT::NodeRef BB = *I;
100 template <class GraphT>
101 typename GraphT::NodeRef Eval(DominatorTreeBaseByGraphTraits<GraphT> &DT,
102 typename GraphT::NodeRef VIn,
108 SmallVector<typename GraphT::NodeRef, 32> Work;
109 SmallPtrSet<typename GraphT::NodeRef, 32> Visited;
115 typename GraphT::NodeRef V = Work.back();
117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent];
131 typename GraphT::NodeRef VAncestorLabel = VAInfo.Label;
132 typename GraphT::NodeRef VLabel = VInfo.Label;
144 typedef GraphTraits<NodeT> GraphT;
145 static_assert(std::is_pointer<typename GraphT::NodeRef>::value,
147 typedef typename std::remove_pointer<typename GraphT::NodeRef>::type NodeType;
164 N = ReverseDFSPass<GraphT>(DT, DT.Roots[i], N);
166 N = DFSPass<GraphT>(DT, DT.Roots[0], N);
189 typename GraphT::NodeRef W = DT.Vertex[i];
194 typename GraphT::NodeRef V = DT.Vertex[Buckets[j]];
195 typename GraphT::NodeRef U = Eval<GraphT>(DT, V, i + 1);
205 unsigned SemiU = DT.Info[Eval<GraphT>(DT, N, i + 1)].Semi;
222 typename GraphT::NodeRef Root = DT.Vertex[1];
224 typename GraphT::NodeRef V = DT.Vertex[Buckets[j]];
231 typename GraphT::NodeRef W = DT.Vertex[i];
232 typename GraphT::NodeRef &WIDom = DT.IDoms[W];
243 typename GraphT::NodeRef Root = !MultipleRoots ? DT.Roots[0] : nullptr;
252 typename GraphT::NodeRef W = DT.Vertex[i];
258 typename GraphT::NodeRef ImmDom = DT.getIDom(W);
