| /src/external/gpl3/gdb/dist/gdbsupport/ |
| range-chain.h | 35 m_ranges (ranges)
42 if (m_index != other.m_index || &m_ranges != &other.m_ranges)
59 if (*m_current == m_ranges[m_index].end ())
78 for (; m_index < m_ranges.size (); ++m_index)
80 m_current = m_ranges[m_index].begin ();
81 if (*m_current != m_ranges[m_index].end ())
95 const std::vector<Range> &m_ranges; member in class:range_chain::iterator
101 : m_ranges (std::forward<T> (ranges))
107 return iterator (m_ranges, 0)
118 std::vector<Range> m_ranges; member in struct:range_chain
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| range-chain.h | 35 m_ranges (ranges)
42 if (m_index != other.m_index || &m_ranges != &other.m_ranges)
59 if (*m_current == m_ranges[m_index].end ())
78 for (; m_index < m_ranges.size (); ++m_index)
80 m_current = m_ranges[m_index].begin ();
81 if (*m_current != m_ranges[m_index].end ())
95 const std::vector<Range> &m_ranges; member in class:range_chain::iterator
101 : m_ranges (std::forward<T> (ranges))
107 return iterator (m_ranges, 0)
118 std::vector<Range> m_ranges; member in struct:range_chain
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| block.h | 157 if (m_ranges == nullptr)
160 return gdb::make_array_view (m_ranges->range, m_ranges->nranges);
166 if (m_ranges == nullptr)
169 return gdb::make_array_view (m_ranges->range, m_ranges->nranges);
174 { m_ranges = ranges; }
345 struct blockranges *m_ranges = nullptr; member in struct:block
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| constraint-manager.h | 142 bool empty_p () const { return m_ranges.length () == 0; }
146 unsigned get_count () const { return m_ranges.length (); }
147 const bounded_range &get_range (unsigned idx) const { return m_ranges[idx]; }
155 auto_vec<bounded_range> m_ranges; member in struct:ana::bounded_ranges
381 : m_ec_id (ec_id), m_ranges (ranges)
398 const bounded_ranges *m_ranges; member in class:ana::bounded_ranges_constraint
|
| region-model.h | 1212 m_expr (expr), m_ranges (ranges)
1219 const bounded_ranges *m_ranges; member in class:ana::rejected_ranges_constraint
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-if-to-switch.cc | 66 m_bb (gimple_bb (cond)), m_forwarder_bb (NULL), m_ranges (),
71 m_ranges.create (0);
81 auto_vec<range_entry> m_ranges; member in struct:condition_info
148 for (unsigned j = 0; j < m_entries[i]->m_ranges.length (); j++)
149 all_ranges.safe_push (&m_entries[i]->m_ranges[j]);
204 for (unsigned j = 0; j < info->m_ranges.length (); j++)
206 range_entry *range = &info->m_ranges[j];
308 tree index_type = TREE_TYPE (first_cond->m_ranges[0].exp);
321 for (unsigned j = 0; j < info->m_ranges.length (); j++)
323 info->m_ranges[j].low
[all...] |
| tree-diagnostic-path.cc | 263 unsigned get_num_ranges () const { return m_ranges.length (); }
274 auto_delete_vec <event_range> m_ranges; member in struct:__anon13906::path_summary
318 m_ranges.safe_push (cur_event_range);
572 FOR_EACH_VEC_ELT (ps->m_ranges, i, range)
577 if (i == 0 || ps->m_ranges[i - 1]->m_thread_id != range->m_thread_id)
|
| value-range.h | 390 wide_int m_ranges[N*2]; variable
657 if (RESIZABLE && m_base != m_ranges)
1017 : irange (m_ranges, N, RESIZABLE)
1023 : irange (m_ranges, N, RESIZABLE)
1030 : irange (m_ranges, N, RESIZABLE)
1037 : irange (m_ranges, N, RESIZABLE)
1045 : irange (m_ranges, N, RESIZABLE)
1052 : irange (m_ranges, N, RESIZABLE)
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| constraint-manager.h | 137 bool empty_p () const { return m_ranges.length () == 0; }
147 auto_vec<bounded_range> m_ranges; member in struct:ana::bounded_ranges
373 : m_ec_id (ec_id), m_ranges (ranges)
390 const bounded_ranges *m_ranges; member in class:ana::bounded_ranges_constraint
|
| region-model.h | 1259 m_expr (expr), m_ranges (ranges)
1266 const bounded_ranges *m_ranges; member in class:ana::rejected_ranges_constraint
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-if-to-switch.cc | 65 m_forwarder_bb (NULL), m_ranges (), m_true_edge (NULL), m_false_edge (NULL),
68 m_ranges.create (0);
78 auto_vec<range_entry> m_ranges; member in struct:condition_info
144 for (unsigned j = 0; j < m_entries[i]->m_ranges.length (); j++)
145 all_ranges.safe_push (&m_entries[i]->m_ranges[j]);
200 for (unsigned j = 0; j < info->m_ranges.length (); j++)
202 range_entry *range = &info->m_ranges[j];
304 tree index_type = TREE_TYPE (first_cond->m_ranges[0].exp);
317 for (unsigned j = 0; j < info->m_ranges.length (); j++)
319 info->m_ranges[j].low
[all...] |
| tree-diagnostic-path.cc | 213 unsigned get_num_ranges () const { return m_ranges.length (); }
215 auto_delete_vec <event_range> m_ranges; member in struct:__anon16329::path_summary
234 m_ranges.safe_push (cur_event_range);
322 FOR_EACH_VEC_ELT (ps->m_ranges, i, range)
327 const event_range *prev_range = ps->m_ranges[i - 1];
383 if (i < ps->m_ranges.length () - 1)
385 const event_range *next_range = ps->m_ranges[i + 1];
|
| value-range.h | 171 tree m_ranges[N*2]; variable
410 : irange (m_ranges, N)
416 : irange (m_ranges, N)
423 : irange (m_ranges, N)
430 : irange (m_ranges, N)
438 : irange (m_ranges, N)
447 : irange (m_ranges, N)
|
| /src/external/gpl3/gdb/dist/gdb/ |
| block.h | 158 if (m_ranges == nullptr)
161 return gdb::make_array_view (m_ranges->range, m_ranges->nranges);
167 if (m_ranges == nullptr)
170 return gdb::make_array_view (m_ranges->range, m_ranges->nranges);
175 { m_ranges = ranges; }
371 struct blockranges *m_ranges = nullptr; member in struct:block
|
