109                             int *CutEdges /* out */, unsigned int EdgesSize);
174                    EdgeSet &CutEdges /* in, out */) const;
623     EdgeSet CutEdges{*Graph};  in hardenLoadsWithPlugin()  local
641         CutEdges.set(I);  in hardenLoadsWithPlugin()
643     LLVM_DEBUG(dbgs() << "Cut " << CutEdges.count() << " edges\n");  in hardenLoadsWithPlugin()
646     FencesInserted += insertFences(MF, *Graph, CutEdges);  in hardenLoadsWithPlugin()
650     Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges);  in hardenLoadsWithPlugin()
670   EdgeSet CutEdges{*Graph};  in hardenLoadsWithHeuristic()  local
699         if (!CutEdges.contains(*EgressEdge))  in hardenLoadsWithHeuristic()
702         if (!CutEdges.contains(*IngressEdge))  in hardenLoadsWithHeuristic()
708         CutEdges.insert(*E);  in hardenLoadsWithHeuristic()
712   LLVM_DEBUG(dbgs() << "Cut " << CutEdges.count() << " edges\n");  in hardenLoadsWithHeuristic()
715   int FencesInserted = insertFences(MF, *Graph, CutEdges);  in hardenLoadsWithHeuristic()
724     EdgeSet &CutEdges /* in, out */) const {  in insertFences()
728       if (CutEdges.contains(E)) {  in insertFences()
745               CutEdges.insert(E);  in insertFences()