HomeSort by: relevance | last modified time | path
    Searched refs:m_index (Results 1 - 25 of 61) sorted by relevancy

1 2 3

  /src/external/gpl3/gcc/dist/gcc/
diagnostic-event-id.h 39 diagnostic_event_id_t () : m_index (UNKNOWN_EVENT_IDX) {}
40 diagnostic_event_id_t (int zero_based_idx) : m_index (zero_based_idx) {}
42 bool known_p () const { return m_index != UNKNOWN_EVENT_IDX; }
47 return m_index + 1;
52 int m_index; // zero-based member in class:diagnostic_event_id_t
shortest-paths.h 108 m_dist[given_node->m_index] = 0;
146 int alt = m_dist[n->m_index] + 1;
147 if (alt < m_dist[dest->m_index])
149 m_dist[dest->m_index] = alt;
150 m_best_edge[dest->m_index] = succ;
162 int alt = m_dist[n->m_index] + 1;
163 if (alt < m_dist[src->m_index])
165 m_dist[src->m_index] = alt;
166 m_best_edge[src->m_index] = pred;
188 while (m_best_edge[other_node->m_index])
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
diagnostic-event-id.h 39 diagnostic_event_id_t () : m_index (UNKNOWN_EVENT_IDX) {}
40 diagnostic_event_id_t (int zero_based_idx) : m_index (zero_based_idx) {}
42 bool known_p () const { return m_index != UNKNOWN_EVENT_IDX; }
47 return m_index + 1;
52 int m_index; // zero-based member in class:diagnostic_event_id_t
shortest-paths.h 108 m_dist[given_node->m_index] = 0;
146 int alt = m_dist[n->m_index] + 1;
147 if (alt < m_dist[dest->m_index])
149 m_dist[dest->m_index] = alt;
150 m_best_edge[dest->m_index] = succ;
162 int alt = m_dist[n->m_index] + 1;
163 if (alt < m_dist[src->m_index])
165 m_dist[src->m_index] = alt;
166 m_best_edge[src->m_index] = pred;
188 while (m_best_edge[other_node->m_index])
    [all...]
  /src/external/gpl3/gdb.old/dist/gdbsupport/
range-chain.h 34 : m_index (idx),
42 if (m_index != other.m_index || &m_ranges != &other.m_ranges)
59 if (*m_current == m_ranges[m_index].end ())
61 ++m_index;
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 ())
89 size_t m_index; member in class:range_chain::iterator
    [all...]
  /src/external/gpl3/gdb/dist/gdbsupport/
range-chain.h 34 : m_index (idx),
42 if (m_index != other.m_index || &m_ranges != &other.m_ranges)
59 if (*m_current == m_ranges[m_index].end ())
61 ++m_index;
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 ())
89 size_t m_index; member in class:range_chain::iterator
    [all...]
  /src/external/gpl3/gcc/dist/gcc/analyzer/
reachability.h 44 bitmap_set_bit (m_indices, target_node->m_index);
56 bitmap_set_bit (m_indices, pred->m_src->m_index);
64 return bitmap_bit_p (m_indices, src_node->m_index);
call-string.cc 93 e->m_callee->m_index, e->m_caller->m_index,
115 new json::integer_number (e.m_callee->m_index));
117 new json::integer_number (e.m_caller->m_index));
221 = a_node_pair.m_callee->m_index - b_node_pair.m_callee->m_index;
225 = a_node_pair.m_caller->m_index - b_node_pair.m_caller->m_index;
329 e->m_callee->m_index, e->m_caller->m_index,
    [all...]
feasible-graph.cc 67 pp_printf (pp, "fnode_%i", m_index);
85 pp_printf (pp, "FN: %i (EN: %i); len=%i", m_index, m_inner_node->m_index,
151 pp_printf (pp, "infeasible edge to EN: %i", m_inner_node->m_index);
229 while (fnode->get_inner_node ()->m_index != 0)
256 while (fnode->get_inner_node ()->m_index != 0)
279 src_fnode->get_inner_node ()->m_index,
281 dest_fnode->get_inner_node ()->m_index);
285 dest_fnode->get_inner_node ()->m_index);
infinite-loop.cc 85 logger->log_partial ("infinite loop: EN: %i", m_enode.m_index);
93 logger->log_partial (" EN: %i", eedge->m_dest->m_index);
113 loop_obj->set_integer ("enode", m_enode.m_index);
238 eedge->m_src->m_index,
239 eedge->m_dest->m_index);
380 LOG_FUNC_1 (logger, "considering EN: %i", enode.m_index);
387 back_edge->m_src->m_index);
417 logger->log ("iter: EN: %i", iter->m_index);
423 iter->m_index);
435 iter->m_index);
    [all...]
program-point.cc 125 m_supernode->m_index, m_from_edge->m_src->m_index,
129 m_supernode->m_index, m_from_edge->m_src->m_index);
133 m_supernode->m_index);
146 pp_printf (pp, "before (SN: %i stmt: %i): ", m_supernode->m_index,
158 pp_printf (pp, "after SN: %i", m_supernode->m_index);
172 hstate.add_int (m_supernode->m_index);
326 new json::integer_number (get_supernode ()->m_index));
334 new json::integer_number (sedge->m_src->m_index));
    [all...]
