Lines Matching full:edges

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