Searched refs:HasEdge (Results 1 – 3 of 3) sorted by relevance
185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()276 ss << HasEdge(i, j); in DebugString()379 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
35 const bool HasEdge = llvm::is_contained(successors(From), To); in isUpdateValid() local41 if (Kind == DominatorTree::Insert && !HasEdge) in isUpdateValid()45 if (Kind == DominatorTree::Delete && HasEdge) in isUpdateValid()
2868 bool HasEdge(size_t ilhs, size_t irhs) const {