SWDEV-469422 - Cleanup graph code remove parallellists and nodewaitlists

Change-Id: I00c7b2894333bd13d47b913d3fcdd6e1ffcb741f


[ROCm/clr commit: c47f9dda58]
This commit is contained in:
Anusha GodavarthySurya
2024-10-23 12:49:46 +00:00
committed by Anusha Godavarthy Surya
orang tua f3e3d8178b
melakukan a3c4a5a19c
3 mengubah file dengan 36 tambahan dan 318 penghapusan
+1 -10
Melihat File
@@ -1384,19 +1384,10 @@ hipError_t ihipGraphInstantiate(hip::GraphExec** pGraphExec, hip::Graph* graph,
if (false == clonedGraph->TopologicalOrder(graphNodes)) {
return hipErrorInvalidValue;
}
std::vector<std::vector<hip::GraphNode*>> parallelLists;
std::unordered_map<hip::GraphNode*, std::vector<hip::GraphNode*>> nodeWaitLists;
if (DEBUG_HIP_FORCE_GRAPH_QUEUES == 1) {
parallelLists.push_back(graphNodes);
} else {
clonedGraph->GetRunList(parallelLists, nodeWaitLists);
}
if (DEBUG_HIP_FORCE_GRAPH_QUEUES != 0) {
clonedGraph->ScheduleNodes();
}
*pGraphExec =
new hip::GraphExec(graphNodes, parallelLists, nodeWaitLists, clonedGraph, clonedNodes,
flags);
*pGraphExec = new hip::GraphExec(graphNodes, clonedGraph, clonedNodes, flags);
if (*pGraphExec != nullptr) {
graph->SetGraphInstantiated(true);
if (DEBUG_HIP_GRAPH_DOT_PRINT) {