Lines Matching defs:num_nodes
270 for (i = src_node->cuid + 1; i < g->num_nodes; i++)
303 for (i = use_node->cuid + 1; i < g->num_nodes; i++)
392 for (i = 0; i < g->num_nodes; i++)
444 int num_nodes = 0;
462 num_nodes++;
466 if (num_nodes <= 1)
473 g->num_nodes = num_nodes;
474 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node));
501 g->nodes[i].successors = sbitmap_alloc (num_nodes);
503 g->nodes[i].predecessors = sbitmap_alloc (num_nodes);
529 for (i = 0; i < g->num_nodes; i++)
575 for (i = 0; i < g->num_nodes; i++)
599 for (src_cuid = 0; src_cuid < g->num_nodes; src_cuid++)
706 scc->nodes = sbitmap_alloc (g->num_nodes);
779 for (i = 0; i < g->num_nodes; i++)
849 int num_nodes = g->num_nodes;
850 sbitmap from = sbitmap_alloc (num_nodes);
851 sbitmap to = sbitmap_alloc (num_nodes);
852 sbitmap scc_nodes = sbitmap_alloc (num_nodes);
915 int num_nodes = g->num_nodes;
918 sbitmap workset = sbitmap_alloc (num_nodes);
919 sbitmap reachable_from = sbitmap_alloc (num_nodes);
920 sbitmap reach_to = sbitmap_alloc (num_nodes);
921 sbitmap tmp = sbitmap_alloc (num_nodes);
1027 int num_nodes = g->num_nodes;
1028 sbitmap workset = sbitmap_alloc (num_nodes);
1029 sbitmap tmp = sbitmap_alloc (num_nodes);
1034 for (i = 0; i < g->num_nodes; i++)