108                             unsigned int *Edges, int *EdgeValues,
123                      std::unique_ptr<Edge[]> Edges, size_type NodesSize,  in MachineGadgetGraph()
125       : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize),  in MachineGadgetGraph()
539 // Returns the number of remaining gadget edges that could not be eliminated
544     // Eliminate fences and CFG edges that ingress and egress the fence, as  in elimMitigatedEdgesAndNodes()
546     for (const Edge &E : G.edges()) {  in elimMitigatedEdgesAndNodes()
551         for (const Edge &DE : Dest->edges())  in elimMitigatedEdgesAndNodes()
557   // Find and eliminate gadget edges that have been mitigated.  in elimMitigatedEdgesAndNodes()
561     if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge))  in elimMitigatedEdgesAndNodes()
570           for (const Edge &E : N->edges()) {  in elimMitigatedEdgesAndNodes()
580     for (const Edge &E : RootN.edges()) {  in elimMitigatedEdgesAndNodes()
622     LLVM_DEBUG(dbgs() << "Cutting edges...\n");  in hardenLoadsWithPlugin()
626     auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size());  in hardenLoadsWithPlugin()  local
633     for (const Edge &E : Graph->edges()) {  in hardenLoadsWithPlugin()
634       Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest());  in hardenLoadsWithPlugin()
637     OptimizeCut(Nodes.get(), Graph->nodes_size(), Edges.get(), EdgeValues.get(),  in hardenLoadsWithPlugin()
642     LLVM_DEBUG(dbgs() << "Cutting edges... Done\n");  in hardenLoadsWithPlugin()
643     LLVM_DEBUG(dbgs() << "Cut " << CutEdges.count() << " edges\n");  in hardenLoadsWithPlugin()
669   LLVM_DEBUG(dbgs() << "Cutting edges...\n");  in hardenLoadsWithHeuristic()
672   // Begin by collecting all ingress CFG edges for each node  in hardenLoadsWithHeuristic()
674   for (const Edge &E : Graph->edges())  in hardenLoadsWithHeuristic()
680   // (a) cut all egress CFG edges from the gadget source, or  in hardenLoadsWithHeuristic()
681   // (b) cut all ingress CFG edges to the gadget sink.  in hardenLoadsWithHeuristic()
687     for (const Edge &E : N.edges()) {  in hardenLoadsWithHeuristic()
693       for (const Edge &EgressEdge : N.edges())  in hardenLoadsWithHeuristic()
711   LLVM_DEBUG(dbgs() << "Cutting edges... Done\n");  in hardenLoadsWithHeuristic()
712   LLVM_DEBUG(dbgs() << "Cut " << CutEdges.count() << " edges\n");  in hardenLoadsWithHeuristic()
727     for (const Edge &E : N.edges()) {  in insertFences()
741           // Remove all egress CFG edges from this branch because the inserted  in insertFences()
743           for (const Edge &E : N.edges()) {  in insertFences()