195   DenseMap<unsigned, SmallVector<Edge, 2>> outEdges;  member
240     if (outEdges.count(id) > 0) {  in removeNode()
241       SmallVector<Edge, 2> oldOutEdges = outEdges[id];  in removeNode()
248     outEdges.erase(id);  in removeNode()
274     if (outEdges.count(srcId) == 0 || inEdges.count(dstId) == 0) {  in hasEdge()
277     bool hasOutEdge = llvm::any_of(outEdges[srcId], [=](Edge &edge) {  in hasEdge()
289       outEdges[srcId].push_back({dstId, value});  in addEdge()
299     assert(outEdges.count(srcId) > 0);  in removeEdge()
312     for (auto *it = outEdges[srcId].begin(); it != outEdges[srcId].end();  in removeEdge()
315         outEdges[srcId].erase(it);  in removeEdge()
335       if (outEdges.count(idAndIndex.first) == 0 ||  in hasDependencePath()
336           idAndIndex.second == outEdges[idAndIndex.first].size()) {  in hasDependencePath()
341       Edge edge = outEdges[idAndIndex.first][idAndIndex.second];  in hasDependencePath()
369     if (outEdges.count(id) > 0)  in getOutEdgeCount()
370       for (auto &outEdge : outEdges[id])  in getOutEdgeCount()
390     if (outEdges.count(srcId) == 0)  in getFusedLoopNestInsertionPoint()
407     for (auto &outEdge : outEdges[srcId])  in getFusedLoopNestInsertionPoint()
478     if (outEdges.count(srcId) > 0) {  in updateEdges()
479       SmallVector<Edge, 2> oldOutEdges = outEdges[srcId];  in updateEdges()
518     if (outEdges.count(sibId) > 0) {  in updateEdges()
519       SmallVector<Edge, 2> oldOutEdges = outEdges[sibId];  in updateEdges()
553     if (outEdges.count(id) > 0)  in forEachMemRefOutputEdge()
554       forEachMemRefEdge(outEdges[id], callback);  in forEachMemRefOutputEdge()
584       it = outEdges.find(idAndNode.first);  in print()
585       if (it != outEdges.end()) {  in print()
609   for (auto &outEdge : mdg->outEdges[srcId]) {  in canRemoveSrcNodeAfterFusion()
1610                 any_of(mdg->outEdges[srcId], [&](const auto &edge) {  in fuseProducerConsumerNodes()
1901       SmallVector<MemRefDependenceGraph::Edge, 2> outEdges;  in findSiblingNodeToFuse()  local
1916               outEdges.push_back(outEdge);  in findSiblingNodeToFuse()
1921       if (!outEdges.empty()) {  in findSiblingNodeToFuse()
1922         visitedSibNodeIds->insert(outEdges[0].id);  in findSiblingNodeToFuse()
1923         idAndMemrefToFuse->first = outEdges[0].id;  in findSiblingNodeToFuse()
1924         idAndMemrefToFuse->second = outEdges[0].value;  in findSiblingNodeToFuse()