524   for (i = 0; i < g->num_nodes; i++)  in build_intra_loop_deps()
593   int num_nodes = 0;  in create_ddg()  local
616       num_nodes++;  in create_ddg()
620   if ((num_nodes - g->num_debug) <= 1)  in create_ddg()
627   g->num_nodes = num_nodes;  in create_ddg()
628   g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node));  in create_ddg()
655       g->nodes[i].successors = sbitmap_alloc (num_nodes);  in create_ddg()
657       g->nodes[i].predecessors = sbitmap_alloc (num_nodes);  in create_ddg()
683   for (i = 0; i < g->num_nodes; i++)  in free_ddg()
730   for (i = 0; i < g->num_nodes; i++)  in print_ddg()
755   for (src_cuid = 0; src_cuid < g->num_nodes; src_cuid++)  in vcg_print_ddg()
885   scc->nodes = sbitmap_alloc (g->num_nodes);  in create_scc()
958   for (i = 0; i < g->num_nodes; i++)  in get_node_of_insn()
1026 check_sccs (ddg_all_sccs_ptr sccs, int num_nodes)  in check_sccs()  argument
1029   sbitmap tmp = sbitmap_alloc (num_nodes);  in check_sccs()
1050   int num_nodes = g->num_nodes;  in create_ddg_all_sccs()  local
1051   sbitmap from = sbitmap_alloc (num_nodes);  in create_ddg_all_sccs()
1052   sbitmap to = sbitmap_alloc (num_nodes);  in create_ddg_all_sccs()
1053   sbitmap scc_nodes = sbitmap_alloc (num_nodes);  in create_ddg_all_sccs()
1089   check_sccs (sccs, num_nodes);  in create_ddg_all_sccs()
1120   int num_nodes = g->num_nodes;  in find_nodes_on_paths()  local
1123   sbitmap workset = sbitmap_alloc (num_nodes);  in find_nodes_on_paths()
1124   sbitmap reachable_from = sbitmap_alloc (num_nodes);  in find_nodes_on_paths()
1125   sbitmap reach_to = sbitmap_alloc (num_nodes);  in find_nodes_on_paths()
1126   sbitmap tmp = sbitmap_alloc (num_nodes);  in find_nodes_on_paths()
1232   int num_nodes = g->num_nodes;  in longest_simple_path()  local
1233   sbitmap workset = sbitmap_alloc (num_nodes);  in longest_simple_path()
1234   sbitmap tmp = sbitmap_alloc (num_nodes);  in longest_simple_path()
1239   for (i = 0; i < g->num_nodes; i++)  in longest_simple_path()