1 /* Conditional compare related functions
2 Copyright (C) 2014-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
29 #include "fold-const.h"
30 #include "stringpool.h"
31 #include "stor-layout.h"
33 #include "hard-reg-set.h"
36 #include "insn-config.h"
45 #include "insn-codes.h"
47 #include "tree-iterator.h"
49 #include "dominance.h"
51 #include "basic-block.h"
52 #include "tree-ssa-alias.h"
53 #include "internal-fn.h"
54 #include "gimple-expr.h"
56 #include "gimple-ssa.h"
57 #include "tree-ssanames.h"
59 #include "common/common-target.h"
61 #include "tree-ssa-live.h"
62 #include "tree-outof-ssa.h"
63 #include "cfgexpand.h"
64 #include "tree-phinodes.h"
65 #include "ssa-iterators.h"
68 /* The following functions expand conditional compare (CCMP) instructions.
69 Here is a short description about the over all algorithm:
70 * ccmp_candidate_p is used to identify the CCMP candidate
72 * expand_ccmp_expr is the main entry, which calls expand_ccmp_expr_1
75 * expand_ccmp_expr_1 uses a recursive algorithm to expand CCMP.
76 It calls two target hooks gen_ccmp_first and gen_ccmp_next to generate
78 - gen_ccmp_first expands the first compare in CCMP.
79 - gen_ccmp_next expands the following compares.
81 * We use cstorecc4 pattern to convert the CCmode intermediate to
82 the integer mode result that expand_normal is expecting.
84 Since the operands of the later compares might clobber CC reg, we do not
85 emit the insns during expand. We keep the insn sequences in two seq
87 * prep_seq, which includes all the insns to prepare the operands.
88 * gen_seq, which includes all the compare and conditional compares.
90 If all checks OK in expand_ccmp_expr, it emits insns in prep_seq, then
93 /* Check whether G is a potential conditional compare candidate. */
95 ccmp_candidate_p (gimple g
)
97 tree rhs
= gimple_assign_rhs_to_tree (g
);
100 enum tree_code tcode
, tcode0
, tcode1
;
101 tcode
= TREE_CODE (rhs
);
103 if (tcode
!= BIT_AND_EXPR
&& tcode
!= BIT_IOR_EXPR
)
106 lhs
= gimple_assign_lhs (g
);
107 op0
= TREE_OPERAND (rhs
, 0);
108 op1
= TREE_OPERAND (rhs
, 1);
110 if ((TREE_CODE (op0
) != SSA_NAME
) || (TREE_CODE (op1
) != SSA_NAME
)
111 || !has_single_use (lhs
))
114 gs0
= get_gimple_for_ssa_name (op0
);
115 gs1
= get_gimple_for_ssa_name (op1
);
116 if (!gs0
|| !gs1
|| !is_gimple_assign (gs0
) || !is_gimple_assign (gs1
)
117 /* g, gs0 and gs1 must be in the same basic block, since current stage
118 is out-of-ssa. We can not guarantee the correctness when forwording
119 the gs0 and gs1 into g whithout DATAFLOW analysis. */
120 || gimple_bb (gs0
) != gimple_bb (gs1
)
121 || gimple_bb (gs0
) != gimple_bb (g
))
124 if (!(INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_rhs1 (gs0
)))
125 || POINTER_TYPE_P (TREE_TYPE (gimple_assign_rhs1 (gs0
))))
126 || !(INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_rhs1 (gs1
)))
127 || POINTER_TYPE_P (TREE_TYPE (gimple_assign_rhs1 (gs1
)))))
130 tcode0
= gimple_assign_rhs_code (gs0
);
131 tcode1
= gimple_assign_rhs_code (gs1
);
132 if (TREE_CODE_CLASS (tcode0
) == tcc_comparison
133 && TREE_CODE_CLASS (tcode1
) == tcc_comparison
)
135 if (TREE_CODE_CLASS (tcode0
) == tcc_comparison
136 && ccmp_candidate_p (gs1
))
138 else if (TREE_CODE_CLASS (tcode1
) == tcc_comparison
139 && ccmp_candidate_p (gs0
))
141 /* We skip ccmp_candidate_p (gs1) && ccmp_candidate_p (gs0) since
142 there is no way to set the CC flag. */
146 /* PREV is the CC flag from precvious compares. The function expands the
147 next compare based on G which ops previous compare with CODE.
148 PREP_SEQ returns all insns to prepare opearands for compare.
149 GEN_SEQ returnss all compare insns. */
151 expand_ccmp_next (gimple g
, enum tree_code code
, rtx prev
,
152 rtx
*prep_seq
, rtx
*gen_seq
)
155 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (gimple_assign_rhs1 (g
)));
157 gcc_assert (code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
);
159 rcode
= get_rtx_code (gimple_assign_rhs_code (g
), unsignedp
);
161 return targetm
.gen_ccmp_next (prep_seq
, gen_seq
, prev
, rcode
,
162 gimple_assign_rhs1 (g
),
163 gimple_assign_rhs2 (g
),
164 get_rtx_code (code
, 0));
167 /* Expand conditional compare gimple G. A typical CCMP sequence is like:
170 CC1 = CCMP (NE (CC0, 0), CMP (e, f));
172 CCn = CCMP (NE (CCn-1, 0), CMP (...));
174 hook gen_ccmp_first is used to expand the first compare.
175 hook gen_ccmp_next is used to expand the following CCMP.
176 PREP_SEQ returns all insns to prepare opearand.
177 GEN_SEQ returns all compare insns. */
179 expand_ccmp_expr_1 (gimple g
, rtx
*prep_seq
, rtx
*gen_seq
)
181 tree exp
= gimple_assign_rhs_to_tree (g
);
182 enum tree_code code
= TREE_CODE (exp
);
183 gimple gs0
= get_gimple_for_ssa_name (TREE_OPERAND (exp
, 0));
184 gimple gs1
= get_gimple_for_ssa_name (TREE_OPERAND (exp
, 1));
186 enum tree_code code0
= gimple_assign_rhs_code (gs0
);
187 enum tree_code code1
= gimple_assign_rhs_code (gs1
);
189 gcc_assert (code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
);
190 gcc_assert (gs0
&& gs1
&& is_gimple_assign (gs0
) && is_gimple_assign (gs1
));
192 if (TREE_CODE_CLASS (code0
) == tcc_comparison
)
194 if (TREE_CODE_CLASS (code1
) == tcc_comparison
)
197 enum rtx_code rcode0
;
199 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (gimple_assign_rhs1 (gs0
)));
200 rcode0
= get_rtx_code (code0
, unsignedp0
);
202 tmp
= targetm
.gen_ccmp_first (prep_seq
, gen_seq
, rcode0
,
203 gimple_assign_rhs1 (gs0
),
204 gimple_assign_rhs2 (gs0
));
208 return expand_ccmp_next (gs1
, code
, tmp
, prep_seq
, gen_seq
);
212 tmp
= expand_ccmp_expr_1 (gs1
, prep_seq
, gen_seq
);
216 return expand_ccmp_next (gs0
, code
, tmp
, prep_seq
, gen_seq
);
221 gcc_assert (gimple_assign_rhs_code (gs0
) == BIT_AND_EXPR
222 || gimple_assign_rhs_code (gs0
) == BIT_IOR_EXPR
);
224 if (TREE_CODE_CLASS (gimple_assign_rhs_code (gs1
)) == tcc_comparison
)
226 tmp
= expand_ccmp_expr_1 (gs0
, prep_seq
, gen_seq
);
230 return expand_ccmp_next (gs1
, code
, tmp
, prep_seq
, gen_seq
);
234 gcc_assert (gimple_assign_rhs_code (gs1
) == BIT_AND_EXPR
235 || gimple_assign_rhs_code (gs1
) == BIT_IOR_EXPR
);
242 /* Main entry to expand conditional compare statement G.
243 Return NULL_RTX if G is not a legal candidate or expand fail.
244 Otherwise return the target. */
246 expand_ccmp_expr (gimple g
)
250 rtx prep_seq
, gen_seq
;
252 prep_seq
= gen_seq
= NULL_RTX
;
254 if (!ccmp_candidate_p (g
))
257 last
= get_last_insn ();
258 tmp
= expand_ccmp_expr_1 (g
, &prep_seq
, &gen_seq
);
262 enum insn_code icode
;
263 enum machine_mode cc_mode
= CCmode
;
264 tree lhs
= gimple_assign_lhs (g
);
266 #ifdef SELECT_CC_MODE
267 cc_mode
= SELECT_CC_MODE (NE
, tmp
, const0_rtx
);
269 icode
= optab_handler (cstore_optab
, cc_mode
);
270 if (icode
!= CODE_FOR_nothing
)
272 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (lhs
));
273 rtx target
= gen_reg_rtx (mode
);
275 emit_insn (prep_seq
);
278 tmp
= emit_cstore (target
, icode
, NE
, cc_mode
, cc_mode
,
279 0, tmp
, const0_rtx
, 1, mode
);
285 delete_insns_since (last
);