Searched refs:succ_next (Results 1 – 3 of 3) sorted by relevance
108 struct arc_info *succ_next; member598 arc_n = arc->succ_next; in release_structures()818 arc->succ_next = fn->blocks[src].succ; in read_graph_file()938 arc_n = arc->succ_next; in read_graph_file()939 arc->succ_next = arc_p; in read_graph_file()1108 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()1129 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()1159 for (arc_p = NULL, arc = start; (arc_n = arc->succ_next);) in solve_flow_graph()1165 arc_p->succ_next = arc_n; in solve_flow_graph()1168 arc->succ_next = arc_n->succ_next; in solve_flow_graph()[all …]
58 struct edge *pred_next, *succ_next; member105 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()138 e->succ_next = g->vertices[f].succ; in add_edge()160 #define NEXT_EDGE(E) (forward ? (E)->succ_next : (E)->pred_next) in dfs()234 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()249 n = e->succ_next; in free_graph()
10670 (struct edge_def): Remove pred_next, succ_next members.