aboutsummaryrefslogtreecommitdiff
path: root/gcc/cfgcleanup.c
diff options
context:
space:
mode:
authorJ"orn Rennecke <joern.rennecke@st.com>2005-12-12 14:55:59 +0000
committerJoern Rennecke <amylaar@gcc.gnu.org>2005-12-12 14:55:59 +0000
commit22e0395a104807767c1dda3e97ba8a44d435dee7 (patch)
tree82ddbcc23afcc99d1d1a5c150cc7d84e9f8ddb39 /gcc/cfgcleanup.c
parente5c681b3ee561d6576eff6a4d9244d7916f522e6 (diff)
downloadgcc-22e0395a104807767c1dda3e97ba8a44d435dee7.zip
gcc-22e0395a104807767c1dda3e97ba8a44d435dee7.tar.gz
gcc-22e0395a104807767c1dda3e97ba8a44d435dee7.tar.bz2
cfgcleanup.c (condjump_equiv_p, [...]): Fix whitespace in vincinity of to-be-installed changes.
2005-12-12 J"orn Rennecke <joern.rennecke@st.com> * cfgcleanup.c (condjump_equiv_p, try_crossjump_to_edge): Fix whitespace in vincinity of to-be-installed changes. * struct-equiv.c (merge_memattrs, death_notes_match_p): Fix whitespace. (insns_match_p): Likewise. From-SVN: r108410
Diffstat (limited to 'gcc/cfgcleanup.c')
-rw-r--r--gcc/cfgcleanup.c36
1 files changed, 18 insertions, 18 deletions
diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c
index c8824ff..80d68de 100644
--- a/gcc/cfgcleanup.c
+++ b/gcc/cfgcleanup.c
@@ -956,28 +956,28 @@ condjump_equiv_p (basic_block bb1, basic_block bb2)
int prob2;
if (b1->dest == b2->dest)
- prob2 = b2->probability;
+ prob2 = b2->probability;
else
- /* Do not use f2 probability as f2 may be forwarded. */
- prob2 = REG_BR_PROB_BASE - b2->probability;
+ /* Do not use f2 probability as f2 may be forwarded. */
+ prob2 = REG_BR_PROB_BASE - b2->probability;
/* Fail if the difference in probabilities is greater than 50%.
- This rules out two well-predicted branches with opposite
- outcomes. */
+ This rules out two well-predicted branches with opposite
+ outcomes. */
if (abs (b1->probability - prob2) > REG_BR_PROB_BASE / 2)
- {
- if (dump_file)
- fprintf (dump_file,
- "Outcomes of branch in bb %i and %i differ too much (%i %i)\n",
- bb1->index, bb2->index, b1->probability, prob2);
-
- return false;
- }
+ {
+ if (dump_file)
+ fprintf (dump_file,
+ "Outcomes of branch in bb %i and %i differ too much (%i %i)\n",
+ bb1->index, bb2->index, b1->probability, prob2);
+
+ return false;
+ }
}
if (dump_file && match)
fprintf (dump_file, "Conditionals in bb %i and %i match.\n",
- bb1->index, bb2->index);
+ bb1->index, bb2->index);
return match;
}
@@ -1173,12 +1173,12 @@ try_crossjump_to_edge (int mode, edge e1, edge e2)
newpos1 = newpos2 = NULL_RTX;
/* If we have partitioned hot/cold basic blocks, it is a bad idea
- to try this optimization.
+ to try this optimization.
Basic block partitioning may result in some jumps that appear to
- be optimizable (or blocks that appear to be mergeable), but which really
- must be left untouched (they are required to make it safely across
- partition boundaries). See the comments at the top of
+ be optimizable (or blocks that appear to be mergeable), but which really
+ must be left untouched (they are required to make it safely across
+ partition boundaries). See the comments at the top of
bb-reorder.c:partition_hot_cold_basic_blocks for complete details. */
if (flag_reorder_blocks_and_partition && no_new_pseudos)