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
93ae2b3e
Commit
93ae2b3e
authored
Nov 10, 2000
by
Nick Clifton
Committed by
Nick Clifton
Nov 10, 2000
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add test of unsigned long long multuiple and accumulate.
From-SVN: r37375
parent
9a5a13c9
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
17 additions
and
2 deletions
+17
-2
gcc/testsuite/ChangeLog
+5
-0
gcc/testsuite/gcc.c-torture/execute/20001108-1.c
+12
-2
No files found.
gcc/testsuite/ChangeLog
View file @
93ae2b3e
2000-11-10 Nick Clifton <nickc@redhat.com>
* gcc.c-torture/execute/20001108-1.c: Add test of unsigned long
long multuiple and accumulate.
2000-11-09 Richard Henderson <rth@redhat.com>
* gcc.dg/sequence-pt-1.c: Cast from pointer to integer
...
...
gcc/testsuite/gcc.c-torture/execute/20001108-1.c
View file @
93ae2b3e
long
long
poly
(
long
long
sum
,
long
x
)
signed_
poly
(
long
long
sum
,
long
x
)
{
sum
+=
(
long
long
)
(
long
)
sum
*
(
long
long
)
x
;
return
sum
;
}
unsigned
long
long
unsigned_poly
(
unsigned
long
long
sum
,
unsigned
long
x
)
{
sum
+=
(
unsigned
long
long
)
(
unsigned
long
)
sum
*
(
unsigned
long
long
)
x
;
return
sum
;
}
int
main
(
void
)
{
if
(
poly
(
2LL
,
3
)
!=
8LL
)
if
(
signed_poly
(
2LL
,
-
3
)
!=
-
4LL
)
abort
();
if
(
unsigned_poly
(
2ULL
,
3
)
!=
8ULL
)
abort
();
exit
(
0
);
...
...
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