]> gcc.gnu.org Git - gcc.git/blob - gcc/config/fr30/fr30.c
5e11b6330f8e9c18fc64d4073e3f717898df3b57
[gcc.git] / gcc / config / fr30 / fr30.c
1 /* FR30 specific functions.
2 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004
3 Free Software Foundation, Inc.
4 Contributed by Cygnus Solutions.
5
6 This file is part of GCC.
7
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)
11 any later version.
12
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.
17
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. */
22
23 /*{{{ Includes */
24
25 #include "config.h"
26 #include "system.h"
27 #include "coretypes.h"
28 #include "tm.h"
29 #include "rtl.h"
30 #include "regs.h"
31 #include "hard-reg-set.h"
32 #include "real.h"
33 #include "insn-config.h"
34 #include "conditions.h"
35 #include "insn-attr.h"
36 #include "flags.h"
37 #include "recog.h"
38 #include "tree.h"
39 #include "output.h"
40 #include "expr.h"
41 #include "obstack.h"
42 #include "except.h"
43 #include "function.h"
44 #include "toplev.h"
45 #include "tm_p.h"
46 #include "target.h"
47 #include "target-def.h"
48
49 /*}}}*/
50 /*{{{ Function Prologues & Epilogues */
51
52 /* Define the information needed to generate branch and scc insns. This is
53 stored from the compare operation. */
54
55 struct rtx_def * fr30_compare_op0;
56 struct rtx_def * fr30_compare_op1;
57
58 /* The FR30 stack looks like this:
59
60 Before call After call
61 FP ->| | | |
62 +-----------------------+ +-----------------------+ high
63 | | | | memory
64 | local variables, | | local variables, |
65 | reg save area, etc. | | reg save area, etc. |
66 | | | |
67 +-----------------------+ +-----------------------+
68 | | | |
69 | args to the func that | | args to this func. |
70 | is being called that | | |
71 SP ->| do not fit in regs | | |
72 +-----------------------+ +-----------------------+
73 | args that used to be | \
74 | in regs; only created | | pretend_size
75 AP-> | for vararg funcs | /
76 +-----------------------+
77 | | \
78 | register save area | |
79 | | |
80 +-----------------------+ | reg_size
81 | return address | |
82 +-----------------------+ |
83 FP ->| previous frame ptr | /
84 +-----------------------+
85 | | \
86 | local variables | | var_size
87 | | /
88 +-----------------------+
89 | | \
90 low | room for args to | |
91 memory | other funcs called | | args_size
92 | from this one | |
93 SP ->| | /
94 +-----------------------+
95
96 Note, AP is a fake hard register. It will be eliminated in favor of
97 SP or FP as appropriate.
98
99 Note, Some or all of the stack sections above may be omitted if they
100 are not needed. */
101
102 /* Structure to be filled in by fr30_compute_frame_size() with register
103 save masks, and offsets for the current function. */
104 struct fr30_frame_info
105 {
106 unsigned int total_size; /* # Bytes that the entire frame takes up. */
107 unsigned int pretend_size; /* # Bytes we push and pretend caller did. */
108 unsigned int args_size; /* # Bytes that outgoing arguments take up. */
109 unsigned int reg_size; /* # Bytes needed to store regs. */
110 unsigned int var_size; /* # Bytes that variables take up. */
111 unsigned int frame_size; /* # Bytes in current frame. */
112 unsigned int gmask; /* Mask of saved registers. */
113 unsigned int save_fp; /* Nonzero if frame pointer must be saved. */
114 unsigned int save_rp; /* Nonzero if return pointer must be saved. */
115 int initialised; /* Nonzero if frame size already calculated. */
116 };
117
118 /* Current frame information calculated by fr30_compute_frame_size(). */
119 static struct fr30_frame_info current_frame_info;
120
121 /* Zero structure to initialize current_frame_info. */
122 static struct fr30_frame_info zero_frame_info;
123
124 static void fr30_setup_incoming_varargs (CUMULATIVE_ARGS *, enum machine_mode,
125 tree, int *, int);
126 static rtx fr30_pass_by_reference (tree, tree);
127 static rtx fr30_pass_by_value (tree, tree);
128
129 #define FRAME_POINTER_MASK (1 << (FRAME_POINTER_REGNUM))
130 #define RETURN_POINTER_MASK (1 << (RETURN_POINTER_REGNUM))
131
132 /* Tell prologue and epilogue if register REGNO should be saved / restored.
133 The return address and frame pointer are treated separately.
134 Don't consider them here. */
135 #define MUST_SAVE_REGISTER(regno) \
136 ( (regno) != RETURN_POINTER_REGNUM \
137 && (regno) != FRAME_POINTER_REGNUM \
138 && regs_ever_live [regno] \
139 && ! call_used_regs [regno] )
140
141 #define MUST_SAVE_FRAME_POINTER (regs_ever_live [FRAME_POINTER_REGNUM] || frame_pointer_needed)
142 #define MUST_SAVE_RETURN_POINTER (regs_ever_live [RETURN_POINTER_REGNUM] || current_function_profile)
143
144 #if UNITS_PER_WORD == 4
145 #define WORD_ALIGN(SIZE) (((SIZE) + 3) & ~3)
146 #endif
147 \f
148 /* Initialize the GCC target structure. */
149 #undef TARGET_ASM_ALIGNED_HI_OP
150 #define TARGET_ASM_ALIGNED_HI_OP "\t.hword\t"
151 #undef TARGET_ASM_ALIGNED_SI_OP
152 #define TARGET_ASM_ALIGNED_SI_OP "\t.word\t"
153
154 #undef TARGET_PROMOTE_PROTOTYPES
155 #define TARGET_PROMOTE_PROTOTYPES hook_bool_tree_true
156
157 #undef TARGET_SETUP_INCOMING_VARARGS
158 #define TARGET_SETUP_INCOMING_VARARGS fr30_setup_incoming_varargs
159
160 struct gcc_target targetm = TARGET_INITIALIZER;
161 \f
162 /* Returns the number of bytes offset between FROM_REG and TO_REG
163 for the current function. As a side effect it fills in the
164 current_frame_info structure, if the data is available. */
165 unsigned int
166 fr30_compute_frame_size (int from_reg, int to_reg)
167 {
168 int regno;
169 unsigned int return_value;
170 unsigned int var_size;
171 unsigned int args_size;
172 unsigned int pretend_size;
173 unsigned int reg_size;
174 unsigned int gmask;
175
176 var_size = WORD_ALIGN (get_frame_size ());
177 args_size = WORD_ALIGN (current_function_outgoing_args_size);
178 pretend_size = current_function_pretend_args_size;
179
180 reg_size = 0;
181 gmask = 0;
182
183 /* Calculate space needed for registers. */
184 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno ++)
185 {
186 if (MUST_SAVE_REGISTER (regno))
187 {
188 reg_size += UNITS_PER_WORD;
189 gmask |= 1 << regno;
190 }
191 }
192
193 current_frame_info.save_fp = MUST_SAVE_FRAME_POINTER;
194 current_frame_info.save_rp = MUST_SAVE_RETURN_POINTER;
195
196 reg_size += (current_frame_info.save_fp + current_frame_info.save_rp)
197 * UNITS_PER_WORD;
198
199 /* Save computed information. */
200 current_frame_info.pretend_size = pretend_size;
201 current_frame_info.var_size = var_size;
202 current_frame_info.args_size = args_size;
203 current_frame_info.reg_size = reg_size;
204 current_frame_info.frame_size = args_size + var_size;
205 current_frame_info.total_size = args_size + var_size + reg_size + pretend_size;
206 current_frame_info.gmask = gmask;
207 current_frame_info.initialised = reload_completed;
208
209 /* Calculate the required distance. */
210 return_value = 0;
211
212 if (to_reg == STACK_POINTER_REGNUM)
213 return_value += args_size + var_size;
214
215 if (from_reg == ARG_POINTER_REGNUM)
216 return_value += reg_size;
217
218 return return_value;
219 }
220
221 /* Called after register allocation to add any instructions needed for the
222 prologue. Using a prologue insn is favored compared to putting all of the
223 instructions in output_function_prologue(), since it allows the scheduler
224 to intermix instructions with the saves of the caller saved registers. In
225 some cases, it might be necessary to emit a barrier instruction as the last
226 insn to prevent such scheduling. */
227
228 void
229 fr30_expand_prologue (void)
230 {
231 int regno;
232 rtx insn;
233
234 if (! current_frame_info.initialised)
235 fr30_compute_frame_size (0, 0);
236
237 /* This cases shouldn't happen. Catch it now. */
238 if (current_frame_info.total_size == 0
239 && current_frame_info.gmask)
240 abort ();
241
242 /* Allocate space for register arguments if this is a variadic function. */
243 if (current_frame_info.pretend_size)
244 {
245 int regs_to_save = current_frame_info.pretend_size / UNITS_PER_WORD;
246
247 /* Push argument registers into the pretend arg area. */
248 for (regno = FIRST_ARG_REGNUM + FR30_NUM_ARG_REGS; regno --, regs_to_save --;)
249 {
250 insn = emit_insn (gen_movsi_push (gen_rtx_REG (Pmode, regno)));
251 RTX_FRAME_RELATED_P (insn) = 1;
252 }
253 }
254
255 if (current_frame_info.gmask)
256 {
257 /* Save any needed call-saved regs. */
258 for (regno = STACK_POINTER_REGNUM; regno--;)
259 {
260 if ((current_frame_info.gmask & (1 << regno)) != 0)
261 {
262 insn = emit_insn (gen_movsi_push (gen_rtx_REG (Pmode, regno)));
263 RTX_FRAME_RELATED_P (insn) = 1;
264 }
265 }
266 }
267
268 /* Save return address if necessary. */
269 if (current_frame_info.save_rp)
270 {
271 insn = emit_insn (gen_movsi_push (gen_rtx_REG (Pmode,
272 RETURN_POINTER_REGNUM)));
273 RTX_FRAME_RELATED_P (insn) = 1;
274 }
275
276 /* Save old frame pointer and create new one, if necessary. */
277 if (current_frame_info.save_fp)
278 {
279 if (current_frame_info.frame_size < ((1 << 10) - UNITS_PER_WORD))
280 {
281 int enter_size = current_frame_info.frame_size + UNITS_PER_WORD;
282 rtx pattern;
283
284 insn = emit_insn (gen_enter_func (GEN_INT (enter_size)));
285 RTX_FRAME_RELATED_P (insn) = 1;
286
287 pattern = PATTERN (insn);
288
289 /* Also mark all 3 subexpressions as RTX_FRAME_RELATED_P. */
290 if (GET_CODE (pattern) == PARALLEL)
291 {
292 int x;
293 for (x = XVECLEN (pattern, 0); x--;)
294 {
295 rtx part = XVECEXP (pattern, 0, x);
296
297 /* One of the insns in the ENTER pattern updates the
298 frame pointer. If we do not actually need the frame
299 pointer in this function then this is a side effect
300 rather than a desired effect, so we do not mark that
301 insn as being related to the frame set up. Doing this
302 allows us to compile the crash66.C test file in the
303 G++ testsuite. */
304 if (! frame_pointer_needed
305 && GET_CODE (part) == SET
306 && REGNO (SET_DEST (part)) == HARD_FRAME_POINTER_REGNUM)
307 RTX_FRAME_RELATED_P (part) = 0;
308 else
309 RTX_FRAME_RELATED_P (part) = 1;
310 }
311 }
312 }
313 else
314 {
315 insn = emit_insn (gen_movsi_push (frame_pointer_rtx));
316 RTX_FRAME_RELATED_P (insn) = 1;
317
318 if (frame_pointer_needed)
319 {
320 insn = emit_insn (gen_movsi (frame_pointer_rtx, stack_pointer_rtx));
321 RTX_FRAME_RELATED_P (insn) = 1;
322 }
323 }
324 }
325
326 /* Allocate the stack frame. */
327 if (current_frame_info.frame_size == 0)
328 ; /* Nothing to do. */
329 else if (current_frame_info.save_fp
330 && current_frame_info.frame_size < ((1 << 10) - UNITS_PER_WORD))
331 ; /* Nothing to do. */
332 else if (current_frame_info.frame_size <= 512)
333 {
334 insn = emit_insn (gen_add_to_stack (GEN_INT (- current_frame_info.frame_size)));
335 RTX_FRAME_RELATED_P (insn) = 1;
336 }
337 else
338 {
339 rtx tmp = gen_rtx_REG (Pmode, PROLOGUE_TMP_REGNUM);
340 insn = emit_insn (gen_movsi (tmp, GEN_INT (current_frame_info.frame_size)));
341 RTX_FRAME_RELATED_P (insn) = 1;
342 insn = emit_insn (gen_subsi3 (stack_pointer_rtx, stack_pointer_rtx, tmp));
343 RTX_FRAME_RELATED_P (insn) = 1;
344 }
345
346 if (current_function_profile)
347 emit_insn (gen_blockage ());
348 }
349
350 /* Called after register allocation to add any instructions needed for the
351 epilogue. Using an epilogue insn is favored compared to putting all of the
352 instructions in output_function_epilogue(), since it allows the scheduler
353 to intermix instructions with the restores of the caller saved registers.
354 In some cases, it might be necessary to emit a barrier instruction as the
355 first insn to prevent such scheduling. */
356 void
357 fr30_expand_epilogue (void)
358 {
359 int regno;
360
361 /* Perform the inversion operations of the prologue. */
362 if (! current_frame_info.initialised)
363 abort ();
364
365 /* Pop local variables and arguments off the stack.
366 If frame_pointer_needed is TRUE then the frame pointer register
367 has actually been used as a frame pointer, and we can recover
368 the stack pointer from it, otherwise we must unwind the stack
369 manually. */
370 if (current_frame_info.frame_size > 0)
371 {
372 if (current_frame_info.save_fp && frame_pointer_needed)
373 {
374 emit_insn (gen_leave_func ());
375 current_frame_info.save_fp = 0;
376 }
377 else if (current_frame_info.frame_size <= 508)
378 emit_insn (gen_add_to_stack
379 (GEN_INT (current_frame_info.frame_size)));
380 else
381 {
382 rtx tmp = gen_rtx_REG (Pmode, PROLOGUE_TMP_REGNUM);
383 emit_insn (gen_movsi (tmp, GEN_INT (current_frame_info.frame_size)));
384 emit_insn (gen_addsi3 (stack_pointer_rtx, stack_pointer_rtx, tmp));
385 }
386 }
387
388 if (current_frame_info.save_fp)
389 emit_insn (gen_movsi_pop (frame_pointer_rtx));
390
391 /* Pop all the registers that were pushed. */
392 if (current_frame_info.save_rp)
393 emit_insn (gen_movsi_pop (gen_rtx_REG (Pmode, RETURN_POINTER_REGNUM)));
394
395 for (regno = 0; regno < STACK_POINTER_REGNUM; regno ++)
396 if (current_frame_info.gmask & (1 << regno))
397 emit_insn (gen_movsi_pop (gen_rtx_REG (Pmode, regno)));
398
399 if (current_frame_info.pretend_size)
400 emit_insn (gen_add_to_stack (GEN_INT (current_frame_info.pretend_size)));
401
402 /* Reset state info for each function. */
403 current_frame_info = zero_frame_info;
404
405 emit_jump_insn (gen_return_from_func ());
406 }
407
408 /* Do any needed setup for a variadic function. We must create a register
409 parameter block, and then copy any anonymous arguments, plus the last
410 named argument, from registers into memory. * copying actually done in
411 fr30_expand_prologue().
412
413 ARG_REGS_USED_SO_FAR has *not* been updated for the last named argument
414 which has type TYPE and mode MODE, and we rely on this fact. */
415 void
416 fr30_setup_incoming_varargs (CUMULATIVE_ARGS *arg_regs_used_so_far,
417 enum machine_mode mode,
418 tree type ATTRIBUTE_UNUSED,
419 int *pretend_size,
420 int second_time ATTRIBUTE_UNUSED)
421 {
422 int size;
423
424 /* All BLKmode values are passed by reference. */
425 if (mode == BLKmode)
426 abort ();
427
428 /* ??? This run-time test as well as the code inside the if
429 statement is probably unnecessary. */
430 if (targetm.calls.strict_argument_naming (arg_regs_used_so_far))
431 /* If TARGET_STRICT_ARGUMENT_NAMING returns true, then the last named
432 arg must not be treated as an anonymous arg. */
433 arg_regs_used_so_far += fr30_num_arg_regs (mode, type);
434
435 size = FR30_NUM_ARG_REGS - (* arg_regs_used_so_far);
436
437 if (size <= 0)
438 return;
439
440 * pretend_size = (size * UNITS_PER_WORD);
441 }
442
443 /*}}}*/
444 /*{{{ Printing operands */
445
446 /* Print a memory address as an operand to reference that memory location. */
447
448 void
449 fr30_print_operand_address (FILE *stream, rtx address)
450 {
451 switch (GET_CODE (address))
452 {
453 case SYMBOL_REF:
454 output_addr_const (stream, address);
455 break;
456
457 default:
458 fprintf (stderr, "code = %x\n", GET_CODE (address));
459 debug_rtx (address);
460 output_operand_lossage ("fr30_print_operand_address: unhandled address");
461 break;
462 }
463 }
464
465 /* Print an operand. */
466
467 void
468 fr30_print_operand (FILE *file, rtx x, int code)
469 {
470 rtx x0;
471
472 switch (code)
473 {
474 case '#':
475 /* Output a :D if this instruction is delayed. */
476 if (dbr_sequence_length () != 0)
477 fputs (":D", file);
478 return;
479
480 case 'p':
481 /* Compute the register name of the second register in a hi/lo
482 register pair. */
483 if (GET_CODE (x) != REG)
484 output_operand_lossage ("fr30_print_operand: unrecognized %%p code");
485 else
486 fprintf (file, "r%d", REGNO (x) + 1);
487 return;
488
489 case 'b':
490 /* Convert GCC's comparison operators into FR30 comparison codes. */
491 switch (GET_CODE (x))
492 {
493 case EQ: fprintf (file, "eq"); break;
494 case NE: fprintf (file, "ne"); break;
495 case LT: fprintf (file, "lt"); break;
496 case LE: fprintf (file, "le"); break;
497 case GT: fprintf (file, "gt"); break;
498 case GE: fprintf (file, "ge"); break;
499 case LTU: fprintf (file, "c"); break;
500 case LEU: fprintf (file, "ls"); break;
501 case GTU: fprintf (file, "hi"); break;
502 case GEU: fprintf (file, "nc"); break;
503 default:
504 output_operand_lossage ("fr30_print_operand: unrecognized %%b code");
505 break;
506 }
507 return;
508
509 case 'B':
510 /* Convert GCC's comparison operators into the complimentary FR30
511 comparison codes. */
512 switch (GET_CODE (x))
513 {
514 case EQ: fprintf (file, "ne"); break;
515 case NE: fprintf (file, "eq"); break;
516 case LT: fprintf (file, "ge"); break;
517 case LE: fprintf (file, "gt"); break;
518 case GT: fprintf (file, "le"); break;
519 case GE: fprintf (file, "lt"); break;
520 case LTU: fprintf (file, "nc"); break;
521 case LEU: fprintf (file, "hi"); break;
522 case GTU: fprintf (file, "ls"); break;
523 case GEU: fprintf (file, "c"); break;
524 default:
525 output_operand_lossage ("fr30_print_operand: unrecognized %%B code");
526 break;
527 }
528 return;
529
530 case 'A':
531 /* Print a signed byte value as an unsigned value. */
532 if (GET_CODE (x) != CONST_INT)
533 output_operand_lossage ("fr30_print_operand: invalid operand to %%A code");
534 else
535 {
536 HOST_WIDE_INT val;
537
538 val = INTVAL (x);
539
540 val &= 0xff;
541
542 fprintf (file, HOST_WIDE_INT_PRINT_DEC, val);
543 }
544 return;
545
546 case 'x':
547 if (GET_CODE (x) != CONST_INT
548 || INTVAL (x) < 16
549 || INTVAL (x) > 32)
550 output_operand_lossage ("fr30_print_operand: invalid %%x code");
551 else
552 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x) - 16);
553 return;
554
555 case 'F':
556 if (GET_CODE (x) != CONST_DOUBLE)
557 output_operand_lossage ("fr30_print_operand: invalid %%F code");
558 else
559 {
560 char str[30];
561
562 real_to_decimal (str, CONST_DOUBLE_REAL_VALUE (x),
563 sizeof (str), 0, 1);
564 fputs (str, file);
565 }
566 return;
567
568 case 0:
569 /* Handled below. */
570 break;
571
572 default:
573 fprintf (stderr, "unknown code = %x\n", code);
574 output_operand_lossage ("fr30_print_operand: unknown code");
575 return;
576 }
577
578 switch (GET_CODE (x))
579 {
580 case REG:
581 fputs (reg_names [REGNO (x)], file);
582 break;
583
584 case MEM:
585 x0 = XEXP (x,0);
586
587 switch (GET_CODE (x0))
588 {
589 case REG:
590 if ((unsigned) REGNO (x0) >= ARRAY_SIZE (reg_names))
591 abort ();
592 fprintf (file, "@%s", reg_names [REGNO (x0)]);
593 break;
594
595 case PLUS:
596 if (GET_CODE (XEXP (x0, 0)) != REG
597 || REGNO (XEXP (x0, 0)) < FRAME_POINTER_REGNUM
598 || REGNO (XEXP (x0, 0)) > STACK_POINTER_REGNUM
599 || GET_CODE (XEXP (x0, 1)) != CONST_INT)
600 {
601 fprintf (stderr, "bad INDEXed address:");
602 debug_rtx (x);
603 output_operand_lossage ("fr30_print_operand: unhandled MEM");
604 }
605 else if (REGNO (XEXP (x0, 0)) == FRAME_POINTER_REGNUM)
606 {
607 HOST_WIDE_INT val = INTVAL (XEXP (x0, 1));
608 if (val < -(1 << 9) || val > ((1 << 9) - 4))
609 {
610 fprintf (stderr, "frame INDEX out of range:");
611 debug_rtx (x);
612 output_operand_lossage ("fr30_print_operand: unhandled MEM");
613 }
614 fprintf (file, "@(r14, #" HOST_WIDE_INT_PRINT_DEC ")", val);
615 }
616 else
617 {
618 HOST_WIDE_INT val = INTVAL (XEXP (x0, 1));
619 if (val < 0 || val > ((1 << 6) - 4))
620 {
621 fprintf (stderr, "stack INDEX out of range:");
622 debug_rtx (x);
623 output_operand_lossage ("fr30_print_operand: unhandled MEM");
624 }
625 fprintf (file, "@(r15, #" HOST_WIDE_INT_PRINT_DEC ")", val);
626 }
627 break;
628
629 case SYMBOL_REF:
630 output_address (x0);
631 break;
632
633 default:
634 fprintf (stderr, "bad MEM code = %x\n", GET_CODE (x0));
635 debug_rtx (x);
636 output_operand_lossage ("fr30_print_operand: unhandled MEM");
637 break;
638 }
639 break;
640
641 case CONST_DOUBLE :
642 /* We handle SFmode constants here as output_addr_const doesn't. */
643 if (GET_MODE (x) == SFmode)
644 {
645 REAL_VALUE_TYPE d;
646 long l;
647
648 REAL_VALUE_FROM_CONST_DOUBLE (d, x);
649 REAL_VALUE_TO_TARGET_SINGLE (d, l);
650 fprintf (file, "0x%08lx", l);
651 break;
652 }
653
654 /* Fall through. Let output_addr_const deal with it. */
655 default:
656 output_addr_const (file, x);
657 break;
658 }
659
660 return;
661 }
662
663 /*}}}*/
664 /*{{{ Function arguments */
665
666 /* Compute the number of word sized registers needed to hold a
667 function argument of mode INT_MODE and tree type TYPE. */
668 int
669 fr30_num_arg_regs (enum machine_mode mode, tree type)
670 {
671 int size;
672
673 if (MUST_PASS_IN_STACK (mode, type))
674 return 0;
675
676 if (type && mode == BLKmode)
677 size = int_size_in_bytes (type);
678 else
679 size = GET_MODE_SIZE (mode);
680
681 return (size + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
682 }
683
684 /* Implements the FUNCTION_ARG_PARTIAL_NREGS macro.
685 Returns the number of argument registers required to hold *part* of
686 a parameter of machine mode MODE and tree type TYPE (which may be
687 NULL if the type is not known). If the argument fits entirely in
688 the argument registers, or entirely on the stack, then 0 is returned.
689 CUM is the number of argument registers already used by earlier
690 parameters to the function. */
691
692 int
693 fr30_function_arg_partial_nregs (CUMULATIVE_ARGS cum, enum machine_mode mode,
694 tree type, int named)
695 {
696 /* Unnamed arguments, ie those that are prototyped as ...
697 are always passed on the stack.
698 Also check here to see if all the argument registers are full. */
699 if (named == 0 || cum >= FR30_NUM_ARG_REGS)
700 return 0;
701
702 /* Work out how many argument registers would be needed if this
703 parameter were to be passed entirely in registers. If there
704 are sufficient argument registers available (or if no registers
705 are needed because the parameter must be passed on the stack)
706 then return zero, as this parameter does not require partial
707 register, partial stack stack space. */
708 if (cum + fr30_num_arg_regs (mode, type) <= FR30_NUM_ARG_REGS)
709 return 0;
710
711 /* Otherwise return the number of registers that would be used. */
712 return FR30_NUM_ARG_REGS - cum;
713 }
714
715 static rtx
716 fr30_pass_by_reference (tree valist, tree type)
717 {
718 tree type_ptr;
719 tree type_ptr_ptr;
720 tree t;
721
722 type_ptr = build_pointer_type (type);
723 type_ptr_ptr = build_pointer_type (type_ptr);
724
725 t = build (POSTINCREMENT_EXPR, va_list_type_node, valist, build_int_2 (UNITS_PER_WORD, 0));
726 TREE_SIDE_EFFECTS (t) = 1;
727 t = build1 (NOP_EXPR, type_ptr_ptr, t);
728 TREE_SIDE_EFFECTS (t) = 1;
729 t = build1 (INDIRECT_REF, type_ptr, t);
730
731 return expand_expr (t, NULL_RTX, Pmode, EXPAND_NORMAL);
732 }
733
734 static rtx
735 fr30_pass_by_value (tree valist, tree type)
736 {
737 HOST_WIDE_INT size = int_size_in_bytes (type);
738 HOST_WIDE_INT rsize;
739 rtx addr_rtx;
740 tree t;
741
742 if ((size % UNITS_PER_WORD) == 0)
743 {
744 t = build (POSTINCREMENT_EXPR, va_list_type_node, valist, build_int_2 (size, 0));
745 TREE_SIDE_EFFECTS (t) = 1;
746
747 return expand_expr (t, NULL_RTX, Pmode, EXPAND_NORMAL);
748 }
749
750 rsize = (size + UNITS_PER_WORD - 1) & - UNITS_PER_WORD;
751
752 /* Care for bigendian correction on the aligned address. */
753 t = build (PLUS_EXPR, ptr_type_node, valist, build_int_2 (rsize - size, 0));
754 addr_rtx = expand_expr (t, NULL_RTX, Pmode, EXPAND_NORMAL);
755 addr_rtx = copy_to_reg (addr_rtx);
756
757 /* Increment AP. */
758 t = build (PLUS_EXPR, va_list_type_node, valist, build_int_2 (rsize, 0));
759 t = build (MODIFY_EXPR, va_list_type_node, valist, t);
760 TREE_SIDE_EFFECTS (t) = 1;
761 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
762
763 return addr_rtx;
764 }
765
766 /* Implement `va_arg'. */
767
768 rtx
769 fr30_va_arg (tree valist, tree type)
770 {
771 HOST_WIDE_INT size;
772
773 if (AGGREGATE_TYPE_P (type))
774 return fr30_pass_by_reference (valist, type);
775
776 size = int_size_in_bytes (type);
777
778 if ((size % sizeof (int)) == 0
779 || size < 4)
780 return fr30_pass_by_value (valist, type);
781
782 return fr30_pass_by_reference (valist, type);
783 }
784
785 /*}}}*/
786 /*{{{ Operand predicates */
787
788 #ifndef Mmode
789 #define Mmode enum machine_mode
790 #endif
791
792 /* Returns true if OPERAND is an integer value suitable for use in
793 an ADDSP instruction. */
794 int
795 stack_add_operand (rtx operand, Mmode mode ATTRIBUTE_UNUSED)
796 {
797 return
798 (GET_CODE (operand) == CONST_INT
799 && INTVAL (operand) >= -512
800 && INTVAL (operand) <= 508
801 && ((INTVAL (operand) & 3) == 0));
802 }
803
804 /* Returns true if OPERAND is an integer value suitable for use in
805 an ADD por ADD2 instruction, or if it is a register. */
806 int
807 add_immediate_operand (rtx operand, Mmode mode ATTRIBUTE_UNUSED)
808 {
809 return
810 (GET_CODE (operand) == REG
811 || (GET_CODE (operand) == CONST_INT
812 && INTVAL (operand) >= -16
813 && INTVAL (operand) <= 15));
814 }
815
816 /* Returns true if OPERAND is hard register in the range 8 - 15. */
817 int
818 high_register_operand (rtx operand, Mmode mode ATTRIBUTE_UNUSED)
819 {
820 return
821 (GET_CODE (operand) == REG
822 && REGNO (operand) <= 15
823 && REGNO (operand) >= 8);
824 }
825
826 /* Returns true if OPERAND is hard register in the range 0 - 7. */
827 int
828 low_register_operand (rtx operand, Mmode mode ATTRIBUTE_UNUSED)
829 {
830 return
831 (GET_CODE (operand) == REG
832 && REGNO (operand) <= 7);
833 }
834
835 /* Returns true if OPERAND is suitable for use in a CALL insn. */
836 int
837 call_operand (rtx operand, Mmode mode ATTRIBUTE_UNUSED)
838 {
839 return (GET_CODE (operand) == MEM
840 && (GET_CODE (XEXP (operand, 0)) == SYMBOL_REF
841 || GET_CODE (XEXP (operand, 0)) == REG));
842 }
843
844 /* Returns TRUE if OP is a valid operand of a DImode operation. */
845 int
846 di_operand (rtx op, Mmode mode)
847 {
848 if (register_operand (op, mode))
849 return TRUE;
850
851 if (mode != VOIDmode && GET_MODE (op) != VOIDmode && GET_MODE (op) != DImode)
852 return FALSE;
853
854 if (GET_CODE (op) == SUBREG)
855 op = SUBREG_REG (op);
856
857 switch (GET_CODE (op))
858 {
859 case CONST_DOUBLE:
860 case CONST_INT:
861 return TRUE;
862
863 case MEM:
864 return memory_address_p (DImode, XEXP (op, 0));
865
866 default:
867 return FALSE;
868 }
869 }
870
871 /* Returns TRUE if OP is a DImode register or MEM. */
872 int
873 nonimmediate_di_operand (rtx op, Mmode mode)
874 {
875 if (register_operand (op, mode))
876 return TRUE;
877
878 if (mode != VOIDmode && GET_MODE (op) != VOIDmode && GET_MODE (op) != DImode)
879 return FALSE;
880
881 if (GET_CODE (op) == SUBREG)
882 op = SUBREG_REG (op);
883
884 if (GET_CODE (op) == MEM)
885 return memory_address_p (DImode, XEXP (op, 0));
886
887 return FALSE;
888 }
889
890 /* Returns true iff all the registers in the operands array
891 are in descending or ascending order. */
892 int
893 fr30_check_multiple_regs (rtx *operands, int num_operands, int descending)
894 {
895 if (descending)
896 {
897 unsigned int prev_regno = 0;
898
899 while (num_operands --)
900 {
901 if (GET_CODE (operands [num_operands]) != REG)
902 return 0;
903
904 if (REGNO (operands [num_operands]) < prev_regno)
905 return 0;
906
907 prev_regno = REGNO (operands [num_operands]);
908 }
909 }
910 else
911 {
912 unsigned int prev_regno = CONDITION_CODE_REGNUM;
913
914 while (num_operands --)
915 {
916 if (GET_CODE (operands [num_operands]) != REG)
917 return 0;
918
919 if (REGNO (operands [num_operands]) > prev_regno)
920 return 0;
921
922 prev_regno = REGNO (operands [num_operands]);
923 }
924 }
925
926 return 1;
927 }
928
929 int
930 fr30_const_double_is_zero (rtx operand)
931 {
932 REAL_VALUE_TYPE d;
933
934 if (operand == NULL || GET_CODE (operand) != CONST_DOUBLE)
935 return 0;
936
937 REAL_VALUE_FROM_CONST_DOUBLE (d, operand);
938
939 return REAL_VALUES_EQUAL (d, dconst0);
940 }
941
942 /*}}}*/
943 /*{{{ Instruction Output Routines */
944
945 /* Output a double word move.
946 It must be REG<-REG, REG<-MEM, MEM<-REG or REG<-CONST.
947 On the FR30 we are constrained by the fact that it does not
948 support offsetable addresses, and so we have to load the
949 address of the secnd word into the second destination register
950 before we can use it. */
951
952 rtx
953 fr30_move_double (rtx * operands)
954 {
955 rtx src = operands[1];
956 rtx dest = operands[0];
957 enum rtx_code src_code = GET_CODE (src);
958 enum rtx_code dest_code = GET_CODE (dest);
959 enum machine_mode mode = GET_MODE (dest);
960 rtx val;
961
962 start_sequence ();
963
964 if (dest_code == REG)
965 {
966 if (src_code == REG)
967 {
968 int reverse = (REGNO (dest) == REGNO (src) + 1);
969
970 /* We normally copy the low-numbered register first. However, if
971 the first register of operand 0 is the same as the second register
972 of operand 1, we must copy in the opposite order. */
973 emit_insn (gen_rtx_SET (VOIDmode,
974 operand_subword (dest, reverse, TRUE, mode),
975 operand_subword (src, reverse, TRUE, mode)));
976
977 emit_insn (gen_rtx_SET (VOIDmode,
978 operand_subword (dest, !reverse, TRUE, mode),
979 operand_subword (src, !reverse, TRUE, mode)));
980 }
981 else if (src_code == MEM)
982 {
983 rtx addr = XEXP (src, 0);
984 int dregno = REGNO (dest);
985 rtx dest0;
986 rtx dest1;
987 rtx new_mem;
988
989 /* If the high-address word is used in the address, we
990 must load it last. Otherwise, load it first. */
991 int reverse = (refers_to_regno_p (dregno, dregno + 1, addr, 0) != 0);
992
993 if (GET_CODE (addr) != REG)
994 abort ();
995
996 dest0 = operand_subword (dest, reverse, TRUE, mode);
997 dest1 = operand_subword (dest, !reverse, TRUE, mode);
998
999 if (reverse)
1000 {
1001 emit_insn (gen_rtx_SET (VOIDmode, dest1,
1002 adjust_address (src, SImode, 0)));
1003 emit_insn (gen_rtx_SET (SImode, dest0,
1004 gen_rtx_REG (SImode, REGNO (addr))));
1005 emit_insn (gen_rtx_SET (SImode, dest0,
1006 plus_constant (dest0, UNITS_PER_WORD)));
1007
1008 new_mem = gen_rtx_MEM (SImode, dest0);
1009 MEM_COPY_ATTRIBUTES (new_mem, src);
1010
1011 emit_insn (gen_rtx_SET (VOIDmode, dest0, new_mem));
1012 }
1013 else
1014 {
1015 emit_insn (gen_rtx_SET (VOIDmode, dest0,
1016 adjust_address (src, SImode, 0)));
1017 emit_insn (gen_rtx_SET (SImode, dest1,
1018 gen_rtx_REG (SImode, REGNO (addr))));
1019 emit_insn (gen_rtx_SET (SImode, dest1,
1020 plus_constant (dest1, UNITS_PER_WORD)));
1021
1022 new_mem = gen_rtx_MEM (SImode, dest1);
1023 MEM_COPY_ATTRIBUTES (new_mem, src);
1024
1025 emit_insn (gen_rtx_SET (VOIDmode, dest1, new_mem));
1026 }
1027 }
1028 else if (src_code == CONST_INT || src_code == CONST_DOUBLE)
1029 {
1030 rtx words[2];
1031 split_double (src, &words[0], &words[1]);
1032 emit_insn (gen_rtx_SET (VOIDmode,
1033 operand_subword (dest, 0, TRUE, mode),
1034 words[0]));
1035
1036 emit_insn (gen_rtx_SET (VOIDmode,
1037 operand_subword (dest, 1, TRUE, mode),
1038 words[1]));
1039 }
1040 }
1041 else if (src_code == REG && dest_code == MEM)
1042 {
1043 rtx addr = XEXP (dest, 0);
1044 rtx src0;
1045 rtx src1;
1046
1047 if (GET_CODE (addr) != REG)
1048 abort ();
1049
1050 src0 = operand_subword (src, 0, TRUE, mode);
1051 src1 = operand_subword (src, 1, TRUE, mode);
1052
1053 emit_insn (gen_rtx_SET (VOIDmode, adjust_address (dest, SImode, 0),
1054 src0));
1055
1056 if (REGNO (addr) == STACK_POINTER_REGNUM
1057 || REGNO (addr) == FRAME_POINTER_REGNUM)
1058 emit_insn (gen_rtx_SET (VOIDmode,
1059 adjust_address (dest, SImode, UNITS_PER_WORD),
1060 src1));
1061 else
1062 {
1063 rtx new_mem;
1064
1065 /* We need a scratch register to hold the value of 'address + 4'.
1066 We ought to allow gcc to find one for us, but for now, just
1067 push one of the source registers. */
1068 emit_insn (gen_movsi_push (src0));
1069 emit_insn (gen_movsi_internal (src0, addr));
1070 emit_insn (gen_addsi_small_int (src0, src0, GEN_INT (UNITS_PER_WORD)));
1071
1072 new_mem = gen_rtx_MEM (SImode, src0);
1073 MEM_COPY_ATTRIBUTES (new_mem, dest);
1074
1075 emit_insn (gen_rtx_SET (VOIDmode, new_mem, src1));
1076 emit_insn (gen_movsi_pop (src0));
1077 }
1078 }
1079 else
1080 /* This should have been prevented by the constraints on movdi_insn. */
1081 abort ();
1082
1083 val = get_insns ();
1084 end_sequence ();
1085
1086 return val;
1087 }
1088 /*}}}*/
1089 /* Local Variables: */
1090 /* folded-file: t */
1091 /* End: */
This page took 0.083437 seconds and 4 git commands to generate.