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
10fa1ee2
Commit
10fa1ee2
authored
Sep 15, 1995
by
Richard Kenner
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
(div_and_round_double): Change `carry', `quo_est', and `scale' from
plain int to `unsigned HOST_WIDE_INT'. From-SVN: r10367
parent
970c9ace
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
2 deletions
+3
-2
gcc/fold-const.c
+3
-2
No files found.
gcc/fold-const.c
View file @
10fa1ee2
...
@@ -462,7 +462,7 @@ div_and_round_double (code, uns,
...
@@ -462,7 +462,7 @@ div_and_round_double (code, uns,
HOST_WIDE_INT
den
[
4
],
quo
[
4
];
HOST_WIDE_INT
den
[
4
],
quo
[
4
];
register
int
i
,
j
;
register
int
i
,
j
;
unsigned
HOST_WIDE_INT
work
;
unsigned
HOST_WIDE_INT
work
;
register
int
carry
=
0
;
register
unsigned
HOST_WIDE_INT
carry
=
0
;
HOST_WIDE_INT
lnum
=
lnum_orig
;
HOST_WIDE_INT
lnum
=
lnum_orig
;
HOST_WIDE_INT
hnum
=
hnum_orig
;
HOST_WIDE_INT
hnum
=
hnum_orig
;
HOST_WIDE_INT
lden
=
lden_orig
;
HOST_WIDE_INT
lden
=
lden_orig
;
...
@@ -529,7 +529,8 @@ div_and_round_double (code, uns,
...
@@ -529,7 +529,8 @@ div_and_round_double (code, uns,
{
{
/* Full double precision division,
/* Full double precision division,
with thanks to Don Knuth's "Seminumerical Algorithms". */
with thanks to Don Knuth's "Seminumerical Algorithms". */
int
quo_est
,
scale
,
num_hi_sig
,
den_hi_sig
;
int
num_hi_sig
,
den_hi_sig
;
unsigned
HOST_WIDE_INT
quo_est
,
scale
;
/* Find the highest non-zero divisor digit. */
/* Find the highest non-zero divisor digit. */
for
(
i
=
4
-
1
;
;
i
--
)
for
(
i
=
4
-
1
;
;
i
--
)
...
...
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