Method dfs

pkg/workflow/model_alias_validation.go:287–317

(node string)

}

func (s *dfsState) dfs(node string) []string {
	if setutil.Contains(s.visited, node) {
		return nil
	}
	if s.onPath[node] {
		// Cycle found — return the chain from node back around.
		for i, n := range s.path {
			if n == node {
				return append([]string(nil), s.path[i:]...)
			}
		}
		return append([]string(nil), s.path...) // fallback: should not happen
	}

	s.onPath[node] = true
	s.path = append(s.path, node)

	for _, entry := range s.aliasMap[node] {
		base, _, _ := strings.Cut(entry, "?")
		if isAliasReference(base, s.aliasMap) {
			if cycle := s.dfs(base); cycle != nil {
				return cycle
			}
		}
	}

	s.path = s.path[:len(s.path)-1]
	delete(s.onPath, node)
	s.visited[node] = struct{}{}
	return nil
}

// isAliasReference reports whether base is a bare identifier that refers to
// another alias key in the alias map (as opposed to a provider-scoped name or glob).