Lines Matching defs:num_nodes
141 for (i = 0; i < loop->num_nodes; i++)
229 int num_nodes = 1;
238 num_nodes++;
260 num_nodes++;
267 return num_nodes;
679 loops->parray[0]->num_nodes = n_basic_blocks;
739 loop->num_nodes = flow_loop_nodes_find (loop->header, loop);
790 gcc_assert (loop->num_nodes);
792 tovisit = XCNEWVEC (basic_block, loop->num_nodes);
798 gcc_assert (loop->num_nodes == (unsigned) n_basic_blocks);
806 tovisit + 1, loop->num_nodes - 1,
810 gcc_assert (tv == loop->num_nodes);
853 gcc_assert (loop->num_nodes);
855 tovisit = XCNEWVEC (basic_block, loop->num_nodes);
862 gcc_assert (tv == (int) loop->num_nodes);
878 gcc_assert (loop->num_nodes);
881 blocks = XCNEWVEC (basic_block, loop->num_nodes);
885 while (i < loop->num_nodes)
931 for (i = 0; i < loop->num_nodes; i++)
938 for (i = 0; i < loop->num_nodes; i++)
959 for (i = 0; i < loop->num_nodes; i++)
975 loop->num_nodes++;
977 loop->pred[i]->num_nodes++;
987 loop->num_nodes--;
989 loop->pred[i]->num_nodes--;
1026 for (i = 0; i < loop->num_nodes; i++)
1078 if (loops->parray[i]->num_nodes != sizes[i])
1081 i, sizes[i], loops->parray[i]->num_nodes);
1094 for (j = 0; j < loop->num_nodes; j++)