1 /* Subroutines used for code generation on Renesas RX processors.
2 Copyright (C) 2008-2017 Free Software Foundation, Inc.
3 Contributed by Red Hat.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 * Re-enable memory-to-memory copies and fix up reload. */
27 #include "coretypes.h"
32 #include "stringpool.h"
40 #include "diagnostic-core.h"
42 #include "stor-layout.h"
49 #include "langhooks.h"
53 /* This file should be included last. */
54 #include "target-def.h"
56 static unsigned int rx_gp_base_regnum_val
= INVALID_REGNUM
;
57 static unsigned int rx_pid_base_regnum_val
= INVALID_REGNUM
;
58 static unsigned int rx_num_interrupt_regs
;
61 rx_gp_base_regnum (void)
63 if (rx_gp_base_regnum_val
== INVALID_REGNUM
)
65 return rx_gp_base_regnum_val
;
69 rx_pid_base_regnum (void)
71 if (rx_pid_base_regnum_val
== INVALID_REGNUM
)
73 return rx_pid_base_regnum_val
;
76 /* Find a SYMBOL_REF in a "standard" MEM address and return its decl. */
79 rx_decl_for_addr (rtx op
)
81 if (GET_CODE (op
) == MEM
)
83 if (GET_CODE (op
) == CONST
)
85 while (GET_CODE (op
) == PLUS
)
87 if (GET_CODE (op
) == SYMBOL_REF
)
88 return SYMBOL_REF_DECL (op
);
92 static void rx_print_operand (FILE *, rtx
, int);
94 #define CC_FLAG_S (1 << 0)
95 #define CC_FLAG_Z (1 << 1)
96 #define CC_FLAG_O (1 << 2)
97 #define CC_FLAG_C (1 << 3)
98 #define CC_FLAG_FP (1 << 4) /* Fake, to differentiate CC_Fmode. */
100 static unsigned int flags_from_mode (machine_mode mode
);
101 static unsigned int flags_from_code (enum rtx_code code
);
103 /* Return true if OP is a reference to an object in a PID data area. */
107 PID_NOT_PID
= 0, /* The object is not in the PID data area. */
108 PID_ENCODED
, /* The object is in the PID data area. */
109 PID_UNENCODED
/* The object will be placed in the PID data area, but it has not been placed there yet. */
113 rx_pid_data_operand (rtx op
)
120 if (GET_CODE (op
) == PLUS
121 && GET_CODE (XEXP (op
, 0)) == REG
122 && GET_CODE (XEXP (op
, 1)) == CONST
123 && GET_CODE (XEXP (XEXP (op
, 1), 0)) == UNSPEC
)
126 op_decl
= rx_decl_for_addr (op
);
130 if (TREE_READONLY (op_decl
))
131 return PID_UNENCODED
;
135 /* Sigh, some special cases. */
136 if (GET_CODE (op
) == SYMBOL_REF
137 || GET_CODE (op
) == LABEL_REF
)
138 return PID_UNENCODED
;
145 rx_legitimize_address (rtx x
,
146 rtx oldx ATTRIBUTE_UNUSED
,
147 machine_mode mode ATTRIBUTE_UNUSED
)
149 if (rx_pid_data_operand (x
) == PID_UNENCODED
)
151 rtx rv
= gen_pid_addr (gen_rtx_REG (SImode
, rx_pid_base_regnum ()), x
);
155 if (GET_CODE (x
) == PLUS
156 && GET_CODE (XEXP (x
, 0)) == PLUS
157 && REG_P (XEXP (XEXP (x
, 0), 0))
158 && REG_P (XEXP (x
, 1)))
159 return force_reg (SImode
, x
);
164 /* Return true if OP is a reference to an object in a small data area. */
167 rx_small_data_operand (rtx op
)
169 if (rx_small_data_limit
== 0)
172 if (GET_CODE (op
) == SYMBOL_REF
)
173 return SYMBOL_REF_SMALL_P (op
);
179 rx_is_legitimate_address (machine_mode mode
, rtx x
,
180 bool strict ATTRIBUTE_UNUSED
)
182 if (RTX_OK_FOR_BASE (x
, strict
))
183 /* Register Indirect. */
186 if ((GET_MODE_SIZE (mode
) == 4
187 || GET_MODE_SIZE (mode
) == 2
188 || GET_MODE_SIZE (mode
) == 1)
189 && (GET_CODE (x
) == PRE_DEC
|| GET_CODE (x
) == POST_INC
))
190 /* Pre-decrement Register Indirect or
191 Post-increment Register Indirect. */
192 return RTX_OK_FOR_BASE (XEXP (x
, 0), strict
);
194 switch (rx_pid_data_operand (x
))
204 if (GET_CODE (x
) == PLUS
)
206 rtx arg1
= XEXP (x
, 0);
207 rtx arg2
= XEXP (x
, 1);
208 rtx index
= NULL_RTX
;
210 if (REG_P (arg1
) && RTX_OK_FOR_BASE (arg1
, strict
))
212 else if (REG_P (arg2
) && RTX_OK_FOR_BASE (arg2
, strict
))
217 switch (GET_CODE (index
))
221 /* Register Relative: REG + INT.
222 Only positive, mode-aligned, mode-sized
223 displacements are allowed. */
224 HOST_WIDE_INT val
= INTVAL (index
);
230 switch (GET_MODE_SIZE (mode
))
233 case 4: factor
= 4; break;
234 case 2: factor
= 2; break;
235 case 1: factor
= 1; break;
238 if (val
> (65535 * factor
))
240 return (val
% factor
) == 0;
244 /* Unscaled Indexed Register Indirect: REG + REG
245 Size has to be "QI", REG has to be valid. */
246 return GET_MODE_SIZE (mode
) == 1 && RTX_OK_FOR_BASE (index
, strict
);
250 /* Scaled Indexed Register Indirect: REG + (REG * FACTOR)
251 Factor has to equal the mode size, REG has to be valid. */
254 factor
= XEXP (index
, 1);
255 index
= XEXP (index
, 0);
258 && RTX_OK_FOR_BASE (index
, strict
)
259 && CONST_INT_P (factor
)
260 && GET_MODE_SIZE (mode
) == INTVAL (factor
);
268 /* Small data area accesses turn into register relative offsets. */
269 return rx_small_data_operand (x
);
272 /* Returns TRUE for simple memory addresses, ie ones
273 that do not involve register indirect addressing
274 or pre/post increment/decrement. */
277 rx_is_restricted_memory_address (rtx mem
, machine_mode mode
)
279 if (! rx_is_legitimate_address
280 (mode
, mem
, reload_in_progress
|| reload_completed
))
283 switch (GET_CODE (mem
))
286 /* Simple memory addresses are OK. */
297 /* Only allow REG+INT addressing. */
298 base
= XEXP (mem
, 0);
299 index
= XEXP (mem
, 1);
301 if (! RX_REG_P (base
) || ! CONST_INT_P (index
))
304 return IN_RANGE (INTVAL (index
), 0, (0x10000 * GET_MODE_SIZE (mode
)) - 1);
308 /* Can happen when small data is being supported.
309 Assume that it will be resolved into GP+INT. */
317 /* Implement TARGET_MODE_DEPENDENT_ADDRESS_P. */
320 rx_mode_dependent_address_p (const_rtx addr
, addr_space_t as ATTRIBUTE_UNUSED
)
322 if (GET_CODE (addr
) == CONST
)
323 addr
= XEXP (addr
, 0);
325 switch (GET_CODE (addr
))
327 /* --REG and REG++ only work in SImode. */
334 if (! REG_P (XEXP (addr
, 0)))
337 addr
= XEXP (addr
, 1);
339 switch (GET_CODE (addr
))
342 /* REG+REG only works in SImode. */
346 /* REG+INT is only mode independent if INT is a
347 multiple of 4, positive and will fit into 16-bits. */
348 if (((INTVAL (addr
) & 3) == 0)
349 && IN_RANGE (INTVAL (addr
), 4, 0xfffc))
358 /* REG+REG*SCALE is always mode dependent. */
362 /* Not recognized, so treat as mode dependent. */
370 /* These are all mode independent. */
374 /* Everything else is unrecognized,
375 so treat as mode dependent. */
380 /* A C compound statement to output to stdio stream FILE the
381 assembler syntax for an instruction operand that is a memory
382 reference whose address is ADDR. */
385 rx_print_operand_address (FILE * file
, machine_mode
/*mode*/, rtx addr
)
387 switch (GET_CODE (addr
))
391 rx_print_operand (file
, addr
, 0);
396 fprintf (file
, "[-");
397 rx_print_operand (file
, XEXP (addr
, 0), 0);
403 rx_print_operand (file
, XEXP (addr
, 0), 0);
404 fprintf (file
, "+]");
409 rtx arg1
= XEXP (addr
, 0);
410 rtx arg2
= XEXP (addr
, 1);
413 if (REG_P (arg1
) && RTX_OK_FOR_BASE (arg1
, true))
414 base
= arg1
, index
= arg2
;
415 else if (REG_P (arg2
) && RTX_OK_FOR_BASE (arg2
, true))
416 base
= arg2
, index
= arg1
;
419 rx_print_operand (file
, arg1
, 0);
420 fprintf (file
, " + ");
421 rx_print_operand (file
, arg2
, 0);
425 if (REG_P (index
) || GET_CODE (index
) == MULT
)
428 rx_print_operand (file
, index
, 'A');
431 else /* GET_CODE (index) == CONST_INT */
433 rx_print_operand (file
, index
, 'A');
436 rx_print_operand (file
, base
, 0);
442 if (GET_CODE (XEXP (addr
, 0)) == UNSPEC
)
444 addr
= XEXP (addr
, 0);
445 gcc_assert (XINT (addr
, 1) == UNSPEC_CONST
);
447 addr
= XVECEXP (addr
, 0, 0);
448 gcc_assert (CONST_INT_P (addr
));
450 output_addr_const (file
, addr
);
454 output_addr_const (file
, XEXP (addr
, 0));
458 addr
= XVECEXP (addr
, 0, 0);
465 output_addr_const (file
, addr
);
471 rx_print_integer (FILE * file
, HOST_WIDE_INT val
)
474 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, val
);
478 ? "0%" HOST_WIDE_INT_PRINT
"xH" : HOST_WIDE_INT_PRINT_HEX
,
483 rx_assemble_integer (rtx x
, unsigned int size
, int is_aligned
)
485 const char * op
= integer_asm_op (size
, is_aligned
);
487 if (! CONST_INT_P (x
))
488 return default_assemble_integer (x
, size
, is_aligned
);
492 fputs (op
, asm_out_file
);
494 rx_print_integer (asm_out_file
, INTVAL (x
));
495 fputc ('\n', asm_out_file
);
500 /* Handles the insertion of a single operand into the assembler output.
501 The %<letter> directives supported are:
503 %A Print an operand without a leading # character.
504 %B Print an integer comparison name.
505 %C Print a control register name.
506 %F Print a condition code flag name.
507 %G Register used for small-data-area addressing
508 %H Print high part of a DImode register, integer or address.
509 %L Print low part of a DImode register, integer or address.
510 %N Print the negation of the immediate value.
511 %P Register used for PID addressing
512 %Q If the operand is a MEM, then correctly generate
513 register indirect or register relative addressing.
514 %R Like %Q but for zero-extending loads. */
517 rx_print_operand (FILE * file
, rtx op
, int letter
)
519 bool unsigned_load
= false;
520 bool print_hash
= true;
523 && ((GET_CODE (op
) == CONST
524 && GET_CODE (XEXP (op
, 0)) == UNSPEC
)
525 || GET_CODE (op
) == UNSPEC
))
534 /* Print an operand without a leading #. */
538 switch (GET_CODE (op
))
542 output_addr_const (file
, op
);
545 fprintf (file
, "%ld", (long) INTVAL (op
));
548 rx_print_operand (file
, op
, 0);
555 enum rtx_code code
= GET_CODE (op
);
556 machine_mode mode
= GET_MODE (XEXP (op
, 0));
559 if (mode
== CC_Fmode
)
561 /* C flag is undefined, and O flag carries unordered. None of the
562 branch combinations that include O use it helpfully. */
589 unsigned int flags
= flags_from_mode (mode
);
594 ret
= (flags
& CC_FLAG_O
? "lt" : "n");
597 ret
= (flags
& CC_FLAG_O
? "ge" : "pz");
626 gcc_checking_assert ((flags_from_code (code
) & ~flags
) == 0);
633 gcc_assert (CONST_INT_P (op
));
636 case CTRLREG_PSW
: fprintf (file
, "psw"); break;
637 case CTRLREG_USP
: fprintf (file
, "usp"); break;
638 case CTRLREG_FPSW
: fprintf (file
, "fpsw"); break;
639 case CTRLREG_CPEN
: fprintf (file
, "cpen"); break;
640 case CTRLREG_BPSW
: fprintf (file
, "bpsw"); break;
641 case CTRLREG_BPC
: fprintf (file
, "bpc"); break;
642 case CTRLREG_ISP
: fprintf (file
, "isp"); break;
643 case CTRLREG_FINTV
: fprintf (file
, "fintv"); break;
644 case CTRLREG_INTB
: fprintf (file
, "intb"); break;
646 warning (0, "unrecognized control register number: %d - using 'psw'",
648 fprintf (file
, "psw");
654 gcc_assert (CONST_INT_P (op
));
657 case 0: case 'c': case 'C': fprintf (file
, "C"); break;
658 case 1: case 'z': case 'Z': fprintf (file
, "Z"); break;
659 case 2: case 's': case 'S': fprintf (file
, "S"); break;
660 case 3: case 'o': case 'O': fprintf (file
, "O"); break;
661 case 8: case 'i': case 'I': fprintf (file
, "I"); break;
662 case 9: case 'u': case 'U': fprintf (file
, "U"); break;
669 fprintf (file
, "%s", reg_names
[rx_gp_base_regnum ()]);
673 switch (GET_CODE (op
))
676 fprintf (file
, "%s", reg_names
[REGNO (op
) + (WORDS_BIG_ENDIAN
? 0 : 1)]);
680 HOST_WIDE_INT v
= INTVAL (op
);
683 /* Trickery to avoid problems with shifting 32 bits at a time. */
686 rx_print_integer (file
, v
);
691 rx_print_integer (file
, CONST_DOUBLE_HIGH (op
));
694 if (! WORDS_BIG_ENDIAN
)
695 op
= adjust_address (op
, SImode
, 4);
696 output_address (GET_MODE (op
), XEXP (op
, 0));
704 switch (GET_CODE (op
))
707 fprintf (file
, "%s", reg_names
[REGNO (op
) + (WORDS_BIG_ENDIAN
? 1 : 0)]);
711 rx_print_integer (file
, INTVAL (op
) & 0xffffffff);
715 rx_print_integer (file
, CONST_DOUBLE_LOW (op
));
718 if (WORDS_BIG_ENDIAN
)
719 op
= adjust_address (op
, SImode
, 4);
720 output_address (GET_MODE (op
), XEXP (op
, 0));
728 gcc_assert (CONST_INT_P (op
));
730 rx_print_integer (file
, - INTVAL (op
));
734 fprintf (file
, "%s", reg_names
[rx_pid_base_regnum ()]);
738 gcc_assert (GET_MODE_SIZE (GET_MODE (op
)) <= 4);
739 unsigned_load
= true;
744 HOST_WIDE_INT offset
;
751 else if (GET_CODE (op
) == PLUS
)
755 if (REG_P (XEXP (op
, 0)))
757 displacement
= XEXP (op
, 1);
762 displacement
= XEXP (op
, 0);
764 gcc_assert (REG_P (op
));
767 gcc_assert (CONST_INT_P (displacement
));
768 offset
= INTVAL (displacement
);
769 gcc_assert (offset
>= 0);
771 fprintf (file
, "%ld", offset
);
777 rx_print_operand (file
, op
, 0);
778 fprintf (file
, "].");
780 switch (GET_MODE_SIZE (GET_MODE (mem
)))
783 gcc_assert (offset
<= 65535 * 1);
784 fprintf (file
, unsigned_load
? "UB" : "B");
787 gcc_assert (offset
% 2 == 0);
788 gcc_assert (offset
<= 65535 * 2);
789 fprintf (file
, unsigned_load
? "UW" : "W");
792 gcc_assert (offset
% 4 == 0);
793 gcc_assert (offset
<= 65535 * 4);
805 if (GET_CODE (op
) == CONST
806 && GET_CODE (XEXP (op
, 0)) == UNSPEC
)
808 else if (GET_CODE (op
) == CONST
809 && GET_CODE (XEXP (op
, 0)) == PLUS
810 && GET_CODE (XEXP (XEXP (op
, 0), 0)) == UNSPEC
811 && GET_CODE (XEXP (XEXP (op
, 0), 1)) == CONST_INT
)
816 rx_print_operand (file
, XEXP (XEXP (op
, 0), 0), 'A');
817 fprintf (file
, " + ");
818 output_addr_const (file
, XEXP (XEXP (op
, 0), 1));
823 switch (GET_CODE (op
))
826 /* Should be the scaled part of an
827 indexed register indirect address. */
829 rtx base
= XEXP (op
, 0);
830 rtx index
= XEXP (op
, 1);
832 /* Check for a swaped index register and scaling factor.
833 Not sure if this can happen, but be prepared to handle it. */
834 if (CONST_INT_P (base
) && REG_P (index
))
841 gcc_assert (REG_P (base
));
842 gcc_assert (REGNO (base
) < FIRST_PSEUDO_REGISTER
);
843 gcc_assert (CONST_INT_P (index
));
844 /* Do not try to verify the value of the scalar as it is based
845 on the mode of the MEM not the mode of the MULT. (Which
846 will always be SImode). */
847 fprintf (file
, "%s", reg_names
[REGNO (base
)]);
852 output_address (GET_MODE (op
), XEXP (op
, 0));
856 output_address (VOIDmode
, op
);
860 gcc_assert (REGNO (op
) < FIRST_PSEUDO_REGISTER
);
861 fprintf (file
, "%s", reg_names
[REGNO (op
)]);
865 gcc_assert (subreg_regno (op
) < FIRST_PSEUDO_REGISTER
);
866 fprintf (file
, "%s", reg_names
[subreg_regno (op
)]);
869 /* This will only be single precision.... */
874 REAL_VALUE_TO_TARGET_SINGLE (*CONST_DOUBLE_REAL_VALUE (op
), val
);
877 fprintf (file
, TARGET_AS100_SYNTAX
? "0%lxH" : "0x%lx", val
);
884 rx_print_integer (file
, INTVAL (op
));
888 switch (XINT (op
, 1))
890 case UNSPEC_PID_ADDR
:
896 sym
= XVECEXP (op
, 0, 0);
899 if (GET_CODE (sym
) == PLUS
)
904 output_addr_const (file
, sym
);
908 output_addr_const (file
, add
);
910 fprintf (file
, "-__pid_base");
921 rx_print_operand_address (file
, VOIDmode
, op
);
931 /* Maybe convert an operand into its PID format. */
934 rx_maybe_pidify_operand (rtx op
, int copy_to_reg
)
936 if (rx_pid_data_operand (op
) == PID_UNENCODED
)
938 if (GET_CODE (op
) == MEM
)
940 rtx a
= gen_pid_addr (gen_rtx_REG (SImode
, rx_pid_base_regnum ()), XEXP (op
, 0));
941 op
= replace_equiv_address (op
, a
);
945 op
= gen_pid_addr (gen_rtx_REG (SImode
, rx_pid_base_regnum ()), op
);
949 op
= copy_to_mode_reg (GET_MODE (op
), op
);
954 /* Returns an assembler template for a move instruction. */
957 rx_gen_move_template (rtx
* operands
, bool is_movu
)
959 static char out_template
[64];
960 const char * extension
= TARGET_AS100_SYNTAX
? ".L" : "";
961 const char * src_template
;
962 const char * dst_template
;
963 rtx dest
= operands
[0];
964 rtx src
= operands
[1];
966 /* Decide which extension, if any, should be given to the move instruction. */
967 switch (CONST_INT_P (src
) ? GET_MODE (dest
) : GET_MODE (src
))
970 /* The .B extension is not valid when
971 loading an immediate into a register. */
972 if (! REG_P (dest
) || ! CONST_INT_P (src
))
976 if (! REG_P (dest
) || ! CONST_INT_P (src
))
977 /* The .W extension is not valid when
978 loading an immediate into a register. */
988 /* This mode is used by constants. */
995 if (MEM_P (src
) && rx_pid_data_operand (XEXP (src
, 0)) == PID_UNENCODED
)
997 gcc_assert (GET_MODE (src
) != DImode
);
998 gcc_assert (GET_MODE (src
) != DFmode
);
1000 src_template
= "(%A1 - __pid_base)[%P1]";
1002 else if (MEM_P (src
) && rx_small_data_operand (XEXP (src
, 0)))
1004 gcc_assert (GET_MODE (src
) != DImode
);
1005 gcc_assert (GET_MODE (src
) != DFmode
);
1007 src_template
= "%%gp(%A1)[%G1]";
1010 src_template
= "%1";
1012 if (MEM_P (dest
) && rx_small_data_operand (XEXP (dest
, 0)))
1014 gcc_assert (GET_MODE (dest
) != DImode
);
1015 gcc_assert (GET_MODE (dest
) != DFmode
);
1017 dst_template
= "%%gp(%A0)[%G0]";
1020 dst_template
= "%0";
1022 if (GET_MODE (dest
) == DImode
|| GET_MODE (dest
) == DFmode
)
1024 gcc_assert (! is_movu
);
1026 if (REG_P (src
) && REG_P (dest
) && (REGNO (dest
) == REGNO (src
) + 1))
1027 sprintf (out_template
, "mov.L\t%%H1, %%H0 ! mov.L\t%%1, %%0");
1029 sprintf (out_template
, "mov.L\t%%1, %%0 ! mov.L\t%%H1, %%H0");
1032 sprintf (out_template
, "%s%s\t%s, %s", is_movu
? "movu" : "mov",
1033 extension
, src_template
, dst_template
);
1034 return out_template
;
1037 /* Return VALUE rounded up to the next ALIGNMENT boundary. */
1039 static inline unsigned int
1040 rx_round_up (unsigned int value
, unsigned int alignment
)
1043 return (value
+ alignment
) & (~ alignment
);
1046 /* Return the number of bytes in the argument registers
1047 occupied by an argument of type TYPE and mode MODE. */
1050 rx_function_arg_size (machine_mode mode
, const_tree type
)
1052 unsigned int num_bytes
;
1054 num_bytes
= (mode
== BLKmode
)
1055 ? int_size_in_bytes (type
) : GET_MODE_SIZE (mode
);
1056 return rx_round_up (num_bytes
, UNITS_PER_WORD
);
1059 #define NUM_ARG_REGS 4
1060 #define MAX_NUM_ARG_BYTES (NUM_ARG_REGS * UNITS_PER_WORD)
1062 /* Return an RTL expression describing the register holding a function
1063 parameter of mode MODE and type TYPE or NULL_RTX if the parameter should
1064 be passed on the stack. CUM describes the previous parameters to the
1065 function and NAMED is false if the parameter is part of a variable
1066 parameter list, or the last named parameter before the start of a
1067 variable parameter list. */
1070 rx_function_arg (cumulative_args_t cum
, machine_mode mode
,
1071 const_tree type
, bool named
)
1073 unsigned int next_reg
;
1074 unsigned int bytes_so_far
= *get_cumulative_args (cum
);
1076 unsigned int rounded_size
;
1078 /* An exploded version of rx_function_arg_size. */
1079 size
= (mode
== BLKmode
) ? int_size_in_bytes (type
) : GET_MODE_SIZE (mode
);
1080 /* If the size is not known it cannot be passed in registers. */
1084 rounded_size
= rx_round_up (size
, UNITS_PER_WORD
);
1086 /* Don't pass this arg via registers if there
1087 are insufficient registers to hold all of it. */
1088 if (rounded_size
+ bytes_so_far
> MAX_NUM_ARG_BYTES
)
1091 /* Unnamed arguments and the last named argument in a
1092 variadic function are always passed on the stack. */
1096 /* Structures must occupy an exact number of registers,
1097 otherwise they are passed on the stack. */
1098 if ((type
== NULL
|| AGGREGATE_TYPE_P (type
))
1099 && (size
% UNITS_PER_WORD
) != 0)
1102 next_reg
= (bytes_so_far
/ UNITS_PER_WORD
) + 1;
1104 return gen_rtx_REG (mode
, next_reg
);
1108 rx_function_arg_advance (cumulative_args_t cum
, machine_mode mode
,
1109 const_tree type
, bool named ATTRIBUTE_UNUSED
)
1111 *get_cumulative_args (cum
) += rx_function_arg_size (mode
, type
);
1115 rx_function_arg_boundary (machine_mode mode ATTRIBUTE_UNUSED
,
1116 const_tree type ATTRIBUTE_UNUSED
)
1118 /* Older versions of the RX backend aligned all on-stack arguments
1119 to 32-bits. The RX C ABI however says that they should be
1120 aligned to their natural alignment. (See section 5.2.2 of the ABI). */
1122 return STACK_BOUNDARY
;
1127 return DECL_ALIGN (type
);
1128 return TYPE_ALIGN (type
);
1131 return PARM_BOUNDARY
;
1134 /* Return an RTL describing where a function return value of type RET_TYPE
1138 rx_function_value (const_tree ret_type
,
1139 const_tree fn_decl_or_type ATTRIBUTE_UNUSED
,
1140 bool outgoing ATTRIBUTE_UNUSED
)
1142 machine_mode mode
= TYPE_MODE (ret_type
);
1144 /* RX ABI specifies that small integer types are
1145 promoted to int when returned by a function. */
1146 if (GET_MODE_SIZE (mode
) > 0
1147 && GET_MODE_SIZE (mode
) < 4
1148 && ! COMPLEX_MODE_P (mode
)
1149 && ! VECTOR_TYPE_P (ret_type
)
1150 && ! VECTOR_MODE_P (mode
)
1152 return gen_rtx_REG (SImode
, FUNC_RETURN_REGNUM
);
1154 return gen_rtx_REG (mode
, FUNC_RETURN_REGNUM
);
1157 /* TARGET_PROMOTE_FUNCTION_MODE must behave in the same way with
1158 regard to function returns as does TARGET_FUNCTION_VALUE. */
1161 rx_promote_function_mode (const_tree type ATTRIBUTE_UNUSED
,
1163 int * punsignedp ATTRIBUTE_UNUSED
,
1164 const_tree funtype ATTRIBUTE_UNUSED
,
1168 || GET_MODE_SIZE (mode
) >= 4
1169 || COMPLEX_MODE_P (mode
)
1170 || VECTOR_MODE_P (mode
)
1171 || VECTOR_TYPE_P (type
)
1172 || GET_MODE_SIZE (mode
) < 1)
1179 rx_return_in_memory (const_tree type
, const_tree fntype ATTRIBUTE_UNUSED
)
1183 if (TYPE_MODE (type
) != BLKmode
1184 && ! AGGREGATE_TYPE_P (type
))
1187 size
= int_size_in_bytes (type
);
1188 /* Large structs and those whose size is not an
1189 exact multiple of 4 are returned in memory. */
1192 || (size
% UNITS_PER_WORD
) != 0;
1196 rx_struct_value_rtx (tree fndecl ATTRIBUTE_UNUSED
,
1197 int incoming ATTRIBUTE_UNUSED
)
1199 return gen_rtx_REG (Pmode
, STRUCT_VAL_REGNUM
);
1203 rx_return_in_msb (const_tree valtype
)
1205 return TARGET_BIG_ENDIAN_DATA
1206 && (AGGREGATE_TYPE_P (valtype
) || TREE_CODE (valtype
) == COMPLEX_TYPE
);
1209 /* Returns true if the provided function has the specified attribute. */
1212 has_func_attr (const_tree decl
, const char * func_attr
)
1214 if (decl
== NULL_TREE
)
1215 decl
= current_function_decl
;
1217 return lookup_attribute (func_attr
, DECL_ATTRIBUTES (decl
)) != NULL_TREE
;
1220 /* Returns true if the provided function has the "fast_interrupt" attribute. */
1223 is_fast_interrupt_func (const_tree decl
)
1225 return has_func_attr (decl
, "fast_interrupt");
1228 /* Returns true if the provided function has the "interrupt" attribute. */
1231 is_interrupt_func (const_tree decl
)
1233 return has_func_attr (decl
, "interrupt");
1236 /* Returns true if the provided function has the "naked" attribute. */
1239 is_naked_func (const_tree decl
)
1241 return has_func_attr (decl
, "naked");
1244 static bool use_fixed_regs
= false;
1247 rx_conditional_register_usage (void)
1249 static bool using_fixed_regs
= false;
1253 rx_pid_base_regnum_val
= GP_BASE_REGNUM
- rx_num_interrupt_regs
;
1254 fixed_regs
[rx_pid_base_regnum_val
] = call_used_regs
[rx_pid_base_regnum_val
] = 1;
1257 if (rx_small_data_limit
> 0)
1260 rx_gp_base_regnum_val
= rx_pid_base_regnum_val
- 1;
1262 rx_gp_base_regnum_val
= GP_BASE_REGNUM
- rx_num_interrupt_regs
;
1264 fixed_regs
[rx_gp_base_regnum_val
] = call_used_regs
[rx_gp_base_regnum_val
] = 1;
1267 if (use_fixed_regs
!= using_fixed_regs
)
1269 static char saved_fixed_regs
[FIRST_PSEUDO_REGISTER
];
1270 static char saved_call_used_regs
[FIRST_PSEUDO_REGISTER
];
1276 memcpy (saved_fixed_regs
, fixed_regs
, sizeof fixed_regs
);
1277 memcpy (saved_call_used_regs
, call_used_regs
, sizeof call_used_regs
);
1279 /* This is for fast interrupt handlers. Any register in
1280 the range r10 to r13 (inclusive) that is currently
1281 marked as fixed is now a viable, call-used register. */
1282 for (r
= 10; r
<= 13; r
++)
1286 call_used_regs
[r
] = 1;
1289 /* Mark r7 as fixed. This is just a hack to avoid
1290 altering the reg_alloc_order array so that the newly
1291 freed r10-r13 registers are the preferred registers. */
1292 fixed_regs
[7] = call_used_regs
[7] = 1;
1296 /* Restore the normal register masks. */
1297 memcpy (fixed_regs
, saved_fixed_regs
, sizeof fixed_regs
);
1298 memcpy (call_used_regs
, saved_call_used_regs
, sizeof call_used_regs
);
1301 using_fixed_regs
= use_fixed_regs
;
1308 struct decl_chain
* next
;
1311 /* Stack of decls for which we have issued warnings. */
1312 static struct decl_chain
* warned_decls
= NULL
;
1315 add_warned_decl (tree fndecl
)
1317 struct decl_chain
* warned
= (struct decl_chain
*) xmalloc (sizeof * warned
);
1319 warned
->fndecl
= fndecl
;
1320 warned
->next
= warned_decls
;
1321 warned_decls
= warned
;
1324 /* Returns TRUE if FNDECL is on our list of warned about decls. */
1327 already_warned (tree fndecl
)
1329 struct decl_chain
* warned
;
1331 for (warned
= warned_decls
;
1333 warned
= warned
->next
)
1334 if (warned
->fndecl
== fndecl
)
1340 /* Perform any actions necessary before starting to compile FNDECL.
1341 For the RX we use this to make sure that we have the correct
1342 set of register masks selected. If FNDECL is NULL then we are
1343 compiling top level things. */
1346 rx_set_current_function (tree fndecl
)
1348 /* Remember the last target of rx_set_current_function. */
1349 static tree rx_previous_fndecl
;
1350 bool prev_was_fast_interrupt
;
1351 bool current_is_fast_interrupt
;
1353 /* Only change the context if the function changes. This hook is called
1354 several times in the course of compiling a function, and we don't want
1355 to slow things down too much or call target_reinit when it isn't safe. */
1356 if (fndecl
== rx_previous_fndecl
)
1359 prev_was_fast_interrupt
1360 = rx_previous_fndecl
1361 ? is_fast_interrupt_func (rx_previous_fndecl
) : false;
1363 current_is_fast_interrupt
1364 = fndecl
? is_fast_interrupt_func (fndecl
) : false;
1366 if (prev_was_fast_interrupt
!= current_is_fast_interrupt
)
1368 use_fixed_regs
= current_is_fast_interrupt
;
1372 if (current_is_fast_interrupt
&& rx_warn_multiple_fast_interrupts
)
1374 /* We do not warn about the first fast interrupt routine that
1375 we see. Instead we just push it onto the stack. */
1376 if (warned_decls
== NULL
)
1377 add_warned_decl (fndecl
);
1379 /* Otherwise if this fast interrupt is one for which we have
1380 not already issued a warning, generate one and then push
1381 it onto the stack as well. */
1382 else if (! already_warned (fndecl
))
1384 warning (0, "multiple fast interrupt routines seen: %qE and %qE",
1385 fndecl
, warned_decls
->fndecl
);
1386 add_warned_decl (fndecl
);
1390 rx_previous_fndecl
= fndecl
;
1393 /* Typical stack layout should looks like this after the function's prologue:
1398 | | arguments saved | Increasing
1399 | | on the stack | addresses
1400 PARENT arg pointer -> | | /
1401 -------------------------- ---- -------------------
1402 CHILD |ret | return address
1412 frame pointer -> | | /
1415 | | outgoing | Decreasing
1416 | | arguments | addresses
1417 current stack pointer -> | | / |
1418 -------------------------- ---- ------------------ V
1422 bit_count (unsigned int x
)
1424 const unsigned int m1
= 0x55555555;
1425 const unsigned int m2
= 0x33333333;
1426 const unsigned int m4
= 0x0f0f0f0f;
1429 x
= (x
& m2
) + ((x
>> 2) & m2
);
1430 x
= (x
+ (x
>> 4)) & m4
;
1433 return (x
+ (x
>> 16)) & 0x3f;
1436 #define MUST_SAVE_ACC_REGISTER \
1437 (TARGET_SAVE_ACC_REGISTER \
1438 && (is_interrupt_func (NULL_TREE) \
1439 || is_fast_interrupt_func (NULL_TREE)))
1441 /* Returns either the lowest numbered and highest numbered registers that
1442 occupy the call-saved area of the stack frame, if the registers are
1443 stored as a contiguous block, or else a bitmask of the individual
1444 registers if they are stored piecemeal.
1446 Also computes the size of the frame and the size of the outgoing
1447 arguments block (in bytes). */
1450 rx_get_stack_layout (unsigned int * lowest
,
1451 unsigned int * highest
,
1452 unsigned int * register_mask
,
1453 unsigned int * frame_size
,
1454 unsigned int * stack_size
)
1459 unsigned int fixed_reg
= 0;
1460 unsigned int save_mask
;
1461 unsigned int pushed_mask
;
1462 unsigned int unneeded_pushes
;
1464 if (is_naked_func (NULL_TREE
))
1466 /* Naked functions do not create their own stack frame.
1467 Instead the programmer must do that for us. */
1470 * register_mask
= 0;
1476 for (save_mask
= high
= low
= 0, reg
= 1; reg
< CC_REGNUM
; reg
++)
1478 if ((df_regs_ever_live_p (reg
)
1479 /* Always save all call clobbered registers inside non-leaf
1480 interrupt handlers, even if they are not live - they may
1481 be used in (non-interrupt aware) routines called from this one. */
1482 || (call_used_regs
[reg
]
1483 && is_interrupt_func (NULL_TREE
)
1484 && ! crtl
->is_leaf
))
1485 && (! call_used_regs
[reg
]
1486 /* Even call clobbered registered must
1487 be pushed inside interrupt handlers. */
1488 || is_interrupt_func (NULL_TREE
)
1489 /* Likewise for fast interrupt handlers, except registers r10 -
1490 r13. These are normally call-saved, but may have been set
1491 to call-used by rx_conditional_register_usage. If so then
1492 they can be used in the fast interrupt handler without
1493 saving them on the stack. */
1494 || (is_fast_interrupt_func (NULL_TREE
)
1495 && ! IN_RANGE (reg
, 10, 13))))
1501 save_mask
|= 1 << reg
;
1504 /* Remember if we see a fixed register
1505 after having found the low register. */
1506 if (low
!= 0 && fixed_reg
== 0 && fixed_regs
[reg
])
1510 /* If we have to save the accumulator register, make sure
1511 that at least two registers are pushed into the frame. */
1512 if (MUST_SAVE_ACC_REGISTER
1513 && bit_count (save_mask
) < 2)
1515 save_mask
|= (1 << 13) | (1 << 14);
1518 if (high
== 0 || low
== high
)
1522 /* Decide if it would be faster fill in the call-saved area of the stack
1523 frame using multiple PUSH instructions instead of a single PUSHM
1526 SAVE_MASK is a bitmask of the registers that must be stored in the
1527 call-save area. PUSHED_MASK is a bitmask of the registers that would
1528 be pushed into the area if we used a PUSHM instruction. UNNEEDED_PUSHES
1529 is a bitmask of those registers in pushed_mask that are not in
1532 We use a simple heuristic that says that it is better to use
1533 multiple PUSH instructions if the number of unnecessary pushes is
1534 greater than the number of necessary pushes.
1536 We also use multiple PUSH instructions if there are any fixed registers
1537 between LOW and HIGH. The only way that this can happen is if the user
1538 has specified --fixed-<reg-name> on the command line and in such
1539 circumstances we do not want to touch the fixed registers at all.
1541 Note also that the code in the prologue/epilogue handlers will
1542 automatically merge multiple PUSHes of adjacent registers into a single
1545 FIXME: Is it worth improving this heuristic ? */
1546 pushed_mask
= (HOST_WIDE_INT_M1U
<< low
) & ~(HOST_WIDE_INT_M1U
<< (high
+ 1));
1547 unneeded_pushes
= (pushed_mask
& (~ save_mask
)) & pushed_mask
;
1549 if ((fixed_reg
&& fixed_reg
<= high
)
1550 || (optimize_function_for_speed_p (cfun
)
1551 && bit_count (save_mask
) < bit_count (unneeded_pushes
)))
1553 /* Use multiple pushes. */
1556 * register_mask
= save_mask
;
1560 /* Use one push multiple instruction. */
1563 * register_mask
= 0;
1566 * frame_size
= rx_round_up
1567 (get_frame_size (), STACK_BOUNDARY
/ BITS_PER_UNIT
);
1569 if (crtl
->args
.size
> 0)
1570 * frame_size
+= rx_round_up
1571 (crtl
->args
.size
, STACK_BOUNDARY
/ BITS_PER_UNIT
);
1573 * stack_size
= rx_round_up
1574 (crtl
->outgoing_args_size
, STACK_BOUNDARY
/ BITS_PER_UNIT
);
1577 /* Generate a PUSHM instruction that matches the given operands. */
1580 rx_emit_stack_pushm (rtx
* operands
)
1582 HOST_WIDE_INT last_reg
;
1585 gcc_assert (CONST_INT_P (operands
[0]));
1586 last_reg
= (INTVAL (operands
[0]) / UNITS_PER_WORD
) - 1;
1588 gcc_assert (GET_CODE (operands
[1]) == PARALLEL
);
1589 first_push
= XVECEXP (operands
[1], 0, 1);
1590 gcc_assert (SET_P (first_push
));
1591 first_push
= SET_SRC (first_push
);
1592 gcc_assert (REG_P (first_push
));
1594 asm_fprintf (asm_out_file
, "\tpushm\t%s-%s\n",
1595 reg_names
[REGNO (first_push
) - last_reg
],
1596 reg_names
[REGNO (first_push
)]);
1599 /* Generate a PARALLEL that will pass the rx_store_multiple_vector predicate. */
1602 gen_rx_store_vector (unsigned int low
, unsigned int high
)
1605 unsigned int count
= (high
- low
) + 2;
1608 vector
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (count
));
1610 XVECEXP (vector
, 0, 0) =
1611 gen_rtx_SET (stack_pointer_rtx
,
1612 gen_rtx_MINUS (SImode
, stack_pointer_rtx
,
1613 GEN_INT ((count
- 1) * UNITS_PER_WORD
)));
1615 for (i
= 0; i
< count
- 1; i
++)
1616 XVECEXP (vector
, 0, i
+ 1) =
1617 gen_rtx_SET (gen_rtx_MEM (SImode
,
1618 gen_rtx_MINUS (SImode
, stack_pointer_rtx
,
1619 GEN_INT ((i
+ 1) * UNITS_PER_WORD
))),
1620 gen_rtx_REG (SImode
, high
- i
));
1624 /* Mark INSN as being frame related. If it is a PARALLEL
1625 then mark each element as being frame related as well. */
1628 mark_frame_related (rtx insn
)
1630 RTX_FRAME_RELATED_P (insn
) = 1;
1631 insn
= PATTERN (insn
);
1633 if (GET_CODE (insn
) == PARALLEL
)
1637 for (i
= 0; i
< (unsigned) XVECLEN (insn
, 0); i
++)
1638 RTX_FRAME_RELATED_P (XVECEXP (insn
, 0, i
)) = 1;
1643 ok_for_max_constant (HOST_WIDE_INT val
)
1645 if (rx_max_constant_size
== 0 || rx_max_constant_size
== 4)
1646 /* If there is no constraint on the size of constants
1647 used as operands, then any value is legitimate. */
1650 /* rx_max_constant_size specifies the maximum number
1651 of bytes that can be used to hold a signed value. */
1652 return IN_RANGE (val
, (HOST_WIDE_INT_M1U
<< (rx_max_constant_size
* 8)),
1653 ( 1 << (rx_max_constant_size
* 8)));
1656 /* Generate an ADD of SRC plus VAL into DEST.
1657 Handles the case where VAL is too big for max_constant_value.
1658 Sets FRAME_RELATED_P on the insn if IS_FRAME_RELATED is true. */
1661 gen_safe_add (rtx dest
, rtx src
, rtx val
, bool is_frame_related
)
1665 if (val
== NULL_RTX
|| INTVAL (val
) == 0)
1667 gcc_assert (dest
!= src
);
1669 insn
= emit_move_insn (dest
, src
);
1671 else if (ok_for_max_constant (INTVAL (val
)))
1672 insn
= emit_insn (gen_addsi3 (dest
, src
, val
));
1675 /* Wrap VAL in an UNSPEC so that rx_is_legitimate_constant
1676 will not reject it. */
1677 val
= gen_rtx_CONST (SImode
, gen_rtx_UNSPEC (SImode
, gen_rtvec (1, val
), UNSPEC_CONST
));
1678 insn
= emit_insn (gen_addsi3 (dest
, src
, val
));
1680 if (is_frame_related
)
1681 /* We have to provide our own frame related note here
1682 as the dwarf2out code cannot be expected to grok
1684 add_reg_note (insn
, REG_FRAME_RELATED_EXPR
,
1685 gen_rtx_SET (dest
, gen_rtx_PLUS (SImode
, src
, val
)));
1689 if (is_frame_related
)
1690 RTX_FRAME_RELATED_P (insn
) = 1;
1694 push_regs (unsigned int high
, unsigned int low
)
1699 insn
= emit_insn (gen_stack_push (gen_rtx_REG (SImode
, low
)));
1701 insn
= emit_insn (gen_stack_pushm (GEN_INT (((high
- low
) + 1) * UNITS_PER_WORD
),
1702 gen_rx_store_vector (low
, high
)));
1703 mark_frame_related (insn
);
1707 rx_expand_prologue (void)
1709 unsigned int stack_size
;
1710 unsigned int frame_size
;
1716 /* Naked functions use their own, programmer provided prologues. */
1717 if (is_naked_func (NULL_TREE
))
1720 rx_get_stack_layout (& low
, & high
, & mask
, & frame_size
, & stack_size
);
1722 if (flag_stack_usage_info
)
1723 current_function_static_stack_size
= frame_size
+ stack_size
;
1725 /* If we use any of the callee-saved registers, save them now. */
1728 /* Push registers in reverse order. */
1729 for (reg
= CC_REGNUM
; reg
--;)
1730 if (mask
& (1 << reg
))
1734 /* Look for a span of registers.
1735 Note - we do not have to worry about -Os and whether
1736 it is better to use a single, longer PUSHM as
1737 rx_get_stack_layout has already done that for us. */
1739 if ((mask
& (1 << reg
)) == 0)
1744 push_regs (high
, low
);
1745 if (reg
== (unsigned) -1)
1750 push_regs (high
, low
);
1752 if (MUST_SAVE_ACC_REGISTER
)
1754 unsigned int acc_high
, acc_low
;
1756 /* Interrupt handlers have to preserve the accumulator
1757 register if so requested by the user. Use the first
1758 two pushed registers as intermediaries. */
1761 acc_low
= acc_high
= 0;
1763 for (reg
= 1; reg
< CC_REGNUM
; reg
++)
1764 if (mask
& (1 << reg
))
1775 /* We have assumed that there are at least two registers pushed... */
1776 gcc_assert (acc_high
!= 0);
1778 /* Note - the bottom 16 bits of the accumulator are inaccessible.
1779 We just assume that they are zero. */
1780 emit_insn (gen_mvfacmi (gen_rtx_REG (SImode
, acc_low
)));
1781 emit_insn (gen_mvfachi (gen_rtx_REG (SImode
, acc_high
)));
1782 emit_insn (gen_stack_push (gen_rtx_REG (SImode
, acc_low
)));
1783 emit_insn (gen_stack_push (gen_rtx_REG (SImode
, acc_high
)));
1790 /* We have assumed that there are at least two registers pushed... */
1791 gcc_assert (acc_high
<= high
);
1793 emit_insn (gen_mvfacmi (gen_rtx_REG (SImode
, acc_low
)));
1794 emit_insn (gen_mvfachi (gen_rtx_REG (SImode
, acc_high
)));
1795 emit_insn (gen_stack_pushm (GEN_INT (2 * UNITS_PER_WORD
),
1796 gen_rx_store_vector (acc_low
, acc_high
)));
1800 /* If needed, set up the frame pointer. */
1801 if (frame_pointer_needed
)
1802 gen_safe_add (frame_pointer_rtx
, stack_pointer_rtx
,
1803 GEN_INT (- (HOST_WIDE_INT
) frame_size
), true);
1805 /* Allocate space for the outgoing args.
1806 If the stack frame has not already been set up then handle this as well. */
1811 if (frame_pointer_needed
)
1812 gen_safe_add (stack_pointer_rtx
, frame_pointer_rtx
,
1813 GEN_INT (- (HOST_WIDE_INT
) stack_size
), true);
1815 gen_safe_add (stack_pointer_rtx
, stack_pointer_rtx
,
1816 GEN_INT (- (HOST_WIDE_INT
) (frame_size
+ stack_size
)),
1820 gen_safe_add (stack_pointer_rtx
, stack_pointer_rtx
,
1821 GEN_INT (- (HOST_WIDE_INT
) stack_size
), true);
1823 else if (frame_size
)
1825 if (! frame_pointer_needed
)
1826 gen_safe_add (stack_pointer_rtx
, stack_pointer_rtx
,
1827 GEN_INT (- (HOST_WIDE_INT
) frame_size
), true);
1829 gen_safe_add (stack_pointer_rtx
, frame_pointer_rtx
, NULL_RTX
,
1830 false /* False because the epilogue will use the FP not the SP. */);
1835 add_vector_labels (FILE *file
, const char *aname
)
1839 const char *vname
= "vect";
1843 /* This node is for the vector/interrupt tag itself */
1844 vec_attr
= lookup_attribute (aname
, DECL_ATTRIBUTES (current_function_decl
));
1848 /* Now point it at the first argument */
1849 vec_attr
= TREE_VALUE (vec_attr
);
1851 /* Iterate through the arguments. */
1854 val_attr
= TREE_VALUE (vec_attr
);
1855 switch (TREE_CODE (val_attr
))
1858 s
= TREE_STRING_POINTER (val_attr
);
1859 goto string_id_common
;
1861 case IDENTIFIER_NODE
:
1862 s
= IDENTIFIER_POINTER (val_attr
);
1865 if (strcmp (s
, "$default") == 0)
1867 fprintf (file
, "\t.global\t$tableentry$default$%s\n", vname
);
1868 fprintf (file
, "$tableentry$default$%s:\n", vname
);
1875 vnum
= TREE_INT_CST_LOW (val_attr
);
1877 fprintf (file
, "\t.global\t$tableentry$%d$%s\n", vnum
, vname
);
1878 fprintf (file
, "$tableentry$%d$%s:\n", vnum
, vname
);
1885 vec_attr
= TREE_CHAIN (vec_attr
);
1891 rx_output_function_prologue (FILE * file
)
1893 add_vector_labels (file
, "interrupt");
1894 add_vector_labels (file
, "vector");
1896 if (is_fast_interrupt_func (NULL_TREE
))
1897 asm_fprintf (file
, "\t; Note: Fast Interrupt Handler\n");
1899 if (is_interrupt_func (NULL_TREE
))
1900 asm_fprintf (file
, "\t; Note: Interrupt Handler\n");
1902 if (is_naked_func (NULL_TREE
))
1903 asm_fprintf (file
, "\t; Note: Naked Function\n");
1905 if (cfun
->static_chain_decl
!= NULL
)
1906 asm_fprintf (file
, "\t; Note: Nested function declared "
1907 "inside another function.\n");
1909 if (crtl
->calls_eh_return
)
1910 asm_fprintf (file
, "\t; Note: Calls __builtin_eh_return.\n");
1913 /* Generate a POPM or RTSD instruction that matches the given operands. */
1916 rx_emit_stack_popm (rtx
* operands
, bool is_popm
)
1918 HOST_WIDE_INT stack_adjust
;
1919 HOST_WIDE_INT last_reg
;
1922 gcc_assert (CONST_INT_P (operands
[0]));
1923 stack_adjust
= INTVAL (operands
[0]);
1925 gcc_assert (GET_CODE (operands
[1]) == PARALLEL
);
1926 last_reg
= XVECLEN (operands
[1], 0) - (is_popm
? 2 : 3);
1928 first_push
= XVECEXP (operands
[1], 0, 1);
1929 gcc_assert (SET_P (first_push
));
1930 first_push
= SET_DEST (first_push
);
1931 gcc_assert (REG_P (first_push
));
1934 asm_fprintf (asm_out_file
, "\tpopm\t%s-%s\n",
1935 reg_names
[REGNO (first_push
)],
1936 reg_names
[REGNO (first_push
) + last_reg
]);
1938 asm_fprintf (asm_out_file
, "\trtsd\t#%d, %s-%s\n",
1940 reg_names
[REGNO (first_push
)],
1941 reg_names
[REGNO (first_push
) + last_reg
]);
1944 /* Generate a PARALLEL which will satisfy the rx_rtsd_vector predicate. */
1947 gen_rx_rtsd_vector (unsigned int adjust
, unsigned int low
, unsigned int high
)
1950 unsigned int bias
= 3;
1951 unsigned int count
= (high
- low
) + bias
;
1954 vector
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (count
));
1956 XVECEXP (vector
, 0, 0) =
1957 gen_rtx_SET (stack_pointer_rtx
,
1958 plus_constant (Pmode
, stack_pointer_rtx
, adjust
));
1960 for (i
= 0; i
< count
- 2; i
++)
1961 XVECEXP (vector
, 0, i
+ 1) =
1962 gen_rtx_SET (gen_rtx_REG (SImode
, low
+ i
),
1963 gen_rtx_MEM (SImode
,
1964 i
== 0 ? stack_pointer_rtx
1965 : plus_constant (Pmode
, stack_pointer_rtx
,
1966 i
* UNITS_PER_WORD
)));
1968 XVECEXP (vector
, 0, count
- 1) = ret_rtx
;
1973 /* Generate a PARALLEL which will satisfy the rx_load_multiple_vector predicate. */
1976 gen_rx_popm_vector (unsigned int low
, unsigned int high
)
1979 unsigned int count
= (high
- low
) + 2;
1982 vector
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (count
));
1984 XVECEXP (vector
, 0, 0) =
1985 gen_rtx_SET (stack_pointer_rtx
,
1986 plus_constant (Pmode
, stack_pointer_rtx
,
1987 (count
- 1) * UNITS_PER_WORD
));
1989 for (i
= 0; i
< count
- 1; i
++)
1990 XVECEXP (vector
, 0, i
+ 1) =
1991 gen_rtx_SET (gen_rtx_REG (SImode
, low
+ i
),
1992 gen_rtx_MEM (SImode
,
1993 i
== 0 ? stack_pointer_rtx
1994 : plus_constant (Pmode
, stack_pointer_rtx
,
1995 i
* UNITS_PER_WORD
)));
2000 /* Returns true if a simple return insn can be used. */
2003 rx_can_use_simple_return (void)
2007 unsigned int frame_size
;
2008 unsigned int stack_size
;
2009 unsigned int register_mask
;
2011 if (is_naked_func (NULL_TREE
)
2012 || is_fast_interrupt_func (NULL_TREE
)
2013 || is_interrupt_func (NULL_TREE
))
2016 rx_get_stack_layout (& low
, & high
, & register_mask
,
2017 & frame_size
, & stack_size
);
2019 return (register_mask
== 0
2020 && (frame_size
+ stack_size
) == 0
2025 pop_regs (unsigned int high
, unsigned int low
)
2028 emit_insn (gen_stack_pop (gen_rtx_REG (SImode
, low
)));
2030 emit_insn (gen_stack_popm (GEN_INT (((high
- low
) + 1) * UNITS_PER_WORD
),
2031 gen_rx_popm_vector (low
, high
)));
2035 rx_expand_epilogue (bool is_sibcall
)
2039 unsigned int frame_size
;
2040 unsigned int stack_size
;
2041 unsigned int register_mask
;
2042 unsigned int regs_size
;
2044 unsigned HOST_WIDE_INT total_size
;
2046 /* FIXME: We do not support indirect sibcalls at the moment becaause we
2047 cannot guarantee that the register holding the function address is a
2048 call-used register. If it is a call-saved register then the stack
2049 pop instructions generated in the epilogue will corrupt the address
2052 Creating a new call-used-only register class works but then the
2053 reload pass gets stuck because it cannot always find a call-used
2054 register for spilling sibcalls.
2056 The other possible solution is for this pass to scan forward for the
2057 sibcall instruction (if it has been generated) and work out if it
2058 is an indirect sibcall using a call-saved register. If it is then
2059 the address can copied into a call-used register in this epilogue
2060 code and the sibcall instruction modified to use that register. */
2062 if (is_naked_func (NULL_TREE
))
2064 gcc_assert (! is_sibcall
);
2066 /* Naked functions use their own, programmer provided epilogues.
2067 But, in order to keep gcc happy we have to generate some kind of
2069 emit_jump_insn (gen_naked_return ());
2073 rx_get_stack_layout (& low
, & high
, & register_mask
,
2074 & frame_size
, & stack_size
);
2076 total_size
= frame_size
+ stack_size
;
2077 regs_size
= ((high
- low
) + 1) * UNITS_PER_WORD
;
2079 /* See if we are unable to use the special stack frame deconstruct and
2080 return instructions. In most cases we can use them, but the exceptions
2083 - Sibling calling functions deconstruct the frame but do not return to
2084 their caller. Instead they branch to their sibling and allow their
2085 return instruction to return to this function's parent.
2087 - Fast and normal interrupt handling functions have to use special
2088 return instructions.
2090 - Functions where we have pushed a fragmented set of registers into the
2091 call-save area must have the same set of registers popped. */
2093 || is_fast_interrupt_func (NULL_TREE
)
2094 || is_interrupt_func (NULL_TREE
)
2097 /* Cannot use the special instructions - deconstruct by hand. */
2099 gen_safe_add (stack_pointer_rtx
, stack_pointer_rtx
,
2100 GEN_INT (total_size
), false);
2102 if (MUST_SAVE_ACC_REGISTER
)
2104 unsigned int acc_low
, acc_high
;
2106 /* Reverse the saving of the accumulator register onto the stack.
2107 Note we must adjust the saved "low" accumulator value as it
2108 is really the middle 32-bits of the accumulator. */
2111 acc_low
= acc_high
= 0;
2113 for (reg
= 1; reg
< CC_REGNUM
; reg
++)
2114 if (register_mask
& (1 << reg
))
2124 emit_insn (gen_stack_pop (gen_rtx_REG (SImode
, acc_high
)));
2125 emit_insn (gen_stack_pop (gen_rtx_REG (SImode
, acc_low
)));
2131 emit_insn (gen_stack_popm (GEN_INT (2 * UNITS_PER_WORD
),
2132 gen_rx_popm_vector (acc_low
, acc_high
)));
2135 emit_insn (gen_ashlsi3 (gen_rtx_REG (SImode
, acc_low
),
2136 gen_rtx_REG (SImode
, acc_low
),
2138 emit_insn (gen_mvtaclo (gen_rtx_REG (SImode
, acc_low
)));
2139 emit_insn (gen_mvtachi (gen_rtx_REG (SImode
, acc_high
)));
2144 for (reg
= 0; reg
< CC_REGNUM
; reg
++)
2145 if (register_mask
& (1 << reg
))
2148 while (register_mask
& (1 << high
))
2150 pop_regs (high
- 1, low
);
2155 pop_regs (high
, low
);
2157 if (is_fast_interrupt_func (NULL_TREE
))
2159 gcc_assert (! is_sibcall
);
2160 emit_jump_insn (gen_fast_interrupt_return ());
2162 else if (is_interrupt_func (NULL_TREE
))
2164 gcc_assert (! is_sibcall
);
2165 emit_jump_insn (gen_exception_return ());
2167 else if (! is_sibcall
)
2168 emit_jump_insn (gen_simple_return ());
2173 /* If we allocated space on the stack, free it now. */
2176 unsigned HOST_WIDE_INT rtsd_size
;
2178 /* See if we can use the RTSD instruction. */
2179 rtsd_size
= total_size
+ regs_size
;
2180 if (rtsd_size
< 1024 && (rtsd_size
% 4) == 0)
2183 emit_jump_insn (gen_pop_and_return
2184 (GEN_INT (rtsd_size
),
2185 gen_rx_rtsd_vector (rtsd_size
, low
, high
)));
2187 emit_jump_insn (gen_deallocate_and_return (GEN_INT (total_size
)));
2192 gen_safe_add (stack_pointer_rtx
, stack_pointer_rtx
,
2193 GEN_INT (total_size
), false);
2197 emit_jump_insn (gen_pop_and_return (GEN_INT (regs_size
),
2198 gen_rx_rtsd_vector (regs_size
,
2201 emit_jump_insn (gen_simple_return ());
2205 /* Compute the offset (in words) between FROM (arg pointer
2206 or frame pointer) and TO (frame pointer or stack pointer).
2207 See ASCII art comment at the start of rx_expand_prologue
2208 for more information. */
2211 rx_initial_elimination_offset (int from
, int to
)
2215 unsigned int frame_size
;
2216 unsigned int stack_size
;
2219 rx_get_stack_layout (& low
, & high
, & mask
, & frame_size
, & stack_size
);
2221 if (from
== ARG_POINTER_REGNUM
)
2223 /* Extend the computed size of the stack frame to
2224 include the registers pushed in the prologue. */
2226 frame_size
+= ((high
- low
) + 1) * UNITS_PER_WORD
;
2228 frame_size
+= bit_count (mask
) * UNITS_PER_WORD
;
2230 /* Remember to include the return address. */
2231 frame_size
+= 1 * UNITS_PER_WORD
;
2233 if (to
== FRAME_POINTER_REGNUM
)
2236 gcc_assert (to
== STACK_POINTER_REGNUM
);
2237 return frame_size
+ stack_size
;
2240 gcc_assert (from
== FRAME_POINTER_REGNUM
&& to
== STACK_POINTER_REGNUM
);
2244 /* Decide if a variable should go into one of the small data sections. */
2247 rx_in_small_data (const_tree decl
)
2250 const char * section
;
2252 if (rx_small_data_limit
== 0)
2255 if (TREE_CODE (decl
) != VAR_DECL
)
2258 /* We do not put read-only variables into a small data area because
2259 they would be placed with the other read-only sections, far away
2260 from the read-write data sections, and we only have one small
2262 Similarly commons are placed in the .bss section which might be
2263 far away (and out of alignment with respect to) the .data section. */
2264 if (TREE_READONLY (decl
) || DECL_COMMON (decl
))
2267 section
= DECL_SECTION_NAME (decl
);
2269 return (strcmp (section
, "D_2") == 0) || (strcmp (section
, "B_2") == 0);
2271 size
= int_size_in_bytes (TREE_TYPE (decl
));
2273 return (size
> 0) && (size
<= rx_small_data_limit
);
2276 /* Return a section for X.
2277 The only special thing we do here is to honor small data. */
2280 rx_select_rtx_section (machine_mode mode
,
2282 unsigned HOST_WIDE_INT align
)
2284 if (rx_small_data_limit
> 0
2285 && GET_MODE_SIZE (mode
) <= rx_small_data_limit
2286 && align
<= (unsigned HOST_WIDE_INT
) rx_small_data_limit
* BITS_PER_UNIT
)
2287 return sdata_section
;
2289 return default_elf_select_rtx_section (mode
, x
, align
);
2293 rx_select_section (tree decl
,
2295 unsigned HOST_WIDE_INT align
)
2297 if (rx_small_data_limit
> 0)
2299 switch (categorize_decl_for_section (decl
, reloc
))
2301 case SECCAT_SDATA
: return sdata_section
;
2302 case SECCAT_SBSS
: return sbss_section
;
2303 case SECCAT_SRODATA
:
2304 /* Fall through. We do not put small, read only
2305 data into the C_2 section because we are not
2306 using the C_2 section. We do not use the C_2
2307 section because it is located with the other
2308 read-only data sections, far away from the read-write
2309 data sections and we only have one small data
2316 /* If we are supporting the Renesas assembler
2317 we cannot use mergeable sections. */
2318 if (TARGET_AS100_SYNTAX
)
2319 switch (categorize_decl_for_section (decl
, reloc
))
2321 case SECCAT_RODATA_MERGE_CONST
:
2322 case SECCAT_RODATA_MERGE_STR_INIT
:
2323 case SECCAT_RODATA_MERGE_STR
:
2324 return readonly_data_section
;
2330 return default_elf_select_section (decl
, reloc
, align
);
2358 static GTY(()) tree rx_builtins
[(int) RX_BUILTIN_max
];
2361 rx_init_builtins (void)
2363 #define ADD_RX_BUILTIN0(UC_NAME, LC_NAME, RET_TYPE) \
2364 rx_builtins[RX_BUILTIN_##UC_NAME] = \
2365 add_builtin_function ("__builtin_rx_" LC_NAME, \
2366 build_function_type_list (RET_TYPE##_type_node, \
2368 RX_BUILTIN_##UC_NAME, \
2369 BUILT_IN_MD, NULL, NULL_TREE)
2371 #define ADD_RX_BUILTIN1(UC_NAME, LC_NAME, RET_TYPE, ARG_TYPE) \
2372 rx_builtins[RX_BUILTIN_##UC_NAME] = \
2373 add_builtin_function ("__builtin_rx_" LC_NAME, \
2374 build_function_type_list (RET_TYPE##_type_node, \
2375 ARG_TYPE##_type_node, \
2377 RX_BUILTIN_##UC_NAME, \
2378 BUILT_IN_MD, NULL, NULL_TREE)
2380 #define ADD_RX_BUILTIN2(UC_NAME, LC_NAME, RET_TYPE, ARG_TYPE1, ARG_TYPE2) \
2381 rx_builtins[RX_BUILTIN_##UC_NAME] = \
2382 add_builtin_function ("__builtin_rx_" LC_NAME, \
2383 build_function_type_list (RET_TYPE##_type_node, \
2384 ARG_TYPE1##_type_node,\
2385 ARG_TYPE2##_type_node,\
2387 RX_BUILTIN_##UC_NAME, \
2388 BUILT_IN_MD, NULL, NULL_TREE)
2390 #define ADD_RX_BUILTIN3(UC_NAME,LC_NAME,RET_TYPE,ARG_TYPE1,ARG_TYPE2,ARG_TYPE3) \
2391 rx_builtins[RX_BUILTIN_##UC_NAME] = \
2392 add_builtin_function ("__builtin_rx_" LC_NAME, \
2393 build_function_type_list (RET_TYPE##_type_node, \
2394 ARG_TYPE1##_type_node,\
2395 ARG_TYPE2##_type_node,\
2396 ARG_TYPE3##_type_node,\
2398 RX_BUILTIN_##UC_NAME, \
2399 BUILT_IN_MD, NULL, NULL_TREE)
2401 ADD_RX_BUILTIN0 (BRK
, "brk", void);
2402 ADD_RX_BUILTIN1 (CLRPSW
, "clrpsw", void, integer
);
2403 ADD_RX_BUILTIN1 (SETPSW
, "setpsw", void, integer
);
2404 ADD_RX_BUILTIN1 (INT
, "int", void, integer
);
2405 ADD_RX_BUILTIN2 (MACHI
, "machi", void, intSI
, intSI
);
2406 ADD_RX_BUILTIN2 (MACLO
, "maclo", void, intSI
, intSI
);
2407 ADD_RX_BUILTIN2 (MULHI
, "mulhi", void, intSI
, intSI
);
2408 ADD_RX_BUILTIN2 (MULLO
, "mullo", void, intSI
, intSI
);
2409 ADD_RX_BUILTIN0 (MVFACHI
, "mvfachi", intSI
);
2410 ADD_RX_BUILTIN0 (MVFACMI
, "mvfacmi", intSI
);
2411 ADD_RX_BUILTIN1 (MVTACHI
, "mvtachi", void, intSI
);
2412 ADD_RX_BUILTIN1 (MVTACLO
, "mvtaclo", void, intSI
);
2413 ADD_RX_BUILTIN0 (RMPA
, "rmpa", void);
2414 ADD_RX_BUILTIN1 (MVFC
, "mvfc", intSI
, integer
);
2415 ADD_RX_BUILTIN2 (MVTC
, "mvtc", void, integer
, integer
);
2416 ADD_RX_BUILTIN1 (MVTIPL
, "mvtipl", void, integer
);
2417 ADD_RX_BUILTIN1 (RACW
, "racw", void, integer
);
2418 ADD_RX_BUILTIN1 (ROUND
, "round", intSI
, float);
2419 ADD_RX_BUILTIN1 (REVW
, "revw", intSI
, intSI
);
2420 ADD_RX_BUILTIN0 (WAIT
, "wait", void);
2423 /* Return the RX builtin for CODE. */
2426 rx_builtin_decl (unsigned code
, bool initialize_p ATTRIBUTE_UNUSED
)
2428 if (code
>= RX_BUILTIN_max
)
2429 return error_mark_node
;
2431 return rx_builtins
[code
];
2435 rx_expand_void_builtin_1_arg (rtx arg
, rtx (* gen_func
)(rtx
), bool reg
)
2437 if (reg
&& ! REG_P (arg
))
2438 arg
= force_reg (SImode
, arg
);
2440 emit_insn (gen_func (arg
));
2446 rx_expand_builtin_mvtc (tree exp
)
2448 rtx arg1
= expand_normal (CALL_EXPR_ARG (exp
, 0));
2449 rtx arg2
= expand_normal (CALL_EXPR_ARG (exp
, 1));
2451 if (! CONST_INT_P (arg1
))
2455 arg2
= force_reg (SImode
, arg2
);
2457 emit_insn (gen_mvtc (arg1
, arg2
));
2463 rx_expand_builtin_mvfc (tree t_arg
, rtx target
)
2465 rtx arg
= expand_normal (t_arg
);
2467 if (! CONST_INT_P (arg
))
2470 if (target
== NULL_RTX
)
2473 if (! REG_P (target
))
2474 target
= force_reg (SImode
, target
);
2476 emit_insn (gen_mvfc (target
, arg
));
2482 rx_expand_builtin_mvtipl (rtx arg
)
2484 /* The RX610 does not support the MVTIPL instruction. */
2485 if (rx_cpu_type
== RX610
)
2488 if (! CONST_INT_P (arg
) || ! IN_RANGE (INTVAL (arg
), 0, (1 << 4) - 1))
2491 emit_insn (gen_mvtipl (arg
));
2497 rx_expand_builtin_mac (tree exp
, rtx (* gen_func
)(rtx
, rtx
))
2499 rtx arg1
= expand_normal (CALL_EXPR_ARG (exp
, 0));
2500 rtx arg2
= expand_normal (CALL_EXPR_ARG (exp
, 1));
2503 arg1
= force_reg (SImode
, arg1
);
2506 arg2
= force_reg (SImode
, arg2
);
2508 emit_insn (gen_func (arg1
, arg2
));
2514 rx_expand_int_builtin_1_arg (rtx arg
,
2516 rtx (* gen_func
)(rtx
, rtx
),
2520 if (!mem_ok
|| ! MEM_P (arg
))
2521 arg
= force_reg (SImode
, arg
);
2523 if (target
== NULL_RTX
|| ! REG_P (target
))
2524 target
= gen_reg_rtx (SImode
);
2526 emit_insn (gen_func (target
, arg
));
2532 rx_expand_int_builtin_0_arg (rtx target
, rtx (* gen_func
)(rtx
))
2534 if (target
== NULL_RTX
|| ! REG_P (target
))
2535 target
= gen_reg_rtx (SImode
);
2537 emit_insn (gen_func (target
));
2543 rx_expand_builtin_round (rtx arg
, rtx target
)
2545 if ((! REG_P (arg
) && ! MEM_P (arg
))
2546 || GET_MODE (arg
) != SFmode
)
2547 arg
= force_reg (SFmode
, arg
);
2549 if (target
== NULL_RTX
|| ! REG_P (target
))
2550 target
= gen_reg_rtx (SImode
);
2552 emit_insn (gen_lrintsf2 (target
, arg
));
2558 valid_psw_flag (rtx op
, const char *which
)
2560 static int mvtc_inform_done
= 0;
2562 if (GET_CODE (op
) == CONST_INT
)
2563 switch (INTVAL (op
))
2565 case 0: case 'c': case 'C':
2566 case 1: case 'z': case 'Z':
2567 case 2: case 's': case 'S':
2568 case 3: case 'o': case 'O':
2569 case 8: case 'i': case 'I':
2570 case 9: case 'u': case 'U':
2574 error ("__builtin_rx_%s takes 'C', 'Z', 'S', 'O', 'I', or 'U'", which
);
2575 if (!mvtc_inform_done
)
2576 error ("use __builtin_rx_mvtc (0, ... ) to write arbitrary values to PSW");
2577 mvtc_inform_done
= 1;
2583 rx_expand_builtin (tree exp
,
2585 rtx subtarget ATTRIBUTE_UNUSED
,
2586 machine_mode mode ATTRIBUTE_UNUSED
,
2587 int ignore ATTRIBUTE_UNUSED
)
2589 tree fndecl
= TREE_OPERAND (CALL_EXPR_FN (exp
), 0);
2590 tree arg
= call_expr_nargs (exp
) >= 1 ? CALL_EXPR_ARG (exp
, 0) : NULL_TREE
;
2591 rtx op
= arg
? expand_normal (arg
) : NULL_RTX
;
2592 unsigned int fcode
= DECL_FUNCTION_CODE (fndecl
);
2596 case RX_BUILTIN_BRK
: emit_insn (gen_brk ()); return NULL_RTX
;
2597 case RX_BUILTIN_CLRPSW
:
2598 if (!valid_psw_flag (op
, "clrpsw"))
2600 return rx_expand_void_builtin_1_arg (op
, gen_clrpsw
, false);
2601 case RX_BUILTIN_SETPSW
:
2602 if (!valid_psw_flag (op
, "setpsw"))
2604 return rx_expand_void_builtin_1_arg (op
, gen_setpsw
, false);
2605 case RX_BUILTIN_INT
: return rx_expand_void_builtin_1_arg
2606 (op
, gen_int
, false);
2607 case RX_BUILTIN_MACHI
: return rx_expand_builtin_mac (exp
, gen_machi
);
2608 case RX_BUILTIN_MACLO
: return rx_expand_builtin_mac (exp
, gen_maclo
);
2609 case RX_BUILTIN_MULHI
: return rx_expand_builtin_mac (exp
, gen_mulhi
);
2610 case RX_BUILTIN_MULLO
: return rx_expand_builtin_mac (exp
, gen_mullo
);
2611 case RX_BUILTIN_MVFACHI
: return rx_expand_int_builtin_0_arg
2612 (target
, gen_mvfachi
);
2613 case RX_BUILTIN_MVFACMI
: return rx_expand_int_builtin_0_arg
2614 (target
, gen_mvfacmi
);
2615 case RX_BUILTIN_MVTACHI
: return rx_expand_void_builtin_1_arg
2616 (op
, gen_mvtachi
, true);
2617 case RX_BUILTIN_MVTACLO
: return rx_expand_void_builtin_1_arg
2618 (op
, gen_mvtaclo
, true);
2619 case RX_BUILTIN_RMPA
:
2620 if (rx_allow_string_insns
)
2621 emit_insn (gen_rmpa ());
2623 error ("-mno-allow-string-insns forbids the generation of the RMPA instruction");
2625 case RX_BUILTIN_MVFC
: return rx_expand_builtin_mvfc (arg
, target
);
2626 case RX_BUILTIN_MVTC
: return rx_expand_builtin_mvtc (exp
);
2627 case RX_BUILTIN_MVTIPL
: return rx_expand_builtin_mvtipl (op
);
2628 case RX_BUILTIN_RACW
: return rx_expand_void_builtin_1_arg
2629 (op
, gen_racw
, false);
2630 case RX_BUILTIN_ROUND
: return rx_expand_builtin_round (op
, target
);
2631 case RX_BUILTIN_REVW
: return rx_expand_int_builtin_1_arg
2632 (op
, target
, gen_revw
, false);
2633 case RX_BUILTIN_WAIT
: emit_insn (gen_wait ()); return NULL_RTX
;
2636 internal_error ("bad builtin code");
2643 /* Place an element into a constructor or destructor section.
2644 Like default_ctor_section_asm_out_constructor in varasm.c
2645 except that it uses .init_array (or .fini_array) and it
2646 handles constructor priorities. */
2649 rx_elf_asm_cdtor (rtx symbol
, int priority
, bool is_ctor
)
2653 if (priority
!= DEFAULT_INIT_PRIORITY
)
2657 sprintf (buf
, "%s.%.5u",
2658 is_ctor
? ".init_array" : ".fini_array",
2660 s
= get_section (buf
, SECTION_WRITE
, NULL_TREE
);
2667 switch_to_section (s
);
2668 assemble_align (POINTER_SIZE
);
2669 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
2673 rx_elf_asm_constructor (rtx symbol
, int priority
)
2675 rx_elf_asm_cdtor (symbol
, priority
, /* is_ctor= */true);
2679 rx_elf_asm_destructor (rtx symbol
, int priority
)
2681 rx_elf_asm_cdtor (symbol
, priority
, /* is_ctor= */false);
2684 /* Check "fast_interrupt", "interrupt" and "naked" attributes. */
2687 rx_handle_func_attribute (tree
* node
,
2689 tree args ATTRIBUTE_UNUSED
,
2690 int flags ATTRIBUTE_UNUSED
,
2691 bool * no_add_attrs
)
2693 gcc_assert (DECL_P (* node
));
2695 if (TREE_CODE (* node
) != FUNCTION_DECL
)
2697 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
2699 * no_add_attrs
= true;
2702 /* FIXME: We ought to check for conflicting attributes. */
2704 /* FIXME: We ought to check that the interrupt and exception
2705 handler attributes have been applied to void functions. */
2709 /* Check "vector" attribute. */
2712 rx_handle_vector_attribute (tree
* node
,
2715 int flags ATTRIBUTE_UNUSED
,
2716 bool * no_add_attrs
)
2718 gcc_assert (DECL_P (* node
));
2719 gcc_assert (args
!= NULL_TREE
);
2721 if (TREE_CODE (* node
) != FUNCTION_DECL
)
2723 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
2725 * no_add_attrs
= true;
2731 /* Table of RX specific attributes. */
2732 const struct attribute_spec rx_attribute_table
[] =
2734 /* Name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2735 affects_type_identity. */
2736 { "fast_interrupt", 0, 0, true, false, false, rx_handle_func_attribute
,
2738 { "interrupt", 0, -1, true, false, false, rx_handle_func_attribute
,
2740 { "naked", 0, 0, true, false, false, rx_handle_func_attribute
,
2742 { "vector", 1, -1, true, false, false, rx_handle_vector_attribute
,
2744 { NULL
, 0, 0, false, false, false, NULL
, false }
2747 /* Implement TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE. */
2750 rx_override_options_after_change (void)
2752 static bool first_time
= TRUE
;
2756 /* If this is the first time through and the user has not disabled
2757 the use of RX FPU hardware then enable -ffinite-math-only,
2758 since the FPU instructions do not support NaNs and infinities. */
2760 flag_finite_math_only
= 1;
2766 /* Alert the user if they are changing the optimization options
2767 to use IEEE compliant floating point arithmetic with RX FPU insns. */
2769 && !flag_finite_math_only
)
2770 warning (0, "RX FPU instructions do not support NaNs and infinities");
2775 rx_option_override (void)
2778 cl_deferred_option
*opt
;
2779 vec
<cl_deferred_option
> *v
= (vec
<cl_deferred_option
> *) rx_deferred_options
;
2782 FOR_EACH_VEC_ELT (*v
, i
, opt
)
2784 switch (opt
->opt_index
)
2786 case OPT_mint_register_
:
2790 fixed_regs
[10] = call_used_regs
[10] = 1;
2793 fixed_regs
[11] = call_used_regs
[11] = 1;
2796 fixed_regs
[12] = call_used_regs
[12] = 1;
2799 fixed_regs
[13] = call_used_regs
[13] = 1;
2802 rx_num_interrupt_regs
= opt
->value
;
2805 rx_num_interrupt_regs
= 0;
2806 /* Error message already given because rx_handle_option
2817 /* This target defaults to strict volatile bitfields. */
2818 if (flag_strict_volatile_bitfields
< 0 && abi_version_at_least(2))
2819 flag_strict_volatile_bitfields
= 1;
2821 rx_override_options_after_change ();
2823 /* These values are bytes, not log. */
2824 if (align_jumps
== 0 && ! optimize_size
)
2825 align_jumps
= ((rx_cpu_type
== RX100
|| rx_cpu_type
== RX200
) ? 4 : 8);
2826 if (align_loops
== 0 && ! optimize_size
)
2827 align_loops
= ((rx_cpu_type
== RX100
|| rx_cpu_type
== RX200
) ? 4 : 8);
2828 if (align_labels
== 0 && ! optimize_size
)
2829 align_labels
= ((rx_cpu_type
== RX100
|| rx_cpu_type
== RX200
) ? 4 : 8);
2834 rx_allocate_stack_slots_for_args (void)
2836 /* Naked functions should not allocate stack slots for arguments. */
2837 return ! is_naked_func (NULL_TREE
);
2841 rx_func_attr_inlinable (const_tree decl
)
2843 return ! is_fast_interrupt_func (decl
)
2844 && ! is_interrupt_func (decl
)
2845 && ! is_naked_func (decl
);
2849 rx_warn_func_return (tree decl
)
2851 /* Naked functions are implemented entirely in assembly, including the
2852 return sequence, so suppress warnings about this. */
2853 return !is_naked_func (decl
);
2856 /* Return nonzero if it is ok to make a tail-call to DECL,
2857 a function_decl or NULL if this is an indirect call, using EXP */
2860 rx_function_ok_for_sibcall (tree decl
, tree exp ATTRIBUTE_UNUSED
)
2865 /* Do not allow indirect tailcalls. The
2866 sibcall patterns do not support them. */
2870 /* Never tailcall from inside interrupt handlers or naked functions. */
2871 if (is_fast_interrupt_func (NULL_TREE
)
2872 || is_interrupt_func (NULL_TREE
)
2873 || is_naked_func (NULL_TREE
))
2880 rx_file_start (void)
2882 if (! TARGET_AS100_SYNTAX
)
2883 default_file_start ();
2887 rx_is_ms_bitfield_layout (const_tree record_type ATTRIBUTE_UNUSED
)
2889 /* The packed attribute overrides the MS behavior. */
2890 return ! TYPE_PACKED (record_type
);
2893 /* Returns true if X a legitimate constant for an immediate
2894 operand on the RX. X is already known to satisfy CONSTANT_P. */
2897 rx_is_legitimate_constant (machine_mode mode ATTRIBUTE_UNUSED
, rtx x
)
2899 switch (GET_CODE (x
))
2904 if (GET_CODE (x
) == PLUS
)
2906 if (! CONST_INT_P (XEXP (x
, 1)))
2909 /* GCC would not pass us CONST_INT + CONST_INT so we
2910 know that we have {SYMBOL|LABEL} + CONST_INT. */
2912 gcc_assert (! CONST_INT_P (x
));
2915 switch (GET_CODE (x
))
2922 return XINT (x
, 1) == UNSPEC_CONST
|| XINT (x
, 1) == UNSPEC_PID_ADDR
;
2925 /* FIXME: Can this ever happen ? */
2934 return (rx_max_constant_size
== 0 || rx_max_constant_size
== 4);
2938 gcc_assert (CONST_INT_P (x
));
2942 return ok_for_max_constant (INTVAL (x
));
2946 rx_address_cost (rtx addr
, machine_mode mode ATTRIBUTE_UNUSED
,
2947 addr_space_t as ATTRIBUTE_UNUSED
, bool speed
)
2951 if (GET_CODE (addr
) != PLUS
)
2952 return COSTS_N_INSNS (1);
2957 if (REG_P (a
) && REG_P (b
))
2958 /* Try to discourage REG+REG addressing as it keeps two registers live. */
2959 return COSTS_N_INSNS (4);
2962 /* [REG+OFF] is just as fast as [REG]. */
2963 return COSTS_N_INSNS (1);
2966 && ((INTVAL (b
) > 128) || INTVAL (b
) < -127))
2967 /* Try to discourage REG + <large OFF> when optimizing for size. */
2968 return COSTS_N_INSNS (2);
2970 return COSTS_N_INSNS (1);
2974 rx_can_eliminate (const int from ATTRIBUTE_UNUSED
, const int to
)
2976 /* We can always eliminate to the frame pointer.
2977 We can eliminate to the stack pointer unless a frame
2978 pointer is needed. */
2980 return to
== FRAME_POINTER_REGNUM
2981 || ( to
== STACK_POINTER_REGNUM
&& ! frame_pointer_needed
);
2986 rx_trampoline_template (FILE * file
)
2988 /* Output assembler code for a block containing the constant
2989 part of a trampoline, leaving space for the variable parts.
2991 On the RX, (where r8 is the static chain regnum) the trampoline
2994 mov #<static chain value>, r8
2995 mov #<function's address>, r9
2998 In big-endian-data-mode however instructions are read into the CPU
2999 4 bytes at a time. These bytes are then swapped around before being
3000 passed to the decoder. So...we must partition our trampoline into
3001 4 byte packets and swap these packets around so that the instruction
3002 reader will reverse the process. But, in order to avoid splitting
3003 the 32-bit constants across these packet boundaries, (making inserting
3004 them into the constructed trampoline very difficult) we have to pad the
3005 instruction sequence with NOP insns. ie:
3017 if (! TARGET_BIG_ENDIAN_DATA
)
3019 asm_fprintf (file
, "\tmov.L\t#0deadbeefH, r%d\n", STATIC_CHAIN_REGNUM
);
3020 asm_fprintf (file
, "\tmov.L\t#0deadbeefH, r%d\n", TRAMPOLINE_TEMP_REGNUM
);
3021 asm_fprintf (file
, "\tjmp\tr%d\n", TRAMPOLINE_TEMP_REGNUM
);
3025 char r8
= '0' + STATIC_CHAIN_REGNUM
;
3026 char r9
= '0' + TRAMPOLINE_TEMP_REGNUM
;
3028 if (TARGET_AS100_SYNTAX
)
3030 asm_fprintf (file
, "\t.BYTE 0%c2H, 0fbH, 003H, 003H\n", r8
);
3031 asm_fprintf (file
, "\t.BYTE 0deH, 0adH, 0beH, 0efH\n");
3032 asm_fprintf (file
, "\t.BYTE 0%c2H, 0fbH, 003H, 003H\n", r9
);
3033 asm_fprintf (file
, "\t.BYTE 0deH, 0adH, 0beH, 0efH\n");
3034 asm_fprintf (file
, "\t.BYTE 003H, 003H, 00%cH, 07fH\n", r9
);
3038 asm_fprintf (file
, "\t.byte 0x%c2, 0xfb, 0x03, 0x03\n", r8
);
3039 asm_fprintf (file
, "\t.byte 0xde, 0xad, 0xbe, 0xef\n");
3040 asm_fprintf (file
, "\t.byte 0x%c2, 0xfb, 0x03, 0x03\n", r9
);
3041 asm_fprintf (file
, "\t.byte 0xde, 0xad, 0xbe, 0xef\n");
3042 asm_fprintf (file
, "\t.byte 0x03, 0x03, 0x0%c, 0x7f\n", r9
);
3048 rx_trampoline_init (rtx tramp
, tree fndecl
, rtx chain
)
3050 rtx fnaddr
= XEXP (DECL_RTL (fndecl
), 0);
3052 emit_block_move (tramp
, assemble_trampoline_template (),
3053 GEN_INT (TRAMPOLINE_SIZE
), BLOCK_OP_NORMAL
);
3055 if (TARGET_BIG_ENDIAN_DATA
)
3057 emit_move_insn (adjust_address (tramp
, SImode
, 4), chain
);
3058 emit_move_insn (adjust_address (tramp
, SImode
, 12), fnaddr
);
3062 emit_move_insn (adjust_address (tramp
, SImode
, 2), chain
);
3063 emit_move_insn (adjust_address (tramp
, SImode
, 6 + 2), fnaddr
);
3068 rx_memory_move_cost (machine_mode mode ATTRIBUTE_UNUSED
,
3069 reg_class_t regclass ATTRIBUTE_UNUSED
,
3072 return (in
? 2 : 0) + REGISTER_MOVE_COST (mode
, regclass
, regclass
);
3075 /* Convert a CC_MODE to the set of flags that it represents. */
3078 flags_from_mode (machine_mode mode
)
3083 return CC_FLAG_S
| CC_FLAG_Z
;
3085 return CC_FLAG_S
| CC_FLAG_Z
| CC_FLAG_O
;
3087 return CC_FLAG_S
| CC_FLAG_Z
| CC_FLAG_C
;
3089 return CC_FLAG_S
| CC_FLAG_Z
| CC_FLAG_O
| CC_FLAG_C
;
3097 /* Convert a set of flags to a CC_MODE that can implement it. */
3100 mode_from_flags (unsigned int f
)
3111 else if (f
& CC_FLAG_C
)
3117 /* Convert an RTX_CODE to the set of flags needed to implement it.
3118 This assumes an integer comparison. */
3121 flags_from_code (enum rtx_code code
)
3130 return CC_FLAG_S
| CC_FLAG_O
| CC_FLAG_Z
;
3136 return CC_FLAG_C
| CC_FLAG_Z
;
3145 /* Return a CC_MODE of which both M1 and M2 are subsets. */
3148 rx_cc_modes_compatible (machine_mode m1
, machine_mode m2
)
3152 /* Early out for identical modes. */
3156 /* There's no valid combination for FP vs non-FP. */
3157 f
= flags_from_mode (m1
) | flags_from_mode (m2
);
3161 /* Otherwise, see what mode can implement all the flags. */
3162 return mode_from_flags (f
);
3165 /* Return the minimal CC mode needed to implement (CMP_CODE X Y). */
3168 rx_select_cc_mode (enum rtx_code cmp_code
, rtx x
, rtx y
)
3170 if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
3173 if (y
!= const0_rtx
)
3176 return mode_from_flags (flags_from_code (cmp_code
));
3179 /* Split the conditional branch. Emit (COMPARE C1 C2) into CC_REG with
3180 CC_MODE, and use that in branches based on that compare. */
3183 rx_split_cbranch (machine_mode cc_mode
, enum rtx_code cmp1
,
3184 rtx c1
, rtx c2
, rtx label
)
3188 flags
= gen_rtx_REG (cc_mode
, CC_REG
);
3189 x
= gen_rtx_COMPARE (cc_mode
, c1
, c2
);
3190 x
= gen_rtx_SET (flags
, x
);
3193 x
= gen_rtx_fmt_ee (cmp1
, VOIDmode
, flags
, const0_rtx
);
3194 x
= gen_rtx_IF_THEN_ELSE (VOIDmode
, x
, label
, pc_rtx
);
3195 x
= gen_rtx_SET (pc_rtx
, x
);
3199 /* A helper function for matching parallels that set the flags. */
3202 rx_match_ccmode (rtx insn
, machine_mode cc_mode
)
3205 machine_mode flags_mode
;
3207 gcc_checking_assert (XVECLEN (PATTERN (insn
), 0) == 2);
3209 op1
= XVECEXP (PATTERN (insn
), 0, 0);
3210 gcc_checking_assert (GET_CODE (SET_SRC (op1
)) == COMPARE
);
3212 flags
= SET_DEST (op1
);
3213 flags_mode
= GET_MODE (flags
);
3215 if (GET_MODE (SET_SRC (op1
)) != flags_mode
)
3217 if (GET_MODE_CLASS (flags_mode
) != MODE_CC
)
3220 /* Ensure that the mode of FLAGS is compatible with CC_MODE. */
3221 if (flags_from_mode (flags_mode
) & ~flags_from_mode (cc_mode
))
3228 rx_align_for_label (rtx lab
, int uses_threshold
)
3230 /* This is a simple heuristic to guess when an alignment would not be useful
3231 because the delay due to the inserted NOPs would be greater than the delay
3232 due to the misaligned branch. If uses_threshold is zero then the alignment
3233 is always useful. */
3234 if (LABEL_P (lab
) && LABEL_NUSES (lab
) < uses_threshold
)
3239 /* These values are log, not bytes. */
3240 if (rx_cpu_type
== RX100
|| rx_cpu_type
== RX200
)
3241 return 2; /* 4 bytes */
3242 return 3; /* 8 bytes */
3246 rx_max_skip_for_label (rtx_insn
*lab
)
3260 op
= next_nonnote_nondebug_insn (op
);
3262 while (op
&& (LABEL_P (op
)
3263 || (INSN_P (op
) && GET_CODE (PATTERN (op
)) == USE
)));
3267 opsize
= get_attr_length (op
);
3268 if (opsize
>= 0 && opsize
< 8)
3273 /* Compute the real length of the extending load-and-op instructions. */
3276 rx_adjust_insn_length (rtx_insn
*insn
, int current_length
)
3278 rtx extend
, mem
, offset
;
3283 return current_length
;
3285 switch (INSN_CODE (insn
))
3288 return current_length
;
3290 case CODE_FOR_plussi3_zero_extendhi
:
3291 case CODE_FOR_andsi3_zero_extendhi
:
3292 case CODE_FOR_iorsi3_zero_extendhi
:
3293 case CODE_FOR_xorsi3_zero_extendhi
:
3294 case CODE_FOR_divsi3_zero_extendhi
:
3295 case CODE_FOR_udivsi3_zero_extendhi
:
3296 case CODE_FOR_minussi3_zero_extendhi
:
3297 case CODE_FOR_smaxsi3_zero_extendhi
:
3298 case CODE_FOR_sminsi3_zero_extendhi
:
3299 case CODE_FOR_multsi3_zero_extendhi
:
3300 case CODE_FOR_comparesi3_zero_extendhi
:
3305 case CODE_FOR_plussi3_sign_extendhi
:
3306 case CODE_FOR_andsi3_sign_extendhi
:
3307 case CODE_FOR_iorsi3_sign_extendhi
:
3308 case CODE_FOR_xorsi3_sign_extendhi
:
3309 case CODE_FOR_divsi3_sign_extendhi
:
3310 case CODE_FOR_udivsi3_sign_extendhi
:
3311 case CODE_FOR_minussi3_sign_extendhi
:
3312 case CODE_FOR_smaxsi3_sign_extendhi
:
3313 case CODE_FOR_sminsi3_sign_extendhi
:
3314 case CODE_FOR_multsi3_sign_extendhi
:
3315 case CODE_FOR_comparesi3_sign_extendhi
:
3320 case CODE_FOR_plussi3_zero_extendqi
:
3321 case CODE_FOR_andsi3_zero_extendqi
:
3322 case CODE_FOR_iorsi3_zero_extendqi
:
3323 case CODE_FOR_xorsi3_zero_extendqi
:
3324 case CODE_FOR_divsi3_zero_extendqi
:
3325 case CODE_FOR_udivsi3_zero_extendqi
:
3326 case CODE_FOR_minussi3_zero_extendqi
:
3327 case CODE_FOR_smaxsi3_zero_extendqi
:
3328 case CODE_FOR_sminsi3_zero_extendqi
:
3329 case CODE_FOR_multsi3_zero_extendqi
:
3330 case CODE_FOR_comparesi3_zero_extendqi
:
3335 case CODE_FOR_plussi3_sign_extendqi
:
3336 case CODE_FOR_andsi3_sign_extendqi
:
3337 case CODE_FOR_iorsi3_sign_extendqi
:
3338 case CODE_FOR_xorsi3_sign_extendqi
:
3339 case CODE_FOR_divsi3_sign_extendqi
:
3340 case CODE_FOR_udivsi3_sign_extendqi
:
3341 case CODE_FOR_minussi3_sign_extendqi
:
3342 case CODE_FOR_smaxsi3_sign_extendqi
:
3343 case CODE_FOR_sminsi3_sign_extendqi
:
3344 case CODE_FOR_multsi3_sign_extendqi
:
3345 case CODE_FOR_comparesi3_sign_extendqi
:
3351 /* We are expecting: (SET (REG) (<OP> (REG) (<EXTEND> (MEM)))). */
3352 extend
= single_set (insn
);
3353 gcc_assert (extend
!= NULL_RTX
);
3355 extend
= SET_SRC (extend
);
3356 if (GET_CODE (XEXP (extend
, 0)) == ZERO_EXTEND
3357 || GET_CODE (XEXP (extend
, 0)) == SIGN_EXTEND
)
3358 extend
= XEXP (extend
, 0);
3360 extend
= XEXP (extend
, 1);
3362 gcc_assert ((zero
&& (GET_CODE (extend
) == ZERO_EXTEND
))
3363 || (! zero
&& (GET_CODE (extend
) == SIGN_EXTEND
)));
3365 mem
= XEXP (extend
, 0);
3366 gcc_checking_assert (MEM_P (mem
));
3367 if (REG_P (XEXP (mem
, 0)))
3368 return (zero
&& factor
== 1) ? 2 : 3;
3370 /* We are expecting: (MEM (PLUS (REG) (CONST_INT))). */
3371 gcc_checking_assert (GET_CODE (XEXP (mem
, 0)) == PLUS
);
3372 gcc_checking_assert (REG_P (XEXP (XEXP (mem
, 0), 0)));
3374 offset
= XEXP (XEXP (mem
, 0), 1);
3375 gcc_checking_assert (GET_CODE (offset
) == CONST_INT
);
3377 if (IN_RANGE (INTVAL (offset
), 0, 255 * factor
))
3378 return (zero
&& factor
== 1) ? 3 : 4;
3380 return (zero
&& factor
== 1) ? 4 : 5;
3384 rx_narrow_volatile_bitfield (void)
3390 rx_ok_to_inline (tree caller
, tree callee
)
3392 /* Do not inline functions with local variables
3393 into a naked CALLER - naked function have no stack frame and
3394 locals need a frame in order to have somewhere to live.
3396 Unfortunately we have no way to determine the presence of
3397 local variables in CALLEE, so we have to be cautious and
3398 assume that there might be some there.
3400 We do allow inlining when CALLEE has the "inline" type
3401 modifier or the "always_inline" or "gnu_inline" attributes. */
3402 return lookup_attribute ("naked", DECL_ATTRIBUTES (caller
)) == NULL_TREE
3403 || DECL_DECLARED_INLINE_P (callee
)
3404 || lookup_attribute ("always_inline", DECL_ATTRIBUTES (callee
)) != NULL_TREE
3405 || lookup_attribute ("gnu_inline", DECL_ATTRIBUTES (callee
)) != NULL_TREE
;
3409 rx_enable_lra (void)
3411 return TARGET_ENABLE_LRA
;
3414 rx_atomic_sequence::rx_atomic_sequence (const_tree fun_decl
)
3416 if (is_fast_interrupt_func (fun_decl
) || is_interrupt_func (fun_decl
))
3418 /* If we are inside an interrupt handler, assume that interrupts are
3419 off -- which is the default hardware behavior. In this case, there
3420 is no need to disable the interrupts. */
3421 m_prev_psw_reg
= NULL
;
3425 m_prev_psw_reg
= gen_reg_rtx (SImode
);
3426 emit_insn (gen_mvfc (m_prev_psw_reg
, GEN_INT (CTRLREG_PSW
)));
3427 emit_insn (gen_clrpsw (GEN_INT ('I')));
3431 rx_atomic_sequence::~rx_atomic_sequence (void)
3433 if (m_prev_psw_reg
!= NULL
)
3434 emit_insn (gen_mvtc (GEN_INT (CTRLREG_PSW
), m_prev_psw_reg
));
3437 /* Implement TARGET_HARD_REGNO_MODE_OK. */
3440 rx_hard_regno_mode_ok (unsigned int regno
, machine_mode
)
3442 return REGNO_REG_CLASS (regno
) == GR_REGS
;
3445 #undef TARGET_NARROW_VOLATILE_BITFIELD
3446 #define TARGET_NARROW_VOLATILE_BITFIELD rx_narrow_volatile_bitfield
3448 #undef TARGET_CAN_INLINE_P
3449 #define TARGET_CAN_INLINE_P rx_ok_to_inline
3451 #undef TARGET_ASM_JUMP_ALIGN_MAX_SKIP
3452 #define TARGET_ASM_JUMP_ALIGN_MAX_SKIP rx_max_skip_for_label
3453 #undef TARGET_ASM_LOOP_ALIGN_MAX_SKIP
3454 #define TARGET_ASM_LOOP_ALIGN_MAX_SKIP rx_max_skip_for_label
3455 #undef TARGET_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
3456 #define TARGET_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP rx_max_skip_for_label
3457 #undef TARGET_ASM_LABEL_ALIGN_MAX_SKIP
3458 #define TARGET_ASM_LABEL_ALIGN_MAX_SKIP rx_max_skip_for_label
3460 #undef TARGET_FUNCTION_VALUE
3461 #define TARGET_FUNCTION_VALUE rx_function_value
3463 #undef TARGET_RETURN_IN_MSB
3464 #define TARGET_RETURN_IN_MSB rx_return_in_msb
3466 #undef TARGET_IN_SMALL_DATA_P
3467 #define TARGET_IN_SMALL_DATA_P rx_in_small_data
3469 #undef TARGET_RETURN_IN_MEMORY
3470 #define TARGET_RETURN_IN_MEMORY rx_return_in_memory
3472 #undef TARGET_HAVE_SRODATA_SECTION
3473 #define TARGET_HAVE_SRODATA_SECTION true
3475 #undef TARGET_ASM_SELECT_RTX_SECTION
3476 #define TARGET_ASM_SELECT_RTX_SECTION rx_select_rtx_section
3478 #undef TARGET_ASM_SELECT_SECTION
3479 #define TARGET_ASM_SELECT_SECTION rx_select_section
3481 #undef TARGET_INIT_BUILTINS
3482 #define TARGET_INIT_BUILTINS rx_init_builtins
3484 #undef TARGET_BUILTIN_DECL
3485 #define TARGET_BUILTIN_DECL rx_builtin_decl
3487 #undef TARGET_EXPAND_BUILTIN
3488 #define TARGET_EXPAND_BUILTIN rx_expand_builtin
3490 #undef TARGET_ASM_CONSTRUCTOR
3491 #define TARGET_ASM_CONSTRUCTOR rx_elf_asm_constructor
3493 #undef TARGET_ASM_DESTRUCTOR
3494 #define TARGET_ASM_DESTRUCTOR rx_elf_asm_destructor
3496 #undef TARGET_STRUCT_VALUE_RTX
3497 #define TARGET_STRUCT_VALUE_RTX rx_struct_value_rtx
3499 #undef TARGET_ATTRIBUTE_TABLE
3500 #define TARGET_ATTRIBUTE_TABLE rx_attribute_table
3502 #undef TARGET_ASM_FILE_START
3503 #define TARGET_ASM_FILE_START rx_file_start
3505 #undef TARGET_MS_BITFIELD_LAYOUT_P
3506 #define TARGET_MS_BITFIELD_LAYOUT_P rx_is_ms_bitfield_layout
3508 #undef TARGET_LEGITIMATE_ADDRESS_P
3509 #define TARGET_LEGITIMATE_ADDRESS_P rx_is_legitimate_address
3511 #undef TARGET_MODE_DEPENDENT_ADDRESS_P
3512 #define TARGET_MODE_DEPENDENT_ADDRESS_P rx_mode_dependent_address_p
3514 #undef TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS
3515 #define TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS rx_allocate_stack_slots_for_args
3517 #undef TARGET_ASM_FUNCTION_PROLOGUE
3518 #define TARGET_ASM_FUNCTION_PROLOGUE rx_output_function_prologue
3520 #undef TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P
3521 #define TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P rx_func_attr_inlinable
3523 #undef TARGET_FUNCTION_OK_FOR_SIBCALL
3524 #define TARGET_FUNCTION_OK_FOR_SIBCALL rx_function_ok_for_sibcall
3526 #undef TARGET_FUNCTION_ARG
3527 #define TARGET_FUNCTION_ARG rx_function_arg
3529 #undef TARGET_FUNCTION_ARG_ADVANCE
3530 #define TARGET_FUNCTION_ARG_ADVANCE rx_function_arg_advance
3532 #undef TARGET_FUNCTION_ARG_BOUNDARY
3533 #define TARGET_FUNCTION_ARG_BOUNDARY rx_function_arg_boundary
3535 #undef TARGET_SET_CURRENT_FUNCTION
3536 #define TARGET_SET_CURRENT_FUNCTION rx_set_current_function
3538 #undef TARGET_ASM_INTEGER
3539 #define TARGET_ASM_INTEGER rx_assemble_integer
3541 #undef TARGET_USE_BLOCKS_FOR_CONSTANT_P
3542 #define TARGET_USE_BLOCKS_FOR_CONSTANT_P hook_bool_mode_const_rtx_true
3544 #undef TARGET_MAX_ANCHOR_OFFSET
3545 #define TARGET_MAX_ANCHOR_OFFSET 32
3547 #undef TARGET_ADDRESS_COST
3548 #define TARGET_ADDRESS_COST rx_address_cost
3550 #undef TARGET_CAN_ELIMINATE
3551 #define TARGET_CAN_ELIMINATE rx_can_eliminate
3553 #undef TARGET_CONDITIONAL_REGISTER_USAGE
3554 #define TARGET_CONDITIONAL_REGISTER_USAGE rx_conditional_register_usage
3556 #undef TARGET_ASM_TRAMPOLINE_TEMPLATE
3557 #define TARGET_ASM_TRAMPOLINE_TEMPLATE rx_trampoline_template
3559 #undef TARGET_TRAMPOLINE_INIT
3560 #define TARGET_TRAMPOLINE_INIT rx_trampoline_init
3562 #undef TARGET_PRINT_OPERAND
3563 #define TARGET_PRINT_OPERAND rx_print_operand
3565 #undef TARGET_PRINT_OPERAND_ADDRESS
3566 #define TARGET_PRINT_OPERAND_ADDRESS rx_print_operand_address
3568 #undef TARGET_CC_MODES_COMPATIBLE
3569 #define TARGET_CC_MODES_COMPATIBLE rx_cc_modes_compatible
3571 #undef TARGET_MEMORY_MOVE_COST
3572 #define TARGET_MEMORY_MOVE_COST rx_memory_move_cost
3574 #undef TARGET_OPTION_OVERRIDE
3575 #define TARGET_OPTION_OVERRIDE rx_option_override
3577 #undef TARGET_PROMOTE_FUNCTION_MODE
3578 #define TARGET_PROMOTE_FUNCTION_MODE rx_promote_function_mode
3580 #undef TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE
3581 #define TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE rx_override_options_after_change
3583 #undef TARGET_FLAGS_REGNUM
3584 #define TARGET_FLAGS_REGNUM CC_REG
3586 #undef TARGET_LEGITIMATE_CONSTANT_P
3587 #define TARGET_LEGITIMATE_CONSTANT_P rx_is_legitimate_constant
3589 #undef TARGET_LEGITIMIZE_ADDRESS
3590 #define TARGET_LEGITIMIZE_ADDRESS rx_legitimize_address
3592 #undef TARGET_WARN_FUNC_RETURN
3593 #define TARGET_WARN_FUNC_RETURN rx_warn_func_return
3596 #define TARGET_LRA_P rx_enable_lra
3598 #undef TARGET_HARD_REGNO_MODE_OK
3599 #define TARGET_HARD_REGNO_MODE_OK rx_hard_regno_mode_ok
3601 struct gcc_target targetm
= TARGET_INITIALIZER
;