182   gcc_assert (src_node->cuid < dest_node->cuid);  in create_ddg_dep_from_intra_loop_link()
310       if (use_node->cuid <= last_def_node->cuid)  in add_cross_iteration_register_deps()
414   if ((from->cuid == to->cuid)  in add_intra_loop_mem_dep()
450       else if (from->cuid != to->cuid)  in add_inter_loop_mem_dep()
459       else if (from->cuid != to->cuid)  in add_inter_loop_mem_dep()
629       g->nodes[i].cuid = i;  in create_ddg()
709       fprintf (file, "Node num: %d\n", g->nodes[i].cuid);  in print_ddg()
741             int dst_cuid = e->dest->cuid;  in vcg_print_ddg()
809   bitmap_set_bit (src->successors, dest->cuid);  in add_edge_to_ddg()
810   bitmap_set_bit (dest->predecessors, src->cuid);  in add_edge_to_ddg()
836       length = longest_simple_path (g, src->cuid, dest->cuid, scc->nodes);  in set_recurrence_length()
870           if (bitmap_bit_p (nodes, e->dest->cuid))  in create_scc()
1047       bitmap_set_bit (from, dest->cuid);  in create_ddg_all_sccs()
1048       bitmap_set_bit (to, src->cuid);  in create_ddg_all_sccs()
1114                 int v = v_node->cuid;  in find_nodes_on_paths()
1143                 int v = v_node->cuid;  in find_nodes_on_paths()
1172       int v = v_node->cuid;  in update_dist_to_successors()