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
bfab40f8
Commit
bfab40f8
authored
May 30, 2008
by
Eric Botcazou
Committed by
Eric Botcazou
May 30, 2008
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* fold-const.c (fold_unary) <CASE_CONVERT>: Add ??? comment.
From-SVN: r136200
parent
c100de59
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
1 deletions
+8
-1
gcc/ChangeLog
+4
-0
gcc/fold-const.c
+4
-1
No files found.
gcc/ChangeLog
View file @
bfab40f8
2008-05-30 Eric Botcazou <ebotcazou@adacore.com>
* fold-const.c (fold_unary) <CASE_CONVERT>: Add ??? comment.
2008-05-30 Danny Smith <dannysmith@users.sourceforge.net>
* incpath.c: Use HOST_LACKS_INODE_NUMBERS conditional
...
...
gcc/fold-const.c
View file @
bfab40f8
...
...
@@ -7866,7 +7866,10 @@ fold_unary (enum tree_code code, tree type, tree op0)
/* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
constants (if x has signed type, the sign bit cannot be set
in c). This folds extension into the BIT_AND_EXPR. */
in c). This folds extension into the BIT_AND_EXPR.
??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
very likely don't have maximal range for their precision and this
transformation effectively doesn't preserve non-maximal ranges. */
if
(
TREE_CODE
(
type
)
==
INTEGER_TYPE
&&
TREE_CODE
(
op0
)
==
BIT_AND_EXPR
&&
TREE_CODE
(
TREE_OPERAND
(
op0
,
1
))
==
INTEGER_CST
)
...
...
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