Struct ltState

dom.go:76–81

ltState holds the working state for Lengauer-Tarjan algorithm (during which domInfo.pre is repurposed for CFG DFS preorder number).

// ltState holds the working state for Lengauer-Tarjan algorithm
// (during which domInfo.pre is repurposed for CFG DFS preorder number).
type ltState struct {
	// Each slice is indexed by domInfo.index.
	sdom     []*node // b's semidominator
	parent   []*node // b's parent in DFS traversal of CFG
	ancestor []*node // b's ancestor with least sdom
}

// dfs implements the depth-first search part of the LT algorithm.
func (lt *ltState) dfs(v *node, i int32, preorder []*node) int32 {