Anton Reinhard
5a30f57e1f
Reviewed-on: Rubydragon/MetagraphOptimization.jl#9 Co-authored-by: Anton Reinhard <anton.reinhard@proton.me> Co-committed-by: Anton Reinhard <anton.reinhard@proton.me>
78 lines
2.0 KiB
Julia
78 lines
2.0 KiB
Julia
"""
|
|
is_connected(graph::DAG)
|
|
|
|
Return whether the given graph is connected.
|
|
"""
|
|
function is_connected(graph::DAG)
|
|
nodeQueue = Deque{Node}()
|
|
push!(nodeQueue, get_exit_node(graph))
|
|
seenNodes = Set{Node}()
|
|
|
|
while !isempty(nodeQueue)
|
|
current = pop!(nodeQueue)
|
|
push!(seenNodes, current)
|
|
|
|
for child in current.children
|
|
push!(nodeQueue, child)
|
|
end
|
|
end
|
|
|
|
return length(seenNodes) == length(graph.nodes)
|
|
end
|
|
|
|
"""
|
|
is_valid(graph::DAG)
|
|
|
|
Validate the entire graph using asserts. Intended for testing with `@assert is_valid(graph)`.
|
|
"""
|
|
function is_valid(graph::DAG)
|
|
for node in graph.nodes
|
|
@assert is_valid(graph, node)
|
|
end
|
|
|
|
for op in graph.operationsToApply
|
|
@assert is_valid(graph, op)
|
|
end
|
|
|
|
for nr in graph.possibleOperations.nodeReductions
|
|
@assert is_valid(graph, nr)
|
|
end
|
|
for ns in graph.possibleOperations.nodeSplits
|
|
@assert is_valid(graph, ns)
|
|
end
|
|
for nf in graph.possibleOperations.nodeFusions
|
|
@assert is_valid(graph, nf)
|
|
end
|
|
|
|
for node in graph.dirtyNodes
|
|
@assert node in graph "Dirty Node is not part of the graph!"
|
|
@assert ismissing(node.nodeReduction) "Dirty Node has a NodeReduction!"
|
|
@assert ismissing(node.nodeSplit) "Dirty Node has a NodeSplit!"
|
|
if (typeof(node) <: DataTaskNode)
|
|
@assert ismissing(node.nodeFusion) "Dirty DataTaskNode has a Node Fusion!"
|
|
elseif (typeof(node) <: ComputeTaskNode)
|
|
@assert isempty(node.nodeFusions) "Dirty ComputeTaskNode has Node Fusions!"
|
|
end
|
|
end
|
|
|
|
@assert is_connected(graph) "Graph is not connected!"
|
|
|
|
return true
|
|
end
|
|
|
|
"""
|
|
is_scheduled(graph::DAG)
|
|
|
|
Validate that the entire graph has been scheduled, i.e., every [`ComputeTaskNode`](@ref) has its `.device` set.
|
|
"""
|
|
function is_scheduled(graph::DAG)
|
|
for node in graph.nodes
|
|
if (node isa DataTaskNode)
|
|
continue
|
|
end
|
|
@assert !ismissing(node.device)
|
|
end
|
|
|
|
return true
|
|
end
|