This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[cfg-branch] bb-reorder indentation fixes
- From: Josef Zlomek <zlomj9am at artax dot karlin dot mff dot cuni dot cz>
- To: gcc-pdo at atrey dot karlin dot mff dot cuni dot cz, gcc-patches at gcc dot gnu dot org
- Date: Tue, 12 Mar 2002 10:09:16 +0100
- Subject: [cfg-branch] bb-reorder indentation fixes
Hi,
this patch fixes the indentation of code.
Joe
Tue Mar 12 10:07:58 CET 2002 Josef Zlomek <zlomek@matfyz.cz>
*** gcc-old/gcc/bb-reorder.c Sat Mar 2 08:52:46 2002
--- gcc-new/gcc/bb-reorder.c Tue Mar 12 09:22:14 2002
*************** find_traces_1_round (branch_th, exec_th,
*** 260,266 ****
freq = EDGE_FREQUENCY (e);
}
else
! {
freq = e->dest->frequency;
}
--- 260,266 ----
freq = EDGE_FREQUENCY (e);
}
else
! {
freq = e->dest->frequency;
}
*************** find_traces_1_round (branch_th, exec_th,
*** 279,287 ****
creation. */
fibheap_insert (*heap, key, e->dest);
else
! /* This successor is possible starting point for next
round of trace creation. */
! fibheap_insert (new_heap, key, e->dest);
if (rtl_dump_file)
fprintf (rtl_dump_file,
--- 279,287 ----
creation. */
fibheap_insert (*heap, key, e->dest);
else
! /* This successor is possible starting point for next
round of trace creation. */
! fibheap_insert (new_heap, key, e->dest);
if (rtl_dump_file)
fprintf (rtl_dump_file,
*************** find_traces_1_round (branch_th, exec_th,
*** 402,412 ****
if (n_basic_blocks > copy_bb_p_visited_size)
{
/* Realloc the COPY_BB_P_VISITED array, copying of data
! is not necessary. */
free (copy_bb_p_visited);
! copy_bb_p_visited_size = 4 * n_basic_blocks / 3;
copy_bb_p_visited = xcalloc (copy_bb_p_visited_size,
! sizeof (unsigned int));
if (!copy_bb_p_visited)
abort ();
}
--- 402,412 ----
if (n_basic_blocks > copy_bb_p_visited_size)
{
/* Realloc the COPY_BB_P_VISITED array, copying of data
! is not necessary. */
free (copy_bb_p_visited);
! copy_bb_p_visited_size = 4 * n_basic_blocks / 3;
copy_bb_p_visited = xcalloc (copy_bb_p_visited_size,
! sizeof (unsigned int));
if (!copy_bb_p_visited)
abort ();
}
*************** find_traces_1_round (branch_th, exec_th,
*** 415,437 ****
{
/* Check for a situation
! A
! /|
! B |
! \|
! C
!
! where
! EDGE_FREQUENCY (AB) + EDGE_FREQUENCY (BC)
! >= EDGE_FREQUENCY (AC).
! (i.e. 2 * B->frequency >= EDGE_FREQUENCY (AC) )
! Best ordering is then A B C.
!
! This situation is created for example by:
! if (A) B;
! C;
*/
for (e = bb->succ; e; e = e->succ_next)
--- 415,436 ----
{
/* Check for a situation
! A
! /|
! B |
! \|
! C
!
! where
! EDGE_FREQUENCY (AB) + EDGE_FREQUENCY (BC)
! >= EDGE_FREQUENCY (AC).
! (i.e. 2 * B->frequency >= EDGE_FREQUENCY (AC) )
! Best ordering is then A B C.
! This situation is created for example by:
+ if (A) B;
+ C;
*/
for (e = bb->succ; e; e = e->succ_next)
*************** copy_bb_p (bb, trace, size_can_grow)
*** 575,581 ****
}
else
id++;
!
if (!bb->frequency)
return false;
if (!bb->pred || !bb->pred->pred_next)
--- 574,580 ----
}
else
id++;
!
if (!bb->frequency)
return false;
if (!bb->pred || !bb->pred->pred_next)
*************** copy_bb_p (bb, trace, size_can_grow)
*** 590,596 ****
else if (probably_never_executed_bb_p (bb))
size_can_grow = false;
}
!
while (1)
{
edge e, best_edge;
--- 589,595 ----
else if (probably_never_executed_bb_p (bb))
size_can_grow = false;
}
!
while (1)
{
edge e, best_edge;
*************** reorder_basic_blocks ()
*** 689,695 ****
copy_bb_p_visited = xcalloc (copy_bb_p_visited_size, sizeof (unsigned int));
if (!copy_bb_p_visited)
abort ();
!
set_edge_can_fallthru_flag ();
uncond_jump_length = get_uncond_jump_length ();
find_traces ();
--- 688,694 ----
copy_bb_p_visited = xcalloc (copy_bb_p_visited_size, sizeof (unsigned int));
if (!copy_bb_p_visited)
abort ();
!
set_edge_can_fallthru_flag ();
uncond_jump_length = get_uncond_jump_length ();
find_traces ();