summaryrefslogtreecommitdiff
path: root/gcc/stmt.c
diff options
context:
space:
mode:
authorsteven <steven@138bc75d-0d04-0410-961f-82ee72b054a4>2004-05-26 22:36:49 +0000
committersteven <steven@138bc75d-0d04-0410-961f-82ee72b054a4>2004-05-26 22:36:49 +0000
commitb624a250a9f8ce1e45c09d1227ff5e2400387621 (patch)
tree9a721edcedc47294d0570c2ba52be9541243aeec /gcc/stmt.c
parent902c164d119a9062cadc0ceb20655f4566845ca6 (diff)
downloadgcc-b624a250a9f8ce1e45c09d1227ff5e2400387621.tar.gz
* gimplify.c (compare_case_labels): New function.
(gimplify_switch_expr): Sort case labels, and make sure the last label in the label vector is the default case. * tree-cfg.c (group_case_labels): New function. (build_tree_cfg): Cleanup redundant labels and group case labels before creating edges. (cleanup_dead_labels): Handle GOTO_EXPRs. (find_case_label_for_value): Use a binary search to find the case label for the given value. * tree-gimple.c: Mention that labels are sorted, and that the last label must be the default. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@82297 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/stmt.c')
-rw-r--r--gcc/stmt.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/stmt.c b/gcc/stmt.c
index 330ae5f2b53..7c4c67b3bd7 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -4434,8 +4434,8 @@ bool lshift_cheap_p (void)
number of case nodes, i.e. the node with the most cases gets
tested first. */
-static
-int case_bit_test_cmp (const void *p1, const void *p2)
+static int
+case_bit_test_cmp (const void *p1, const void *p2)
{
const struct case_bit_test *d1 = p1;
const struct case_bit_test *d2 = p2;