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
0e8c9172
Commit
0e8c9172
authored
May 05, 1995
by
Richard Kenner
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
(do_jump, case EQ_EXPR, NE_EXPR): Properly compare complex.
From-SVN: r9577
parent
0d481071
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
44 additions
and
12 deletions
+44
-12
gcc/expr.c
+44
-12
No files found.
gcc/expr.c
View file @
0e8c9172
...
...
@@ -9095,32 +9095,64 @@ do_jump (exp, if_false_label, if_true_label)
break
;
case
EQ_EXPR
:
{
tree
inner_type
=
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
));
if
(
integer_zerop
(
TREE_OPERAND
(
exp
,
1
)))
do_jump
(
TREE_OPERAND
(
exp
,
0
),
if_true_label
,
if_false_label
);
else
if
(((
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_INT
)
&&
!
can_compare_p
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
)))))
||
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_COMPLEX_FLOAT
||
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_COMPLEX_INT
)
else
if
(
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
))
==
MODE_COMPLEX_FLOAT
||
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
)
==
MODE_COMPLEX_INT
))
do_jump
(
fold
(
build
(
TRUTH_ANDIF_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build
(
EQ_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build1
(
REALPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
0
))),
fold
(
build1
(
REALPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
1
))))),
fold
(
build
(
EQ_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build1
(
IMAGPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
0
))),
fold
(
build1
(
IMAGPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
1
))))))),
if_false_label
,
if_true_label
);
else
if
(
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
))
==
MODE_INT
&&
!
can_compare_p
(
TYPE_MODE
(
inner_type
)))
do_jump_by_parts_equality
(
exp
,
if_false_label
,
if_true_label
);
else
comparison
=
compare
(
exp
,
EQ
,
EQ
);
break
;
}
case
NE_EXPR
:
{
tree
inner_type
=
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
));
if
(
integer_zerop
(
TREE_OPERAND
(
exp
,
1
)))
do_jump
(
TREE_OPERAND
(
exp
,
0
),
if_false_label
,
if_true_label
);
else
if
(((
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_INT
)
&&
!
can_compare_p
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
)))))
||
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_COMPLEX_FLOAT
||
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
0
))))
==
MODE_COMPLEX_INT
)
else
if
(
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
))
==
MODE_COMPLEX_FLOAT
||
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
)
==
MODE_COMPLEX_INT
))
do_jump
(
fold
(
build
(
TRUTH_ORIF_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build
(
NE_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build1
(
REALPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
0
))),
fold
(
build1
(
REALPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
1
))))),
fold
(
build
(
NE_EXPR
,
TREE_TYPE
(
exp
),
fold
(
build1
(
IMAGPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
0
))),
fold
(
build1
(
IMAGPART_EXPR
,
inner_type
,
TREE_OPERAND
(
exp
,
1
))))))),
if_false_label
,
if_true_label
);
else
if
(
GET_MODE_CLASS
(
TYPE_MODE
(
inner_type
))
==
MODE_INT
&&
!
can_compare_p
(
TYPE_MODE
(
inner_type
)))
do_jump_by_parts_equality
(
exp
,
if_true_label
,
if_false_label
);
else
comparison
=
compare
(
exp
,
NE
,
NE
);
break
;
}
case
LT_EXPR
:
if
((
GET_MODE_CLASS
(
TYPE_MODE
(
TREE_TYPE
(
TREE_OPERAND
(
exp
,
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