summaryrefslogtreecommitdiff
path: root/gcc/stmt.c
diff options
context:
space:
mode:
authorkazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4>2004-10-26 17:25:32 +0000
committerkazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4>2004-10-26 17:25:32 +0000
commitcc15f5579b75413de9c3ab4f7048ab3ad4cbe657 (patch)
tree6540d67083af01170ae60c91361108799375546a /gcc/stmt.c
parent32dc5157ff0e8c829c2dec49f4c8a837cbf82f11 (diff)
downloadgcc-cc15f5579b75413de9c3ab4f7048ab3ad4cbe657.tar.gz
* stmt.c (expand_case): Update a comment.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@89591 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/stmt.c')
-rw-r--r--gcc/stmt.c5
1 files changed, 2 insertions, 3 deletions
diff --git a/gcc/stmt.c b/gcc/stmt.c
index 3e866cde918..f9efbfee0b2 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -2499,9 +2499,8 @@ expand_case (tree exp)
if (MEM_P (index))
index = copy_to_reg (index);
- /* If the index expression is not constant we generate
- a binary decision tree to select the appropriate
- target code. This is done as follows:
+ /* We generate a binary decision tree to select the
+ appropriate target code. This is done as follows:
The list of cases is rearranged into a binary tree,
nearly optimal assuming equal probability for each case.