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
97989775
Commit
97989775
authored
Mar 16, 1993
by
James Van Artsdalen
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
(FIXED_REGNO_P): Pseudos can't be fixed regs.
From-SVN: r3757
parent
ad0c9fa1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
9 additions
and
5 deletions
+9
-5
gcc/cse.c
+9
-5
No files found.
gcc/cse.c
View file @
97989775
...
@@ -438,11 +438,13 @@ struct table_elt
...
@@ -438,11 +438,13 @@ struct table_elt
but not if it is an overlapping register. */
but not if it is an overlapping register. */
#ifdef OVERLAPPING_REGNO_P
#ifdef OVERLAPPING_REGNO_P
#define FIXED_REGNO_P(N) \
#define FIXED_REGNO_P(N) \
(((N) == FRAME_POINTER_REGNUM || fixed_regs[N]) \
(((N) == FRAME_POINTER_REGNUM \
|| ((N) < FIRST_PSEUDO_REGISTER && fixed_regs[N])) \
&& ! OVERLAPPING_REGNO_P ((N)))
&& ! OVERLAPPING_REGNO_P ((N)))
#else
#else
#define FIXED_REGNO_P(N) \
#define FIXED_REGNO_P(N) \
((N) == FRAME_POINTER_REGNUM || fixed_regs[N])
((N) == FRAME_POINTER_REGNUM \
|| ((N) < FIRST_PSEUDO_REGISTER && fixed_regs[N]))
#endif
#endif
/* Compute cost of X, as stored in the `cost' field of a table_elt. Fixed
/* Compute cost of X, as stored in the `cost' field of a table_elt. Fixed
...
@@ -4472,9 +4474,11 @@ simplify_ternary_operation (code, mode, op0_mode, op0, op1, op2)
...
@@ -4472,9 +4474,11 @@ simplify_ternary_operation (code, mode, op0_mode, op0, op1, op2)
Otherwise, return X, possibly with one or more operands
Otherwise, return X, possibly with one or more operands
modified by recursive calls to this function.
modified by recursive calls to this function.
If X is a register whose contents are known, we do NOT
If X is a register whose contents are known, we may or may not
return those contents. This is because an instruction that
return those contents. An instruction that uses a register is usually
uses a register is usually faster than one that uses a constant.
faster than one that uses a constant. But on machines with few hard
regs, using a register instead of a constant increases register life,
hurting register allocation.
INSN is the insn that we may be modifying. If it is 0, make a copy
INSN is the insn that we may be modifying. If it is 0, make a copy
of X before modifying it. */
of X before modifying 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