[Patch 1/2 ifcvt costs] New target hook: max_noce_ifcvt_seq_cost
[gcc.git] / gcc / targhooks.c
1 /* Default target hook functions.
2 Copyright (C) 2003-2016 Free Software Foundation, Inc.
3
4 This file is part of GCC.
5
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
10
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
19
20 /* The migration of target macros to target hooks works as follows:
21
22 1. Create a target hook that uses the existing target macros to
23 implement the same functionality.
24
25 2. Convert all the MI files to use the hook instead of the macro.
26
27 3. Repeat for a majority of the remaining target macros. This will
28 take some time.
29
30 4. Tell target maintainers to start migrating.
31
32 5. Eventually convert the backends to override the hook instead of
33 defining the macros. This will take some time too.
34
35 6. TBD when, poison the macros. Unmigrated targets will break at
36 this point.
37
38 Note that we expect steps 1-3 to be done by the people that
39 understand what the MI does with each macro, and step 5 to be done
40 by the target maintainers for their respective targets.
41
42 Note that steps 1 and 2 don't have to be done together, but no
43 target can override the new hook until step 2 is complete for it.
44
45 Once the macros are poisoned, we will revert to the old migration
46 rules - migrate the macro, callers, and targets all at once. This
47 comment can thus be removed at that point. */
48
49 #include "config.h"
50 #include "system.h"
51 #include "coretypes.h"
52 #include "target.h"
53 #include "function.h"
54 #include "rtl.h"
55 #include "tree.h"
56 #include "tree-ssa-alias.h"
57 #include "gimple-expr.h"
58 #include "tm_p.h"
59 #include "stringpool.h"
60 #include "tree-ssanames.h"
61 #include "optabs.h"
62 #include "regs.h"
63 #include "recog.h"
64 #include "diagnostic-core.h"
65 #include "fold-const.h"
66 #include "stor-layout.h"
67 #include "varasm.h"
68 #include "flags.h"
69 #include "explow.h"
70 #include "calls.h"
71 #include "expr.h"
72 #include "output.h"
73 #include "reload.h"
74 #include "intl.h"
75 #include "opts.h"
76 #include "gimplify.h"
77 #include "predict.h"
78 #include "params.h"
79
80
81 bool
82 default_legitimate_address_p (machine_mode mode ATTRIBUTE_UNUSED,
83 rtx addr ATTRIBUTE_UNUSED,
84 bool strict ATTRIBUTE_UNUSED)
85 {
86 #ifdef GO_IF_LEGITIMATE_ADDRESS
87 /* Defer to the old implementation using a goto. */
88 if (strict)
89 return strict_memory_address_p (mode, addr);
90 else
91 return memory_address_p (mode, addr);
92 #else
93 gcc_unreachable ();
94 #endif
95 }
96
97 void
98 default_external_libcall (rtx fun ATTRIBUTE_UNUSED)
99 {
100 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
101 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
102 #endif
103 }
104
105 int
106 default_unspec_may_trap_p (const_rtx x, unsigned flags)
107 {
108 int i;
109
110 /* Any floating arithmetic may trap. */
111 if ((SCALAR_FLOAT_MODE_P (GET_MODE (x)) && flag_trapping_math))
112 return 1;
113
114 for (i = 0; i < XVECLEN (x, 0); ++i)
115 {
116 if (may_trap_p_1 (XVECEXP (x, 0, i), flags))
117 return 1;
118 }
119
120 return 0;
121 }
122
123 machine_mode
124 default_promote_function_mode (const_tree type ATTRIBUTE_UNUSED,
125 machine_mode mode,
126 int *punsignedp ATTRIBUTE_UNUSED,
127 const_tree funtype ATTRIBUTE_UNUSED,
128 int for_return ATTRIBUTE_UNUSED)
129 {
130 if (type != NULL_TREE && for_return == 2)
131 return promote_mode (type, mode, punsignedp);
132 return mode;
133 }
134
135 machine_mode
136 default_promote_function_mode_always_promote (const_tree type,
137 machine_mode mode,
138 int *punsignedp,
139 const_tree funtype ATTRIBUTE_UNUSED,
140 int for_return ATTRIBUTE_UNUSED)
141 {
142 return promote_mode (type, mode, punsignedp);
143 }
144
145 machine_mode
146 default_cc_modes_compatible (machine_mode m1, machine_mode m2)
147 {
148 if (m1 == m2)
149 return m1;
150 return VOIDmode;
151 }
152
153 bool
154 default_return_in_memory (const_tree type,
155 const_tree fntype ATTRIBUTE_UNUSED)
156 {
157 return (TYPE_MODE (type) == BLKmode);
158 }
159
160 rtx
161 default_legitimize_address (rtx x, rtx orig_x ATTRIBUTE_UNUSED,
162 machine_mode mode ATTRIBUTE_UNUSED)
163 {
164 return x;
165 }
166
167 bool
168 default_legitimize_address_displacement (rtx *disp ATTRIBUTE_UNUSED,
169 rtx *offset ATTRIBUTE_UNUSED,
170 machine_mode mode ATTRIBUTE_UNUSED)
171 {
172 return false;
173 }
174
175 rtx
176 default_expand_builtin_saveregs (void)
177 {
178 error ("__builtin_saveregs not supported by this target");
179 return const0_rtx;
180 }
181
182 void
183 default_setup_incoming_varargs (cumulative_args_t ca ATTRIBUTE_UNUSED,
184 machine_mode mode ATTRIBUTE_UNUSED,
185 tree type ATTRIBUTE_UNUSED,
186 int *pretend_arg_size ATTRIBUTE_UNUSED,
187 int second_time ATTRIBUTE_UNUSED)
188 {
189 }
190
191 /* The default implementation of TARGET_BUILTIN_SETJMP_FRAME_VALUE. */
192
193 rtx
194 default_builtin_setjmp_frame_value (void)
195 {
196 return virtual_stack_vars_rtx;
197 }
198
199 /* Generic hook that takes a CUMULATIVE_ARGS pointer and returns false. */
200
201 bool
202 hook_bool_CUMULATIVE_ARGS_false (cumulative_args_t ca ATTRIBUTE_UNUSED)
203 {
204 return false;
205 }
206
207 bool
208 default_pretend_outgoing_varargs_named (cumulative_args_t ca ATTRIBUTE_UNUSED)
209 {
210 return (targetm.calls.setup_incoming_varargs
211 != default_setup_incoming_varargs);
212 }
213
214 machine_mode
215 default_eh_return_filter_mode (void)
216 {
217 return targetm.unwind_word_mode ();
218 }
219
220 machine_mode
221 default_libgcc_cmp_return_mode (void)
222 {
223 return word_mode;
224 }
225
226 machine_mode
227 default_libgcc_shift_count_mode (void)
228 {
229 return word_mode;
230 }
231
232 machine_mode
233 default_unwind_word_mode (void)
234 {
235 return word_mode;
236 }
237
238 /* The default implementation of TARGET_SHIFT_TRUNCATION_MASK. */
239
240 unsigned HOST_WIDE_INT
241 default_shift_truncation_mask (machine_mode mode)
242 {
243 return SHIFT_COUNT_TRUNCATED ? GET_MODE_BITSIZE (mode) - 1 : 0;
244 }
245
246 /* The default implementation of TARGET_MIN_DIVISIONS_FOR_RECIP_MUL. */
247
248 unsigned int
249 default_min_divisions_for_recip_mul (machine_mode mode ATTRIBUTE_UNUSED)
250 {
251 return have_insn_for (DIV, mode) ? 3 : 2;
252 }
253
254 /* The default implementation of TARGET_MODE_REP_EXTENDED. */
255
256 int
257 default_mode_rep_extended (machine_mode mode ATTRIBUTE_UNUSED,
258 machine_mode mode_rep ATTRIBUTE_UNUSED)
259 {
260 return UNKNOWN;
261 }
262
263 /* Generic hook that takes a CUMULATIVE_ARGS pointer and returns true. */
264
265 bool
266 hook_bool_CUMULATIVE_ARGS_true (cumulative_args_t a ATTRIBUTE_UNUSED)
267 {
268 return true;
269 }
270
271 /* Return machine mode for non-standard suffix
272 or VOIDmode if non-standard suffixes are unsupported. */
273 machine_mode
274 default_mode_for_suffix (char suffix ATTRIBUTE_UNUSED)
275 {
276 return VOIDmode;
277 }
278
279 /* The generic C++ ABI specifies this is a 64-bit value. */
280 tree
281 default_cxx_guard_type (void)
282 {
283 return long_long_integer_type_node;
284 }
285
286 /* Returns the size of the cookie to use when allocating an array
287 whose elements have the indicated TYPE. Assumes that it is already
288 known that a cookie is needed. */
289
290 tree
291 default_cxx_get_cookie_size (tree type)
292 {
293 tree cookie_size;
294
295 /* We need to allocate an additional max (sizeof (size_t), alignof
296 (true_type)) bytes. */
297 tree sizetype_size;
298 tree type_align;
299
300 sizetype_size = size_in_bytes (sizetype);
301 type_align = size_int (TYPE_ALIGN_UNIT (type));
302 if (tree_int_cst_lt (type_align, sizetype_size))
303 cookie_size = sizetype_size;
304 else
305 cookie_size = type_align;
306
307 return cookie_size;
308 }
309
310 /* Return true if a parameter must be passed by reference. This version
311 of the TARGET_PASS_BY_REFERENCE hook uses just MUST_PASS_IN_STACK. */
312
313 bool
314 hook_pass_by_reference_must_pass_in_stack (cumulative_args_t c ATTRIBUTE_UNUSED,
315 machine_mode mode ATTRIBUTE_UNUSED, const_tree type ATTRIBUTE_UNUSED,
316 bool named_arg ATTRIBUTE_UNUSED)
317 {
318 return targetm.calls.must_pass_in_stack (mode, type);
319 }
320
321 /* Return true if a parameter follows callee copies conventions. This
322 version of the hook is true for all named arguments. */
323
324 bool
325 hook_callee_copies_named (cumulative_args_t ca ATTRIBUTE_UNUSED,
326 machine_mode mode ATTRIBUTE_UNUSED,
327 const_tree type ATTRIBUTE_UNUSED, bool named)
328 {
329 return named;
330 }
331
332 /* Emit to STREAM the assembler syntax for insn operand X. */
333
334 void
335 default_print_operand (FILE *stream ATTRIBUTE_UNUSED, rtx x ATTRIBUTE_UNUSED,
336 int code ATTRIBUTE_UNUSED)
337 {
338 #ifdef PRINT_OPERAND
339 PRINT_OPERAND (stream, x, code);
340 #else
341 gcc_unreachable ();
342 #endif
343 }
344
345 /* Emit to STREAM the assembler syntax for an insn operand whose memory
346 address is X. */
347
348 void
349 default_print_operand_address (FILE *stream ATTRIBUTE_UNUSED,
350 machine_mode /*mode*/,
351 rtx x ATTRIBUTE_UNUSED)
352 {
353 #ifdef PRINT_OPERAND_ADDRESS
354 PRINT_OPERAND_ADDRESS (stream, x);
355 #else
356 gcc_unreachable ();
357 #endif
358 }
359
360 /* Return true if CODE is a valid punctuation character for the
361 `print_operand' hook. */
362
363 bool
364 default_print_operand_punct_valid_p (unsigned char code ATTRIBUTE_UNUSED)
365 {
366 #ifdef PRINT_OPERAND_PUNCT_VALID_P
367 return PRINT_OPERAND_PUNCT_VALID_P (code);
368 #else
369 return false;
370 #endif
371 }
372
373 /* The default implementation of TARGET_MANGLE_ASSEMBLER_NAME. */
374 tree
375 default_mangle_assembler_name (const char *name ATTRIBUTE_UNUSED)
376 {
377 const char *skipped = name + (*name == '*' ? 1 : 0);
378 const char *stripped = targetm.strip_name_encoding (skipped);
379 if (*name != '*' && user_label_prefix[0])
380 stripped = ACONCAT ((user_label_prefix, stripped, NULL));
381 return get_identifier (stripped);
382 }
383
384 /* True if MODE is valid for the target. By "valid", we mean able to
385 be manipulated in non-trivial ways. In particular, this means all
386 the arithmetic is supported.
387
388 By default we guess this means that any C type is supported. If
389 we can't map the mode back to a type that would be available in C,
390 then reject it. Special case, here, is the double-word arithmetic
391 supported by optabs.c. */
392
393 bool
394 default_scalar_mode_supported_p (machine_mode mode)
395 {
396 int precision = GET_MODE_PRECISION (mode);
397
398 switch (GET_MODE_CLASS (mode))
399 {
400 case MODE_PARTIAL_INT:
401 case MODE_INT:
402 if (precision == CHAR_TYPE_SIZE)
403 return true;
404 if (precision == SHORT_TYPE_SIZE)
405 return true;
406 if (precision == INT_TYPE_SIZE)
407 return true;
408 if (precision == LONG_TYPE_SIZE)
409 return true;
410 if (precision == LONG_LONG_TYPE_SIZE)
411 return true;
412 if (precision == 2 * BITS_PER_WORD)
413 return true;
414 return false;
415
416 case MODE_FLOAT:
417 if (precision == FLOAT_TYPE_SIZE)
418 return true;
419 if (precision == DOUBLE_TYPE_SIZE)
420 return true;
421 if (precision == LONG_DOUBLE_TYPE_SIZE)
422 return true;
423 return false;
424
425 case MODE_DECIMAL_FLOAT:
426 case MODE_FRACT:
427 case MODE_UFRACT:
428 case MODE_ACCUM:
429 case MODE_UACCUM:
430 return false;
431
432 default:
433 gcc_unreachable ();
434 }
435 }
436
437 /* Return true if libgcc supports floating-point mode MODE (known to
438 be supported as a scalar mode). */
439
440 bool
441 default_libgcc_floating_mode_supported_p (machine_mode mode)
442 {
443 switch (mode)
444 {
445 #ifdef HAVE_SFmode
446 case SFmode:
447 #endif
448 #ifdef HAVE_DFmode
449 case DFmode:
450 #endif
451 #ifdef HAVE_XFmode
452 case XFmode:
453 #endif
454 #ifdef HAVE_TFmode
455 case TFmode:
456 #endif
457 return true;
458
459 default:
460 return false;
461 }
462 }
463
464 /* Make some target macros useable by target-independent code. */
465 bool
466 targhook_words_big_endian (void)
467 {
468 return !!WORDS_BIG_ENDIAN;
469 }
470
471 bool
472 targhook_float_words_big_endian (void)
473 {
474 return !!FLOAT_WORDS_BIG_ENDIAN;
475 }
476
477 /* True if the target supports floating-point exceptions and rounding
478 modes. */
479
480 bool
481 default_float_exceptions_rounding_supported_p (void)
482 {
483 #ifdef HAVE_adddf3
484 return HAVE_adddf3;
485 #else
486 return false;
487 #endif
488 }
489
490 /* True if the target supports decimal floating point. */
491
492 bool
493 default_decimal_float_supported_p (void)
494 {
495 return ENABLE_DECIMAL_FLOAT;
496 }
497
498 /* True if the target supports fixed-point arithmetic. */
499
500 bool
501 default_fixed_point_supported_p (void)
502 {
503 return ENABLE_FIXED_POINT;
504 }
505
506 /* True if the target supports GNU indirect functions. */
507
508 bool
509 default_has_ifunc_p (void)
510 {
511 return HAVE_GNU_INDIRECT_FUNCTION;
512 }
513
514 /* NULL if INSN insn is valid within a low-overhead loop, otherwise returns
515 an error message.
516
517 This function checks whether a given INSN is valid within a low-overhead
518 loop. If INSN is invalid it returns the reason for that, otherwise it
519 returns NULL. A called function may clobber any special registers required
520 for low-overhead looping. Additionally, some targets (eg, PPC) use the count
521 register for branch on table instructions. We reject the doloop pattern in
522 these cases. */
523
524 const char *
525 default_invalid_within_doloop (const rtx_insn *insn)
526 {
527 if (CALL_P (insn))
528 return "Function call in loop.";
529
530 if (tablejump_p (insn, NULL, NULL) || computed_jump_p (insn))
531 return "Computed branch in the loop.";
532
533 return NULL;
534 }
535
536 /* Mapping of builtin functions to vectorized variants. */
537
538 tree
539 default_builtin_vectorized_function (unsigned int, tree, tree)
540 {
541 return NULL_TREE;
542 }
543
544 /* Mapping of target builtin functions to vectorized variants. */
545
546 tree
547 default_builtin_md_vectorized_function (tree, tree, tree)
548 {
549 return NULL_TREE;
550 }
551
552 /* Vectorized conversion. */
553
554 tree
555 default_builtin_vectorized_conversion (unsigned int code ATTRIBUTE_UNUSED,
556 tree dest_type ATTRIBUTE_UNUSED,
557 tree src_type ATTRIBUTE_UNUSED)
558 {
559 return NULL_TREE;
560 }
561
562 /* Default vectorizer cost model values. */
563
564 int
565 default_builtin_vectorization_cost (enum vect_cost_for_stmt type_of_cost,
566 tree vectype,
567 int misalign ATTRIBUTE_UNUSED)
568 {
569 switch (type_of_cost)
570 {
571 case scalar_stmt:
572 case scalar_load:
573 case scalar_store:
574 case vector_stmt:
575 case vector_load:
576 case vector_store:
577 case vec_to_scalar:
578 case scalar_to_vec:
579 case cond_branch_not_taken:
580 case vec_perm:
581 case vec_promote_demote:
582 return 1;
583
584 case unaligned_load:
585 case unaligned_store:
586 return 2;
587
588 case cond_branch_taken:
589 return 3;
590
591 case vec_construct:
592 return TYPE_VECTOR_SUBPARTS (vectype) - 1;
593
594 default:
595 gcc_unreachable ();
596 }
597 }
598
599 /* Reciprocal. */
600
601 tree
602 default_builtin_reciprocal (tree)
603 {
604 return NULL_TREE;
605 }
606
607 bool
608 hook_bool_CUMULATIVE_ARGS_mode_tree_bool_false (
609 cumulative_args_t ca ATTRIBUTE_UNUSED,
610 machine_mode mode ATTRIBUTE_UNUSED,
611 const_tree type ATTRIBUTE_UNUSED, bool named ATTRIBUTE_UNUSED)
612 {
613 return false;
614 }
615
616 bool
617 hook_bool_CUMULATIVE_ARGS_mode_tree_bool_true (
618 cumulative_args_t ca ATTRIBUTE_UNUSED,
619 machine_mode mode ATTRIBUTE_UNUSED,
620 const_tree type ATTRIBUTE_UNUSED, bool named ATTRIBUTE_UNUSED)
621 {
622 return true;
623 }
624
625 int
626 hook_int_CUMULATIVE_ARGS_mode_tree_bool_0 (
627 cumulative_args_t ca ATTRIBUTE_UNUSED,
628 machine_mode mode ATTRIBUTE_UNUSED,
629 tree type ATTRIBUTE_UNUSED, bool named ATTRIBUTE_UNUSED)
630 {
631 return 0;
632 }
633
634 void
635 default_function_arg_advance (cumulative_args_t ca ATTRIBUTE_UNUSED,
636 machine_mode mode ATTRIBUTE_UNUSED,
637 const_tree type ATTRIBUTE_UNUSED,
638 bool named ATTRIBUTE_UNUSED)
639 {
640 gcc_unreachable ();
641 }
642
643 rtx
644 default_function_arg (cumulative_args_t ca ATTRIBUTE_UNUSED,
645 machine_mode mode ATTRIBUTE_UNUSED,
646 const_tree type ATTRIBUTE_UNUSED,
647 bool named ATTRIBUTE_UNUSED)
648 {
649 gcc_unreachable ();
650 }
651
652 rtx
653 default_function_incoming_arg (cumulative_args_t ca ATTRIBUTE_UNUSED,
654 machine_mode mode ATTRIBUTE_UNUSED,
655 const_tree type ATTRIBUTE_UNUSED,
656 bool named ATTRIBUTE_UNUSED)
657 {
658 gcc_unreachable ();
659 }
660
661 unsigned int
662 default_function_arg_boundary (machine_mode mode ATTRIBUTE_UNUSED,
663 const_tree type ATTRIBUTE_UNUSED)
664 {
665 return PARM_BOUNDARY;
666 }
667
668 unsigned int
669 default_function_arg_round_boundary (machine_mode mode ATTRIBUTE_UNUSED,
670 const_tree type ATTRIBUTE_UNUSED)
671 {
672 return PARM_BOUNDARY;
673 }
674
675 void
676 hook_void_bitmap (bitmap regs ATTRIBUTE_UNUSED)
677 {
678 }
679
680 const char *
681 hook_invalid_arg_for_unprototyped_fn (
682 const_tree typelist ATTRIBUTE_UNUSED,
683 const_tree funcdecl ATTRIBUTE_UNUSED,
684 const_tree val ATTRIBUTE_UNUSED)
685 {
686 return NULL;
687 }
688
689 /* Initialize the stack protection decls. */
690
691 /* Stack protection related decls living in libgcc. */
692 static GTY(()) tree stack_chk_guard_decl;
693
694 tree
695 default_stack_protect_guard (void)
696 {
697 tree t = stack_chk_guard_decl;
698
699 if (t == NULL)
700 {
701 rtx x;
702
703 t = build_decl (UNKNOWN_LOCATION,
704 VAR_DECL, get_identifier ("__stack_chk_guard"),
705 ptr_type_node);
706 TREE_STATIC (t) = 1;
707 TREE_PUBLIC (t) = 1;
708 DECL_EXTERNAL (t) = 1;
709 TREE_USED (t) = 1;
710 TREE_THIS_VOLATILE (t) = 1;
711 DECL_ARTIFICIAL (t) = 1;
712 DECL_IGNORED_P (t) = 1;
713
714 /* Do not share RTL as the declaration is visible outside of
715 current function. */
716 x = DECL_RTL (t);
717 RTX_FLAG (x, used) = 1;
718
719 stack_chk_guard_decl = t;
720 }
721
722 return t;
723 }
724
725 static GTY(()) tree stack_chk_fail_decl;
726
727 tree
728 default_external_stack_protect_fail (void)
729 {
730 tree t = stack_chk_fail_decl;
731
732 if (t == NULL_TREE)
733 {
734 t = build_function_type_list (void_type_node, NULL_TREE);
735 t = build_decl (UNKNOWN_LOCATION,
736 FUNCTION_DECL, get_identifier ("__stack_chk_fail"), t);
737 TREE_STATIC (t) = 1;
738 TREE_PUBLIC (t) = 1;
739 DECL_EXTERNAL (t) = 1;
740 TREE_USED (t) = 1;
741 TREE_THIS_VOLATILE (t) = 1;
742 TREE_NOTHROW (t) = 1;
743 DECL_ARTIFICIAL (t) = 1;
744 DECL_IGNORED_P (t) = 1;
745 DECL_VISIBILITY (t) = VISIBILITY_DEFAULT;
746 DECL_VISIBILITY_SPECIFIED (t) = 1;
747
748 stack_chk_fail_decl = t;
749 }
750
751 return build_call_expr (t, 0);
752 }
753
754 tree
755 default_hidden_stack_protect_fail (void)
756 {
757 #ifndef HAVE_GAS_HIDDEN
758 return default_external_stack_protect_fail ();
759 #else
760 tree t = stack_chk_fail_decl;
761
762 if (!flag_pic)
763 return default_external_stack_protect_fail ();
764
765 if (t == NULL_TREE)
766 {
767 t = build_function_type_list (void_type_node, NULL_TREE);
768 t = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
769 get_identifier ("__stack_chk_fail_local"), t);
770 TREE_STATIC (t) = 1;
771 TREE_PUBLIC (t) = 1;
772 DECL_EXTERNAL (t) = 1;
773 TREE_USED (t) = 1;
774 TREE_THIS_VOLATILE (t) = 1;
775 TREE_NOTHROW (t) = 1;
776 DECL_ARTIFICIAL (t) = 1;
777 DECL_IGNORED_P (t) = 1;
778 DECL_VISIBILITY_SPECIFIED (t) = 1;
779 DECL_VISIBILITY (t) = VISIBILITY_HIDDEN;
780
781 stack_chk_fail_decl = t;
782 }
783
784 return build_call_expr (t, 0);
785 #endif
786 }
787
788 bool
789 hook_bool_const_rtx_commutative_p (const_rtx x,
790 int outer_code ATTRIBUTE_UNUSED)
791 {
792 return COMMUTATIVE_P (x);
793 }
794
795 rtx
796 default_function_value (const_tree ret_type ATTRIBUTE_UNUSED,
797 const_tree fn_decl_or_type,
798 bool outgoing ATTRIBUTE_UNUSED)
799 {
800 /* The old interface doesn't handle receiving the function type. */
801 if (fn_decl_or_type
802 && !DECL_P (fn_decl_or_type))
803 fn_decl_or_type = NULL;
804
805 #ifdef FUNCTION_VALUE
806 return FUNCTION_VALUE (ret_type, fn_decl_or_type);
807 #else
808 gcc_unreachable ();
809 #endif
810 }
811
812 rtx
813 default_libcall_value (machine_mode mode ATTRIBUTE_UNUSED,
814 const_rtx fun ATTRIBUTE_UNUSED)
815 {
816 #ifdef LIBCALL_VALUE
817 return LIBCALL_VALUE (mode);
818 #else
819 gcc_unreachable ();
820 #endif
821 }
822
823 /* The default hook for TARGET_FUNCTION_VALUE_REGNO_P. */
824
825 bool
826 default_function_value_regno_p (const unsigned int regno ATTRIBUTE_UNUSED)
827 {
828 #ifdef FUNCTION_VALUE_REGNO_P
829 return FUNCTION_VALUE_REGNO_P (regno);
830 #else
831 gcc_unreachable ();
832 #endif
833 }
834
835 rtx
836 default_internal_arg_pointer (void)
837 {
838 /* If the reg that the virtual arg pointer will be translated into is
839 not a fixed reg or is the stack pointer, make a copy of the virtual
840 arg pointer, and address parms via the copy. The frame pointer is
841 considered fixed even though it is not marked as such. */
842 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
843 || ! (fixed_regs[ARG_POINTER_REGNUM]
844 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
845 return copy_to_reg (virtual_incoming_args_rtx);
846 else
847 return virtual_incoming_args_rtx;
848 }
849
850 rtx
851 default_static_chain (const_tree ARG_UNUSED (fndecl_or_type), bool incoming_p)
852 {
853 if (incoming_p)
854 {
855 #ifdef STATIC_CHAIN_INCOMING_REGNUM
856 return gen_rtx_REG (Pmode, STATIC_CHAIN_INCOMING_REGNUM);
857 #endif
858 }
859
860 #ifdef STATIC_CHAIN_REGNUM
861 return gen_rtx_REG (Pmode, STATIC_CHAIN_REGNUM);
862 #endif
863
864 {
865 static bool issued_error;
866 if (!issued_error)
867 {
868 issued_error = true;
869 sorry ("nested functions not supported on this target");
870 }
871
872 /* It really doesn't matter what we return here, so long at it
873 doesn't cause the rest of the compiler to crash. */
874 return gen_rtx_MEM (Pmode, stack_pointer_rtx);
875 }
876 }
877
878 void
879 default_trampoline_init (rtx ARG_UNUSED (m_tramp), tree ARG_UNUSED (t_func),
880 rtx ARG_UNUSED (r_chain))
881 {
882 sorry ("nested function trampolines not supported on this target");
883 }
884
885 int
886 default_return_pops_args (tree fundecl ATTRIBUTE_UNUSED,
887 tree funtype ATTRIBUTE_UNUSED,
888 int size ATTRIBUTE_UNUSED)
889 {
890 return 0;
891 }
892
893 reg_class_t
894 default_branch_target_register_class (void)
895 {
896 return NO_REGS;
897 }
898
899 reg_class_t
900 default_ira_change_pseudo_allocno_class (int regno ATTRIBUTE_UNUSED,
901 reg_class_t cl,
902 reg_class_t best_cl ATTRIBUTE_UNUSED)
903 {
904 return cl;
905 }
906
907 extern bool
908 default_lra_p (void)
909 {
910 return false;
911 }
912
913 int
914 default_register_priority (int hard_regno ATTRIBUTE_UNUSED)
915 {
916 return 0;
917 }
918
919 extern bool
920 default_register_usage_leveling_p (void)
921 {
922 return false;
923 }
924
925 extern bool
926 default_different_addr_displacement_p (void)
927 {
928 return false;
929 }
930
931 reg_class_t
932 default_secondary_reload (bool in_p ATTRIBUTE_UNUSED, rtx x ATTRIBUTE_UNUSED,
933 reg_class_t reload_class_i ATTRIBUTE_UNUSED,
934 machine_mode reload_mode ATTRIBUTE_UNUSED,
935 secondary_reload_info *sri)
936 {
937 enum reg_class rclass = NO_REGS;
938 enum reg_class reload_class = (enum reg_class) reload_class_i;
939
940 if (sri->prev_sri && sri->prev_sri->t_icode != CODE_FOR_nothing)
941 {
942 sri->icode = sri->prev_sri->t_icode;
943 return NO_REGS;
944 }
945 #ifdef SECONDARY_INPUT_RELOAD_CLASS
946 if (in_p)
947 rclass = SECONDARY_INPUT_RELOAD_CLASS (reload_class, reload_mode, x);
948 #endif
949 #ifdef SECONDARY_OUTPUT_RELOAD_CLASS
950 if (! in_p)
951 rclass = SECONDARY_OUTPUT_RELOAD_CLASS (reload_class, reload_mode, x);
952 #endif
953 if (rclass != NO_REGS)
954 {
955 enum insn_code icode
956 = direct_optab_handler (in_p ? reload_in_optab : reload_out_optab,
957 reload_mode);
958
959 if (icode != CODE_FOR_nothing
960 && !insn_operand_matches (icode, in_p, x))
961 icode = CODE_FOR_nothing;
962 else if (icode != CODE_FOR_nothing)
963 {
964 const char *insn_constraint, *scratch_constraint;
965 enum reg_class insn_class, scratch_class;
966
967 gcc_assert (insn_data[(int) icode].n_operands == 3);
968 insn_constraint = insn_data[(int) icode].operand[!in_p].constraint;
969 if (!*insn_constraint)
970 insn_class = ALL_REGS;
971 else
972 {
973 if (in_p)
974 {
975 gcc_assert (*insn_constraint == '=');
976 insn_constraint++;
977 }
978 insn_class = (reg_class_for_constraint
979 (lookup_constraint (insn_constraint)));
980 gcc_assert (insn_class != NO_REGS);
981 }
982
983 scratch_constraint = insn_data[(int) icode].operand[2].constraint;
984 /* The scratch register's constraint must start with "=&",
985 except for an input reload, where only "=" is necessary,
986 and where it might be beneficial to re-use registers from
987 the input. */
988 gcc_assert (scratch_constraint[0] == '='
989 && (in_p || scratch_constraint[1] == '&'));
990 scratch_constraint++;
991 if (*scratch_constraint == '&')
992 scratch_constraint++;
993 scratch_class = (reg_class_for_constraint
994 (lookup_constraint (scratch_constraint)));
995
996 if (reg_class_subset_p (reload_class, insn_class))
997 {
998 gcc_assert (scratch_class == rclass);
999 rclass = NO_REGS;
1000 }
1001 else
1002 rclass = insn_class;
1003
1004 }
1005 if (rclass == NO_REGS)
1006 sri->icode = icode;
1007 else
1008 sri->t_icode = icode;
1009 }
1010 return rclass;
1011 }
1012
1013 /* By default, if flag_pic is true, then neither local nor global relocs
1014 should be placed in readonly memory. */
1015
1016 int
1017 default_reloc_rw_mask (void)
1018 {
1019 return flag_pic ? 3 : 0;
1020 }
1021
1022 /* By default, do no modification. */
1023 tree default_mangle_decl_assembler_name (tree decl ATTRIBUTE_UNUSED,
1024 tree id)
1025 {
1026 return id;
1027 }
1028
1029 /* Default to natural alignment for vector types. */
1030 HOST_WIDE_INT
1031 default_vector_alignment (const_tree type)
1032 {
1033 HOST_WIDE_INT align = tree_to_shwi (TYPE_SIZE (type));
1034 if (align > MAX_OFILE_ALIGNMENT)
1035 align = MAX_OFILE_ALIGNMENT;
1036 return align;
1037 }
1038
1039 bool
1040 default_builtin_vector_alignment_reachable (const_tree type, bool is_packed)
1041 {
1042 if (is_packed)
1043 return false;
1044
1045 /* Assuming that types whose size is > pointer-size are not guaranteed to be
1046 naturally aligned. */
1047 if (tree_int_cst_compare (TYPE_SIZE (type), bitsize_int (POINTER_SIZE)) > 0)
1048 return false;
1049
1050 /* Assuming that types whose size is <= pointer-size
1051 are naturally aligned. */
1052 return true;
1053 }
1054
1055 /* By default, assume that a target supports any factor of misalignment
1056 memory access if it supports movmisalign patten.
1057 is_packed is true if the memory access is defined in a packed struct. */
1058 bool
1059 default_builtin_support_vector_misalignment (machine_mode mode,
1060 const_tree type
1061 ATTRIBUTE_UNUSED,
1062 int misalignment
1063 ATTRIBUTE_UNUSED,
1064 bool is_packed
1065 ATTRIBUTE_UNUSED)
1066 {
1067 if (optab_handler (movmisalign_optab, mode) != CODE_FOR_nothing)
1068 return true;
1069 return false;
1070 }
1071
1072 /* By default, only attempt to parallelize bitwise operations, and
1073 possibly adds/subtracts using bit-twiddling. */
1074
1075 machine_mode
1076 default_preferred_simd_mode (machine_mode mode ATTRIBUTE_UNUSED)
1077 {
1078 return word_mode;
1079 }
1080
1081 /* By default only the size derived from the preferred vector mode
1082 is tried. */
1083
1084 unsigned int
1085 default_autovectorize_vector_sizes (void)
1086 {
1087 return 0;
1088 }
1089
1090 /* By defaults a vector of integers is used as a mask. */
1091
1092 machine_mode
1093 default_get_mask_mode (unsigned nunits, unsigned vector_size)
1094 {
1095 unsigned elem_size = vector_size / nunits;
1096 machine_mode elem_mode
1097 = smallest_mode_for_size (elem_size * BITS_PER_UNIT, MODE_INT);
1098 machine_mode vector_mode;
1099
1100 gcc_assert (elem_size * nunits == vector_size);
1101
1102 vector_mode = mode_for_vector (elem_mode, nunits);
1103 if (!VECTOR_MODE_P (vector_mode)
1104 || !targetm.vector_mode_supported_p (vector_mode))
1105 vector_mode = BLKmode;
1106
1107 return vector_mode;
1108 }
1109
1110 /* By default, the cost model accumulates three separate costs (prologue,
1111 loop body, and epilogue) for a vectorized loop or block. So allocate an
1112 array of three unsigned ints, set it to zero, and return its address. */
1113
1114 void *
1115 default_init_cost (struct loop *loop_info ATTRIBUTE_UNUSED)
1116 {
1117 unsigned *cost = XNEWVEC (unsigned, 3);
1118 cost[vect_prologue] = cost[vect_body] = cost[vect_epilogue] = 0;
1119 return cost;
1120 }
1121
1122 /* By default, the cost model looks up the cost of the given statement
1123 kind and mode, multiplies it by the occurrence count, accumulates
1124 it into the cost specified by WHERE, and returns the cost added. */
1125
1126 unsigned
1127 default_add_stmt_cost (void *data, int count, enum vect_cost_for_stmt kind,
1128 struct _stmt_vec_info *stmt_info, int misalign,
1129 enum vect_cost_model_location where)
1130 {
1131 unsigned *cost = (unsigned *) data;
1132 unsigned retval = 0;
1133
1134 tree vectype = stmt_info ? stmt_vectype (stmt_info) : NULL_TREE;
1135 int stmt_cost = targetm.vectorize.builtin_vectorization_cost (kind, vectype,
1136 misalign);
1137 /* Statements in an inner loop relative to the loop being
1138 vectorized are weighted more heavily. The value here is
1139 arbitrary and could potentially be improved with analysis. */
1140 if (where == vect_body && stmt_info && stmt_in_inner_loop_p (stmt_info))
1141 count *= 50; /* FIXME. */
1142
1143 retval = (unsigned) (count * stmt_cost);
1144 cost[where] += retval;
1145
1146 return retval;
1147 }
1148
1149 /* By default, the cost model just returns the accumulated costs. */
1150
1151 void
1152 default_finish_cost (void *data, unsigned *prologue_cost,
1153 unsigned *body_cost, unsigned *epilogue_cost)
1154 {
1155 unsigned *cost = (unsigned *) data;
1156 *prologue_cost = cost[vect_prologue];
1157 *body_cost = cost[vect_body];
1158 *epilogue_cost = cost[vect_epilogue];
1159 }
1160
1161 /* Free the cost data. */
1162
1163 void
1164 default_destroy_cost_data (void *data)
1165 {
1166 free (data);
1167 }
1168
1169 /* Determine whether or not a pointer mode is valid. Assume defaults
1170 of ptr_mode or Pmode - can be overridden. */
1171 bool
1172 default_valid_pointer_mode (machine_mode mode)
1173 {
1174 return (mode == ptr_mode || mode == Pmode);
1175 }
1176
1177 /* Determine whether the memory reference specified by REF may alias
1178 the C libraries errno location. */
1179 bool
1180 default_ref_may_alias_errno (ao_ref *ref)
1181 {
1182 tree base = ao_ref_base (ref);
1183 /* The default implementation assumes the errno location is
1184 a declaration of type int or is always accessed via a
1185 pointer to int. We assume that accesses to errno are
1186 not deliberately obfuscated (even in conforming ways). */
1187 if (TYPE_UNSIGNED (TREE_TYPE (base))
1188 || TYPE_MODE (TREE_TYPE (base)) != TYPE_MODE (integer_type_node))
1189 return false;
1190 /* The default implementation assumes an errno location
1191 declaration is never defined in the current compilation unit. */
1192 if (DECL_P (base)
1193 && !TREE_STATIC (base))
1194 return true;
1195 else if (TREE_CODE (base) == MEM_REF
1196 && TREE_CODE (TREE_OPERAND (base, 0)) == SSA_NAME)
1197 {
1198 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (TREE_OPERAND (base, 0));
1199 return !pi || pi->pt.anything || pi->pt.nonlocal;
1200 }
1201 return false;
1202 }
1203
1204 /* Return the mode for a pointer to a given ADDRSPACE,
1205 defaulting to ptr_mode for all address spaces. */
1206
1207 machine_mode
1208 default_addr_space_pointer_mode (addr_space_t addrspace ATTRIBUTE_UNUSED)
1209 {
1210 return ptr_mode;
1211 }
1212
1213 /* Return the mode for an address in a given ADDRSPACE,
1214 defaulting to Pmode for all address spaces. */
1215
1216 machine_mode
1217 default_addr_space_address_mode (addr_space_t addrspace ATTRIBUTE_UNUSED)
1218 {
1219 return Pmode;
1220 }
1221
1222 /* Named address space version of valid_pointer_mode.
1223 To match the above, the same modes apply to all address spaces. */
1224
1225 bool
1226 default_addr_space_valid_pointer_mode (machine_mode mode,
1227 addr_space_t as ATTRIBUTE_UNUSED)
1228 {
1229 return targetm.valid_pointer_mode (mode);
1230 }
1231
1232 /* Some places still assume that all pointer or address modes are the
1233 standard Pmode and ptr_mode. These optimizations become invalid if
1234 the target actually supports multiple different modes. For now,
1235 we disable such optimizations on such targets, using this function. */
1236
1237 bool
1238 target_default_pointer_address_modes_p (void)
1239 {
1240 if (targetm.addr_space.address_mode != default_addr_space_address_mode)
1241 return false;
1242 if (targetm.addr_space.pointer_mode != default_addr_space_pointer_mode)
1243 return false;
1244
1245 return true;
1246 }
1247
1248 /* Named address space version of legitimate_address_p.
1249 By default, all address spaces have the same form. */
1250
1251 bool
1252 default_addr_space_legitimate_address_p (machine_mode mode, rtx mem,
1253 bool strict,
1254 addr_space_t as ATTRIBUTE_UNUSED)
1255 {
1256 return targetm.legitimate_address_p (mode, mem, strict);
1257 }
1258
1259 /* Named address space version of LEGITIMIZE_ADDRESS.
1260 By default, all address spaces have the same form. */
1261
1262 rtx
1263 default_addr_space_legitimize_address (rtx x, rtx oldx, machine_mode mode,
1264 addr_space_t as ATTRIBUTE_UNUSED)
1265 {
1266 return targetm.legitimize_address (x, oldx, mode);
1267 }
1268
1269 /* The default hook for determining if one named address space is a subset of
1270 another and to return which address space to use as the common address
1271 space. */
1272
1273 bool
1274 default_addr_space_subset_p (addr_space_t subset, addr_space_t superset)
1275 {
1276 return (subset == superset);
1277 }
1278
1279 /* The default hook for determining if 0 within a named address
1280 space is a valid address. */
1281
1282 bool
1283 default_addr_space_zero_address_valid (addr_space_t as ATTRIBUTE_UNUSED)
1284 {
1285 return false;
1286 }
1287
1288 /* The default hook for debugging the address space is to return the
1289 address space number to indicate DW_AT_address_class. */
1290 int
1291 default_addr_space_debug (addr_space_t as)
1292 {
1293 return as;
1294 }
1295
1296 /* The default hook implementation for TARGET_ADDR_SPACE_DIAGNOSE_USAGE.
1297 Don't complain about any address space. */
1298
1299 void
1300 default_addr_space_diagnose_usage (addr_space_t, location_t)
1301 {
1302 }
1303
1304
1305 /* The default hook for TARGET_ADDR_SPACE_CONVERT. This hook should never be
1306 called for targets with only a generic address space. */
1307
1308 rtx
1309 default_addr_space_convert (rtx op ATTRIBUTE_UNUSED,
1310 tree from_type ATTRIBUTE_UNUSED,
1311 tree to_type ATTRIBUTE_UNUSED)
1312 {
1313 gcc_unreachable ();
1314 }
1315
1316 bool
1317 default_hard_regno_scratch_ok (unsigned int regno ATTRIBUTE_UNUSED)
1318 {
1319 return true;
1320 }
1321
1322 /* The default implementation of TARGET_MODE_DEPENDENT_ADDRESS_P. */
1323
1324 bool
1325 default_mode_dependent_address_p (const_rtx addr ATTRIBUTE_UNUSED,
1326 addr_space_t addrspace ATTRIBUTE_UNUSED)
1327 {
1328 return false;
1329 }
1330
1331 bool
1332 default_target_option_valid_attribute_p (tree ARG_UNUSED (fndecl),
1333 tree ARG_UNUSED (name),
1334 tree ARG_UNUSED (args),
1335 int ARG_UNUSED (flags))
1336 {
1337 warning (OPT_Wattributes,
1338 "target attribute is not supported on this machine");
1339
1340 return false;
1341 }
1342
1343 bool
1344 default_target_option_pragma_parse (tree ARG_UNUSED (args),
1345 tree ARG_UNUSED (pop_target))
1346 {
1347 /* If args is NULL the caller is handle_pragma_pop_options (). In that case,
1348 emit no warning because "#pragma GCC pop_target" is valid on targets that
1349 do not have the "target" pragma. */
1350 if (args)
1351 warning (OPT_Wpragmas,
1352 "#pragma GCC target is not supported for this machine");
1353
1354 return false;
1355 }
1356
1357 bool
1358 default_target_can_inline_p (tree caller, tree callee)
1359 {
1360 bool ret = false;
1361 tree callee_opts = DECL_FUNCTION_SPECIFIC_TARGET (callee);
1362 tree caller_opts = DECL_FUNCTION_SPECIFIC_TARGET (caller);
1363
1364 /* If callee has no option attributes, then it is ok to inline */
1365 if (!callee_opts)
1366 ret = true;
1367
1368 /* If caller has no option attributes, but callee does then it is not ok to
1369 inline */
1370 else if (!caller_opts)
1371 ret = false;
1372
1373 /* If both caller and callee have attributes, assume that if the
1374 pointer is different, the two functions have different target
1375 options since build_target_option_node uses a hash table for the
1376 options. */
1377 else
1378 ret = (callee_opts == caller_opts);
1379
1380 return ret;
1381 }
1382
1383 /* If the machine does not have a case insn that compares the bounds,
1384 this means extra overhead for dispatch tables, which raises the
1385 threshold for using them. */
1386
1387 unsigned int
1388 default_case_values_threshold (void)
1389 {
1390 return (targetm.have_casesi () ? 4 : 5);
1391 }
1392
1393 bool
1394 default_have_conditional_execution (void)
1395 {
1396 return HAVE_conditional_execution;
1397 }
1398
1399 /* By default we assume that c99 functions are present at the runtime,
1400 but sincos is not. */
1401 bool
1402 default_libc_has_function (enum function_class fn_class)
1403 {
1404 if (fn_class == function_c94
1405 || fn_class == function_c99_misc
1406 || fn_class == function_c99_math_complex)
1407 return true;
1408
1409 return false;
1410 }
1411
1412 bool
1413 gnu_libc_has_function (enum function_class fn_class ATTRIBUTE_UNUSED)
1414 {
1415 return true;
1416 }
1417
1418 bool
1419 no_c99_libc_has_function (enum function_class fn_class ATTRIBUTE_UNUSED)
1420 {
1421 return false;
1422 }
1423
1424 tree
1425 default_builtin_tm_load_store (tree ARG_UNUSED (type))
1426 {
1427 return NULL_TREE;
1428 }
1429
1430 /* Compute cost of moving registers to/from memory. */
1431
1432 int
1433 default_memory_move_cost (machine_mode mode ATTRIBUTE_UNUSED,
1434 reg_class_t rclass ATTRIBUTE_UNUSED,
1435 bool in ATTRIBUTE_UNUSED)
1436 {
1437 #ifndef MEMORY_MOVE_COST
1438 return (4 + memory_move_secondary_cost (mode, (enum reg_class) rclass, in));
1439 #else
1440 return MEMORY_MOVE_COST (mode, (enum reg_class) rclass, in);
1441 #endif
1442 }
1443
1444 /* Compute cost of moving data from a register of class FROM to one of
1445 TO, using MODE. */
1446
1447 int
1448 default_register_move_cost (machine_mode mode ATTRIBUTE_UNUSED,
1449 reg_class_t from ATTRIBUTE_UNUSED,
1450 reg_class_t to ATTRIBUTE_UNUSED)
1451 {
1452 #ifndef REGISTER_MOVE_COST
1453 return 2;
1454 #else
1455 return REGISTER_MOVE_COST (mode, (enum reg_class) from, (enum reg_class) to);
1456 #endif
1457 }
1458
1459 /* For hooks which use the MOVE_RATIO macro, this gives the legacy default
1460 behavior. SPEED_P is true if we are compiling for speed. */
1461
1462 unsigned int
1463 get_move_ratio (bool speed_p ATTRIBUTE_UNUSED)
1464 {
1465 unsigned int move_ratio;
1466 #ifdef MOVE_RATIO
1467 move_ratio = (unsigned int) MOVE_RATIO (speed_p);
1468 #else
1469 #if defined (HAVE_movmemqi) || defined (HAVE_movmemhi) || defined (HAVE_movmemsi) || defined (HAVE_movmemdi) || defined (HAVE_movmemti)
1470 move_ratio = 2;
1471 #else /* No movmem patterns, pick a default. */
1472 move_ratio = ((speed_p) ? 15 : 3);
1473 #endif
1474 #endif
1475 return move_ratio;
1476 }
1477
1478 /* Return TRUE if the move_by_pieces/set_by_pieces infrastructure should be
1479 used; return FALSE if the movmem/setmem optab should be expanded, or
1480 a call to memcpy emitted. */
1481
1482 bool
1483 default_use_by_pieces_infrastructure_p (unsigned HOST_WIDE_INT size,
1484 unsigned int alignment,
1485 enum by_pieces_operation op,
1486 bool speed_p)
1487 {
1488 unsigned int max_size = 0;
1489 unsigned int ratio = 0;
1490
1491 switch (op)
1492 {
1493 case CLEAR_BY_PIECES:
1494 max_size = STORE_MAX_PIECES;
1495 ratio = CLEAR_RATIO (speed_p);
1496 break;
1497 case MOVE_BY_PIECES:
1498 max_size = MOVE_MAX_PIECES;
1499 ratio = get_move_ratio (speed_p);
1500 break;
1501 case SET_BY_PIECES:
1502 max_size = STORE_MAX_PIECES;
1503 ratio = SET_RATIO (speed_p);
1504 break;
1505 case STORE_BY_PIECES:
1506 max_size = STORE_MAX_PIECES;
1507 ratio = get_move_ratio (speed_p);
1508 break;
1509 case COMPARE_BY_PIECES:
1510 max_size = COMPARE_MAX_PIECES;
1511 /* Pick a likely default, just as in get_move_ratio. */
1512 ratio = speed_p ? 15 : 3;
1513 break;
1514 }
1515
1516 return by_pieces_ninsns (size, alignment, max_size + 1, op) < ratio;
1517 }
1518
1519 /* This hook controls code generation for expanding a memcmp operation by
1520 pieces. Return 1 for the normal pattern of compare/jump after each pair
1521 of loads, or a higher number to reduce the number of branches. */
1522
1523 int
1524 default_compare_by_pieces_branch_ratio (machine_mode)
1525 {
1526 return 1;
1527 }
1528
1529 bool
1530 default_profile_before_prologue (void)
1531 {
1532 #ifdef PROFILE_BEFORE_PROLOGUE
1533 return true;
1534 #else
1535 return false;
1536 #endif
1537 }
1538
1539 /* The default implementation of TARGET_PREFERRED_RELOAD_CLASS. */
1540
1541 reg_class_t
1542 default_preferred_reload_class (rtx x ATTRIBUTE_UNUSED,
1543 reg_class_t rclass)
1544 {
1545 #ifdef PREFERRED_RELOAD_CLASS
1546 return (reg_class_t) PREFERRED_RELOAD_CLASS (x, (enum reg_class) rclass);
1547 #else
1548 return rclass;
1549 #endif
1550 }
1551
1552 /* The default implementation of TARGET_OUTPUT_PREFERRED_RELOAD_CLASS. */
1553
1554 reg_class_t
1555 default_preferred_output_reload_class (rtx x ATTRIBUTE_UNUSED,
1556 reg_class_t rclass)
1557 {
1558 return rclass;
1559 }
1560
1561 /* The default implementation of TARGET_PREFERRED_RENAME_CLASS. */
1562 reg_class_t
1563 default_preferred_rename_class (reg_class_t rclass ATTRIBUTE_UNUSED)
1564 {
1565 return NO_REGS;
1566 }
1567
1568 /* The default implementation of TARGET_CLASS_LIKELY_SPILLED_P. */
1569
1570 bool
1571 default_class_likely_spilled_p (reg_class_t rclass)
1572 {
1573 return (reg_class_size[(int) rclass] == 1);
1574 }
1575
1576 /* The default implementation of TARGET_CLASS_MAX_NREGS. */
1577
1578 unsigned char
1579 default_class_max_nregs (reg_class_t rclass ATTRIBUTE_UNUSED,
1580 machine_mode mode ATTRIBUTE_UNUSED)
1581 {
1582 #ifdef CLASS_MAX_NREGS
1583 return (unsigned char) CLASS_MAX_NREGS ((enum reg_class) rclass, mode);
1584 #else
1585 return ((GET_MODE_SIZE (mode) + UNITS_PER_WORD - 1) / UNITS_PER_WORD);
1586 #endif
1587 }
1588
1589 /* Determine the debugging unwind mechanism for the target. */
1590
1591 enum unwind_info_type
1592 default_debug_unwind_info (void)
1593 {
1594 /* If the target wants to force the use of dwarf2 unwind info, let it. */
1595 /* ??? Change all users to the hook, then poison this. */
1596 #ifdef DWARF2_FRAME_INFO
1597 if (DWARF2_FRAME_INFO)
1598 return UI_DWARF2;
1599 #endif
1600
1601 /* Otherwise, only turn it on if dwarf2 debugging is enabled. */
1602 #ifdef DWARF2_DEBUGGING_INFO
1603 if (write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
1604 return UI_DWARF2;
1605 #endif
1606
1607 return UI_NONE;
1608 }
1609
1610 /* Determine the correct mode for a Dwarf frame register that represents
1611 register REGNO. */
1612
1613 machine_mode
1614 default_dwarf_frame_reg_mode (int regno)
1615 {
1616 machine_mode save_mode = reg_raw_mode[regno];
1617
1618 if (HARD_REGNO_CALL_PART_CLOBBERED (regno, save_mode))
1619 save_mode = choose_hard_reg_mode (regno, 1, true);
1620 return save_mode;
1621 }
1622
1623 /* To be used by targets where reg_raw_mode doesn't return the right
1624 mode for registers used in apply_builtin_return and apply_builtin_arg. */
1625
1626 machine_mode
1627 default_get_reg_raw_mode (int regno)
1628 {
1629 return reg_raw_mode[regno];
1630 }
1631
1632 /* Return true if a leaf function should stay leaf even with profiling
1633 enabled. */
1634
1635 bool
1636 default_keep_leaf_when_profiled ()
1637 {
1638 return false;
1639 }
1640
1641 /* Return true if the state of option OPTION should be stored in PCH files
1642 and checked by default_pch_valid_p. Store the option's current state
1643 in STATE if so. */
1644
1645 static inline bool
1646 option_affects_pch_p (int option, struct cl_option_state *state)
1647 {
1648 if ((cl_options[option].flags & CL_TARGET) == 0)
1649 return false;
1650 if ((cl_options[option].flags & CL_PCH_IGNORE) != 0)
1651 return false;
1652 if (option_flag_var (option, &global_options) == &target_flags)
1653 if (targetm.check_pch_target_flags)
1654 return false;
1655 return get_option_state (&global_options, option, state);
1656 }
1657
1658 /* Default version of get_pch_validity.
1659 By default, every flag difference is fatal; that will be mostly right for
1660 most targets, but completely right for very few. */
1661
1662 void *
1663 default_get_pch_validity (size_t *sz)
1664 {
1665 struct cl_option_state state;
1666 size_t i;
1667 char *result, *r;
1668
1669 *sz = 2;
1670 if (targetm.check_pch_target_flags)
1671 *sz += sizeof (target_flags);
1672 for (i = 0; i < cl_options_count; i++)
1673 if (option_affects_pch_p (i, &state))
1674 *sz += state.size;
1675
1676 result = r = XNEWVEC (char, *sz);
1677 r[0] = flag_pic;
1678 r[1] = flag_pie;
1679 r += 2;
1680 if (targetm.check_pch_target_flags)
1681 {
1682 memcpy (r, &target_flags, sizeof (target_flags));
1683 r += sizeof (target_flags);
1684 }
1685
1686 for (i = 0; i < cl_options_count; i++)
1687 if (option_affects_pch_p (i, &state))
1688 {
1689 memcpy (r, state.data, state.size);
1690 r += state.size;
1691 }
1692
1693 return result;
1694 }
1695
1696 /* Return a message which says that a PCH file was created with a different
1697 setting of OPTION. */
1698
1699 static const char *
1700 pch_option_mismatch (const char *option)
1701 {
1702 return xasprintf (_("created and used with differing settings of '%s'"),
1703 option);
1704 }
1705
1706 /* Default version of pch_valid_p. */
1707
1708 const char *
1709 default_pch_valid_p (const void *data_p, size_t len)
1710 {
1711 struct cl_option_state state;
1712 const char *data = (const char *)data_p;
1713 size_t i;
1714
1715 /* -fpic and -fpie also usually make a PCH invalid. */
1716 if (data[0] != flag_pic)
1717 return _("created and used with different settings of -fpic");
1718 if (data[1] != flag_pie)
1719 return _("created and used with different settings of -fpie");
1720 data += 2;
1721
1722 /* Check target_flags. */
1723 if (targetm.check_pch_target_flags)
1724 {
1725 int tf;
1726 const char *r;
1727
1728 memcpy (&tf, data, sizeof (target_flags));
1729 data += sizeof (target_flags);
1730 len -= sizeof (target_flags);
1731 r = targetm.check_pch_target_flags (tf);
1732 if (r != NULL)
1733 return r;
1734 }
1735
1736 for (i = 0; i < cl_options_count; i++)
1737 if (option_affects_pch_p (i, &state))
1738 {
1739 if (memcmp (data, state.data, state.size) != 0)
1740 return pch_option_mismatch (cl_options[i].opt_text);
1741 data += state.size;
1742 len -= state.size;
1743 }
1744
1745 return NULL;
1746 }
1747
1748 /* Default version of cstore_mode. */
1749
1750 machine_mode
1751 default_cstore_mode (enum insn_code icode)
1752 {
1753 return insn_data[(int) icode].operand[0].mode;
1754 }
1755
1756 /* Default version of member_type_forces_blk. */
1757
1758 bool
1759 default_member_type_forces_blk (const_tree, machine_mode)
1760 {
1761 return false;
1762 }
1763
1764 rtx
1765 default_load_bounds_for_arg (rtx addr ATTRIBUTE_UNUSED,
1766 rtx ptr ATTRIBUTE_UNUSED,
1767 rtx bnd ATTRIBUTE_UNUSED)
1768 {
1769 gcc_unreachable ();
1770 }
1771
1772 void
1773 default_store_bounds_for_arg (rtx val ATTRIBUTE_UNUSED,
1774 rtx addr ATTRIBUTE_UNUSED,
1775 rtx bounds ATTRIBUTE_UNUSED,
1776 rtx to ATTRIBUTE_UNUSED)
1777 {
1778 gcc_unreachable ();
1779 }
1780
1781 rtx
1782 default_load_returned_bounds (rtx slot ATTRIBUTE_UNUSED)
1783 {
1784 gcc_unreachable ();
1785 }
1786
1787 void
1788 default_store_returned_bounds (rtx slot ATTRIBUTE_UNUSED,
1789 rtx bounds ATTRIBUTE_UNUSED)
1790 {
1791 gcc_unreachable ();
1792 }
1793
1794 /* Default version of canonicalize_comparison. */
1795
1796 void
1797 default_canonicalize_comparison (int *, rtx *, rtx *, bool)
1798 {
1799 }
1800
1801 /* Default implementation of TARGET_ATOMIC_ASSIGN_EXPAND_FENV. */
1802
1803 void
1804 default_atomic_assign_expand_fenv (tree *, tree *, tree *)
1805 {
1806 }
1807
1808 #ifndef PAD_VARARGS_DOWN
1809 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
1810 #endif
1811
1812 /* Build an indirect-ref expression over the given TREE, which represents a
1813 piece of a va_arg() expansion. */
1814 tree
1815 build_va_arg_indirect_ref (tree addr)
1816 {
1817 addr = build_simple_mem_ref_loc (EXPR_LOCATION (addr), addr);
1818 return addr;
1819 }
1820
1821 /* The "standard" implementation of va_arg: read the value from the
1822 current (padded) address and increment by the (padded) size. */
1823
1824 tree
1825 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
1826 gimple_seq *post_p)
1827 {
1828 tree addr, t, type_size, rounded_size, valist_tmp;
1829 unsigned HOST_WIDE_INT align, boundary;
1830 bool indirect;
1831
1832 /* All of the alignment and movement below is for args-grow-up machines.
1833 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
1834 implement their own specialized gimplify_va_arg_expr routines. */
1835 if (ARGS_GROW_DOWNWARD)
1836 gcc_unreachable ();
1837
1838 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
1839 if (indirect)
1840 type = build_pointer_type (type);
1841
1842 align = PARM_BOUNDARY / BITS_PER_UNIT;
1843 boundary = targetm.calls.function_arg_boundary (TYPE_MODE (type), type);
1844
1845 /* When we align parameter on stack for caller, if the parameter
1846 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
1847 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
1848 here with caller. */
1849 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
1850 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
1851
1852 boundary /= BITS_PER_UNIT;
1853
1854 /* Hoist the valist value into a temporary for the moment. */
1855 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
1856
1857 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
1858 requires greater alignment, we must perform dynamic alignment. */
1859 if (boundary > align
1860 && !integer_zerop (TYPE_SIZE (type)))
1861 {
1862 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
1863 fold_build_pointer_plus_hwi (valist_tmp, boundary - 1));
1864 gimplify_and_add (t, pre_p);
1865
1866 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
1867 fold_build2 (BIT_AND_EXPR, TREE_TYPE (valist),
1868 valist_tmp,
1869 build_int_cst (TREE_TYPE (valist), -boundary)));
1870 gimplify_and_add (t, pre_p);
1871 }
1872 else
1873 boundary = align;
1874
1875 /* If the actual alignment is less than the alignment of the type,
1876 adjust the type accordingly so that we don't assume strict alignment
1877 when dereferencing the pointer. */
1878 boundary *= BITS_PER_UNIT;
1879 if (boundary < TYPE_ALIGN (type))
1880 {
1881 type = build_variant_type_copy (type);
1882 SET_TYPE_ALIGN (type, boundary);
1883 }
1884
1885 /* Compute the rounded size of the type. */
1886 type_size = size_in_bytes (type);
1887 rounded_size = round_up (type_size, align);
1888
1889 /* Reduce rounded_size so it's sharable with the postqueue. */
1890 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
1891
1892 /* Get AP. */
1893 addr = valist_tmp;
1894 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
1895 {
1896 /* Small args are padded downward. */
1897 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
1898 rounded_size, size_int (align));
1899 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
1900 size_binop (MINUS_EXPR, rounded_size, type_size));
1901 addr = fold_build_pointer_plus (addr, t);
1902 }
1903
1904 /* Compute new value for AP. */
1905 t = fold_build_pointer_plus (valist_tmp, rounded_size);
1906 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
1907 gimplify_and_add (t, pre_p);
1908
1909 addr = fold_convert (build_pointer_type (type), addr);
1910
1911 if (indirect)
1912 addr = build_va_arg_indirect_ref (addr);
1913
1914 return build_va_arg_indirect_ref (addr);
1915 }
1916
1917 tree
1918 default_chkp_bound_type (void)
1919 {
1920 tree res = make_node (POINTER_BOUNDS_TYPE);
1921 TYPE_PRECISION (res) = TYPE_PRECISION (size_type_node) * 2;
1922 TYPE_NAME (res) = get_identifier ("__bounds_type");
1923 SET_TYPE_MODE (res, targetm.chkp_bound_mode ());
1924 layout_type (res);
1925 return res;
1926 }
1927
1928 enum machine_mode
1929 default_chkp_bound_mode (void)
1930 {
1931 return VOIDmode;
1932 }
1933
1934 tree
1935 default_builtin_chkp_function (unsigned int fcode ATTRIBUTE_UNUSED)
1936 {
1937 return NULL_TREE;
1938 }
1939
1940 rtx
1941 default_chkp_function_value_bounds (const_tree ret_type ATTRIBUTE_UNUSED,
1942 const_tree fn_decl_or_type ATTRIBUTE_UNUSED,
1943 bool outgoing ATTRIBUTE_UNUSED)
1944 {
1945 gcc_unreachable ();
1946 }
1947
1948 tree
1949 default_chkp_make_bounds_constant (HOST_WIDE_INT lb ATTRIBUTE_UNUSED,
1950 HOST_WIDE_INT ub ATTRIBUTE_UNUSED)
1951 {
1952 return NULL_TREE;
1953 }
1954
1955 int
1956 default_chkp_initialize_bounds (tree var ATTRIBUTE_UNUSED,
1957 tree lb ATTRIBUTE_UNUSED,
1958 tree ub ATTRIBUTE_UNUSED,
1959 tree *stmts ATTRIBUTE_UNUSED)
1960 {
1961 return 0;
1962 }
1963
1964 void
1965 default_setup_incoming_vararg_bounds (cumulative_args_t ca ATTRIBUTE_UNUSED,
1966 enum machine_mode mode ATTRIBUTE_UNUSED,
1967 tree type ATTRIBUTE_UNUSED,
1968 int *pretend_arg_size ATTRIBUTE_UNUSED,
1969 int second_time ATTRIBUTE_UNUSED)
1970 {
1971 }
1972
1973 /* An implementation of TARGET_CAN_USE_DOLOOP_P for targets that do
1974 not support nested low-overhead loops. */
1975
1976 bool
1977 can_use_doloop_if_innermost (const widest_int &, const widest_int &,
1978 unsigned int loop_depth, bool)
1979 {
1980 return loop_depth == 1;
1981 }
1982
1983 /* Default implementation of TARGET_OPTAB_SUPPORTED_P. */
1984
1985 bool
1986 default_optab_supported_p (int, machine_mode, machine_mode, optimization_type)
1987 {
1988 return true;
1989 }
1990
1991 /* Default implementation of TARGET_MAX_NOCE_IFCVT_SEQ_COST. */
1992
1993 unsigned int
1994 default_max_noce_ifcvt_seq_cost (edge e)
1995 {
1996 bool predictable_p = predictable_edge_p (e);
1997
1998 enum compiler_param param
1999 = (predictable_p
2000 ? PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST
2001 : PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST);
2002
2003 /* If we have a parameter set, use that, otherwise take a guess using
2004 BRANCH_COST. */
2005 if (global_options_set.x_param_values[param])
2006 return PARAM_VALUE (param);
2007 else
2008 return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3);
2009 }
2010
2011 #include "gt-targhooks.h"