| /src/external/gpl3/gcc/dist/gcc/ |
| digraph.h | 104 auto_delete_vec<node_t> m_nodes; member in class:digraph
166 FOR_EACH_VEC_ELT (m_nodes, i, n)
175 FOR_EACH_VEC_ELT (m_nodes, i, n)
230 m_nodes.safe_push (node);
|
| fibonacci_heap.h | 152 m_nodes (0), m_min (NULL), m_root (NULL),
186 return m_nodes == 0;
192 return m_nodes;
274 size_t m_nodes; member in class:fibonacci_heap
393 m_nodes++;
524 heapa->m_nodes += heapb->m_nodes;
617 m_nodes--;
620 if (m_nodes == 0)
|
| dominance.cc | 121 unsigned int m_nodes; member in class:__anon13579::dom_info
186 m_nodes = 0;
455 m_nodes = m_dfsnum - 1;
458 gcc_assert (m_nodes == (unsigned int) m_n_basic_blocks - 1);
557 for (TBB v = m_nodes; v > 1; v--)
632 for (TBB v = 2; v <= m_nodes; v++)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| digraph.h | 104 auto_delete_vec<node_t> m_nodes; member in class:digraph
166 FOR_EACH_VEC_ELT (m_nodes, i, n)
175 FOR_EACH_VEC_ELT (m_nodes, i, n)
230 m_nodes.safe_push (node);
|
| fibonacci_heap.h | 152 m_nodes (0), m_min (NULL), m_root (NULL),
186 return m_nodes == 0;
192 return m_nodes;
274 size_t m_nodes; member in class:fibonacci_heap
393 m_nodes++;
524 heapa->m_nodes += heapb->m_nodes;
617 m_nodes--;
620 if (m_nodes == 0)
|
| dominance.cc | 121 unsigned int m_nodes; member in class:__anon16015::dom_info
186 m_nodes = 0;
455 m_nodes = m_dfsnum - 1;
458 gcc_assert (m_nodes == (unsigned int) m_n_basic_blocks - 1);
557 for (TBB v = m_nodes; v > 1; v--)
632 for (TBB v = 2; v <= m_nodes; v++)
|
