gcc/gcc/bb-reorder.c

58    The above description is for the full algorithm, which is used when the
204 /* The array which holds needed information for basic blocks.  */
220   /* The round of the STC creation which this trace was found in.  */
248 /* Return the trace number in which BB was visited.  */
488    traces *N_TRACES.  Set the round (which the trace belongs to) to ROUND.
497   /* Heap for discarded basic blocks which are possible starting points for
859    (TRACE is a number of trace which OLD_BB is duplicated to).  */
1280 		    /* If the destination is a start of a trace which is only
1396   /* Avoid duplicating blocks which have many successors (PR/13430).  */
1621   /* Mark which partition (hot/cold) each basic block belongs in.  */
1703 	      int which = BB_PARTITION (bb);
1704 	      which ^= BB_HOT_PARTITION | BB_COLD_PARTITION;
1705 	      BB_SET_PARTITION (bb, which);
1805 	 Otherwise the jump will have to go in a new bb, which will
2002 	   only one executable instruction, which is an unconditional jump.
2331 /* Determine which partition the first basic block in the function
2429    which can seriously pessimize code with many computed jumps in the source
2564       /* Don't duplicate a partition crossing edge, which requires difficult
2614    which basic blocks are hot/cold, updates flags on the basic blocks
2615    to indicate which section they belong in.  This information is
2634    branches (which cannot span all of memory) we take any conditional
2667    between sections; 2). For those architectures which have "short"
2670    and, 3). For those architectures which have "short" unconditional
2792      artificial refs, which means we fail df_verify (much) later.