121   using Edge = typename GraphT::Edge;  typedef
124                      std::unique_ptr<Edge[]> Edges, size_type NodesSize,  in MachineGadgetGraph()
128   static inline bool isCFGEdge(const Edge &E) {  in isCFGEdge()
131   static inline bool isGadgetEdge(const Edge &E) {  in isGadgetEdge()
152   using Edge = MachineGadgetGraph::Edge;  typedef in __anon994a0f410111::X86LoadValueInjectionLoadHardeningPass
549     for (const Edge &E : G.edges()) {  in elimMitigatedEdgesAndNodes()
554         for (const Edge &DE : Dest->edges())  in elimMitigatedEdgesAndNodes()
573           for (const Edge &E : N->edges()) {  in elimMitigatedEdgesAndNodes()
583     for (const Edge &E : RootN.edges()) {  in elimMitigatedEdgesAndNodes()
636     for (const Edge &E : Graph->edges()) {  in hardenLoadsWithPlugin()
676   DenseMap<const Node *, SmallVector<const Edge *, 2>> IngressEdgeMap;  in hardenLoadsWithHeuristic()
677   for (const Edge &E : Graph->edges())  in hardenLoadsWithHeuristic()
690     for (const Edge &E : N.edges()) {  in hardenLoadsWithHeuristic()
694       SmallVector<const Edge *, 2> EgressEdges;  in hardenLoadsWithHeuristic()
695       SmallVector<const Edge *, 2> &IngressEdges = IngressEdgeMap[E.getDest()];  in hardenLoadsWithHeuristic()
696       for (const Edge &EgressEdge : N.edges())  in hardenLoadsWithHeuristic()
701       for (const Edge *EgressEdge : EgressEdges)  in hardenLoadsWithHeuristic()
704       for (const Edge *IngressEdge : IngressEdges)  in hardenLoadsWithHeuristic()
710       for (const Edge *E : EdgesToCut)  in hardenLoadsWithHeuristic()
730     for (const Edge &E : N.edges()) {  in insertFences()
746           for (const Edge &E : N.edges()) {  in insertFences()