193   DenseMap<unsigned, SmallVector<Edge, 2>> inEdges;  member
233     if (inEdges.count(id) > 0) {  in removeNode()
234       SmallVector<Edge, 2> oldInEdges = inEdges[id];  in removeNode()
247     inEdges.erase(id);  in removeNode()
274     if (outEdges.count(srcId) == 0 || inEdges.count(dstId) == 0) {  in hasEdge()
280     bool hasInEdge = llvm::any_of(inEdges[dstId], [=](Edge &edge) {  in hasEdge()
290       inEdges[dstId].push_back({srcId, value});  in addEdge()
298     assert(inEdges.count(dstId) > 0);  in removeEdge()
305     for (auto *it = inEdges[dstId].begin(); it != inEdges[dstId].end(); ++it) {  in removeEdge()
307         inEdges[dstId].erase(it);  in removeEdge()
354     if (inEdges.count(id) > 0)  in getIncomingMemRefAccesses()
355       for (auto &inEdge : inEdges[id])  in getIncomingMemRefAccesses()
378     for (MemRefDependenceGraph::Edge edge : inEdges[id])  in gatherDefiningNodes()
413     for (auto &inEdge : inEdges[dstId])  in getFusedLoopNestInsertionPoint()
468     if (inEdges.count(srcId) > 0) {  in updateEdges()
469       SmallVector<Edge, 2> oldInEdges = inEdges[srcId];  in updateEdges()
493     if (inEdges.count(dstId) > 0 && !privateMemRefs.empty()) {  in updateEdges()
494       SmallVector<Edge, 2> oldInEdges = inEdges[dstId];  in updateEdges()
507     if (inEdges.count(sibId) > 0) {  in updateEdges()
508       SmallVector<Edge, 2> oldInEdges = inEdges[sibId];  in updateEdges()
545     if (inEdges.count(id) > 0)  in forEachMemRefInputEdge()
546       forEachMemRefEdge(inEdges[id], callback);  in forEachMemRefInputEdge()
579       auto it = inEdges.find(idAndNode.first);  in print()
580       if (it != inEdges.end()) {  in print()
663   if (mdg->inEdges.count(dstId) == 0)  in getProducerCandidates()
674   for (auto &srcEdge : mdg->inEdges[dstId]) {  in getProducerCandidates()
1888     SmallVector<MemRefDependenceGraph::Edge, 2> inEdges;  in findSiblingNodeToFuse()  local
1894             inEdges.push_back(inEdge);  in findSiblingNodeToFuse()
1899     for (auto &inEdge : inEdges) {  in findSiblingNodeToFuse()