SWDEV-315033,SWDEV-315028 - adding null checks for graph

Change-Id: I9cbea5ea9ff59d7960ae11dfd73d5a744981495f
This commit is contained in:
Payam authored and Payam Ghafari committed 2022-03-22 02:08:49 -04:00
1 parent 4a90c3ccaf
commit 6a48e430d0
1 file changed
+6 -1
+6 -1
View File
@@ -1175,9 +1175,14 @@ hipError_t hipGraphAddDependencies(hipGraph_t graph, const hipGraphNode_t* from,
}
for (size_t i = 0; i < numDependencies; i++) {
// When the same node is specified for both from and to
if (from[i] == to[i]) {
if (from[i] == nullptr || to[i] == nullptr || from[i] == to[i] ||
// making sure the nodes blong to the graph
to[i]->GetParentGraph() != graph || from[i]->GetParentGraph() != graph) {
HIP_RETURN(hipErrorInvalidValue);
}
}
for (size_t i = 0; i < numDependencies; i++) {
// When the same edge added from->to return invalid value
const std::vector<Node>& edges = from[i]->GetEdges();
for (auto edge : edges) {