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
633cdd72
Commit
633cdd72
authored
Jun 30, 2015
by
Vladimir Makarov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add missed test
From-SVN: r225201
parent
ef87312e
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
64 additions
and
0 deletions
+64
-0
gcc/testsuite/gcc.target/i386/pr66691.c
+64
-0
No files found.
gcc/testsuite/gcc.target/i386/pr66691.c
0 → 100644
View file @
633cdd72
/* PR inline-asm/39058 */
/* { dg-do compile } */
/* { dg-require-effective-target ia32 } */
/* { dg-options "-O3 -g -mtune=generic -march=i686" } */
unsigned
int
a
;
int
b
[
2
],
c
,
d
,
e
,
f
,
g
,
h
,
i
,
k
[
8
],
l
,
m
,
s
,
t
,
w
;
static
int
j
;
void
fn1
(
long
long
p
)
{
int
t
=
p
;
c
=
c
^
b
[
c
^
(
t
&
1
)];
}
static
void
fn2
(
long
long
p
)
{
c
=
c
^
b
[
1
^
(
d
&
1
)];
fn1
(
p
>>
1
&
1
);
fn1
(
p
>>
2
);
}
static
void
fn3
()
{
unsigned
char
p
;
f
=
g
=
0
;
for
(
h
=
0
;
h
<
6
;
h
++
)
{
for
(
s
=
0
;
s
<
7
;
s
++
)
if
(
k
[
s
+
1
])
g
=
0
;
else
for
(
j
=
0
;
j
<
2
;
j
++
)
;
t
=
j
>
2
?
0
:
1
>>
j
;
}
if
(
l
)
{
short
q
[
2
];
q
[
0
]
=
q
[
1
]
=
0
;
if
(
m
)
for
(
i
=
0
;
i
<
2
;
i
++
)
{
unsigned
char
r
=
q
[
i
];
p
=
f
?
r
%
f
:
r
;
e
=
((
p
>
0
)
<=
(
q
[
i
]
^
1
))
+
a
;
if
(
k
[
1
])
for
(
e
=
0
;
e
!=
18
;
++
e
)
k
[
0
]
=
0
;
}
}
}
int
main
()
{
fn3
();
fn2
(
w
);
fn2
(
j
);
return
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