Home
last modified time | relevance | path

Searched refs:m_index (Results 1 – 25 of 47) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dshortest-paths.h108 m_dist[given_node->m_index] = 0; in shortest_paths()
146 int alt = m_dist[n->m_index] + 1; in shortest_paths()
147 if (alt < m_dist[dest->m_index]) in shortest_paths()
149 m_dist[dest->m_index] = alt; in shortest_paths()
150 m_best_edge[dest->m_index] = succ; in shortest_paths()
162 int alt = m_dist[n->m_index] + 1; in shortest_paths()
163 if (alt < m_dist[src->m_index]) in shortest_paths()
165 m_dist[src->m_index] = alt; in shortest_paths()
166 m_best_edge[src->m_index] = pred; in shortest_paths()
188 while (m_best_edge[other_node->m_index]) in get_shortest_path()
[all …]
H A Ddiagnostic-event-id.h39 diagnostic_event_id_t () : m_index (UNKNOWN_EVENT_IDX) {} in diagnostic_event_id_t()
40 diagnostic_event_id_t (int zero_based_idx) : m_index (zero_based_idx) {} in diagnostic_event_id_t()
42 bool known_p () const { return m_index != UNKNOWN_EVENT_IDX; } in known_p()
47 return m_index + 1; in one_based()
52 int m_index; // zero-based variable
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dshortest-paths.h80 m_dist[origin->m_index] = 0; in shortest_paths()
115 int alt = m_dist[n->m_index] + 1; in shortest_paths()
116 if (alt < m_dist[dest->m_index]) in shortest_paths()
118 m_dist[dest->m_index] = alt; in shortest_paths()
119 m_prev[dest->m_index] = succ; in shortest_paths()
134 while (m_prev[to->m_index]) in get_shortest_path()
136 result.m_edges.safe_push (m_prev[to->m_index]); in get_shortest_path()
137 to = m_prev[to->m_index]->m_src; in get_shortest_path()
H A Ddiagnostic-event-id.h39 diagnostic_event_id_t () : m_index (UNKNOWN_EVENT_IDX) {} in diagnostic_event_id_t()
40 diagnostic_event_id_t (int zero_based_idx) : m_index (zero_based_idx) {} in diagnostic_event_id_t()
42 bool known_p () const { return m_index != UNKNOWN_EVENT_IDX; } in known_p()
47 return m_index + 1; in one_based()
52 int m_index; // zero-based variable
H A Ddigraph.cc53 test_node (const char *name, int index) : m_name (name), m_index (index) {} in test_node()
59 int m_index; member
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dfeasible-graph.cc73 pp_printf (pp, "fnode_%i", m_index); in dump_dot_id()
91 pp_printf (pp, "FN: %i (EN: %i); len=%i", m_index, m_inner_node->m_index, in dump_dot()
127 pp_printf (pp, "infeasible edge to EN: %i", m_inner_node->m_index); in dump_dot()
206 while (fnode->get_inner_node ()->m_index != 0) in make_epath()
233 while (fnode->get_inner_node ()->m_index != 0) in dump_feasible_path()
256 src_fnode->get_inner_node ()->m_index, in dump_feasible_path()
258 dest_fnode->get_inner_node ()->m_index); in dump_feasible_path()
262 dest_fnode->get_inner_node ()->m_index); in dump_feasible_path()
H A Dengine.cc256 if (int cmp_enode = rec1.m_enode->m_index - rec2.m_enode->m_index) in cmp()
288 return m_setjmp_record.m_enode->m_index; in get_enode_index()
570 eedge->m_src->m_index, in find_stmt()
571 eedge->m_dest->m_index); in find_stmt()
597 eedge->m_src->m_index, in find_stmt()
598 eedge->m_dest->m_index); in find_stmt()
1003 cur_start_idx = cur_finish_idx = enode->m_index; in print_enode_indices()
1007 if (enode->m_index == cur_finish_idx + 1) in print_enode_indices()
1009 cur_finish_idx = enode->m_index; in print_enode_indices()
1017 cur_start_idx = cur_finish_idx = enode->m_index; in print_enode_indices()
[all …]
H A Dcall-string.cc130 e->m_callee->m_index, e->m_caller->m_index, in print()
152 new json::integer_number (e.m_callee->m_index)); in to_json()
154 new json::integer_number (e.m_caller->m_index)); in to_json()
251 = a_node_pair.m_callee->m_index - b_node_pair.m_callee->m_index; in cmp()
255 = a_node_pair.m_caller->m_index - b_node_pair.m_caller->m_index; in cmp()
H A Dprogram-point.cc127 m_supernode->m_index, m_from_edge->m_src->m_index, in print()
131 m_supernode->m_index, m_from_edge->m_src->m_index); in print()
135 m_supernode->m_index); in print()
148 pp_printf (pp, "before (SN: %i stmt: %i): ", m_supernode->m_index, in print()
160 pp_printf (pp, "after SN: %i", m_supernode->m_index); in print()
174 hstate.add_int (m_supernode->m_index); in hash()
328 new json::integer_number (get_supernode ()->m_index)); in to_json()
336 new json::integer_number (sedge->m_src->m_index)); in to_json()
539 a_src_idx = point_a.m_from_edge->m_src->m_index; in cmp_within_supernode_1()
541 b_src_idx = point_b.m_from_edge->m_src->m_index; in cmp_within_supernode_1()
[all …]
H A Dregion.h300 m_fun (fun), m_index (index) in frame_region()
317 int get_index () const { return m_index; } in get_index()
318 int get_stack_depth () const { return m_index + 1; } in get_stack_depth()
333 int m_index; variable
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; }
795 return m_index == reinterpret_cast<const svalue *> (1);
[all …]
H A Dreachability.h44 bitmap_set_bit (m_indices, target_node->m_index); in reachability()
56 bitmap_set_bit (m_indices, pred->m_src->m_index); in reachability()
64 return bitmap_bit_p (m_indices, src_node->m_index); in reachable_from_p()
H A Ddiagnostic-manager.cc148 unsigned snode_idx = enode->get_supernode ()->m_index; in get_best_epath()
151 desc, enode->m_index, snode_idx, diag_idx); in get_best_epath()
169 desc, enode->m_index, snode_idx, diag_idx, in get_best_epath()
178 desc, enode->m_index, snode_idx, diag_idx); in get_best_epath()
199 desc, enode->m_index, snode_idx, diag_idx, in get_best_epath()
207 desc, enode->m_index, snode_idx, diag_idx, in get_best_epath()
476 fnode->get_index (), fnode->get_inner_node ()->m_index, in process_worklist_item()
485 succ_eedge->m_src->m_index, in process_worklist_item()
486 succ_eedge->m_dest->m_index); in process_worklist_item()
514 target_enode->m_index, diag_idx, in process_worklist_item()
[all …]
H A Dfeasible-graph.h67 unsigned get_index () const { return m_index; } in get_index()
71 : m_inner_node (inner_node), m_index (index) in base_feasible_node()
75 unsigned m_index; variable
H A Dsupergraph.cc560 m_index); in dump_dot()
566 gv->println("label=\"sn: %i (bb: %i)\";", m_index, m_bb->index); in dump_dot()
704 pp_printf (pp, "node_%i", m_index); in dump_dot_id()
720 snode_obj->set ("idx", new json::integer_number (m_index)); in to_json()
856 pp_printf (pp, "edge: SN: %i -> SN: %i", m_src->m_index, m_dest->m_index); in dump()
945 m_src->m_index, m_dest->m_index); in dump_dot()
963 sedge_obj->set ("src_idx", new json::integer_number (m_src->m_index)); in to_json()
964 sedge_obj->set ("dst_idx", new json::integer_number (m_dest->m_index)); in to_json()
H A Dexploded-graph.h328 const int m_index;
698 : m_index (-1), m_lowlink (-1), m_on_stack (false) in per_node_data()
701 int m_index; member
733 return m_scc.get_scc_id (snode.m_index); in get_scc_id()
769 return m_worklist.m_scc.get_scc_id (snode->m_index); in get_scc_id()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dengine.cc170 hstate.add_int (m_setjmp_record.m_enode->m_index); in add_to_hash()
178 return m_setjmp_record.m_enode->m_index; in get_enode_index()
393 eedge->m_src->m_index, in find_stmt()
394 eedge->m_dest->m_index); in find_stmt()
420 eedge->m_src->m_index, in find_stmt()
421 eedge->m_dest->m_index); in find_stmt()
773 cur_start_idx = cur_finish_idx = enode->m_index; in print_enode_indices()
777 if (enode->m_index == cur_finish_idx + 1) in print_enode_indices()
779 cur_finish_idx = enode->m_index; in print_enode_indices()
787 cur_start_idx = cur_finish_idx = enode->m_index; in print_enode_indices()
[all …]
H A Dcall-string.cc98 e->m_src->m_index, e->m_dest->m_index, in print()
182 int src_cmp = edge_a->m_src->m_index - edge_b->m_src->m_index; in cmp()
185 int dest_cmp = edge_a->m_dest->m_index - edge_b->m_dest->m_index; in cmp()
H A Dprogram-point.cc105 m_supernode->m_index, m_from_edge->m_src->m_index); in print()
108 m_supernode->m_index); in print()
121 pp_printf (pp, "before (SN: %i stmt: %i): ", m_supernode->m_index, in print()
133 pp_printf (pp, "after SN: %i", m_supernode->m_index); in print()
145 hstate.add_int (m_supernode->m_index); in hash()
407 a_src_idx = point_a.m_from_edge->m_src->m_index; in cmp_within_supernode_1()
409 b_src_idx = point_b.m_from_edge->m_src->m_index; in cmp_within_supernode_1()
H A Ddiagnostic-manager.cc180 snode->m_index, d->get_kind ()); in add_diagnostic()
367 sd->m_d->get_kind (), sd->m_enode->m_index, in add()
368 sd->m_snode->m_index); in add()
376 sd->m_d->get_kind (), sd->m_enode->m_index, in add()
377 sd->m_snode->m_index); in add()
385 sd->m_d->get_kind (), sd->m_enode->m_index, in add()
386 sd->m_snode->m_index); in add()
488 i, sd->m_d->get_kind (), sd->m_enode->m_index, in emit_saved_diagnostics()
489 sd->m_snode->m_index); in emit_saved_diagnostics()
526 log ("sd: %qs at SN: %i", sd.m_d->get_kind (), sd.m_snode->m_index); in emit_saved_diagnostic()
[all …]
H A Dreachability.h44 bitmap_set_bit (m_indices, target_node->m_index); in reachability()
56 bitmap_set_bit (m_indices, pred->m_src->m_index); in reachability()
64 return bitmap_bit_p (m_indices, src_node->m_index); in reachable_from_p()
H A Dsupergraph.cc450 m_index); in dump_dot()
456 gv->println("label=\"sn: %i (bb: %i)\";", m_index, m_bb->index); in dump_dot()
594 pp_printf (pp, "node_%i", m_index); in dump_dot_id()
666 pp_printf (pp, "edge: SN: %i -> SN: %i", m_src->m_index, m_dest->m_index); in dump()
755 m_src->m_index, m_dest->m_index); in dump_dot()
H A Dchecker-path.cc451 m_sedge->m_src->m_index, in get_desc()
452 m_sedge->m_dest->m_index); in get_desc()
461 m_sedge->m_src->m_index, in get_desc()
462 m_sedge->m_dest->m_index); in get_desc()
/netbsd-src/external/bsd/elftosb/dist/common/
H A DDataSource.cpp178 : DataSource::Segment(source), m_image(image), m_index(index) in TextSegment()
184 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index); in getData()
195 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index); in getLength()
201 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index); in getBaseAddress()
208 : DataSource::PatternSegment(source), m_image(image), m_index(index) in FillSegment()
216 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index); in getLength()
222 const StExecutableImage::MemoryRegion & region = m_image->getRegionAtIndex(m_index); in getBaseAddress()
H A DDataSource.h269 unsigned m_index; //!< Record index. variable
287 unsigned m_index; //!< Record index. variable
/netbsd-src/usr.bin/mail/
H A Dthread.c100 mp->m_index, mp, in show_msg()
237 assert(mp->m_index == msgnum); in get_message()
244 return mp ? mp->m_index : 0; in get_msgnum()
349 mp->m_index = ++i; in reindex_core()
381 mp->m_index = ++i; in reindex()
529 message[i].m_index = i + 1; in thread_fix_new_links()
787 marray[i].mp->m_index = (int)i + 1; in link_array()
1443 marray[i].index = mp->m_index; in field_load()
1463 marray[i].index = mp->m_index; in subj_load()
1489 marray[i].index = mp->m_index; in lines_load()
[all …]

12