HomeSort by: relevance | last modified time | path
    Searched refs:inner_edge (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/analyzer/
trimmed-graph.cc 70 const exploded_edge *inner_edge)
71 : dedge<tg_traits> (src, dest), m_inner_edge (inner_edge)
134 exploded_edge *inner_edge; local
136 FOR_EACH_VEC_ELT (inner_graph.m_edges, i, inner_edge)
137 if (m_eedges.contains (inner_edge))
139 const exploded_node *inner_src = inner_edge->m_src;
140 const exploded_node *inner_dest = inner_edge->m_dest;
143 trimmed_edge *tedge = new trimmed_edge (tsrc, tdest, inner_edge);
feasible-graph.h 148 const exploded_edge *inner_edge)
149 : dedge<fg_traits> (src, dest), m_inner_edge (inner_edge)
162 const exploded_edge *inner_edge)
163 : base_feasible_edge (src, dest, inner_edge)
176 const exploded_edge *inner_edge)
177 : base_feasible_edge (src, dest, inner_edge)
trimmed-graph.h 77 const exploded_edge *inner_edge);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
trimmed-graph.cc 82 const exploded_edge *inner_edge)
83 : dedge<tg_traits> (src, dest), m_inner_edge (inner_edge)
146 exploded_edge *inner_edge; local
148 FOR_EACH_VEC_ELT (inner_graph.m_edges, i, inner_edge)
149 if (m_eedges.contains (inner_edge))
151 const exploded_node *inner_src = inner_edge->m_src;
152 const exploded_node *inner_dest = inner_edge->m_dest;
155 trimmed_edge *tedge = new trimmed_edge (tsrc, tdest, inner_edge);
feasible-graph.h 144 const exploded_edge *inner_edge)
145 : dedge<fg_traits> (src, dest), m_inner_edge (inner_edge)
158 const exploded_edge *inner_edge)
159 : base_feasible_edge (src, dest, inner_edge)
172 const exploded_edge *inner_edge)
173 : base_feasible_edge (src, dest, inner_edge)
trimmed-graph.h 77 const exploded_edge *inner_edge);

Completed in 27 milliseconds