| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| diagnostic-manager.h | 62 unsigned get_index () const { return m_idx; }
88 unsigned m_idx; member in class:ana::saved_diagnostic
|
| constraint-manager.h | 301 equiv_class_id (unsigned idx) : m_idx (idx) {}
307 return m_idx == other.m_idx;
311 return m_idx != other.m_idx;
314 bool null_p () const { return m_idx == -1; }
317 int as_int () const { return m_idx; }
323 if (m_idx > other.m_idx)
324 m_idx--
327 int m_idx; member in class:ana::equiv_class_id
[all...] |
| region.h | 1359 : m_parent (parent), m_idx (idx)
1368 hstate.add_int (m_idx);
1375 && m_idx == other.m_idx);
1390 unsigned m_idx; member in struct:ana::var_arg_region::key_t
1396 m_idx (idx)
1407 unsigned get_index () const { return m_idx; }
1410 unsigned m_idx; member in class:ana::var_arg_region
|
| svalue.h | 1407 : m_type (type), m_stmt (stmt), m_id_reg (id_reg), m_idx (idx)
1424 && m_idx == other.m_idx);
1440 unsigned m_idx; member in struct:ana::conjured_svalue::key_t
1446 m_stmt (stmt), m_id_reg (id_reg), m_idx (idx)
1467 unsigned m_idx; member in class:ana::conjured_svalue
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ordered-hash-map.h | 119 m_ordered_hash_map (map), m_idx (idx) {}
123 /* Increment m_idx until we find a non-deleted element, or go beyond
127 ++m_idx;
150 const Key &k = m_ordered_hash_map.m_keys[m_idx];
160 return m_idx != other.m_idx;
167 if (m_idx > m_ordered_hash_map.m_keys.length ())
169 if (m_idx == m_ordered_hash_map.m_keys.length ())
171 const Key &k = m_ordered_hash_map.m_keys[m_idx];
178 unsigned m_idx; member in class:ordered_hash_map::iterator
[all...] |
| 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
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| diagnostic-manager.h | 64 unsigned get_index () const { return m_idx; }
85 unsigned m_idx; member in class:ana::saved_diagnostic
|
| 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...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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...] |
| 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
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| unordered_dense.h | 545 size_t m_idx{};
563 , m_idx(other.m_idx) {} function in class:ankerl::unordered_dense::ANKERL_UNORDERED_DENSE_NAMESPACE::segmented_vector::iter_t
567 , m_idx(idx) {} function in class:ankerl::unordered_dense::ANKERL_UNORDERED_DENSE_NAMESPACE::segmented_vector::iter_t
572 m_idx = other.m_idx;
577 ++m_idx;
582 return {m_data, static_cast<size_t>(static_cast<difference_type>(m_idx) + diff)};
587 return static_cast<difference_type>(m_idx) - static_cast<difference_type>(other.m_idx);
[all...] |