engine.cc 239 if (int cmp_enode = rec1.m_enode->m_index - rec2.m_enode->m_index)
271 return m_setjmp_record.m_enode->m_index;
621 eedge->m_src->m_index,
622 eedge->m_dest->m_index);
648 eedge->m_src->m_index,
649 eedge->m_dest->m_index);
1112 cur_start_idx = cur_finish_idx = enode->m_index;
1116 if (enode->m_index == cur_finish_idx + 1)
1118 cur_finish_idx = enode->m_index;
    [all...]
feasible-graph.h 69 unsigned get_index () const { return m_index; }
73 : m_inner_node (inner_node), m_index (index)
77 unsigned m_index; member in class:ana::base_feasible_node
infinite-recursion.cc 217 while (iter_fnode->get_inner_node ()->m_index != 0)
246 m_prev_entry_enode->m_index);
248 m_new_entry_enode->m_index);
617 enode->m_index, fndecl);
626 fndecl, prev_entry_enode->m_index);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
reachability.h 44 bitmap_set_bit (m_indices, target_node->m_index);
56 bitmap_set_bit (m_indices, pred->m_src->m_index);
64 return bitmap_bit_p (m_indices, src_node->m_index);
feasible-graph.cc 73 pp_printf (pp, "fnode_%i", m_index);
91 pp_printf (pp, "FN: %i (EN: %i); len=%i", m_index, m_inner_node->m_index,
127 pp_printf (pp, "infeasible edge to EN: %i", m_inner_node->m_index);
206 while (fnode->get_inner_node ()->m_index != 0)
233 while (fnode->get_inner_node ()->m_index != 0)
256 src_fnode->get_inner_node ()->m_index,
258 dest_fnode->get_inner_node ()->m_index);
262 dest_fnode->get_inner_node ()->m_index);
call-string.cc 130 e->m_callee->m_index, e->m_caller->m_index,
152 new json::integer_number (e.m_callee->m_index));
154 new json::integer_number (e.m_caller->m_index));
251 = a_node_pair.m_callee->m_index - b_node_pair.m_callee->m_index;
255 = a_node_pair.m_caller->m_index - b_node_pair.m_caller->m_index;
program-point.cc 127 m_supernode->m_index, m_from_edge->m_src->m_index,
131 m_supernode->m_index, m_from_edge->m_src->m_index);
135 m_supernode->m_index);
148 pp_printf (pp, "before (SN: %i stmt: %i): ", m_supernode->m_index,
160 pp_printf (pp, "after SN: %i", m_supernode->m_index);
174 hstate.add_int (m_supernode->m_index);
328 new json::integer_number (get_supernode ()->m_index));
336 new json::integer_number (sedge->m_src->m_index));
    [all...]
engine.cc 256 if (int cmp_enode = rec1.m_enode->m_index - rec2.m_enode->m_index)
288 return m_setjmp_record.m_enode->m_index;
570 eedge->m_src->m_index,
571 eedge->m_dest->m_index);
597 eedge->m_src->m_index,
598 eedge->m_dest->m_index);
1003 cur_start_idx = cur_finish_idx = enode->m_index;
1007 if (enode->m_index == cur_finish_idx + 1)
1009 cur_finish_idx = enode->m_index;
    [all...]
feasible-graph.h 67 unsigned get_index () const { return m_index; }
71 : m_inner_node (inner_node), m_index (index)
75 unsigned m_index; member in class:ana::base_feasible_node
region.h 300 m_fun (fun), m_index (index)
317 int get_index () const { return m_index; }
318 int get_stack_depth () const { return m_index + 1; }
333 int m_index; member in class:ana::frame_region
770 : m_parent (parent), m_element_type (element_type), m_index (index)
780 hstate.add_ptr (m_index);
788 && m_index == other.m_index);
791 void mark_deleted () { m_index = reinterpret_cast<const svalue *> (1); }
792 void mark_empty () { m_index = NULL;
801 const svalue *m_index; member in struct:ana::element_region::key_t
824 const svalue *m_index; member in class:ana::element_region
    [all...]
diagnostic-manager.cc 148 unsigned snode_idx = enode->get_supernode ()->m_index;
151 desc, enode->m_index, snode_idx, diag_idx);
169 desc, enode->m_index, snode_idx, diag_idx,
178 desc, enode->m_index, snode_idx, diag_idx);
199 desc, enode->m_index, snode_idx, diag_idx,
207 desc, enode->m_index, snode_idx, diag_idx,
476 fnode->get_index (), fnode->get_inner_node ()->m_index,
485 succ_eedge->m_src->m_index,
486 succ_eedge->m_dest->m_index);
514 target_enode->m_index, diag_idx
    [all...]
  /src/external/bsd/elftosb/dist/common/
DataSource.cpp 178 : DataSource::Segment(source), m_image(image), m_index(index)
184 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index);
195 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index);
201 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index);
208 : DataSource::PatternSegment(source), m_image(image), m_index(index)
216 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index);
222 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index);
DataSource.h 269 unsigned m_index; //!< Record index. member in class:elftosb::MemoryImageDataSource::TextSegment
287 unsigned m_index; //!< Record index. member in class:elftosb::MemoryImageDataSource::FillSegment
  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
read.h 556 m_index (start ? 0 : per_bfd->all_units.size ())
562 ++m_index;
568 return m_per_bfd->get_cu (m_index);
573 return m_index == other.m_index;
579 return m_index != other.m_index;
585 size_t m_index; member in class:all_units_iterator

Completed in 39 milliseconds

1 2 3