Searched refs:IDoms (Results 1 – 4 of 4) sorted by relevance
199 DT.IDoms[V] = DT.Info[U].Semi < i ? U : W; in Calculate()222 DT.IDoms[W] = DT.Vertex[WInfo.Parent]; in Calculate()233 DT.IDoms[V] = Root; in Calculate()240 typename GraphT::NodeType*& WIDom = DT.IDoms[W]; in Calculate()242 WIDom = DT.IDoms[WIDom]; in Calculate()282 DT.IDoms.clear(); in Calculate()
209 IDoms.clear(); in wipe()233 DenseMap<NodeT *, NodeT *> IDoms; variable243 IDoms.clear(); in reset()326 SlowQueries(std::move(Arg.SlowQueries)), IDoms(std::move(Arg.IDoms)), in DominatorTreeBase()337 IDoms = std::move(RHS.IDoms);660 NodeT *getIDom(NodeT *BB) const { return IDoms.lookup(BB); } in getIDom()
200 DT.IDoms[V] = DT.Info[U].Semi < i ? U : W; in Calculate()223 DT.IDoms[W] = DT.Vertex[WInfo.Parent]; in Calculate()234 DT.IDoms[V] = Root; in Calculate()241 typename GraphT::NodeType*& WIDom = DT.IDoms[W]; in Calculate()243 WIDom = DT.IDoms[WIDom]; in Calculate()280 DT.IDoms.clear(); in Calculate()
205 DenseMap<NodeT*, NodeT*> IDoms; variable218 IDoms.clear(); in reset()644 typename DenseMap<NodeT*, NodeT*>::const_iterator I = IDoms.find(BB); in getIDom()645 return I != IDoms.end() ? I->second : 0; in getIDom()662 this->IDoms[&F.front()] = 0; in recalculate()674 this->IDoms[I] = 0; in recalculate()