145   for (i = 0; i < loop->num_nodes; i++)  in flow_loop_dump()
231   int num_nodes = 1;  in flow_loop_nodes_find()  local
245       num_nodes++;  in flow_loop_nodes_find()
266 		  num_nodes++;  in flow_loop_nodes_find()
274   return num_nodes;  in flow_loop_nodes_find()
359   root->num_nodes = n_basic_blocks;  in init_loops_structure()
475 	  loop->num_nodes = flow_loop_nodes_find (loop->header, loop);  in flow_loops_find()
814   gcc_assert (loop->num_nodes);  in get_loop_body()
816   body = XCNEWVEC (basic_block, loop->num_nodes);  in get_loop_body()
822       gcc_assert (loop->num_nodes == (unsigned) n_basic_blocks);  in get_loop_body()
829     tv = get_loop_body_with_size (loop, body, loop->num_nodes);  in get_loop_body()
831   gcc_assert (tv == loop->num_nodes);  in get_loop_body()
874   gcc_assert (loop->num_nodes);  in get_loop_body_in_dom_order()
876   tovisit = XCNEWVEC (basic_block, loop->num_nodes);  in get_loop_body_in_dom_order()
883   gcc_assert (tv == (int) loop->num_nodes);  in get_loop_body_in_dom_order()
896   qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);  in get_loop_body_in_custom_order()
912   gcc_assert (loop->num_nodes);  in get_loop_body_in_bfs_order()
915   blocks = XCNEWVEC (basic_block, loop->num_nodes);  in get_loop_body_in_bfs_order()
919   while (i < loop->num_nodes)  in get_loop_body_in_bfs_order()
1147       for (i = 0; i < loop->num_nodes; i++)  in VEC()
1171   for (i = 0; i < loop->num_nodes; i++)  in num_loop_branches()
1191   loop->num_nodes++;  in add_bb_to_loop()
1193     ploop->num_nodes++;  in add_bb_to_loop()
1216   loop->num_nodes--;  in remove_bb_from_loops()
1218     ploop->num_nodes--;  in remove_bb_from_loops()
1285   for (i = 0; i < loop->num_nodes; i++)  in cancel_loop()
1333       if (loop->num_nodes != sizes[i])  in verify_loop_structure()
1336 		   i, sizes[i], loop->num_nodes);  in verify_loop_structure()
1346       for (j = 0; j < loop->num_nodes; j++)  in verify_loop_structure()