]>
Commit | Line | Data |
---|---|---|
1f215c26 | 1 | /* Expand the basic unary and binary arithmetic operations, for GNU compiler. |
2f791da8 | 2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
89ae05a2 | 3 | 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. |
1f215c26 | 4 | |
f12b58b3 | 5 | This file is part of GCC. |
1f215c26 | 6 | |
f12b58b3 | 7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
1f215c26 | 11 | |
f12b58b3 | 12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
1f215c26 | 16 | |
17 | You should have received a copy of the GNU General Public License | |
f12b58b3 | 18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
1f215c26 | 21 | |
22 | ||
23 | #include "config.h" | |
405711de | 24 | #include "system.h" |
805e22b2 | 25 | #include "coretypes.h" |
26 | #include "tm.h" | |
d3b64f2d | 27 | #include "toplev.h" |
3eee82c5 | 28 | |
29 | /* Include insn-config.h before expr.h so that HAVE_conditional_move | |
aa40f561 | 30 | is properly defined. */ |
3eee82c5 | 31 | #include "insn-config.h" |
1f215c26 | 32 | #include "rtl.h" |
33 | #include "tree.h" | |
7953c610 | 34 | #include "tm_p.h" |
1f215c26 | 35 | #include "flags.h" |
0a893c29 | 36 | #include "function.h" |
df4b504c | 37 | #include "except.h" |
1f215c26 | 38 | #include "expr.h" |
d8fc4d0b | 39 | #include "optabs.h" |
40 | #include "libfuncs.h" | |
1f215c26 | 41 | #include "recog.h" |
4ed2a1b5 | 42 | #include "reload.h" |
a7b0c170 | 43 | #include "ggc.h" |
d8c9779c | 44 | #include "real.h" |
d16f9b9d | 45 | #include "basic-block.h" |
1f215c26 | 46 | |
47 | /* Each optab contains info on how this target machine | |
48 | can perform a particular operation | |
49 | for all sizes and kinds of operands. | |
50 | ||
51 | The operation to be performed is often specified | |
52 | by passing one of these optabs as an argument. | |
53 | ||
54 | See expr.h for documentation of these optabs. */ | |
55 | ||
f8af7043 | 56 | optab optab_table[OTI_MAX]; |
57 | ||
58 | rtx libfunc_table[LTI_MAX]; | |
5eb0d754 | 59 | |
2850b1f2 | 60 | /* Tables of patterns for extending one integer mode to another. */ |
61 | enum insn_code extendtab[MAX_MACHINE_MODE][MAX_MACHINE_MODE][2]; | |
62 | ||
a92771b8 | 63 | /* Tables of patterns for converting between fixed and floating point. */ |
2850b1f2 | 64 | enum insn_code fixtab[NUM_MACHINE_MODES][NUM_MACHINE_MODES][2]; |
65 | enum insn_code fixtrunctab[NUM_MACHINE_MODES][NUM_MACHINE_MODES][2]; | |
66 | enum insn_code floattab[NUM_MACHINE_MODES][NUM_MACHINE_MODES][2]; | |
67 | ||
94a588c3 | 68 | /* Contains the optab used for each rtx code. */ |
69 | optab code_to_optab[NUM_RTX_CODE + 1]; | |
70 | ||
1f215c26 | 71 | /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...) |
72 | gives the gen_function to make a branch to test that condition. */ | |
73 | ||
74 | rtxfun bcc_gen_fctn[NUM_RTX_CODE]; | |
75 | ||
76 | /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...) | |
77 | gives the insn code to make a store-condition insn | |
78 | to test that condition. */ | |
79 | ||
80 | enum insn_code setcc_gen_code[NUM_RTX_CODE]; | |
81 | ||
62528147 | 82 | #ifdef HAVE_conditional_move |
83 | /* Indexed by the machine mode, gives the insn code to make a conditional | |
84 | move insn. This is not indexed by the rtx-code like bcc_gen_fctn and | |
85 | setcc_gen_code to cut down on the number of named patterns. Consider a day | |
86 | when a lot more rtx codes are conditional (eg: for the ARM). */ | |
87 | ||
88 | enum insn_code movcc_gen_code[NUM_MACHINE_MODES]; | |
89 | #endif | |
90 | ||
b3a15ba6 | 91 | /* The insn generating function can not take an rtx_code argument. |
92 | TRAP_RTX is used as an rtx argument. Its code is replaced with | |
93 | the code to be used in the trap insn and all other fields are ignored. */ | |
94 | static GTY(()) rtx trap_rtx; | |
95 | ||
3ad4992f | 96 | static int add_equal_note (rtx, rtx, enum rtx_code, rtx, rtx); |
97 | static rtx widen_operand (rtx, enum machine_mode, enum machine_mode, int, | |
98 | int); | |
99 | static int expand_cmplxdiv_straight (rtx, rtx, rtx, rtx, rtx, rtx, | |
100 | enum machine_mode, int, | |
101 | enum optab_methods, enum mode_class, | |
102 | optab); | |
103 | static int expand_cmplxdiv_wide (rtx, rtx, rtx, rtx, rtx, rtx, | |
104 | enum machine_mode, int, enum optab_methods, | |
105 | enum mode_class, optab); | |
106 | static void prepare_cmp_insn (rtx *, rtx *, enum rtx_code *, rtx, | |
107 | enum machine_mode *, int *, | |
108 | enum can_compare_purpose); | |
109 | static enum insn_code can_fix_p (enum machine_mode, enum machine_mode, int, | |
110 | int *); | |
111 | static enum insn_code can_float_p (enum machine_mode, enum machine_mode, int); | |
112 | static rtx ftruncify (rtx); | |
113 | static optab new_optab (void); | |
114 | static inline optab init_optab (enum rtx_code); | |
115 | static inline optab init_optabv (enum rtx_code); | |
116 | static void init_libfuncs (optab, int, int, const char *, int); | |
117 | static void init_integral_libfuncs (optab, const char *, int); | |
118 | static void init_floating_libfuncs (optab, const char *, int); | |
119 | static void emit_cmp_and_jump_insn_1 (rtx, rtx, enum machine_mode, | |
120 | enum rtx_code, int, rtx); | |
121 | static void prepare_float_lib_cmp (rtx *, rtx *, enum rtx_code *, | |
122 | enum machine_mode *, int *); | |
123 | static rtx expand_vector_binop (enum machine_mode, optab, rtx, rtx, rtx, int, | |
124 | enum optab_methods); | |
125 | static rtx expand_vector_unop (enum machine_mode, optab, rtx, rtx, int); | |
126 | static rtx widen_clz (enum machine_mode, rtx, rtx); | |
127 | static rtx expand_parity (enum machine_mode, rtx, rtx); | |
b3a15ba6 | 128 | |
129 | #ifndef HAVE_conditional_trap | |
130 | #define HAVE_conditional_trap 0 | |
131 | #define gen_conditional_trap(a,b) (abort (), NULL_RTX) | |
132 | #endif | |
1f215c26 | 133 | \f |
31d3e01c | 134 | /* Add a REG_EQUAL note to the last insn in INSNS. TARGET is being set to |
1f215c26 | 135 | the result of operation CODE applied to OP0 (and OP1 if it is a binary |
136 | operation). | |
137 | ||
138 | If the last insn does not set TARGET, don't do anything, but return 1. | |
139 | ||
140 | If a previous insn sets TARGET and TARGET is one of OP0 or OP1, | |
141 | don't add the REG_EQUAL note but return 0. Our caller can then try | |
142 | again, ensuring that TARGET is not one of the operands. */ | |
143 | ||
144 | static int | |
3ad4992f | 145 | add_equal_note (rtx insns, rtx target, enum rtx_code code, rtx op0, rtx op1) |
1f215c26 | 146 | { |
31d3e01c | 147 | rtx last_insn, insn, set; |
1f215c26 | 148 | rtx note; |
149 | ||
31d3e01c | 150 | if (! insns |
151 | || ! INSN_P (insns) | |
152 | || NEXT_INSN (insns) == NULL_RTX) | |
153 | abort (); | |
154 | ||
155 | if (GET_RTX_CLASS (code) != '1' && GET_RTX_CLASS (code) != '2' | |
156 | && GET_RTX_CLASS (code) != 'c' && GET_RTX_CLASS (code) != '<') | |
157 | return 1; | |
158 | ||
159 | if (GET_CODE (target) == ZERO_EXTRACT) | |
160 | return 1; | |
161 | ||
162 | for (last_insn = insns; | |
163 | NEXT_INSN (last_insn) != NULL_RTX; | |
164 | last_insn = NEXT_INSN (last_insn)) | |
165 | ; | |
166 | ||
167 | set = single_set (last_insn); | |
168 | if (set == NULL_RTX) | |
169 | return 1; | |
170 | ||
171 | if (! rtx_equal_p (SET_DEST (set), target) | |
52ce4c9b | 172 | /* For a STRICT_LOW_PART, the REG_NOTE applies to what is inside it. */ |
31d3e01c | 173 | && (GET_CODE (SET_DEST (set)) != STRICT_LOW_PART |
52ce4c9b | 174 | || ! rtx_equal_p (XEXP (SET_DEST (set), 0), target))) |
1f215c26 | 175 | return 1; |
176 | ||
177 | /* If TARGET is in OP0 or OP1, check if anything in SEQ sets TARGET | |
178 | besides the last insn. */ | |
179 | if (reg_overlap_mentioned_p (target, op0) | |
180 | || (op1 && reg_overlap_mentioned_p (target, op1))) | |
31d3e01c | 181 | { |
182 | insn = PREV_INSN (last_insn); | |
183 | while (insn != NULL_RTX) | |
184 | { | |
185 | if (reg_set_p (target, insn)) | |
186 | return 0; | |
187 | ||
188 | insn = PREV_INSN (insn); | |
189 | } | |
190 | } | |
1f215c26 | 191 | |
192 | if (GET_RTX_CLASS (code) == '1') | |
e02c6d1f | 193 | note = gen_rtx_fmt_e (code, GET_MODE (target), copy_rtx (op0)); |
1f215c26 | 194 | else |
e02c6d1f | 195 | note = gen_rtx_fmt_ee (code, GET_MODE (target), copy_rtx (op0), copy_rtx (op1)); |
1f215c26 | 196 | |
31d3e01c | 197 | set_unique_reg_note (last_insn, REG_EQUAL, note); |
1f215c26 | 198 | |
199 | return 1; | |
200 | } | |
201 | \f | |
45282828 | 202 | /* Widen OP to MODE and return the rtx for the widened operand. UNSIGNEDP |
203 | says whether OP is signed or unsigned. NO_EXTEND is nonzero if we need | |
3ad4992f | 204 | not actually do a sign-extend or zero-extend, but can leave the |
45282828 | 205 | higher-order bits of the result rtx undefined, for example, in the case |
206 | of logical operations, but not right shifts. */ | |
207 | ||
208 | static rtx | |
3ad4992f | 209 | widen_operand (rtx op, enum machine_mode mode, enum machine_mode oldmode, |
210 | int unsignedp, int no_extend) | |
45282828 | 211 | { |
212 | rtx result; | |
213 | ||
8b315642 | 214 | /* If we don't have to extend and this is a constant, return it. */ |
215 | if (no_extend && GET_MODE (op) == VOIDmode) | |
216 | return op; | |
217 | ||
218 | /* If we must extend do so. If OP is a SUBREG for a promoted object, also | |
219 | extend since it will be more efficient to do so unless the signedness of | |
220 | a promoted object differs from our extension. */ | |
45282828 | 221 | if (! no_extend |
e99172f2 | 222 | || (GET_CODE (op) == SUBREG && SUBREG_PROMOTED_VAR_P (op) |
223 | && SUBREG_PROMOTED_UNSIGNED_P (op) == unsignedp)) | |
92d67582 | 224 | return convert_modes (mode, oldmode, op, unsignedp); |
45282828 | 225 | |
226 | /* If MODE is no wider than a single word, we return a paradoxical | |
227 | SUBREG. */ | |
228 | if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD) | |
e02c6d1f | 229 | return gen_rtx_SUBREG (mode, force_reg (GET_MODE (op), op), 0); |
45282828 | 230 | |
231 | /* Otherwise, get an object of MODE, clobber it, and set the low-order | |
232 | part to OP. */ | |
233 | ||
234 | result = gen_reg_rtx (mode); | |
e02c6d1f | 235 | emit_insn (gen_rtx_CLOBBER (VOIDmode, result)); |
45282828 | 236 | emit_move_insn (gen_lowpart (GET_MODE (op), result), op); |
237 | return result; | |
238 | } | |
239 | \f | |
27bc6aee | 240 | /* Generate code to perform a straightforward complex divide. */ |
241 | ||
242 | static int | |
3ad4992f | 243 | expand_cmplxdiv_straight (rtx real0, rtx real1, rtx imag0, rtx imag1, |
244 | rtx realr, rtx imagr, enum machine_mode submode, | |
245 | int unsignedp, enum optab_methods methods, | |
246 | enum mode_class class, optab binoptab) | |
27bc6aee | 247 | { |
248 | rtx divisor; | |
249 | rtx real_t, imag_t; | |
250 | rtx temp1, temp2; | |
251 | rtx res; | |
bec2d490 | 252 | optab this_add_optab = add_optab; |
253 | optab this_sub_optab = sub_optab; | |
254 | optab this_neg_optab = neg_optab; | |
255 | optab this_mul_optab = smul_optab; | |
3ad4992f | 256 | |
bec2d490 | 257 | if (binoptab == sdivv_optab) |
258 | { | |
259 | this_add_optab = addv_optab; | |
260 | this_sub_optab = subv_optab; | |
261 | this_neg_optab = negv_optab; | |
262 | this_mul_optab = smulv_optab; | |
263 | } | |
264 | ||
27bc6aee | 265 | /* Don't fetch these from memory more than once. */ |
266 | real0 = force_reg (submode, real0); | |
267 | real1 = force_reg (submode, real1); | |
268 | ||
269 | if (imag0 != 0) | |
270 | imag0 = force_reg (submode, imag0); | |
271 | ||
272 | imag1 = force_reg (submode, imag1); | |
273 | ||
274 | /* Divisor: c*c + d*d. */ | |
bec2d490 | 275 | temp1 = expand_binop (submode, this_mul_optab, real1, real1, |
27bc6aee | 276 | NULL_RTX, unsignedp, methods); |
277 | ||
bec2d490 | 278 | temp2 = expand_binop (submode, this_mul_optab, imag1, imag1, |
27bc6aee | 279 | NULL_RTX, unsignedp, methods); |
280 | ||
281 | if (temp1 == 0 || temp2 == 0) | |
282 | return 0; | |
283 | ||
bec2d490 | 284 | divisor = expand_binop (submode, this_add_optab, temp1, temp2, |
27bc6aee | 285 | NULL_RTX, unsignedp, methods); |
286 | if (divisor == 0) | |
287 | return 0; | |
288 | ||
63ec94ba | 289 | if (imag0 == 0) |
27bc6aee | 290 | { |
291 | /* Mathematically, ((a)(c-id))/divisor. */ | |
292 | /* Computationally, (a+i0) / (c+id) = (ac/(cc+dd)) + i(-ad/(cc+dd)). */ | |
293 | ||
294 | /* Calculate the dividend. */ | |
bec2d490 | 295 | real_t = expand_binop (submode, this_mul_optab, real0, real1, |
27bc6aee | 296 | NULL_RTX, unsignedp, methods); |
3ad4992f | 297 | |
bec2d490 | 298 | imag_t = expand_binop (submode, this_mul_optab, real0, imag1, |
27bc6aee | 299 | NULL_RTX, unsignedp, methods); |
300 | ||
301 | if (real_t == 0 || imag_t == 0) | |
302 | return 0; | |
303 | ||
bec2d490 | 304 | imag_t = expand_unop (submode, this_neg_optab, imag_t, |
27bc6aee | 305 | NULL_RTX, unsignedp); |
306 | } | |
307 | else | |
308 | { | |
309 | /* Mathematically, ((a+ib)(c-id))/divider. */ | |
310 | /* Calculate the dividend. */ | |
bec2d490 | 311 | temp1 = expand_binop (submode, this_mul_optab, real0, real1, |
27bc6aee | 312 | NULL_RTX, unsignedp, methods); |
313 | ||
bec2d490 | 314 | temp2 = expand_binop (submode, this_mul_optab, imag0, imag1, |
27bc6aee | 315 | NULL_RTX, unsignedp, methods); |
316 | ||
317 | if (temp1 == 0 || temp2 == 0) | |
318 | return 0; | |
319 | ||
bec2d490 | 320 | real_t = expand_binop (submode, this_add_optab, temp1, temp2, |
27bc6aee | 321 | NULL_RTX, unsignedp, methods); |
3ad4992f | 322 | |
bec2d490 | 323 | temp1 = expand_binop (submode, this_mul_optab, imag0, real1, |
27bc6aee | 324 | NULL_RTX, unsignedp, methods); |
325 | ||
bec2d490 | 326 | temp2 = expand_binop (submode, this_mul_optab, real0, imag1, |
27bc6aee | 327 | NULL_RTX, unsignedp, methods); |
328 | ||
329 | if (temp1 == 0 || temp2 == 0) | |
330 | return 0; | |
331 | ||
bec2d490 | 332 | imag_t = expand_binop (submode, this_sub_optab, temp1, temp2, |
27bc6aee | 333 | NULL_RTX, unsignedp, methods); |
334 | ||
335 | if (real_t == 0 || imag_t == 0) | |
336 | return 0; | |
337 | } | |
338 | ||
339 | if (class == MODE_COMPLEX_FLOAT) | |
340 | res = expand_binop (submode, binoptab, real_t, divisor, | |
341 | realr, unsignedp, methods); | |
342 | else | |
343 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
344 | real_t, divisor, realr, unsignedp); | |
345 | ||
346 | if (res == 0) | |
347 | return 0; | |
348 | ||
349 | if (res != realr) | |
350 | emit_move_insn (realr, res); | |
351 | ||
352 | if (class == MODE_COMPLEX_FLOAT) | |
353 | res = expand_binop (submode, binoptab, imag_t, divisor, | |
354 | imagr, unsignedp, methods); | |
355 | else | |
356 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
357 | imag_t, divisor, imagr, unsignedp); | |
358 | ||
359 | if (res == 0) | |
360 | return 0; | |
361 | ||
362 | if (res != imagr) | |
363 | emit_move_insn (imagr, res); | |
364 | ||
365 | return 1; | |
366 | } | |
367 | \f | |
368 | /* Generate code to perform a wide-input-range-acceptable complex divide. */ | |
369 | ||
370 | static int | |
3ad4992f | 371 | expand_cmplxdiv_wide (rtx real0, rtx real1, rtx imag0, rtx imag1, rtx realr, |
372 | rtx imagr, enum machine_mode submode, int unsignedp, | |
373 | enum optab_methods methods, enum mode_class class, | |
374 | optab binoptab) | |
27bc6aee | 375 | { |
376 | rtx ratio, divisor; | |
377 | rtx real_t, imag_t; | |
378 | rtx temp1, temp2, lab1, lab2; | |
379 | enum machine_mode mode; | |
27bc6aee | 380 | rtx res; |
bec2d490 | 381 | optab this_add_optab = add_optab; |
382 | optab this_sub_optab = sub_optab; | |
383 | optab this_neg_optab = neg_optab; | |
384 | optab this_mul_optab = smul_optab; | |
385 | ||
386 | if (binoptab == sdivv_optab) | |
387 | { | |
388 | this_add_optab = addv_optab; | |
389 | this_sub_optab = subv_optab; | |
390 | this_neg_optab = negv_optab; | |
391 | this_mul_optab = smulv_optab; | |
392 | } | |
3ad4992f | 393 | |
27bc6aee | 394 | /* Don't fetch these from memory more than once. */ |
395 | real0 = force_reg (submode, real0); | |
396 | real1 = force_reg (submode, real1); | |
397 | ||
398 | if (imag0 != 0) | |
399 | imag0 = force_reg (submode, imag0); | |
400 | ||
401 | imag1 = force_reg (submode, imag1); | |
402 | ||
43cb6f82 | 403 | /* XXX What's an "unsigned" complex number? */ |
404 | if (unsignedp) | |
405 | { | |
406 | temp1 = real1; | |
407 | temp2 = imag1; | |
408 | } | |
409 | else | |
410 | { | |
bec2d490 | 411 | temp1 = expand_abs (submode, real1, NULL_RTX, unsignedp, 1); |
412 | temp2 = expand_abs (submode, imag1, NULL_RTX, unsignedp, 1); | |
43cb6f82 | 413 | } |
27bc6aee | 414 | |
415 | if (temp1 == 0 || temp2 == 0) | |
416 | return 0; | |
417 | ||
418 | mode = GET_MODE (temp1); | |
27bc6aee | 419 | lab1 = gen_label_rtx (); |
420 | emit_cmp_and_jump_insns (temp1, temp2, LT, NULL_RTX, | |
2b96c5f6 | 421 | mode, unsignedp, lab1); |
27bc6aee | 422 | |
423 | /* |c| >= |d|; use ratio d/c to scale dividend and divisor. */ | |
424 | ||
425 | if (class == MODE_COMPLEX_FLOAT) | |
426 | ratio = expand_binop (submode, binoptab, imag1, real1, | |
427 | NULL_RTX, unsignedp, methods); | |
428 | else | |
429 | ratio = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
430 | imag1, real1, NULL_RTX, unsignedp); | |
431 | ||
432 | if (ratio == 0) | |
433 | return 0; | |
434 | ||
435 | /* Calculate divisor. */ | |
436 | ||
bec2d490 | 437 | temp1 = expand_binop (submode, this_mul_optab, imag1, ratio, |
27bc6aee | 438 | NULL_RTX, unsignedp, methods); |
439 | ||
440 | if (temp1 == 0) | |
441 | return 0; | |
442 | ||
bec2d490 | 443 | divisor = expand_binop (submode, this_add_optab, temp1, real1, |
27bc6aee | 444 | NULL_RTX, unsignedp, methods); |
445 | ||
446 | if (divisor == 0) | |
447 | return 0; | |
448 | ||
449 | /* Calculate dividend. */ | |
450 | ||
63ec94ba | 451 | if (imag0 == 0) |
27bc6aee | 452 | { |
453 | real_t = real0; | |
454 | ||
455 | /* Compute a / (c+id) as a / (c+d(d/c)) + i (-a(d/c)) / (c+d(d/c)). */ | |
456 | ||
bec2d490 | 457 | imag_t = expand_binop (submode, this_mul_optab, real0, ratio, |
27bc6aee | 458 | NULL_RTX, unsignedp, methods); |
459 | ||
460 | if (imag_t == 0) | |
461 | return 0; | |
462 | ||
bec2d490 | 463 | imag_t = expand_unop (submode, this_neg_optab, imag_t, |
27bc6aee | 464 | NULL_RTX, unsignedp); |
465 | ||
466 | if (real_t == 0 || imag_t == 0) | |
467 | return 0; | |
468 | } | |
469 | else | |
470 | { | |
471 | /* Compute (a+ib)/(c+id) as | |
472 | (a+b(d/c))/(c+d(d/c) + i(b-a(d/c))/(c+d(d/c)). */ | |
473 | ||
bec2d490 | 474 | temp1 = expand_binop (submode, this_mul_optab, imag0, ratio, |
27bc6aee | 475 | NULL_RTX, unsignedp, methods); |
476 | ||
477 | if (temp1 == 0) | |
478 | return 0; | |
479 | ||
bec2d490 | 480 | real_t = expand_binop (submode, this_add_optab, temp1, real0, |
27bc6aee | 481 | NULL_RTX, unsignedp, methods); |
482 | ||
bec2d490 | 483 | temp1 = expand_binop (submode, this_mul_optab, real0, ratio, |
27bc6aee | 484 | NULL_RTX, unsignedp, methods); |
485 | ||
486 | if (temp1 == 0) | |
487 | return 0; | |
488 | ||
bec2d490 | 489 | imag_t = expand_binop (submode, this_sub_optab, imag0, temp1, |
27bc6aee | 490 | NULL_RTX, unsignedp, methods); |
491 | ||
492 | if (real_t == 0 || imag_t == 0) | |
493 | return 0; | |
494 | } | |
495 | ||
496 | if (class == MODE_COMPLEX_FLOAT) | |
497 | res = expand_binop (submode, binoptab, real_t, divisor, | |
498 | realr, unsignedp, methods); | |
499 | else | |
500 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
501 | real_t, divisor, realr, unsignedp); | |
502 | ||
503 | if (res == 0) | |
504 | return 0; | |
505 | ||
506 | if (res != realr) | |
507 | emit_move_insn (realr, res); | |
508 | ||
509 | if (class == MODE_COMPLEX_FLOAT) | |
510 | res = expand_binop (submode, binoptab, imag_t, divisor, | |
511 | imagr, unsignedp, methods); | |
512 | else | |
513 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
514 | imag_t, divisor, imagr, unsignedp); | |
515 | ||
516 | if (res == 0) | |
517 | return 0; | |
518 | ||
519 | if (res != imagr) | |
520 | emit_move_insn (imagr, res); | |
521 | ||
522 | lab2 = gen_label_rtx (); | |
523 | emit_jump_insn (gen_jump (lab2)); | |
524 | emit_barrier (); | |
525 | ||
526 | emit_label (lab1); | |
527 | ||
528 | /* |d| > |c|; use ratio c/d to scale dividend and divisor. */ | |
529 | ||
530 | if (class == MODE_COMPLEX_FLOAT) | |
531 | ratio = expand_binop (submode, binoptab, real1, imag1, | |
532 | NULL_RTX, unsignedp, methods); | |
533 | else | |
534 | ratio = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
535 | real1, imag1, NULL_RTX, unsignedp); | |
536 | ||
537 | if (ratio == 0) | |
538 | return 0; | |
539 | ||
540 | /* Calculate divisor. */ | |
541 | ||
bec2d490 | 542 | temp1 = expand_binop (submode, this_mul_optab, real1, ratio, |
27bc6aee | 543 | NULL_RTX, unsignedp, methods); |
544 | ||
545 | if (temp1 == 0) | |
546 | return 0; | |
547 | ||
bec2d490 | 548 | divisor = expand_binop (submode, this_add_optab, temp1, imag1, |
27bc6aee | 549 | NULL_RTX, unsignedp, methods); |
550 | ||
551 | if (divisor == 0) | |
552 | return 0; | |
553 | ||
554 | /* Calculate dividend. */ | |
555 | ||
63ec94ba | 556 | if (imag0 == 0) |
27bc6aee | 557 | { |
558 | /* Compute a / (c+id) as a(c/d) / (c(c/d)+d) + i (-a) / (c(c/d)+d). */ | |
559 | ||
bec2d490 | 560 | real_t = expand_binop (submode, this_mul_optab, real0, ratio, |
27bc6aee | 561 | NULL_RTX, unsignedp, methods); |
562 | ||
bec2d490 | 563 | imag_t = expand_unop (submode, this_neg_optab, real0, |
27bc6aee | 564 | NULL_RTX, unsignedp); |
565 | ||
566 | if (real_t == 0 || imag_t == 0) | |
567 | return 0; | |
568 | } | |
569 | else | |
570 | { | |
571 | /* Compute (a+ib)/(c+id) as | |
572 | (a(c/d)+b)/(c(c/d)+d) + i (b(c/d)-a)/(c(c/d)+d). */ | |
573 | ||
bec2d490 | 574 | temp1 = expand_binop (submode, this_mul_optab, real0, ratio, |
27bc6aee | 575 | NULL_RTX, unsignedp, methods); |
576 | ||
577 | if (temp1 == 0) | |
578 | return 0; | |
579 | ||
bec2d490 | 580 | real_t = expand_binop (submode, this_add_optab, temp1, imag0, |
27bc6aee | 581 | NULL_RTX, unsignedp, methods); |
582 | ||
bec2d490 | 583 | temp1 = expand_binop (submode, this_mul_optab, imag0, ratio, |
27bc6aee | 584 | NULL_RTX, unsignedp, methods); |
585 | ||
586 | if (temp1 == 0) | |
587 | return 0; | |
588 | ||
bec2d490 | 589 | imag_t = expand_binop (submode, this_sub_optab, temp1, real0, |
27bc6aee | 590 | NULL_RTX, unsignedp, methods); |
591 | ||
592 | if (real_t == 0 || imag_t == 0) | |
593 | return 0; | |
594 | } | |
595 | ||
596 | if (class == MODE_COMPLEX_FLOAT) | |
597 | res = expand_binop (submode, binoptab, real_t, divisor, | |
598 | realr, unsignedp, methods); | |
599 | else | |
600 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
601 | real_t, divisor, realr, unsignedp); | |
602 | ||
603 | if (res == 0) | |
604 | return 0; | |
605 | ||
606 | if (res != realr) | |
607 | emit_move_insn (realr, res); | |
608 | ||
609 | if (class == MODE_COMPLEX_FLOAT) | |
610 | res = expand_binop (submode, binoptab, imag_t, divisor, | |
611 | imagr, unsignedp, methods); | |
612 | else | |
613 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
614 | imag_t, divisor, imagr, unsignedp); | |
615 | ||
616 | if (res == 0) | |
617 | return 0; | |
618 | ||
619 | if (res != imagr) | |
620 | emit_move_insn (imagr, res); | |
621 | ||
622 | emit_label (lab2); | |
623 | ||
624 | return 1; | |
625 | } | |
626 | \f | |
ad99e708 | 627 | /* Wrapper around expand_binop which takes an rtx code to specify |
628 | the operation to perform, not an optab pointer. All other | |
629 | arguments are the same. */ | |
630 | rtx | |
3ad4992f | 631 | expand_simple_binop (enum machine_mode mode, enum rtx_code code, rtx op0, |
632 | rtx op1, rtx target, int unsignedp, | |
633 | enum optab_methods methods) | |
ad99e708 | 634 | { |
2fd3f4b5 | 635 | optab binop = code_to_optab[(int) code]; |
ad99e708 | 636 | if (binop == 0) |
637 | abort (); | |
638 | ||
639 | return expand_binop (mode, binop, op0, op1, target, unsignedp, methods); | |
640 | } | |
641 | ||
1f215c26 | 642 | /* Generate code to perform an operation specified by BINOPTAB |
643 | on operands OP0 and OP1, with result having machine-mode MODE. | |
644 | ||
645 | UNSIGNEDP is for the case where we have to widen the operands | |
646 | to perform the operation. It says to use zero-extension. | |
647 | ||
648 | If TARGET is nonzero, the value | |
649 | is generated there, if it is convenient to do so. | |
650 | In all cases an rtx is returned for the locus of the value; | |
651 | this may or may not be TARGET. */ | |
652 | ||
653 | rtx | |
3ad4992f | 654 | expand_binop (enum machine_mode mode, optab binoptab, rtx op0, rtx op1, |
655 | rtx target, int unsignedp, enum optab_methods methods) | |
1f215c26 | 656 | { |
caf74f46 | 657 | enum optab_methods next_methods |
658 | = (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN | |
659 | ? OPTAB_WIDEN : methods); | |
1f215c26 | 660 | enum mode_class class; |
661 | enum machine_mode wider_mode; | |
19cb6b50 | 662 | rtx temp; |
1f215c26 | 663 | int commutative_op = 0; |
2fd3f4b5 | 664 | int shift_op = (binoptab->code == ASHIFT |
1f215c26 | 665 | || binoptab->code == ASHIFTRT |
1f215c26 | 666 | || binoptab->code == LSHIFTRT |
667 | || binoptab->code == ROTATE | |
668 | || binoptab->code == ROTATERT); | |
ea35e69c | 669 | rtx entry_last = get_last_insn (); |
1f215c26 | 670 | rtx last; |
671 | ||
672 | class = GET_MODE_CLASS (mode); | |
673 | ||
674 | op0 = protect_from_queue (op0, 0); | |
675 | op1 = protect_from_queue (op1, 0); | |
676 | if (target) | |
677 | target = protect_from_queue (target, 1); | |
678 | ||
679 | if (flag_force_mem) | |
680 | { | |
1d37ed98 | 681 | /* Load duplicate non-volatile operands once. */ |
682 | if (rtx_equal_p (op0, op1) && ! volatile_refs_p (op0)) | |
683 | { | |
684 | op0 = force_not_mem (op0); | |
685 | op1 = op0; | |
686 | } | |
687 | else | |
688 | { | |
689 | op0 = force_not_mem (op0); | |
690 | op1 = force_not_mem (op1); | |
691 | } | |
1f215c26 | 692 | } |
693 | ||
c4edd431 | 694 | /* If subtracting an integer constant, convert this into an addition of |
695 | the negated constant. */ | |
696 | ||
697 | if (binoptab == sub_optab && GET_CODE (op1) == CONST_INT) | |
698 | { | |
699 | op1 = negate_rtx (mode, op1); | |
700 | binoptab = add_optab; | |
701 | } | |
702 | ||
1f215c26 | 703 | /* If we are inside an appropriately-short loop and one operand is an |
704 | expensive constant, force it into a register. */ | |
c9661aaa | 705 | if (CONSTANT_P (op0) && preserve_subexpressions_p () |
e997907c | 706 | && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1)) |
1f215c26 | 707 | op0 = force_reg (mode, op0); |
708 | ||
c9661aaa | 709 | if (CONSTANT_P (op1) && preserve_subexpressions_p () |
e997907c | 710 | && ! shift_op && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1)) |
38d9af33 | 711 | op1 = force_reg (mode, op1); |
1f215c26 | 712 | |
1f215c26 | 713 | /* Record where to delete back to if we backtrack. */ |
714 | last = get_last_insn (); | |
715 | ||
716 | /* If operation is commutative, | |
717 | try to make the first operand a register. | |
718 | Even better, try to make it the same as the target. | |
719 | Also try to make the last operand a constant. */ | |
720 | if (GET_RTX_CLASS (binoptab->code) == 'c' | |
721 | || binoptab == smul_widen_optab | |
7e4a644d | 722 | || binoptab == umul_widen_optab |
723 | || binoptab == smul_highpart_optab | |
724 | || binoptab == umul_highpart_optab) | |
1f215c26 | 725 | { |
726 | commutative_op = 1; | |
727 | ||
728 | if (((target == 0 || GET_CODE (target) == REG) | |
729 | ? ((GET_CODE (op1) == REG | |
730 | && GET_CODE (op0) != REG) | |
731 | || target == op1) | |
732 | : rtx_equal_p (op1, target)) | |
733 | || GET_CODE (op0) == CONST_INT) | |
734 | { | |
735 | temp = op1; | |
736 | op1 = op0; | |
737 | op0 = temp; | |
738 | } | |
739 | } | |
740 | ||
741 | /* If we can do it with a three-operand insn, do so. */ | |
742 | ||
743 | if (methods != OPTAB_MUST_WIDEN | |
744 | && binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
745 | { | |
746 | int icode = (int) binoptab->handlers[(int) mode].insn_code; | |
6357eaae | 747 | enum machine_mode mode0 = insn_data[icode].operand[1].mode; |
748 | enum machine_mode mode1 = insn_data[icode].operand[2].mode; | |
1f215c26 | 749 | rtx pat; |
750 | rtx xop0 = op0, xop1 = op1; | |
751 | ||
752 | if (target) | |
753 | temp = target; | |
754 | else | |
755 | temp = gen_reg_rtx (mode); | |
756 | ||
757 | /* If it is a commutative operator and the modes would match | |
a92771b8 | 758 | if we would swap the operands, we can save the conversions. */ |
1f215c26 | 759 | if (commutative_op) |
760 | { | |
761 | if (GET_MODE (op0) != mode0 && GET_MODE (op1) != mode1 | |
762 | && GET_MODE (op0) == mode1 && GET_MODE (op1) == mode0) | |
763 | { | |
19cb6b50 | 764 | rtx tmp; |
1f215c26 | 765 | |
766 | tmp = op0; op0 = op1; op1 = tmp; | |
767 | tmp = xop0; xop0 = xop1; xop1 = tmp; | |
768 | } | |
769 | } | |
770 | ||
771 | /* In case the insn wants input operands in modes different from | |
d5d15736 | 772 | those of the actual operands, convert the operands. It would |
773 | seem that we don't need to convert CONST_INTs, but we do, so | |
67595860 | 774 | that they're properly zero-extended, sign-extended or truncated |
775 | for their mode. */ | |
1f215c26 | 776 | |
e805a0b5 | 777 | if (GET_MODE (op0) != mode0 && mode0 != VOIDmode) |
213b27c9 | 778 | xop0 = convert_modes (mode0, |
779 | GET_MODE (op0) != VOIDmode | |
780 | ? GET_MODE (op0) | |
d5d15736 | 781 | : mode, |
213b27c9 | 782 | xop0, unsignedp); |
1f215c26 | 783 | |
e805a0b5 | 784 | if (GET_MODE (op1) != mode1 && mode1 != VOIDmode) |
213b27c9 | 785 | xop1 = convert_modes (mode1, |
786 | GET_MODE (op1) != VOIDmode | |
787 | ? GET_MODE (op1) | |
67595860 | 788 | : mode, |
213b27c9 | 789 | xop1, unsignedp); |
1f215c26 | 790 | |
791 | /* Now, if insn's predicates don't allow our operands, put them into | |
792 | pseudo regs. */ | |
793 | ||
6357eaae | 794 | if (! (*insn_data[icode].operand[1].predicate) (xop0, mode0) |
38d9af33 | 795 | && mode0 != VOIDmode) |
1f215c26 | 796 | xop0 = copy_to_mode_reg (mode0, xop0); |
797 | ||
6357eaae | 798 | if (! (*insn_data[icode].operand[2].predicate) (xop1, mode1) |
38d9af33 | 799 | && mode1 != VOIDmode) |
1f215c26 | 800 | xop1 = copy_to_mode_reg (mode1, xop1); |
801 | ||
6357eaae | 802 | if (! (*insn_data[icode].operand[0].predicate) (temp, mode)) |
1f215c26 | 803 | temp = gen_reg_rtx (mode); |
804 | ||
805 | pat = GEN_FCN (icode) (temp, xop0, xop1); | |
806 | if (pat) | |
807 | { | |
31d3e01c | 808 | /* If PAT is composed of more than one insn, try to add an appropriate |
1f215c26 | 809 | REG_EQUAL note to it. If we can't because TEMP conflicts with an |
810 | operand, call ourselves again, this time without a target. */ | |
31d3e01c | 811 | if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX |
1f215c26 | 812 | && ! add_equal_note (pat, temp, binoptab->code, xop0, xop1)) |
813 | { | |
814 | delete_insns_since (last); | |
50b0c9ee | 815 | return expand_binop (mode, binoptab, op0, op1, NULL_RTX, |
816 | unsignedp, methods); | |
1f215c26 | 817 | } |
818 | ||
819 | emit_insn (pat); | |
820 | return temp; | |
821 | } | |
822 | else | |
823 | delete_insns_since (last); | |
824 | } | |
825 | ||
b6d98622 | 826 | /* If this is a multiply, see if we can do a widening operation that |
827 | takes operands of this mode and makes a wider mode. */ | |
828 | ||
829 | if (binoptab == smul_optab && GET_MODE_WIDER_MODE (mode) != VOIDmode | |
830 | && (((unsignedp ? umul_widen_optab : smul_widen_optab) | |
831 | ->handlers[(int) GET_MODE_WIDER_MODE (mode)].insn_code) | |
832 | != CODE_FOR_nothing)) | |
833 | { | |
834 | temp = expand_binop (GET_MODE_WIDER_MODE (mode), | |
835 | unsignedp ? umul_widen_optab : smul_widen_optab, | |
b2bc10f7 | 836 | op0, op1, NULL_RTX, unsignedp, OPTAB_DIRECT); |
b6d98622 | 837 | |
caf74f46 | 838 | if (temp != 0) |
839 | { | |
840 | if (GET_MODE_CLASS (mode) == MODE_INT) | |
841 | return gen_lowpart (mode, temp); | |
842 | else | |
843 | return convert_to_mode (mode, temp, unsignedp); | |
844 | } | |
b6d98622 | 845 | } |
846 | ||
1dd91d55 | 847 | /* Look for a wider mode of the same class for which we think we |
b6d98622 | 848 | can open-code the operation. Check for a widening multiply at the |
849 | wider mode as well. */ | |
1dd91d55 | 850 | |
851 | if ((class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
b0217ae2 | 852 | && methods != OPTAB_DIRECT && methods != OPTAB_LIB) |
1dd91d55 | 853 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; |
854 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
855 | { | |
b6d98622 | 856 | if (binoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing |
857 | || (binoptab == smul_optab | |
858 | && GET_MODE_WIDER_MODE (wider_mode) != VOIDmode | |
859 | && (((unsignedp ? umul_widen_optab : smul_widen_optab) | |
860 | ->handlers[(int) GET_MODE_WIDER_MODE (wider_mode)].insn_code) | |
861 | != CODE_FOR_nothing))) | |
1dd91d55 | 862 | { |
863 | rtx xop0 = op0, xop1 = op1; | |
864 | int no_extend = 0; | |
865 | ||
866 | /* For certain integer operations, we need not actually extend | |
867 | the narrow operands, as long as we will truncate | |
1e625a2e | 868 | the results to the same narrowness. */ |
1dd91d55 | 869 | |
870 | if ((binoptab == ior_optab || binoptab == and_optab | |
871 | || binoptab == xor_optab | |
872 | || binoptab == add_optab || binoptab == sub_optab | |
80f0c37a | 873 | || binoptab == smul_optab || binoptab == ashl_optab) |
45282828 | 874 | && class == MODE_INT) |
1dd91d55 | 875 | no_extend = 1; |
876 | ||
92d67582 | 877 | xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, no_extend); |
303f6c6c | 878 | |
879 | /* The second operand of a shift must always be extended. */ | |
92d67582 | 880 | xop1 = widen_operand (xop1, wider_mode, mode, unsignedp, |
80f0c37a | 881 | no_extend && binoptab != ashl_optab); |
303f6c6c | 882 | |
50b0c9ee | 883 | temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX, |
1dd91d55 | 884 | unsignedp, OPTAB_DIRECT); |
885 | if (temp) | |
886 | { | |
887 | if (class != MODE_INT) | |
888 | { | |
889 | if (target == 0) | |
890 | target = gen_reg_rtx (mode); | |
891 | convert_move (target, temp, 0); | |
892 | return target; | |
893 | } | |
894 | else | |
895 | return gen_lowpart (mode, temp); | |
896 | } | |
897 | else | |
898 | delete_insns_since (last); | |
899 | } | |
900 | } | |
901 | ||
1f215c26 | 902 | /* These can be done a word at a time. */ |
903 | if ((binoptab == and_optab || binoptab == ior_optab || binoptab == xor_optab) | |
904 | && class == MODE_INT | |
905 | && GET_MODE_SIZE (mode) > UNITS_PER_WORD | |
3b1a9578 | 906 | && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing) |
1f215c26 | 907 | { |
76ab50f8 | 908 | int i; |
1f215c26 | 909 | rtx insns; |
910 | rtx equiv_value; | |
911 | ||
912 | /* If TARGET is the same as one of the operands, the REG_EQUAL note | |
913 | won't be accurate, so use a new target. */ | |
914 | if (target == 0 || target == op0 || target == op1) | |
915 | target = gen_reg_rtx (mode); | |
916 | ||
917 | start_sequence (); | |
918 | ||
919 | /* Do the actual arithmetic. */ | |
920 | for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++) | |
921 | { | |
922 | rtx target_piece = operand_subword (target, i, 1, mode); | |
3b1a9578 | 923 | rtx x = expand_binop (word_mode, binoptab, |
1f215c26 | 924 | operand_subword_force (op0, i, mode), |
925 | operand_subword_force (op1, i, mode), | |
caf74f46 | 926 | target_piece, unsignedp, next_methods); |
927 | ||
928 | if (x == 0) | |
929 | break; | |
930 | ||
1f215c26 | 931 | if (target_piece != x) |
932 | emit_move_insn (target_piece, x); | |
933 | } | |
934 | ||
935 | insns = get_insns (); | |
936 | end_sequence (); | |
937 | ||
caf74f46 | 938 | if (i == GET_MODE_BITSIZE (mode) / BITS_PER_WORD) |
939 | { | |
940 | if (binoptab->code != UNKNOWN) | |
941 | equiv_value | |
e02c6d1f | 942 | = gen_rtx_fmt_ee (binoptab->code, mode, |
943 | copy_rtx (op0), copy_rtx (op1)); | |
caf74f46 | 944 | else |
945 | equiv_value = 0; | |
1f215c26 | 946 | |
caf74f46 | 947 | emit_no_conflict_block (insns, target, op0, op1, equiv_value); |
948 | return target; | |
949 | } | |
1f215c26 | 950 | } |
951 | ||
f1c8fa9b | 952 | /* Synthesize double word shifts from single word shifts. */ |
80f0c37a | 953 | if ((binoptab == lshr_optab || binoptab == ashl_optab |
954 | || binoptab == ashr_optab) | |
f1c8fa9b | 955 | && class == MODE_INT |
956 | && GET_CODE (op1) == CONST_INT | |
957 | && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD | |
958 | && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing | |
959 | && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing | |
960 | && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing) | |
961 | { | |
caf74f46 | 962 | rtx insns, inter, equiv_value; |
f1c8fa9b | 963 | rtx into_target, outof_target; |
964 | rtx into_input, outof_input; | |
965 | int shift_count, left_shift, outof_word; | |
966 | ||
967 | /* If TARGET is the same as one of the operands, the REG_EQUAL note | |
968 | won't be accurate, so use a new target. */ | |
969 | if (target == 0 || target == op0 || target == op1) | |
970 | target = gen_reg_rtx (mode); | |
971 | ||
972 | start_sequence (); | |
973 | ||
974 | shift_count = INTVAL (op1); | |
975 | ||
976 | /* OUTOF_* is the word we are shifting bits away from, and | |
977 | INTO_* is the word that we are shifting bits towards, thus | |
978 | they differ depending on the direction of the shift and | |
979 | WORDS_BIG_ENDIAN. */ | |
980 | ||
80f0c37a | 981 | left_shift = binoptab == ashl_optab; |
f1c8fa9b | 982 | outof_word = left_shift ^ ! WORDS_BIG_ENDIAN; |
983 | ||
984 | outof_target = operand_subword (target, outof_word, 1, mode); | |
985 | into_target = operand_subword (target, 1 - outof_word, 1, mode); | |
986 | ||
987 | outof_input = operand_subword_force (op0, outof_word, mode); | |
988 | into_input = operand_subword_force (op0, 1 - outof_word, mode); | |
989 | ||
990 | if (shift_count >= BITS_PER_WORD) | |
991 | { | |
caf74f46 | 992 | inter = expand_binop (word_mode, binoptab, |
993 | outof_input, | |
994 | GEN_INT (shift_count - BITS_PER_WORD), | |
995 | into_target, unsignedp, next_methods); | |
996 | ||
96b899b5 | 997 | if (inter != 0 && inter != into_target) |
caf74f46 | 998 | emit_move_insn (into_target, inter); |
f1c8fa9b | 999 | |
1000 | /* For a signed right shift, we must fill the word we are shifting | |
1001 | out of with copies of the sign bit. Otherwise it is zeroed. */ | |
96b899b5 | 1002 | if (inter != 0 && binoptab != ashr_optab) |
1003 | inter = CONST0_RTX (word_mode); | |
caf74f46 | 1004 | else if (inter != 0) |
1005 | inter = expand_binop (word_mode, binoptab, | |
1006 | outof_input, | |
1007 | GEN_INT (BITS_PER_WORD - 1), | |
1008 | outof_target, unsignedp, next_methods); | |
1009 | ||
96b899b5 | 1010 | if (inter != 0 && inter != outof_target) |
caf74f46 | 1011 | emit_move_insn (outof_target, inter); |
f1c8fa9b | 1012 | } |
1013 | else | |
1014 | { | |
caf74f46 | 1015 | rtx carries; |
f1c8fa9b | 1016 | optab reverse_unsigned_shift, unsigned_shift; |
1017 | ||
1018 | /* For a shift of less then BITS_PER_WORD, to compute the carry, | |
1019 | we must do a logical shift in the opposite direction of the | |
1020 | desired shift. */ | |
1021 | ||
f1c8fa9b | 1022 | reverse_unsigned_shift = (left_shift ? lshr_optab : ashl_optab); |
1023 | ||
1024 | /* For a shift of less than BITS_PER_WORD, to compute the word | |
1025 | shifted towards, we need to unsigned shift the orig value of | |
1026 | that word. */ | |
1027 | ||
1028 | unsigned_shift = (left_shift ? ashl_optab : lshr_optab); | |
1029 | ||
1030 | carries = expand_binop (word_mode, reverse_unsigned_shift, | |
1031 | outof_input, | |
1032 | GEN_INT (BITS_PER_WORD - shift_count), | |
caf74f46 | 1033 | 0, unsignedp, next_methods); |
1034 | ||
1035 | if (carries == 0) | |
1036 | inter = 0; | |
1037 | else | |
caf74f46 | 1038 | inter = expand_binop (word_mode, unsigned_shift, into_input, |
1039 | op1, 0, unsignedp, next_methods); | |
1040 | ||
1041 | if (inter != 0) | |
1042 | inter = expand_binop (word_mode, ior_optab, carries, inter, | |
1043 | into_target, unsignedp, next_methods); | |
1044 | ||
96b899b5 | 1045 | if (inter != 0 && inter != into_target) |
caf74f46 | 1046 | emit_move_insn (into_target, inter); |
b627826d | 1047 | |
1048 | if (inter != 0) | |
1049 | inter = expand_binop (word_mode, binoptab, outof_input, | |
1050 | op1, outof_target, unsignedp, next_methods); | |
3ad4992f | 1051 | |
b627826d | 1052 | if (inter != 0 && inter != outof_target) |
1053 | emit_move_insn (outof_target, inter); | |
f1c8fa9b | 1054 | } |
1055 | ||
1056 | insns = get_insns (); | |
1057 | end_sequence (); | |
1058 | ||
caf74f46 | 1059 | if (inter != 0) |
1060 | { | |
1061 | if (binoptab->code != UNKNOWN) | |
e02c6d1f | 1062 | equiv_value = gen_rtx_fmt_ee (binoptab->code, mode, op0, op1); |
caf74f46 | 1063 | else |
1064 | equiv_value = 0; | |
f1c8fa9b | 1065 | |
caf74f46 | 1066 | emit_no_conflict_block (insns, target, op0, op1, equiv_value); |
1067 | return target; | |
1068 | } | |
f1c8fa9b | 1069 | } |
1070 | ||
1071 | /* Synthesize double word rotates from single word shifts. */ | |
1072 | if ((binoptab == rotl_optab || binoptab == rotr_optab) | |
1073 | && class == MODE_INT | |
1074 | && GET_CODE (op1) == CONST_INT | |
1075 | && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD | |
1076 | && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing | |
1077 | && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing) | |
1078 | { | |
1079 | rtx insns, equiv_value; | |
1080 | rtx into_target, outof_target; | |
1081 | rtx into_input, outof_input; | |
caf74f46 | 1082 | rtx inter; |
f1c8fa9b | 1083 | int shift_count, left_shift, outof_word; |
1084 | ||
1085 | /* If TARGET is the same as one of the operands, the REG_EQUAL note | |
1086 | won't be accurate, so use a new target. */ | |
1087 | if (target == 0 || target == op0 || target == op1) | |
1088 | target = gen_reg_rtx (mode); | |
1089 | ||
1090 | start_sequence (); | |
1091 | ||
1092 | shift_count = INTVAL (op1); | |
1093 | ||
1094 | /* OUTOF_* is the word we are shifting bits away from, and | |
1095 | INTO_* is the word that we are shifting bits towards, thus | |
1096 | they differ depending on the direction of the shift and | |
1097 | WORDS_BIG_ENDIAN. */ | |
1098 | ||
1099 | left_shift = (binoptab == rotl_optab); | |
1100 | outof_word = left_shift ^ ! WORDS_BIG_ENDIAN; | |
1101 | ||
1102 | outof_target = operand_subword (target, outof_word, 1, mode); | |
1103 | into_target = operand_subword (target, 1 - outof_word, 1, mode); | |
1104 | ||
1105 | outof_input = operand_subword_force (op0, outof_word, mode); | |
1106 | into_input = operand_subword_force (op0, 1 - outof_word, mode); | |
1107 | ||
1108 | if (shift_count == BITS_PER_WORD) | |
1109 | { | |
1110 | /* This is just a word swap. */ | |
1111 | emit_move_insn (outof_target, into_input); | |
1112 | emit_move_insn (into_target, outof_input); | |
caf74f46 | 1113 | inter = const0_rtx; |
f1c8fa9b | 1114 | } |
1115 | else | |
1116 | { | |
1117 | rtx into_temp1, into_temp2, outof_temp1, outof_temp2; | |
1118 | rtx first_shift_count, second_shift_count; | |
1119 | optab reverse_unsigned_shift, unsigned_shift; | |
1120 | ||
1121 | reverse_unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD) | |
1122 | ? lshr_optab : ashl_optab); | |
1123 | ||
1124 | unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD) | |
1125 | ? ashl_optab : lshr_optab); | |
1126 | ||
1127 | if (shift_count > BITS_PER_WORD) | |
1128 | { | |
1129 | first_shift_count = GEN_INT (shift_count - BITS_PER_WORD); | |
2fd3f4b5 | 1130 | second_shift_count = GEN_INT (2 * BITS_PER_WORD - shift_count); |
f1c8fa9b | 1131 | } |
1132 | else | |
1133 | { | |
1134 | first_shift_count = GEN_INT (BITS_PER_WORD - shift_count); | |
1135 | second_shift_count = GEN_INT (shift_count); | |
1136 | } | |
1137 | ||
1138 | into_temp1 = expand_binop (word_mode, unsigned_shift, | |
1139 | outof_input, first_shift_count, | |
caf74f46 | 1140 | NULL_RTX, unsignedp, next_methods); |
f1c8fa9b | 1141 | into_temp2 = expand_binop (word_mode, reverse_unsigned_shift, |
1142 | into_input, second_shift_count, | |
a405fd23 | 1143 | NULL_RTX, unsignedp, next_methods); |
caf74f46 | 1144 | |
1145 | if (into_temp1 != 0 && into_temp2 != 0) | |
1146 | inter = expand_binop (word_mode, ior_optab, into_temp1, into_temp2, | |
1147 | into_target, unsignedp, next_methods); | |
1148 | else | |
1149 | inter = 0; | |
1150 | ||
96b899b5 | 1151 | if (inter != 0 && inter != into_target) |
caf74f46 | 1152 | emit_move_insn (into_target, inter); |
f1c8fa9b | 1153 | |
1154 | outof_temp1 = expand_binop (word_mode, unsigned_shift, | |
1155 | into_input, first_shift_count, | |
caf74f46 | 1156 | NULL_RTX, unsignedp, next_methods); |
f1c8fa9b | 1157 | outof_temp2 = expand_binop (word_mode, reverse_unsigned_shift, |
1158 | outof_input, second_shift_count, | |
a405fd23 | 1159 | NULL_RTX, unsignedp, next_methods); |
caf74f46 | 1160 | |
1161 | if (inter != 0 && outof_temp1 != 0 && outof_temp2 != 0) | |
1162 | inter = expand_binop (word_mode, ior_optab, | |
1163 | outof_temp1, outof_temp2, | |
1164 | outof_target, unsignedp, next_methods); | |
1165 | ||
96b899b5 | 1166 | if (inter != 0 && inter != outof_target) |
caf74f46 | 1167 | emit_move_insn (outof_target, inter); |
f1c8fa9b | 1168 | } |
1169 | ||
1170 | insns = get_insns (); | |
1171 | end_sequence (); | |
1172 | ||
caf74f46 | 1173 | if (inter != 0) |
1174 | { | |
1175 | if (binoptab->code != UNKNOWN) | |
e02c6d1f | 1176 | equiv_value = gen_rtx_fmt_ee (binoptab->code, mode, op0, op1); |
caf74f46 | 1177 | else |
1178 | equiv_value = 0; | |
f1c8fa9b | 1179 | |
caf74f46 | 1180 | /* We can't make this a no conflict block if this is a word swap, |
1181 | because the word swap case fails if the input and output values | |
1182 | are in the same register. */ | |
1183 | if (shift_count != BITS_PER_WORD) | |
1184 | emit_no_conflict_block (insns, target, op0, op1, equiv_value); | |
1185 | else | |
31d3e01c | 1186 | emit_insn (insns); |
caf74f46 | 1187 | |
1188 | ||
1189 | return target; | |
1190 | } | |
f1c8fa9b | 1191 | } |
1192 | ||
1f215c26 | 1193 | /* These can be done a word at a time by propagating carries. */ |
1194 | if ((binoptab == add_optab || binoptab == sub_optab) | |
1195 | && class == MODE_INT | |
1196 | && GET_MODE_SIZE (mode) >= 2 * UNITS_PER_WORD | |
3b1a9578 | 1197 | && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing) |
1f215c26 | 1198 | { |
1f3233d1 | 1199 | unsigned int i; |
1f215c26 | 1200 | optab otheroptab = binoptab == add_optab ? sub_optab : add_optab; |
be58ed1d | 1201 | const unsigned int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD; |
5b7dad94 | 1202 | rtx carry_in = NULL_RTX, carry_out = NULL_RTX; |
e4b82a55 | 1203 | rtx xop0, xop1, xtarget; |
1f215c26 | 1204 | |
1205 | /* We can handle either a 1 or -1 value for the carry. If STORE_FLAG | |
1206 | value is one of those, use it. Otherwise, use 1 since it is the | |
1207 | one easiest to get. */ | |
1208 | #if STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1 | |
1209 | int normalizep = STORE_FLAG_VALUE; | |
1210 | #else | |
1211 | int normalizep = 1; | |
1212 | #endif | |
1213 | ||
1214 | /* Prepare the operands. */ | |
bc86d98c | 1215 | xop0 = force_reg (mode, op0); |
1216 | xop1 = force_reg (mode, op1); | |
1f215c26 | 1217 | |
e4b82a55 | 1218 | xtarget = gen_reg_rtx (mode); |
1219 | ||
1220 | if (target == 0 || GET_CODE (target) != REG) | |
1221 | target = xtarget; | |
1f215c26 | 1222 | |
d92701fb | 1223 | /* Indicate for flow that the entire target reg is being set. */ |
1224 | if (GET_CODE (target) == REG) | |
e4b82a55 | 1225 | emit_insn (gen_rtx_CLOBBER (VOIDmode, xtarget)); |
d92701fb | 1226 | |
1f215c26 | 1227 | /* Do the actual arithmetic. */ |
1228 | for (i = 0; i < nwords; i++) | |
1229 | { | |
1230 | int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i); | |
e4b82a55 | 1231 | rtx target_piece = operand_subword (xtarget, index, 1, mode); |
bc86d98c | 1232 | rtx op0_piece = operand_subword_force (xop0, index, mode); |
1233 | rtx op1_piece = operand_subword_force (xop1, index, mode); | |
1f215c26 | 1234 | rtx x; |
1235 | ||
1236 | /* Main add/subtract of the input operands. */ | |
3b1a9578 | 1237 | x = expand_binop (word_mode, binoptab, |
1f215c26 | 1238 | op0_piece, op1_piece, |
caf74f46 | 1239 | target_piece, unsignedp, next_methods); |
1f215c26 | 1240 | if (x == 0) |
1241 | break; | |
1242 | ||
1243 | if (i + 1 < nwords) | |
1244 | { | |
1245 | /* Store carry from main add/subtract. */ | |
3b1a9578 | 1246 | carry_out = gen_reg_rtx (word_mode); |
d736adee | 1247 | carry_out = emit_store_flag_force (carry_out, |
1248 | (binoptab == add_optab | |
1a29b174 | 1249 | ? LT : GT), |
d736adee | 1250 | x, op0_piece, |
1251 | word_mode, 1, normalizep); | |
1f215c26 | 1252 | } |
1253 | ||
1254 | if (i > 0) | |
1255 | { | |
0462eca2 | 1256 | rtx newx; |
3ad4992f | 1257 | |
1f215c26 | 1258 | /* Add/subtract previous carry to main result. */ |
0462eca2 | 1259 | newx = expand_binop (word_mode, |
1260 | normalizep == 1 ? binoptab : otheroptab, | |
1261 | x, carry_in, | |
1262 | NULL_RTX, 1, next_methods); | |
1f215c26 | 1263 | |
1264 | if (i + 1 < nwords) | |
1265 | { | |
1f215c26 | 1266 | /* Get out carry from adding/subtracting carry in. */ |
0462eca2 | 1267 | rtx carry_tmp = gen_reg_rtx (word_mode); |
d736adee | 1268 | carry_tmp = emit_store_flag_force (carry_tmp, |
0462eca2 | 1269 | (binoptab == add_optab |
1270 | ? LT : GT), | |
1271 | newx, x, | |
d736adee | 1272 | word_mode, 1, normalizep); |
caf74f46 | 1273 | |
1f215c26 | 1274 | /* Logical-ior the two poss. carry together. */ |
3b1a9578 | 1275 | carry_out = expand_binop (word_mode, ior_optab, |
1f215c26 | 1276 | carry_out, carry_tmp, |
caf74f46 | 1277 | carry_out, 0, next_methods); |
1278 | if (carry_out == 0) | |
1f215c26 | 1279 | break; |
1280 | } | |
0462eca2 | 1281 | emit_move_insn (target_piece, newx); |
1f215c26 | 1282 | } |
1283 | ||
1284 | carry_in = carry_out; | |
3ad4992f | 1285 | } |
1f215c26 | 1286 | |
1f3233d1 | 1287 | if (i == GET_MODE_BITSIZE (mode) / (unsigned) BITS_PER_WORD) |
1f215c26 | 1288 | { |
629d2471 | 1289 | if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing |
1290 | || ! rtx_equal_p (target, xtarget)) | |
3c96cf42 | 1291 | { |
e4b82a55 | 1292 | rtx temp = emit_move_insn (target, xtarget); |
caf74f46 | 1293 | |
e29342dc | 1294 | set_unique_reg_note (temp, |
3ad4992f | 1295 | REG_EQUAL, |
e29342dc | 1296 | gen_rtx_fmt_ee (binoptab->code, mode, |
1297 | copy_rtx (xop0), | |
1298 | copy_rtx (xop1))); | |
3c96cf42 | 1299 | } |
9f4d4b89 | 1300 | else |
1301 | target = xtarget; | |
7014838c | 1302 | |
1f215c26 | 1303 | return target; |
1304 | } | |
7014838c | 1305 | |
1f215c26 | 1306 | else |
1307 | delete_insns_since (last); | |
1308 | } | |
1309 | ||
1310 | /* If we want to multiply two two-word values and have normal and widening | |
1311 | multiplies of single-word values, we can do this with three smaller | |
1312 | multiplications. Note that we do not make a REG_NO_CONFLICT block here | |
3ad4992f | 1313 | because we are not operating on one word at a time. |
1f215c26 | 1314 | |
1315 | The multiplication proceeds as follows: | |
3b1a9578 | 1316 | _______________________ |
1317 | [__op0_high_|__op0_low__] | |
1318 | _______________________ | |
c66c0505 | 1319 | * [__op1_high_|__op1_low__] |
3b1a9578 | 1320 | _______________________________________________ |
1321 | _______________________ | |
c66c0505 | 1322 | (1) [__op0_low__*__op1_low__] |
3b1a9578 | 1323 | _______________________ |
c66c0505 | 1324 | (2a) [__op0_low__*__op1_high_] |
3b1a9578 | 1325 | _______________________ |
c66c0505 | 1326 | (2b) [__op0_high_*__op1_low__] |
3b1a9578 | 1327 | _______________________ |
1328 | (3) [__op0_high_*__op1_high_] | |
1f215c26 | 1329 | |
1330 | ||
1331 | This gives a 4-word result. Since we are only interested in the | |
1332 | lower 2 words, partial result (3) and the upper words of (2a) and | |
1333 | (2b) don't need to be calculated. Hence (2a) and (2b) can be | |
1334 | calculated using non-widening multiplication. | |
1335 | ||
1336 | (1), however, needs to be calculated with an unsigned widening | |
1337 | multiplication. If this operation is not directly supported we | |
1338 | try using a signed widening multiplication and adjust the result. | |
1339 | This adjustment works as follows: | |
1340 | ||
1341 | If both operands are positive then no adjustment is needed. | |
1342 | ||
1343 | If the operands have different signs, for example op0_low < 0 and | |
1344 | op1_low >= 0, the instruction treats the most significant bit of | |
1345 | op0_low as a sign bit instead of a bit with significance | |
1346 | 2**(BITS_PER_WORD-1), i.e. the instruction multiplies op1_low | |
1347 | with 2**BITS_PER_WORD - op0_low, and two's complements the | |
1348 | result. Conclusion: We need to add op1_low * 2**BITS_PER_WORD to | |
1349 | the result. | |
1350 | ||
1351 | Similarly, if both operands are negative, we need to add | |
1352 | (op0_low + op1_low) * 2**BITS_PER_WORD. | |
1353 | ||
1354 | We use a trick to adjust quickly. We logically shift op0_low right | |
1355 | (op1_low) BITS_PER_WORD-1 steps to get 0 or 1, and add this to | |
1356 | op0_high (op1_high) before it is used to calculate 2b (2a). If no | |
1357 | logical shift exists, we do an arithmetic right shift and subtract | |
1358 | the 0 or -1. */ | |
1359 | ||
1360 | if (binoptab == smul_optab | |
1361 | && class == MODE_INT | |
1362 | && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD | |
3b1a9578 | 1363 | && smul_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing |
1364 | && add_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing | |
1f215c26 | 1365 | && ((umul_widen_optab->handlers[(int) mode].insn_code |
1366 | != CODE_FOR_nothing) | |
1367 | || (smul_widen_optab->handlers[(int) mode].insn_code | |
1368 | != CODE_FOR_nothing))) | |
1369 | { | |
1370 | int low = (WORDS_BIG_ENDIAN ? 1 : 0); | |
1371 | int high = (WORDS_BIG_ENDIAN ? 0 : 1); | |
1372 | rtx op0_high = operand_subword_force (op0, high, mode); | |
1373 | rtx op0_low = operand_subword_force (op0, low, mode); | |
1374 | rtx op1_high = operand_subword_force (op1, high, mode); | |
1375 | rtx op1_low = operand_subword_force (op1, low, mode); | |
1376 | rtx product = 0; | |
5b7dad94 | 1377 | rtx op0_xhigh = NULL_RTX; |
1378 | rtx op1_xhigh = NULL_RTX; | |
1f215c26 | 1379 | |
1380 | /* If the target is the same as one of the inputs, don't use it. This | |
1381 | prevents problems with the REG_EQUAL note. */ | |
c1889fff | 1382 | if (target == op0 || target == op1 |
1383 | || (target != 0 && GET_CODE (target) != REG)) | |
1f215c26 | 1384 | target = 0; |
1385 | ||
1386 | /* Multiply the two lower words to get a double-word product. | |
1387 | If unsigned widening multiplication is available, use that; | |
1388 | otherwise use the signed form and compensate. */ | |
1389 | ||
1390 | if (umul_widen_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
1391 | { | |
1392 | product = expand_binop (mode, umul_widen_optab, op0_low, op1_low, | |
1393 | target, 1, OPTAB_DIRECT); | |
1394 | ||
1395 | /* If we didn't succeed, delete everything we did so far. */ | |
1396 | if (product == 0) | |
1397 | delete_insns_since (last); | |
1398 | else | |
1399 | op0_xhigh = op0_high, op1_xhigh = op1_high; | |
1400 | } | |
1401 | ||
1402 | if (product == 0 | |
1403 | && smul_widen_optab->handlers[(int) mode].insn_code | |
1404 | != CODE_FOR_nothing) | |
1405 | { | |
50b0c9ee | 1406 | rtx wordm1 = GEN_INT (BITS_PER_WORD - 1); |
1f215c26 | 1407 | product = expand_binop (mode, smul_widen_optab, op0_low, op1_low, |
1408 | target, 1, OPTAB_DIRECT); | |
3b1a9578 | 1409 | op0_xhigh = expand_binop (word_mode, lshr_optab, op0_low, wordm1, |
caf74f46 | 1410 | NULL_RTX, 1, next_methods); |
1f215c26 | 1411 | if (op0_xhigh) |
3b1a9578 | 1412 | op0_xhigh = expand_binop (word_mode, add_optab, op0_high, |
caf74f46 | 1413 | op0_xhigh, op0_xhigh, 0, next_methods); |
1f215c26 | 1414 | else |
1415 | { | |
3b1a9578 | 1416 | op0_xhigh = expand_binop (word_mode, ashr_optab, op0_low, wordm1, |
caf74f46 | 1417 | NULL_RTX, 0, next_methods); |
1f215c26 | 1418 | if (op0_xhigh) |
3b1a9578 | 1419 | op0_xhigh = expand_binop (word_mode, sub_optab, op0_high, |
1f215c26 | 1420 | op0_xhigh, op0_xhigh, 0, |
caf74f46 | 1421 | next_methods); |
1f215c26 | 1422 | } |
1423 | ||
3b1a9578 | 1424 | op1_xhigh = expand_binop (word_mode, lshr_optab, op1_low, wordm1, |
caf74f46 | 1425 | NULL_RTX, 1, next_methods); |
1f215c26 | 1426 | if (op1_xhigh) |
3b1a9578 | 1427 | op1_xhigh = expand_binop (word_mode, add_optab, op1_high, |
caf74f46 | 1428 | op1_xhigh, op1_xhigh, 0, next_methods); |
1f215c26 | 1429 | else |
1430 | { | |
3b1a9578 | 1431 | op1_xhigh = expand_binop (word_mode, ashr_optab, op1_low, wordm1, |
caf74f46 | 1432 | NULL_RTX, 0, next_methods); |
1f215c26 | 1433 | if (op1_xhigh) |
3b1a9578 | 1434 | op1_xhigh = expand_binop (word_mode, sub_optab, op1_high, |
1f215c26 | 1435 | op1_xhigh, op1_xhigh, 0, |
caf74f46 | 1436 | next_methods); |
1f215c26 | 1437 | } |
1438 | } | |
1439 | ||
1440 | /* If we have been able to directly compute the product of the | |
1441 | low-order words of the operands and perform any required adjustments | |
1442 | of the operands, we proceed by trying two more multiplications | |
1443 | and then computing the appropriate sum. | |
1444 | ||
1445 | We have checked above that the required addition is provided. | |
1446 | Full-word addition will normally always succeed, especially if | |
1447 | it is provided at all, so we don't worry about its failure. The | |
1448 | multiplication may well fail, however, so we do handle that. */ | |
1449 | ||
1450 | if (product && op0_xhigh && op1_xhigh) | |
1451 | { | |
1f215c26 | 1452 | rtx product_high = operand_subword (product, high, 1, mode); |
50b0c9ee | 1453 | rtx temp = expand_binop (word_mode, binoptab, op0_low, op1_xhigh, |
1454 | NULL_RTX, 0, OPTAB_DIRECT); | |
1f215c26 | 1455 | |
e22b1f65 | 1456 | if (!REG_P (product_high)) |
1457 | product_high = force_reg (word_mode, product_high); | |
1458 | ||
caf74f46 | 1459 | if (temp != 0) |
1460 | temp = expand_binop (word_mode, add_optab, temp, product_high, | |
1461 | product_high, 0, next_methods); | |
1f215c26 | 1462 | |
caf74f46 | 1463 | if (temp != 0 && temp != product_high) |
1464 | emit_move_insn (product_high, temp); | |
1465 | ||
1466 | if (temp != 0) | |
3ad4992f | 1467 | temp = expand_binop (word_mode, binoptab, op1_low, op0_xhigh, |
caf74f46 | 1468 | NULL_RTX, 0, OPTAB_DIRECT); |
1469 | ||
1470 | if (temp != 0) | |
1471 | temp = expand_binop (word_mode, add_optab, temp, | |
1472 | product_high, product_high, | |
1473 | 0, next_methods); | |
1f215c26 | 1474 | |
caf74f46 | 1475 | if (temp != 0 && temp != product_high) |
1476 | emit_move_insn (product_high, temp); | |
1f215c26 | 1477 | |
e22b1f65 | 1478 | emit_move_insn (operand_subword (product, high, 1, mode), product_high); |
1479 | ||
caf74f46 | 1480 | if (temp != 0) |
1481 | { | |
3c96cf42 | 1482 | if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) |
1483 | { | |
1484 | temp = emit_move_insn (product, product); | |
e29342dc | 1485 | set_unique_reg_note (temp, |
3ad4992f | 1486 | REG_EQUAL, |
e29342dc | 1487 | gen_rtx_fmt_ee (MULT, mode, |
1488 | copy_rtx (op0), | |
1489 | copy_rtx (op1))); | |
3c96cf42 | 1490 | } |
7014838c | 1491 | |
1f215c26 | 1492 | return product; |
1493 | } | |
1494 | } | |
1495 | ||
1496 | /* If we get here, we couldn't do it for some reason even though we | |
1497 | originally thought we could. Delete anything we've emitted in | |
1498 | trying to do it. */ | |
1499 | ||
1500 | delete_insns_since (last); | |
1501 | } | |
1502 | ||
ead34f59 | 1503 | /* Open-code the vector operations if we have no hardware support |
1504 | for them. */ | |
1505 | if (class == MODE_VECTOR_INT || class == MODE_VECTOR_FLOAT) | |
1506 | return expand_vector_binop (mode, binoptab, op0, op1, target, | |
1507 | unsignedp, methods); | |
1508 | ||
6854d5d1 | 1509 | /* We need to open-code the complex type operations: '+, -, * and /' */ |
1510 | ||
1511 | /* At this point we allow operations between two similar complex | |
1512 | numbers, and also if one of the operands is not a complex number | |
1513 | but rather of MODE_FLOAT or MODE_INT. However, the caller | |
1514 | must make sure that the MODE of the non-complex operand matches | |
b0217ae2 | 1515 | the SUBMODE of the complex operand. */ |
6854d5d1 | 1516 | |
1517 | if (class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT) | |
b0217ae2 | 1518 | { |
caf74f46 | 1519 | rtx real0 = 0, imag0 = 0; |
1520 | rtx real1 = 0, imag1 = 0; | |
1521 | rtx realr, imagr, res; | |
6854d5d1 | 1522 | rtx seq; |
1523 | rtx equiv_value; | |
caf74f46 | 1524 | int ok = 0; |
6854d5d1 | 1525 | |
2358393e | 1526 | /* Find the correct mode for the real and imaginary parts. */ |
e9e12845 | 1527 | enum machine_mode submode = GET_MODE_INNER(mode); |
6854d5d1 | 1528 | |
1529 | if (submode == BLKmode) | |
1530 | abort (); | |
1531 | ||
1532 | if (! target) | |
1533 | target = gen_reg_rtx (mode); | |
1534 | ||
1535 | start_sequence (); | |
1536 | ||
27bc6aee | 1537 | realr = gen_realpart (submode, target); |
a00c1647 | 1538 | imagr = gen_imagpart (submode, target); |
6854d5d1 | 1539 | |
1540 | if (GET_MODE (op0) == mode) | |
1541 | { | |
27bc6aee | 1542 | real0 = gen_realpart (submode, op0); |
a00c1647 | 1543 | imag0 = gen_imagpart (submode, op0); |
6854d5d1 | 1544 | } |
1545 | else | |
1546 | real0 = op0; | |
1547 | ||
1548 | if (GET_MODE (op1) == mode) | |
1549 | { | |
27bc6aee | 1550 | real1 = gen_realpart (submode, op1); |
a00c1647 | 1551 | imag1 = gen_imagpart (submode, op1); |
6854d5d1 | 1552 | } |
1553 | else | |
1554 | real1 = op1; | |
1555 | ||
1f4eab62 | 1556 | if (real0 == 0 || real1 == 0 || ! (imag0 != 0 || imag1 != 0)) |
6854d5d1 | 1557 | abort (); |
1558 | ||
b0217ae2 | 1559 | switch (binoptab->code) |
1560 | { | |
1561 | case PLUS: | |
7d577d05 | 1562 | /* (a+ib) + (c+id) = (a+c) + i(b+d) */ |
b0217ae2 | 1563 | case MINUS: |
7d577d05 | 1564 | /* (a+ib) - (c+id) = (a-c) + i(b-d) */ |
6854d5d1 | 1565 | res = expand_binop (submode, binoptab, real0, real1, |
1566 | realr, unsignedp, methods); | |
caf74f46 | 1567 | |
1568 | if (res == 0) | |
1569 | break; | |
1570 | else if (res != realr) | |
6854d5d1 | 1571 | emit_move_insn (realr, res); |
1572 | ||
63ec94ba | 1573 | if (imag0 != 0 && imag1 != 0) |
6854d5d1 | 1574 | res = expand_binop (submode, binoptab, imag0, imag1, |
1575 | imagr, unsignedp, methods); | |
63ec94ba | 1576 | else if (imag0 != 0) |
6854d5d1 | 1577 | res = imag0; |
1578 | else if (binoptab->code == MINUS) | |
bec2d490 | 1579 | res = expand_unop (submode, |
1580 | binoptab == subv_optab ? negv_optab : neg_optab, | |
1581 | imag1, imagr, unsignedp); | |
6854d5d1 | 1582 | else |
1583 | res = imag1; | |
1584 | ||
caf74f46 | 1585 | if (res == 0) |
1586 | break; | |
1587 | else if (res != imagr) | |
6854d5d1 | 1588 | emit_move_insn (imagr, res); |
caf74f46 | 1589 | |
1590 | ok = 1; | |
6854d5d1 | 1591 | break; |
b0217ae2 | 1592 | |
1593 | case MULT: | |
6854d5d1 | 1594 | /* (a+ib) * (c+id) = (ac-bd) + i(ad+cb) */ |
1595 | ||
63ec94ba | 1596 | if (imag0 != 0 && imag1 != 0) |
6854d5d1 | 1597 | { |
caf74f46 | 1598 | rtx temp1, temp2; |
1599 | ||
a04863f8 | 1600 | /* Don't fetch these from memory more than once. */ |
1601 | real0 = force_reg (submode, real0); | |
1602 | real1 = force_reg (submode, real1); | |
1603 | imag0 = force_reg (submode, imag0); | |
1604 | imag1 = force_reg (submode, imag1); | |
1605 | ||
caf74f46 | 1606 | temp1 = expand_binop (submode, binoptab, real0, real1, NULL_RTX, |
1607 | unsignedp, methods); | |
1608 | ||
1609 | temp2 = expand_binop (submode, binoptab, imag0, imag1, NULL_RTX, | |
1610 | unsignedp, methods); | |
1611 | ||
1612 | if (temp1 == 0 || temp2 == 0) | |
1613 | break; | |
1614 | ||
bec2d490 | 1615 | res = (expand_binop |
1616 | (submode, | |
1617 | binoptab == smulv_optab ? subv_optab : sub_optab, | |
1618 | temp1, temp2, realr, unsignedp, methods)); | |
6854d5d1 | 1619 | |
caf74f46 | 1620 | if (res == 0) |
1621 | break; | |
1622 | else if (res != realr) | |
a04863f8 | 1623 | emit_move_insn (realr, res); |
6854d5d1 | 1624 | |
caf74f46 | 1625 | temp1 = expand_binop (submode, binoptab, real0, imag1, |
1626 | NULL_RTX, unsignedp, methods); | |
1627 | ||
cf49a9b6 | 1628 | /* Avoid expanding redundant multiplication for the common |
1629 | case of squaring a complex number. */ | |
1630 | if (rtx_equal_p (real0, real1) && rtx_equal_p (imag0, imag1)) | |
1631 | temp2 = temp1; | |
1632 | else | |
1633 | temp2 = expand_binop (submode, binoptab, real1, imag0, | |
1634 | NULL_RTX, unsignedp, methods); | |
caf74f46 | 1635 | |
1636 | if (temp1 == 0 || temp2 == 0) | |
2fd3f4b5 | 1637 | break; |
28e012e5 | 1638 | |
bec2d490 | 1639 | res = (expand_binop |
1640 | (submode, | |
1641 | binoptab == smulv_optab ? addv_optab : add_optab, | |
1642 | temp1, temp2, imagr, unsignedp, methods)); | |
caf74f46 | 1643 | |
1644 | if (res == 0) | |
1645 | break; | |
1646 | else if (res != imagr) | |
6854d5d1 | 1647 | emit_move_insn (imagr, res); |
caf74f46 | 1648 | |
1649 | ok = 1; | |
6854d5d1 | 1650 | } |
1651 | else | |
1652 | { | |
a04863f8 | 1653 | /* Don't fetch these from memory more than once. */ |
1654 | real0 = force_reg (submode, real0); | |
1655 | real1 = force_reg (submode, real1); | |
1656 | ||
7d577d05 | 1657 | res = expand_binop (submode, binoptab, real0, real1, |
1658 | realr, unsignedp, methods); | |
caf74f46 | 1659 | if (res == 0) |
1660 | break; | |
1661 | else if (res != realr) | |
6854d5d1 | 1662 | emit_move_insn (realr, res); |
1663 | ||
63ec94ba | 1664 | if (imag0 != 0) |
6854d5d1 | 1665 | res = expand_binop (submode, binoptab, |
1666 | real1, imag0, imagr, unsignedp, methods); | |
1667 | else | |
1668 | res = expand_binop (submode, binoptab, | |
1669 | real0, imag1, imagr, unsignedp, methods); | |
caf74f46 | 1670 | |
1671 | if (res == 0) | |
1672 | break; | |
1673 | else if (res != imagr) | |
6854d5d1 | 1674 | emit_move_insn (imagr, res); |
caf74f46 | 1675 | |
1676 | ok = 1; | |
6854d5d1 | 1677 | } |
1678 | break; | |
b0217ae2 | 1679 | |
1680 | case DIV: | |
7d577d05 | 1681 | /* (a+ib) / (c+id) = ((ac+bd)/(cc+dd)) + i((bc-ad)/(cc+dd)) */ |
3ad4992f | 1682 | |
63ec94ba | 1683 | if (imag1 == 0) |
caf74f46 | 1684 | { |
1685 | /* (a+ib) / (c+i0) = (a/c) + i(b/c) */ | |
a04863f8 | 1686 | |
1687 | /* Don't fetch these from memory more than once. */ | |
1688 | real1 = force_reg (submode, real1); | |
1689 | ||
7d577d05 | 1690 | /* Simply divide the real and imaginary parts by `c' */ |
54f84eb0 | 1691 | if (class == MODE_COMPLEX_FLOAT) |
1692 | res = expand_binop (submode, binoptab, real0, real1, | |
1693 | realr, unsignedp, methods); | |
1694 | else | |
1695 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
1696 | real0, real1, realr, unsignedp); | |
1697 | ||
caf74f46 | 1698 | if (res == 0) |
1699 | break; | |
1700 | else if (res != realr) | |
6854d5d1 | 1701 | emit_move_insn (realr, res); |
1702 | ||
54f84eb0 | 1703 | if (class == MODE_COMPLEX_FLOAT) |
1704 | res = expand_binop (submode, binoptab, imag0, real1, | |
1705 | imagr, unsignedp, methods); | |
1706 | else | |
1707 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
1708 | imag0, real1, imagr, unsignedp); | |
1709 | ||
caf74f46 | 1710 | if (res == 0) |
1711 | break; | |
1712 | else if (res != imagr) | |
6854d5d1 | 1713 | emit_move_insn (imagr, res); |
6854d5d1 | 1714 | |
caf74f46 | 1715 | ok = 1; |
1716 | } | |
1717 | else | |
1718 | { | |
27bc6aee | 1719 | switch (flag_complex_divide_method) |
caf74f46 | 1720 | { |
27bc6aee | 1721 | case 0: |
1722 | ok = expand_cmplxdiv_straight (real0, real1, imag0, imag1, | |
1723 | realr, imagr, submode, | |
1724 | unsignedp, methods, | |
1725 | class, binoptab); | |
1726 | break; | |
ff9899b7 | 1727 | |
27bc6aee | 1728 | case 1: |
1729 | ok = expand_cmplxdiv_wide (real0, real1, imag0, imag1, | |
1730 | realr, imagr, submode, | |
1731 | unsignedp, methods, | |
1732 | class, binoptab); | |
1733 | break; | |
caf74f46 | 1734 | |
27bc6aee | 1735 | default: |
1736 | abort (); | |
6854d5d1 | 1737 | } |
6854d5d1 | 1738 | } |
1739 | break; | |
3ad4992f | 1740 | |
6854d5d1 | 1741 | default: |
1742 | abort (); | |
1743 | } | |
1744 | ||
22b7f142 | 1745 | seq = get_insns (); |
6854d5d1 | 1746 | end_sequence (); |
1747 | ||
caf74f46 | 1748 | if (ok) |
1749 | { | |
1750 | if (binoptab->code != UNKNOWN) | |
1751 | equiv_value | |
e02c6d1f | 1752 | = gen_rtx_fmt_ee (binoptab->code, mode, |
1753 | copy_rtx (op0), copy_rtx (op1)); | |
caf74f46 | 1754 | else |
1755 | equiv_value = 0; | |
3ad4992f | 1756 | |
caf74f46 | 1757 | emit_no_conflict_block (seq, target, op0, op1, equiv_value); |
3ad4992f | 1758 | |
caf74f46 | 1759 | return target; |
1760 | } | |
6854d5d1 | 1761 | } |
6854d5d1 | 1762 | |
1f215c26 | 1763 | /* It can't be open-coded in this mode. |
1764 | Use a library call if one is available and caller says that's ok. */ | |
1765 | ||
1766 | if (binoptab->handlers[(int) mode].libfunc | |
1767 | && (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN)) | |
1768 | { | |
1769 | rtx insns; | |
7c72e92e | 1770 | rtx op1x = op1; |
1771 | enum machine_mode op1_mode = mode; | |
bc4abce8 | 1772 | rtx value; |
1f215c26 | 1773 | |
1774 | start_sequence (); | |
1775 | ||
7c72e92e | 1776 | if (shift_op) |
1777 | { | |
1778 | op1_mode = word_mode; | |
1779 | /* Specify unsigned here, | |
1780 | since negative shift counts are meaningless. */ | |
1781 | op1x = convert_to_mode (word_mode, op1, 1); | |
1782 | } | |
1783 | ||
5913203b | 1784 | if (GET_MODE (op0) != VOIDmode |
1785 | && GET_MODE (op0) != mode) | |
7e4a644d | 1786 | op0 = convert_to_mode (mode, op0, unsignedp); |
1787 | ||
1f215c26 | 1788 | /* Pass 1 for NO_QUEUE so we don't lose any increments |
1789 | if the libcall is cse'd or moved. */ | |
bc4abce8 | 1790 | value = emit_library_call_value (binoptab->handlers[(int) mode].libfunc, |
2c5d421b | 1791 | NULL_RTX, LCT_CONST, mode, 2, |
bc4abce8 | 1792 | op0, mode, op1x, op1_mode); |
1f215c26 | 1793 | |
1794 | insns = get_insns (); | |
1795 | end_sequence (); | |
1796 | ||
1797 | target = gen_reg_rtx (mode); | |
bc4abce8 | 1798 | emit_libcall_block (insns, target, value, |
e02c6d1f | 1799 | gen_rtx_fmt_ee (binoptab->code, mode, op0, op1)); |
1f215c26 | 1800 | |
1801 | return target; | |
1802 | } | |
1803 | ||
1804 | delete_insns_since (last); | |
1805 | ||
1806 | /* It can't be done in this mode. Can we do it in a wider mode? */ | |
1807 | ||
1808 | if (! (methods == OPTAB_WIDEN || methods == OPTAB_LIB_WIDEN | |
1809 | || methods == OPTAB_MUST_WIDEN)) | |
ea35e69c | 1810 | { |
1811 | /* Caller says, don't even try. */ | |
1812 | delete_insns_since (entry_last); | |
1813 | return 0; | |
1814 | } | |
1f215c26 | 1815 | |
1816 | /* Compute the value of METHODS to pass to recursive calls. | |
1817 | Don't allow widening to be tried recursively. */ | |
1818 | ||
1819 | methods = (methods == OPTAB_LIB_WIDEN ? OPTAB_LIB : OPTAB_DIRECT); | |
1820 | ||
3b1a9578 | 1821 | /* Look for a wider mode of the same class for which it appears we can do |
1822 | the operation. */ | |
1f215c26 | 1823 | |
1824 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
1825 | { | |
3b1a9578 | 1826 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; |
1f215c26 | 1827 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) |
1828 | { | |
1829 | if ((binoptab->handlers[(int) wider_mode].insn_code | |
1830 | != CODE_FOR_nothing) | |
1831 | || (methods == OPTAB_LIB | |
1832 | && binoptab->handlers[(int) wider_mode].libfunc)) | |
1833 | { | |
1834 | rtx xop0 = op0, xop1 = op1; | |
1835 | int no_extend = 0; | |
1836 | ||
3b1a9578 | 1837 | /* For certain integer operations, we need not actually extend |
1f215c26 | 1838 | the narrow operands, as long as we will truncate |
45282828 | 1839 | the results to the same narrowness. */ |
1f215c26 | 1840 | |
3b1a9578 | 1841 | if ((binoptab == ior_optab || binoptab == and_optab |
1842 | || binoptab == xor_optab | |
1843 | || binoptab == add_optab || binoptab == sub_optab | |
80f0c37a | 1844 | || binoptab == smul_optab || binoptab == ashl_optab) |
45282828 | 1845 | && class == MODE_INT) |
1f215c26 | 1846 | no_extend = 1; |
1847 | ||
92d67582 | 1848 | xop0 = widen_operand (xop0, wider_mode, mode, |
1849 | unsignedp, no_extend); | |
303f6c6c | 1850 | |
1851 | /* The second operand of a shift must always be extended. */ | |
92d67582 | 1852 | xop1 = widen_operand (xop1, wider_mode, mode, unsignedp, |
80f0c37a | 1853 | no_extend && binoptab != ashl_optab); |
1f215c26 | 1854 | |
50b0c9ee | 1855 | temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX, |
1f215c26 | 1856 | unsignedp, methods); |
1857 | if (temp) | |
1858 | { | |
3b1a9578 | 1859 | if (class != MODE_INT) |
1f215c26 | 1860 | { |
1861 | if (target == 0) | |
1862 | target = gen_reg_rtx (mode); | |
1863 | convert_move (target, temp, 0); | |
1864 | return target; | |
1865 | } | |
1866 | else | |
1867 | return gen_lowpart (mode, temp); | |
1868 | } | |
1869 | else | |
1870 | delete_insns_since (last); | |
1871 | } | |
1872 | } | |
1873 | } | |
1874 | ||
ea35e69c | 1875 | delete_insns_since (entry_last); |
1f215c26 | 1876 | return 0; |
1877 | } | |
ead34f59 | 1878 | |
1879 | /* Like expand_binop, but for open-coding vectors binops. */ | |
1880 | ||
1881 | static rtx | |
3ad4992f | 1882 | expand_vector_binop (enum machine_mode mode, optab binoptab, rtx op0, |
1883 | rtx op1, rtx target, int unsignedp, | |
1884 | enum optab_methods methods) | |
ead34f59 | 1885 | { |
20407c42 | 1886 | enum machine_mode submode, tmode; |
1887 | int size, elts, subsize, subbitsize, i; | |
ead34f59 | 1888 | rtx t, a, b, res, seq; |
1889 | enum mode_class class; | |
1890 | ||
1891 | class = GET_MODE_CLASS (mode); | |
1892 | ||
2fd3f4b5 | 1893 | size = GET_MODE_SIZE (mode); |
ead34f59 | 1894 | submode = GET_MODE_INNER (mode); |
ead34f59 | 1895 | |
20407c42 | 1896 | /* Search for the widest vector mode with the same inner mode that is |
1897 | still narrower than MODE and that allows to open-code this operator. | |
1898 | Note, if we find such a mode and the handler later decides it can't | |
1899 | do the expansion, we'll be called recursively with the narrower mode. */ | |
1900 | for (tmode = GET_CLASS_NARROWEST_MODE (class); | |
1901 | GET_MODE_SIZE (tmode) < GET_MODE_SIZE (mode); | |
1902 | tmode = GET_MODE_WIDER_MODE (tmode)) | |
1903 | { | |
1904 | if (GET_MODE_INNER (tmode) == GET_MODE_INNER (mode) | |
1905 | && binoptab->handlers[(int) tmode].insn_code != CODE_FOR_nothing) | |
1906 | submode = tmode; | |
1907 | } | |
ead34f59 | 1908 | |
1909 | switch (binoptab->code) | |
1910 | { | |
20407c42 | 1911 | case AND: |
1912 | case IOR: | |
1913 | case XOR: | |
1914 | tmode = int_mode_for_mode (mode); | |
1915 | if (tmode != BLKmode) | |
1916 | submode = tmode; | |
ead34f59 | 1917 | case PLUS: |
1918 | case MINUS: | |
1919 | case MULT: | |
1920 | case DIV: | |
20407c42 | 1921 | subsize = GET_MODE_SIZE (submode); |
1922 | subbitsize = GET_MODE_BITSIZE (submode); | |
1923 | elts = size / subsize; | |
1924 | ||
1925 | /* If METHODS is OPTAB_DIRECT, we don't insist on the exact mode, | |
1926 | but that we operate on more than one element at a time. */ | |
1927 | if (subsize == GET_MODE_UNIT_SIZE (mode) && methods == OPTAB_DIRECT) | |
1928 | return 0; | |
1929 | ||
1930 | start_sequence (); | |
1931 | ||
1932 | /* Errors can leave us with a const0_rtx as operand. */ | |
1933 | if (GET_MODE (op0) != mode) | |
1934 | op0 = copy_to_mode_reg (mode, op0); | |
1935 | if (GET_MODE (op1) != mode) | |
1936 | op1 = copy_to_mode_reg (mode, op1); | |
1937 | ||
1938 | if (!target) | |
1939 | target = gen_reg_rtx (mode); | |
1940 | ||
ead34f59 | 1941 | for (i = 0; i < elts; ++i) |
1942 | { | |
20407c42 | 1943 | /* If this is part of a register, and not the first item in the |
1944 | word, we can't store using a SUBREG - that would clobber | |
1945 | previous results. | |
1946 | And storing with a SUBREG is only possible for the least | |
1947 | significant part, hence we can't do it for big endian | |
1948 | (unless we want to permute the evaluation order. */ | |
1949 | if (GET_CODE (target) == REG | |
1950 | && (BYTES_BIG_ENDIAN | |
1951 | ? subsize < UNITS_PER_WORD | |
1952 | : ((i * subsize) % UNITS_PER_WORD) != 0)) | |
1953 | t = NULL_RTX; | |
1954 | else | |
1955 | t = simplify_gen_subreg (submode, target, mode, i * subsize); | |
1956 | if (CONSTANT_P (op0)) | |
1957 | a = simplify_gen_subreg (submode, op0, mode, i * subsize); | |
1958 | else | |
1959 | a = extract_bit_field (op0, subbitsize, i * subbitsize, unsignedp, | |
1960 | NULL_RTX, submode, submode, size); | |
1961 | if (CONSTANT_P (op1)) | |
1962 | b = simplify_gen_subreg (submode, op1, mode, i * subsize); | |
1963 | else | |
1964 | b = extract_bit_field (op1, subbitsize, i * subbitsize, unsignedp, | |
1965 | NULL_RTX, submode, submode, size); | |
ead34f59 | 1966 | |
1967 | if (binoptab->code == DIV) | |
1968 | { | |
1969 | if (class == MODE_VECTOR_FLOAT) | |
1970 | res = expand_binop (submode, binoptab, a, b, t, | |
1971 | unsignedp, methods); | |
1972 | else | |
1973 | res = expand_divmod (0, TRUNC_DIV_EXPR, submode, | |
1974 | a, b, t, unsignedp); | |
1975 | } | |
1976 | else | |
1977 | res = expand_binop (submode, binoptab, a, b, t, | |
1978 | unsignedp, methods); | |
1979 | ||
1980 | if (res == 0) | |
1981 | break; | |
1982 | ||
20407c42 | 1983 | if (t) |
1984 | emit_move_insn (t, res); | |
1985 | else | |
1986 | store_bit_field (target, subbitsize, i * subbitsize, submode, res, | |
1987 | size); | |
ead34f59 | 1988 | } |
1989 | break; | |
1990 | ||
1991 | default: | |
1992 | abort (); | |
1993 | } | |
1994 | ||
1995 | seq = get_insns (); | |
1996 | end_sequence (); | |
1997 | emit_insn (seq); | |
1998 | ||
1999 | return target; | |
2000 | } | |
2001 | ||
2002 | /* Like expand_unop but for open-coding vector unops. */ | |
2003 | ||
2004 | static rtx | |
3ad4992f | 2005 | expand_vector_unop (enum machine_mode mode, optab unoptab, rtx op0, |
2006 | rtx target, int unsignedp) | |
ead34f59 | 2007 | { |
20407c42 | 2008 | enum machine_mode submode, tmode; |
2009 | int size, elts, subsize, subbitsize, i; | |
ead34f59 | 2010 | rtx t, a, res, seq; |
2011 | ||
2fd3f4b5 | 2012 | size = GET_MODE_SIZE (mode); |
ead34f59 | 2013 | submode = GET_MODE_INNER (mode); |
20407c42 | 2014 | |
2015 | /* Search for the widest vector mode with the same inner mode that is | |
2016 | still narrower than MODE and that allows to open-code this operator. | |
2017 | Note, if we find such a mode and the handler later decides it can't | |
2018 | do the expansion, we'll be called recursively with the narrower mode. */ | |
2019 | for (tmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (mode)); | |
2020 | GET_MODE_SIZE (tmode) < GET_MODE_SIZE (mode); | |
2021 | tmode = GET_MODE_WIDER_MODE (tmode)) | |
2022 | { | |
2023 | if (GET_MODE_INNER (tmode) == GET_MODE_INNER (mode) | |
2024 | && unoptab->handlers[(int) tmode].insn_code != CODE_FOR_nothing) | |
2025 | submode = tmode; | |
2026 | } | |
2027 | /* If there is no negate operation, try doing a subtract from zero. */ | |
07b68c99 | 2028 | if (unoptab == neg_optab && GET_MODE_CLASS (submode) == MODE_INT |
2029 | /* Avoid infinite recursion when an | |
2030 | error has left us with the wrong mode. */ | |
2031 | && GET_MODE (op0) == mode) | |
3ad4992f | 2032 | { |
20407c42 | 2033 | rtx temp; |
2034 | temp = expand_binop (mode, sub_optab, CONST0_RTX (mode), op0, | |
2035 | target, unsignedp, OPTAB_DIRECT); | |
2036 | if (temp) | |
2037 | return temp; | |
2038 | } | |
2039 | ||
2040 | if (unoptab == one_cmpl_optab) | |
2041 | { | |
2042 | tmode = int_mode_for_mode (mode); | |
2043 | if (tmode != BLKmode) | |
2044 | submode = tmode; | |
2045 | } | |
2046 | ||
2047 | subsize = GET_MODE_SIZE (submode); | |
2048 | subbitsize = GET_MODE_BITSIZE (submode); | |
2049 | elts = size / subsize; | |
2050 | ||
2051 | /* Errors can leave us with a const0_rtx as operand. */ | |
2052 | if (GET_MODE (op0) != mode) | |
2053 | op0 = copy_to_mode_reg (mode, op0); | |
ead34f59 | 2054 | |
2055 | if (!target) | |
2056 | target = gen_reg_rtx (mode); | |
2057 | ||
2058 | start_sequence (); | |
2059 | ||
ead34f59 | 2060 | for (i = 0; i < elts; ++i) |
2061 | { | |
20407c42 | 2062 | /* If this is part of a register, and not the first item in the |
2063 | word, we can't store using a SUBREG - that would clobber | |
2064 | previous results. | |
2065 | And storing with a SUBREG is only possible for the least | |
2066 | significant part, hence we can't do it for big endian | |
2067 | (unless we want to permute the evaluation order. */ | |
2068 | if (GET_CODE (target) == REG | |
2069 | && (BYTES_BIG_ENDIAN | |
2070 | ? subsize < UNITS_PER_WORD | |
2071 | : ((i * subsize) % UNITS_PER_WORD) != 0)) | |
2072 | t = NULL_RTX; | |
2073 | else | |
2074 | t = simplify_gen_subreg (submode, target, mode, i * subsize); | |
2075 | if (CONSTANT_P (op0)) | |
2076 | a = simplify_gen_subreg (submode, op0, mode, i * subsize); | |
2077 | else | |
2078 | a = extract_bit_field (op0, subbitsize, i * subbitsize, unsignedp, | |
2079 | t, submode, submode, size); | |
ead34f59 | 2080 | |
2081 | res = expand_unop (submode, unoptab, a, t, unsignedp); | |
2082 | ||
20407c42 | 2083 | if (t) |
2084 | emit_move_insn (t, res); | |
2085 | else | |
2086 | store_bit_field (target, subbitsize, i * subbitsize, submode, res, | |
2087 | size); | |
ead34f59 | 2088 | } |
2089 | ||
2090 | seq = get_insns (); | |
2091 | end_sequence (); | |
2092 | emit_insn (seq); | |
2093 | ||
2094 | return target; | |
2095 | } | |
1f215c26 | 2096 | \f |
2097 | /* Expand a binary operator which has both signed and unsigned forms. | |
2098 | UOPTAB is the optab for unsigned operations, and SOPTAB is for | |
2099 | signed operations. | |
2100 | ||
2101 | If we widen unsigned operands, we may use a signed wider operation instead | |
2102 | of an unsigned wider operation, since the result would be the same. */ | |
2103 | ||
2104 | rtx | |
3ad4992f | 2105 | sign_expand_binop (enum machine_mode mode, optab uoptab, optab soptab, |
2106 | rtx op0, rtx op1, rtx target, int unsignedp, | |
2107 | enum optab_methods methods) | |
1f215c26 | 2108 | { |
19cb6b50 | 2109 | rtx temp; |
1f215c26 | 2110 | optab direct_optab = unsignedp ? uoptab : soptab; |
2111 | struct optab wide_soptab; | |
2112 | ||
2113 | /* Do it without widening, if possible. */ | |
2114 | temp = expand_binop (mode, direct_optab, op0, op1, target, | |
2115 | unsignedp, OPTAB_DIRECT); | |
2116 | if (temp || methods == OPTAB_DIRECT) | |
2117 | return temp; | |
2118 | ||
2119 | /* Try widening to a signed int. Make a fake signed optab that | |
2120 | hides any signed insn for direct use. */ | |
2121 | wide_soptab = *soptab; | |
2122 | wide_soptab.handlers[(int) mode].insn_code = CODE_FOR_nothing; | |
2123 | wide_soptab.handlers[(int) mode].libfunc = 0; | |
2124 | ||
2125 | temp = expand_binop (mode, &wide_soptab, op0, op1, target, | |
2126 | unsignedp, OPTAB_WIDEN); | |
2127 | ||
2128 | /* For unsigned operands, try widening to an unsigned int. */ | |
2129 | if (temp == 0 && unsignedp) | |
2130 | temp = expand_binop (mode, uoptab, op0, op1, target, | |
2131 | unsignedp, OPTAB_WIDEN); | |
2132 | if (temp || methods == OPTAB_WIDEN) | |
2133 | return temp; | |
2134 | ||
2135 | /* Use the right width lib call if that exists. */ | |
2136 | temp = expand_binop (mode, direct_optab, op0, op1, target, unsignedp, OPTAB_LIB); | |
2137 | if (temp || methods == OPTAB_LIB) | |
2138 | return temp; | |
2139 | ||
2140 | /* Must widen and use a lib call, use either signed or unsigned. */ | |
2141 | temp = expand_binop (mode, &wide_soptab, op0, op1, target, | |
2142 | unsignedp, methods); | |
2143 | if (temp != 0) | |
2144 | return temp; | |
2145 | if (unsignedp) | |
2146 | return expand_binop (mode, uoptab, op0, op1, target, | |
2147 | unsignedp, methods); | |
2148 | return 0; | |
2149 | } | |
2150 | \f | |
2151 | /* Generate code to perform an operation specified by BINOPTAB | |
2152 | on operands OP0 and OP1, with two results to TARG1 and TARG2. | |
2153 | We assume that the order of the operands for the instruction | |
2154 | is TARG0, OP0, OP1, TARG1, which would fit a pattern like | |
2155 | [(set TARG0 (operate OP0 OP1)) (set TARG1 (operate ...))]. | |
2156 | ||
2157 | Either TARG0 or TARG1 may be zero, but what that means is that | |
3398e91d | 2158 | the result is not actually wanted. We will generate it into |
1f215c26 | 2159 | a dummy pseudo-reg and discard it. They may not both be zero. |
2160 | ||
2161 | Returns 1 if this operation can be performed; 0 if not. */ | |
2162 | ||
2163 | int | |
3ad4992f | 2164 | expand_twoval_binop (optab binoptab, rtx op0, rtx op1, rtx targ0, rtx targ1, |
2165 | int unsignedp) | |
1f215c26 | 2166 | { |
2167 | enum machine_mode mode = GET_MODE (targ0 ? targ0 : targ1); | |
2168 | enum mode_class class; | |
2169 | enum machine_mode wider_mode; | |
ea35e69c | 2170 | rtx entry_last = get_last_insn (); |
1f215c26 | 2171 | rtx last; |
2172 | ||
2173 | class = GET_MODE_CLASS (mode); | |
2174 | ||
2175 | op0 = protect_from_queue (op0, 0); | |
2176 | op1 = protect_from_queue (op1, 0); | |
2177 | ||
2178 | if (flag_force_mem) | |
2179 | { | |
2180 | op0 = force_not_mem (op0); | |
2181 | op1 = force_not_mem (op1); | |
2182 | } | |
2183 | ||
2184 | /* If we are inside an appropriately-short loop and one operand is an | |
2185 | expensive constant, force it into a register. */ | |
c9661aaa | 2186 | if (CONSTANT_P (op0) && preserve_subexpressions_p () |
e997907c | 2187 | && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1)) |
1f215c26 | 2188 | op0 = force_reg (mode, op0); |
2189 | ||
c9661aaa | 2190 | if (CONSTANT_P (op1) && preserve_subexpressions_p () |
e997907c | 2191 | && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1)) |
1f215c26 | 2192 | op1 = force_reg (mode, op1); |
2193 | ||
2194 | if (targ0) | |
2195 | targ0 = protect_from_queue (targ0, 1); | |
2196 | else | |
2197 | targ0 = gen_reg_rtx (mode); | |
2198 | if (targ1) | |
2199 | targ1 = protect_from_queue (targ1, 1); | |
2200 | else | |
2201 | targ1 = gen_reg_rtx (mode); | |
2202 | ||
2203 | /* Record where to go back to if we fail. */ | |
2204 | last = get_last_insn (); | |
2205 | ||
2206 | if (binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
2207 | { | |
2208 | int icode = (int) binoptab->handlers[(int) mode].insn_code; | |
6357eaae | 2209 | enum machine_mode mode0 = insn_data[icode].operand[1].mode; |
2210 | enum machine_mode mode1 = insn_data[icode].operand[2].mode; | |
1f215c26 | 2211 | rtx pat; |
2212 | rtx xop0 = op0, xop1 = op1; | |
2213 | ||
e805a0b5 | 2214 | /* In case the insn wants input operands in modes different from |
2215 | those of the actual operands, convert the operands. It would | |
2216 | seem that we don't need to convert CONST_INTs, but we do, so | |
67595860 | 2217 | that they're properly zero-extended, sign-extended or truncated |
2218 | for their mode. */ | |
1f215c26 | 2219 | |
e805a0b5 | 2220 | if (GET_MODE (op0) != mode0 && mode0 != VOIDmode) |
2221 | xop0 = convert_modes (mode0, | |
2222 | GET_MODE (op0) != VOIDmode | |
2223 | ? GET_MODE (op0) | |
2224 | : mode, | |
2225 | xop0, unsignedp); | |
2226 | ||
2227 | if (GET_MODE (op1) != mode1 && mode1 != VOIDmode) | |
2228 | xop1 = convert_modes (mode1, | |
2229 | GET_MODE (op1) != VOIDmode | |
2230 | ? GET_MODE (op1) | |
2231 | : mode, | |
2232 | xop1, unsignedp); | |
1f215c26 | 2233 | |
2234 | /* Now, if insn doesn't accept these operands, put them into pseudos. */ | |
6357eaae | 2235 | if (! (*insn_data[icode].operand[1].predicate) (xop0, mode0)) |
1f215c26 | 2236 | xop0 = copy_to_mode_reg (mode0, xop0); |
2237 | ||
6357eaae | 2238 | if (! (*insn_data[icode].operand[2].predicate) (xop1, mode1)) |
1f215c26 | 2239 | xop1 = copy_to_mode_reg (mode1, xop1); |
2240 | ||
2241 | /* We could handle this, but we should always be called with a pseudo | |
2242 | for our targets and all insns should take them as outputs. */ | |
6357eaae | 2243 | if (! (*insn_data[icode].operand[0].predicate) (targ0, mode) |
2244 | || ! (*insn_data[icode].operand[3].predicate) (targ1, mode)) | |
1f215c26 | 2245 | abort (); |
3ad4992f | 2246 | |
1f215c26 | 2247 | pat = GEN_FCN (icode) (targ0, xop0, xop1, targ1); |
2248 | if (pat) | |
2249 | { | |
2250 | emit_insn (pat); | |
2251 | return 1; | |
2252 | } | |
2253 | else | |
2254 | delete_insns_since (last); | |
2255 | } | |
2256 | ||
2257 | /* It can't be done in this mode. Can we do it in a wider mode? */ | |
2258 | ||
2259 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
2260 | { | |
3b1a9578 | 2261 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; |
1f215c26 | 2262 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) |
2263 | { | |
2264 | if (binoptab->handlers[(int) wider_mode].insn_code | |
2265 | != CODE_FOR_nothing) | |
2266 | { | |
19cb6b50 | 2267 | rtx t0 = gen_reg_rtx (wider_mode); |
2268 | rtx t1 = gen_reg_rtx (wider_mode); | |
4427eb38 | 2269 | rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp); |
2270 | rtx cop1 = convert_modes (wider_mode, mode, op1, unsignedp); | |
1f215c26 | 2271 | |
4427eb38 | 2272 | if (expand_twoval_binop (binoptab, cop0, cop1, |
1f215c26 | 2273 | t0, t1, unsignedp)) |
2274 | { | |
2275 | convert_move (targ0, t0, unsignedp); | |
2276 | convert_move (targ1, t1, unsignedp); | |
2277 | return 1; | |
2278 | } | |
2279 | else | |
2280 | delete_insns_since (last); | |
2281 | } | |
2282 | } | |
2283 | } | |
2284 | ||
ea35e69c | 2285 | delete_insns_since (entry_last); |
1f215c26 | 2286 | return 0; |
2287 | } | |
2288 | \f | |
ad99e708 | 2289 | /* Wrapper around expand_unop which takes an rtx code to specify |
2290 | the operation to perform, not an optab pointer. All other | |
2291 | arguments are the same. */ | |
2292 | rtx | |
3ad4992f | 2293 | expand_simple_unop (enum machine_mode mode, enum rtx_code code, rtx op0, |
2294 | rtx target, int unsignedp) | |
ad99e708 | 2295 | { |
2fd3f4b5 | 2296 | optab unop = code_to_optab[(int) code]; |
ad99e708 | 2297 | if (unop == 0) |
2298 | abort (); | |
2299 | ||
2300 | return expand_unop (mode, unop, op0, target, unsignedp); | |
2301 | } | |
2302 | ||
6a08d0ab | 2303 | /* Try calculating |
2304 | (clz:narrow x) | |
2305 | as | |
2306 | (clz:wide (zero_extend:wide x)) - ((width wide) - (width narrow)). */ | |
2307 | static rtx | |
3ad4992f | 2308 | widen_clz (enum machine_mode mode, rtx op0, rtx target) |
6a08d0ab | 2309 | { |
2310 | enum mode_class class = GET_MODE_CLASS (mode); | |
2311 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
2312 | { | |
2313 | enum machine_mode wider_mode; | |
2314 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; | |
2315 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
2316 | { | |
2317 | if (clz_optab->handlers[(int) wider_mode].insn_code | |
2318 | != CODE_FOR_nothing) | |
2319 | { | |
2320 | rtx xop0, temp, last; | |
2321 | ||
2322 | last = get_last_insn (); | |
2323 | ||
2324 | if (target == 0) | |
2325 | target = gen_reg_rtx (mode); | |
2326 | xop0 = widen_operand (op0, wider_mode, mode, true, false); | |
2327 | temp = expand_unop (wider_mode, clz_optab, xop0, NULL_RTX, true); | |
2328 | if (temp != 0) | |
2329 | temp = expand_binop (wider_mode, sub_optab, temp, | |
2330 | GEN_INT (GET_MODE_BITSIZE (wider_mode) | |
2331 | - GET_MODE_BITSIZE (mode)), | |
2332 | target, true, OPTAB_DIRECT); | |
2333 | if (temp == 0) | |
2334 | delete_insns_since (last); | |
2335 | ||
2336 | return temp; | |
2337 | } | |
2338 | } | |
2339 | } | |
2340 | return 0; | |
2341 | } | |
2342 | ||
2343 | /* Try calculating (parity x) as (and (popcount x) 1), where | |
2344 | popcount can also be done in a wider mode. */ | |
2345 | static rtx | |
3ad4992f | 2346 | expand_parity (enum machine_mode mode, rtx op0, rtx target) |
6a08d0ab | 2347 | { |
2348 | enum mode_class class = GET_MODE_CLASS (mode); | |
2349 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
2350 | { | |
2351 | enum machine_mode wider_mode; | |
2352 | for (wider_mode = mode; wider_mode != VOIDmode; | |
2353 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
2354 | { | |
2355 | if (popcount_optab->handlers[(int) wider_mode].insn_code | |
2356 | != CODE_FOR_nothing) | |
2357 | { | |
2358 | rtx xop0, temp, last; | |
2359 | ||
2360 | last = get_last_insn (); | |
2361 | ||
2362 | if (target == 0) | |
2363 | target = gen_reg_rtx (mode); | |
2364 | xop0 = widen_operand (op0, wider_mode, mode, true, false); | |
2365 | temp = expand_unop (wider_mode, popcount_optab, xop0, NULL_RTX, | |
2366 | true); | |
2367 | if (temp != 0) | |
2368 | temp = expand_binop (wider_mode, and_optab, temp, GEN_INT (1), | |
2369 | target, true, OPTAB_DIRECT); | |
2370 | if (temp == 0) | |
2371 | delete_insns_since (last); | |
2372 | ||
2373 | return temp; | |
2374 | } | |
2375 | } | |
2376 | } | |
2377 | return 0; | |
2378 | } | |
2379 | ||
1f215c26 | 2380 | /* Generate code to perform an operation specified by UNOPTAB |
2381 | on operand OP0, with result having machine-mode MODE. | |
2382 | ||
2383 | UNSIGNEDP is for the case where we have to widen the operands | |
2384 | to perform the operation. It says to use zero-extension. | |
2385 | ||
2386 | If TARGET is nonzero, the value | |
2387 | is generated there, if it is convenient to do so. | |
2388 | In all cases an rtx is returned for the locus of the value; | |
2389 | this may or may not be TARGET. */ | |
2390 | ||
2391 | rtx | |
3ad4992f | 2392 | expand_unop (enum machine_mode mode, optab unoptab, rtx op0, rtx target, |
2393 | int unsignedp) | |
1f215c26 | 2394 | { |
2395 | enum mode_class class; | |
2396 | enum machine_mode wider_mode; | |
19cb6b50 | 2397 | rtx temp; |
1f215c26 | 2398 | rtx last = get_last_insn (); |
2399 | rtx pat; | |
2400 | ||
2401 | class = GET_MODE_CLASS (mode); | |
2402 | ||
2403 | op0 = protect_from_queue (op0, 0); | |
2404 | ||
2405 | if (flag_force_mem) | |
2406 | { | |
2407 | op0 = force_not_mem (op0); | |
2408 | } | |
2409 | ||
2410 | if (target) | |
2411 | target = protect_from_queue (target, 1); | |
2412 | ||
2413 | if (unoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
2414 | { | |
2415 | int icode = (int) unoptab->handlers[(int) mode].insn_code; | |
6357eaae | 2416 | enum machine_mode mode0 = insn_data[icode].operand[1].mode; |
1f215c26 | 2417 | rtx xop0 = op0; |
2418 | ||
2419 | if (target) | |
2420 | temp = target; | |
2421 | else | |
2422 | temp = gen_reg_rtx (mode); | |
2423 | ||
2424 | if (GET_MODE (xop0) != VOIDmode | |
2425 | && GET_MODE (xop0) != mode0) | |
2426 | xop0 = convert_to_mode (mode0, xop0, unsignedp); | |
2427 | ||
2428 | /* Now, if insn doesn't accept our operand, put it into a pseudo. */ | |
2429 | ||
6357eaae | 2430 | if (! (*insn_data[icode].operand[1].predicate) (xop0, mode0)) |
1f215c26 | 2431 | xop0 = copy_to_mode_reg (mode0, xop0); |
2432 | ||
6357eaae | 2433 | if (! (*insn_data[icode].operand[0].predicate) (temp, mode)) |
1f215c26 | 2434 | temp = gen_reg_rtx (mode); |
2435 | ||
2436 | pat = GEN_FCN (icode) (temp, xop0); | |
2437 | if (pat) | |
2438 | { | |
31d3e01c | 2439 | if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX |
50b0c9ee | 2440 | && ! add_equal_note (pat, temp, unoptab->code, xop0, NULL_RTX)) |
1f215c26 | 2441 | { |
2442 | delete_insns_since (last); | |
50b0c9ee | 2443 | return expand_unop (mode, unoptab, op0, NULL_RTX, unsignedp); |
1f215c26 | 2444 | } |
2445 | ||
2446 | emit_insn (pat); | |
3ad4992f | 2447 | |
1f215c26 | 2448 | return temp; |
2449 | } | |
2450 | else | |
2451 | delete_insns_since (last); | |
2452 | } | |
2453 | ||
1dd91d55 | 2454 | /* It can't be done in this mode. Can we open-code it in a wider mode? */ |
2455 | ||
6a08d0ab | 2456 | /* Widening clz needs special treatment. */ |
2457 | if (unoptab == clz_optab) | |
2458 | { | |
2459 | temp = widen_clz (mode, op0, target); | |
2460 | if (temp) | |
2461 | return temp; | |
2462 | else | |
2463 | goto try_libcall; | |
2464 | } | |
2465 | ||
1dd91d55 | 2466 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) |
2467 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; | |
2468 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
2469 | { | |
2470 | if (unoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing) | |
2471 | { | |
2472 | rtx xop0 = op0; | |
2473 | ||
2474 | /* For certain operations, we need not actually extend | |
2475 | the narrow operand, as long as we will truncate the | |
45282828 | 2476 | results to the same narrowness. */ |
2477 | ||
92d67582 | 2478 | xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, |
45282828 | 2479 | (unoptab == neg_optab |
2480 | || unoptab == one_cmpl_optab) | |
2481 | && class == MODE_INT); | |
3ad4992f | 2482 | |
50b0c9ee | 2483 | temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX, |
2484 | unsignedp); | |
1dd91d55 | 2485 | |
2486 | if (temp) | |
2487 | { | |
2488 | if (class != MODE_INT) | |
2489 | { | |
2490 | if (target == 0) | |
2491 | target = gen_reg_rtx (mode); | |
2492 | convert_move (target, temp, 0); | |
2493 | return target; | |
2494 | } | |
2495 | else | |
2496 | return gen_lowpart (mode, temp); | |
2497 | } | |
2498 | else | |
2499 | delete_insns_since (last); | |
2500 | } | |
2501 | } | |
2502 | ||
1f215c26 | 2503 | /* These can be done a word at a time. */ |
2504 | if (unoptab == one_cmpl_optab | |
2505 | && class == MODE_INT | |
2506 | && GET_MODE_SIZE (mode) > UNITS_PER_WORD | |
3b1a9578 | 2507 | && unoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing) |
1f215c26 | 2508 | { |
76ab50f8 | 2509 | int i; |
1f215c26 | 2510 | rtx insns; |
2511 | ||
2512 | if (target == 0 || target == op0) | |
2513 | target = gen_reg_rtx (mode); | |
2514 | ||
2515 | start_sequence (); | |
2516 | ||
2517 | /* Do the actual arithmetic. */ | |
2518 | for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++) | |
2519 | { | |
2520 | rtx target_piece = operand_subword (target, i, 1, mode); | |
3b1a9578 | 2521 | rtx x = expand_unop (word_mode, unoptab, |
1f215c26 | 2522 | operand_subword_force (op0, i, mode), |
2523 | target_piece, unsignedp); | |
76ab50f8 | 2524 | |
1f215c26 | 2525 | if (target_piece != x) |
2526 | emit_move_insn (target_piece, x); | |
2527 | } | |
2528 | ||
2529 | insns = get_insns (); | |
2530 | end_sequence (); | |
2531 | ||
50b0c9ee | 2532 | emit_no_conflict_block (insns, target, op0, NULL_RTX, |
e02c6d1f | 2533 | gen_rtx_fmt_e (unoptab->code, mode, |
2534 | copy_rtx (op0))); | |
1f215c26 | 2535 | return target; |
2536 | } | |
2537 | ||
fc7385ae | 2538 | /* Open-code the complex negation operation. */ |
bec2d490 | 2539 | else if (unoptab->code == NEG |
fc7385ae | 2540 | && (class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)) |
2541 | { | |
2542 | rtx target_piece; | |
2543 | rtx x; | |
2544 | rtx seq; | |
2545 | ||
2358393e | 2546 | /* Find the correct mode for the real and imaginary parts. */ |
e9e12845 | 2547 | enum machine_mode submode = GET_MODE_INNER (mode); |
fc7385ae | 2548 | |
2549 | if (submode == BLKmode) | |
2550 | abort (); | |
2551 | ||
2552 | if (target == 0) | |
2553 | target = gen_reg_rtx (mode); | |
3ad4992f | 2554 | |
fc7385ae | 2555 | start_sequence (); |
2556 | ||
a00c1647 | 2557 | target_piece = gen_imagpart (submode, target); |
fc7385ae | 2558 | x = expand_unop (submode, unoptab, |
a00c1647 | 2559 | gen_imagpart (submode, op0), |
fc7385ae | 2560 | target_piece, unsignedp); |
2561 | if (target_piece != x) | |
2562 | emit_move_insn (target_piece, x); | |
2563 | ||
a00c1647 | 2564 | target_piece = gen_realpart (submode, target); |
fc7385ae | 2565 | x = expand_unop (submode, unoptab, |
a00c1647 | 2566 | gen_realpart (submode, op0), |
fc7385ae | 2567 | target_piece, unsignedp); |
2568 | if (target_piece != x) | |
2569 | emit_move_insn (target_piece, x); | |
2570 | ||
d063c0e3 | 2571 | seq = get_insns (); |
fc7385ae | 2572 | end_sequence (); |
2573 | ||
2574 | emit_no_conflict_block (seq, target, op0, 0, | |
e02c6d1f | 2575 | gen_rtx_fmt_e (unoptab->code, mode, |
2576 | copy_rtx (op0))); | |
fc7385ae | 2577 | return target; |
2578 | } | |
2579 | ||
805e22b2 | 2580 | /* Try negating floating point values by flipping the sign bit. */ |
2581 | if (unoptab->code == NEG && class == MODE_FLOAT | |
2582 | && GET_MODE_BITSIZE (mode) <= 2 * HOST_BITS_PER_WIDE_INT) | |
2583 | { | |
2584 | const struct real_format *fmt = real_format_for_mode[mode - QFmode]; | |
2585 | enum machine_mode imode = int_mode_for_mode (mode); | |
2586 | int bitpos = (fmt != 0) ? fmt->signbit : -1; | |
2587 | ||
2588 | if (imode != BLKmode && bitpos >= 0 && fmt->has_signed_zero) | |
2589 | { | |
2590 | HOST_WIDE_INT hi, lo; | |
2591 | rtx last = get_last_insn (); | |
2592 | ||
89ae05a2 | 2593 | /* Handle targets with different FP word orders. */ |
2594 | if (FLOAT_WORDS_BIG_ENDIAN != WORDS_BIG_ENDIAN) | |
2595 | { | |
2596 | int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD; | |
2597 | int word = nwords - (bitpos / BITS_PER_WORD) - 1; | |
2598 | bitpos = word * BITS_PER_WORD + bitpos % BITS_PER_WORD; | |
2599 | } | |
2600 | ||
805e22b2 | 2601 | if (bitpos < HOST_BITS_PER_WIDE_INT) |
2602 | { | |
2603 | hi = 0; | |
2604 | lo = (HOST_WIDE_INT) 1 << bitpos; | |
2605 | } | |
2606 | else | |
2607 | { | |
2608 | hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT); | |
2609 | lo = 0; | |
2610 | } | |
2611 | temp = expand_binop (imode, xor_optab, | |
2612 | gen_lowpart (imode, op0), | |
2613 | immed_double_const (lo, hi, imode), | |
2614 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
2615 | if (temp != 0) | |
2616 | return gen_lowpart (mode, temp); | |
2617 | delete_insns_since (last); | |
2618 | } | |
2619 | } | |
2620 | ||
6a08d0ab | 2621 | /* Try calculating parity (x) as popcount (x) % 2. */ |
2622 | if (unoptab == parity_optab) | |
2623 | { | |
2624 | temp = expand_parity (mode, op0, target); | |
2625 | if (temp) | |
2626 | return temp; | |
2627 | } | |
2628 | ||
2629 | try_libcall: | |
fc7385ae | 2630 | /* Now try a library call in this mode. */ |
1f215c26 | 2631 | if (unoptab->handlers[(int) mode].libfunc) |
2632 | { | |
2633 | rtx insns; | |
bc4abce8 | 2634 | rtx value; |
6a08d0ab | 2635 | enum machine_mode outmode = mode; |
2636 | ||
2637 | /* All of these functions return small values. Thus we choose to | |
2638 | have them return something that isn't a double-word. */ | |
2639 | if (unoptab == ffs_optab || unoptab == clz_optab || unoptab == ctz_optab | |
2640 | || unoptab == popcount_optab || unoptab == parity_optab) | |
7a02b4da | 2641 | outmode = TYPE_MODE (integer_type_node); |
1f215c26 | 2642 | |
2643 | start_sequence (); | |
2644 | ||
2645 | /* Pass 1 for NO_QUEUE so we don't lose any increments | |
2646 | if the libcall is cse'd or moved. */ | |
bc4abce8 | 2647 | value = emit_library_call_value (unoptab->handlers[(int) mode].libfunc, |
6a08d0ab | 2648 | NULL_RTX, LCT_CONST, outmode, |
2649 | 1, op0, mode); | |
1f215c26 | 2650 | insns = get_insns (); |
2651 | end_sequence (); | |
2652 | ||
6a08d0ab | 2653 | target = gen_reg_rtx (outmode); |
bc4abce8 | 2654 | emit_libcall_block (insns, target, value, |
e02c6d1f | 2655 | gen_rtx_fmt_e (unoptab->code, mode, op0)); |
1f215c26 | 2656 | |
2657 | return target; | |
2658 | } | |
2659 | ||
ead34f59 | 2660 | if (class == MODE_VECTOR_FLOAT || class == MODE_VECTOR_INT) |
2661 | return expand_vector_unop (mode, unoptab, op0, target, unsignedp); | |
2662 | ||
1f215c26 | 2663 | /* It can't be done in this mode. Can we do it in a wider mode? */ |
2664 | ||
2665 | if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT) | |
2666 | { | |
3b1a9578 | 2667 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; |
1f215c26 | 2668 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) |
2669 | { | |
2670 | if ((unoptab->handlers[(int) wider_mode].insn_code | |
2671 | != CODE_FOR_nothing) | |
2672 | || unoptab->handlers[(int) wider_mode].libfunc) | |
2673 | { | |
3b1a9578 | 2674 | rtx xop0 = op0; |
2675 | ||
2676 | /* For certain operations, we need not actually extend | |
2677 | the narrow operand, as long as we will truncate the | |
2678 | results to the same narrowness. */ | |
2679 | ||
92d67582 | 2680 | xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, |
45282828 | 2681 | (unoptab == neg_optab |
2682 | || unoptab == one_cmpl_optab) | |
2683 | && class == MODE_INT); | |
3ad4992f | 2684 | |
50b0c9ee | 2685 | temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX, |
2686 | unsignedp); | |
3b1a9578 | 2687 | |
7f10ce85 | 2688 | /* If we are generating clz using wider mode, adjust the |
2689 | result. */ | |
2690 | if (unoptab == clz_optab && temp != 0) | |
2691 | temp = expand_binop (wider_mode, sub_optab, temp, | |
2692 | GEN_INT (GET_MODE_BITSIZE (wider_mode) | |
2693 | - GET_MODE_BITSIZE (mode)), | |
2694 | target, true, OPTAB_DIRECT); | |
2695 | ||
3b1a9578 | 2696 | if (temp) |
1f215c26 | 2697 | { |
3b1a9578 | 2698 | if (class != MODE_INT) |
2699 | { | |
2700 | if (target == 0) | |
2701 | target = gen_reg_rtx (mode); | |
2702 | convert_move (target, temp, 0); | |
2703 | return target; | |
2704 | } | |
2705 | else | |
2706 | return gen_lowpart (mode, temp); | |
1f215c26 | 2707 | } |
2708 | else | |
3b1a9578 | 2709 | delete_insns_since (last); |
1f215c26 | 2710 | } |
2711 | } | |
2712 | } | |
2713 | ||
59e6f6ff | 2714 | /* If there is no negate operation, try doing a subtract from zero. |
2715 | The US Software GOFAST library needs this. */ | |
bec2d490 | 2716 | if (unoptab->code == NEG) |
3ad4992f | 2717 | { |
59e6f6ff | 2718 | rtx temp; |
bec2d490 | 2719 | temp = expand_binop (mode, |
2720 | unoptab == negv_optab ? subv_optab : sub_optab, | |
2721 | CONST0_RTX (mode), op0, | |
2722 | target, unsignedp, OPTAB_LIB_WIDEN); | |
59e6f6ff | 2723 | if (temp) |
2724 | return temp; | |
2725 | } | |
3ad4992f | 2726 | |
1f215c26 | 2727 | return 0; |
2728 | } | |
2729 | \f | |
a00c1647 | 2730 | /* Emit code to compute the absolute value of OP0, with result to |
2731 | TARGET if convenient. (TARGET may be 0.) The return value says | |
2732 | where the result actually is to be found. | |
2733 | ||
2734 | MODE is the mode of the operand; the mode of the result is | |
2735 | different but can be deduced from MODE. | |
2736 | ||
23449318 | 2737 | */ |
b4827f8d | 2738 | |
2739 | rtx | |
3ad4992f | 2740 | expand_abs_nojump (enum machine_mode mode, rtx op0, rtx target, |
2741 | int result_unsignedp) | |
b4827f8d | 2742 | { |
8ed073f5 | 2743 | rtx temp; |
b4827f8d | 2744 | |
bec2d490 | 2745 | if (! flag_trapv) |
2746 | result_unsignedp = 1; | |
2747 | ||
b4827f8d | 2748 | /* First try to do it with a special abs instruction. */ |
bec2d490 | 2749 | temp = expand_unop (mode, result_unsignedp ? abs_optab : absv_optab, |
2750 | op0, target, 0); | |
b4827f8d | 2751 | if (temp != 0) |
2752 | return temp; | |
2753 | ||
805e22b2 | 2754 | /* For floating point modes, try clearing the sign bit. */ |
2755 | if (GET_MODE_CLASS (mode) == MODE_FLOAT | |
2756 | && GET_MODE_BITSIZE (mode) <= 2 * HOST_BITS_PER_WIDE_INT) | |
2757 | { | |
2758 | const struct real_format *fmt = real_format_for_mode[mode - QFmode]; | |
2759 | enum machine_mode imode = int_mode_for_mode (mode); | |
2760 | int bitpos = (fmt != 0) ? fmt->signbit : -1; | |
2761 | ||
2762 | if (imode != BLKmode && bitpos >= 0) | |
2763 | { | |
2764 | HOST_WIDE_INT hi, lo; | |
2765 | rtx last = get_last_insn (); | |
2766 | ||
89ae05a2 | 2767 | /* Handle targets with different FP word orders. */ |
2768 | if (FLOAT_WORDS_BIG_ENDIAN != WORDS_BIG_ENDIAN) | |
2769 | { | |
2770 | int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD; | |
2771 | int word = nwords - (bitpos / BITS_PER_WORD) - 1; | |
2772 | bitpos = word * BITS_PER_WORD + bitpos % BITS_PER_WORD; | |
2773 | } | |
2774 | ||
805e22b2 | 2775 | if (bitpos < HOST_BITS_PER_WIDE_INT) |
2776 | { | |
2777 | hi = 0; | |
2778 | lo = (HOST_WIDE_INT) 1 << bitpos; | |
2779 | } | |
2780 | else | |
2781 | { | |
2782 | hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT); | |
2783 | lo = 0; | |
2784 | } | |
2785 | temp = expand_binop (imode, and_optab, | |
2786 | gen_lowpart (imode, op0), | |
2787 | immed_double_const (~lo, ~hi, imode), | |
2788 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
2789 | if (temp != 0) | |
2790 | return gen_lowpart (mode, temp); | |
2791 | delete_insns_since (last); | |
2792 | } | |
2793 | } | |
2794 | ||
155b05dc | 2795 | /* If we have a MAX insn, we can do this as MAX (x, -x). */ |
2796 | if (smax_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
2797 | { | |
2798 | rtx last = get_last_insn (); | |
2799 | ||
2800 | temp = expand_unop (mode, neg_optab, op0, NULL_RTX, 0); | |
2801 | if (temp != 0) | |
2802 | temp = expand_binop (mode, smax_optab, op0, temp, target, 0, | |
2803 | OPTAB_WIDEN); | |
2804 | ||
2805 | if (temp != 0) | |
2806 | return temp; | |
2807 | ||
2808 | delete_insns_since (last); | |
2809 | } | |
2810 | ||
b4827f8d | 2811 | /* If this machine has expensive jumps, we can do integer absolute |
2812 | value of X as (((signed) x >> (W-1)) ^ x) - ((signed) x >> (W-1)), | |
4e227d41 | 2813 | where W is the width of MODE. */ |
b4827f8d | 2814 | |
2815 | if (GET_MODE_CLASS (mode) == MODE_INT && BRANCH_COST >= 2) | |
2816 | { | |
2817 | rtx extended = expand_shift (RSHIFT_EXPR, mode, op0, | |
2818 | size_int (GET_MODE_BITSIZE (mode) - 1), | |
2819 | NULL_RTX, 0); | |
2820 | ||
2821 | temp = expand_binop (mode, xor_optab, extended, op0, target, 0, | |
2822 | OPTAB_LIB_WIDEN); | |
2823 | if (temp != 0) | |
bec2d490 | 2824 | temp = expand_binop (mode, result_unsignedp ? sub_optab : subv_optab, |
2825 | temp, extended, target, 0, OPTAB_LIB_WIDEN); | |
b4827f8d | 2826 | |
2827 | if (temp != 0) | |
2828 | return temp; | |
2829 | } | |
2830 | ||
8ed073f5 | 2831 | return NULL_RTX; |
2832 | } | |
2833 | ||
2834 | rtx | |
3ad4992f | 2835 | expand_abs (enum machine_mode mode, rtx op0, rtx target, |
2836 | int result_unsignedp, int safe) | |
8ed073f5 | 2837 | { |
2838 | rtx temp, op1; | |
2839 | ||
91d4c237 | 2840 | if (! flag_trapv) |
2841 | result_unsignedp = 1; | |
2842 | ||
8ed073f5 | 2843 | temp = expand_abs_nojump (mode, op0, target, result_unsignedp); |
2844 | if (temp != 0) | |
2845 | return temp; | |
2846 | ||
b4827f8d | 2847 | /* If that does not win, use conditional jump and negate. */ |
a1870317 | 2848 | |
2849 | /* It is safe to use the target if it is the same | |
2850 | as the source if this is also a pseudo register */ | |
2851 | if (op0 == target && GET_CODE (op0) == REG | |
2852 | && REGNO (op0) >= FIRST_PSEUDO_REGISTER) | |
2853 | safe = 1; | |
2854 | ||
b4827f8d | 2855 | op1 = gen_label_rtx (); |
2856 | if (target == 0 || ! safe | |
2857 | || GET_MODE (target) != mode | |
2858 | || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)) | |
2859 | || (GET_CODE (target) == REG | |
2860 | && REGNO (target) < FIRST_PSEUDO_REGISTER)) | |
2861 | target = gen_reg_rtx (mode); | |
2862 | ||
2863 | emit_move_insn (target, op0); | |
2864 | NO_DEFER_POP; | |
2865 | ||
2866 | /* If this mode is an integer too wide to compare properly, | |
2867 | compare word by word. Rely on CSE to optimize constant cases. */ | |
a4110d9a | 2868 | if (GET_MODE_CLASS (mode) == MODE_INT |
2869 | && ! can_compare_p (GE, mode, ccp_jump)) | |
3ad4992f | 2870 | do_jump_by_parts_greater_rtx (mode, 0, target, const0_rtx, |
b4827f8d | 2871 | NULL_RTX, op1); |
2872 | else | |
1a29b174 | 2873 | do_compare_rtx_and_jump (target, CONST0_RTX (mode), GE, 0, mode, |
2b96c5f6 | 2874 | NULL_RTX, NULL_RTX, op1); |
b4827f8d | 2875 | |
bec2d490 | 2876 | op0 = expand_unop (mode, result_unsignedp ? neg_optab : negv_optab, |
2877 | target, target, 0); | |
b4827f8d | 2878 | if (op0 != target) |
2879 | emit_move_insn (target, op0); | |
2880 | emit_label (op1); | |
2881 | OK_DEFER_POP; | |
2882 | return target; | |
2883 | } | |
2884 | \f | |
2885 | /* Emit code to compute the absolute value of OP0, with result to | |
2886 | TARGET if convenient. (TARGET may be 0.) The return value says | |
2887 | where the result actually is to be found. | |
2888 | ||
2889 | MODE is the mode of the operand; the mode of the result is | |
2890 | different but can be deduced from MODE. | |
2891 | ||
a00c1647 | 2892 | UNSIGNEDP is relevant for complex integer modes. */ |
2893 | ||
2894 | rtx | |
3ad4992f | 2895 | expand_complex_abs (enum machine_mode mode, rtx op0, rtx target, |
2896 | int unsignedp) | |
a00c1647 | 2897 | { |
2898 | enum mode_class class = GET_MODE_CLASS (mode); | |
2899 | enum machine_mode wider_mode; | |
19cb6b50 | 2900 | rtx temp; |
ea35e69c | 2901 | rtx entry_last = get_last_insn (); |
2902 | rtx last; | |
a00c1647 | 2903 | rtx pat; |
bec2d490 | 2904 | optab this_abs_optab; |
a00c1647 | 2905 | |
2906 | /* Find the correct mode for the real and imaginary parts. */ | |
e9e12845 | 2907 | enum machine_mode submode = GET_MODE_INNER (mode); |
a00c1647 | 2908 | |
2909 | if (submode == BLKmode) | |
2910 | abort (); | |
2911 | ||
2912 | op0 = protect_from_queue (op0, 0); | |
2913 | ||
2914 | if (flag_force_mem) | |
2915 | { | |
2916 | op0 = force_not_mem (op0); | |
2917 | } | |
2918 | ||
ea35e69c | 2919 | last = get_last_insn (); |
2920 | ||
a00c1647 | 2921 | if (target) |
2922 | target = protect_from_queue (target, 1); | |
2923 | ||
bec2d490 | 2924 | this_abs_optab = ! unsignedp && flag_trapv |
2925 | && (GET_MODE_CLASS(mode) == MODE_INT) | |
2926 | ? absv_optab : abs_optab; | |
2927 | ||
2928 | if (this_abs_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) | |
a00c1647 | 2929 | { |
bec2d490 | 2930 | int icode = (int) this_abs_optab->handlers[(int) mode].insn_code; |
6357eaae | 2931 | enum machine_mode mode0 = insn_data[icode].operand[1].mode; |
a00c1647 | 2932 | rtx xop0 = op0; |
2933 | ||
2934 | if (target) | |
2935 | temp = target; | |
2936 | else | |
2937 | temp = gen_reg_rtx (submode); | |
2938 | ||
2939 | if (GET_MODE (xop0) != VOIDmode | |
2940 | && GET_MODE (xop0) != mode0) | |
2941 | xop0 = convert_to_mode (mode0, xop0, unsignedp); | |
2942 | ||
2943 | /* Now, if insn doesn't accept our operand, put it into a pseudo. */ | |
2944 | ||
6357eaae | 2945 | if (! (*insn_data[icode].operand[1].predicate) (xop0, mode0)) |
a00c1647 | 2946 | xop0 = copy_to_mode_reg (mode0, xop0); |
2947 | ||
6357eaae | 2948 | if (! (*insn_data[icode].operand[0].predicate) (temp, submode)) |
a00c1647 | 2949 | temp = gen_reg_rtx (submode); |
2950 | ||
2951 | pat = GEN_FCN (icode) (temp, xop0); | |
2952 | if (pat) | |
2953 | { | |
31d3e01c | 2954 | if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX |
3ad4992f | 2955 | && ! add_equal_note (pat, temp, this_abs_optab->code, xop0, |
bec2d490 | 2956 | NULL_RTX)) |
a00c1647 | 2957 | { |
2958 | delete_insns_since (last); | |
3ad4992f | 2959 | return expand_unop (mode, this_abs_optab, op0, NULL_RTX, |
bec2d490 | 2960 | unsignedp); |
a00c1647 | 2961 | } |
2962 | ||
2963 | emit_insn (pat); | |
3ad4992f | 2964 | |
a00c1647 | 2965 | return temp; |
2966 | } | |
2967 | else | |
2968 | delete_insns_since (last); | |
2969 | } | |
2970 | ||
2971 | /* It can't be done in this mode. Can we open-code it in a wider mode? */ | |
2972 | ||
2973 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; | |
2974 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
2975 | { | |
3ad4992f | 2976 | if (this_abs_optab->handlers[(int) wider_mode].insn_code |
bec2d490 | 2977 | != CODE_FOR_nothing) |
a00c1647 | 2978 | { |
2979 | rtx xop0 = op0; | |
2980 | ||
92d67582 | 2981 | xop0 = convert_modes (wider_mode, mode, xop0, unsignedp); |
a00c1647 | 2982 | temp = expand_complex_abs (wider_mode, xop0, NULL_RTX, unsignedp); |
2983 | ||
2984 | if (temp) | |
2985 | { | |
2986 | if (class != MODE_COMPLEX_INT) | |
2987 | { | |
2988 | if (target == 0) | |
2989 | target = gen_reg_rtx (submode); | |
2990 | convert_move (target, temp, 0); | |
2991 | return target; | |
2992 | } | |
2993 | else | |
2994 | return gen_lowpart (submode, temp); | |
2995 | } | |
2996 | else | |
2997 | delete_insns_since (last); | |
2998 | } | |
2999 | } | |
3000 | ||
3001 | /* Open-code the complex absolute-value operation | |
3002 | if we can open-code sqrt. Otherwise it's not worth while. */ | |
59201b02 | 3003 | if (sqrt_optab->handlers[(int) submode].insn_code != CODE_FOR_nothing |
3004 | && ! flag_trapv) | |
a00c1647 | 3005 | { |
3006 | rtx real, imag, total; | |
3007 | ||
3008 | real = gen_realpart (submode, op0); | |
3009 | imag = gen_imagpart (submode, op0); | |
9ef07823 | 3010 | |
a00c1647 | 3011 | /* Square both parts. */ |
9ef07823 | 3012 | real = expand_mult (submode, real, real, NULL_RTX, 0); |
3013 | imag = expand_mult (submode, imag, imag, NULL_RTX, 0); | |
3014 | ||
a00c1647 | 3015 | /* Sum the parts. */ |
b2bc10f7 | 3016 | total = expand_binop (submode, add_optab, real, imag, NULL_RTX, |
a00c1647 | 3017 | 0, OPTAB_LIB_WIDEN); |
9ef07823 | 3018 | |
a00c1647 | 3019 | /* Get sqrt in TARGET. Set TARGET to where the result is. */ |
3020 | target = expand_unop (submode, sqrt_optab, total, target, 0); | |
3021 | if (target == 0) | |
3022 | delete_insns_since (last); | |
3023 | else | |
3024 | return target; | |
3025 | } | |
3026 | ||
3027 | /* Now try a library call in this mode. */ | |
bec2d490 | 3028 | if (this_abs_optab->handlers[(int) mode].libfunc) |
a00c1647 | 3029 | { |
3030 | rtx insns; | |
3f1a7b83 | 3031 | rtx value; |
a00c1647 | 3032 | |
3033 | start_sequence (); | |
3034 | ||
3035 | /* Pass 1 for NO_QUEUE so we don't lose any increments | |
3036 | if the libcall is cse'd or moved. */ | |
bc4abce8 | 3037 | value = emit_library_call_value (abs_optab->handlers[(int) mode].libfunc, |
2c5d421b | 3038 | NULL_RTX, LCT_CONST, submode, 1, op0, mode); |
a00c1647 | 3039 | insns = get_insns (); |
3040 | end_sequence (); | |
3041 | ||
3042 | target = gen_reg_rtx (submode); | |
bc4abce8 | 3043 | emit_libcall_block (insns, target, value, |
bec2d490 | 3044 | gen_rtx_fmt_e (this_abs_optab->code, mode, op0)); |
a00c1647 | 3045 | |
3046 | return target; | |
3047 | } | |
3048 | ||
3049 | /* It can't be done in this mode. Can we do it in a wider mode? */ | |
3050 | ||
3051 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; | |
3052 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
3053 | { | |
bec2d490 | 3054 | if ((this_abs_optab->handlers[(int) wider_mode].insn_code |
a00c1647 | 3055 | != CODE_FOR_nothing) |
bec2d490 | 3056 | || this_abs_optab->handlers[(int) wider_mode].libfunc) |
a00c1647 | 3057 | { |
3058 | rtx xop0 = op0; | |
3059 | ||
92d67582 | 3060 | xop0 = convert_modes (wider_mode, mode, xop0, unsignedp); |
a00c1647 | 3061 | |
3062 | temp = expand_complex_abs (wider_mode, xop0, NULL_RTX, unsignedp); | |
3063 | ||
3064 | if (temp) | |
3065 | { | |
3066 | if (class != MODE_COMPLEX_INT) | |
3067 | { | |
3068 | if (target == 0) | |
3069 | target = gen_reg_rtx (submode); | |
3070 | convert_move (target, temp, 0); | |
3071 | return target; | |
3072 | } | |
3073 | else | |
3074 | return gen_lowpart (submode, temp); | |
3075 | } | |
3076 | else | |
3077 | delete_insns_since (last); | |
3078 | } | |
3079 | } | |
3080 | ||
ea35e69c | 3081 | delete_insns_since (entry_last); |
a00c1647 | 3082 | return 0; |
3083 | } | |
3084 | \f | |
1f215c26 | 3085 | /* Generate an instruction whose insn-code is INSN_CODE, |
3086 | with two operands: an output TARGET and an input OP0. | |
3087 | TARGET *must* be nonzero, and the output is always stored there. | |
3088 | CODE is an rtx code such that (CODE OP0) is an rtx that describes | |
3089 | the value that is stored into TARGET. */ | |
3090 | ||
3091 | void | |
3ad4992f | 3092 | emit_unop_insn (int icode, rtx target, rtx op0, enum rtx_code code) |
1f215c26 | 3093 | { |
19cb6b50 | 3094 | rtx temp; |
6357eaae | 3095 | enum machine_mode mode0 = insn_data[icode].operand[1].mode; |
1f215c26 | 3096 | rtx pat; |
3097 | ||
3098 | temp = target = protect_from_queue (target, 1); | |
3099 | ||
3100 | op0 = protect_from_queue (op0, 0); | |
3101 | ||
ce46332d | 3102 | /* Sign and zero extension from memory is often done specially on |
3103 | RISC machines, so forcing into a register here can pessimize | |
3104 | code. */ | |
3105 | if (flag_force_mem && code != SIGN_EXTEND && code != ZERO_EXTEND) | |
1f215c26 | 3106 | op0 = force_not_mem (op0); |
3107 | ||
3108 | /* Now, if insn does not accept our operands, put them into pseudos. */ | |
3109 | ||
6357eaae | 3110 | if (! (*insn_data[icode].operand[1].predicate) (op0, mode0)) |
1f215c26 | 3111 | op0 = copy_to_mode_reg (mode0, op0); |
3112 | ||
6357eaae | 3113 | if (! (*insn_data[icode].operand[0].predicate) (temp, GET_MODE (temp)) |
1f215c26 | 3114 | || (flag_force_mem && GET_CODE (temp) == MEM)) |
3115 | temp = gen_reg_rtx (GET_MODE (temp)); | |
3116 | ||
3117 | pat = GEN_FCN (icode) (temp, op0); | |
3118 | ||
31d3e01c | 3119 | if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX && code != UNKNOWN) |
50b0c9ee | 3120 | add_equal_note (pat, temp, code, op0, NULL_RTX); |
3ad4992f | 3121 | |
1f215c26 | 3122 | emit_insn (pat); |
3123 | ||
3124 | if (temp != target) | |
3125 | emit_move_insn (target, temp); | |
3126 | } | |
3127 | \f | |
3128 | /* Emit code to perform a series of operations on a multi-word quantity, one | |
3129 | word at a time. | |
3130 | ||
f9e15121 | 3131 | Such a block is preceded by a CLOBBER of the output, consists of multiple |
1f215c26 | 3132 | insns, each setting one word of the output, and followed by a SET copying |
3133 | the output to itself. | |
3134 | ||
3135 | Each of the insns setting words of the output receives a REG_NO_CONFLICT | |
3136 | note indicating that it doesn't conflict with the (also multi-word) | |
3137 | inputs. The entire block is surrounded by REG_LIBCALL and REG_RETVAL | |
3138 | notes. | |
3139 | ||
3140 | INSNS is a block of code generated to perform the operation, not including | |
3141 | the CLOBBER and final copy. All insns that compute intermediate values | |
3ad4992f | 3142 | are first emitted, followed by the block as described above. |
1f215c26 | 3143 | |
3144 | TARGET, OP0, and OP1 are the output and inputs of the operations, | |
3145 | respectively. OP1 may be zero for a unary operation. | |
3146 | ||
7fd957fe | 3147 | EQUIV, if nonzero, is an expression to be placed into a REG_EQUAL note |
1f215c26 | 3148 | on the last insn. |
3149 | ||
3150 | If TARGET is not a register, INSNS is simply emitted with no special | |
0a4da51b | 3151 | processing. Likewise if anything in INSNS is not an INSN or if |
3152 | there is a libcall block inside INSNS. | |
1f215c26 | 3153 | |
3154 | The final insn emitted is returned. */ | |
3155 | ||
3156 | rtx | |
3ad4992f | 3157 | emit_no_conflict_block (rtx insns, rtx target, rtx op0, rtx op1, rtx equiv) |
1f215c26 | 3158 | { |
3159 | rtx prev, next, first, last, insn; | |
3160 | ||
3161 | if (GET_CODE (target) != REG || reload_in_progress) | |
31d3e01c | 3162 | return emit_insn (insns); |
0a4da51b | 3163 | else |
3164 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
3165 | if (GET_CODE (insn) != INSN | |
3166 | || find_reg_note (insn, REG_LIBCALL, NULL_RTX)) | |
31d3e01c | 3167 | return emit_insn (insns); |
1f215c26 | 3168 | |
3169 | /* First emit all insns that do not store into words of the output and remove | |
3170 | these from the list. */ | |
3171 | for (insn = insns; insn; insn = next) | |
3172 | { | |
0814fb51 | 3173 | rtx set = 0, note; |
1f215c26 | 3174 | int i; |
3175 | ||
3176 | next = NEXT_INSN (insn); | |
3177 | ||
0814fb51 | 3178 | /* Some ports (cris) create an libcall regions at their own. We must |
3179 | avoid any potential nesting of LIBCALLs. */ | |
3180 | if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL) | |
3181 | remove_note (insn, note); | |
3182 | if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL) | |
3183 | remove_note (insn, note); | |
3184 | ||
7014838c | 3185 | if (GET_CODE (PATTERN (insn)) == SET || GET_CODE (PATTERN (insn)) == USE |
3186 | || GET_CODE (PATTERN (insn)) == CLOBBER) | |
1f215c26 | 3187 | set = PATTERN (insn); |
3188 | else if (GET_CODE (PATTERN (insn)) == PARALLEL) | |
3189 | { | |
3190 | for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++) | |
3191 | if (GET_CODE (XVECEXP (PATTERN (insn), 0, i)) == SET) | |
3192 | { | |
3193 | set = XVECEXP (PATTERN (insn), 0, i); | |
3194 | break; | |
3195 | } | |
3196 | } | |
3197 | ||
3198 | if (set == 0) | |
3199 | abort (); | |
3200 | ||
3201 | if (! reg_overlap_mentioned_p (target, SET_DEST (set))) | |
3202 | { | |
3203 | if (PREV_INSN (insn)) | |
3204 | NEXT_INSN (PREV_INSN (insn)) = next; | |
3205 | else | |
3206 | insns = next; | |
3207 | ||
3208 | if (next) | |
3209 | PREV_INSN (next) = PREV_INSN (insn); | |
3210 | ||
3211 | add_insn (insn); | |
3212 | } | |
3213 | } | |
3214 | ||
3215 | prev = get_last_insn (); | |
3216 | ||
3217 | /* Now write the CLOBBER of the output, followed by the setting of each | |
3218 | of the words, followed by the final copy. */ | |
3219 | if (target != op0 && target != op1) | |
e02c6d1f | 3220 | emit_insn (gen_rtx_CLOBBER (VOIDmode, target)); |
1f215c26 | 3221 | |
3222 | for (insn = insns; insn; insn = next) | |
3223 | { | |
3224 | next = NEXT_INSN (insn); | |
3225 | add_insn (insn); | |
3226 | ||
3227 | if (op1 && GET_CODE (op1) == REG) | |
e02c6d1f | 3228 | REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op1, |
3229 | REG_NOTES (insn)); | |
1f215c26 | 3230 | |
3231 | if (op0 && GET_CODE (op0) == REG) | |
e02c6d1f | 3232 | REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op0, |
3233 | REG_NOTES (insn)); | |
1f215c26 | 3234 | } |
3235 | ||
a04863f8 | 3236 | if (mov_optab->handlers[(int) GET_MODE (target)].insn_code |
3237 | != CODE_FOR_nothing) | |
3238 | { | |
3239 | last = emit_move_insn (target, target); | |
3240 | if (equiv) | |
e29342dc | 3241 | set_unique_reg_note (last, REG_EQUAL, equiv); |
a04863f8 | 3242 | } |
3243 | else | |
041d2731 | 3244 | { |
3245 | last = get_last_insn (); | |
3246 | ||
3247 | /* Remove any existing REG_EQUAL note from "last", or else it will | |
3248 | be mistaken for a note referring to the full contents of the | |
3249 | alleged libcall value when found together with the REG_RETVAL | |
3250 | note added below. An existing note can come from an insn | |
3251 | expansion at "last". */ | |
3252 | remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX)); | |
3253 | } | |
1f215c26 | 3254 | |
3255 | if (prev == 0) | |
3256 | first = get_insns (); | |
3257 | else | |
3258 | first = NEXT_INSN (prev); | |
3259 | ||
3260 | /* Encapsulate the block so it gets manipulated as a unit. */ | |
e02c6d1f | 3261 | REG_NOTES (first) = gen_rtx_INSN_LIST (REG_LIBCALL, last, |
3262 | REG_NOTES (first)); | |
3263 | REG_NOTES (last) = gen_rtx_INSN_LIST (REG_RETVAL, first, REG_NOTES (last)); | |
1f215c26 | 3264 | |
3265 | return last; | |
3266 | } | |
3267 | \f | |
3268 | /* Emit code to make a call to a constant function or a library call. | |
3269 | ||
3270 | INSNS is a list containing all insns emitted in the call. | |
3271 | These insns leave the result in RESULT. Our block is to copy RESULT | |
3272 | to TARGET, which is logically equivalent to EQUIV. | |
3273 | ||
3274 | We first emit any insns that set a pseudo on the assumption that these are | |
3275 | loading constants into registers; doing so allows them to be safely cse'ed | |
3276 | between blocks. Then we emit all the other insns in the block, followed by | |
3277 | an insn to move RESULT to TARGET. This last insn will have a REQ_EQUAL | |
3278 | note with an operand of EQUIV. | |
3279 | ||
13cf6a4c | 3280 | Moving assignments to pseudos outside of the block is done to improve |
3281 | the generated code, but is not required to generate correct code, | |
3282 | hence being unable to move an assignment is not grounds for not making | |
3283 | a libcall block. There are two reasons why it is safe to leave these | |
3284 | insns inside the block: First, we know that these pseudos cannot be | |
3285 | used in generated RTL outside the block since they are created for | |
3286 | temporary purposes within the block. Second, CSE will not record the | |
3287 | values of anything set inside a libcall block, so we know they must | |
3288 | be dead at the end of the block. | |
3289 | ||
1f215c26 | 3290 | Except for the first group of insns (the ones setting pseudos), the |
3291 | block is delimited by REG_RETVAL and REG_LIBCALL notes. */ | |
3292 | ||
3293 | void | |
3ad4992f | 3294 | emit_libcall_block (rtx insns, rtx target, rtx result, rtx equiv) |
1f215c26 | 3295 | { |
08852b5f | 3296 | rtx final_dest = target; |
1f215c26 | 3297 | rtx prev, next, first, last, insn; |
3298 | ||
08852b5f | 3299 | /* If this is a reg with REG_USERVAR_P set, then it could possibly turn |
3300 | into a MEM later. Protect the libcall block from this change. */ | |
3301 | if (! REG_P (target) || REG_USERVAR_P (target)) | |
3302 | target = gen_reg_rtx (GET_MODE (target)); | |
3ad4992f | 3303 | |
9c207309 | 3304 | /* If we're using non-call exceptions, a libcall corresponding to an |
3305 | operation that may trap may also trap. */ | |
3306 | if (flag_non_call_exceptions && may_trap_p (equiv)) | |
3307 | { | |
3308 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
3309 | if (GET_CODE (insn) == CALL_INSN) | |
3310 | { | |
3311 | rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); | |
3ad4992f | 3312 | |
9c207309 | 3313 | if (note != 0 && INTVAL (XEXP (note, 0)) <= 0) |
3314 | remove_note (insn, note); | |
3315 | } | |
3316 | } | |
3317 | else | |
454c42da | 3318 | /* look for any CALL_INSNs in this sequence, and attach a REG_EH_REGION |
8c8b35e2 | 3319 | reg note to indicate that this call cannot throw or execute a nonlocal |
a0cae1a0 | 3320 | goto (unless there is already a REG_EH_REGION note, in which case |
c198dd74 | 3321 | we update it). */ |
9c207309 | 3322 | for (insn = insns; insn; insn = NEXT_INSN (insn)) |
3323 | if (GET_CODE (insn) == CALL_INSN) | |
3324 | { | |
3325 | rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); | |
3ad4992f | 3326 | |
9c207309 | 3327 | if (note != 0) |
3328 | XEXP (note, 0) = GEN_INT (-1); | |
3329 | else | |
3330 | REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_EH_REGION, GEN_INT (-1), | |
3331 | REG_NOTES (insn)); | |
3332 | } | |
454c42da | 3333 | |
1f215c26 | 3334 | /* First emit all insns that set pseudos. Remove them from the list as |
63c77ac7 | 3335 | we go. Avoid insns that set pseudos which were referenced in previous |
13cf6a4c | 3336 | insns. These can be generated by move_by_pieces, for example, |
63c77ac7 | 3337 | to update an address. Similarly, avoid insns that reference things |
3338 | set in previous insns. */ | |
1f215c26 | 3339 | |
3340 | for (insn = insns; insn; insn = next) | |
3341 | { | |
3342 | rtx set = single_set (insn); | |
0814fb51 | 3343 | rtx note; |
3344 | ||
3345 | /* Some ports (cris) create an libcall regions at their own. We must | |
3346 | avoid any potential nesting of LIBCALLs. */ | |
3347 | if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL) | |
3348 | remove_note (insn, note); | |
3349 | if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL) | |
3350 | remove_note (insn, note); | |
1f215c26 | 3351 | |
3352 | next = NEXT_INSN (insn); | |
3353 | ||
3354 | if (set != 0 && GET_CODE (SET_DEST (set)) == REG | |
13cf6a4c | 3355 | && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER |
df04f077 | 3356 | && (insn == insns |
f7d7781d | 3357 | || ((! INSN_P(insns) |
3358 | || ! reg_mentioned_p (SET_DEST (set), PATTERN (insns))) | |
63c77ac7 | 3359 | && ! reg_used_between_p (SET_DEST (set), insns, insn) |
3360 | && ! modified_in_p (SET_SRC (set), insns) | |
3361 | && ! modified_between_p (SET_SRC (set), insns, insn)))) | |
1f215c26 | 3362 | { |
3363 | if (PREV_INSN (insn)) | |
3364 | NEXT_INSN (PREV_INSN (insn)) = next; | |
3365 | else | |
3366 | insns = next; | |
3367 | ||
3368 | if (next) | |
3369 | PREV_INSN (next) = PREV_INSN (insn); | |
3370 | ||
3371 | add_insn (insn); | |
3372 | } | |
227ea566 | 3373 | |
3374 | /* Some ports use a loop to copy large arguments onto the stack. | |
3375 | Don't move anything outside such a loop. */ | |
3376 | if (GET_CODE (insn) == CODE_LABEL) | |
3377 | break; | |
1f215c26 | 3378 | } |
3379 | ||
3380 | prev = get_last_insn (); | |
3381 | ||
3382 | /* Write the remaining insns followed by the final copy. */ | |
3383 | ||
3384 | for (insn = insns; insn; insn = next) | |
3385 | { | |
3386 | next = NEXT_INSN (insn); | |
3387 | ||
3388 | add_insn (insn); | |
3389 | } | |
3390 | ||
3391 | last = emit_move_insn (target, result); | |
3c96cf42 | 3392 | if (mov_optab->handlers[(int) GET_MODE (target)].insn_code |
3393 | != CODE_FOR_nothing) | |
e29342dc | 3394 | set_unique_reg_note (last, REG_EQUAL, copy_rtx (equiv)); |
041d2731 | 3395 | else |
3396 | { | |
3397 | /* Remove any existing REG_EQUAL note from "last", or else it will | |
3398 | be mistaken for a note referring to the full contents of the | |
3399 | libcall value when found together with the REG_RETVAL note added | |
3400 | below. An existing note can come from an insn expansion at | |
3401 | "last". */ | |
3402 | remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX)); | |
3403 | } | |
1f215c26 | 3404 | |
f6f723c2 | 3405 | if (final_dest != target) |
3406 | emit_move_insn (final_dest, target); | |
08852b5f | 3407 | |
1f215c26 | 3408 | if (prev == 0) |
3409 | first = get_insns (); | |
3410 | else | |
3411 | first = NEXT_INSN (prev); | |
3412 | ||
3413 | /* Encapsulate the block so it gets manipulated as a unit. */ | |
35c33b84 | 3414 | if (!flag_non_call_exceptions || !may_trap_p (equiv)) |
3415 | { | |
d16f9b9d | 3416 | /* We can't attach the REG_LIBCALL and REG_RETVAL notes |
3417 | when the encapsulated region would not be in one basic block, | |
3418 | i.e. when there is a control_flow_insn_p insn between FIRST and LAST. | |
3419 | */ | |
3420 | bool attach_libcall_retval_notes = true; | |
3421 | next = NEXT_INSN (last); | |
3422 | for (insn = first; insn != next; insn = NEXT_INSN (insn)) | |
3423 | if (control_flow_insn_p (insn)) | |
3424 | { | |
3425 | attach_libcall_retval_notes = false; | |
3426 | break; | |
3427 | } | |
3428 | ||
3429 | if (attach_libcall_retval_notes) | |
3430 | { | |
3431 | REG_NOTES (first) = gen_rtx_INSN_LIST (REG_LIBCALL, last, | |
3432 | REG_NOTES (first)); | |
3433 | REG_NOTES (last) = gen_rtx_INSN_LIST (REG_RETVAL, first, | |
3434 | REG_NOTES (last)); | |
3435 | } | |
35c33b84 | 3436 | } |
1f215c26 | 3437 | } |
3438 | \f | |
3439 | /* Generate code to store zero in X. */ | |
3440 | ||
3441 | void | |
3ad4992f | 3442 | emit_clr_insn (rtx x) |
1f215c26 | 3443 | { |
3444 | emit_move_insn (x, const0_rtx); | |
3445 | } | |
3446 | ||
3447 | /* Generate code to store 1 in X | |
3448 | assuming it contains zero beforehand. */ | |
3449 | ||
3450 | void | |
3ad4992f | 3451 | emit_0_to_1_insn (rtx x) |
1f215c26 | 3452 | { |
3453 | emit_move_insn (x, const1_rtx); | |
3454 | } | |
3455 | ||
10ee3e0f | 3456 | /* Nonzero if we can perform a comparison of mode MODE straightforwardly. |
a4110d9a | 3457 | PURPOSE describes how this comparison will be used. CODE is the rtx |
3458 | comparison code we will be using. | |
3459 | ||
3460 | ??? Actually, CODE is slightly weaker than that. A target is still | |
3ad4992f | 3461 | required to implement all of the normal bcc operations, but not |
a4110d9a | 3462 | required to implement all (or any) of the unordered bcc operations. */ |
3ad4992f | 3463 | |
10ee3e0f | 3464 | int |
3ad4992f | 3465 | can_compare_p (enum rtx_code code, enum machine_mode mode, |
3466 | enum can_compare_purpose purpose) | |
1a29b174 | 3467 | { |
3468 | do | |
3469 | { | |
2fd3f4b5 | 3470 | if (cmp_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) |
a4110d9a | 3471 | { |
3472 | if (purpose == ccp_jump) | |
2fd3f4b5 | 3473 | return bcc_gen_fctn[(int) code] != NULL; |
a4110d9a | 3474 | else if (purpose == ccp_store_flag) |
2fd3f4b5 | 3475 | return setcc_gen_code[(int) code] != CODE_FOR_nothing; |
a4110d9a | 3476 | else |
3477 | /* There's only one cmov entry point, and it's allowed to fail. */ | |
3478 | return 1; | |
3479 | } | |
10ee3e0f | 3480 | if (purpose == ccp_jump |
2fd3f4b5 | 3481 | && cbranch_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) |
10ee3e0f | 3482 | return 1; |
3483 | if (purpose == ccp_cmov | |
2fd3f4b5 | 3484 | && cmov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) |
10ee3e0f | 3485 | return 1; |
3486 | if (purpose == ccp_store_flag | |
2fd3f4b5 | 3487 | && cstore_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing) |
10ee3e0f | 3488 | return 1; |
3489 | ||
1a29b174 | 3490 | mode = GET_MODE_WIDER_MODE (mode); |
10ee3e0f | 3491 | } |
3492 | while (mode != VOIDmode); | |
1a29b174 | 3493 | |
3494 | return 0; | |
3495 | } | |
3496 | ||
3497 | /* This function is called when we are going to emit a compare instruction that | |
3498 | compares the values found in *PX and *PY, using the rtl operator COMPARISON. | |
3499 | ||
3500 | *PMODE is the mode of the inputs (in case they are const_int). | |
3501 | *PUNSIGNEDP nonzero says that the operands are unsigned; | |
1f215c26 | 3502 | this matters if they need to be widened. |
3503 | ||
2b96c5f6 | 3504 | If they have mode BLKmode, then SIZE specifies the size of both operands. |
1f215c26 | 3505 | |
1a29b174 | 3506 | This function performs all the setup necessary so that the caller only has |
3507 | to emit a single comparison insn. This setup can involve doing a BLKmode | |
3508 | comparison or emitting a library call to perform the comparison if no insn | |
3509 | is available to handle it. | |
3510 | The values which are passed in through pointers can be modified; the caller | |
3511 | should perform the comparison on the modified values. */ | |
1f215c26 | 3512 | |
2b96c5f6 | 3513 | static void |
3ad4992f | 3514 | prepare_cmp_insn (rtx *px, rtx *py, enum rtx_code *pcomparison, rtx size, |
3515 | enum machine_mode *pmode, int *punsignedp, | |
3516 | enum can_compare_purpose purpose) | |
1f215c26 | 3517 | { |
1a29b174 | 3518 | enum machine_mode mode = *pmode; |
3519 | rtx x = *px, y = *py; | |
3520 | int unsignedp = *punsignedp; | |
1f215c26 | 3521 | enum mode_class class; |
1f215c26 | 3522 | |
3523 | class = GET_MODE_CLASS (mode); | |
3524 | ||
3525 | /* They could both be VOIDmode if both args are immediate constants, | |
3526 | but we should fold that at an earlier stage. | |
3527 | With no special code here, this will call abort, | |
3528 | reminding the programmer to implement such folding. */ | |
3529 | ||
3530 | if (mode != BLKmode && flag_force_mem) | |
3531 | { | |
1d37ed98 | 3532 | /* Load duplicate non-volatile operands once. */ |
3533 | if (rtx_equal_p (x, y) && ! volatile_refs_p (x)) | |
3534 | { | |
3535 | x = force_not_mem (x); | |
3536 | y = x; | |
3537 | } | |
3538 | else | |
3539 | { | |
3540 | x = force_not_mem (x); | |
3541 | y = force_not_mem (y); | |
3542 | } | |
1f215c26 | 3543 | } |
3544 | ||
3545 | /* If we are inside an appropriately-short loop and one operand is an | |
3546 | expensive constant, force it into a register. */ | |
325d1c45 | 3547 | if (CONSTANT_P (x) && preserve_subexpressions_p () |
e997907c | 3548 | && rtx_cost (x, COMPARE) > COSTS_N_INSNS (1)) |
1f215c26 | 3549 | x = force_reg (mode, x); |
3550 | ||
325d1c45 | 3551 | if (CONSTANT_P (y) && preserve_subexpressions_p () |
e997907c | 3552 | && rtx_cost (y, COMPARE) > COSTS_N_INSNS (1)) |
1f215c26 | 3553 | y = force_reg (mode, y); |
3554 | ||
989c2a69 | 3555 | #ifdef HAVE_cc0 |
3556 | /* Abort if we have a non-canonical comparison. The RTL documentation | |
3557 | states that canonical comparisons are required only for targets which | |
3558 | have cc0. */ | |
3559 | if (CONSTANT_P (x) && ! CONSTANT_P (y)) | |
2fd3f4b5 | 3560 | abort (); |
989c2a69 | 3561 | #endif |
3562 | ||
1f215c26 | 3563 | /* Don't let both operands fail to indicate the mode. */ |
3564 | if (GET_MODE (x) == VOIDmode && GET_MODE (y) == VOIDmode) | |
3565 | x = force_reg (mode, x); | |
3566 | ||
3567 | /* Handle all BLKmode compares. */ | |
3568 | ||
3569 | if (mode == BLKmode) | |
3570 | { | |
1a29b174 | 3571 | rtx result; |
3572 | enum machine_mode result_mode; | |
7a9a4287 | 3573 | rtx opalign ATTRIBUTE_UNUSED |
3574 | = GEN_INT (MIN (MEM_ALIGN (x), MEM_ALIGN (y)) / BITS_PER_UNIT); | |
1a29b174 | 3575 | |
1f215c26 | 3576 | emit_queue (); |
3577 | x = protect_from_queue (x, 0); | |
3578 | y = protect_from_queue (y, 0); | |
3579 | ||
3580 | if (size == 0) | |
3581 | abort (); | |
3582 | #ifdef HAVE_cmpstrqi | |
3583 | if (HAVE_cmpstrqi | |
3584 | && GET_CODE (size) == CONST_INT | |
3585 | && INTVAL (size) < (1 << GET_MODE_BITSIZE (QImode))) | |
3586 | { | |
6357eaae | 3587 | result_mode = insn_data[(int) CODE_FOR_cmpstrqi].operand[0].mode; |
1a29b174 | 3588 | result = gen_reg_rtx (result_mode); |
325d1c45 | 3589 | emit_insn (gen_cmpstrqi (result, x, y, size, opalign)); |
1f215c26 | 3590 | } |
3591 | else | |
3592 | #endif | |
3593 | #ifdef HAVE_cmpstrhi | |
3594 | if (HAVE_cmpstrhi | |
3595 | && GET_CODE (size) == CONST_INT | |
3596 | && INTVAL (size) < (1 << GET_MODE_BITSIZE (HImode))) | |
3597 | { | |
6357eaae | 3598 | result_mode = insn_data[(int) CODE_FOR_cmpstrhi].operand[0].mode; |
1a29b174 | 3599 | result = gen_reg_rtx (result_mode); |
325d1c45 | 3600 | emit_insn (gen_cmpstrhi (result, x, y, size, opalign)); |
1f215c26 | 3601 | } |
3602 | else | |
3603 | #endif | |
3604 | #ifdef HAVE_cmpstrsi | |
3605 | if (HAVE_cmpstrsi) | |
3606 | { | |
6357eaae | 3607 | result_mode = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode; |
1a29b174 | 3608 | result = gen_reg_rtx (result_mode); |
60b66860 | 3609 | size = protect_from_queue (size, 0); |
1f215c26 | 3610 | emit_insn (gen_cmpstrsi (result, x, y, |
3611 | convert_to_mode (SImode, size, 1), | |
325d1c45 | 3612 | opalign)); |
1f215c26 | 3613 | } |
3614 | else | |
3615 | #endif | |
3616 | { | |
3617 | #ifdef TARGET_MEM_FUNCTIONS | |
e7285115 | 3618 | result = emit_library_call_value (memcmp_libfunc, NULL_RTX, LCT_PURE_MAKE_BLOCK, |
3619 | TYPE_MODE (integer_type_node), 3, | |
3620 | XEXP (x, 0), Pmode, XEXP (y, 0), Pmode, | |
3621 | convert_to_mode (TYPE_MODE (sizetype), size, | |
3622 | TREE_UNSIGNED (sizetype)), | |
3623 | TYPE_MODE (sizetype)); | |
1f215c26 | 3624 | #else |
e7285115 | 3625 | result = emit_library_call_value (bcmp_libfunc, NULL_RTX, LCT_PURE_MAKE_BLOCK, |
3626 | TYPE_MODE (integer_type_node), 3, | |
3627 | XEXP (x, 0), Pmode, XEXP (y, 0), Pmode, | |
3628 | convert_to_mode (TYPE_MODE (integer_type_node), | |
3629 | size, | |
3630 | TREE_UNSIGNED (integer_type_node)), | |
3631 | TYPE_MODE (integer_type_node)); | |
1f215c26 | 3632 | #endif |
15cd8ddf | 3633 | |
1a29b174 | 3634 | result_mode = TYPE_MODE (integer_type_node); |
1f215c26 | 3635 | } |
1a29b174 | 3636 | *px = result; |
3637 | *py = const0_rtx; | |
3638 | *pmode = result_mode; | |
1f215c26 | 3639 | return; |
3640 | } | |
3641 | ||
1a29b174 | 3642 | *px = x; |
3643 | *py = y; | |
a4110d9a | 3644 | if (can_compare_p (*pcomparison, mode, purpose)) |
1a29b174 | 3645 | return; |
1f215c26 | 3646 | |
3647 | /* Handle a lib call just for the mode we are using. */ | |
3648 | ||
1a29b174 | 3649 | if (cmp_optab->handlers[(int) mode].libfunc && class != MODE_FLOAT) |
1f215c26 | 3650 | { |
3651 | rtx libfunc = cmp_optab->handlers[(int) mode].libfunc; | |
15cd8ddf | 3652 | rtx result; |
3653 | ||
1f215c26 | 3654 | /* If we want unsigned, and this mode has a distinct unsigned |
3655 | comparison routine, use that. */ | |
3656 | if (unsignedp && ucmp_optab->handlers[(int) mode].libfunc) | |
3657 | libfunc = ucmp_optab->handlers[(int) mode].libfunc; | |
3658 | ||
e7285115 | 3659 | result = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST_MAKE_BLOCK, |
3660 | word_mode, 2, x, mode, y, mode); | |
15cd8ddf | 3661 | |
1f215c26 | 3662 | /* Integer comparison returns a result that must be compared against 1, |
3663 | so that even if we do an unsigned compare afterward, | |
3664 | there is still a value that can represent the result "less than". */ | |
1a29b174 | 3665 | *px = result; |
3666 | *py = const1_rtx; | |
3667 | *pmode = word_mode; | |
1f215c26 | 3668 | return; |
3669 | } | |
3670 | ||
3671 | if (class == MODE_FLOAT) | |
6f71c48d | 3672 | prepare_float_lib_cmp (px, py, pcomparison, pmode, punsignedp); |
1f215c26 | 3673 | |
3674 | else | |
3675 | abort (); | |
3676 | } | |
3677 | ||
1a29b174 | 3678 | /* Before emitting an insn with code ICODE, make sure that X, which is going |
3679 | to be used for operand OPNUM of the insn, is converted from mode MODE to | |
20dd417a | 3680 | WIDER_MODE (UNSIGNEDP determines whether it is an unsigned conversion), and |
1a29b174 | 3681 | that it is accepted by the operand predicate. Return the new value. */ |
ef6c17ed | 3682 | |
10ee3e0f | 3683 | rtx |
3ad4992f | 3684 | prepare_operand (int icode, rtx x, int opnum, enum machine_mode mode, |
3685 | enum machine_mode wider_mode, int unsignedp) | |
1a29b174 | 3686 | { |
3687 | x = protect_from_queue (x, 0); | |
3688 | ||
3689 | if (mode != wider_mode) | |
3690 | x = convert_modes (wider_mode, mode, x, unsignedp); | |
3691 | ||
6357eaae | 3692 | if (! (*insn_data[icode].operand[opnum].predicate) |
3693 | (x, insn_data[icode].operand[opnum].mode)) | |
3694 | x = copy_to_mode_reg (insn_data[icode].operand[opnum].mode, x); | |
1a29b174 | 3695 | return x; |
3696 | } | |
3697 | ||
3698 | /* Subroutine of emit_cmp_and_jump_insns; this function is called when we know | |
3699 | we can do the comparison. | |
3700 | The arguments are the same as for emit_cmp_and_jump_insns; but LABEL may | |
3701 | be NULL_RTX which indicates that only a comparison is to be generated. */ | |
3702 | ||
3703 | static void | |
3ad4992f | 3704 | emit_cmp_and_jump_insn_1 (rtx x, rtx y, enum machine_mode mode, |
3705 | enum rtx_code comparison, int unsignedp, rtx label) | |
1a29b174 | 3706 | { |
3707 | rtx test = gen_rtx_fmt_ee (comparison, mode, x, y); | |
3708 | enum mode_class class = GET_MODE_CLASS (mode); | |
3709 | enum machine_mode wider_mode = mode; | |
3710 | ||
3711 | /* Try combined insns first. */ | |
3712 | do | |
3713 | { | |
3714 | enum insn_code icode; | |
3715 | PUT_MODE (test, wider_mode); | |
3716 | ||
10ee3e0f | 3717 | if (label) |
3ad4992f | 3718 | { |
2fd3f4b5 | 3719 | icode = cbranch_optab->handlers[(int) wider_mode].insn_code; |
3ad4992f | 3720 | |
10ee3e0f | 3721 | if (icode != CODE_FOR_nothing |
3722 | && (*insn_data[icode].operand[0].predicate) (test, wider_mode)) | |
3723 | { | |
3724 | x = prepare_operand (icode, x, 1, mode, wider_mode, unsignedp); | |
3725 | y = prepare_operand (icode, y, 2, mode, wider_mode, unsignedp); | |
3726 | emit_jump_insn (GEN_FCN (icode) (test, x, y, label)); | |
3727 | return; | |
3728 | } | |
3729 | } | |
3730 | ||
1a29b174 | 3731 | /* Handle some compares against zero. */ |
3732 | icode = (int) tst_optab->handlers[(int) wider_mode].insn_code; | |
3733 | if (y == CONST0_RTX (mode) && icode != CODE_FOR_nothing) | |
3734 | { | |
3735 | x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp); | |
3736 | emit_insn (GEN_FCN (icode) (x)); | |
3737 | if (label) | |
3738 | emit_jump_insn ((*bcc_gen_fctn[(int) comparison]) (label)); | |
3739 | return; | |
3740 | } | |
3741 | ||
3742 | /* Handle compares for which there is a directly suitable insn. */ | |
3743 | ||
3744 | icode = (int) cmp_optab->handlers[(int) wider_mode].insn_code; | |
3745 | if (icode != CODE_FOR_nothing) | |
3746 | { | |
3747 | x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp); | |
3748 | y = prepare_operand (icode, y, 1, mode, wider_mode, unsignedp); | |
3749 | emit_insn (GEN_FCN (icode) (x, y)); | |
3750 | if (label) | |
3751 | emit_jump_insn ((*bcc_gen_fctn[(int) comparison]) (label)); | |
3752 | return; | |
3753 | } | |
3754 | ||
3755 | if (class != MODE_INT && class != MODE_FLOAT | |
3756 | && class != MODE_COMPLEX_FLOAT) | |
3757 | break; | |
3758 | ||
3759 | wider_mode = GET_MODE_WIDER_MODE (wider_mode); | |
2fd3f4b5 | 3760 | } |
3761 | while (wider_mode != VOIDmode); | |
1a29b174 | 3762 | |
3763 | abort (); | |
3764 | } | |
3765 | ||
989c2a69 | 3766 | /* Generate code to compare X with Y so that the condition codes are |
3767 | set and to jump to LABEL if the condition is true. If X is a | |
3768 | constant and Y is not a constant, then the comparison is swapped to | |
3769 | ensure that the comparison RTL has the canonical form. | |
3770 | ||
5a894bc6 | 3771 | UNSIGNEDP nonzero says that X and Y are unsigned; this matters if they |
3772 | need to be widened by emit_cmp_insn. UNSIGNEDP is also used to select | |
3773 | the proper branch condition code. | |
989c2a69 | 3774 | |
2b96c5f6 | 3775 | If X and Y have mode BLKmode, then SIZE specifies the size of both X and Y. |
989c2a69 | 3776 | |
5a894bc6 | 3777 | MODE is the mode of the inputs (in case they are const_int). |
3778 | ||
3779 | COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). It will | |
3780 | be passed unchanged to emit_cmp_insn, then potentially converted into an | |
3781 | unsigned variant based on UNSIGNEDP to select a proper jump instruction. */ | |
989c2a69 | 3782 | |
3783 | void | |
3ad4992f | 3784 | emit_cmp_and_jump_insns (rtx x, rtx y, enum rtx_code comparison, rtx size, |
3785 | enum machine_mode mode, int unsignedp, rtx label) | |
989c2a69 | 3786 | { |
f5ef1390 | 3787 | rtx op0 = x, op1 = y; |
3788 | ||
3789 | /* Swap operands and condition to ensure canonical RTL. */ | |
3790 | if (swap_commutative_operands_p (x, y)) | |
989c2a69 | 3791 | { |
f5ef1390 | 3792 | /* If we're not emitting a branch, this means some caller |
3793 | is out of sync. */ | |
3794 | if (! label) | |
3795 | abort (); | |
3796 | ||
3797 | op0 = y, op1 = x; | |
3798 | comparison = swap_condition (comparison); | |
989c2a69 | 3799 | } |
dfd1e7f2 | 3800 | |
3801 | #ifdef HAVE_cc0 | |
3802 | /* If OP0 is still a constant, then both X and Y must be constants. Force | |
3803 | X into a register to avoid aborting in emit_cmp_insn due to non-canonical | |
3804 | RTL. */ | |
3805 | if (CONSTANT_P (op0)) | |
3806 | op0 = force_reg (mode, op0); | |
3807 | #endif | |
3808 | ||
1a29b174 | 3809 | emit_queue (); |
5a894bc6 | 3810 | if (unsignedp) |
3811 | comparison = unsigned_condition (comparison); | |
2b96c5f6 | 3812 | |
3813 | prepare_cmp_insn (&op0, &op1, &comparison, size, &mode, &unsignedp, | |
10ee3e0f | 3814 | ccp_jump); |
1a29b174 | 3815 | emit_cmp_and_jump_insn_1 (op0, op1, mode, comparison, unsignedp, label); |
3816 | } | |
3817 | ||
3818 | /* Like emit_cmp_and_jump_insns, but generate only the comparison. */ | |
325d1c45 | 3819 | |
1a29b174 | 3820 | void |
3ad4992f | 3821 | emit_cmp_insn (rtx x, rtx y, enum rtx_code comparison, rtx size, |
3822 | enum machine_mode mode, int unsignedp) | |
1a29b174 | 3823 | { |
2b96c5f6 | 3824 | emit_cmp_and_jump_insns (x, y, comparison, size, mode, unsignedp, 0); |
989c2a69 | 3825 | } |
1f215c26 | 3826 | \f |
3827 | /* Emit a library call comparison between floating point X and Y. | |
3828 | COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). */ | |
3829 | ||
6f71c48d | 3830 | static void |
3ad4992f | 3831 | prepare_float_lib_cmp (rtx *px, rtx *py, enum rtx_code *pcomparison, |
3832 | enum machine_mode *pmode, int *punsignedp) | |
1f215c26 | 3833 | { |
6f71c48d | 3834 | enum rtx_code comparison = *pcomparison; |
c81364d2 | 3835 | rtx tmp; |
2230aa5d | 3836 | rtx x = *px = protect_from_queue (*px, 0); |
3837 | rtx y = *py = protect_from_queue (*py, 0); | |
1f215c26 | 3838 | enum machine_mode mode = GET_MODE (x); |
460f974d | 3839 | rtx libfunc = 0; |
15cd8ddf | 3840 | rtx result; |
1f215c26 | 3841 | |
9557005f | 3842 | if (mode == HFmode) |
3843 | switch (comparison) | |
3844 | { | |
3845 | case EQ: | |
3846 | libfunc = eqhf2_libfunc; | |
3847 | break; | |
3848 | ||
3849 | case NE: | |
3850 | libfunc = nehf2_libfunc; | |
3851 | break; | |
3852 | ||
3853 | case GT: | |
3854 | libfunc = gthf2_libfunc; | |
c81364d2 | 3855 | if (libfunc == NULL_RTX) |
3856 | { | |
3857 | tmp = x; x = y; y = tmp; | |
3858 | *pcomparison = LT; | |
3859 | libfunc = lthf2_libfunc; | |
3860 | } | |
9557005f | 3861 | break; |
3862 | ||
3863 | case GE: | |
3864 | libfunc = gehf2_libfunc; | |
c81364d2 | 3865 | if (libfunc == NULL_RTX) |
3866 | { | |
3867 | tmp = x; x = y; y = tmp; | |
3868 | *pcomparison = LE; | |
3869 | libfunc = lehf2_libfunc; | |
3870 | } | |
9557005f | 3871 | break; |
3872 | ||
3873 | case LT: | |
3874 | libfunc = lthf2_libfunc; | |
c81364d2 | 3875 | if (libfunc == NULL_RTX) |
3876 | { | |
3877 | tmp = x; x = y; y = tmp; | |
3878 | *pcomparison = GT; | |
3879 | libfunc = gthf2_libfunc; | |
3880 | } | |
9557005f | 3881 | break; |
3882 | ||
3883 | case LE: | |
3884 | libfunc = lehf2_libfunc; | |
c81364d2 | 3885 | if (libfunc == NULL_RTX) |
3886 | { | |
3887 | tmp = x; x = y; y = tmp; | |
3888 | *pcomparison = GE; | |
3889 | libfunc = gehf2_libfunc; | |
3890 | } | |
9557005f | 3891 | break; |
c96dd0ff | 3892 | |
a4110d9a | 3893 | case UNORDERED: |
3894 | libfunc = unordhf2_libfunc; | |
3895 | break; | |
3896 | ||
c96dd0ff | 3897 | default: |
3898 | break; | |
9557005f | 3899 | } |
3900 | else if (mode == SFmode) | |
1f215c26 | 3901 | switch (comparison) |
3902 | { | |
3903 | case EQ: | |
3904 | libfunc = eqsf2_libfunc; | |
3905 | break; | |
3906 | ||
3907 | case NE: | |
3908 | libfunc = nesf2_libfunc; | |
3909 | break; | |
3910 | ||
3911 | case GT: | |
3912 | libfunc = gtsf2_libfunc; | |
c81364d2 | 3913 | if (libfunc == NULL_RTX) |
3914 | { | |
3915 | tmp = x; x = y; y = tmp; | |
3916 | *pcomparison = LT; | |
3917 | libfunc = ltsf2_libfunc; | |
3918 | } | |
1f215c26 | 3919 | break; |
3920 | ||
3921 | case GE: | |
3922 | libfunc = gesf2_libfunc; | |
c81364d2 | 3923 | if (libfunc == NULL_RTX) |
3924 | { | |
3925 | tmp = x; x = y; y = tmp; | |
3926 | *pcomparison = LE; | |
3927 | libfunc = lesf2_libfunc; | |
3928 | } | |
1f215c26 | 3929 | break; |
3930 | ||
3931 | case LT: | |
3932 | libfunc = ltsf2_libfunc; | |
c81364d2 | 3933 | if (libfunc == NULL_RTX) |
3934 | { | |
3935 | tmp = x; x = y; y = tmp; | |
3936 | *pcomparison = GT; | |
3937 | libfunc = gtsf2_libfunc; | |
3938 | } | |
1f215c26 | 3939 | break; |
3940 | ||
3941 | case LE: | |
3942 | libfunc = lesf2_libfunc; | |
c81364d2 | 3943 | if (libfunc == NULL_RTX) |
3944 | { | |
3945 | tmp = x; x = y; y = tmp; | |
3946 | *pcomparison = GE; | |
3947 | libfunc = gesf2_libfunc; | |
3948 | } | |
1f215c26 | 3949 | break; |
c96dd0ff | 3950 | |
a4110d9a | 3951 | case UNORDERED: |
3952 | libfunc = unordsf2_libfunc; | |
3953 | break; | |
3954 | ||
c96dd0ff | 3955 | default: |
3956 | break; | |
1f215c26 | 3957 | } |
3958 | else if (mode == DFmode) | |
3959 | switch (comparison) | |
3960 | { | |
3961 | case EQ: | |
3962 | libfunc = eqdf2_libfunc; | |
3963 | break; | |
3964 | ||
3965 | case NE: | |
3966 | libfunc = nedf2_libfunc; | |
3967 | break; | |
3968 | ||
3969 | case GT: | |
3970 | libfunc = gtdf2_libfunc; | |
c81364d2 | 3971 | if (libfunc == NULL_RTX) |
3972 | { | |
3973 | tmp = x; x = y; y = tmp; | |
3974 | *pcomparison = LT; | |
3975 | libfunc = ltdf2_libfunc; | |
3976 | } | |
1f215c26 | 3977 | break; |
3978 | ||
3979 | case GE: | |
3980 | libfunc = gedf2_libfunc; | |
c81364d2 | 3981 | if (libfunc == NULL_RTX) |
3982 | { | |
3983 | tmp = x; x = y; y = tmp; | |
3984 | *pcomparison = LE; | |
3985 | libfunc = ledf2_libfunc; | |
3986 | } | |
1f215c26 | 3987 | break; |
3988 | ||
3989 | case LT: | |
3990 | libfunc = ltdf2_libfunc; | |
c81364d2 | 3991 | if (libfunc == NULL_RTX) |
3992 | { | |
3993 | tmp = x; x = y; y = tmp; | |
3994 | *pcomparison = GT; | |
3995 | libfunc = gtdf2_libfunc; | |
3996 | } | |
1f215c26 | 3997 | break; |
3998 | ||
3999 | case LE: | |
4000 | libfunc = ledf2_libfunc; | |
c81364d2 | 4001 | if (libfunc == NULL_RTX) |
4002 | { | |
4003 | tmp = x; x = y; y = tmp; | |
4004 | *pcomparison = GE; | |
4005 | libfunc = gedf2_libfunc; | |
4006 | } | |
1f215c26 | 4007 | break; |
c96dd0ff | 4008 | |
a4110d9a | 4009 | case UNORDERED: |
4010 | libfunc = unorddf2_libfunc; | |
4011 | break; | |
4012 | ||
c96dd0ff | 4013 | default: |
4014 | break; | |
1f215c26 | 4015 | } |
c2a91a88 | 4016 | else if (mode == XFmode) |
4017 | switch (comparison) | |
4018 | { | |
4019 | case EQ: | |
4020 | libfunc = eqxf2_libfunc; | |
4021 | break; | |
4022 | ||
4023 | case NE: | |
4024 | libfunc = nexf2_libfunc; | |
4025 | break; | |
4026 | ||
4027 | case GT: | |
4028 | libfunc = gtxf2_libfunc; | |
c81364d2 | 4029 | if (libfunc == NULL_RTX) |
4030 | { | |
4031 | tmp = x; x = y; y = tmp; | |
4032 | *pcomparison = LT; | |
4033 | libfunc = ltxf2_libfunc; | |
4034 | } | |
c2a91a88 | 4035 | break; |
4036 | ||
4037 | case GE: | |
4038 | libfunc = gexf2_libfunc; | |
c81364d2 | 4039 | if (libfunc == NULL_RTX) |
4040 | { | |
4041 | tmp = x; x = y; y = tmp; | |
4042 | *pcomparison = LE; | |
4043 | libfunc = lexf2_libfunc; | |
4044 | } | |
c2a91a88 | 4045 | break; |
4046 | ||
4047 | case LT: | |
4048 | libfunc = ltxf2_libfunc; | |
c81364d2 | 4049 | if (libfunc == NULL_RTX) |
4050 | { | |
4051 | tmp = x; x = y; y = tmp; | |
4052 | *pcomparison = GT; | |
4053 | libfunc = gtxf2_libfunc; | |
4054 | } | |
c2a91a88 | 4055 | break; |
4056 | ||
4057 | case LE: | |
4058 | libfunc = lexf2_libfunc; | |
c81364d2 | 4059 | if (libfunc == NULL_RTX) |
4060 | { | |
4061 | tmp = x; x = y; y = tmp; | |
4062 | *pcomparison = GE; | |
4063 | libfunc = gexf2_libfunc; | |
4064 | } | |
c2a91a88 | 4065 | break; |
c96dd0ff | 4066 | |
a4110d9a | 4067 | case UNORDERED: |
4068 | libfunc = unordxf2_libfunc; | |
4069 | break; | |
4070 | ||
c96dd0ff | 4071 | default: |
4072 | break; | |
c2a91a88 | 4073 | } |
4074 | else if (mode == TFmode) | |
4075 | switch (comparison) | |
4076 | { | |
4077 | case EQ: | |
4078 | libfunc = eqtf2_libfunc; | |
4079 | break; | |
4080 | ||
4081 | case NE: | |
4082 | libfunc = netf2_libfunc; | |
4083 | break; | |
4084 | ||
4085 | case GT: | |
4086 | libfunc = gttf2_libfunc; | |
c81364d2 | 4087 | if (libfunc == NULL_RTX) |
4088 | { | |
4089 | tmp = x; x = y; y = tmp; | |
4090 | *pcomparison = LT; | |
4091 | libfunc = lttf2_libfunc; | |
4092 | } | |
c2a91a88 | 4093 | break; |
4094 | ||
4095 | case GE: | |
4096 | libfunc = getf2_libfunc; | |
c81364d2 | 4097 | if (libfunc == NULL_RTX) |
4098 | { | |
4099 | tmp = x; x = y; y = tmp; | |
4100 | *pcomparison = LE; | |
4101 | libfunc = letf2_libfunc; | |
4102 | } | |
c2a91a88 | 4103 | break; |
4104 | ||
4105 | case LT: | |
4106 | libfunc = lttf2_libfunc; | |
c81364d2 | 4107 | if (libfunc == NULL_RTX) |
4108 | { | |
4109 | tmp = x; x = y; y = tmp; | |
4110 | *pcomparison = GT; | |
4111 | libfunc = gttf2_libfunc; | |
4112 | } | |
c2a91a88 | 4113 | break; |
4114 | ||
4115 | case LE: | |
4116 | libfunc = letf2_libfunc; | |
c81364d2 | 4117 | if (libfunc == NULL_RTX) |
4118 | { | |
4119 | tmp = x; x = y; y = tmp; | |
4120 | *pcomparison = GE; | |
4121 | libfunc = getf2_libfunc; | |
4122 | } | |
c2a91a88 | 4123 | break; |
c96dd0ff | 4124 | |
a4110d9a | 4125 | case UNORDERED: |
4126 | libfunc = unordtf2_libfunc; | |
4127 | break; | |
4128 | ||
c96dd0ff | 4129 | default: |
4130 | break; | |
c2a91a88 | 4131 | } |
1f215c26 | 4132 | else |
4133 | { | |
4134 | enum machine_mode wider_mode; | |
4135 | ||
3b1a9578 | 4136 | for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode; |
1f215c26 | 4137 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) |
4138 | { | |
4139 | if ((cmp_optab->handlers[(int) wider_mode].insn_code | |
4140 | != CODE_FOR_nothing) | |
4141 | || (cmp_optab->handlers[(int) wider_mode].libfunc != 0)) | |
4142 | { | |
60b66860 | 4143 | x = protect_from_queue (x, 0); |
4144 | y = protect_from_queue (y, 0); | |
1a29b174 | 4145 | *px = convert_to_mode (wider_mode, x, 0); |
4146 | *py = convert_to_mode (wider_mode, y, 0); | |
6f71c48d | 4147 | prepare_float_lib_cmp (px, py, pcomparison, pmode, punsignedp); |
1f215c26 | 4148 | return; |
4149 | } | |
4150 | } | |
4151 | abort (); | |
4152 | } | |
4153 | ||
460f974d | 4154 | if (libfunc == 0) |
4155 | abort (); | |
4156 | ||
e7285115 | 4157 | result = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST_MAKE_BLOCK, |
4158 | word_mode, 2, x, mode, y, mode); | |
1a29b174 | 4159 | *px = result; |
4160 | *py = const0_rtx; | |
4161 | *pmode = word_mode; | |
a4110d9a | 4162 | if (comparison == UNORDERED) |
4163 | *pcomparison = NE; | |
6f71c48d | 4164 | #ifdef FLOAT_LIB_COMPARE_RETURNS_BOOL |
a4110d9a | 4165 | else if (FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison)) |
6f71c48d | 4166 | *pcomparison = NE; |
4167 | #endif | |
1a29b174 | 4168 | *punsignedp = 0; |
1f215c26 | 4169 | } |
4170 | \f | |
4171 | /* Generate code to indirectly jump to a location given in the rtx LOC. */ | |
4172 | ||
4173 | void | |
3ad4992f | 4174 | emit_indirect_jump (rtx loc) |
1f215c26 | 4175 | { |
2fd3f4b5 | 4176 | if (! ((*insn_data[(int) CODE_FOR_indirect_jump].operand[0].predicate) |
5d3cfda2 | 4177 | (loc, Pmode))) |
4178 | loc = copy_to_mode_reg (Pmode, loc); | |
1f215c26 | 4179 | |
4180 | emit_jump_insn (gen_indirect_jump (loc)); | |
5fb13e54 | 4181 | emit_barrier (); |
1f215c26 | 4182 | } |
4183 | \f | |
62528147 | 4184 | #ifdef HAVE_conditional_move |
4185 | ||
4186 | /* Emit a conditional move instruction if the machine supports one for that | |
4187 | condition and machine mode. | |
4188 | ||
4189 | OP0 and OP1 are the operands that should be compared using CODE. CMODE is | |
4190 | the mode to use should they be constants. If it is VOIDmode, they cannot | |
4191 | both be constants. | |
4192 | ||
4193 | OP2 should be stored in TARGET if the comparison is true, otherwise OP3 | |
4194 | should be stored there. MODE is the mode to use should they be constants. | |
4195 | If it is VOIDmode, they cannot both be constants. | |
4196 | ||
4197 | The result is either TARGET (perhaps modified) or NULL_RTX if the operation | |
4198 | is not supported. */ | |
4199 | ||
4200 | rtx | |
3ad4992f | 4201 | emit_conditional_move (rtx target, enum rtx_code code, rtx op0, rtx op1, |
4202 | enum machine_mode cmode, rtx op2, rtx op3, | |
4203 | enum machine_mode mode, int unsignedp) | |
62528147 | 4204 | { |
4205 | rtx tem, subtarget, comparison, insn; | |
4206 | enum insn_code icode; | |
09f800b9 | 4207 | enum rtx_code reversed; |
62528147 | 4208 | |
4209 | /* If one operand is constant, make it the second one. Only do this | |
4210 | if the other operand is not constant as well. */ | |
4211 | ||
09f800b9 | 4212 | if (swap_commutative_operands_p (op0, op1)) |
62528147 | 4213 | { |
4214 | tem = op0; | |
4215 | op0 = op1; | |
4216 | op1 = tem; | |
4217 | code = swap_condition (code); | |
4218 | } | |
4219 | ||
7014838c | 4220 | /* get_condition will prefer to generate LT and GT even if the old |
4221 | comparison was against zero, so undo that canonicalization here since | |
4222 | comparisons against zero are cheaper. */ | |
4223 | if (code == LT && GET_CODE (op1) == CONST_INT && INTVAL (op1) == 1) | |
4224 | code = LE, op1 = const0_rtx; | |
4225 | else if (code == GT && GET_CODE (op1) == CONST_INT && INTVAL (op1) == -1) | |
4226 | code = GE, op1 = const0_rtx; | |
4227 | ||
62528147 | 4228 | if (cmode == VOIDmode) |
4229 | cmode = GET_MODE (op0); | |
4230 | ||
09f800b9 | 4231 | if (swap_commutative_operands_p (op2, op3) |
4232 | && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL)) | |
4233 | != UNKNOWN)) | |
62528147 | 4234 | { |
4235 | tem = op2; | |
4236 | op2 = op3; | |
4237 | op3 = tem; | |
09f800b9 | 4238 | code = reversed; |
62528147 | 4239 | } |
4240 | ||
4241 | if (mode == VOIDmode) | |
4242 | mode = GET_MODE (op2); | |
4243 | ||
4244 | icode = movcc_gen_code[mode]; | |
4245 | ||
4246 | if (icode == CODE_FOR_nothing) | |
4247 | return 0; | |
4248 | ||
4249 | if (flag_force_mem) | |
4250 | { | |
4251 | op2 = force_not_mem (op2); | |
4252 | op3 = force_not_mem (op3); | |
4253 | } | |
4254 | ||
4255 | if (target) | |
4256 | target = protect_from_queue (target, 1); | |
4257 | else | |
4258 | target = gen_reg_rtx (mode); | |
4259 | ||
4260 | subtarget = target; | |
4261 | ||
4262 | emit_queue (); | |
4263 | ||
4264 | op2 = protect_from_queue (op2, 0); | |
4265 | op3 = protect_from_queue (op3, 0); | |
4266 | ||
4267 | /* If the insn doesn't accept these operands, put them in pseudos. */ | |
4268 | ||
6357eaae | 4269 | if (! (*insn_data[icode].operand[0].predicate) |
4270 | (subtarget, insn_data[icode].operand[0].mode)) | |
4271 | subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode); | |
62528147 | 4272 | |
6357eaae | 4273 | if (! (*insn_data[icode].operand[2].predicate) |
4274 | (op2, insn_data[icode].operand[2].mode)) | |
4275 | op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2); | |
62528147 | 4276 | |
6357eaae | 4277 | if (! (*insn_data[icode].operand[3].predicate) |
4278 | (op3, insn_data[icode].operand[3].mode)) | |
4279 | op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3); | |
62528147 | 4280 | |
4281 | /* Everything should now be in the suitable form, so emit the compare insn | |
4282 | and then the conditional move. */ | |
4283 | ||
3ad4992f | 4284 | comparison |
2b96c5f6 | 4285 | = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX); |
62528147 | 4286 | |
4287 | /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */ | |
3cc4218a | 4288 | /* We can get const0_rtx or const_true_rtx in some circumstances. Just |
4289 | return NULL and let the caller figure out how best to deal with this | |
4290 | situation. */ | |
62528147 | 4291 | if (GET_CODE (comparison) != code) |
3cc4218a | 4292 | return NULL_RTX; |
3ad4992f | 4293 | |
62528147 | 4294 | insn = GEN_FCN (icode) (subtarget, comparison, op2, op3); |
4295 | ||
4296 | /* If that failed, then give up. */ | |
4297 | if (insn == 0) | |
4298 | return 0; | |
4299 | ||
4300 | emit_insn (insn); | |
4301 | ||
4302 | if (subtarget != target) | |
4303 | convert_move (target, subtarget, 0); | |
4304 | ||
4305 | return target; | |
4306 | } | |
4307 | ||
7fd957fe | 4308 | /* Return nonzero if a conditional move of mode MODE is supported. |
62528147 | 4309 | |
4310 | This function is for combine so it can tell whether an insn that looks | |
4311 | like a conditional move is actually supported by the hardware. If we | |
4312 | guess wrong we lose a bit on optimization, but that's it. */ | |
4313 | /* ??? sparc64 supports conditionally moving integers values based on fp | |
4314 | comparisons, and vice versa. How do we handle them? */ | |
4315 | ||
4316 | int | |
3ad4992f | 4317 | can_conditionally_move_p (enum machine_mode mode) |
62528147 | 4318 | { |
4319 | if (movcc_gen_code[mode] != CODE_FOR_nothing) | |
4320 | return 1; | |
4321 | ||
4322 | return 0; | |
4323 | } | |
4324 | ||
4325 | #endif /* HAVE_conditional_move */ | |
d3da2ad8 | 4326 | |
4327 | /* Emit a conditional addition instruction if the machine supports one for that | |
4328 | condition and machine mode. | |
4329 | ||
4330 | OP0 and OP1 are the operands that should be compared using CODE. CMODE is | |
4331 | the mode to use should they be constants. If it is VOIDmode, they cannot | |
4332 | both be constants. | |
4333 | ||
4334 | OP2 should be stored in TARGET if the comparison is true, otherwise OP2+OP3 | |
4335 | should be stored there. MODE is the mode to use should they be constants. | |
4336 | If it is VOIDmode, they cannot both be constants. | |
4337 | ||
4338 | The result is either TARGET (perhaps modified) or NULL_RTX if the operation | |
4339 | is not supported. */ | |
4340 | ||
4341 | rtx | |
3ad4992f | 4342 | emit_conditional_add (rtx target, enum rtx_code code, rtx op0, rtx op1, |
4343 | enum machine_mode cmode, rtx op2, rtx op3, | |
4344 | enum machine_mode mode, int unsignedp) | |
d3da2ad8 | 4345 | { |
4346 | rtx tem, subtarget, comparison, insn; | |
4347 | enum insn_code icode; | |
4348 | enum rtx_code reversed; | |
4349 | ||
4350 | /* If one operand is constant, make it the second one. Only do this | |
4351 | if the other operand is not constant as well. */ | |
4352 | ||
4353 | if (swap_commutative_operands_p (op0, op1)) | |
4354 | { | |
4355 | tem = op0; | |
4356 | op0 = op1; | |
4357 | op1 = tem; | |
4358 | code = swap_condition (code); | |
4359 | } | |
4360 | ||
4361 | /* get_condition will prefer to generate LT and GT even if the old | |
4362 | comparison was against zero, so undo that canonicalization here since | |
4363 | comparisons against zero are cheaper. */ | |
4364 | if (code == LT && GET_CODE (op1) == CONST_INT && INTVAL (op1) == 1) | |
4365 | code = LE, op1 = const0_rtx; | |
4366 | else if (code == GT && GET_CODE (op1) == CONST_INT && INTVAL (op1) == -1) | |
4367 | code = GE, op1 = const0_rtx; | |
4368 | ||
4369 | if (cmode == VOIDmode) | |
4370 | cmode = GET_MODE (op0); | |
4371 | ||
4372 | if (swap_commutative_operands_p (op2, op3) | |
4373 | && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL)) | |
4374 | != UNKNOWN)) | |
4375 | { | |
4376 | tem = op2; | |
4377 | op2 = op3; | |
4378 | op3 = tem; | |
4379 | code = reversed; | |
4380 | } | |
4381 | ||
4382 | if (mode == VOIDmode) | |
4383 | mode = GET_MODE (op2); | |
4384 | ||
4385 | icode = addcc_optab->handlers[(int) mode].insn_code; | |
4386 | ||
4387 | if (icode == CODE_FOR_nothing) | |
4388 | return 0; | |
4389 | ||
4390 | if (flag_force_mem) | |
4391 | { | |
4392 | op2 = force_not_mem (op2); | |
4393 | op3 = force_not_mem (op3); | |
4394 | } | |
4395 | ||
4396 | if (target) | |
4397 | target = protect_from_queue (target, 1); | |
4398 | else | |
4399 | target = gen_reg_rtx (mode); | |
4400 | ||
4401 | subtarget = target; | |
4402 | ||
4403 | emit_queue (); | |
4404 | ||
4405 | op2 = protect_from_queue (op2, 0); | |
4406 | op3 = protect_from_queue (op3, 0); | |
4407 | ||
4408 | /* If the insn doesn't accept these operands, put them in pseudos. */ | |
4409 | ||
4410 | if (! (*insn_data[icode].operand[0].predicate) | |
4411 | (subtarget, insn_data[icode].operand[0].mode)) | |
4412 | subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode); | |
4413 | ||
4414 | if (! (*insn_data[icode].operand[2].predicate) | |
4415 | (op2, insn_data[icode].operand[2].mode)) | |
4416 | op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2); | |
4417 | ||
4418 | if (! (*insn_data[icode].operand[3].predicate) | |
4419 | (op3, insn_data[icode].operand[3].mode)) | |
4420 | op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3); | |
4421 | ||
4422 | /* Everything should now be in the suitable form, so emit the compare insn | |
4423 | and then the conditional move. */ | |
4424 | ||
3ad4992f | 4425 | comparison |
d3da2ad8 | 4426 | = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX); |
4427 | ||
4428 | /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */ | |
4429 | /* We can get const0_rtx or const_true_rtx in some circumstances. Just | |
4430 | return NULL and let the caller figure out how best to deal with this | |
4431 | situation. */ | |
4432 | if (GET_CODE (comparison) != code) | |
4433 | return NULL_RTX; | |
3ad4992f | 4434 | |
d3da2ad8 | 4435 | insn = GEN_FCN (icode) (subtarget, comparison, op2, op3); |
4436 | ||
4437 | /* If that failed, then give up. */ | |
4438 | if (insn == 0) | |
4439 | return 0; | |
4440 | ||
4441 | emit_insn (insn); | |
4442 | ||
4443 | if (subtarget != target) | |
4444 | convert_move (target, subtarget, 0); | |
4445 | ||
4446 | return target; | |
4447 | } | |
62528147 | 4448 | \f |
39810676 | 4449 | /* These functions attempt to generate an insn body, rather than |
4450 | emitting the insn, but if the gen function already emits them, we | |
4451 | make no attempt to turn them back into naked patterns. | |
1f215c26 | 4452 | |
4453 | They do not protect from queued increments, | |
4454 | because they may be used 1) in protect_from_queue itself | |
4455 | and 2) in other passes where there is no queue. */ | |
4456 | ||
4457 | /* Generate and return an insn body to add Y to X. */ | |
4458 | ||
4459 | rtx | |
3ad4992f | 4460 | gen_add2_insn (rtx x, rtx y) |
1f215c26 | 4461 | { |
3ad4992f | 4462 | int icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code; |
1f215c26 | 4463 | |
6357eaae | 4464 | if (! ((*insn_data[icode].operand[0].predicate) |
4465 | (x, insn_data[icode].operand[0].mode)) | |
4466 | || ! ((*insn_data[icode].operand[1].predicate) | |
4467 | (x, insn_data[icode].operand[1].mode)) | |
4468 | || ! ((*insn_data[icode].operand[2].predicate) | |
4469 | (y, insn_data[icode].operand[2].mode))) | |
1f215c26 | 4470 | abort (); |
4471 | ||
4472 | return (GEN_FCN (icode) (x, x, y)); | |
4473 | } | |
4474 | ||
d8fc4d0b | 4475 | /* Generate and return an insn body to add r1 and c, |
4476 | storing the result in r0. */ | |
4477 | rtx | |
3ad4992f | 4478 | gen_add3_insn (rtx r0, rtx r1, rtx c) |
d8fc4d0b | 4479 | { |
4480 | int icode = (int) add_optab->handlers[(int) GET_MODE (r0)].insn_code; | |
4481 | ||
2fd3f4b5 | 4482 | if (icode == CODE_FOR_nothing |
d8fc4d0b | 4483 | || ! ((*insn_data[icode].operand[0].predicate) |
4484 | (r0, insn_data[icode].operand[0].mode)) | |
4485 | || ! ((*insn_data[icode].operand[1].predicate) | |
4486 | (r1, insn_data[icode].operand[1].mode)) | |
4487 | || ! ((*insn_data[icode].operand[2].predicate) | |
4488 | (c, insn_data[icode].operand[2].mode))) | |
4489 | return NULL_RTX; | |
4490 | ||
4491 | return (GEN_FCN (icode) (r0, r1, c)); | |
4492 | } | |
4493 | ||
1f215c26 | 4494 | int |
3ad4992f | 4495 | have_add2_insn (rtx x, rtx y) |
1f215c26 | 4496 | { |
c299d9c8 | 4497 | int icode; |
4498 | ||
4499 | if (GET_MODE (x) == VOIDmode) | |
4500 | abort (); | |
4501 | ||
3ad4992f | 4502 | icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code; |
c299d9c8 | 4503 | |
4504 | if (icode == CODE_FOR_nothing) | |
4505 | return 0; | |
4506 | ||
4507 | if (! ((*insn_data[icode].operand[0].predicate) | |
4508 | (x, insn_data[icode].operand[0].mode)) | |
4509 | || ! ((*insn_data[icode].operand[1].predicate) | |
4510 | (x, insn_data[icode].operand[1].mode)) | |
4511 | || ! ((*insn_data[icode].operand[2].predicate) | |
4512 | (y, insn_data[icode].operand[2].mode))) | |
4513 | return 0; | |
4514 | ||
4515 | return 1; | |
1f215c26 | 4516 | } |
4517 | ||
4518 | /* Generate and return an insn body to subtract Y from X. */ | |
4519 | ||
4520 | rtx | |
3ad4992f | 4521 | gen_sub2_insn (rtx x, rtx y) |
1f215c26 | 4522 | { |
3ad4992f | 4523 | int icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code; |
1f215c26 | 4524 | |
6357eaae | 4525 | if (! ((*insn_data[icode].operand[0].predicate) |
4526 | (x, insn_data[icode].operand[0].mode)) | |
4527 | || ! ((*insn_data[icode].operand[1].predicate) | |
4528 | (x, insn_data[icode].operand[1].mode)) | |
4529 | || ! ((*insn_data[icode].operand[2].predicate) | |
4530 | (y, insn_data[icode].operand[2].mode))) | |
1f215c26 | 4531 | abort (); |
4532 | ||
4533 | return (GEN_FCN (icode) (x, x, y)); | |
4534 | } | |
4535 | ||
ad99e708 | 4536 | /* Generate and return an insn body to subtract r1 and c, |
4537 | storing the result in r0. */ | |
4538 | rtx | |
3ad4992f | 4539 | gen_sub3_insn (rtx r0, rtx r1, rtx c) |
ad99e708 | 4540 | { |
4541 | int icode = (int) sub_optab->handlers[(int) GET_MODE (r0)].insn_code; | |
4542 | ||
2fd3f4b5 | 4543 | if (icode == CODE_FOR_nothing |
ad99e708 | 4544 | || ! ((*insn_data[icode].operand[0].predicate) |
4545 | (r0, insn_data[icode].operand[0].mode)) | |
4546 | || ! ((*insn_data[icode].operand[1].predicate) | |
4547 | (r1, insn_data[icode].operand[1].mode)) | |
4548 | || ! ((*insn_data[icode].operand[2].predicate) | |
4549 | (c, insn_data[icode].operand[2].mode))) | |
4550 | return NULL_RTX; | |
4551 | ||
4552 | return (GEN_FCN (icode) (r0, r1, c)); | |
4553 | } | |
4554 | ||
1f215c26 | 4555 | int |
3ad4992f | 4556 | have_sub2_insn (rtx x, rtx y) |
1f215c26 | 4557 | { |
c299d9c8 | 4558 | int icode; |
4559 | ||
4560 | if (GET_MODE (x) == VOIDmode) | |
4561 | abort (); | |
4562 | ||
3ad4992f | 4563 | icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code; |
c299d9c8 | 4564 | |
4565 | if (icode == CODE_FOR_nothing) | |
4566 | return 0; | |
4567 | ||
4568 | if (! ((*insn_data[icode].operand[0].predicate) | |
4569 | (x, insn_data[icode].operand[0].mode)) | |
4570 | || ! ((*insn_data[icode].operand[1].predicate) | |
4571 | (x, insn_data[icode].operand[1].mode)) | |
4572 | || ! ((*insn_data[icode].operand[2].predicate) | |
4573 | (y, insn_data[icode].operand[2].mode))) | |
4574 | return 0; | |
4575 | ||
4576 | return 1; | |
1f215c26 | 4577 | } |
4578 | ||
a4463e50 | 4579 | /* Generate the body of an instruction to copy Y into X. |
31d3e01c | 4580 | It may be a list of insns, if one insn isn't enough. */ |
1f215c26 | 4581 | |
4582 | rtx | |
3ad4992f | 4583 | gen_move_insn (rtx x, rtx y) |
1f215c26 | 4584 | { |
a4463e50 | 4585 | rtx seq; |
1f215c26 | 4586 | |
a4463e50 | 4587 | start_sequence (); |
4588 | emit_move_insn_1 (x, y); | |
31d3e01c | 4589 | seq = get_insns (); |
a4463e50 | 4590 | end_sequence (); |
4591 | return seq; | |
1f215c26 | 4592 | } |
4593 | \f | |
3b1a9578 | 4594 | /* Return the insn code used to extend FROM_MODE to TO_MODE. |
4595 | UNSIGNEDP specifies zero-extension instead of sign-extension. If | |
4596 | no such operation exists, CODE_FOR_nothing will be returned. */ | |
1f215c26 | 4597 | |
3b1a9578 | 4598 | enum insn_code |
3ad4992f | 4599 | can_extend_p (enum machine_mode to_mode, enum machine_mode from_mode, |
4600 | int unsignedp) | |
1f215c26 | 4601 | { |
3cc092f7 | 4602 | #ifdef HAVE_ptr_extend |
4603 | if (unsignedp < 0) | |
4604 | return CODE_FOR_ptr_extend; | |
4605 | else | |
4606 | #endif | |
4607 | return extendtab[(int) to_mode][(int) from_mode][unsignedp != 0]; | |
1f215c26 | 4608 | } |
4609 | ||
4610 | /* Generate the body of an insn to extend Y (with mode MFROM) | |
4611 | into X (with mode MTO). Do zero-extension if UNSIGNEDP is nonzero. */ | |
4612 | ||
4613 | rtx | |
3ad4992f | 4614 | gen_extend_insn (rtx x, rtx y, enum machine_mode mto, |
4615 | enum machine_mode mfrom, int unsignedp) | |
1f215c26 | 4616 | { |
efe91848 | 4617 | return (GEN_FCN (extendtab[(int) mto][(int) mfrom][unsignedp != 0]) (x, y)); |
1f215c26 | 4618 | } |
1f215c26 | 4619 | \f |
4620 | /* can_fix_p and can_float_p say whether the target machine | |
4621 | can directly convert a given fixed point type to | |
4622 | a given floating point type, or vice versa. | |
4623 | The returned value is the CODE_FOR_... value to use, | |
2850b1f2 | 4624 | or CODE_FOR_nothing if these modes cannot be directly converted. |
1f215c26 | 4625 | |
2850b1f2 | 4626 | *TRUNCP_PTR is set to 1 if it is necessary to output |
1f215c26 | 4627 | an explicit FTRUNC insn before the fix insn; otherwise 0. */ |
4628 | ||
4629 | static enum insn_code | |
3ad4992f | 4630 | can_fix_p (enum machine_mode fixmode, enum machine_mode fltmode, |
4631 | int unsignedp, int *truncp_ptr) | |
1f215c26 | 4632 | { |
4633 | *truncp_ptr = 0; | |
efe91848 | 4634 | if (fixtrunctab[(int) fltmode][(int) fixmode][unsignedp != 0] |
4635 | != CODE_FOR_nothing) | |
4636 | return fixtrunctab[(int) fltmode][(int) fixmode][unsignedp != 0]; | |
1f215c26 | 4637 | |
4638 | if (ftrunc_optab->handlers[(int) fltmode].insn_code != CODE_FOR_nothing) | |
4639 | { | |
4640 | *truncp_ptr = 1; | |
efe91848 | 4641 | return fixtab[(int) fltmode][(int) fixmode][unsignedp != 0]; |
1f215c26 | 4642 | } |
4643 | return CODE_FOR_nothing; | |
4644 | } | |
4645 | ||
4646 | static enum insn_code | |
3ad4992f | 4647 | can_float_p (enum machine_mode fltmode, enum machine_mode fixmode, |
4648 | int unsignedp) | |
1f215c26 | 4649 | { |
efe91848 | 4650 | return floattab[(int) fltmode][(int) fixmode][unsignedp != 0]; |
1f215c26 | 4651 | } |
1f215c26 | 4652 | \f |
4653 | /* Generate code to convert FROM to floating point | |
3b1a9578 | 4654 | and store in TO. FROM must be fixed point and not VOIDmode. |
1f215c26 | 4655 | UNSIGNEDP nonzero means regard FROM as unsigned. |
4656 | Normally this is done by correcting the final value | |
4657 | if it is negative. */ | |
4658 | ||
4659 | void | |
3ad4992f | 4660 | expand_float (rtx to, rtx from, int unsignedp) |
1f215c26 | 4661 | { |
4662 | enum insn_code icode; | |
19cb6b50 | 4663 | rtx target = to; |
1f215c26 | 4664 | enum machine_mode fmode, imode; |
4665 | ||
3b1a9578 | 4666 | /* Crash now, because we won't be able to decide which mode to use. */ |
4667 | if (GET_MODE (from) == VOIDmode) | |
4668 | abort (); | |
4669 | ||
1f215c26 | 4670 | /* Look for an insn to do the conversion. Do it in the specified |
4671 | modes if possible; otherwise convert either input, output or both to | |
4672 | wider mode. If the integer mode is wider than the mode of FROM, | |
4673 | we can do the conversion signed even if the input is unsigned. */ | |
4674 | ||
344f3f9e | 4675 | for (fmode = GET_MODE (to); fmode != VOIDmode; |
4676 | fmode = GET_MODE_WIDER_MODE (fmode)) | |
4677 | for (imode = GET_MODE (from); imode != VOIDmode; | |
4678 | imode = GET_MODE_WIDER_MODE (imode)) | |
1f215c26 | 4679 | { |
4680 | int doing_unsigned = unsignedp; | |
4681 | ||
ee90778f | 4682 | if (fmode != GET_MODE (to) |
4683 | && significand_size (fmode) < GET_MODE_BITSIZE (GET_MODE (from))) | |
4684 | continue; | |
4685 | ||
1f215c26 | 4686 | icode = can_float_p (fmode, imode, unsignedp); |
4687 | if (icode == CODE_FOR_nothing && imode != GET_MODE (from) && unsignedp) | |
4688 | icode = can_float_p (fmode, imode, 0), doing_unsigned = 0; | |
4689 | ||
4690 | if (icode != CODE_FOR_nothing) | |
4691 | { | |
4692 | to = protect_from_queue (to, 1); | |
60b66860 | 4693 | from = protect_from_queue (from, 0); |
1f215c26 | 4694 | |
4695 | if (imode != GET_MODE (from)) | |
4696 | from = convert_to_mode (imode, from, unsignedp); | |
1f215c26 | 4697 | |
4698 | if (fmode != GET_MODE (to)) | |
4699 | target = gen_reg_rtx (fmode); | |
4700 | ||
4701 | emit_unop_insn (icode, target, from, | |
4702 | doing_unsigned ? UNSIGNED_FLOAT : FLOAT); | |
4703 | ||
4704 | if (target != to) | |
4705 | convert_move (to, target, 0); | |
4706 | return; | |
4707 | } | |
2fd3f4b5 | 4708 | } |
1f215c26 | 4709 | |
1f215c26 | 4710 | /* Unsigned integer, and no way to convert directly. |
4711 | Convert as signed, then conditionally adjust the result. */ | |
4712 | if (unsignedp) | |
4713 | { | |
4714 | rtx label = gen_label_rtx (); | |
4715 | rtx temp; | |
4716 | REAL_VALUE_TYPE offset; | |
4717 | ||
4718 | emit_queue (); | |
4719 | ||
4720 | to = protect_from_queue (to, 1); | |
4721 | from = protect_from_queue (from, 0); | |
4722 | ||
4723 | if (flag_force_mem) | |
4724 | from = force_not_mem (from); | |
4725 | ||
8142649d | 4726 | /* Look for a usable floating mode FMODE wider than the source and at |
4727 | least as wide as the target. Using FMODE will avoid rounding woes | |
4728 | with unsigned values greater than the signed maximum value. */ | |
caf74f46 | 4729 | |
8142649d | 4730 | for (fmode = GET_MODE (to); fmode != VOIDmode; |
4731 | fmode = GET_MODE_WIDER_MODE (fmode)) | |
4732 | if (GET_MODE_BITSIZE (GET_MODE (from)) < GET_MODE_BITSIZE (fmode) | |
4733 | && can_float_p (fmode, GET_MODE (from), 0) != CODE_FOR_nothing) | |
4734 | break; | |
144a41c2 | 4735 | |
8142649d | 4736 | if (fmode == VOIDmode) |
4737 | { | |
144a41c2 | 4738 | /* There is no such mode. Pretend the target is wide enough. */ |
8142649d | 4739 | fmode = GET_MODE (to); |
144a41c2 | 4740 | |
a92771b8 | 4741 | /* Avoid double-rounding when TO is narrower than FROM. */ |
144a41c2 | 4742 | if ((significand_size (fmode) + 1) |
4743 | < GET_MODE_BITSIZE (GET_MODE (from))) | |
4744 | { | |
4745 | rtx temp1; | |
4746 | rtx neglabel = gen_label_rtx (); | |
4747 | ||
3ad4992f | 4748 | /* Don't use TARGET if it isn't a register, is a hard register, |
caf74f46 | 4749 | or is the wrong mode. */ |
1d88d298 | 4750 | if (GET_CODE (target) != REG |
caf74f46 | 4751 | || REGNO (target) < FIRST_PSEUDO_REGISTER |
4752 | || GET_MODE (target) != fmode) | |
1d88d298 | 4753 | target = gen_reg_rtx (fmode); |
4754 | ||
144a41c2 | 4755 | imode = GET_MODE (from); |
4756 | do_pending_stack_adjust (); | |
4757 | ||
4758 | /* Test whether the sign bit is set. */ | |
10ee3e0f | 4759 | emit_cmp_and_jump_insns (from, const0_rtx, LT, NULL_RTX, imode, |
2b96c5f6 | 4760 | 0, neglabel); |
144a41c2 | 4761 | |
4762 | /* The sign bit is not set. Convert as signed. */ | |
4763 | expand_float (target, from, 0); | |
4764 | emit_jump_insn (gen_jump (label)); | |
3cdb147b | 4765 | emit_barrier (); |
144a41c2 | 4766 | |
4767 | /* The sign bit is set. | |
4768 | Convert to a usable (positive signed) value by shifting right | |
4769 | one bit, while remembering if a nonzero bit was shifted | |
4770 | out; i.e., compute (from & 1) | (from >> 1). */ | |
4771 | ||
4772 | emit_label (neglabel); | |
4773 | temp = expand_binop (imode, and_optab, from, const1_rtx, | |
caf74f46 | 4774 | NULL_RTX, 1, OPTAB_LIB_WIDEN); |
b2bc10f7 | 4775 | temp1 = expand_shift (RSHIFT_EXPR, imode, from, integer_one_node, |
4776 | NULL_RTX, 1); | |
3ad4992f | 4777 | temp = expand_binop (imode, ior_optab, temp, temp1, temp, 1, |
caf74f46 | 4778 | OPTAB_LIB_WIDEN); |
144a41c2 | 4779 | expand_float (target, temp, 0); |
4780 | ||
4781 | /* Multiply by 2 to undo the shift above. */ | |
98a10a19 | 4782 | temp = expand_binop (fmode, add_optab, target, target, |
2fd3f4b5 | 4783 | target, 0, OPTAB_LIB_WIDEN); |
98a10a19 | 4784 | if (temp != target) |
4785 | emit_move_insn (target, temp); | |
4786 | ||
144a41c2 | 4787 | do_pending_stack_adjust (); |
4788 | emit_label (label); | |
4789 | goto done; | |
4790 | } | |
8142649d | 4791 | } |
4792 | ||
1f215c26 | 4793 | /* If we are about to do some arithmetic to correct for an |
4794 | unsigned operand, do it in a pseudo-register. */ | |
4795 | ||
8142649d | 4796 | if (GET_MODE (to) != fmode |
caf74f46 | 4797 | || GET_CODE (to) != REG || REGNO (to) < FIRST_PSEUDO_REGISTER) |
8142649d | 4798 | target = gen_reg_rtx (fmode); |
1f215c26 | 4799 | |
4800 | /* Convert as signed integer to floating. */ | |
4801 | expand_float (target, from, 0); | |
4802 | ||
4803 | /* If FROM is negative (and therefore TO is negative), | |
4804 | correct its value by 2**bitwidth. */ | |
4805 | ||
4806 | do_pending_stack_adjust (); | |
5a894bc6 | 4807 | emit_cmp_and_jump_insns (from, const0_rtx, GE, NULL_RTX, GET_MODE (from), |
2b96c5f6 | 4808 | 0, label); |
caf74f46 | 4809 | |
3ad4992f | 4810 | |
aa870c1b | 4811 | real_2expN (&offset, GET_MODE_BITSIZE (GET_MODE (from))); |
8142649d | 4812 | temp = expand_binop (fmode, add_optab, target, |
7af35cec | 4813 | CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode), |
1f215c26 | 4814 | target, 0, OPTAB_LIB_WIDEN); |
4815 | if (temp != target) | |
4816 | emit_move_insn (target, temp); | |
144a41c2 | 4817 | |
1f215c26 | 4818 | do_pending_stack_adjust (); |
4819 | emit_label (label); | |
caf74f46 | 4820 | goto done; |
1f215c26 | 4821 | } |
1f215c26 | 4822 | |
e7121682 | 4823 | /* No hardware instruction available; call a library routine to convert from |
c2a91a88 | 4824 | SImode, DImode, or TImode into SFmode, DFmode, XFmode, or TFmode. */ |
1f215c26 | 4825 | { |
2cfa48a6 | 4826 | rtx libfcn; |
1f215c26 | 4827 | rtx insns; |
bc4abce8 | 4828 | rtx value; |
1f215c26 | 4829 | |
4830 | to = protect_from_queue (to, 1); | |
60b66860 | 4831 | from = protect_from_queue (from, 0); |
1f215c26 | 4832 | |
4833 | if (GET_MODE_SIZE (GET_MODE (from)) < GET_MODE_SIZE (SImode)) | |
4834 | from = convert_to_mode (SImode, from, unsignedp); | |
1f215c26 | 4835 | |
4836 | if (flag_force_mem) | |
4837 | from = force_not_mem (from); | |
4838 | ||
4839 | if (GET_MODE (to) == SFmode) | |
4840 | { | |
4841 | if (GET_MODE (from) == SImode) | |
2cfa48a6 | 4842 | libfcn = floatsisf_libfunc; |
1f215c26 | 4843 | else if (GET_MODE (from) == DImode) |
2cfa48a6 | 4844 | libfcn = floatdisf_libfunc; |
c2a91a88 | 4845 | else if (GET_MODE (from) == TImode) |
4846 | libfcn = floattisf_libfunc; | |
1f215c26 | 4847 | else |
4848 | abort (); | |
4849 | } | |
4850 | else if (GET_MODE (to) == DFmode) | |
4851 | { | |
4852 | if (GET_MODE (from) == SImode) | |
2cfa48a6 | 4853 | libfcn = floatsidf_libfunc; |
1f215c26 | 4854 | else if (GET_MODE (from) == DImode) |
2cfa48a6 | 4855 | libfcn = floatdidf_libfunc; |
c2a91a88 | 4856 | else if (GET_MODE (from) == TImode) |
4857 | libfcn = floattidf_libfunc; | |
4858 | else | |
4859 | abort (); | |
4860 | } | |
4861 | else if (GET_MODE (to) == XFmode) | |
4862 | { | |
4863 | if (GET_MODE (from) == SImode) | |
4864 | libfcn = floatsixf_libfunc; | |
4865 | else if (GET_MODE (from) == DImode) | |
4866 | libfcn = floatdixf_libfunc; | |
4867 | else if (GET_MODE (from) == TImode) | |
4868 | libfcn = floattixf_libfunc; | |
4869 | else | |
4870 | abort (); | |
4871 | } | |
4872 | else if (GET_MODE (to) == TFmode) | |
4873 | { | |
4874 | if (GET_MODE (from) == SImode) | |
4875 | libfcn = floatsitf_libfunc; | |
4876 | else if (GET_MODE (from) == DImode) | |
4877 | libfcn = floatditf_libfunc; | |
4878 | else if (GET_MODE (from) == TImode) | |
4879 | libfcn = floattitf_libfunc; | |
1f215c26 | 4880 | else |
4881 | abort (); | |
4882 | } | |
4883 | else | |
4884 | abort (); | |
4885 | ||
4886 | start_sequence (); | |
4887 | ||
2c5d421b | 4888 | value = emit_library_call_value (libfcn, NULL_RTX, LCT_CONST, |
4889 | GET_MODE (to), 1, from, | |
4890 | GET_MODE (from)); | |
1f215c26 | 4891 | insns = get_insns (); |
4892 | end_sequence (); | |
4893 | ||
bc4abce8 | 4894 | emit_libcall_block (insns, target, value, |
e02c6d1f | 4895 | gen_rtx_FLOAT (GET_MODE (to), from)); |
1f215c26 | 4896 | } |
4897 | ||
144a41c2 | 4898 | done: |
4899 | ||
1f215c26 | 4900 | /* Copy result to requested destination |
4901 | if we have been computing in a temp location. */ | |
4902 | ||
4903 | if (target != to) | |
4904 | { | |
4905 | if (GET_MODE (target) == GET_MODE (to)) | |
4906 | emit_move_insn (to, target); | |
4907 | else | |
4908 | convert_move (to, target, 0); | |
4909 | } | |
4910 | } | |
4911 | \f | |
4912 | /* expand_fix: generate code to convert FROM to fixed point | |
4913 | and store in TO. FROM must be floating point. */ | |
4914 | ||
4915 | static rtx | |
3ad4992f | 4916 | ftruncify (rtx x) |
1f215c26 | 4917 | { |
4918 | rtx temp = gen_reg_rtx (GET_MODE (x)); | |
4919 | return expand_unop (GET_MODE (x), ftrunc_optab, x, temp, 0); | |
4920 | } | |
4921 | ||
4922 | void | |
3ad4992f | 4923 | expand_fix (rtx to, rtx from, int unsignedp) |
1f215c26 | 4924 | { |
4925 | enum insn_code icode; | |
19cb6b50 | 4926 | rtx target = to; |
1f215c26 | 4927 | enum machine_mode fmode, imode; |
4928 | int must_trunc = 0; | |
2cfa48a6 | 4929 | rtx libfcn = 0; |
1f215c26 | 4930 | |
4931 | /* We first try to find a pair of modes, one real and one integer, at | |
4932 | least as wide as FROM and TO, respectively, in which we can open-code | |
4933 | this conversion. If the integer mode is wider than the mode of TO, | |
4934 | we can do the conversion either signed or unsigned. */ | |
4935 | ||
98431bf3 | 4936 | for (fmode = GET_MODE (from); fmode != VOIDmode; |
4937 | fmode = GET_MODE_WIDER_MODE (fmode)) | |
4938 | for (imode = GET_MODE (to); imode != VOIDmode; | |
4939 | imode = GET_MODE_WIDER_MODE (imode)) | |
1f215c26 | 4940 | { |
4941 | int doing_unsigned = unsignedp; | |
4942 | ||
4943 | icode = can_fix_p (imode, fmode, unsignedp, &must_trunc); | |
4944 | if (icode == CODE_FOR_nothing && imode != GET_MODE (to) && unsignedp) | |
4945 | icode = can_fix_p (imode, fmode, 0, &must_trunc), doing_unsigned = 0; | |
4946 | ||
4947 | if (icode != CODE_FOR_nothing) | |
4948 | { | |
4949 | to = protect_from_queue (to, 1); | |
60b66860 | 4950 | from = protect_from_queue (from, 0); |
1f215c26 | 4951 | |
4952 | if (fmode != GET_MODE (from)) | |
4953 | from = convert_to_mode (fmode, from, 0); | |
1f215c26 | 4954 | |
4955 | if (must_trunc) | |
4956 | from = ftruncify (from); | |
4957 | ||
4958 | if (imode != GET_MODE (to)) | |
4959 | target = gen_reg_rtx (imode); | |
4960 | ||
4961 | emit_unop_insn (icode, target, from, | |
4962 | doing_unsigned ? UNSIGNED_FIX : FIX); | |
4963 | if (target != to) | |
4964 | convert_move (to, target, unsignedp); | |
4965 | return; | |
4966 | } | |
4967 | } | |
4968 | ||
1f215c26 | 4969 | /* For an unsigned conversion, there is one more way to do it. |
4970 | If we have a signed conversion, we generate code that compares | |
4971 | the real value to the largest representable positive number. If if | |
4972 | is smaller, the conversion is done normally. Otherwise, subtract | |
4973 | one plus the highest signed number, convert, and add it back. | |
4974 | ||
4975 | We only need to check all real modes, since we know we didn't find | |
3ad4992f | 4976 | anything with a wider integer mode. |
376c21d1 | 4977 | |
4978 | This code used to extend FP value into mode wider than the destination. | |
4979 | This is not needed. Consider, for instance conversion from SFmode | |
4980 | into DImode. | |
4981 | ||
4982 | The hot path trought the code is dealing with inputs smaller than 2^63 | |
4983 | and doing just the conversion, so there is no bits to lose. | |
4984 | ||
4985 | In the other path we know the value is positive in the range 2^63..2^64-1 | |
4986 | inclusive. (as for other imput overflow happens and result is undefined) | |
d01481af | 4987 | So we know that the most important bit set in mantissa corresponds to |
376c21d1 | 4988 | 2^63. The subtraction of 2^63 should not generate any rounding as it |
4989 | simply clears out that bit. The rest is trivial. */ | |
1f215c26 | 4990 | |
50b0c9ee | 4991 | if (unsignedp && GET_MODE_BITSIZE (GET_MODE (to)) <= HOST_BITS_PER_WIDE_INT) |
1f215c26 | 4992 | for (fmode = GET_MODE (from); fmode != VOIDmode; |
4993 | fmode = GET_MODE_WIDER_MODE (fmode)) | |
376c21d1 | 4994 | if (CODE_FOR_nothing != can_fix_p (GET_MODE (to), fmode, 0, |
4995 | &must_trunc)) | |
1f215c26 | 4996 | { |
d90797a0 | 4997 | int bitsize; |
4998 | REAL_VALUE_TYPE offset; | |
4999 | rtx limit, lab1, lab2, insn; | |
5000 | ||
5001 | bitsize = GET_MODE_BITSIZE (GET_MODE (to)); | |
aa870c1b | 5002 | real_2expN (&offset, bitsize - 1); |
7af35cec | 5003 | limit = CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode); |
d90797a0 | 5004 | lab1 = gen_label_rtx (); |
5005 | lab2 = gen_label_rtx (); | |
1f215c26 | 5006 | |
5007 | emit_queue (); | |
5008 | to = protect_from_queue (to, 1); | |
5009 | from = protect_from_queue (from, 0); | |
5010 | ||
5011 | if (flag_force_mem) | |
5012 | from = force_not_mem (from); | |
5013 | ||
5014 | if (fmode != GET_MODE (from)) | |
5015 | from = convert_to_mode (fmode, from, 0); | |
5016 | ||
5017 | /* See if we need to do the subtraction. */ | |
5018 | do_pending_stack_adjust (); | |
5a894bc6 | 5019 | emit_cmp_and_jump_insns (from, limit, GE, NULL_RTX, GET_MODE (from), |
2b96c5f6 | 5020 | 0, lab1); |
1f215c26 | 5021 | |
5022 | /* If not, do the signed "fix" and branch around fixup code. */ | |
5023 | expand_fix (to, from, 0); | |
5024 | emit_jump_insn (gen_jump (lab2)); | |
5025 | emit_barrier (); | |
5026 | ||
5027 | /* Otherwise, subtract 2**(N-1), convert to signed number, | |
5028 | then add 2**(N-1). Do the addition using XOR since this | |
5029 | will often generate better code. */ | |
5030 | emit_label (lab1); | |
5031 | target = expand_binop (GET_MODE (from), sub_optab, from, limit, | |
50b0c9ee | 5032 | NULL_RTX, 0, OPTAB_LIB_WIDEN); |
1f215c26 | 5033 | expand_fix (to, target, 0); |
5034 | target = expand_binop (GET_MODE (to), xor_optab, to, | |
2d232d05 | 5035 | gen_int_mode |
5036 | ((HOST_WIDE_INT) 1 << (bitsize - 1), | |
5037 | GET_MODE (to)), | |
1f215c26 | 5038 | to, 1, OPTAB_LIB_WIDEN); |
5039 | ||
5040 | if (target != to) | |
5041 | emit_move_insn (to, target); | |
5042 | ||
5043 | emit_label (lab2); | |
5044 | ||
3c96cf42 | 5045 | if (mov_optab->handlers[(int) GET_MODE (to)].insn_code |
5046 | != CODE_FOR_nothing) | |
5047 | { | |
5048 | /* Make a place for a REG_NOTE and add it. */ | |
5049 | insn = emit_move_insn (to, to); | |
e29342dc | 5050 | set_unique_reg_note (insn, |
5051 | REG_EQUAL, | |
5052 | gen_rtx_fmt_e (UNSIGNED_FIX, | |
5053 | GET_MODE (to), | |
5054 | copy_rtx (from))); | |
3c96cf42 | 5055 | } |
7014838c | 5056 | |
1f215c26 | 5057 | return; |
5058 | } | |
1f215c26 | 5059 | |
5060 | /* We can't do it with an insn, so use a library call. But first ensure | |
5061 | that the mode of TO is at least as wide as SImode, since those are the | |
5062 | only library calls we know about. */ | |
5063 | ||
5064 | if (GET_MODE_SIZE (GET_MODE (to)) < GET_MODE_SIZE (SImode)) | |
5065 | { | |
5066 | target = gen_reg_rtx (SImode); | |
5067 | ||
5068 | expand_fix (target, from, unsignedp); | |
5069 | } | |
5070 | else if (GET_MODE (from) == SFmode) | |
5071 | { | |
5072 | if (GET_MODE (to) == SImode) | |
2cfa48a6 | 5073 | libfcn = unsignedp ? fixunssfsi_libfunc : fixsfsi_libfunc; |
1f215c26 | 5074 | else if (GET_MODE (to) == DImode) |
2cfa48a6 | 5075 | libfcn = unsignedp ? fixunssfdi_libfunc : fixsfdi_libfunc; |
c2a91a88 | 5076 | else if (GET_MODE (to) == TImode) |
5077 | libfcn = unsignedp ? fixunssfti_libfunc : fixsfti_libfunc; | |
1f215c26 | 5078 | else |
5079 | abort (); | |
5080 | } | |
5081 | else if (GET_MODE (from) == DFmode) | |
5082 | { | |
5083 | if (GET_MODE (to) == SImode) | |
2cfa48a6 | 5084 | libfcn = unsignedp ? fixunsdfsi_libfunc : fixdfsi_libfunc; |
1f215c26 | 5085 | else if (GET_MODE (to) == DImode) |
2cfa48a6 | 5086 | libfcn = unsignedp ? fixunsdfdi_libfunc : fixdfdi_libfunc; |
c2a91a88 | 5087 | else if (GET_MODE (to) == TImode) |
5088 | libfcn = unsignedp ? fixunsdfti_libfunc : fixdfti_libfunc; | |
5089 | else | |
5090 | abort (); | |
5091 | } | |
5092 | else if (GET_MODE (from) == XFmode) | |
5093 | { | |
5094 | if (GET_MODE (to) == SImode) | |
5095 | libfcn = unsignedp ? fixunsxfsi_libfunc : fixxfsi_libfunc; | |
5096 | else if (GET_MODE (to) == DImode) | |
5097 | libfcn = unsignedp ? fixunsxfdi_libfunc : fixxfdi_libfunc; | |
5098 | else if (GET_MODE (to) == TImode) | |
5099 | libfcn = unsignedp ? fixunsxfti_libfunc : fixxfti_libfunc; | |
5100 | else | |
5101 | abort (); | |
5102 | } | |
5103 | else if (GET_MODE (from) == TFmode) | |
5104 | { | |
5105 | if (GET_MODE (to) == SImode) | |
5106 | libfcn = unsignedp ? fixunstfsi_libfunc : fixtfsi_libfunc; | |
5107 | else if (GET_MODE (to) == DImode) | |
5108 | libfcn = unsignedp ? fixunstfdi_libfunc : fixtfdi_libfunc; | |
5109 | else if (GET_MODE (to) == TImode) | |
5110 | libfcn = unsignedp ? fixunstfti_libfunc : fixtfti_libfunc; | |
1f215c26 | 5111 | else |
5112 | abort (); | |
5113 | } | |
5114 | else | |
5115 | abort (); | |
5116 | ||
2cfa48a6 | 5117 | if (libfcn) |
1f215c26 | 5118 | { |
5119 | rtx insns; | |
e7121682 | 5120 | rtx value; |
1f215c26 | 5121 | |
5122 | to = protect_from_queue (to, 1); | |
5123 | from = protect_from_queue (from, 0); | |
5124 | ||
5125 | if (flag_force_mem) | |
5126 | from = force_not_mem (from); | |
5127 | ||
5128 | start_sequence (); | |
5129 | ||
2c5d421b | 5130 | value = emit_library_call_value (libfcn, NULL_RTX, LCT_CONST, |
5131 | GET_MODE (to), 1, from, | |
5132 | GET_MODE (from)); | |
1f215c26 | 5133 | insns = get_insns (); |
5134 | end_sequence (); | |
5135 | ||
e7121682 | 5136 | emit_libcall_block (insns, target, value, |
e02c6d1f | 5137 | gen_rtx_fmt_e (unsignedp ? UNSIGNED_FIX : FIX, |
5138 | GET_MODE (to), from)); | |
1f215c26 | 5139 | } |
3ad4992f | 5140 | |
db60fef7 | 5141 | if (target != to) |
5142 | { | |
5143 | if (GET_MODE (to) == GET_MODE (target)) | |
5144 | emit_move_insn (to, target); | |
5145 | else | |
5146 | convert_move (to, target, 0); | |
5147 | } | |
1f215c26 | 5148 | } |
5149 | \f | |
ad99e708 | 5150 | /* Report whether we have an instruction to perform the operation |
5151 | specified by CODE on operands of mode MODE. */ | |
5152 | int | |
3ad4992f | 5153 | have_insn_for (enum rtx_code code, enum machine_mode mode) |
ad99e708 | 5154 | { |
5155 | return (code_to_optab[(int) code] != 0 | |
5156 | && (code_to_optab[(int) code]->handlers[(int) mode].insn_code | |
5157 | != CODE_FOR_nothing)); | |
5158 | } | |
5159 | ||
5160 | /* Create a blank optab. */ | |
5161 | static optab | |
3ad4992f | 5162 | new_optab (void) |
1f215c26 | 5163 | { |
5164 | int i; | |
1f3233d1 | 5165 | optab op = (optab) ggc_alloc (sizeof (struct optab)); |
1f215c26 | 5166 | for (i = 0; i < NUM_MACHINE_MODES; i++) |
5167 | { | |
5168 | op->handlers[i].insn_code = CODE_FOR_nothing; | |
5169 | op->handlers[i].libfunc = 0; | |
5170 | } | |
94a588c3 | 5171 | |
ad99e708 | 5172 | return op; |
5173 | } | |
94a588c3 | 5174 | |
ad99e708 | 5175 | /* Same, but fill in its code as CODE, and write it into the |
5176 | code_to_optab table. */ | |
5177 | static inline optab | |
3ad4992f | 5178 | init_optab (enum rtx_code code) |
ad99e708 | 5179 | { |
5180 | optab op = new_optab (); | |
5181 | op->code = code; | |
5182 | code_to_optab[(int) code] = op; | |
5183 | return op; | |
5184 | } | |
5185 | ||
5186 | /* Same, but fill in its code as CODE, and do _not_ write it into | |
5187 | the code_to_optab table. */ | |
5188 | static inline optab | |
3ad4992f | 5189 | init_optabv (enum rtx_code code) |
ad99e708 | 5190 | { |
5191 | optab op = new_optab (); | |
5192 | op->code = code; | |
1f215c26 | 5193 | return op; |
5194 | } | |
5195 | ||
c2a91a88 | 5196 | /* Initialize the libfunc fields of an entire group of entries in some |
5197 | optab. Each entry is set equal to a string consisting of a leading | |
5198 | pair of underscores followed by a generic operation name followed by | |
5199 | a mode name (downshifted to lower case) followed by a single character | |
5200 | representing the number of operands for the given operation (which is | |
5201 | usually one of the characters '2', '3', or '4'). | |
5202 | ||
5203 | OPTABLE is the table in which libfunc fields are to be initialized. | |
5204 | FIRST_MODE is the first machine mode index in the given optab to | |
5205 | initialize. | |
5206 | LAST_MODE is the last machine mode index in the given optab to | |
5207 | initialize. | |
5208 | OPNAME is the generic (string) name of the operation. | |
5209 | SUFFIX is the character which specifies the number of operands for | |
5210 | the given generic operation. | |
5211 | */ | |
5212 | ||
5213 | static void | |
3ad4992f | 5214 | init_libfuncs (optab optable, int first_mode, int last_mode, |
5215 | const char *opname, int suffix) | |
c2a91a88 | 5216 | { |
19cb6b50 | 5217 | int mode; |
5218 | unsigned opname_len = strlen (opname); | |
c2a91a88 | 5219 | |
6051e5e0 | 5220 | for (mode = first_mode; (int) mode <= (int) last_mode; |
5221 | mode = (enum machine_mode) ((int) mode + 1)) | |
c2a91a88 | 5222 | { |
2fd3f4b5 | 5223 | const char *mname = GET_MODE_NAME (mode); |
19cb6b50 | 5224 | unsigned mname_len = strlen (mname); |
5225 | char *libfunc_name = alloca (2 + opname_len + mname_len + 1 + 1); | |
5226 | char *p; | |
5227 | const char *q; | |
c2a91a88 | 5228 | |
5229 | p = libfunc_name; | |
5230 | *p++ = '_'; | |
5231 | *p++ = '_'; | |
5232 | for (q = opname; *q; ) | |
5233 | *p++ = *q++; | |
5234 | for (q = mname; *q; q++) | |
fa8da10b | 5235 | *p++ = TOLOWER (*q); |
c2a91a88 | 5236 | *p++ = suffix; |
44acf429 | 5237 | *p = '\0'; |
2c8daaf1 | 5238 | |
c2a91a88 | 5239 | optable->handlers[(int) mode].libfunc |
62f615b1 | 5240 | = init_one_libfunc (ggc_alloc_string (libfunc_name, p - libfunc_name)); |
c2a91a88 | 5241 | } |
5242 | } | |
5243 | ||
5244 | /* Initialize the libfunc fields of an entire group of entries in some | |
5245 | optab which correspond to all integer mode operations. The parameters | |
5246 | have the same meaning as similarly named ones for the `init_libfuncs' | |
5247 | routine. (See above). */ | |
5248 | ||
5249 | static void | |
3ad4992f | 5250 | init_integral_libfuncs (optab optable, const char *opname, int suffix) |
c2a91a88 | 5251 | { |
7f6007b4 | 5252 | int maxsize = 2*BITS_PER_WORD; |
5253 | if (maxsize < LONG_LONG_TYPE_SIZE) | |
5254 | maxsize = LONG_LONG_TYPE_SIZE; | |
0f186426 | 5255 | init_libfuncs (optable, word_mode, |
7f6007b4 | 5256 | mode_for_size (maxsize, MODE_INT, 0), |
0f186426 | 5257 | opname, suffix); |
c2a91a88 | 5258 | } |
5259 | ||
5260 | /* Initialize the libfunc fields of an entire group of entries in some | |
5261 | optab which correspond to all real mode operations. The parameters | |
5262 | have the same meaning as similarly named ones for the `init_libfuncs' | |
5263 | routine. (See above). */ | |
5264 | ||
5265 | static void | |
3ad4992f | 5266 | init_floating_libfuncs (optab optable, const char *opname, int suffix) |
c2a91a88 | 5267 | { |
0f186426 | 5268 | enum machine_mode fmode, dmode, lmode; |
5269 | ||
5270 | fmode = float_type_node ? TYPE_MODE (float_type_node) : VOIDmode; | |
5271 | dmode = double_type_node ? TYPE_MODE (double_type_node) : VOIDmode; | |
5272 | lmode = long_double_type_node ? TYPE_MODE (long_double_type_node) : VOIDmode; | |
5273 | ||
5274 | if (fmode != VOIDmode) | |
5275 | init_libfuncs (optable, fmode, fmode, opname, suffix); | |
5276 | if (dmode != fmode && dmode != VOIDmode) | |
5277 | init_libfuncs (optable, dmode, dmode, opname, suffix); | |
5278 | if (lmode != dmode && lmode != VOIDmode) | |
5279 | init_libfuncs (optable, lmode, lmode, opname, suffix); | |
c2a91a88 | 5280 | } |
5281 | ||
2c8daaf1 | 5282 | rtx |
3ad4992f | 5283 | init_one_libfunc (const char *name) |
2c8daaf1 | 5284 | { |
001be062 | 5285 | rtx symbol; |
5286 | ||
7811991d | 5287 | /* Create a FUNCTION_DECL that can be passed to |
5288 | targetm.encode_section_info. */ | |
87a0fb80 | 5289 | /* ??? We don't have any type information except for this is |
b889f371 | 5290 | a function. Pretend this is "int foo()". */ |
87a0fb80 | 5291 | tree decl = build_decl (FUNCTION_DECL, get_identifier (name), |
b889f371 | 5292 | build_function_type (integer_type_node, NULL_TREE)); |
87a0fb80 | 5293 | DECL_ARTIFICIAL (decl) = 1; |
5294 | DECL_EXTERNAL (decl) = 1; | |
5295 | TREE_PUBLIC (decl) = 1; | |
5296 | ||
001be062 | 5297 | symbol = XEXP (DECL_RTL (decl), 0); |
5298 | ||
5299 | /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with | |
5300 | are the flags assigned by targetm.encode_section_info. */ | |
5301 | SYMBOL_REF_DECL (symbol) = 0; | |
5302 | ||
5303 | return symbol; | |
2c8daaf1 | 5304 | } |
5305 | ||
1f215c26 | 5306 | /* Call this once to initialize the contents of the optabs |
5307 | appropriately for the current target machine. */ | |
5308 | ||
5309 | void | |
3ad4992f | 5310 | init_optabs (void) |
1f215c26 | 5311 | { |
3098b2d3 | 5312 | unsigned int i, j, k; |
1f215c26 | 5313 | |
2850b1f2 | 5314 | /* Start by initializing all tables to contain CODE_FOR_nothing. */ |
1f215c26 | 5315 | |
3098b2d3 | 5316 | for (i = 0; i < ARRAY_SIZE (fixtab); i++) |
5317 | for (j = 0; j < ARRAY_SIZE (fixtab[0]); j++) | |
5318 | for (k = 0; k < ARRAY_SIZE (fixtab[0][0]); k++) | |
5319 | fixtab[i][j][k] = CODE_FOR_nothing; | |
5320 | ||
5321 | for (i = 0; i < ARRAY_SIZE (fixtrunctab); i++) | |
5322 | for (j = 0; j < ARRAY_SIZE (fixtrunctab[0]); j++) | |
5323 | for (k = 0; k < ARRAY_SIZE (fixtrunctab[0][0]); k++) | |
5324 | fixtrunctab[i][j][k] = CODE_FOR_nothing; | |
5325 | ||
5326 | for (i = 0; i < ARRAY_SIZE (floattab); i++) | |
5327 | for (j = 0; j < ARRAY_SIZE (floattab[0]); j++) | |
5328 | for (k = 0; k < ARRAY_SIZE (floattab[0][0]); k++) | |
5329 | floattab[i][j][k] = CODE_FOR_nothing; | |
5330 | ||
5331 | for (i = 0; i < ARRAY_SIZE (extendtab); i++) | |
5332 | for (j = 0; j < ARRAY_SIZE (extendtab[0]); j++) | |
5333 | for (k = 0; k < ARRAY_SIZE (extendtab[0][0]); k++) | |
5334 | extendtab[i][j][k] = CODE_FOR_nothing; | |
2850b1f2 | 5335 | |
5336 | for (i = 0; i < NUM_RTX_CODE; i++) | |
5337 | setcc_gen_code[i] = CODE_FOR_nothing; | |
5338 | ||
62528147 | 5339 | #ifdef HAVE_conditional_move |
5340 | for (i = 0; i < NUM_MACHINE_MODES; i++) | |
5341 | movcc_gen_code[i] = CODE_FOR_nothing; | |
5342 | #endif | |
5343 | ||
2850b1f2 | 5344 | add_optab = init_optab (PLUS); |
ad99e708 | 5345 | addv_optab = init_optabv (PLUS); |
2850b1f2 | 5346 | sub_optab = init_optab (MINUS); |
ad99e708 | 5347 | subv_optab = init_optabv (MINUS); |
2850b1f2 | 5348 | smul_optab = init_optab (MULT); |
ad99e708 | 5349 | smulv_optab = init_optabv (MULT); |
7e4a644d | 5350 | smul_highpart_optab = init_optab (UNKNOWN); |
5351 | umul_highpart_optab = init_optab (UNKNOWN); | |
2850b1f2 | 5352 | smul_widen_optab = init_optab (UNKNOWN); |
5353 | umul_widen_optab = init_optab (UNKNOWN); | |
5354 | sdiv_optab = init_optab (DIV); | |
ad99e708 | 5355 | sdivv_optab = init_optabv (DIV); |
2850b1f2 | 5356 | sdivmod_optab = init_optab (UNKNOWN); |
5357 | udiv_optab = init_optab (UDIV); | |
5358 | udivmod_optab = init_optab (UNKNOWN); | |
5359 | smod_optab = init_optab (MOD); | |
5360 | umod_optab = init_optab (UMOD); | |
1f215c26 | 5361 | ftrunc_optab = init_optab (UNKNOWN); |
5362 | and_optab = init_optab (AND); | |
5363 | ior_optab = init_optab (IOR); | |
5364 | xor_optab = init_optab (XOR); | |
5365 | ashl_optab = init_optab (ASHIFT); | |
5366 | ashr_optab = init_optab (ASHIFTRT); | |
1f215c26 | 5367 | lshr_optab = init_optab (LSHIFTRT); |
5368 | rotl_optab = init_optab (ROTATE); | |
5369 | rotr_optab = init_optab (ROTATERT); | |
5370 | smin_optab = init_optab (SMIN); | |
5371 | smax_optab = init_optab (SMAX); | |
5372 | umin_optab = init_optab (UMIN); | |
5373 | umax_optab = init_optab (UMAX); | |
0fd605a5 | 5374 | pow_optab = init_optab (UNKNOWN); |
5375 | atan2_optab = init_optab (UNKNOWN); | |
ad99e708 | 5376 | |
5377 | /* These three have codes assigned exclusively for the sake of | |
5378 | have_insn_for. */ | |
5379 | mov_optab = init_optab (SET); | |
5380 | movstrict_optab = init_optab (STRICT_LOW_PART); | |
5381 | cmp_optab = init_optab (COMPARE); | |
5382 | ||
1f215c26 | 5383 | ucmp_optab = init_optab (UNKNOWN); |
5384 | tst_optab = init_optab (UNKNOWN); | |
5385 | neg_optab = init_optab (NEG); | |
ad99e708 | 5386 | negv_optab = init_optabv (NEG); |
1f215c26 | 5387 | abs_optab = init_optab (ABS); |
ad99e708 | 5388 | absv_optab = init_optabv (ABS); |
d3da2ad8 | 5389 | addcc_optab = init_optab (UNKNOWN); |
1f215c26 | 5390 | one_cmpl_optab = init_optab (NOT); |
5391 | ffs_optab = init_optab (FFS); | |
6a08d0ab | 5392 | clz_optab = init_optab (CLZ); |
5393 | ctz_optab = init_optab (CTZ); | |
5394 | popcount_optab = init_optab (POPCOUNT); | |
5395 | parity_optab = init_optab (PARITY); | |
f9e15121 | 5396 | sqrt_optab = init_optab (SQRT); |
805e22b2 | 5397 | floor_optab = init_optab (UNKNOWN); |
5398 | ceil_optab = init_optab (UNKNOWN); | |
5399 | round_optab = init_optab (UNKNOWN); | |
5400 | trunc_optab = init_optab (UNKNOWN); | |
5401 | nearbyint_optab = init_optab (UNKNOWN); | |
a73a8547 | 5402 | sin_optab = init_optab (UNKNOWN); |
5403 | cos_optab = init_optab (UNKNOWN); | |
42721db0 | 5404 | exp_optab = init_optab (UNKNOWN); |
5405 | log_optab = init_optab (UNKNOWN); | |
528ee710 | 5406 | tan_optab = init_optab (UNKNOWN); |
5407 | atan_optab = init_optab (UNKNOWN); | |
5eb0d754 | 5408 | strlen_optab = init_optab (UNKNOWN); |
10ee3e0f | 5409 | cbranch_optab = init_optab (UNKNOWN); |
5410 | cmov_optab = init_optab (UNKNOWN); | |
5411 | cstore_optab = init_optab (UNKNOWN); | |
675b92cc | 5412 | push_optab = init_optab (UNKNOWN); |
1f215c26 | 5413 | |
2850b1f2 | 5414 | for (i = 0; i < NUM_MACHINE_MODES; i++) |
5415 | { | |
5416 | movstr_optab[i] = CODE_FOR_nothing; | |
25e12d43 | 5417 | clrstr_optab[i] = CODE_FOR_nothing; |
2850b1f2 | 5418 | |
5419 | #ifdef HAVE_SECONDARY_RELOADS | |
5420 | reload_in_optab[i] = reload_out_optab[i] = CODE_FOR_nothing; | |
1f215c26 | 5421 | #endif |
2850b1f2 | 5422 | } |
5423 | ||
5424 | /* Fill in the optabs with the insns we support. */ | |
5425 | init_all_optabs (); | |
5426 | ||
5427 | #ifdef FIXUNS_TRUNC_LIKE_FIX_TRUNC | |
5428 | /* This flag says the same insns that convert to a signed fixnum | |
5429 | also convert validly to an unsigned one. */ | |
5430 | for (i = 0; i < NUM_MACHINE_MODES; i++) | |
5431 | for (j = 0; j < NUM_MACHINE_MODES; j++) | |
5432 | fixtrunctab[i][j][1] = fixtrunctab[i][j][0]; | |
c2a91a88 | 5433 | #endif |
2850b1f2 | 5434 | |
2850b1f2 | 5435 | /* Initialize the optabs with the names of the library functions. */ |
c2a91a88 | 5436 | init_integral_libfuncs (add_optab, "add", '3'); |
5437 | init_floating_libfuncs (add_optab, "add", '3'); | |
bec2d490 | 5438 | init_integral_libfuncs (addv_optab, "addv", '3'); |
5439 | init_floating_libfuncs (addv_optab, "add", '3'); | |
c2a91a88 | 5440 | init_integral_libfuncs (sub_optab, "sub", '3'); |
5441 | init_floating_libfuncs (sub_optab, "sub", '3'); | |
bec2d490 | 5442 | init_integral_libfuncs (subv_optab, "subv", '3'); |
5443 | init_floating_libfuncs (subv_optab, "sub", '3'); | |
c2a91a88 | 5444 | init_integral_libfuncs (smul_optab, "mul", '3'); |
5445 | init_floating_libfuncs (smul_optab, "mul", '3'); | |
bec2d490 | 5446 | init_integral_libfuncs (smulv_optab, "mulv", '3'); |
5447 | init_floating_libfuncs (smulv_optab, "mul", '3'); | |
2850b1f2 | 5448 | init_integral_libfuncs (sdiv_optab, "div", '3'); |
ad99e708 | 5449 | init_floating_libfuncs (sdiv_optab, "div", '3'); |
bec2d490 | 5450 | init_integral_libfuncs (sdivv_optab, "divv", '3'); |
2850b1f2 | 5451 | init_integral_libfuncs (udiv_optab, "udiv", '3'); |
5452 | init_integral_libfuncs (sdivmod_optab, "divmod", '4'); | |
5453 | init_integral_libfuncs (udivmod_optab, "udivmod", '4'); | |
5454 | init_integral_libfuncs (smod_optab, "mod", '3'); | |
5455 | init_integral_libfuncs (umod_optab, "umod", '3'); | |
2850b1f2 | 5456 | init_floating_libfuncs (ftrunc_optab, "ftrunc", '2'); |
5457 | init_integral_libfuncs (and_optab, "and", '3'); | |
5458 | init_integral_libfuncs (ior_optab, "ior", '3'); | |
5459 | init_integral_libfuncs (xor_optab, "xor", '3'); | |
5460 | init_integral_libfuncs (ashl_optab, "ashl", '3'); | |
5461 | init_integral_libfuncs (ashr_optab, "ashr", '3'); | |
2850b1f2 | 5462 | init_integral_libfuncs (lshr_optab, "lshr", '3'); |
2850b1f2 | 5463 | init_integral_libfuncs (smin_optab, "min", '3'); |
5464 | init_floating_libfuncs (smin_optab, "min", '3'); | |
5465 | init_integral_libfuncs (smax_optab, "max", '3'); | |
5466 | init_floating_libfuncs (smax_optab, "max", '3'); | |
5467 | init_integral_libfuncs (umin_optab, "umin", '3'); | |
5468 | init_integral_libfuncs (umax_optab, "umax", '3'); | |
5469 | init_integral_libfuncs (neg_optab, "neg", '2'); | |
5470 | init_floating_libfuncs (neg_optab, "neg", '2'); | |
bec2d490 | 5471 | init_integral_libfuncs (negv_optab, "negv", '2'); |
5472 | init_floating_libfuncs (negv_optab, "neg", '2'); | |
2850b1f2 | 5473 | init_integral_libfuncs (one_cmpl_optab, "one_cmpl", '2'); |
5474 | init_integral_libfuncs (ffs_optab, "ffs", '2'); | |
6a08d0ab | 5475 | init_integral_libfuncs (clz_optab, "clz", '2'); |
5476 | init_integral_libfuncs (ctz_optab, "ctz", '2'); | |
5477 | init_integral_libfuncs (popcount_optab, "popcount", '2'); | |
5478 | init_integral_libfuncs (parity_optab, "parity", '2'); | |
2850b1f2 | 5479 | |
5480 | /* Comparison libcalls for integers MUST come in pairs, signed/unsigned. */ | |
5481 | init_integral_libfuncs (cmp_optab, "cmp", '2'); | |
5482 | init_integral_libfuncs (ucmp_optab, "ucmp", '2'); | |
5483 | init_floating_libfuncs (cmp_optab, "cmp", '2'); | |
1f215c26 | 5484 | |
5485 | #ifdef MULSI3_LIBCALL | |
5486 | smul_optab->handlers[(int) SImode].libfunc | |
2c8daaf1 | 5487 | = init_one_libfunc (MULSI3_LIBCALL); |
1f215c26 | 5488 | #endif |
5489 | #ifdef MULDI3_LIBCALL | |
5490 | smul_optab->handlers[(int) DImode].libfunc | |
2c8daaf1 | 5491 | = init_one_libfunc (MULDI3_LIBCALL); |
1f215c26 | 5492 | #endif |
1f215c26 | 5493 | |
1f215c26 | 5494 | #ifdef DIVSI3_LIBCALL |
5495 | sdiv_optab->handlers[(int) SImode].libfunc | |
2c8daaf1 | 5496 | = init_one_libfunc (DIVSI3_LIBCALL); |
1f215c26 | 5497 | #endif |
5498 | #ifdef DIVDI3_LIBCALL | |
5499 | sdiv_optab->handlers[(int) DImode].libfunc | |
2c8daaf1 | 5500 | = init_one_libfunc (DIVDI3_LIBCALL); |
c2a91a88 | 5501 | #endif |
1f215c26 | 5502 | |
1f215c26 | 5503 | #ifdef UDIVSI3_LIBCALL |
5504 | udiv_optab->handlers[(int) SImode].libfunc | |
2c8daaf1 | 5505 | = init_one_libfunc (UDIVSI3_LIBCALL); |
1f215c26 | 5506 | #endif |
5507 | #ifdef UDIVDI3_LIBCALL | |
5508 | udiv_optab->handlers[(int) DImode].libfunc | |
2c8daaf1 | 5509 | = init_one_libfunc (UDIVDI3_LIBCALL); |
c2a91a88 | 5510 | #endif |
1f215c26 | 5511 | |
5512 | #ifdef MODSI3_LIBCALL | |
5513 | smod_optab->handlers[(int) SImode].libfunc | |
2c8daaf1 | 5514 | = init_one_libfunc (MODSI3_LIBCALL); |
1f215c26 | 5515 | #endif |
5516 | #ifdef MODDI3_LIBCALL | |
5517 | smod_optab->handlers[(int) DImode].libfunc | |
2c8daaf1 | 5518 | = init_one_libfunc (MODDI3_LIBCALL); |
c2a91a88 | 5519 | #endif |
1f215c26 | 5520 | |
5521 | #ifdef UMODSI3_LIBCALL | |
5522 | umod_optab->handlers[(int) SImode].libfunc | |
2c8daaf1 | 5523 | = init_one_libfunc (UMODSI3_LIBCALL); |
1f215c26 | 5524 | #endif |
5525 | #ifdef UMODDI3_LIBCALL | |
5526 | umod_optab->handlers[(int) DImode].libfunc | |
2c8daaf1 | 5527 | = init_one_libfunc (UMODDI3_LIBCALL); |
c2a91a88 | 5528 | #endif |
0d8310a9 | 5529 | |
a00c1647 | 5530 | /* Use cabs for DC complex abs, since systems generally have cabs. |
5531 | Don't define any libcall for SCmode, so that cabs will be used. */ | |
5532 | abs_optab->handlers[(int) DCmode].libfunc | |
2c8daaf1 | 5533 | = init_one_libfunc ("cabs"); |
1f215c26 | 5534 | |
5b8c84a5 | 5535 | /* The ffs function operates on `int'. */ |
7014838c | 5536 | ffs_optab->handlers[(int) mode_for_size (INT_TYPE_SIZE, MODE_INT, 0)].libfunc |
2c8daaf1 | 5537 | = init_one_libfunc ("ffs"); |
5538 | ||
5539 | extendsfdf2_libfunc = init_one_libfunc ("__extendsfdf2"); | |
5540 | extendsfxf2_libfunc = init_one_libfunc ("__extendsfxf2"); | |
5541 | extendsftf2_libfunc = init_one_libfunc ("__extendsftf2"); | |
5542 | extenddfxf2_libfunc = init_one_libfunc ("__extenddfxf2"); | |
5543 | extenddftf2_libfunc = init_one_libfunc ("__extenddftf2"); | |
5544 | ||
5545 | truncdfsf2_libfunc = init_one_libfunc ("__truncdfsf2"); | |
5546 | truncxfsf2_libfunc = init_one_libfunc ("__truncxfsf2"); | |
5547 | trunctfsf2_libfunc = init_one_libfunc ("__trunctfsf2"); | |
5548 | truncxfdf2_libfunc = init_one_libfunc ("__truncxfdf2"); | |
5549 | trunctfdf2_libfunc = init_one_libfunc ("__trunctfdf2"); | |
5550 | ||
a0ef1725 | 5551 | abort_libfunc = init_one_libfunc ("abort"); |
2c8daaf1 | 5552 | memcpy_libfunc = init_one_libfunc ("memcpy"); |
d5ff563e | 5553 | memmove_libfunc = init_one_libfunc ("memmove"); |
2c8daaf1 | 5554 | bcopy_libfunc = init_one_libfunc ("bcopy"); |
5555 | memcmp_libfunc = init_one_libfunc ("memcmp"); | |
5556 | bcmp_libfunc = init_one_libfunc ("__gcc_bcmp"); | |
5557 | memset_libfunc = init_one_libfunc ("memset"); | |
5558 | bzero_libfunc = init_one_libfunc ("bzero"); | |
62f615b1 | 5559 | setbits_libfunc = init_one_libfunc ("__setbits"); |
2c8daaf1 | 5560 | |
df4b504c | 5561 | unwind_resume_libfunc = init_one_libfunc (USING_SJLJ_EXCEPTIONS |
5562 | ? "_Unwind_SjLj_Resume" | |
5563 | : "_Unwind_Resume"); | |
17785858 | 5564 | #ifndef DONT_USE_BUILTIN_SETJMP |
2c8daaf1 | 5565 | setjmp_libfunc = init_one_libfunc ("__builtin_setjmp"); |
5566 | longjmp_libfunc = init_one_libfunc ("__builtin_longjmp"); | |
8591d03a | 5567 | #else |
2c8daaf1 | 5568 | setjmp_libfunc = init_one_libfunc ("setjmp"); |
5569 | longjmp_libfunc = init_one_libfunc ("longjmp"); | |
8591d03a | 5570 | #endif |
df4b504c | 5571 | unwind_sjlj_register_libfunc = init_one_libfunc ("_Unwind_SjLj_Register"); |
5572 | unwind_sjlj_unregister_libfunc | |
5573 | = init_one_libfunc ("_Unwind_SjLj_Unregister"); | |
485aaaaf | 5574 | |
2c8daaf1 | 5575 | eqhf2_libfunc = init_one_libfunc ("__eqhf2"); |
5576 | nehf2_libfunc = init_one_libfunc ("__nehf2"); | |
5577 | gthf2_libfunc = init_one_libfunc ("__gthf2"); | |
5578 | gehf2_libfunc = init_one_libfunc ("__gehf2"); | |
5579 | lthf2_libfunc = init_one_libfunc ("__lthf2"); | |
5580 | lehf2_libfunc = init_one_libfunc ("__lehf2"); | |
a4110d9a | 5581 | unordhf2_libfunc = init_one_libfunc ("__unordhf2"); |
2c8daaf1 | 5582 | |
5583 | eqsf2_libfunc = init_one_libfunc ("__eqsf2"); | |
5584 | nesf2_libfunc = init_one_libfunc ("__nesf2"); | |
5585 | gtsf2_libfunc = init_one_libfunc ("__gtsf2"); | |
5586 | gesf2_libfunc = init_one_libfunc ("__gesf2"); | |
5587 | ltsf2_libfunc = init_one_libfunc ("__ltsf2"); | |
5588 | lesf2_libfunc = init_one_libfunc ("__lesf2"); | |
a4110d9a | 5589 | unordsf2_libfunc = init_one_libfunc ("__unordsf2"); |
2c8daaf1 | 5590 | |
5591 | eqdf2_libfunc = init_one_libfunc ("__eqdf2"); | |
5592 | nedf2_libfunc = init_one_libfunc ("__nedf2"); | |
5593 | gtdf2_libfunc = init_one_libfunc ("__gtdf2"); | |
5594 | gedf2_libfunc = init_one_libfunc ("__gedf2"); | |
5595 | ltdf2_libfunc = init_one_libfunc ("__ltdf2"); | |
5596 | ledf2_libfunc = init_one_libfunc ("__ledf2"); | |
a4110d9a | 5597 | unorddf2_libfunc = init_one_libfunc ("__unorddf2"); |
2c8daaf1 | 5598 | |
5599 | eqxf2_libfunc = init_one_libfunc ("__eqxf2"); | |
5600 | nexf2_libfunc = init_one_libfunc ("__nexf2"); | |
5601 | gtxf2_libfunc = init_one_libfunc ("__gtxf2"); | |
5602 | gexf2_libfunc = init_one_libfunc ("__gexf2"); | |
5603 | ltxf2_libfunc = init_one_libfunc ("__ltxf2"); | |
5604 | lexf2_libfunc = init_one_libfunc ("__lexf2"); | |
a4110d9a | 5605 | unordxf2_libfunc = init_one_libfunc ("__unordxf2"); |
2c8daaf1 | 5606 | |
5607 | eqtf2_libfunc = init_one_libfunc ("__eqtf2"); | |
5608 | netf2_libfunc = init_one_libfunc ("__netf2"); | |
5609 | gttf2_libfunc = init_one_libfunc ("__gttf2"); | |
5610 | getf2_libfunc = init_one_libfunc ("__getf2"); | |
5611 | lttf2_libfunc = init_one_libfunc ("__lttf2"); | |
5612 | letf2_libfunc = init_one_libfunc ("__letf2"); | |
a4110d9a | 5613 | unordtf2_libfunc = init_one_libfunc ("__unordtf2"); |
2c8daaf1 | 5614 | |
5615 | floatsisf_libfunc = init_one_libfunc ("__floatsisf"); | |
5616 | floatdisf_libfunc = init_one_libfunc ("__floatdisf"); | |
5617 | floattisf_libfunc = init_one_libfunc ("__floattisf"); | |
5618 | ||
5619 | floatsidf_libfunc = init_one_libfunc ("__floatsidf"); | |
5620 | floatdidf_libfunc = init_one_libfunc ("__floatdidf"); | |
5621 | floattidf_libfunc = init_one_libfunc ("__floattidf"); | |
5622 | ||
5623 | floatsixf_libfunc = init_one_libfunc ("__floatsixf"); | |
5624 | floatdixf_libfunc = init_one_libfunc ("__floatdixf"); | |
5625 | floattixf_libfunc = init_one_libfunc ("__floattixf"); | |
5626 | ||
5627 | floatsitf_libfunc = init_one_libfunc ("__floatsitf"); | |
5628 | floatditf_libfunc = init_one_libfunc ("__floatditf"); | |
5629 | floattitf_libfunc = init_one_libfunc ("__floattitf"); | |
5630 | ||
5631 | fixsfsi_libfunc = init_one_libfunc ("__fixsfsi"); | |
5632 | fixsfdi_libfunc = init_one_libfunc ("__fixsfdi"); | |
5633 | fixsfti_libfunc = init_one_libfunc ("__fixsfti"); | |
5634 | ||
5635 | fixdfsi_libfunc = init_one_libfunc ("__fixdfsi"); | |
5636 | fixdfdi_libfunc = init_one_libfunc ("__fixdfdi"); | |
5637 | fixdfti_libfunc = init_one_libfunc ("__fixdfti"); | |
5638 | ||
5639 | fixxfsi_libfunc = init_one_libfunc ("__fixxfsi"); | |
5640 | fixxfdi_libfunc = init_one_libfunc ("__fixxfdi"); | |
5641 | fixxfti_libfunc = init_one_libfunc ("__fixxfti"); | |
5642 | ||
5643 | fixtfsi_libfunc = init_one_libfunc ("__fixtfsi"); | |
5644 | fixtfdi_libfunc = init_one_libfunc ("__fixtfdi"); | |
5645 | fixtfti_libfunc = init_one_libfunc ("__fixtfti"); | |
5646 | ||
5647 | fixunssfsi_libfunc = init_one_libfunc ("__fixunssfsi"); | |
5648 | fixunssfdi_libfunc = init_one_libfunc ("__fixunssfdi"); | |
5649 | fixunssfti_libfunc = init_one_libfunc ("__fixunssfti"); | |
5650 | ||
5651 | fixunsdfsi_libfunc = init_one_libfunc ("__fixunsdfsi"); | |
5652 | fixunsdfdi_libfunc = init_one_libfunc ("__fixunsdfdi"); | |
5653 | fixunsdfti_libfunc = init_one_libfunc ("__fixunsdfti"); | |
5654 | ||
5655 | fixunsxfsi_libfunc = init_one_libfunc ("__fixunsxfsi"); | |
5656 | fixunsxfdi_libfunc = init_one_libfunc ("__fixunsxfdi"); | |
5657 | fixunsxfti_libfunc = init_one_libfunc ("__fixunsxfti"); | |
5658 | ||
5659 | fixunstfsi_libfunc = init_one_libfunc ("__fixunstfsi"); | |
5660 | fixunstfdi_libfunc = init_one_libfunc ("__fixunstfdi"); | |
5661 | fixunstfti_libfunc = init_one_libfunc ("__fixunstfti"); | |
0d8310a9 | 5662 | |
abd28cef | 5663 | /* For function entry/exit instrumentation. */ |
5664 | profile_function_entry_libfunc | |
2c8daaf1 | 5665 | = init_one_libfunc ("__cyg_profile_func_enter"); |
abd28cef | 5666 | profile_function_exit_libfunc |
2c8daaf1 | 5667 | = init_one_libfunc ("__cyg_profile_func_exit"); |
abd28cef | 5668 | |
62f615b1 | 5669 | gcov_flush_libfunc = init_one_libfunc ("__gcov_flush"); |
5670 | gcov_init_libfunc = init_one_libfunc ("__gcov_init"); | |
5671 | ||
b3a15ba6 | 5672 | if (HAVE_conditional_trap) |
5673 | trap_rtx = gen_rtx_fmt_ee (EQ, VOIDmode, NULL_RTX, NULL_RTX); | |
9e5192ed | 5674 | |
76915553 | 5675 | #ifdef INIT_TARGET_OPTABS |
5676 | /* Allow the target to add more libcalls or rename some, etc. */ | |
5677 | INIT_TARGET_OPTABS; | |
5678 | #endif | |
1f215c26 | 5679 | } |
ff5ef762 | 5680 | \f |
9e5192ed | 5681 | /* Generate insns to trap with code TCODE if OP1 and OP2 satisfy condition |
5682 | CODE. Return 0 on failure. */ | |
5683 | ||
5684 | rtx | |
3ad4992f | 5685 | gen_cond_trap (enum rtx_code code ATTRIBUTE_UNUSED, rtx op1, |
5686 | rtx op2 ATTRIBUTE_UNUSED, rtx tcode ATTRIBUTE_UNUSED) | |
9e5192ed | 5687 | { |
5688 | enum machine_mode mode = GET_MODE (op1); | |
b3a15ba6 | 5689 | enum insn_code icode; |
5690 | rtx insn; | |
5691 | ||
5692 | if (!HAVE_conditional_trap) | |
5693 | return 0; | |
9e5192ed | 5694 | |
5695 | if (mode == VOIDmode) | |
5696 | return 0; | |
5697 | ||
b3a15ba6 | 5698 | icode = cmp_optab->handlers[(int) mode].insn_code; |
5699 | if (icode == CODE_FOR_nothing) | |
5700 | return 0; | |
5701 | ||
5702 | start_sequence (); | |
5703 | op1 = prepare_operand (icode, op1, 0, mode, mode, 0); | |
7e13d3c8 | 5704 | op2 = prepare_operand (icode, op2, 1, mode, mode, 0); |
b3a15ba6 | 5705 | emit_insn (GEN_FCN (icode) (op1, op2)); |
5706 | ||
5707 | PUT_CODE (trap_rtx, code); | |
5708 | insn = gen_conditional_trap (trap_rtx, tcode); | |
5709 | if (insn) | |
9e5192ed | 5710 | { |
b3a15ba6 | 5711 | emit_insn (insn); |
5712 | insn = get_insns (); | |
9e5192ed | 5713 | } |
b3a15ba6 | 5714 | end_sequence (); |
9e5192ed | 5715 | |
b3a15ba6 | 5716 | return insn; |
9e5192ed | 5717 | } |
1f3233d1 | 5718 | |
5719 | #include "gt-optabs.h" |