Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
b2c5a1e9
Commit
b2c5a1e9
authored
Oct 26, 2004
by
Kazu Hirata
Committed by
Kazu Hirata
Oct 26, 2004
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* stmt.c (expand_case): Update a comment.
From-SVN: r89591
parent
5100d114
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
6 additions
and
3 deletions
+6
-3
gcc/ChangeLog
+4
-0
gcc/stmt.c
+2
-3
No files found.
gcc/ChangeLog
View file @
b2c5a1e9
2004
-
10
-
26
Kazu
Hirata
<
kazu
@
cs
.
umass
.
edu
>
*
stmt
.
c
(
expand_case
):
Update
a
comment
.
2004
-
10
-
26
Kazu
Hirata
<
kazu
@
cs
.
umass
.
edu
>
*
stmt
.
c
(
expand_case
):
Put
an
assertion
that
index_expr
is
never
INTEGER_CST
.
Don
't special case for constant
index_expr.
...
...
gcc/stmt.c
View file @
b2c5a1e9
...
...
@@ -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.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment