| /src/external/gpl3/gcc/dist/gcc/ |
| digraph.h | 105 auto_delete_vec<edge_t> m_edges; member in class:digraph
182 FOR_EACH_VEC_ELT (m_edges, i, e)
240 m_edges.safe_push (edge);
|
| digraph.cc | 97 auto_vec<const test_edge *> m_edges; member in struct:selftest::test_path
154 ASSERT_EQ (path_to_a.m_edges.length (), 0); /* Trivial path. */
157 ASSERT_EQ (path_to_b.m_edges.length (), 1);
158 ASSERT_EQ (path_to_b.m_edges[0], ab);
161 ASSERT_EQ (path_to_c.m_edges.length (), 1);
162 ASSERT_EQ (path_to_c.m_edges[0], ac);
165 ASSERT_EQ (path_to_d.m_edges.length (), 2);
166 ASSERT_EQ (path_to_d.m_edges[0], ac);
167 ASSERT_EQ (path_to_d.m_edges[1], cd);
170 ASSERT_EQ (path_to_e.m_edges.length (), 2)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| digraph.h | 105 auto_delete_vec<edge_t> m_edges; member in class:digraph
182 FOR_EACH_VEC_ELT (m_edges, i, e)
240 m_edges.safe_push (edge);
|
| digraph.cc | 97 auto_vec<const test_edge *> m_edges; member in struct:selftest::test_path
154 ASSERT_EQ (path_to_a.m_edges.length (), 0); /* Trivial path. */
157 ASSERT_EQ (path_to_b.m_edges.length (), 1);
158 ASSERT_EQ (path_to_b.m_edges[0], ab);
161 ASSERT_EQ (path_to_c.m_edges.length (), 1);
162 ASSERT_EQ (path_to_c.m_edges[0], ac);
165 ASSERT_EQ (path_to_d.m_edges.length (), 2);
166 ASSERT_EQ (path_to_d.m_edges[0], ac);
167 ASSERT_EQ (path_to_d.m_edges[1], cd);
170 ASSERT_EQ (path_to_e.m_edges.length (), 2)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| exploded-graph.h | 949 exploded_path () : m_edges () {}
952 unsigned length () const { return m_edges.length (); }
969 auto_vec<const exploded_edge *> m_edges; member in class:ana::exploded_path
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| exploded-graph.h | 942 exploded_path () : m_edges () {}
945 unsigned length () const { return m_edges.length (); }
962 auto_vec<const exploded_edge *> m_edges; member in class:ana::exploded_path
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vsetvl.cc | 2150 struct edge_list *m_edges; member in class:pre_vsetvl
2379 m_transp (nullptr), m_insert (nullptr), m_del (nullptr), m_edges (nullptr)
2427 if (m_edges)
2428 free_edge_list (m_edges);
2858 struct edge_list *m_edges = create_edge_list (); local
2859 unsigned num_edges = NUM_EDGES (m_edges);
2869 compute_earliest (m_edges, num_exprs, antin, antout, m_avout, m_kill,
2910 edge eg = INDEX_EDGE (m_edges, ed);
2938 edge eg = INDEX_EDGE (m_edges, ed);
3127 free_edge_list (m_edges);
[all...] |
