120   using Edge = typename GraphT::Edge;  typedef
123                      std::unique_ptr<Edge[]> Edges, size_type NodesSize,  in MachineGadgetGraph()
127   static inline bool isCFGEdge(const Edge &E) {  in isCFGEdge()
130   static inline bool isGadgetEdge(const Edge &E) {  in isGadgetEdge()
151   using Edge = MachineGadgetGraph::Edge;  typedef in __anon2f1af8870111::X86LoadValueInjectionLoadHardeningPass
547     for (const Edge &E : G.edges()) {  in elimMitigatedEdgesAndNodes()
552         for (const Edge &DE : Dest->edges())  in elimMitigatedEdgesAndNodes()
571           for (const Edge &E : N->edges()) {  in elimMitigatedEdgesAndNodes()
581     for (const Edge &E : RootN.edges()) {  in elimMitigatedEdgesAndNodes()
634     for (const Edge &E : Graph->edges()) {  in hardenLoadsWithPlugin()
674   DenseMap<const Node *, SmallVector<const Edge *, 2>> IngressEdgeMap;  in hardenLoadsWithHeuristic()
675   for (const Edge &E : Graph->edges())  in hardenLoadsWithHeuristic()
688     for (const Edge &E : N.edges()) {  in hardenLoadsWithHeuristic()
692       SmallVector<const Edge *, 2> EgressEdges;  in hardenLoadsWithHeuristic()
693       SmallVector<const Edge *, 2> &IngressEdges = IngressEdgeMap[E.getDest()];  in hardenLoadsWithHeuristic()
694       for (const Edge &EgressEdge : N.edges())  in hardenLoadsWithHeuristic()
699       for (const Edge *EgressEdge : EgressEdges)  in hardenLoadsWithHeuristic()
702       for (const Edge *IngressEdge : IngressEdges)  in hardenLoadsWithHeuristic()
708       for (const Edge *E : EdgesToCut)  in hardenLoadsWithHeuristic()
728     for (const Edge &E : N.edges()) {  in insertFences()
744           for (const Edge &E : N.edges()) {  in insertFences()