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
02f4ada4
Commit
02f4ada4
authored
Jun 27, 1992
by
Richard Kenner
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
*** empty log message ***
From-SVN: r1316
parent
47545f76
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
13 additions
and
12 deletions
+13
-12
gcc/combine.c
+13
-12
No files found.
gcc/combine.c
View file @
02f4ada4
...
...
@@ -1483,6 +1483,7 @@ try_combine (i3, i2, i1)
/* If I2DEST is a hard register or the only use of a pseudo,
we can change its mode. */
if
(
GET_MODE
(
SET_DEST
(
newpat
))
!=
GET_MODE
(
i2dest
)
&&
GET_MODE
(
SET_DEST
(
newpat
))
!=
VOIDmode
&&
(
REGNO
(
i2dest
)
<
FIRST_PSEUDO_REGISTER
||
(
reg_n_sets
[
REGNO
(
i2dest
)]
==
1
&&
!
added_sets_2
&&
!
REG_USERVAR_P
(
i2dest
))))
...
...
@@ -2952,6 +2953,18 @@ subst (x, from, to, in_dest, unique_copy)
GET_MODE_BITSIZE
(
mode
)
-
1
);
goto
restart
;
}
/* If we are adding two things that have no bits in common, convert
the addition into an IOR. This will often be further simplified,
for example in cases like ((a & 1) + (a & 2)), which can
become a & 3. */
if
((
significant_bits
(
XEXP
(
x
,
0
),
mode
)
&
significant_bits
(
XEXP
(
x
,
1
),
mode
))
==
0
)
{
x
=
gen_binary
(
IOR
,
mode
,
XEXP
(
x
,
0
),
XEXP
(
x
,
1
));
goto
restart
;
}
break
;
case
MINUS
:
...
...
@@ -2966,18 +2979,6 @@ subst (x, from, to, in_dest, unique_copy)
-
INTVAL
(
XEXP
(
XEXP
(
x
,
1
),
1
))
-
1
);
goto
restart
;
}
/* If we are adding two things that have no bits in common, convert
the addition into an IOR. This will often be further simplified,
for example in cases like ((a & 1) + (a & 2)), which can
become a & 3. */
if
((
significant_bits
(
XEXP
(
x
,
0
),
mode
)
&
significant_bits
(
XEXP
(
x
,
1
),
mode
))
==
0
)
{
x
=
gen_binary
(
IOR
,
mode
,
XEXP
(
x
,
0
),
XEXP
(
x
,
1
));
goto
restart
;
}
break
;
case
MULT
:
...
...
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