aboutsummaryrefslogtreecommitdiff
path: root/gcc/bb-reorder.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/bb-reorder.c')
-rw-r--r--gcc/bb-reorder.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c
index d3bc4f9..2cbeb6a 100644
--- a/gcc/bb-reorder.c
+++ b/gcc/bb-reorder.c
@@ -594,7 +594,7 @@ find_traces_1_round (int branch_th, int exec_th, gcov_type count_th,
After removing the best edge, the final result will be ABCD/ ACBD.
It does not add jump compared with the previous order. But it
- reduces the possiblity of long jumps. */
+ reduces the possibility of long jumps. */
if (best_edge && for_size
&& (EDGE_COUNT (best_edge->dest->succs) > 1
|| EDGE_COUNT (best_edge->dest->preds) > 1))