gcc/gcc/tree-ssa-live.c

340   basic_block bb;
353   FOR_EACH_BB (bb)
359       for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
362       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
408   basic_block bb;
432   FOR_EACH_BB (bb)
436       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
450       for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
623 		      tree var, basic_block bb)
626   if (p == NO_PARTITION || bb == ENTRY_BLOCK_PTR)
630       bitmap_set_bit (live->livein[p], bb->index);
644   basic_block bb;
662   FOR_EACH_BB (bb)
666       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
674 	      e = EDGE_PRED (bb, i);
691       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
697       for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
703 	      add_livein_if_notdef (live, saw_def, op, bb);
725   bb = ENTRY_BLOCK_PTR;
727   FOR_EACH_EDGE (e, ei, bb->succs)
818   basic_block bb;
829   FOR_EACH_BB (bb)
831       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1403   basic_block bb;
1422   FOR_EACH_BB (bb)
1429       bitmap_copy (live, live_on_exit (liveinfo, bb));
1431       for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi))
1476 				  coalesce_cost (bb->frequency,
1477 				                 maybe_hot_bb_p (bb), false));
1502       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1858   basic_block bb;
1865       FOR_EACH_BB (bb)
1867 	  fprintf (f, "\nLive on entry to BB%d : ", bb->index);
1870 	      if (bitmap_bit_p (live_entry_blocks (live, i), bb->index))
1882       FOR_EACH_BB (bb)
1884 	  fprintf (f, "\nLive on exit from BB%d : ", bb->index);
1885 	  EXECUTE_IF_SET_IN_BITMAP (live->liveout[bb->index], 0, i, bi)