242       for (auto &outEdge : oldOutEdges) {  in removeNode()  local
243         removeEdge(id, outEdge.id, outEdge.value);  in removeNode()
370       for (auto &outEdge : outEdges[id])  in getOutEdgeCount()  local
371         if (!memref || outEdge.value == memref)  in getOutEdgeCount()
407     for (auto &outEdge : outEdges[srcId])  in getFusedLoopNestInsertionPoint()  local
408       if (outEdge.id != dstId)  in getFusedLoopNestInsertionPoint()
409         srcDepInsts.insert(getNode(outEdge.id)->op);  in getFusedLoopNestInsertionPoint()
480       for (auto &outEdge : oldOutEdges) {  in updateEdges()  local
482         if (outEdge.id == dstId)  in updateEdges()
483           removeEdge(srcId, outEdge.id, outEdge.value);  in updateEdges()
485           addEdge(dstId, outEdge.id, outEdge.value);  in updateEdges()
486           removeEdge(srcId, outEdge.id, outEdge.value);  in updateEdges()
520       for (auto &outEdge : oldOutEdges) {  in updateEdges()  local
521         addEdge(dstId, outEdge.id, outEdge.value);  in updateEdges()
522         removeEdge(sibId, outEdge.id, outEdge.value);  in updateEdges()
609   for (auto &outEdge : mdg->outEdges[srcId]) {  in canRemoveSrcNodeAfterFusion()  local
610     Operation *depNodeOp = mdg->getNode(outEdge.id)->op;  in canRemoveSrcNodeAfterFusion()
1903           inEdge.id, [&](MemRefDependenceGraph::Edge outEdge) {  in findSiblingNodeToFuse()  argument
1904             unsigned sibNodeId = outEdge.id;  in findSiblingNodeToFuse()
1908             if (outEdge.id == dstNode->id || outEdge.value != inEdge.value)  in findSiblingNodeToFuse()
1914             if (canFuseWithSibNode(sibNode, outEdge.value)) {  in findSiblingNodeToFuse()
1916               outEdges.push_back(outEdge);  in findSiblingNodeToFuse()