/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | ordered-hash-map.h | 93 m_ordered_hash_map (map), m_idx (idx) {} 97 /* Increment m_idx until we find a non-deleted element, or go beyond 101 ++m_idx; 124 const Key &k = m_ordered_hash_map.m_keys[m_idx]; 134 return m_idx != other.m_idx; 141 if (m_idx > m_ordered_hash_map.m_keys.length ()) 143 if (m_idx == m_ordered_hash_map.m_keys.length ()) 145 const Key &k = m_ordered_hash_map.m_keys[m_idx]; 152 unsigned m_idx; member in class:ordered_hash_map::iterator [all...] |
H A D | ggc-tests.c | 343 int m_idx; 379 new_node->m_idx = i; 393 ASSERT_EQ (i, iter_node->m_idx); 336 int m_idx; variable
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | ordered-hash-map.h | 93 m_ordered_hash_map (map), m_idx (idx) {} 97 /* Increment m_idx until we find a non-deleted element, or go beyond 101 ++m_idx; 124 const Key &k = m_ordered_hash_map.m_keys[m_idx]; 134 return m_idx != other.m_idx; 141 if (m_idx > m_ordered_hash_map.m_keys.length ()) 143 if (m_idx == m_ordered_hash_map.m_keys.length ()) 145 const Key &k = m_ordered_hash_map.m_keys[m_idx]; 152 unsigned m_idx; member in class:ordered_hash_map::iterator [all...] |
H A D | ggc-tests.cc | 332 int m_idx; 368 new_node->m_idx = i; 382 ASSERT_EQ (i, iter_node->m_idx); 325 int m_idx; variable
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/analyzer/ |
H A D | constraint-manager.h | 92 equiv_class_id (unsigned idx) : m_idx (idx) {} 98 return m_idx == other.m_idx; 102 return m_idx != other.m_idx; 105 bool null_p () const { return m_idx == -1; } 108 int as_int () const { return m_idx; } 114 if (m_idx > other.m_idx) 115 m_idx 118 int m_idx; member in class:ana::equiv_class_id [all...] |
H A D | region-model.h | 81 svalue_id () : m_idx (-1) {} 85 return m_idx == other.m_idx; 90 return m_idx != other.m_idx; 93 bool null_p () const { return m_idx == -1; } 96 int as_int () const { return m_idx; } 104 svalue_id (int idx) : m_idx (idx) {} 106 int m_idx; member in class:ana::svalue_id 117 region_id () : m_idx ( 142 int m_idx; member in class:ana::region_id [all...] |
H A D | constraint-manager.cc | 421 hstate.add_int (m_lhs.m_idx); 423 hstate.add_int (m_rhs.m_idx); 448 return cm.get_equiv_class_by_index (m_idx); 456 return cm.get_equiv_class_by_index (m_idx); 467 pp_printf (pp, "ec%i", m_idx); 697 equiv_class *old_ec = m_equiv_classes[rhs_ec_id.m_idx]; 700 m_equiv_classes[rhs_ec_id.m_idx] = final_ec; 959 for (equiv_class_id other_id (0); other_id.m_idx < new_id.m_idx; 960 other_id.m_idx [all...] |
H A D | supergraph.h | 530 m_idx (idx) 550 const int m_idx; member in class:ana::switch_cfg_superedge
|
H A D | supergraph.cc | 886 return gimple_switch_label (get_switch_stmt (), m_idx);
|
H A D | region-model.cc | 196 pp_printf (pp, "sv%i", m_idx); 205 pp_printf (pp, "svalue_%i", m_idx); 213 gcc_assert (null_p () || m_idx < (int)model.get_num_svalues ()); 226 pp_printf (pp, "r%i", m_idx); 235 pp_printf (pp, "region_%i", m_idx); 243 gcc_assert (null_p () || m_idx < (int)model.get_num_regions ());
|
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/ |
H A D | constraint-manager.h | 293 equiv_class_id (unsigned idx) : m_idx (idx) {} 299 return m_idx == other.m_idx; 303 return m_idx != other.m_idx; 306 bool null_p () const { return m_idx == -1; } 309 int as_int () const { return m_idx; } 315 if (m_idx > other.m_idx) 316 m_idx 319 int m_idx; member in class:ana::equiv_class_id [all...] |
H A D | diagnostic-manager.h | 64 unsigned get_index () const { return m_idx; } 85 unsigned m_idx; member in class:ana::saved_diagnostic
|
H A D | diagnostic-manager.cc | 655 m_idx (idx), 730 sd_obj->set ("idx", new json::integer_number (m_idx)); 750 pp_printf (pp, "sd_%i", m_idx); 765 m_d->get_kind (), m_idx); 822 m_best_epath = pf->get_best_epath (m_enode, m_d->get_kind (), m_idx,
|
H A D | constraint-manager.cc | 1358 hstate.add_int (m_lhs.m_idx); 1360 hstate.add_int (m_rhs.m_idx); 1443 hstate->add_int (m_ec_id.m_idx); 1454 return cm.get_equiv_class_by_index (m_idx); 1462 return cm.get_equiv_class_by_index (m_idx); 1473 pp_printf (pp, "ec%i", m_idx); 1889 equiv_class *old_ec = m_equiv_classes[rhs_ec_id.m_idx]; 1892 m_equiv_classes[rhs_ec_id.m_idx] = final_ec; 2645 if (m_equiv_classes[c->m_lhs.m_idx]->m_vars.length () == 0 2646 && m_equiv_classes[c->m_rhs.m_idx] [all...] |