SWDEV-370309 - GetNodes should do levelorder

- GetNode should retrun nodes based on the dependency between them

Signed-off-by: sdashmiz <shadi.dashmiz@amd.com>
Change-Id: Ie8ecdd976f8dc9d9b5dc2adc6ae8f879912c8169


[ROCm/clr commit: ce60d47b61]
This commit is contained in:
sdashmiz
2022-12-02 16:22:37 -05:00
committed by Anusha Godavarthy Surya
parent 2d25a60c1a
commit 09a1db7005
+2 -1
View File
@@ -1219,7 +1219,8 @@ hipError_t hipGraphGetNodes(hipGraph_t graph, hipGraphNode_t* nodes, size_t* num
if (graph == nullptr || numNodes == nullptr) {
HIP_RETURN(hipErrorInvalidValue);
}
const std::vector<hipGraphNode_t>& graphNodes = graph->GetNodes();
std::vector<hipGraphNode_t> graphNodes;
graph->LevelOrder(graphNodes);
if (nodes == nullptr) {
*numNodes = graphNodes.size();
HIP_RETURN(hipSuccess);