1 /* Definitions for GCC. Part of the machine description for CRIS.
2 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004
3 Free Software Foundation, Inc.
4 Contributed by Axis Communications. Written by Hans-Peter Nilsson.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
25 #include "coretypes.h"
29 #include "hard-reg-set.h"
31 #include "insn-config.h"
32 #include "conditions.h"
33 #include "insn-attr.h"
45 #include "target-def.h"
49 /* Usable when we have an amount to add or subtract, and want the
50 optimal size of the insn. */
51 #define ADDITIVE_SIZE_MODIFIER(size) \
52 ((size) <= 63 ? "q" : (size) <= 255 ? "u.b" : (size) <= 65535 ? "u.w" : ".d")
54 #define ASSERT_PLT_UNSPEC(x) \
57 if (XEXP (x, 1) != NULL_RTX \
58 || (GET_CODE (XVECEXP (x, 0, 0)) != SYMBOL_REF \
59 && GET_CODE (XVECEXP (x, 0, 0)) != LABEL_REF)) \
63 #define LOSE_AND_RETURN(msgid, x) \
66 cris_operand_lossage (msgid, x); \
70 /* Per-function machine data. */
71 struct machine_function
GTY(())
73 int needs_return_address_on_stack
;
76 /* This little fix suppresses the 'u' or 's' when '%e' in assembly
78 static char cris_output_insn_is_bound
= 0;
80 /* This one suppresses printing out the "rPIC+" in
81 "rPIC+sym:GOTOFF+offset" when doing PIC. For a PLT symbol, it
82 suppresses outputting it as [rPIC+sym:GOTPLT] and outputs similarly
83 just the "sym:GOTOFF" part. */
84 static int cris_pic_sympart_only
= 0;
86 /* Fix for reg_overlap_mentioned_p. */
87 static int cris_reg_overlap_mentioned_p (rtx
, rtx
);
89 static void cris_print_base (rtx
, FILE *);
91 static void cris_print_index (rtx
, FILE *);
93 static struct machine_function
* cris_init_machine_status (void);
95 static rtx
cris_struct_value_rtx (tree
, int);
97 static void cris_setup_incoming_varargs (CUMULATIVE_ARGS
*, enum machine_mode
,
98 tree type
, int *, int);
100 static int cris_initial_frame_pointer_offset (void);
102 static int saved_regs_mentioned (rtx
);
104 static void cris_target_asm_function_prologue (FILE *, HOST_WIDE_INT
);
106 static void cris_target_asm_function_epilogue (FILE *, HOST_WIDE_INT
);
108 static void cris_operand_lossage (const char *, rtx
);
110 static void cris_asm_output_mi_thunk
111 (FILE *, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
, tree
);
113 static void cris_file_start (void);
114 static void cris_init_libfuncs (void);
116 static bool cris_rtx_costs (rtx
, int, int, int *);
117 static int cris_address_cost (rtx
);
118 static bool cris_pass_by_reference (CUMULATIVE_ARGS
*, enum machine_mode
,
121 /* The function cris_target_asm_function_epilogue puts the last insn to
122 output here. It always fits; there won't be a symbol operand. Used in
123 delay_slots_for_epilogue and function_epilogue. */
124 static char save_last
[80];
126 /* This is the argument from the "-max-stack-stackframe=" option. */
127 const char *cris_max_stackframe_str
;
129 /* This is the argument from the "-march=" option. */
130 const char *cris_cpu_str
;
132 /* This is the argument from the "-mtune=" option. */
133 const char *cris_tune_str
;
135 /* This is the argument from the "-melinux-stacksize=" option. */
136 const char *cris_elinux_stacksize_str
;
138 /* This is the parsed result of the "-max-stack-stackframe=" option. If
139 it (still) is zero, then there was no such option given. */
140 int cris_max_stackframe
= 0;
142 /* This is the parsed result of the "-march=" option, if given. */
143 int cris_cpu_version
= CRIS_DEFAULT_CPU_VERSION
;
145 #undef TARGET_ASM_ALIGNED_HI_OP
146 #define TARGET_ASM_ALIGNED_HI_OP "\t.word\t"
147 #undef TARGET_ASM_ALIGNED_SI_OP
148 #define TARGET_ASM_ALIGNED_SI_OP "\t.dword\t"
149 #undef TARGET_ASM_ALIGNED_DI_OP
150 #define TARGET_ASM_ALIGNED_DI_OP "\t.quad\t"
152 /* We need to define these, since the 2byte, 4byte, 8byte op:s are only
153 available in ELF. These "normal" pseudos do not have any alignment
154 constraints or side-effects. */
155 #undef TARGET_ASM_UNALIGNED_HI_OP
156 #define TARGET_ASM_UNALIGNED_HI_OP TARGET_ASM_ALIGNED_HI_OP
158 #undef TARGET_ASM_UNALIGNED_SI_OP
159 #define TARGET_ASM_UNALIGNED_SI_OP TARGET_ASM_ALIGNED_SI_OP
161 #undef TARGET_ASM_UNALIGNED_DI_OP
162 #define TARGET_ASM_UNALIGNED_DI_OP TARGET_ASM_ALIGNED_DI_OP
164 #undef TARGET_ASM_FUNCTION_PROLOGUE
165 #define TARGET_ASM_FUNCTION_PROLOGUE cris_target_asm_function_prologue
167 #undef TARGET_ASM_FUNCTION_EPILOGUE
168 #define TARGET_ASM_FUNCTION_EPILOGUE cris_target_asm_function_epilogue
170 #undef TARGET_ASM_OUTPUT_MI_THUNK
171 #define TARGET_ASM_OUTPUT_MI_THUNK cris_asm_output_mi_thunk
172 #undef TARGET_ASM_CAN_OUTPUT_MI_THUNK
173 #define TARGET_ASM_CAN_OUTPUT_MI_THUNK default_can_output_mi_thunk_no_vcall
175 #undef TARGET_ASM_FILE_START
176 #define TARGET_ASM_FILE_START cris_file_start
178 #undef TARGET_INIT_LIBFUNCS
179 #define TARGET_INIT_LIBFUNCS cris_init_libfuncs
181 #undef TARGET_RTX_COSTS
182 #define TARGET_RTX_COSTS cris_rtx_costs
183 #undef TARGET_ADDRESS_COST
184 #define TARGET_ADDRESS_COST cris_address_cost
186 #undef TARGET_PROMOTE_FUNCTION_ARGS
187 #define TARGET_PROMOTE_FUNCTION_ARGS hook_bool_tree_true
188 #undef TARGET_STRUCT_VALUE_RTX
189 #define TARGET_STRUCT_VALUE_RTX cris_struct_value_rtx
190 #undef TARGET_SETUP_INCOMING_VARARGS
191 #define TARGET_SETUP_INCOMING_VARARGS cris_setup_incoming_varargs
192 #undef TARGET_PASS_BY_REFERENCE
193 #define TARGET_PASS_BY_REFERENCE cris_pass_by_reference
195 struct gcc_target targetm
= TARGET_INITIALIZER
;
197 /* Predicate functions. */
199 /* This checks a part of an address, the one that is not a plain register
200 for an addressing mode using BDAP.
201 Allowed operands is either:
203 b) a CONST operand (but not a symbol when generating PIC)
204 c) a [r] or [r+] in SImode, or sign-extend from HI or QI. */
207 cris_bdap_operand (rtx op
, enum machine_mode mode
)
209 register enum rtx_code code
= GET_CODE (op
);
211 if (mode
!= SImode
&& (mode
!= VOIDmode
|| GET_MODE (op
) != VOIDmode
))
214 /* Just return whether this is a simple register or constant. */
215 if (register_operand (op
, mode
)
216 || (CONSTANT_P (op
) && !(flag_pic
&& cris_symbol (op
))))
219 /* Is it a [r] or possibly a [r+]? */
222 rtx tem
= XEXP (op
, 0);
225 && (register_operand (tem
, SImode
)
226 || (GET_CODE (tem
) == POST_INC
227 && register_operand (XEXP (tem
, 0), SImode
))))
233 /* Perhaps a sign-extended mem: [r].(b|w) or [r+].(b|w)? */
234 if (code
== SIGN_EXTEND
)
236 rtx tem
= XEXP (op
, 0);
238 if (GET_CODE (tem
) != MEM
)
243 && (register_operand (tem
, SImode
)
244 || (GET_CODE (tem
) == POST_INC
245 && register_operand (XEXP (tem
, 0), SImode
))))
254 /* This is similar to cris_bdap_operand:
255 It checks a part of an address, the one that is not a plain register
256 for an addressing mode using BDAP *or* BIAP.
257 Allowed operands is either:
259 b) a CONST operand (but not a symbol when generating PIC)
260 c) a mult of (1, 2 or 4) and a register
261 d) a [r] or [r+] in SImode, or sign-extend from HI or QI. */
264 cris_bdap_biap_operand (rtx op
, enum machine_mode mode
)
266 register enum rtx_code code
= GET_CODE (op
);
270 /* Check for bdap operand. */
271 if (cris_bdap_operand (op
, mode
))
274 if (mode
!= SImode
&& (mode
!= VOIDmode
|| GET_MODE (op
) != VOIDmode
))
277 /* Check that we're looking at a BIAP operand. */
281 /* Canonicalize register and multiplicand. */
282 if (GET_CODE (XEXP (op
, 0)) == CONST_INT
)
293 /* Check that the operands are correct after canonicalization. */
294 if (! register_operand (reg
, SImode
) || GET_CODE (val
) != CONST_INT
)
297 /* Check that the multiplicand has a valid value. */
299 && (INTVAL (val
) == 1 || INTVAL (val
) == 2 || INTVAL (val
) == 4)))
305 /* Check if MODE is same as mode for X, and X is PLUS, MINUS, IOR or
309 cris_orthogonal_operator (rtx x
, enum machine_mode mode
)
311 enum rtx_code code
= GET_CODE (x
);
313 if (mode
== VOIDmode
)
316 return (GET_MODE (x
) == mode
317 && (code
== PLUS
|| code
== MINUS
318 || code
== IOR
|| code
== AND
|| code
== UMIN
));
321 /* Check if MODE is same as mode for X, and X is PLUS, IOR or AND or
325 cris_commutative_orth_op (rtx x
, enum machine_mode mode
)
327 enum rtx_code code
= GET_CODE (x
);
329 if (mode
== VOIDmode
)
332 return (GET_MODE (x
) == mode
&&
334 || code
== IOR
|| code
== AND
|| code
== UMIN
));
337 /* Check if MODE is same as mode for X, and X is PLUS or MINUS or UMIN.
338 By the name, you might think we should include MULT. We don't because
339 it doesn't accept the same addressing modes as the others (ony
340 registers) and there's also the problem of handling TARGET_MUL_BUG. */
343 cris_operand_extend_operator (rtx x
, enum machine_mode mode
)
345 enum rtx_code code
= GET_CODE (x
);
347 if (mode
== VOIDmode
)
350 return (GET_MODE (x
) == mode
351 && (code
== PLUS
|| code
== MINUS
|| code
== UMIN
));
354 /* Check if MODE is same as mode for X, and X is PLUS or MINUS. */
357 cris_additive_operand_extend_operator (rtx x
, enum machine_mode mode
)
359 enum rtx_code code
= GET_CODE (x
);
361 if (mode
== VOIDmode
)
364 return (GET_MODE (x
) == mode
365 && (code
== PLUS
|| code
== MINUS
));
368 /* Check to see if MODE is same as mode for X, and X is SIGN_EXTEND or
372 cris_extend_operator (rtx x
, enum machine_mode mode
)
374 enum rtx_code code
= GET_CODE (x
);
376 if (mode
== VOIDmode
)
380 (GET_MODE (x
) == mode
&& (code
== SIGN_EXTEND
|| code
== ZERO_EXTEND
));
383 /* Check to see if MODE is same as mode for X, and X is PLUS or BOUND. */
386 cris_plus_or_bound_operator (rtx x
, enum machine_mode mode
)
388 enum rtx_code code
= GET_CODE (x
);
390 if (mode
== VOIDmode
)
394 (GET_MODE (x
) == mode
&& (code
== UMIN
|| code
== PLUS
));
397 /* Used as an operator to get a handle on a already-known-valid MEM rtx:es
398 (no need to validate the address), where some address expression parts
399 have their own match_operand. */
402 cris_mem_op (rtx x
, enum machine_mode mode
)
404 if (mode
== VOIDmode
)
407 return GET_MODE (x
) == mode
&& GET_CODE (x
) == MEM
;
410 /* Since with -fPIC, not all symbols are valid PIC symbols or indeed
411 general_operands, we have to have a predicate that matches it for the
415 cris_general_operand_or_symbol (rtx op
, enum machine_mode mode
)
417 return general_operand (op
, mode
)
418 || (CONSTANT_P (op
) && cris_symbol (op
));
421 /* Since a PIC symbol without a GOT entry is not a general_operand, we
422 have to have a predicate that matches it. We use this in the expanded
423 "movsi" anonymous pattern for PIC symbols. */
426 cris_general_operand_or_gotless_symbol (rtx op
, enum machine_mode mode
)
428 return general_operand (op
, mode
)
429 || (CONSTANT_P (op
) && cris_gotless_symbol (op
));
432 /* Since a PLT symbol is not a general_operand, we have to have a
433 predicate that matches it when we need it. We use this in the expanded
434 "call" and "call_value" anonymous patterns. */
437 cris_general_operand_or_plt_symbol (rtx op
, enum machine_mode mode
)
439 return general_operand (op
, mode
)
440 || (GET_CODE (op
) == CONST
441 && GET_CODE (XEXP (op
, 0)) == UNSPEC
442 && !TARGET_AVOID_GOTPLT
);
445 /* This matches a (MEM (general_operand)) or
446 (MEM (cris_general_operand_or_symbol)). The second one isn't a valid
447 memory_operand, so we need this predicate to recognize call
448 destinations before we change them to a PLT operand (by wrapping in
452 cris_mem_call_operand (rtx op
, enum machine_mode mode
)
456 if (GET_CODE (op
) != MEM
)
459 if (memory_operand (op
, mode
))
464 return cris_general_operand_or_symbol (xmem
, GET_MODE (op
));
467 /* The CONDITIONAL_REGISTER_USAGE worker. */
470 cris_conditional_register_usage (void)
472 /* FIXME: This isn't nice. We should be able to use that register for
473 something else if the PIC table isn't needed. */
475 fixed_regs
[PIC_OFFSET_TABLE_REGNUM
]
476 = call_used_regs
[PIC_OFFSET_TABLE_REGNUM
] = 1;
479 /* Return current_function_uses_pic_offset_table. For use in cris.md,
480 since some generated files do not include function.h. */
483 cris_cfun_uses_pic_table (void)
485 return current_function_uses_pic_offset_table
;
488 /* Given an rtx, return the text string corresponding to the CODE of X.
489 Intended for use in the assembly language output section of a
495 cris_output_insn_is_bound
= 0;
496 switch (GET_CODE (x
))
507 /* This function is for retrieving a part of an instruction name for
508 an operator, for immediate output. If that ever happens for
509 MULT, we need to apply TARGET_MUL_BUG in the caller. Make sure
547 /* Used to control the sign/zero-extend character for the 'e' modifier.
549 cris_output_insn_is_bound
= 1;
554 return "Unknown operator";
559 /* Emit an error message when we're in an asm, and a fatal error for
560 "normal" insns. Formatted output isn't easily implemented, since we
561 use output_operand_lossage to output the actual message and handle the
562 categorization of the error. */
565 cris_operand_lossage (const char *msgid
, rtx op
)
568 output_operand_lossage ("%s", msgid
);
571 /* Print an index part of an address to file. */
574 cris_print_index (rtx index
, FILE *file
)
576 rtx inner
= XEXP (index
, 0);
578 /* Make the index "additive" unless we'll output a negative number, in
579 which case the sign character is free (as in free beer). */
580 if (GET_CODE (index
) != CONST_INT
|| INTVAL (index
) >= 0)
584 fprintf (file
, "$%s.b", reg_names
[REGNO (index
)]);
585 else if (CONSTANT_P (index
))
586 cris_output_addr_const (file
, index
);
587 else if (GET_CODE (index
) == MULT
)
589 fprintf (file
, "$%s.",
590 reg_names
[REGNO (XEXP (index
, 0))]);
592 putc (INTVAL (XEXP (index
, 1)) == 2 ? 'w' : 'd', file
);
594 else if (GET_CODE (index
) == SIGN_EXTEND
&&
595 GET_CODE (inner
) == MEM
)
597 rtx inner_inner
= XEXP (inner
, 0);
599 if (GET_CODE (inner_inner
) == POST_INC
)
601 fprintf (file
, "[$%s+].",
602 reg_names
[REGNO (XEXP (inner_inner
, 0))]);
603 putc (GET_MODE (inner
) == HImode
? 'w' : 'b', file
);
607 fprintf (file
, "[$%s].", reg_names
[REGNO (inner_inner
)]);
609 putc (GET_MODE (inner
) == HImode
? 'w' : 'b', file
);
612 else if (GET_CODE (index
) == MEM
)
614 if (GET_CODE (inner
) == POST_INC
)
615 fprintf (file
, "[$%s+].d", reg_names
[REGNO (XEXP (inner
, 0))]);
617 fprintf (file
, "[$%s].d", reg_names
[REGNO (inner
)]);
620 cris_operand_lossage ("unexpected index-type in cris_print_index",
624 /* Print a base rtx of an address to file. */
627 cris_print_base (rtx base
, FILE *file
)
630 fprintf (file
, "$%s", reg_names
[REGNO (base
)]);
631 else if (GET_CODE (base
) == POST_INC
)
632 fprintf (file
, "$%s+", reg_names
[REGNO (XEXP (base
, 0))]);
634 cris_operand_lossage ("unexpected base-type in cris_print_base",
638 /* Usable as a guard in expressions. */
641 cris_fatal (char *arg
)
643 internal_error (arg
);
645 /* We'll never get here; this is just to appease compilers. */
649 /* Textual function prologue. */
652 cris_target_asm_function_prologue (FILE *file
, HOST_WIDE_INT size
)
656 /* Shorten the used name for readability. */
657 int cfoa_size
= current_function_outgoing_args_size
;
658 int last_movem_reg
= -1;
659 int doing_dwarf
= dwarf2out_do_frame ();
661 int faked_args_size
= 0;
662 int cfa_write_offset
= 0;
663 char *cfa_label
= NULL
;
664 int return_address_on_stack
665 = regs_ever_live
[CRIS_SRP_REGNUM
]
666 || cfun
->machine
->needs_return_address_on_stack
!= 0;
668 /* Don't do anything if no prologues or epilogues are wanted. */
669 if (!TARGET_PROLOGUE_EPILOGUE
)
675 /* Align the size to what's best for the CPU model. */
676 if (TARGET_STACK_ALIGN
)
677 size
= TARGET_ALIGN_BY_32
? (size
+ 3) & ~3 : (size
+ 1) & ~1;
679 if (current_function_pretend_args_size
)
681 int pretend
= current_function_pretend_args_size
;
682 for (regno
= CRIS_FIRST_ARG_REG
+ CRIS_MAX_ARGS_IN_REGS
- 1;
684 regno
--, pretend
-= 4)
686 fprintf (file
, "\tpush $%s\n", reg_names
[regno
]);
687 faked_args_size
+= 4;
691 framesize
= faked_args_size
;
695 /* FIXME: Slightly redundant calculation, as we do the same in
696 pieces below. This offset must be the total adjustment of the
697 stack-pointer. We can then def_cfa call at the end of this
698 function with the current implementation of execute_cfa_insn, but
699 that wouldn't really be clean. */
703 + (return_address_on_stack
? 4 : 0)
704 + (frame_pointer_needed
? 4 : 0);
708 if (frame_pointer_needed
)
709 cfa_reg
= FRAME_POINTER_REGNUM
;
712 cfa_reg
= STACK_POINTER_REGNUM
;
713 cfa_offset
+= cris_initial_frame_pointer_offset ();
716 cfa_label
= dwarf2out_cfi_label ();
717 dwarf2out_def_cfa (cfa_label
, cfa_reg
, cfa_offset
);
719 cfa_write_offset
= - faked_args_size
- 4;
722 /* Save SRP if not a leaf function. */
723 if (return_address_on_stack
)
725 fprintf (file
, "\tPush $srp\n");
730 dwarf2out_return_save (cfa_label
, cfa_write_offset
);
731 cfa_write_offset
-= 4;
735 /* Set up frame pointer if needed. */
736 if (frame_pointer_needed
)
738 fprintf (file
, "\tpush $%s\n\tmove.d $sp,$%s\n",
739 reg_names
[FRAME_POINTER_REGNUM
],
740 reg_names
[FRAME_POINTER_REGNUM
]);
745 dwarf2out_reg_save (cfa_label
, FRAME_POINTER_REGNUM
,
747 cfa_write_offset
-= 4;
751 /* Local vars are located above saved regs. */
752 cfa_write_offset
-= size
;
754 /* Get a contiguous sequence of registers, starting with r0, that need
756 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
758 if ((((regs_ever_live
[regno
]
759 && !call_used_regs
[regno
])
760 || (regno
== (int) PIC_OFFSET_TABLE_REGNUM
761 && (current_function_uses_pic_offset_table
762 /* It is saved anyway, if there would be a gap. */
764 && regs_ever_live
[regno
+ 1]
765 && !call_used_regs
[regno
+ 1]))))
766 && (regno
!= FRAME_POINTER_REGNUM
|| !frame_pointer_needed
)
767 && regno
!= CRIS_SRP_REGNUM
)
768 || (current_function_calls_eh_return
769 && (regno
== EH_RETURN_DATA_REGNO (0)
770 || regno
== EH_RETURN_DATA_REGNO (1)
771 || regno
== EH_RETURN_DATA_REGNO (2)
772 || regno
== EH_RETURN_DATA_REGNO (3))))
774 /* Check if movem may be used for registers so far. */
775 if (regno
== last_movem_reg
+ 1)
776 /* Yes, update next expected register. */
780 /* We cannot use movem for all registers. We have to flush
781 any movem:ed registers we got so far. */
782 if (last_movem_reg
!= -1)
784 /* It is a win to use a side-effect assignment for
785 64 <= size <= 128. But side-effect on movem was
786 not usable for CRIS v0..3. Also only do it if
787 side-effects insns are allowed. */
788 if ((last_movem_reg
+ 1) * 4 + size
>= 64
789 && (last_movem_reg
+ 1) * 4 + size
<= 128
790 && cris_cpu_version
>= CRIS_CPU_SVINTO
791 && TARGET_SIDE_EFFECT_PREFIXES
)
792 fprintf (file
, "\tmovem $%s,[$sp=$sp-"HOST_WIDE_INT_PRINT_DEC
"]\n",
793 reg_names
[last_movem_reg
],
794 (last_movem_reg
+ 1) * 4 + size
);
797 /* Avoid printing multiple subsequent sub:s for sp. */
798 fprintf (file
, "\tsub%s "HOST_WIDE_INT_PRINT_DEC
",$sp\n",
799 ADDITIVE_SIZE_MODIFIER ((last_movem_reg
+ 1)
801 (last_movem_reg
+ 1) * 4 + size
);
803 fprintf (file
, "\tmovem $%s,[$sp]\n",
804 reg_names
[last_movem_reg
]);
807 framesize
+= (last_movem_reg
+ 1) * 4 + size
;
810 fprintf (file
, "; frame "HOST_WIDE_INT_PRINT_DEC
811 ", #regs %d, bytes %d args %d\n",
814 (last_movem_reg
+ 1) * 4,
815 current_function_args_size
);
822 /* Local vars on stack, but there are no movem:s.
823 Just allocate space. */
824 fprintf (file
, "\tSub%s "HOST_WIDE_INT_PRINT_DEC
",$sp\n",
825 ADDITIVE_SIZE_MODIFIER (size
),
831 fprintf (file
, "\tPush $%s\n", reg_names
[regno
]);
837 /* Registers are stored lowest numbered at highest address,
838 which matches the loop order; we just need to update the
840 dwarf2out_reg_save (cfa_label
, regno
, cfa_write_offset
);
841 cfa_write_offset
-= 4;
846 /* Check after, if we can movem all registers. This is the normal
848 if (last_movem_reg
!= -1)
850 /* Side-effect assignment on movem was not supported for CRIS v0..3,
851 and don't do it if we're asked not to.
853 The movem is already accounted for, for unwind. */
855 if ((last_movem_reg
+ 1) * 4 + size
>= 64
856 && (last_movem_reg
+ 1) * 4 + size
<= 128
857 && cris_cpu_version
>= CRIS_CPU_SVINTO
858 && TARGET_SIDE_EFFECT_PREFIXES
)
859 fprintf (file
, "\tmovem $%s,[$sp=$sp-"HOST_WIDE_INT_PRINT_DEC
"]\n",
860 reg_names
[last_movem_reg
],
861 (last_movem_reg
+1) * 4 + size
);
864 /* Avoid printing multiple subsequent sub:s for sp. FIXME:
865 Clean up the conditional expression. */
866 fprintf (file
, "\tsub%s "HOST_WIDE_INT_PRINT_DEC
",$sp\n",
867 ADDITIVE_SIZE_MODIFIER ((last_movem_reg
+ 1) * 4 + size
),
868 (last_movem_reg
+ 1) * 4 + size
);
869 /* To be compatible with v0..v3 means we do not use an assignment
870 addressing mode with movem. We normally don't need that
871 anyway. It would only be slightly more efficient for 64..128
873 fprintf (file
, "\tmovem $%s,[$sp]\n", reg_names
[last_movem_reg
]);
876 framesize
+= (last_movem_reg
+ 1) * 4 + size
;
879 fprintf (file
, "; frame "HOST_WIDE_INT_PRINT_DEC
880 ", #regs %d, bytes %d args %d\n",
883 (last_movem_reg
+ 1) * 4,
884 current_function_args_size
);
886 /* We have to put outgoing argument space after regs. */
889 /* This does not need to be accounted for, for unwind. */
891 fprintf (file
, "\tSub%s %d,$sp\n",
892 ADDITIVE_SIZE_MODIFIER (cfoa_size
),
894 framesize
+= cfoa_size
;
897 else if ((size
+ cfoa_size
) > 0)
899 /* This does not need to be accounted for, for unwind. */
901 /* Local vars on stack, and we could not use movem. Add a sub here. */
902 fprintf (file
, "\tSub%s "HOST_WIDE_INT_PRINT_DEC
",$sp\n",
903 ADDITIVE_SIZE_MODIFIER (size
+ cfoa_size
),
905 framesize
+= size
+ cfoa_size
;
908 /* Set up the PIC register. */
909 if (current_function_uses_pic_offset_table
)
910 fprintf (file
, "\tmove.d $pc,$%s\n\tsub.d .:GOTOFF,$%s\n",
911 reg_names
[PIC_OFFSET_TABLE_REGNUM
],
912 reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
916 "; parm #%d @ %d; frame " HOST_WIDE_INT_PRINT_DEC
917 ", FP-SP is %d; leaf: %s%s; fp %s, outg: %d arg %d\n",
918 CRIS_MAX_ARGS_IN_REGS
+ 1, FIRST_PARM_OFFSET (0),
920 cris_initial_frame_pointer_offset (),
921 leaf_function_p () ? "yes" : "no",
922 return_address_on_stack
? "no" :"yes",
923 frame_pointer_needed
? "yes" : "no",
924 cfoa_size
, current_function_args_size
);
926 if (cris_max_stackframe
&& framesize
> cris_max_stackframe
)
927 warning ("stackframe too big: %d bytes", framesize
);
930 /* Return nonzero if there are regs mentioned in the insn that are not all
931 in the call_used regs. This is part of the decision whether an insn
932 can be put in the epilogue. */
935 saved_regs_mentioned (rtx x
)
941 /* Mainly stolen from refers_to_regno_p in rtlanal.c. */
949 return !call_used_regs
[i
];
952 /* If this is a SUBREG of a hard reg, we can see exactly which
953 registers are being modified. Otherwise, handle normally. */
954 i
= REGNO (SUBREG_REG (x
));
955 return !call_used_regs
[i
];
961 fmt
= GET_RTX_FORMAT (code
);
962 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
966 if (saved_regs_mentioned (XEXP (x
, i
)))
969 else if (fmt
[i
] == 'E')
972 for (j
= XVECLEN (x
, i
) - 1; j
>=0; j
--)
973 if (saved_regs_mentioned (XEXP (x
, i
)))
981 /* Figure out if the insn may be put in the epilogue. */
984 cris_eligible_for_epilogue_delay (rtx insn
)
986 /* First of all, it must be as slottable as for a delayed branch insn. */
987 if (get_attr_slottable (insn
) != SLOTTABLE_YES
)
990 /* It must not refer to the stack pointer (may be valid for some cases
991 that I can't think of). */
992 if (reg_mentioned_p (stack_pointer_rtx
, PATTERN (insn
)))
995 /* The frame pointer will be restored in the epilogue, before the
996 "ret", so it can't be referred to. */
997 if (frame_pointer_needed
998 && reg_mentioned_p (frame_pointer_rtx
, PATTERN (insn
)))
1001 /* All saved regs are restored before the delayed insn.
1002 This means that we cannot have any instructions that mention the
1003 registers that are restored by the epilogue. */
1004 if (saved_regs_mentioned (PATTERN (insn
)))
1007 /* It seems to be ok. */
1011 /* Return the number of delay-slots in the epilogue: return 1 if it
1012 contains "ret", else 0. */
1015 cris_delay_slots_for_epilogue (void)
1017 /* Check if we use a return insn, which we only do for leaf functions.
1018 Else there is no slot to fill. */
1019 if (regs_ever_live
[CRIS_SRP_REGNUM
]
1020 || cfun
->machine
->needs_return_address_on_stack
!= 0)
1023 /* By calling function_epilogue with the same parameters as from gcc
1024 we can get info about if the epilogue can fill the delay-slot by itself.
1025 If it is filled from the epilogue, then the corresponding string
1027 This depends on that the "size" argument to function_epilogue
1028 always is get_frame_size.
1029 FIXME: Kludgy. At least make it a separate function that is not
1030 misnamed or abuses the stream parameter. */
1031 cris_target_asm_function_epilogue (NULL
, get_frame_size ());
1038 /* Textual function epilogue. When file is NULL, it serves doubly as
1039 a test for whether the epilogue can fill any "ret" delay-slots by
1040 itself by storing the delay insn in save_last. */
1043 cris_target_asm_function_epilogue (FILE *file
, HOST_WIDE_INT size
)
1046 int last_movem_reg
= -1;
1047 rtx insn
= get_last_insn ();
1048 int argspace_offset
= current_function_outgoing_args_size
;
1049 int pretend
= current_function_pretend_args_size
;
1050 int return_address_on_stack
1051 = regs_ever_live
[CRIS_SRP_REGNUM
]
1052 || cfun
->machine
->needs_return_address_on_stack
!= 0;
1056 if (file
&& !TARGET_PROLOGUE_EPILOGUE
)
1059 if (TARGET_PDEBUG
&& file
)
1060 fprintf (file
, ";;\n");
1062 /* Align byte count of stack frame. */
1063 if (TARGET_STACK_ALIGN
)
1064 size
= TARGET_ALIGN_BY_32
? (size
+ 3) & ~3 : (size
+ 1) & ~1;
1066 /* If the last insn was a BARRIER, we don't have to write any code,
1067 then all returns were covered by "return" insns. */
1068 if (GET_CODE (insn
) == NOTE
)
1069 insn
= prev_nonnote_insn (insn
);
1071 && (GET_CODE (insn
) == BARRIER
1072 /* We must make sure that the insn really is a "return" and
1073 not a conditional branch. Try to match the return exactly,
1074 and if it doesn't match, assume it is a conditional branch
1075 (and output an epilogue). */
1076 || (GET_CODE (insn
) == JUMP_INSN
1077 && GET_CODE (PATTERN (insn
)) == RETURN
)))
1079 if (TARGET_PDEBUG
&& file
)
1080 fprintf (file
, ";;;;;\n");
1084 /* Check how many saved regs we can movem. They start at r0 and must
1087 regno
< FIRST_PSEUDO_REGISTER
;
1089 if ((((regs_ever_live
[regno
]
1090 && !call_used_regs
[regno
])
1091 || (regno
== (int) PIC_OFFSET_TABLE_REGNUM
1092 && (current_function_uses_pic_offset_table
1093 /* It is saved anyway, if there would be a gap. */
1095 && regs_ever_live
[regno
+ 1]
1096 && !call_used_regs
[regno
+ 1]))))
1097 && (regno
!= FRAME_POINTER_REGNUM
|| !frame_pointer_needed
)
1098 && regno
!= CRIS_SRP_REGNUM
)
1099 || (current_function_calls_eh_return
1100 && (regno
== EH_RETURN_DATA_REGNO (0)
1101 || regno
== EH_RETURN_DATA_REGNO (1)
1102 || regno
== EH_RETURN_DATA_REGNO (2)
1103 || regno
== EH_RETURN_DATA_REGNO (3))))
1106 if (regno
== last_movem_reg
+ 1)
1112 for (regno
= FIRST_PSEUDO_REGISTER
- 1;
1113 regno
> last_movem_reg
;
1115 if ((((regs_ever_live
[regno
]
1116 && !call_used_regs
[regno
])
1117 || (regno
== (int) PIC_OFFSET_TABLE_REGNUM
1118 && (current_function_uses_pic_offset_table
1119 /* It is saved anyway, if there would be a gap. */
1121 && regs_ever_live
[regno
+ 1]
1122 && !call_used_regs
[regno
+ 1]))))
1123 && (regno
!= FRAME_POINTER_REGNUM
|| !frame_pointer_needed
)
1124 && regno
!= CRIS_SRP_REGNUM
)
1125 || (current_function_calls_eh_return
1126 && (regno
== EH_RETURN_DATA_REGNO (0)
1127 || regno
== EH_RETURN_DATA_REGNO (1)
1128 || regno
== EH_RETURN_DATA_REGNO (2)
1129 || regno
== EH_RETURN_DATA_REGNO (3))))
1131 if (argspace_offset
)
1133 /* There is an area for outgoing parameters located before
1134 the saved registers. We have to adjust for that. */
1136 fprintf (file
, "\tAdd%s %d,$sp\n",
1137 ADDITIVE_SIZE_MODIFIER (argspace_offset
),
1140 /* Make sure we only do this once. */
1141 argspace_offset
= 0;
1144 /* Flush previous non-movem:ed registers. */
1145 if (*save_last
&& file
)
1146 fprintf (file
, save_last
);
1147 sprintf (save_last
, "\tPop $%s\n", reg_names
[regno
]);
1150 if (last_movem_reg
!= -1)
1152 if (argspace_offset
)
1154 /* Adjust for the outgoing parameters area, if that's not
1156 if (*save_last
&& file
)
1158 fprintf (file
, save_last
);
1163 fprintf (file
, "\tAdd%s %d,$sp\n",
1164 ADDITIVE_SIZE_MODIFIER (argspace_offset
),
1166 argspace_offset
= 0;
1168 /* Flush previous non-movem:ed registers. */
1169 else if (*save_last
&& file
)
1170 fprintf (file
, save_last
);
1171 sprintf (save_last
, "\tmovem [$sp+],$%s\n", reg_names
[last_movem_reg
]);
1174 /* Restore frame pointer if necessary. */
1175 if (frame_pointer_needed
)
1177 if (*save_last
&& file
)
1178 fprintf (file
, save_last
);
1181 fprintf (file
, "\tmove.d $%s,$sp\n",
1182 reg_names
[FRAME_POINTER_REGNUM
]);
1183 sprintf (save_last
, "\tPop $%s\n",
1184 reg_names
[FRAME_POINTER_REGNUM
]);
1188 /* If there was no frame-pointer to restore sp from, we must
1189 explicitly deallocate local variables. */
1191 /* Handle space for outgoing parameters that hasn't been handled
1193 size
+= argspace_offset
;
1197 if (*save_last
&& file
)
1198 fprintf (file
, save_last
);
1200 sprintf (save_last
, "\tadd%s "HOST_WIDE_INT_PRINT_DEC
",$sp\n",
1201 ADDITIVE_SIZE_MODIFIER (size
), size
);
1204 /* If the size was not in the range for a "quick", we must flush
1209 fprintf (file
, save_last
);
1214 /* If this function has no pushed register parameters
1215 (stdargs/varargs), and if it is not a leaf function, then we can
1216 just jump-return here. */
1217 if (return_address_on_stack
&& pretend
== 0)
1219 if (*save_last
&& file
)
1220 fprintf (file
, save_last
);
1225 if (current_function_calls_eh_return
)
1227 /* The installed EH-return address is in *this* frame, so we
1228 need to pop it before we return. */
1229 fprintf (file
, "\tpop $srp\n");
1230 fprintf (file
, "\tret\n");
1231 fprintf (file
, "\tadd.d $%s,$sp\n", reg_names
[CRIS_STACKADJ_REG
]);
1234 fprintf (file
, "\tJump [$sp+]\n");
1236 /* Do a sanity check to avoid generating invalid code. */
1237 if (current_function_epilogue_delay_list
)
1238 internal_error ("allocated but unused delay list in epilogue");
1243 /* Rather than add current_function_calls_eh_return conditions
1244 everywhere in the following code (and not be able to test it
1245 thoroughly), assert the assumption that all usage of
1246 __builtin_eh_return are handled above. */
1247 if (current_function_calls_eh_return
)
1248 internal_error ("unexpected function type needing stack adjustment for\
1249 __builtin_eh_return");
1251 /* If we pushed some register parameters, then adjust the stack for
1255 /* Since srp is stored on the way, we need to restore it first. */
1256 if (return_address_on_stack
)
1258 if (*save_last
&& file
)
1259 fprintf (file
, save_last
);
1263 fprintf (file
, "\tpop $srp\n");
1266 if (*save_last
&& file
)
1267 fprintf (file
, save_last
);
1269 sprintf (save_last
, "\tadd%s %d,$sp\n",
1270 ADDITIVE_SIZE_MODIFIER (pretend
), pretend
);
1273 /* Here's where we have a delay-slot we need to fill. */
1274 if (file
&& current_function_epilogue_delay_list
)
1276 /* If gcc has allocated an insn for the epilogue delay slot, but
1277 things were arranged so we now thought we could do it
1278 ourselves, don't forget to flush that insn. */
1280 fprintf (file
, save_last
);
1282 fprintf (file
, "\tRet\n");
1284 /* Output the delay-slot-insn the mandated way. */
1285 final_scan_insn (XEXP (current_function_epilogue_delay_list
, 0),
1286 file
, 1, -2, 1, NULL
);
1290 fprintf (file
, "\tRet\n");
1292 /* If the GCC did not do it, we have to use whatever insn we have,
1295 fprintf (file
, save_last
);
1297 fprintf (file
, "\tnOp\n");
1301 /* The PRINT_OPERAND worker. */
1304 cris_print_operand (FILE *file
, rtx x
, int code
)
1308 /* Size-strings corresponding to MULT expressions. */
1309 static const char *const mults
[] = { "BAD:0", ".b", ".w", "BAD:3", ".d" };
1311 /* New code entries should just be added to the switch below. If
1312 handling is finished, just return. If handling was just a
1313 modification of the operand, the modified operand should be put in
1314 "operand", and then do a break to let default handling
1315 (zero-modifier) output the operand. */
1320 /* Print the unsigned supplied integer as if it were signed
1321 and < 0, i.e print 255 or 65535 as -1, 254, 65534 as -2, etc. */
1322 if (GET_CODE (x
) != CONST_INT
1323 || ! CONST_OK_FOR_LETTER_P (INTVAL (x
), 'O'))
1324 LOSE_AND_RETURN ("invalid operand for 'b' modifier", x
);
1325 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
,
1326 INTVAL (x
)| (INTVAL (x
) <= 255 ? ~255 : ~65535));
1330 /* Print assembler code for operator. */
1331 fprintf (file
, "%s", cris_op_str (operand
));
1335 /* Print the operand without the PIC register. */
1336 if (! flag_pic
|| ! CONSTANT_P (x
) || ! cris_gotless_symbol (x
))
1337 LOSE_AND_RETURN ("invalid operand for 'v' modifier", x
);
1338 cris_pic_sympart_only
++;
1339 cris_output_addr_const (file
, x
);
1340 cris_pic_sympart_only
--;
1344 /* Print the PIC register. Applied to a GOT-less PIC symbol for
1346 if (! flag_pic
|| ! CONSTANT_P (x
) || ! cris_gotless_symbol (x
))
1347 LOSE_AND_RETURN ("invalid operand for 'P' modifier", x
);
1348 fprintf (file
, "$%s", reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
1352 /* Adjust a power of two to its log2. */
1353 if (GET_CODE (x
) != CONST_INT
|| exact_log2 (INTVAL (x
)) < 0 )
1354 LOSE_AND_RETURN ("invalid operand for 'p' modifier", x
);
1355 fprintf (file
, "%d", exact_log2 (INTVAL (x
)));
1359 /* For an integer, print 'b' or 'w' if <= 255 or <= 65535
1360 respectively. This modifier also terminates the inhibiting
1361 effects of the 'x' modifier. */
1362 cris_output_insn_is_bound
= 0;
1363 if (GET_MODE (x
) == VOIDmode
&& GET_CODE (x
) == CONST_INT
)
1365 if (INTVAL (x
) >= 0)
1367 if (INTVAL (x
) <= 255)
1369 else if (INTVAL (x
) <= 65535)
1379 /* For a non-integer, print the size of the operand. */
1380 putc ((GET_MODE (x
) == SImode
|| GET_MODE (x
) == SFmode
)
1381 ? 'd' : GET_MODE (x
) == HImode
? 'w'
1382 : GET_MODE (x
) == QImode
? 'b'
1383 /* If none of the above, emit an erroneous size letter. */
1389 /* Const_int: print b for -127 <= x <= 255,
1390 w for -32768 <= x <= 65535, else abort. */
1391 if (GET_CODE (x
) != CONST_INT
1392 || INTVAL (x
) < -32768 || INTVAL (x
) > 65535)
1393 LOSE_AND_RETURN ("invalid operand for 'z' modifier", x
);
1394 putc (INTVAL (x
) >= -128 && INTVAL (x
) <= 255 ? 'b' : 'w', file
);
1398 /* Output a 'nop' if there's nothing for the delay slot.
1399 This method stolen from the sparc files. */
1400 if (dbr_sequence_length () == 0)
1401 fputs ("\n\tnop", file
);
1405 /* Output directive for alignment padded with "nop" insns.
1406 Optimizing for size, it's plain 4-byte alignment, otherwise we
1407 align the section to a cache-line (32 bytes) and skip at max 2
1408 bytes, i.e. we skip if it's the last insn on a cache-line. The
1409 latter is faster by a small amount (for two test-programs 99.6%
1410 and 99.9%) and larger by a small amount (ditto 100.1% and
1411 100.2%). This is supposed to be the simplest yet performance-
1412 wise least intrusive way to make sure the immediately following
1413 (supposed) muls/mulu insn isn't located at the end of a
1416 fputs (optimize_size
1417 ? ".p2alignw 2,0x050f\n\t"
1418 : ".p2alignw 5,0x050f,2\n\t", file
);
1422 /* Print high (most significant) part of something. */
1423 switch (GET_CODE (operand
))
1426 if (HOST_BITS_PER_WIDE_INT
== 32)
1427 /* Sign-extension from a normal int to a long long. */
1428 fprintf (file
, INTVAL (operand
) < 0 ? "-1" : "0");
1430 fprintf (file
, "0x%x", (unsigned int)(INTVAL (x
) >> 31 >> 1));
1434 /* High part of a long long constant. */
1435 if (GET_MODE (operand
) == VOIDmode
)
1437 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_HIGH (x
));
1441 LOSE_AND_RETURN ("invalid operand for 'H' modifier", x
);
1444 /* Print reg + 1. Check that there's not an attempt to print
1445 high-parts of registers like stack-pointer or higher. */
1446 if (REGNO (operand
) > STACK_POINTER_REGNUM
- 2)
1447 LOSE_AND_RETURN ("bad register", operand
);
1448 fprintf (file
, "$%s", reg_names
[REGNO (operand
) + 1]);
1452 /* Adjust memory address to high part. */
1454 rtx adj_mem
= operand
;
1456 = GET_MODE_BITSIZE (GET_MODE (operand
)) / BITS_PER_UNIT
;
1458 /* Adjust so we can use two SImode in DImode.
1459 Calling adj_offsettable_operand will make sure it is an
1460 offsettable address. Don't do this for a postincrement
1461 though; it should remain as it was. */
1462 if (GET_CODE (XEXP (adj_mem
, 0)) != POST_INC
)
1464 = adjust_address (adj_mem
, GET_MODE (adj_mem
), size
/ 2);
1466 output_address (XEXP (adj_mem
, 0));
1471 LOSE_AND_RETURN ("invalid operand for 'H' modifier", x
);
1475 /* Strip the MEM expression. */
1476 operand
= XEXP (operand
, 0);
1480 /* Print 's' if operand is SIGN_EXTEND or 'u' if ZERO_EXTEND unless
1481 cris_output_insn_is_bound is nonzero. */
1482 if (GET_CODE (operand
) != SIGN_EXTEND
1483 && GET_CODE (operand
) != ZERO_EXTEND
1484 && GET_CODE (operand
) != CONST_INT
)
1485 LOSE_AND_RETURN ("invalid operand for 'e' modifier", x
);
1487 if (cris_output_insn_is_bound
)
1489 cris_output_insn_is_bound
= 0;
1493 putc (GET_CODE (operand
) == SIGN_EXTEND
1494 || (GET_CODE (operand
) == CONST_INT
&& INTVAL (operand
) < 0)
1499 /* Print the size letter of the inner element. We can do it by
1500 calling ourselves with the 's' modifier. */
1501 if (GET_CODE (operand
) != SIGN_EXTEND
&& GET_CODE (operand
) != ZERO_EXTEND
)
1502 LOSE_AND_RETURN ("invalid operand for 'm' modifier", x
);
1503 cris_print_operand (file
, XEXP (operand
, 0), 's');
1507 /* Print the least significant part of operand. */
1508 if (GET_CODE (operand
) == CONST_DOUBLE
)
1510 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
1513 else if (HOST_BITS_PER_WIDE_INT
> 32 && GET_CODE (operand
) == CONST_INT
)
1515 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
1516 INTVAL (x
) & ((unsigned int) 0x7fffffff * 2 + 1));
1519 /* Otherwise the least significant part equals the normal part,
1520 so handle it normally. */
1524 /* When emitting an add for the high part of a DImode constant, we
1525 want to use addq for 0 and adds.w for -1. */
1526 if (GET_CODE (operand
) != CONST_INT
)
1527 LOSE_AND_RETURN ("invalid operand for 'A' modifier", x
);
1528 fprintf (file
, INTVAL (operand
) < 0 ? "adds.w" : "addq");
1532 /* When emitting an sub for the high part of a DImode constant, we
1533 want to use subq for 0 and subs.w for -1. */
1534 if (GET_CODE (operand
) != CONST_INT
)
1535 LOSE_AND_RETURN ("invalid operand for 'D' modifier", x
);
1536 fprintf (file
, INTVAL (operand
) < 0 ? "subs.w" : "subq");
1540 /* Print the operand as the index-part of an address.
1541 Easiest way out is to use cris_print_index. */
1542 cris_print_index (operand
, file
);
1546 /* Print the size letter for an operand to a MULT, which must be a
1547 const_int with a suitable value. */
1548 if (GET_CODE (operand
) != CONST_INT
|| INTVAL (operand
) > 4)
1549 LOSE_AND_RETURN ("invalid operand for 'T' modifier", x
);
1550 fprintf (file
, "%s", mults
[INTVAL (operand
)]);
1554 /* No code, print as usual. */
1558 LOSE_AND_RETURN ("invalid operand modifier letter", x
);
1561 /* Print an operand as without a modifier letter. */
1562 switch (GET_CODE (operand
))
1565 if (REGNO (operand
) > 15)
1566 internal_error ("internal error: bad register: %d", REGNO (operand
));
1567 fprintf (file
, "$%s", reg_names
[REGNO (operand
)]);
1571 output_address (XEXP (operand
, 0));
1575 if (GET_MODE (operand
) == VOIDmode
)
1576 /* A long long constant. */
1577 output_addr_const (file
, operand
);
1580 /* Only single precision is allowed as plain operands the
1581 moment. FIXME: REAL_VALUE_FROM_CONST_DOUBLE isn't
1586 /* FIXME: Perhaps check overflow of the "single". */
1587 REAL_VALUE_FROM_CONST_DOUBLE (r
, operand
);
1588 REAL_VALUE_TO_TARGET_SINGLE (r
, l
);
1590 fprintf (file
, "0x%lx", l
);
1595 ASSERT_PLT_UNSPEC (operand
);
1599 cris_output_addr_const (file
, operand
);
1605 /* For a (MULT (reg X) const_int) we output "rX.S". */
1606 int i
= GET_CODE (XEXP (operand
, 1)) == CONST_INT
1607 ? INTVAL (XEXP (operand
, 1)) : INTVAL (XEXP (operand
, 0));
1608 rtx reg
= GET_CODE (XEXP (operand
, 1)) == CONST_INT
1609 ? XEXP (operand
, 0) : XEXP (operand
, 1);
1611 if (GET_CODE (reg
) != REG
1612 || (GET_CODE (XEXP (operand
, 0)) != CONST_INT
1613 && GET_CODE (XEXP (operand
, 1)) != CONST_INT
))
1614 LOSE_AND_RETURN ("unexpected multiplicative operand", x
);
1616 cris_print_base (reg
, file
);
1617 fprintf (file
, ".%c",
1618 i
== 0 || (i
== 1 && GET_CODE (operand
) == MULT
) ? 'b'
1620 : (i
== 2 && GET_CODE (operand
) == MULT
) || i
== 1 ? 'w'
1626 /* No need to handle all strange variants, let output_addr_const
1628 if (CONSTANT_P (operand
))
1630 cris_output_addr_const (file
, operand
);
1634 LOSE_AND_RETURN ("unexpected operand", x
);
1638 /* The PRINT_OPERAND_ADDRESS worker. */
1641 cris_print_operand_address (FILE *file
, rtx x
)
1643 /* All these were inside MEM:s so output indirection characters. */
1646 if (CONSTANT_ADDRESS_P (x
))
1647 cris_output_addr_const (file
, x
);
1648 else if (BASE_OR_AUTOINCR_P (x
))
1649 cris_print_base (x
, file
);
1650 else if (GET_CODE (x
) == PLUS
)
1658 cris_print_base (x1
, file
);
1659 cris_print_index (x2
, file
);
1661 else if (BASE_P (x2
))
1663 cris_print_base (x2
, file
);
1664 cris_print_index (x1
, file
);
1667 LOSE_AND_RETURN ("unrecognized address", x
);
1669 else if (GET_CODE (x
) == MEM
)
1671 /* A DIP. Output more indirection characters. */
1673 cris_print_base (XEXP (x
, 0), file
);
1677 LOSE_AND_RETURN ("unrecognized address", x
);
1682 /* The RETURN_ADDR_RTX worker.
1683 We mark that the return address is used, either by EH or
1684 __builtin_return_address, for use by the function prologue and
1685 epilogue. FIXME: This isn't optimal; we just use the mark in the
1686 prologue and epilogue to say that the return address is to be stored
1687 in the stack frame. We could return SRP for leaf-functions and use the
1688 initial-value machinery. */
1691 cris_return_addr_rtx (int count
, rtx frameaddr ATTRIBUTE_UNUSED
)
1693 cfun
->machine
->needs_return_address_on_stack
= 1;
1695 /* The return-address is stored just above the saved frame-pointer (if
1696 present). Apparently we can't eliminate from the frame-pointer in
1697 that direction, so use the incoming args (maybe pretended) pointer. */
1699 ? gen_rtx_MEM (Pmode
, plus_constant (virtual_incoming_args_rtx
, -4))
1703 /* Accessor used in cris.md:return because cfun->machine isn't available
1707 cris_return_address_on_stack ()
1709 return cfun
->machine
->needs_return_address_on_stack
;
1712 /* This used to be the INITIAL_FRAME_POINTER_OFFSET worker; now only
1713 handles FP -> SP elimination offset. */
1716 cris_initial_frame_pointer_offset (void)
1720 /* Initial offset is 0 if we don't have a frame pointer. */
1723 /* And 4 for each register pushed. */
1724 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1725 if ((((regs_ever_live
[regno
]
1726 && !call_used_regs
[regno
])
1727 || (regno
== (int) PIC_OFFSET_TABLE_REGNUM
1728 && (current_function_uses_pic_offset_table
1729 /* It is saved anyway, if there would be a gap. */
1731 && regs_ever_live
[regno
+ 1]
1732 && !call_used_regs
[regno
+ 1]))))
1733 && (regno
!= FRAME_POINTER_REGNUM
|| !frame_pointer_needed
)
1734 && regno
!= CRIS_SRP_REGNUM
)
1735 || (current_function_calls_eh_return
1736 && (regno
== EH_RETURN_DATA_REGNO (0)
1737 || regno
== EH_RETURN_DATA_REGNO (1)
1738 || regno
== EH_RETURN_DATA_REGNO (2)
1739 || regno
== EH_RETURN_DATA_REGNO (3))))
1742 /* And then, last, we add the locals allocated. */
1743 offs
+= get_frame_size ();
1745 /* And more; the accumulated args size. */
1746 offs
+= current_function_outgoing_args_size
;
1748 /* Then round it off, in case we use aligned stack. */
1749 if (TARGET_STACK_ALIGN
)
1750 offs
= TARGET_ALIGN_BY_32
? (offs
+ 3) & ~3 : (offs
+ 1) & ~1;
1755 /* The INITIAL_ELIMINATION_OFFSET worker.
1756 Calculate the difference between imaginary registers such as frame
1757 pointer and the stack pointer. Used to eliminate the frame pointer
1758 and imaginary arg pointer. */
1761 cris_initial_elimination_offset (int fromreg
, int toreg
)
1764 = cris_initial_frame_pointer_offset ();
1766 /* We should be able to use regs_ever_live and related prologue
1767 information here, or alpha should not as well. */
1768 int return_address_on_stack
1769 = regs_ever_live
[CRIS_SRP_REGNUM
]
1770 || cfun
->machine
->needs_return_address_on_stack
!= 0;
1772 /* Here we act as if the frame-pointer were needed. */
1773 int ap_fp_offset
= 4 + (return_address_on_stack
? 4 : 0);
1775 if (fromreg
== ARG_POINTER_REGNUM
1776 && toreg
== FRAME_POINTER_REGNUM
)
1777 return ap_fp_offset
;
1779 /* Between the frame pointer and the stack are only "normal" stack
1780 variables and saved registers. */
1781 if (fromreg
== FRAME_POINTER_REGNUM
1782 && toreg
== STACK_POINTER_REGNUM
)
1783 return fp_sp_offset
;
1785 /* We need to balance out the frame pointer here. */
1786 if (fromreg
== ARG_POINTER_REGNUM
1787 && toreg
== STACK_POINTER_REGNUM
)
1788 return ap_fp_offset
+ fp_sp_offset
- 4;
1793 /* This function looks into the pattern to see how this insn affects
1796 Used when to eliminate test insns before a condition-code user,
1797 such as a "scc" insn or a conditional branch. This includes
1798 checking if the entities that cc was updated by, are changed by the
1801 Currently a jumble of the old peek-inside-the-insn and the newer
1802 check-cc-attribute methods. */
1805 cris_notice_update_cc (rtx exp
, rtx insn
)
1807 /* Check if user specified "-mcc-init" as a bug-workaround. FIXME:
1808 TARGET_CCINIT does not work; we must set CC_REVERSED as below.
1809 Several testcases will otherwise fail, for example
1810 gcc.c-torture/execute/20000217-1.c -O0 and -O1. */
1817 /* Slowly, we're converting to using attributes to control the setting
1818 of condition-code status. */
1819 switch (get_attr_cc (insn
))
1822 /* Even if it is "none", a setting may clobber a previous
1823 cc-value, so check. */
1824 if (GET_CODE (exp
) == SET
)
1826 if (cc_status
.value1
1827 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
1829 cc_status
.value1
= 0;
1831 if (cc_status
.value2
1832 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
1834 cc_status
.value2
= 0;
1843 /* Which means, for:
1848 CC is (reg) and (...) - unless (...) is 0, then CC does not change.
1849 CC_NO_OVERFLOW unless (...) is reg or mem.
1858 (set (reg1) (mem (bdap/biap)))
1859 (set (reg2) (bdap/biap))):
1860 CC is (reg1) and (mem (reg2))
1863 (set (mem (bdap/biap)) (reg1)) [or 0]
1864 (set (reg2) (bdap/biap))):
1867 (where reg and mem includes strict_low_parts variants thereof)
1869 For all others, assume CC is clobbered.
1870 Note that we do not have to care about setting CC_NO_OVERFLOW,
1871 since the overflow flag is set to 0 (i.e. right) for
1872 instructions where it does not have any sane sense, but where
1873 other flags have meanings. (This includes shifts; the carry is
1876 Note that there are other parallel constructs we could match,
1877 but we don't do that yet. */
1879 if (GET_CODE (exp
) == SET
)
1881 /* FIXME: Check when this happens. It looks like we should
1882 actually do a CC_STATUS_INIT here to be safe. */
1883 if (SET_DEST (exp
) == pc_rtx
)
1886 /* Record CC0 changes, so we do not have to output multiple
1888 if (SET_DEST (exp
) == cc0_rtx
)
1890 cc_status
.value1
= SET_SRC (exp
);
1891 cc_status
.value2
= 0;
1893 /* Handle flags for the special btstq on one bit. */
1894 if (GET_CODE (SET_SRC (exp
)) == ZERO_EXTRACT
1895 && XEXP (SET_SRC (exp
), 1) == const1_rtx
)
1897 if (GET_CODE (XEXP (SET_SRC (exp
), 0)) == CONST_INT
)
1899 cc_status
.flags
= CC_INVERTED
;
1901 /* A one-bit btstq. */
1902 cc_status
.flags
= CC_Z_IN_NOT_N
;
1905 cc_status
.flags
= 0;
1907 if (GET_CODE (SET_SRC (exp
)) == COMPARE
)
1909 if (!REG_P (XEXP (SET_SRC (exp
), 0))
1910 && XEXP (SET_SRC (exp
), 1) != const0_rtx
)
1911 /* For some reason gcc will not canonicalize compare
1912 operations, reversing the sign by itself if
1913 operands are in wrong order. */
1914 /* (But NOT inverted; eq is still eq.) */
1915 cc_status
.flags
= CC_REVERSED
;
1917 /* This seems to be overlooked by gcc. FIXME: Check again.
1918 FIXME: Is it really safe? */
1920 = gen_rtx_MINUS (GET_MODE (SET_SRC (exp
)),
1921 XEXP (SET_SRC (exp
), 0),
1922 XEXP (SET_SRC (exp
), 1));
1926 else if (REG_P (SET_DEST (exp
))
1927 || (GET_CODE (SET_DEST (exp
)) == STRICT_LOW_PART
1928 && REG_P (XEXP (SET_DEST (exp
), 0))))
1930 /* A register is set; normally CC is set to show that no
1931 test insn is needed. Catch the exceptions. */
1933 /* If not to cc0, then no "set"s in non-natural mode give
1935 if (GET_MODE_SIZE (GET_MODE (SET_DEST (exp
))) > UNITS_PER_WORD
1936 || GET_MODE_CLASS (GET_MODE (SET_DEST (exp
))) == MODE_FLOAT
)
1938 /* ... except add:s and sub:s in DImode. */
1939 if (GET_MODE (SET_DEST (exp
)) == DImode
1940 && (GET_CODE (SET_SRC (exp
)) == PLUS
1941 || GET_CODE (SET_SRC (exp
)) == MINUS
))
1943 cc_status
.flags
= 0;
1944 cc_status
.value1
= SET_DEST (exp
);
1945 cc_status
.value2
= SET_SRC (exp
);
1947 if (cris_reg_overlap_mentioned_p (cc_status
.value1
,
1949 cc_status
.value2
= 0;
1951 /* Add and sub may set V, which gets us
1952 unoptimizable results in "gt" and "le" condition
1954 cc_status
.flags
|= CC_NO_OVERFLOW
;
1959 else if (SET_SRC (exp
) == const0_rtx
)
1961 /* There's no CC0 change when clearing a register or
1962 memory. Just check for overlap. */
1963 if ((cc_status
.value1
1964 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
1966 cc_status
.value1
= 0;
1968 if ((cc_status
.value2
1969 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
1971 cc_status
.value2
= 0;
1977 cc_status
.flags
= 0;
1978 cc_status
.value1
= SET_DEST (exp
);
1979 cc_status
.value2
= SET_SRC (exp
);
1981 if (cris_reg_overlap_mentioned_p (cc_status
.value1
,
1983 cc_status
.value2
= 0;
1985 /* Some operations may set V, which gets us
1986 unoptimizable results in "gt" and "le" condition
1988 if (GET_CODE (SET_SRC (exp
)) == PLUS
1989 || GET_CODE (SET_SRC (exp
)) == MINUS
1990 || GET_CODE (SET_SRC (exp
)) == NEG
)
1991 cc_status
.flags
|= CC_NO_OVERFLOW
;
1996 else if (GET_CODE (SET_DEST (exp
)) == MEM
1997 || (GET_CODE (SET_DEST (exp
)) == STRICT_LOW_PART
1998 && GET_CODE (XEXP (SET_DEST (exp
), 0)) == MEM
))
2000 /* When SET to MEM, then CC is not changed (except for
2002 if ((cc_status
.value1
2003 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
2005 cc_status
.value1
= 0;
2007 if ((cc_status
.value2
2008 && cris_reg_overlap_mentioned_p (SET_DEST (exp
),
2010 cc_status
.value2
= 0;
2015 else if (GET_CODE (exp
) == PARALLEL
)
2017 if (GET_CODE (XVECEXP (exp
, 0, 0)) == SET
2018 && GET_CODE (XVECEXP (exp
, 0, 1)) == SET
2019 && REG_P (XEXP (XVECEXP (exp
, 0, 1), 0)))
2021 if (REG_P (XEXP (XVECEXP (exp
, 0, 0), 0))
2022 && GET_CODE (XEXP (XVECEXP (exp
, 0, 0), 1)) == MEM
)
2024 /* For "move.S [rx=ry+o],rz", say CC reflects
2025 value1=rz and value2=[rx] */
2026 cc_status
.value1
= XEXP (XVECEXP (exp
, 0, 0), 0);
2028 = replace_equiv_address (XEXP (XVECEXP (exp
, 0, 0), 1),
2029 XEXP (XVECEXP (exp
, 0, 1), 0));
2030 cc_status
.flags
= 0;
2032 /* Huh? A side-effect cannot change the destination
2034 if (cris_reg_overlap_mentioned_p (cc_status
.value1
,
2036 internal_error ("internal error: sideeffect-insn affecting main effect");
2039 else if ((REG_P (XEXP (XVECEXP (exp
, 0, 0), 1))
2040 || XEXP (XVECEXP (exp
, 0, 0), 1) == const0_rtx
)
2041 && GET_CODE (XEXP (XVECEXP (exp
, 0, 0), 0)) == MEM
)
2043 /* For "move.S rz,[rx=ry+o]" and "clear.S [rx=ry+o]",
2044 say flags are not changed, except for overlap. */
2045 if (cc_status
.value1
2046 && cris_reg_overlap_mentioned_p (XEXP
2050 cc_status
.value1
= 0;
2052 if (cc_status
.value1
2053 && cris_reg_overlap_mentioned_p (XEXP
2057 cc_status
.value1
= 0;
2059 if (cc_status
.value2
2060 && cris_reg_overlap_mentioned_p (XEXP
2064 cc_status
.value2
= 0;
2066 if (cc_status
.value2
2067 && cris_reg_overlap_mentioned_p (XEXP
2071 cc_status
.value2
= 0;
2080 /* Unknown cc_attr value. */
2087 /* Return != 0 if the return sequence for the current function is short,
2088 like "ret" or "jump [sp+]". Prior to reloading, we can't tell how
2089 many registers must be saved, so return 0 then. */
2092 cris_simple_epilogue (void)
2095 int reglimit
= STACK_POINTER_REGNUM
;
2098 if (! reload_completed
2099 || frame_pointer_needed
2100 || get_frame_size () != 0
2101 || current_function_pretend_args_size
2102 || current_function_args_size
2103 || current_function_outgoing_args_size
2104 || current_function_calls_eh_return
2106 /* If we're not supposed to emit prologue and epilogue, we must
2107 not emit return-type instructions. */
2108 || !TARGET_PROLOGUE_EPILOGUE
)
2111 /* We allow a "movem [sp+],rN" to sit in front if the "jump [sp+]" or
2112 in the delay-slot of the "ret". */
2113 for (regno
= 0; regno
< reglimit
; regno
++)
2114 if ((regs_ever_live
[regno
] && ! call_used_regs
[regno
])
2115 || (regno
== (int) PIC_OFFSET_TABLE_REGNUM
2116 && (current_function_uses_pic_offset_table
2117 /* It is saved anyway, if there would be a gap. */
2119 && regs_ever_live
[regno
+ 1]
2120 && !call_used_regs
[regno
+ 1]))))
2122 if (lastreg
!= regno
- 1)
2130 /* Compute a (partial) cost for rtx X. Return true if the complete
2131 cost has been computed, and false if subexpressions should be
2132 scanned. In either case, *TOTAL contains the cost result. */
2135 cris_rtx_costs (rtx x
, int code
, int outer_code
, int *total
)
2141 HOST_WIDE_INT val
= INTVAL (x
);
2144 else if (val
< 32 && val
>= -32)
2146 /* Eight or 16 bits are a word and cycle more expensive. */
2147 else if (val
<= 32767 && val
>= -32768)
2149 /* A 32 bit constant (or very seldom, unsigned 16 bits) costs
2150 another word. FIXME: This isn't linear to 16 bits. */
2162 /* For PIC, we need a prefix (if it isn't already there),
2163 and the PIC register. For a global PIC symbol, we also
2164 need a read of the GOT. */
2167 if (cris_got_symbol (x
))
2177 if (x
!= CONST0_RTX (GET_MODE (x
) == VOIDmode
? DImode
: GET_MODE (x
)))
2180 /* Make 0.0 cheap, else test-insns will not be used. */
2185 /* Identify values that are no powers of two. Powers of 2 are
2186 taken care of already and those values should not be changed. */
2187 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
2188 || exact_log2 (INTVAL (XEXP (x
, 1)) < 0))
2190 /* If we have a multiply insn, then the cost is between
2191 1 and 2 "fast" instructions. */
2192 if (TARGET_HAS_MUL_INSNS
)
2194 *total
= COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2;
2198 /* Estimate as 4 + 4 * #ofbits. */
2199 *total
= COSTS_N_INSNS (132);
2208 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
2209 || exact_log2 (INTVAL (XEXP (x
, 1)) < 0))
2211 /* Estimate this as 4 + 8 * #of bits. */
2212 *total
= COSTS_N_INSNS (260);
2218 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
2219 /* Two constants may actually happen before optimization. */
2220 && GET_CODE (XEXP (x
, 0)) != CONST_INT
2221 && !CONST_OK_FOR_LETTER_P (INTVAL (XEXP (x
, 1)), 'I'))
2223 *total
= (rtx_cost (XEXP (x
, 0), outer_code
) + 2
2224 + 2 * GET_MODE_NUNITS (GET_MODE (XEXP (x
, 0))));
2229 case ZERO_EXTEND
: case SIGN_EXTEND
:
2230 *total
= rtx_cost (XEXP (x
, 0), outer_code
);
2238 /* The ADDRESS_COST worker. */
2241 cris_address_cost (rtx x
)
2243 /* The metric to use for the cost-macros is unclear.
2244 The metric used here is (the number of cycles needed) / 2,
2245 where we consider equal a cycle for a word of code and a cycle to
2248 /* The cheapest addressing modes get 0, since nothing extra is needed. */
2249 if (BASE_OR_AUTOINCR_P (x
))
2252 /* An indirect mem must be a DIP. This means two bytes extra for code,
2253 and 4 bytes extra for memory read, i.e. (2 + 4) / 2. */
2254 if (GET_CODE (x
) == MEM
)
2257 /* Assume (2 + 4) / 2 for a single constant; a dword, since it needs
2258 an extra DIP prefix and 4 bytes of constant in most cases.
2259 For PIC and a symbol with a GOT entry, we double the cost since we
2260 add a [rPIC+...] offset. A GOT-less symbol uses a BDAP prefix
2261 equivalent to the DIP prefix for non-PIC, hence the same cost. */
2263 return flag_pic
&& cris_got_symbol (x
) ? 2 * (2 + 4) / 2 : (2 + 4) / 2;
2265 /* Handle BIAP and BDAP prefixes. */
2266 if (GET_CODE (x
) == PLUS
)
2268 rtx tem1
= XEXP (x
, 0);
2269 rtx tem2
= XEXP (x
, 1);
2271 /* A BIAP is 2 extra bytes for the prefix insn, nothing more. We
2272 recognize the typical MULT which is always in tem1 because of
2273 insn canonicalization. */
2274 if ((GET_CODE (tem1
) == MULT
&& BIAP_INDEX_P (tem1
))
2278 /* A BDAP (quick) is 2 extra bytes. Any constant operand to the
2279 PLUS is always found in tem2. */
2280 if (GET_CODE (tem2
) == CONST_INT
2281 && INTVAL (tem2
) < 128 && INTVAL (tem2
) >= -128)
2284 /* A BDAP -32768 .. 32767 is like BDAP quick, but with 2 extra
2286 if (GET_CODE (tem2
) == CONST_INT
2287 && CONST_OK_FOR_LETTER_P (INTVAL (tem2
), 'L'))
2290 /* A BDAP with some other constant is 2 bytes extra. */
2291 if (CONSTANT_P (tem2
))
2292 return (2 + 2 + 2) / 2;
2294 /* BDAP with something indirect should have a higher cost than
2295 BIAP with register. FIXME: Should it cost like a MEM or more? */
2296 /* Don't need to check it, it's the only one left.
2297 FIXME: There was a REG test missing, perhaps there are others.
2299 return (2 + 2 + 2) / 2;
2302 /* What else? Return a high cost. It matters only for valid
2303 addressing modes. */
2307 /* Check various objections to the side-effect. Used in the test-part
2308 of an anonymous insn describing an insn with a possible side-effect.
2309 Returns nonzero if the implied side-effect is ok.
2312 ops : An array of rtx:es. lreg, rreg, rval,
2313 The variables multop and other_op are indexes into this,
2314 or -1 if they are not applicable.
2315 lreg : The register that gets assigned in the side-effect.
2316 rreg : One register in the side-effect expression
2317 rval : The other register, or an int.
2318 multop : An integer to multiply rval with.
2319 other_op : One of the entities of the main effect,
2320 whose mode we must consider. */
2323 cris_side_effect_mode_ok (enum rtx_code code
, rtx
*ops
,
2324 int lreg
, int rreg
, int rval
,
2325 int multop
, int other_op
)
2327 /* Find what value to multiply with, for rx =ry + rz * n. */
2328 int mult
= multop
< 0 ? 1 : INTVAL (ops
[multop
]);
2330 rtx reg_rtx
= ops
[rreg
];
2331 rtx val_rtx
= ops
[rval
];
2333 /* The operands may be swapped. Canonicalize them in reg_rtx and
2334 val_rtx, where reg_rtx always is a reg (for this constraint to
2336 if (! BASE_P (reg_rtx
))
2337 reg_rtx
= val_rtx
, val_rtx
= ops
[rreg
];
2339 /* Don't forget to check that reg_rtx really is a reg. If it isn't,
2340 we have no business. */
2341 if (! BASE_P (reg_rtx
))
2344 /* Don't do this when -mno-split. */
2345 if (!TARGET_SIDE_EFFECT_PREFIXES
)
2348 /* The mult expression may be hidden in lreg. FIXME: Add more
2349 commentary about that. */
2350 if (GET_CODE (val_rtx
) == MULT
)
2352 mult
= INTVAL (XEXP (val_rtx
, 1));
2353 val_rtx
= XEXP (val_rtx
, 0);
2357 /* First check the "other operand". */
2360 if (GET_MODE_SIZE (GET_MODE (ops
[other_op
])) > UNITS_PER_WORD
)
2363 /* Check if the lvalue register is the same as the "other
2364 operand". If so, the result is undefined and we shouldn't do
2365 this. FIXME: Check again. */
2366 if ((BASE_P (ops
[lreg
])
2367 && BASE_P (ops
[other_op
])
2368 && REGNO (ops
[lreg
]) == REGNO (ops
[other_op
]))
2369 || rtx_equal_p (ops
[other_op
], ops
[lreg
]))
2373 /* Do not accept frame_pointer_rtx as any operand. */
2374 if (ops
[lreg
] == frame_pointer_rtx
|| ops
[rreg
] == frame_pointer_rtx
2375 || ops
[rval
] == frame_pointer_rtx
2376 || (other_op
>= 0 && ops
[other_op
] == frame_pointer_rtx
))
2380 && ! BASE_P (val_rtx
))
2383 /* Do not allow rx = rx + n if a normal add or sub with same size
2385 if (rtx_equal_p (ops
[lreg
], reg_rtx
)
2386 && GET_CODE (val_rtx
) == CONST_INT
2387 && (INTVAL (val_rtx
) <= 63 && INTVAL (val_rtx
) >= -63))
2390 /* Check allowed cases, like [r(+)?].[bwd] and const.
2391 A symbol is not allowed with PIC. */
2392 if (CONSTANT_P (val_rtx
))
2393 return flag_pic
== 0 || cris_symbol (val_rtx
) == 0;
2395 if (GET_CODE (val_rtx
) == MEM
2396 && BASE_OR_AUTOINCR_P (XEXP (val_rtx
, 0)))
2399 if (GET_CODE (val_rtx
) == SIGN_EXTEND
2400 && GET_CODE (XEXP (val_rtx
, 0)) == MEM
2401 && BASE_OR_AUTOINCR_P (XEXP (XEXP (val_rtx
, 0), 0)))
2404 /* If we got here, it's not a valid addressing mode. */
2407 else if (code
== MULT
2408 || (code
== PLUS
&& BASE_P (val_rtx
)))
2410 /* Do not allow rx = rx + ry.S, since it doesn't give better code. */
2411 if (rtx_equal_p (ops
[lreg
], reg_rtx
)
2412 || (mult
== 1 && rtx_equal_p (ops
[lreg
], val_rtx
)))
2415 /* Do not allow bad multiply-values. */
2416 if (mult
!= 1 && mult
!= 2 && mult
!= 4)
2419 /* Only allow r + ... */
2420 if (! BASE_P (reg_rtx
))
2423 /* If we got here, all seems ok.
2424 (All checks need to be done above). */
2428 /* If we get here, the caller got its initial tests wrong. */
2429 internal_error ("internal error: cris_side_effect_mode_ok with bad operands");
2432 /* The function reg_overlap_mentioned_p in CVS (still as of 2001-05-16)
2433 does not handle the case where the IN operand is strict_low_part; it
2434 does handle it for X. Test-case in Axis-20010516. This function takes
2435 care of that for THIS port. FIXME: strict_low_part is going away
2439 cris_reg_overlap_mentioned_p (rtx x
, rtx in
)
2441 /* The function reg_overlap_mentioned now handles when X is
2442 strict_low_part, but not when IN is a STRICT_LOW_PART. */
2443 if (GET_CODE (in
) == STRICT_LOW_PART
)
2446 return reg_overlap_mentioned_p (x
, in
);
2449 /* The TARGET_ASM_NAMED_SECTION worker.
2450 We just dispatch to the functions for ELF and a.out. */
2453 cris_target_asm_named_section (const char *name
, unsigned int flags
,
2457 default_no_named_section (name
, flags
, decl
);
2459 default_elf_asm_named_section (name
, flags
, decl
);
2462 /* The LEGITIMATE_PIC_OPERAND_P worker. */
2465 cris_legitimate_pic_operand (rtx x
)
2467 /* The PIC representation of a symbol with a GOT entry will be (for
2468 example; relocations differ):
2469 sym => [rPIC+sym:GOT]
2470 and for a GOT-less symbol it will be (for example, relocation differ):
2471 sym => rPIC+sym:GOTOFF
2472 so only a symbol with a GOT is by itself a valid operand, and it
2473 can't be a sum of a symbol and an offset. */
2474 return ! cris_symbol (x
) || cris_got_symbol (x
);
2477 /* Return nonzero if there's a SYMBOL_REF or LABEL_REF hiding inside this
2483 switch (GET_CODE (x
))
2490 /* A PLT reference. */
2491 ASSERT_PLT_UNSPEC (x
);
2495 return cris_symbol (XEXP (x
, 0));
2499 return cris_symbol (XEXP (x
, 0)) || cris_symbol (XEXP (x
, 1));
2506 fatal_insn ("unrecognized supposed constant", x
);
2512 /* Return nonzero if there's a SYMBOL_REF or LABEL_REF hiding inside this
2513 CONSTANT_P, and the symbol does not need a GOT entry. Also set
2514 current_function_uses_pic_offset_table if we're generating PIC and ever
2515 see something that would need one. */
2518 cris_gotless_symbol (rtx x
)
2520 #ifdef ENABLE_CHECKING
2525 switch (GET_CODE (x
))
2528 ASSERT_PLT_UNSPEC (x
);
2533 current_function_uses_pic_offset_table
= 1;
2534 return SYMBOL_REF_LOCAL_P (x
);
2537 /* We don't set current_function_uses_pic_offset_table for
2538 LABEL_REF:s in here, since they are almost always originating
2539 from some branch. The only time it does not come from a label is
2540 when GCC does something like __builtin_setjmp. Then we get the
2541 LABEL_REF from the movsi expander, so we mark it there as a
2546 return cris_gotless_symbol (XEXP (x
, 0));
2551 int x0
= cris_gotless_symbol (XEXP (x
, 0)) != 0;
2552 int x1
= cris_gotless_symbol (XEXP (x
, 1)) != 0;
2554 /* One and only one of them must be a local symbol. Neither must
2555 be some other, more general kind of symbol. */
2558 && ! (x0
== 0 && cris_symbol (XEXP (x
, 0)))
2559 && ! (x1
== 0 && cris_symbol (XEXP (x
, 1)));
2567 fatal_insn ("unrecognized supposed constant", x
);
2573 /* Return nonzero if there's a SYMBOL_REF or LABEL_REF hiding inside this
2574 CONSTANT_P, and the symbol needs a GOT entry. */
2577 cris_got_symbol (rtx x
)
2579 #ifdef ENABLE_CHECKING
2584 switch (GET_CODE (x
))
2587 ASSERT_PLT_UNSPEC (x
);
2592 current_function_uses_pic_offset_table
= 1;
2593 return ! SYMBOL_REF_LOCAL_P (x
);
2596 return cris_got_symbol (XEXP (x
, 0));
2599 /* A LABEL_REF is never visible as a symbol outside the local
2603 /* Nope, can't access the GOT for "symbol + offset". */
2611 fatal_insn ("unrecognized supposed constant in cris_global_pic_symbol",
2618 /* The OVERRIDE_OPTIONS worker.
2619 As is the norm, this also parses -mfoo=bar type parameters. */
2622 cris_override_options (void)
2624 if (cris_max_stackframe_str
)
2626 cris_max_stackframe
= atoi (cris_max_stackframe_str
);
2628 /* Do some sanity checking. */
2629 if (cris_max_stackframe
< 0 || cris_max_stackframe
> 0x20000000)
2630 internal_error ("-max-stackframe=%d is not usable, not between 0 and %d",
2631 cris_max_stackframe
, 0x20000000);
2634 /* Let "-metrax4" and "-metrax100" change the cpu version. */
2635 if (TARGET_SVINTO
&& cris_cpu_version
< CRIS_CPU_SVINTO
)
2636 cris_cpu_version
= CRIS_CPU_SVINTO
;
2637 else if (TARGET_ETRAX4_ADD
&& cris_cpu_version
< CRIS_CPU_ETRAX4
)
2638 cris_cpu_version
= CRIS_CPU_ETRAX4
;
2640 /* Parse -march=... and its synonym, the deprecated -mcpu=... */
2644 = (*cris_cpu_str
== 'v' ? atoi (cris_cpu_str
+ 1) : -1);
2646 if (strcmp ("etrax4", cris_cpu_str
) == 0)
2647 cris_cpu_version
= 3;
2649 if (strcmp ("svinto", cris_cpu_str
) == 0
2650 || strcmp ("etrax100", cris_cpu_str
) == 0)
2651 cris_cpu_version
= 8;
2653 if (strcmp ("ng", cris_cpu_str
) == 0
2654 || strcmp ("etrax100lx", cris_cpu_str
) == 0)
2655 cris_cpu_version
= 10;
2657 if (cris_cpu_version
< 0 || cris_cpu_version
> 10)
2658 error ("unknown CRIS version specification in -march= or -mcpu= : %s",
2661 /* Set the target flags. */
2662 if (cris_cpu_version
>= CRIS_CPU_ETRAX4
)
2663 target_flags
|= TARGET_MASK_ETRAX4_ADD
;
2665 /* If this is Svinto or higher, align for 32 bit accesses. */
2666 if (cris_cpu_version
>= CRIS_CPU_SVINTO
)
2668 |= (TARGET_MASK_SVINTO
| TARGET_MASK_ALIGN_BY_32
2669 | TARGET_MASK_STACK_ALIGN
| TARGET_MASK_CONST_ALIGN
2670 | TARGET_MASK_DATA_ALIGN
);
2672 /* Note that we do not add new flags when it can be completely
2673 described with a macro that uses -mcpu=X. So
2674 TARGET_HAS_MUL_INSNS is (cris_cpu_version >= CRIS_CPU_NG). */
2680 = (*cris_tune_str
== 'v' ? atoi (cris_tune_str
+ 1) : -1);
2682 if (strcmp ("etrax4", cris_tune_str
) == 0)
2685 if (strcmp ("svinto", cris_tune_str
) == 0
2686 || strcmp ("etrax100", cris_tune_str
) == 0)
2689 if (strcmp ("ng", cris_tune_str
) == 0
2690 || strcmp ("etrax100lx", cris_tune_str
) == 0)
2693 if (cris_tune
< 0 || cris_tune
> 10)
2694 error ("unknown CRIS cpu version specification in -mtune= : %s",
2697 if (cris_tune
>= CRIS_CPU_SVINTO
)
2698 /* We have currently nothing more to tune than alignment for
2701 |= (TARGET_MASK_STACK_ALIGN
| TARGET_MASK_CONST_ALIGN
2702 | TARGET_MASK_DATA_ALIGN
| TARGET_MASK_ALIGN_BY_32
);
2707 /* Use error rather than warning, so invalid use is easily
2708 detectable. Still change to the values we expect, to avoid
2712 error ("-fPIC and -fpic are not supported in this configuration");
2716 /* Turn off function CSE. We need to have the addresses reach the
2717 call expanders to get PLT-marked, as they could otherwise be
2718 compared against zero directly or indirectly. After visiting the
2719 call expanders they will then be cse:ed, as the call expanders
2720 force_reg the addresses, effectively forcing flag_no_function_cse
2722 flag_no_function_cse
= 1;
2725 if (write_symbols
== DWARF2_DEBUG
&& ! TARGET_ELF
)
2727 warning ("that particular -g option is invalid with -maout and -melinux");
2728 write_symbols
= DBX_DEBUG
;
2731 /* Set the per-function-data initializer. */
2732 init_machine_status
= cris_init_machine_status
;
2735 /* The TARGET_ASM_OUTPUT_MI_THUNK worker. */
2738 cris_asm_output_mi_thunk (FILE *stream
,
2739 tree thunkdecl ATTRIBUTE_UNUSED
,
2740 HOST_WIDE_INT delta
,
2741 HOST_WIDE_INT vcall_offset ATTRIBUTE_UNUSED
,
2745 fprintf (stream
, "\tadd%s " HOST_WIDE_INT_PRINT_DEC
",$%s\n",
2746 ADDITIVE_SIZE_MODIFIER (delta
), delta
,
2747 reg_names
[CRIS_FIRST_ARG_REG
]);
2749 fprintf (stream
, "\tsub%s " HOST_WIDE_INT_PRINT_DEC
",$%s\n",
2750 ADDITIVE_SIZE_MODIFIER (-delta
), -delta
,
2751 reg_names
[CRIS_FIRST_ARG_REG
]);
2755 const char *name
= XSTR (XEXP (DECL_RTL (funcdecl
), 0), 0);
2757 name
= (* targetm
.strip_name_encoding
) (name
);
2758 fprintf (stream
, "add.d ");
2759 assemble_name (stream
, name
);
2760 fprintf (stream
, "%s,$pc\n", CRIS_PLT_PCOFFSET_SUFFIX
);
2764 fprintf (stream
, "jump ");
2765 assemble_name (stream
, XSTR (XEXP (DECL_RTL (funcdecl
), 0), 0));
2766 fprintf (stream
, "\n");
2770 /* Boilerplate emitted at start of file.
2772 NO_APP *only at file start* means faster assembly. It also means
2773 comments are not allowed. In some cases comments will be output
2774 for debugging purposes. Make sure they are allowed then.
2776 We want a .file directive only if TARGET_ELF. */
2778 cris_file_start (void)
2780 /* These expressions can vary at run time, so we cannot put
2781 them into TARGET_INITIALIZER. */
2782 targetm
.file_start_app_off
= !(TARGET_PDEBUG
|| flag_print_asm_name
);
2783 targetm
.file_start_file_directive
= TARGET_ELF
;
2785 default_file_start ();
2788 /* Rename the function calls for integer multiply and divide. */
2790 cris_init_libfuncs (void)
2792 set_optab_libfunc (smul_optab
, SImode
, "__Mul");
2793 set_optab_libfunc (sdiv_optab
, SImode
, "__Div");
2794 set_optab_libfunc (udiv_optab
, SImode
, "__Udiv");
2795 set_optab_libfunc (smod_optab
, SImode
, "__Mod");
2796 set_optab_libfunc (umod_optab
, SImode
, "__Umod");
2799 /* The INIT_EXPANDERS worker sets the per-function-data initializer and
2803 cris_init_expanders (void)
2805 /* Nothing here at the moment. */
2808 /* Zero initialization is OK for all current fields. */
2810 static struct machine_function
*
2811 cris_init_machine_status (void)
2813 return ggc_alloc_cleared (sizeof (struct machine_function
));
2816 /* Split a 2 word move (DI or presumably DF) into component parts.
2817 Originally a copy of gen_split_move_double in m32r.c. */
2820 cris_split_movdx (rtx
*operands
)
2822 enum machine_mode mode
= GET_MODE (operands
[0]);
2823 rtx dest
= operands
[0];
2824 rtx src
= operands
[1];
2827 /* We used to have to handle (SUBREG (MEM)) here, but that should no
2828 longer happen; after reload there are no SUBREGs any more, and we're
2829 only called after reload. */
2830 if (GET_CODE (dest
) == SUBREG
|| GET_CODE (src
) == SUBREG
)
2834 if (GET_CODE (dest
) == REG
)
2836 int dregno
= REGNO (dest
);
2838 /* Reg-to-reg copy. */
2839 if (GET_CODE (src
) == REG
)
2841 int sregno
= REGNO (src
);
2843 int reverse
= (dregno
== sregno
+ 1);
2845 /* We normally copy the low-numbered register first. However, if
2846 the first register operand 0 is the same as the second register of
2847 operand 1, we must copy in the opposite order. */
2848 emit_insn (gen_rtx_SET (VOIDmode
,
2849 operand_subword (dest
, reverse
, TRUE
, mode
),
2850 operand_subword (src
, reverse
, TRUE
, mode
)));
2852 emit_insn (gen_rtx_SET (VOIDmode
,
2853 operand_subword (dest
, !reverse
, TRUE
, mode
),
2854 operand_subword (src
, !reverse
, TRUE
, mode
)));
2856 /* Constant-to-reg copy. */
2857 else if (GET_CODE (src
) == CONST_INT
|| GET_CODE (src
) == CONST_DOUBLE
)
2860 split_double (src
, &words
[0], &words
[1]);
2861 emit_insn (gen_rtx_SET (VOIDmode
,
2862 operand_subword (dest
, 0, TRUE
, mode
),
2865 emit_insn (gen_rtx_SET (VOIDmode
,
2866 operand_subword (dest
, 1, TRUE
, mode
),
2869 /* Mem-to-reg copy. */
2870 else if (GET_CODE (src
) == MEM
)
2872 /* If the high-address word is used in the address, we must load it
2873 last. Otherwise, load it first. */
2874 rtx addr
= XEXP (src
, 0);
2876 = (refers_to_regno_p (dregno
, dregno
+ 1, addr
, NULL
) != 0);
2878 /* The original code implies that we can't do
2879 move.x [rN+],rM move.x [rN],rM+1
2880 when rN is dead, because of REG_NOTES damage. That is
2881 consistent with what I've seen, so don't try it.
2883 We have two different cases here; if the addr is POST_INC,
2884 just pass it through, otherwise add constants. */
2886 if (GET_CODE (addr
) == POST_INC
)
2888 emit_insn (gen_rtx_SET (VOIDmode
,
2889 operand_subword (dest
, 0, TRUE
, mode
),
2890 change_address (src
, SImode
, addr
)));
2891 emit_insn (gen_rtx_SET (VOIDmode
,
2892 operand_subword (dest
, 1, TRUE
, mode
),
2893 change_address (src
, SImode
, addr
)));
2897 /* Make sure we don't get any other addresses with
2898 embedded postincrements. They should be stopped in
2899 GO_IF_LEGITIMATE_ADDRESS, but we're here for your
2901 if (side_effects_p (addr
))
2902 fatal_insn ("unexpected side-effects in address", addr
);
2904 emit_insn (gen_rtx_SET
2906 operand_subword (dest
, reverse
, TRUE
, mode
),
2909 plus_constant (addr
,
2910 reverse
* UNITS_PER_WORD
))));
2911 emit_insn (gen_rtx_SET
2913 operand_subword (dest
, ! reverse
, TRUE
, mode
),
2916 plus_constant (addr
,
2924 /* Reg-to-mem copy or clear mem. */
2925 else if (GET_CODE (dest
) == MEM
2926 && (GET_CODE (src
) == REG
2927 || src
== const0_rtx
2928 || src
== CONST0_RTX (DFmode
)))
2930 rtx addr
= XEXP (dest
, 0);
2932 if (GET_CODE (addr
) == POST_INC
)
2934 emit_insn (gen_rtx_SET (VOIDmode
,
2935 change_address (dest
, SImode
, addr
),
2936 operand_subword (src
, 0, TRUE
, mode
)));
2937 emit_insn (gen_rtx_SET (VOIDmode
,
2938 change_address (dest
, SImode
, addr
),
2939 operand_subword (src
, 1, TRUE
, mode
)));
2943 /* Make sure we don't get any other addresses with embedded
2944 postincrements. They should be stopped in
2945 GO_IF_LEGITIMATE_ADDRESS, but we're here for your safety. */
2946 if (side_effects_p (addr
))
2947 fatal_insn ("unexpected side-effects in address", addr
);
2949 emit_insn (gen_rtx_SET
2951 change_address (dest
, SImode
, addr
),
2952 operand_subword (src
, 0, TRUE
, mode
)));
2954 emit_insn (gen_rtx_SET
2956 change_address (dest
, SImode
,
2957 plus_constant (addr
,
2959 operand_subword (src
, 1, TRUE
, mode
)));
2971 /* This is in essence a copy of output_addr_const altered to output
2972 symbolic operands as PIC.
2974 FIXME: Add hooks similar to ASM_OUTPUT_SYMBOL_REF to get this effect in
2975 the "real" output_addr_const. All we need is one for LABEL_REF (and
2976 one for CODE_LABEL?). */
2979 cris_output_addr_const (FILE *file
, rtx x
)
2984 switch (GET_CODE (x
))
2987 ASSERT_PLT_UNSPEC (x
);
2988 x
= XVECEXP (x
, 0, 0);
2995 const char *origstr
= XSTR (x
, 0);
2998 str
= (* targetm
.strip_name_encoding
) (origstr
);
3002 if (cris_pic_sympart_only
)
3004 assemble_name (file
, str
);
3005 fprintf (file
, ":PLTG");
3009 if (TARGET_AVOID_GOTPLT
)
3010 /* We shouldn't get here. */
3013 fprintf (file
, "[$%s+", reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
3014 assemble_name (file
, XSTR (x
, 0));
3017 fprintf (file
, ":GOTPLT16]");
3019 fprintf (file
, ":GOTPLT]");
3022 else if (cris_gotless_symbol (x
))
3024 if (! cris_pic_sympart_only
)
3025 fprintf (file
, "$%s+", reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
3026 assemble_name (file
, str
);
3027 fprintf (file
, ":GOTOFF");
3029 else if (cris_got_symbol (x
))
3031 if (cris_pic_sympart_only
)
3033 fprintf (file
, "[$%s+", reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
3034 assemble_name (file
, XSTR (x
, 0));
3037 fprintf (file
, ":GOT16]");
3039 fprintf (file
, ":GOT]");
3042 LOSE_AND_RETURN ("unexpected PIC symbol", x
);
3045 if (! current_function_uses_pic_offset_table
)
3046 output_operand_lossage ("PIC register isn't set up");
3049 assemble_name (file
, XSTR (x
, 0));
3053 /* If we get one of those here, it should be dressed as PIC. Branch
3054 labels are normally output with the 'l' specifier, which means it
3055 will go directly to output_asm_label and not end up here. */
3056 if (GET_CODE (XEXP (x
, 0)) != CODE_LABEL
3057 && (GET_CODE (XEXP (x
, 0)) != NOTE
3058 || NOTE_LINE_NUMBER (XEXP (x
, 0)) != NOTE_INSN_DELETED_LABEL
))
3059 fatal_insn ("unexpected address expression", x
);
3063 if (cris_gotless_symbol (x
))
3065 if (! cris_pic_sympart_only
)
3066 fprintf (file
, "$%s+", reg_names
[PIC_OFFSET_TABLE_REGNUM
]);
3067 cris_output_addr_const (file
, XEXP (x
, 0));
3069 fprintf (file
, ":GOTOFF");
3072 /* Labels are never marked as global symbols. */
3073 fatal_insn ("unexpected PIC symbol", x
);
3076 if (! current_function_uses_pic_offset_table
)
3077 internal_error ("emitting PIC operand, but PIC register isn't set up");
3081 output_addr_const (file
, x
);
3085 if (NOTE_LINE_NUMBER (x
) != NOTE_INSN_DELETED_LABEL
)
3086 fatal_insn ("unexpected NOTE as addr_const:", x
);
3092 output_addr_const (file
, x
);
3096 /* This used to output parentheses around the expression,
3097 but that does not work on the 386 (either ATT or BSD assembler). */
3098 cris_output_addr_const (file
, XEXP (x
, 0));
3102 /* Some assemblers need integer constants to appear last (eg masm). */
3103 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
3105 cris_output_addr_const (file
, XEXP (x
, 1));
3106 if (INTVAL (XEXP (x
, 0)) >= 0)
3107 fprintf (file
, "+");
3108 output_addr_const (file
, XEXP (x
, 0));
3112 cris_output_addr_const (file
, XEXP (x
, 0));
3113 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
3114 || INTVAL (XEXP (x
, 1)) >= 0)
3115 fprintf (file
, "+");
3116 cris_output_addr_const (file
, XEXP (x
, 1));
3121 /* Avoid outputting things like x-x or x+5-x,
3122 since some assemblers can't handle that. */
3123 x
= simplify_subtraction (x
);
3124 if (GET_CODE (x
) != MINUS
)
3127 cris_output_addr_const (file
, XEXP (x
, 0));
3128 fprintf (file
, "-");
3129 if ((GET_CODE (XEXP (x
, 1)) == CONST_INT
3130 && INTVAL (XEXP (x
, 1)) < 0)
3131 || GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3133 fprintf (file
, "%s", targetm
.asm_out
.open_paren
);
3134 cris_output_addr_const (file
, XEXP (x
, 1));
3135 fprintf (file
, "%s", targetm
.asm_out
.close_paren
);
3138 output_addr_const (file
, XEXP (x
, 1));
3142 LOSE_AND_RETURN ("unexpected address expression", x
);
3146 /* Worker function for TARGET_STRUCT_VALUE_RTX. */
3149 cris_struct_value_rtx (tree fntype ATTRIBUTE_UNUSED
,
3150 int incoming ATTRIBUTE_UNUSED
)
3152 return gen_rtx_REG (Pmode
, CRIS_STRUCT_VALUE_REGNUM
);
3155 /* Worker function for TARGET_SETUP_INCOMING_VARARGS. */
3158 cris_setup_incoming_varargs (CUMULATIVE_ARGS
*ca
,
3159 enum machine_mode mode ATTRIBUTE_UNUSED
,
3160 tree type ATTRIBUTE_UNUSED
,
3161 int *pretend_arg_size
,
3164 if (ca
->regs
< CRIS_MAX_ARGS_IN_REGS
)
3165 *pretend_arg_size
= (CRIS_MAX_ARGS_IN_REGS
- ca
->regs
) * 4;
3168 fprintf (asm_out_file
,
3169 "\n; VA:: ANSI: %d args before, anon @ #%d, %dtime\n",
3170 ca
->regs
, *pretend_arg_size
, second_time
);
3174 /* Return true if TYPE must be passed by invisible reference.
3175 For cris, we pass <= 8 bytes by value, others by reference. */
3178 cris_pass_by_reference (CUMULATIVE_ARGS
*ca ATTRIBUTE_UNUSED
,
3179 enum machine_mode mode
, tree type
,
3180 bool named ATTRIBUTE_UNUSED
)
3182 return (targetm
.calls
.must_pass_in_stack (mode
, type
)
3183 || CRIS_FUNCTION_ARG_SIZE (mode
, type
) > 8);
3188 /* Various small functions to replace macros. Only called from a
3189 debugger. They might collide with gcc functions or system functions,
3190 so only emit them when '#if 1' above. */
3192 enum rtx_code
Get_code (rtx
);
3197 return GET_CODE (x
);
3200 const char *Get_mode (rtx
);
3205 return GET_MODE_NAME (GET_MODE (x
));
3208 rtx
Xexp (rtx
, int);
3216 rtx
Xvecexp (rtx
, int, int);
3219 Xvecexp (rtx x
, int n
, int m
)
3221 return XVECEXP (x
, n
, m
);
3224 int Get_rtx_len (rtx
);
3229 return GET_RTX_LENGTH (GET_CODE (x
));
3232 /* Use upper-case to distinguish from local variables that are sometimes
3233 called next_insn and prev_insn. */
3235 rtx
Next_insn (rtx
);
3238 Next_insn (rtx insn
)
3240 return NEXT_INSN (insn
);
3243 rtx
Prev_insn (rtx
);
3246 Prev_insn (rtx insn
)
3248 return PREV_INSN (insn
);
3252 #include "gt-cris.h"
3256 * eval: (c-set-style "gnu")
3257 * indent-tabs-mode: t