Method IsValid

cfa/seq.go:90–106

IsValid reports whether the entry and exit node candidates of prim form a valid sequence of two statements in g. Control flow graph: entry ↓ exit

(g graph.Directed, dom cfg.DominatorTree)

//    ↓
//    exit
func (prim Seq) IsValid(g graph.Directed, dom cfg.DominatorTree) bool {
	// Dominator sanity check.
	entry, exit := prim.Entry, prim.Exit
	if !dom.Dominates(entry, exit) {
		return false
	}

	// Verify that entry has one successor (exit).
	entrySuccs := g.From(entry)
	if len(entrySuccs) != 1 || !g.HasEdgeFromTo(entry, exit) {
		return false
	}

	// Verify that exit has one predecessor (entry).
	exitPreds := g.To(exit)
	return len(exitPreds) == 1
}