Searched refs:pred_next (Results 1 – 3 of 3) sorted by relevance
58 struct edge *pred_next, *succ_next; member100 for (e = g->vertices[i].pred; e; e = e->pred_next) in dump_graph()135 e->pred_next = g->vertices[t].pred; in add_edge()160 #define NEXT_EDGE(E) (forward ? (E)->succ_next : (E)->pred_next) in dfs()
109 struct arc_info *pred_next; member822 arc->pred_next = fn->blocks[dest].pred; in read_graph_file()946 arc_n = arc->pred_next; in read_graph_file()947 arc->pred_next = arc_p; in read_graph_file()1140 && arc->dst->pred == arc && !arc->pred_next) in solve_flow_graph()1202 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()1262 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()1614 for (arc = block->pred; arc; arc = arc->pred_next) in accumulate_line_counts()1828 for (; arc; arc = arc->pred_next) in output_lines()
10670 (struct edge_def): Remove pred_next, succ_next members.