235       for (auto &inEdge : oldInEdges) {  in removeNode()  local
236         removeEdge(inEdge.id, id, inEdge.value);  in removeNode()
355       for (auto &inEdge : inEdges[id])  in getIncomingMemRefAccesses()  local
356         if (inEdge.value == memref) {  in getIncomingMemRefAccesses()
357           Node *srcNode = getNode(inEdge.id);  in getIncomingMemRefAccesses()
413     for (auto &inEdge : inEdges[dstId])  in getFusedLoopNestInsertionPoint()  local
414       if (inEdge.id != srcId)  in getFusedLoopNestInsertionPoint()
415         dstDepInsts.insert(getNode(inEdge.id)->op);  in getFusedLoopNestInsertionPoint()
470       for (auto &inEdge : oldInEdges) {  in updateEdges()  local
472         if (privateMemRefs.count(inEdge.value) == 0)  in updateEdges()
473           addEdge(inEdge.id, dstId, inEdge.value);  in updateEdges()
495       for (auto &inEdge : oldInEdges)  in updateEdges()  local
496         if (privateMemRefs.count(inEdge.value) > 0)  in updateEdges()
497           removeEdge(inEdge.id, dstId, inEdge.value);  in updateEdges()
509       for (auto &inEdge : oldInEdges) {  in updateEdges()  local
510         addEdge(inEdge.id, dstId, inEdge.value);  in updateEdges()
511         removeEdge(inEdge.id, sibId, inEdge.value);  in updateEdges()
1890         dstNode->id, [&](MemRefDependenceGraph::Edge inEdge) {  in findSiblingNodeToFuse()  argument
1892           if (dstNode->getLoadOpCount(inEdge.value) > 0 &&  in findSiblingNodeToFuse()
1893               mdg->getNode(inEdge.id)->getStoreOpCount(inEdge.value) > 0)  in findSiblingNodeToFuse()
1894             inEdges.push_back(inEdge);  in findSiblingNodeToFuse()
1899     for (auto &inEdge : inEdges) {  in findSiblingNodeToFuse()  local
1903           inEdge.id, [&](MemRefDependenceGraph::Edge outEdge) {  in findSiblingNodeToFuse()
1908             if (outEdge.id == dstNode->id || outEdge.value != inEdge.value)  in findSiblingNodeToFuse()