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
beb5a9b8
Commit
beb5a9b8
authored
30 years ago
by
Richard Kenner
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
(find_reloads): Force reload for paradoxical SUBREG of MEM if
BYTES_BIG_ENDIAN. From-SVN: r7875
parent
1d19ceaa
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
1 deletions
+4
-1
gcc/reload.c
+4
-1
No files found.
gcc/reload.c
View file @
beb5a9b8
...
...
@@ -2566,7 +2566,9 @@ find_reloads (insn, replace, ind_levels, live_known, reload_reg_p)
||
GET_CODE
(
operand
)
==
PLUS
/* We must force a reload of paradoxical SUBREGs
of a MEM because the alignment of the inner value
may not be enough to do the outer reference.
may not be enough to do the outer reference. On
big-endian machines, it may also reference outside
the object.
On machines that extend byte operations and we have a
SUBREG where both the inner and outer modes are no wider
...
...
@@ -2584,6 +2586,7 @@ find_reloads (insn, replace, ind_levels, live_known, reload_reg_p)
<
BIGGEST_ALIGNMENT
)
&&
(
GET_MODE_SIZE
(
operand_mode
[
i
])
>
GET_MODE_SIZE
(
GET_MODE
(
operand
))))
||
(
GET_CODE
(
operand
)
==
MEM
&&
BYTES_BIG_ENDIAN
)
#ifdef LOAD_EXTEND_OP
||
(
GET_MODE_SIZE
(
operand_mode
[
i
])
<=
UNITS_PER_WORD
&&
(
GET_MODE_SIZE
(
GET_MODE
(
operand
))
...
...
This diff is collapsed.
Click to expand it.
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