| blob | d1867a2b4ce0464488f326123dab6552dbfbdd0e |
1 /* Definitions of Tensilica's Xtensa target machine for GNU compiler.
2 Copyright 2001,2002 Free Software Foundation, Inc.
3 Contributed by Bob Wilson (bwilson@tensilica.com) at Tensilica.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
22 /* Get Xtensa configuration settings */
25 /* Standard GCC variables that we reference. */
30 /* External variables defined in xtensa.c. */
32 /* comparison type */
38 CMP_MAX /* max comparison type */
39 };
45 /* Run-time compilation parameters selecting different hardware subsets. */
65 /* Macros used in the machine description to test the flags. */
67 #define TARGET_BIG_ENDIAN (target_flags & MASK_BIG_ENDIAN)
68 #define TARGET_DENSITY (target_flags & MASK_DENSITY)
69 #define TARGET_MAC16 (target_flags & MASK_MAC16)
70 #define TARGET_MUL16 (target_flags & MASK_MUL16)
71 #define TARGET_MUL32 (target_flags & MASK_MUL32)
72 #define TARGET_DIV32 (target_flags & MASK_DIV32)
73 #define TARGET_NSA (target_flags & MASK_NSA)
74 #define TARGET_MINMAX (target_flags & MASK_MINMAX)
75 #define TARGET_SEXT (target_flags & MASK_SEXT)
76 #define TARGET_BOOLEANS (target_flags & MASK_BOOLEANS)
77 #define TARGET_HARD_FLOAT (target_flags & MASK_HARD_FLOAT)
78 #define TARGET_HARD_FLOAT_DIV (target_flags & MASK_HARD_FLOAT_DIV)
79 #define TARGET_HARD_FLOAT_RECIP (target_flags & MASK_HARD_FLOAT_RECIP)
80 #define TARGET_HARD_FLOAT_SQRT (target_flags & MASK_HARD_FLOAT_SQRT)
81 #define TARGET_HARD_FLOAT_RSQRT (target_flags & MASK_HARD_FLOAT_RSQRT)
82 #define TARGET_NO_FUSED_MADD (target_flags & MASK_NO_FUSED_MADD)
83 #define TARGET_SERIALIZE_VOLATILE (target_flags & MASK_SERIALIZE_VOLATILE)
85 /* Default target_flags if no switches are specified */
87 #define TARGET_DEFAULT ( \
88 (XCHAL_HAVE_BE ? MASK_BIG_ENDIAN : 0) | \
89 (XCHAL_HAVE_DENSITY ? MASK_DENSITY : 0) | \
90 (XCHAL_HAVE_MAC16 ? MASK_MAC16 : 0) | \
91 (XCHAL_HAVE_MUL16 ? MASK_MUL16 : 0) | \
92 (XCHAL_HAVE_MUL32 ? MASK_MUL32 : 0) | \
93 (XCHAL_HAVE_DIV32 ? MASK_DIV32 : 0) | \
94 (XCHAL_HAVE_NSA ? MASK_NSA : 0) | \
95 (XCHAL_HAVE_MINMAX ? MASK_MINMAX : 0) | \
96 (XCHAL_HAVE_SEXT ? MASK_SEXT : 0) | \
97 (XCHAL_HAVE_BOOLEANS ? MASK_BOOLEANS : 0) | \
98 (XCHAL_HAVE_FP ? MASK_HARD_FLOAT : 0) | \
99 (XCHAL_HAVE_FP_DIV ? MASK_HARD_FLOAT_DIV : 0) | \
100 (XCHAL_HAVE_FP_RECIP ? MASK_HARD_FLOAT_RECIP : 0) | \
101 (XCHAL_HAVE_FP_SQRT ? MASK_HARD_FLOAT_SQRT : 0) | \
102 (XCHAL_HAVE_FP_RSQRT ? MASK_HARD_FLOAT_RSQRT : 0) | \
103 MASK_SERIALIZE_VOLATILE)
105 /* Macro to define tables used to set the flags. */
107 #define TARGET_SWITCHES \
108 { \
190 }
193 #define OVERRIDE_OPTIONS override_options ()
194 \f
195 /* Target CPU builtins. */
196 #define TARGET_CPU_CPP_BUILTINS() \
197 do { \
202 if (!TARGET_HARD_FLOAT) \
204 if (flag_pic) \
205 { \
208 } \
209 } while (0)
211 /* Define this to set the endianness to use in libgcc2.c, which can
212 not depend on target_flags. */
213 #define LIBGCC2_WORDS_BIG_ENDIAN XCHAL_HAVE_BE
215 /* Show we can debug even without a frame pointer. */
216 #define CAN_DEBUG_WITHOUT_FP
219 /* Target machine storage layout */
221 /* Define this if most significant bit is lowest numbered
222 in instructions that operate on numbered bit-fields. */
223 #define BITS_BIG_ENDIAN (TARGET_BIG_ENDIAN != 0)
225 /* Define this if most significant byte of a word is the lowest numbered. */
226 #define BYTES_BIG_ENDIAN (TARGET_BIG_ENDIAN != 0)
228 /* Define this if most significant word of a multiword number is the lowest. */
229 #define WORDS_BIG_ENDIAN (TARGET_BIG_ENDIAN != 0)
231 #define MAX_BITS_PER_WORD 32
233 /* Width of a word, in units (bytes). */
234 #define UNITS_PER_WORD 4
235 #define MIN_UNITS_PER_WORD 4
237 /* Width of a floating point register. */
238 #define UNITS_PER_FPREG 4
240 /* Size in bits of various types on the target machine. */
241 #define INT_TYPE_SIZE 32
242 #define SHORT_TYPE_SIZE 16
243 #define LONG_TYPE_SIZE 32
244 #define MAX_LONG_TYPE_SIZE 32
245 #define LONG_LONG_TYPE_SIZE 64
246 #define FLOAT_TYPE_SIZE 32
247 #define DOUBLE_TYPE_SIZE 64
248 #define LONG_DOUBLE_TYPE_SIZE 64
250 /* Tell the preprocessor the maximum size of wchar_t. */
251 #ifndef MAX_WCHAR_TYPE_SIZE
252 #ifndef WCHAR_TYPE_SIZE
253 #endif
254 #endif
256 /* Allocation boundary (in *bits*) for storing pointers in memory. */
257 #define POINTER_BOUNDARY 32
259 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
260 #define PARM_BOUNDARY 32
262 /* Allocation boundary (in *bits*) for the code of a function. */
263 #define FUNCTION_BOUNDARY 32
265 /* Alignment of field after 'int : 0' in a structure. */
266 #define EMPTY_FIELD_BOUNDARY 32
268 /* Every structure's size must be a multiple of this. */
269 #define STRUCTURE_SIZE_BOUNDARY 8
271 /* There is no point aligning anything to a rounder boundary than this. */
272 #define BIGGEST_ALIGNMENT 128
274 /* Set this nonzero if move instructions will actually fail to work
275 when given unaligned data. */
276 #define STRICT_ALIGNMENT 1
278 /* Promote integer modes smaller than a word to SImode. Set UNSIGNEDP
279 for QImode, because there is no 8-bit load from memory with sign
280 extension. Otherwise, leave UNSIGNEDP alone, since Xtensa has 16-bit
281 loads both with and without sign extension. */
282 #define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
283 do { \
284 if (GET_MODE_CLASS (MODE) == MODE_INT \
285 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
286 { \
287 if ((MODE) == QImode) \
288 (UNSIGNEDP) = 1; \
289 (MODE) = SImode; \
290 } \
291 } while (0)
293 /* The promotion described by `PROMOTE_MODE' should also be done for
294 outgoing function arguments. */
295 #define PROMOTE_FUNCTION_ARGS
297 /* The promotion described by `PROMOTE_MODE' should also be done for
298 the return value of functions. Note: `FUNCTION_VALUE' must perform
299 the same promotions done by `PROMOTE_MODE'. */
300 #define PROMOTE_FUNCTION_RETURN
302 /* Imitate the way many other C compilers handle alignment of
303 bitfields and the structures that contain them. */
304 #define PCC_BITFIELD_TYPE_MATTERS 1
306 /* Align string constants and constructors to at least a word boundary.
307 The typical use of this macro is to increase alignment for string
308 constants to be word aligned so that 'strcpy' calls that copy
309 constants can be done inline. */
310 #define CONSTANT_ALIGNMENT(EXP, ALIGN) \
311 ((TREE_CODE (EXP) == STRING_CST || TREE_CODE (EXP) == CONSTRUCTOR) \
312 && (ALIGN) < BITS_PER_WORD \
313 ? BITS_PER_WORD \
314 : (ALIGN))
316 /* Align arrays, unions and records to at least a word boundary.
317 One use of this macro is to increase alignment of medium-size
318 data to make it all fit in fewer cache lines. Another is to
319 cause character arrays to be word-aligned so that 'strcpy' calls
320 that copy constants to character arrays can be done inline. */
321 #undef DATA_ALIGNMENT
322 #define DATA_ALIGNMENT(TYPE, ALIGN) \
323 ((((ALIGN) < BITS_PER_WORD) \
324 && (TREE_CODE (TYPE) == ARRAY_TYPE \
325 || TREE_CODE (TYPE) == UNION_TYPE \
326 || TREE_CODE (TYPE) == RECORD_TYPE)) ? BITS_PER_WORD : (ALIGN))
328 /* An argument declared as 'char' or 'short' in a prototype should
329 actually be passed as an 'int'. */
330 #define PROMOTE_PROTOTYPES 1
332 /* Operations between registers always perform the operation
333 on the full register even if a narrower mode is specified. */
334 #define WORD_REGISTER_OPERATIONS
336 /* Xtensa loads are zero-extended by default. */
337 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
339 /* Standard register usage. */
341 /* Number of actual hardware registers.
342 The hardware registers are assigned numbers for the compiler
343 from 0 to just below FIRST_PSEUDO_REGISTER.
344 All registers that the compiler knows about must be given numbers,
345 even those that are not normally considered general registers.
347 The fake frame pointer and argument pointer will never appear in
348 the generated code, since they will always be eliminated and replaced
349 by either the stack pointer or the hard frame pointer.
351 0 - 15 AR[0] - AR[15]
352 16 FRAME_POINTER (fake = initial sp)
353 17 ARG_POINTER (fake = initial sp + framesize)
354 18 LOOP_COUNT (loop count special register)
355 18 BR[0] for floating-point CC
356 19 - 34 FR[0] - FR[15]
357 35 MAC16 accumulator */
359 #define FIRST_PSEUDO_REGISTER 36
361 /* Return the stabs register number to use for REGNO. */
362 #define DBX_REGISTER_NUMBER(REGNO) xtensa_dbx_register_number (REGNO)
364 /* 1 for registers that have pervasive standard uses
365 and are not available for the register allocator. */
366 #define FIXED_REGISTERS \
367 { \
368 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \
369 1, 1, 0, \
370 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \
371 0, \
372 }
374 /* 1 for registers not available across function calls.
375 These must include the FIXED_REGISTERS and also any
376 registers that can be used without being saved.
377 The latter must include the registers where values are returned
378 and the register where structure-value addresses are passed.
379 Aside from that, you can include as many other registers as you like. */
380 #define CALL_USED_REGISTERS \
381 { \
382 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, \
383 1, 1, 1, \
384 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
385 1, \
386 }
388 /* For non-leaf procedures on Xtensa processors, the allocation order
389 is as specified below by REG_ALLOC_ORDER. For leaf procedures, we
390 want to use the lowest numbered registers first to minimize
391 register window overflows. However, local-alloc is not smart
392 enough to consider conflicts with incoming arguments. If an
393 incoming argument in a2 is live throughout the function and
394 local-alloc decides to use a2, then the incoming argument must
395 either be spilled or copied to another register. To get around
396 this, we define ORDER_REGS_FOR_LOCAL_ALLOC to redefine
397 reg_alloc_order for leaf functions such that lowest numbered
398 registers are used first with the exception that the incoming
399 argument registers are not used until after other register choices
400 have been exhausted. */
402 #define REG_ALLOC_ORDER \
403 { 8, 9, 10, 11, 12, 13, 14, 15, 7, 6, 5, 4, 3, 2, 19, \
404 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, \
405 0, 1, 16, 17, \
406 36, \
407 }
409 #define ORDER_REGS_FOR_LOCAL_ALLOC order_regs_for_local_alloc ()
411 /* For Xtensa, the only point of this is to prevent GCC from otherwise
412 giving preference to call-used registers. To minimize window
413 overflows for the AR registers, we want to give preference to the
414 lower-numbered AR registers. For other register files, which are
415 not windowed, we still prefer call-used registers, if there are any. */
417 #define LEAF_REGISTERS xtensa_leaf_regs
419 /* For Xtensa, no remapping is necessary, but this macro must be
420 defined if LEAF_REGISTERS is defined. */
421 #define LEAF_REG_REMAP(REGNO) (REGNO)
423 /* this must be declared if LEAF_REGISTERS is set */
426 /* Internal macros to classify a register number. */
428 /* 16 address registers + fake registers */
429 #define GP_REG_FIRST 0
430 #define GP_REG_LAST 17
431 #define GP_REG_NUM (GP_REG_LAST - GP_REG_FIRST + 1)
433 /* Special registers */
434 #define SPEC_REG_FIRST 18
435 #define SPEC_REG_LAST 18
436 #define SPEC_REG_NUM (SPEC_REG_LAST - SPEC_REG_FIRST + 1)
438 /* Coprocessor registers */
439 #define BR_REG_FIRST 18
440 #define BR_REG_LAST 18
441 #define BR_REG_NUM (BR_REG_LAST - BR_REG_FIRST + 1)
443 /* 16 floating-point registers */
444 #define FP_REG_FIRST 19
445 #define FP_REG_LAST 34
446 #define FP_REG_NUM (FP_REG_LAST - FP_REG_FIRST + 1)
448 /* MAC16 accumulator */
449 #define ACC_REG_FIRST 35
450 #define ACC_REG_LAST 35
451 #define ACC_REG_NUM (ACC_REG_LAST - ACC_REG_FIRST + 1)
453 #define GP_REG_P(REGNO) ((unsigned) ((REGNO) - GP_REG_FIRST) < GP_REG_NUM)
454 #define BR_REG_P(REGNO) ((unsigned) ((REGNO) - BR_REG_FIRST) < BR_REG_NUM)
455 #define FP_REG_P(REGNO) ((unsigned) ((REGNO) - FP_REG_FIRST) < FP_REG_NUM)
456 #define ACC_REG_P(REGNO) ((unsigned) ((REGNO) - ACC_REG_FIRST) < ACC_REG_NUM)
458 /* Return number of consecutive hard regs needed starting at reg REGNO
459 to hold something of mode MODE. */
460 #define HARD_REGNO_NREGS(REGNO, MODE) \
461 (FP_REG_P (REGNO) ? \
462 ((GET_MODE_SIZE (MODE) + UNITS_PER_FPREG - 1) / UNITS_PER_FPREG) : \
463 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
465 /* Value is 1 if hard register REGNO can hold a value of machine-mode
466 MODE. */
469 #define HARD_REGNO_MODE_OK(REGNO, MODE) \
470 xtensa_hard_regno_mode_ok[(int) (MODE)][(REGNO)]
472 /* Value is 1 if it is a good idea to tie two pseudo registers
473 when one has mode MODE1 and one has mode MODE2.
474 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
475 for any hard reg, then this must be 0 for correct output. */
476 #define MODES_TIEABLE_P(MODE1, MODE2) \
477 ((GET_MODE_CLASS (MODE1) == MODE_FLOAT || \
478 GET_MODE_CLASS (MODE1) == MODE_COMPLEX_FLOAT) \
479 == (GET_MODE_CLASS (MODE2) == MODE_FLOAT || \
480 GET_MODE_CLASS (MODE2) == MODE_COMPLEX_FLOAT))
482 /* Register to use for LCOUNT special register. */
483 #define COUNT_REGISTER_REGNUM (SPEC_REG_FIRST + 0)
485 /* Register to use for pushing function arguments. */
486 #define STACK_POINTER_REGNUM (GP_REG_FIRST + 1)
488 /* Base register for access to local variables of the function. */
489 #define HARD_FRAME_POINTER_REGNUM (GP_REG_FIRST + 7)
491 /* The register number of the frame pointer register, which is used to
492 access automatic variables in the stack frame. For Xtensa, this
493 register never appears in the output. It is always eliminated to
494 either the stack pointer or the hard frame pointer. */
495 #define FRAME_POINTER_REGNUM (GP_REG_FIRST + 16)
497 /* Value should be nonzero if functions must have frame pointers.
498 Zero means the frame pointer need not be set up (and parms
499 may be accessed via the stack pointer) in functions that seem suitable.
500 This is computed in 'reload', in reload1.c. */
501 #define FRAME_POINTER_REQUIRED xtensa_frame_pointer_required ()
503 /* Base register for access to arguments of the function. */
504 #define ARG_POINTER_REGNUM (GP_REG_FIRST + 17)
506 /* If the static chain is passed in memory, these macros provide rtx
507 giving 'mem' expressions that denote where they are stored.
508 'STATIC_CHAIN' and 'STATIC_CHAIN_INCOMING' give the locations as
509 seen by the calling and called functions, respectively. */
511 #define STATIC_CHAIN \
512 gen_rtx_MEM (Pmode, plus_constant (stack_pointer_rtx, -5 * UNITS_PER_WORD))
514 #define STATIC_CHAIN_INCOMING \
515 gen_rtx_MEM (Pmode, plus_constant (arg_pointer_rtx, -5 * UNITS_PER_WORD))
517 /* For now we don't try to use the full set of boolean registers. Without
518 software pipelining of FP operations, there's not much to gain and it's
519 a real pain to get them reloaded. */
520 #define FPCC_REGNUM (BR_REG_FIRST + 0)
522 /* Pass structure value address as an "invisible" first argument. */
523 #define STRUCT_VALUE 0
525 /* It is as good or better to call a constant function address than to
526 call an address kept in a register. */
527 #define NO_FUNCTION_CSE 1
529 /* It is as good or better for a function to call itself with an
530 explicit address than to call an address kept in a register. */
531 #define NO_RECURSIVE_FUNCTION_CSE 1
533 /* Xtensa processors have "register windows". GCC does not currently
534 take advantage of the possibility for variable-sized windows; instead,
535 we use a fixed window size of 8. */
537 #define INCOMING_REGNO(OUT) \
538 ((GP_REG_P (OUT) && \
539 ((unsigned) ((OUT) - GP_REG_FIRST) >= WINDOW_SIZE)) ? \
540 (OUT) - WINDOW_SIZE : (OUT))
542 #define OUTGOING_REGNO(IN) \
543 ((GP_REG_P (IN) && \
544 ((unsigned) ((IN) - GP_REG_FIRST) < WINDOW_SIZE)) ? \
545 (IN) + WINDOW_SIZE : (IN))
548 /* Define the classes of registers for register constraints in the
549 machine description. */
550 enum reg_class
551 {
561 LIM_REG_CLASSES /* max value + 1 */
562 };
564 #define N_REG_CLASSES (int) LIM_REG_CLASSES
566 #define GENERAL_REGS AR_REGS
568 /* An initializer containing the names of the register classes as C
569 string constants. These names are used in writing some of the
570 debugging dumps. */
571 #define REG_CLASS_NAMES \
572 { \
582 }
584 /* Contents of the register classes. The Nth integer specifies the
585 contents of class N. The way the integer MASK is interpreted is
586 that register R is in the class if 'MASK & (1 << R)' is 1. */
587 #define REG_CLASS_CONTENTS \
588 { \
598 }
600 /* A C expression whose value is a register class containing hard
601 register REGNO. In general there is more that one such class;
602 choose a class which is "minimal", meaning that no smaller class
603 also contains the register. */
606 #define REGNO_REG_CLASS(REGNO) xtensa_regno_to_class[ (REGNO) ]
608 /* Use the Xtensa AR register file for base registers.
609 No index registers. */
610 #define BASE_REG_CLASS AR_REGS
611 #define INDEX_REG_CLASS NO_REGS
613 /* SMALL_REGISTER_CLASSES is required for Xtensa, because all of the
614 16 AR registers may be explicitly used in the RTL, as either
615 incoming or outgoing arguments. */
616 #define SMALL_REGISTER_CLASSES 1
619 /* REGISTER AND CONSTANT CLASSES */
621 /* Get reg_class from a letter such as appears in the machine
622 description.
624 Available letters: a-f,h,j-l,q,t-z,A-D,W,Y-Z
626 DEFINED REGISTER CLASSES:
628 'a' general-purpose registers except sp
629 'q' sp (aka a1)
630 'D' general-purpose registers (only if density option enabled)
631 'd' general-purpose registers, including sp (only if density enabled)
632 'A' MAC16 accumulator (only if MAC16 option enabled)
633 'B' general-purpose registers (only if sext instruction enabled)
634 'C' general-purpose registers (only if mul16 option enabled)
635 'b' coprocessor boolean registers
636 'f' floating-point registers
637 */
641 #define REG_CLASS_FROM_LETTER(C) xtensa_char_to_class[ (int) (C) ]
643 /* The letters I, J, K, L, M, N, O, and P in a register constraint
644 string can be used to stand for particular ranges of immediate
645 operands. This macro defines what the ranges are. C is the
646 letter, and VALUE is a constant value. Return 1 if VALUE is
647 in the range specified by C.
649 For Xtensa:
651 I = 12-bit signed immediate for movi
652 J = 8-bit signed immediate for addi
653 K = 4-bit value in (b4const U {0})
654 L = 4-bit value in b4constu
655 M = 7-bit value in simm7
656 N = 8-bit unsigned immediate shifted left by 8 bits for addmi
657 O = 4-bit value in ai4const
658 P = valid immediate mask value for extui */
660 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
669 : FALSE)
672 /* Similar, but for floating constants, and defining letters G and H.
673 Here VALUE is the CONST_DOUBLE rtx itself. */
674 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) (0)
677 /* Other letters can be defined in a machine-dependent fashion to
678 stand for particular classes of registers or other arbitrary
679 operand types.
681 R = memory that can be accessed with a 4-bit unsigned offset
682 S = memory where the second word can be addressed with a 4-bit offset
683 T = memory in a constant pool (addressable with a pc-relative load)
684 U = memory *NOT* in a constant pool
686 The offset range should not be checked here (except to distinguish
687 denser versions of the instructions for which more general versions
688 are available). Doing so leads to problems in reloading: an
689 argptr-relative address may become invalid when the phony argptr is
690 eliminated in favor of the stack pointer (the offset becomes too
691 large to fit in the instruction's immediate field); a reload is
692 generated to fix this but the RTL is not immediately updated; in
693 the meantime, the constraints are checked and none match. The
694 solution seems to be to simply skip the offset check here. The
695 address will be checked anyway because of the code in
696 GO_IF_LEGITIMATE_ADDRESS. */
698 #define EXTRA_CONSTRAINT(OP, CODE) \
699 ((GET_CODE (OP) != MEM) ? \
701 && reload_in_progress && GET_CODE (OP) == REG \
702 && REGNO (OP) >= FIRST_PSEUDO_REGISTER) \
707 : FALSE)
709 #define PREFERRED_RELOAD_CLASS(X, CLASS) \
710 xtensa_preferred_reload_class (X, CLASS, 0)
712 #define PREFERRED_OUTPUT_RELOAD_CLASS(X, CLASS) \
713 xtensa_preferred_reload_class (X, CLASS, 1)
715 #define SECONDARY_INPUT_RELOAD_CLASS(CLASS, MODE, X) \
716 xtensa_secondary_reload_class (CLASS, MODE, X, 0)
718 #define SECONDARY_OUTPUT_RELOAD_CLASS(CLASS, MODE, X) \
719 xtensa_secondary_reload_class (CLASS, MODE, X, 1)
721 /* Return the maximum number of consecutive registers
722 needed to represent mode MODE in a register of class CLASS. */
723 #define CLASS_UNITS(mode, size) \
724 ((GET_MODE_SIZE (mode) + (size) - 1) / (size))
726 #define CLASS_MAX_NREGS(CLASS, MODE) \
727 (CLASS_UNITS (MODE, UNITS_PER_WORD))
730 /* Stack layout; function entry, exit and calling. */
732 #define STACK_GROWS_DOWNWARD
734 /* Offset within stack frame to start allocating local variables at. */
735 #define STARTING_FRAME_OFFSET \
736 current_function_outgoing_args_size
738 /* The ARG_POINTER and FRAME_POINTER are not real Xtensa registers, so
739 they are eliminated to either the stack pointer or hard frame pointer. */
740 #define ELIMINABLE_REGS \
741 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
742 { ARG_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
743 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
744 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}}
746 #define CAN_ELIMINATE(FROM, TO) 1
748 /* Specify the initial difference between the specified pair of registers. */
749 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
750 do { \
751 compute_frame_size (get_frame_size ()); \
752 if ((FROM) == FRAME_POINTER_REGNUM) \
753 (OFFSET) = 0; \
754 else if ((FROM) == ARG_POINTER_REGNUM) \
755 (OFFSET) = xtensa_current_frame_size; \
756 else \
757 abort (); \
758 } while (0)
760 /* If defined, the maximum amount of space required for outgoing
761 arguments will be computed and placed into the variable
762 'current_function_outgoing_args_size'. No space will be pushed
763 onto the stack for each call; instead, the function prologue
764 should increase the stack frame size by this amount. */
765 #define ACCUMULATE_OUTGOING_ARGS 1
767 /* Offset from the argument pointer register to the first argument's
768 address. On some machines it may depend on the data type of the
769 function. If 'ARGS_GROW_DOWNWARD', this is the offset to the
770 location above the first argument's address. */
771 #define FIRST_PARM_OFFSET(FNDECL) 0
773 /* Align stack frames on 128 bits for Xtensa. This is necessary for
774 128-bit datatypes defined in TIE (e.g., for Vectra). */
775 #define STACK_BOUNDARY 128
777 /* Functions do not pop arguments off the stack. */
778 #define RETURN_POPS_ARGS(FUNDECL, FUNTYPE, SIZE) 0
780 /* Use a fixed register window size of 8. */
781 #define WINDOW_SIZE 8
783 /* Symbolic macros for the registers used to return integer, floating
784 point, and values of coprocessor and user-defined modes. */
785 #define GP_RETURN (GP_REG_FIRST + 2 + WINDOW_SIZE)
786 #define GP_OUTGOING_RETURN (GP_REG_FIRST + 2)
788 /* Symbolic macros for the first/last argument registers. */
789 #define GP_ARG_FIRST (GP_REG_FIRST + 2)
790 #define GP_ARG_LAST (GP_REG_FIRST + 7)
791 #define GP_OUTGOING_ARG_FIRST (GP_REG_FIRST + 2 + WINDOW_SIZE)
792 #define GP_OUTGOING_ARG_LAST (GP_REG_FIRST + 7 + WINDOW_SIZE)
794 #define MAX_ARGS_IN_REGISTERS 6
796 /* Don't worry about compatibility with PCC. */
797 #define DEFAULT_PCC_STRUCT_RETURN 0
799 /* For Xtensa, up to 4 words can be returned in registers. (It would
800 have been nice to allow up to 6 words in registers but GCC cannot
801 support that. The return value must be given one of the standard
802 MODE_INT modes, and there is no 6 word mode. Instead, if we try to
803 return a 6 word structure, GCC selects the next biggest mode
804 (OImode, 8 words) and then the register allocator fails because
805 there is no 8-register group beginning with a10.) */
806 #define RETURN_IN_MEMORY(TYPE) \
807 ((unsigned HOST_WIDE_INT) int_size_in_bytes (TYPE) > 4 * UNITS_PER_WORD)
809 /* Define how to find the value returned by a library function
810 assuming the value has mode MODE. Because we have defined
811 PROMOTE_FUNCTION_RETURN, we have to perform the same promotions as
812 PROMOTE_MODE. */
813 #define XTENSA_LIBCALL_VALUE(MODE, OUTGOINGP) \
814 gen_rtx_REG ((GET_MODE_CLASS (MODE) == MODE_INT \
815 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
816 ? SImode : (MODE), \
817 OUTGOINGP ? GP_OUTGOING_RETURN : GP_RETURN)
819 #define LIBCALL_VALUE(MODE) \
820 XTENSA_LIBCALL_VALUE ((MODE), 0)
822 #define LIBCALL_OUTGOING_VALUE(MODE) \
823 XTENSA_LIBCALL_VALUE ((MODE), 1)
825 /* Define how to find the value returned by a function.
826 VALTYPE is the data type of the value (as a tree).
827 If the precise function being called is known, FUNC is its FUNCTION_DECL;
828 otherwise, FUNC is 0. */
829 #define XTENSA_FUNCTION_VALUE(VALTYPE, FUNC, OUTGOINGP) \
830 gen_rtx_REG ((INTEGRAL_TYPE_P (VALTYPE) \
831 && TYPE_PRECISION (VALTYPE) < BITS_PER_WORD) \
832 ? SImode: TYPE_MODE (VALTYPE), \
833 OUTGOINGP ? GP_OUTGOING_RETURN : GP_RETURN)
835 #define FUNCTION_VALUE(VALTYPE, FUNC) \
836 XTENSA_FUNCTION_VALUE (VALTYPE, FUNC, 0)
838 #define FUNCTION_OUTGOING_VALUE(VALTYPE, FUNC) \
839 XTENSA_FUNCTION_VALUE (VALTYPE, FUNC, 1)
841 /* A C expression that is nonzero if REGNO is the number of a hard
842 register in which the values of called function may come back. A
843 register whose use for returning values is limited to serving as
844 the second of a pair (for a value of type 'double', say) need not
845 be recognized by this macro. If the machine has register windows,
846 so that the caller and the called function use different registers
847 for the return value, this macro should recognize only the caller's
848 register numbers. */
849 #define FUNCTION_VALUE_REGNO_P(N) \
850 ((N) == GP_RETURN)
852 /* A C expression that is nonzero if REGNO is the number of a hard
853 register in which function arguments are sometimes passed. This
854 does *not* include implicit arguments such as the static chain and
855 the structure-value address. On many machines, no registers can be
856 used for this purpose since all function arguments are pushed on
857 the stack. */
858 #define FUNCTION_ARG_REGNO_P(N) \
859 ((N) >= GP_OUTGOING_ARG_FIRST && (N) <= GP_OUTGOING_ARG_LAST)
861 /* Define a data type for recording info about an argument list
862 during the scan of that argument list. This data type should
863 hold all necessary information about the function itself
864 and about the args processed so far, enough to enable macros
865 such as FUNCTION_ARG to determine where the next arg should go. */
870 /* Initialize a variable CUM of type CUMULATIVE_ARGS
871 for a call to a function whose data type is FNTYPE.
872 For a library call, FNTYPE is 0. */
873 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT) \
874 init_cumulative_args (&CUM, FNTYPE, LIBNAME)
876 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM, FNTYPE, LIBNAME) \
877 init_cumulative_args (&CUM, FNTYPE, LIBNAME)
879 /* Update the data in CUM to advance over an argument
880 of mode MODE and data type TYPE.
881 (TYPE is null for libcalls where that information may not be available.) */
882 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
883 function_arg_advance (&CUM, MODE, TYPE)
885 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
886 function_arg (&CUM, MODE, TYPE, FALSE)
888 #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \
889 function_arg (&CUM, MODE, TYPE, TRUE)
891 /* Arguments are never passed partly in memory and partly in registers. */
892 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) (0)
894 /* Specify function argument alignment. */
895 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
896 ((TYPE) != 0 \
897 ? (TYPE_ALIGN (TYPE) <= PARM_BOUNDARY \
898 ? PARM_BOUNDARY \
899 : TYPE_ALIGN (TYPE)) \
900 : (GET_MODE_ALIGNMENT (MODE) <= PARM_BOUNDARY \
901 ? PARM_BOUNDARY \
902 : GET_MODE_ALIGNMENT (MODE)))
905 /* Nonzero if we do not know how to pass TYPE solely in registers.
906 We cannot do so in the following cases:
908 - if the type has variable size
909 - if the type is marked as addressable (it is required to be constructed
910 into the stack)
912 This differs from the default in that it does not check if the padding
913 and mode of the type are such that a copy into a register would put it
914 into the wrong part of the register. */
916 #define MUST_PASS_IN_STACK(MODE, TYPE) \
917 ((TYPE) != 0 \
918 && (TREE_CODE (TYPE_SIZE (TYPE)) != INTEGER_CST \
919 || TREE_ADDRESSABLE (TYPE)))
921 /* Profiling Xtensa code is typically done with the built-in profiling
922 feature of Tensilica's instruction set simulator, which does not
923 require any compiler support. Profiling code on a real (i.e.,
924 non-simulated) Xtensa processor is currently only supported by
925 GNU/Linux with glibc. The glibc version of _mcount doesn't require
926 counter variables. The _mcount function needs the current PC and
927 the current return address to identify an arc in the call graph.
928 Pass the current return address as the first argument; the current
929 PC is available as a0 in _mcount's register window. Both of these
930 values contain window size information in the two most significant
931 bits; we assume that _mcount will mask off those bits. The call to
932 _mcount uses a window size of 8 to make sure that it doesn't clobber
933 any incoming argument values. */
935 #define NO_PROFILE_COUNTERS
937 #define FUNCTION_PROFILER(FILE, LABELNO) \
938 do { \
940 if (flag_pic) \
941 { \
944 } \
945 else \
947 } while (0)
949 /* Stack pointer value doesn't matter at exit. */
950 #define EXIT_IGNORE_STACK 1
952 /* A C statement to output, on the stream FILE, assembler code for a
953 block of data that contains the constant parts of a trampoline.
954 This code should not include a label--the label is taken care of
955 automatically.
957 For Xtensa, the trampoline must perform an entry instruction with a
958 minimal stack frame in order to get some free registers. Once the
959 actual call target is known, the proper stack frame size is extracted
960 from the entry instruction at the target and the current frame is
961 adjusted to match. The trampoline then transfers control to the
962 instruction following the entry at the target. Note: this assumes
963 that the target begins with an entry instruction. */
965 /* minimum frame = reg save area (4 words) plus static chain (1 word)
966 and the total number of words must be a multiple of 128 bits */
967 #define MIN_FRAME_SIZE (8 * UNITS_PER_WORD)
969 #define TRAMPOLINE_TEMPLATE(STREAM) \
970 do { \
973 \
974 /* GCC isn't prepared to deal with data at the beginning of the \
975 trampoline, and the Xtensa l32r instruction requires that the \
976 constant pool be located before the code. We put the constant \
978 \
984 \
988 MIN_FRAME_SIZE - (5 * UNITS_PER_WORD)); \
989 \
994 TARGET_BIG_ENDIAN ? 8 : 12); \
999 \
1004 } while (0)
1006 /* Size in bytes of the trampoline, as an integer. */
1007 #define TRAMPOLINE_SIZE 49
1009 /* Alignment required for trampolines, in bits. */
1010 #define TRAMPOLINE_ALIGNMENT (32)
1012 /* A C statement to initialize the variable parts of a trampoline. */
1013 #define INITIALIZE_TRAMPOLINE(ADDR, FUNC, CHAIN) \
1014 do { \
1015 rtx addr = ADDR; \
1016 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (addr, 8)), FUNC); \
1017 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (addr, 12)), CHAIN); \
1019 0, VOIDmode, 1, addr, Pmode); \
1020 } while (0)
1022 /* Define the `__builtin_va_list' type for the ABI. */
1023 #define BUILD_VA_LIST_TYPE(VALIST) \
1024 (VALIST) = xtensa_build_va_list ()
1026 /* If defined, is a C expression that produces the machine-specific
1027 code for a call to '__builtin_saveregs'. This code will be moved
1028 to the very beginning of the function, before any parameter access
1029 are made. The return value of this function should be an RTX that
1030 contains the value to use as the return of '__builtin_saveregs'. */
1031 #define EXPAND_BUILTIN_SAVEREGS \
1032 xtensa_builtin_saveregs
1034 /* Implement `va_start' for varargs and stdarg. */
1035 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
1036 xtensa_va_start (valist, nextarg)
1038 /* Implement `va_arg'. */
1039 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
1040 xtensa_va_arg (valist, type)
1042 /* If defined, a C expression that produces the machine-specific code
1043 to setup the stack so that arbitrary frames can be accessed.
1045 On Xtensa, a stack back-trace must always begin from the stack pointer,
1046 so that the register overflow save area can be located. However, the
1047 stack-walking code in GCC always begins from the hard_frame_pointer
1048 register, not the stack pointer. The frame pointer is usually equal
1049 to the stack pointer, but the __builtin_return_address and
1050 __builtin_frame_address functions will not work if count > 0 and
1051 they are called from a routine that uses alloca. These functions
1052 are not guaranteed to work at all if count > 0 so maybe that is OK.
1054 A nicer solution would be to allow the architecture-specific files to
1055 specify whether to start from the stack pointer or frame pointer. That
1056 would also allow us to skip the machine->accesses_prev_frame stuff that
1057 we currently need to ensure that there is a frame pointer when these
1058 builtin functions are used. */
1060 #define SETUP_FRAME_ADDRESSES xtensa_setup_frame_addresses
1062 /* A C expression whose value is RTL representing the address in a
1063 stack frame where the pointer to the caller's frame is stored.
1064 Assume that FRAMEADDR is an RTL expression for the address of the
1065 stack frame itself.
1067 For Xtensa, there is no easy way to get the frame pointer if it is
1068 not equivalent to the stack pointer. Moreover, the result of this
1069 macro is used for continuing to walk back up the stack, so it must
1070 return the stack pointer address. Thus, there is some inconsistency
1071 here in that __builtin_frame_address will return the frame pointer
1072 when count == 0 and the stack pointer when count > 0. */
1074 #define DYNAMIC_CHAIN_ADDRESS(frame) \
1075 gen_rtx (PLUS, Pmode, frame, \
1076 gen_rtx_CONST_INT (VOIDmode, -3 * UNITS_PER_WORD))
1078 /* Define this if the return address of a particular stack frame is
1079 accessed from the frame pointer of the previous stack frame. */
1080 #define RETURN_ADDR_IN_PREVIOUS_FRAME
1082 /* A C expression whose value is RTL representing the value of the
1083 return address for the frame COUNT steps up from the current
1084 frame, after the prologue. */
1085 #define RETURN_ADDR_RTX xtensa_return_addr
1087 /* Addressing modes, and classification of registers for them. */
1089 /* C expressions which are nonzero if register number NUM is suitable
1090 for use as a base or index register in operand addresses. It may
1091 be either a suitable hard register or a pseudo register that has
1092 been allocated such a hard register. The difference between an
1093 index register and a base register is that the index register may
1094 be scaled. */
1096 #define REGNO_OK_FOR_BASE_P(NUM) \
1097 (GP_REG_P (NUM) || GP_REG_P ((unsigned) reg_renumber[NUM]))
1099 #define REGNO_OK_FOR_INDEX_P(NUM) 0
1101 /* C expressions that are nonzero if X (assumed to be a `reg' RTX) is
1102 valid for use as a base or index register. For hard registers, it
1103 should always accept those which the hardware permits and reject
1104 the others. Whether the macro accepts or rejects pseudo registers
1105 must be controlled by `REG_OK_STRICT'. This usually requires two
1106 variant definitions, of which `REG_OK_STRICT' controls the one
1107 actually used. The difference between an index register and a base
1108 register is that the index register may be scaled. */
1110 #ifdef REG_OK_STRICT
1112 #define REG_OK_FOR_INDEX_P(X) 0
1113 #define REG_OK_FOR_BASE_P(X) \
1114 REGNO_OK_FOR_BASE_P (REGNO (X))
1118 #define REG_OK_FOR_INDEX_P(X) 0
1119 #define REG_OK_FOR_BASE_P(X) \
1120 ((REGNO (X) >= FIRST_PSEUDO_REGISTER) || (GP_REG_P (REGNO (X))))
1124 /* Maximum number of registers that can appear in a valid memory address. */
1125 #define MAX_REGS_PER_ADDRESS 1
1127 /* Identify valid Xtensa addresses. */
1128 #define GO_IF_LEGITIMATE_ADDRESS(MODE, ADDR, LABEL) \
1129 do { \
1130 rtx xinsn = (ADDR); \
1131 \
1133 if ((MODE) != BLKmode && GET_MODE_SIZE (MODE) >= UNITS_PER_WORD \
1134 && constantpool_address_p (xinsn)) \
1135 goto LABEL; \
1136 \
1137 while (GET_CODE (xinsn) == SUBREG) \
1138 xinsn = SUBREG_REG (xinsn); \
1139 \
1141 if (GET_CODE (xinsn) == REG && REG_OK_FOR_BASE_P (xinsn)) \
1142 goto LABEL; \
1143 \
1145 if (GET_CODE (xinsn) == PLUS) \
1146 { \
1147 rtx xplus0 = XEXP (xinsn, 0); \
1148 rtx xplus1 = XEXP (xinsn, 1); \
1149 enum rtx_code code0; \
1150 enum rtx_code code1; \
1151 \
1152 while (GET_CODE (xplus0) == SUBREG) \
1153 xplus0 = SUBREG_REG (xplus0); \
1154 code0 = GET_CODE (xplus0); \
1155 \
1156 while (GET_CODE (xplus1) == SUBREG) \
1157 xplus1 = SUBREG_REG (xplus1); \
1158 code1 = GET_CODE (xplus1); \
1159 \
1161 if (code0 != REG && code1 == REG) \
1162 { \
1163 xplus0 = XEXP (xinsn, 1); \
1164 xplus1 = XEXP (xinsn, 0); \
1165 code0 = GET_CODE (xplus0); \
1166 code1 = GET_CODE (xplus1); \
1167 } \
1168 \
1169 if (code0 == REG && REG_OK_FOR_BASE_P (xplus0) \
1170 && code1 == CONST_INT \
1171 && xtensa_mem_offset (INTVAL (xplus1), (MODE))) \
1172 { \
1173 goto LABEL; \
1174 } \
1175 } \
1176 } while (0)
1178 /* A C expression that is 1 if the RTX X is a constant which is a
1179 valid address. This is defined to be the same as 'CONSTANT_P (X)',
1180 but rejecting CONST_DOUBLE. */
1181 #define CONSTANT_ADDRESS_P(X) \
1182 ((GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1183 || GET_CODE (X) == CONST_INT || GET_CODE (X) == HIGH \
1184 || (GET_CODE (X) == CONST)))
1186 /* Nonzero if the constant value X is a legitimate general operand.
1187 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1188 #define LEGITIMATE_CONSTANT_P(X) 1
1190 /* A C expression that is nonzero if X is a legitimate immediate
1191 operand on the target machine when generating position independent
1192 code. */
1193 #define LEGITIMATE_PIC_OPERAND_P(X) \
1194 ((GET_CODE (X) != SYMBOL_REF || SYMBOL_REF_FLAG (X)) \
1195 && GET_CODE (X) != LABEL_REF \
1196 && GET_CODE (X) != CONST)
1198 /* Tell GCC how to use ADDMI to generate addresses. */
1199 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1200 do { \
1201 rtx xinsn = (X); \
1202 if (GET_CODE (xinsn) == PLUS) \
1203 { \
1204 rtx plus0 = XEXP (xinsn, 0); \
1205 rtx plus1 = XEXP (xinsn, 1); \
1206 \
1207 if (GET_CODE (plus0) != REG && GET_CODE (plus1) == REG) \
1208 { \
1209 plus0 = XEXP (xinsn, 1); \
1210 plus1 = XEXP (xinsn, 0); \
1211 } \
1212 \
1213 if (GET_CODE (plus0) == REG \
1214 && GET_CODE (plus1) == CONST_INT \
1215 && !xtensa_mem_offset (INTVAL (plus1), MODE) \
1216 && !xtensa_simm8 (INTVAL (plus1)) \
1217 && xtensa_mem_offset (INTVAL (plus1) & 0xff, MODE) \
1218 && xtensa_simm8x256 (INTVAL (plus1) & ~0xff)) \
1219 { \
1220 rtx temp = gen_reg_rtx (Pmode); \
1221 emit_insn (gen_rtx (SET, Pmode, temp, \
1222 gen_rtx (PLUS, Pmode, plus0, \
1223 GEN_INT (INTVAL (plus1) & ~0xff)))); \
1224 (X) = gen_rtx (PLUS, Pmode, temp, \
1225 GEN_INT (INTVAL (plus1) & 0xff)); \
1226 goto WIN; \
1227 } \
1228 } \
1229 } while (0)
1232 /* Treat constant-pool references as "mode dependent" since they can
1233 only be accessed with SImode loads. This works around a bug in the
1234 combiner where a constant pool reference is temporarily converted
1235 to an HImode load, which is then assumed to zero-extend based on
1236 our definition of LOAD_EXTEND_OP. This is wrong because the high
1237 bits of a 16-bit value in the constant pool are now sign-extended
1238 by default. */
1240 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \
1241 do { \
1242 if (constantpool_address_p (ADDR)) \
1243 goto LABEL; \
1244 } while (0)
1246 /* Specify the machine mode that this machine uses
1247 for the index in the tablejump instruction. */
1248 #define CASE_VECTOR_MODE (SImode)
1250 /* Define this if the tablejump instruction expects the table
1251 to contain offsets from the address of the table.
1252 Do not define this if the table should contain absolute addresses. */
1253 /* #define CASE_VECTOR_PC_RELATIVE */
1255 /* Define this as 1 if 'char' should by default be signed; else as 0. */
1256 #define DEFAULT_SIGNED_CHAR 0
1258 /* Max number of bytes we can move from memory to memory
1259 in one reasonably fast instruction. */
1260 #define MOVE_MAX 4
1261 #define MAX_MOVE_MAX 4
1263 /* Prefer word-sized loads. */
1264 #define SLOW_BYTE_ACCESS 1
1266 /* Xtensa doesn't have any instructions that set integer values based on the
1267 results of comparisons, but the simplification code in the combiner also
1268 uses this macro. The value should be either 1 or -1 to enable some
1269 optimizations in the combiner; I'm not sure which is better for us.
1270 Since we've been using 1 for a while, it should probably stay that way for
1271 compatibility. */
1272 #define STORE_FLAG_VALUE 1
1274 /* Shift instructions ignore all but the low-order few bits. */
1275 #define SHIFT_COUNT_TRUNCATED 1
1277 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1278 is done just by pretending it is already truncated. */
1279 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1281 /* Specify the machine mode that pointers have.
1282 After generation of rtl, the compiler makes no further distinction
1283 between pointers and any other objects of this machine mode. */
1284 #define Pmode SImode
1286 /* A function address in a call instruction is a word address (for
1287 indexing purposes) so give the MEM rtx a words's mode. */
1288 #define FUNCTION_MODE SImode
1290 /* A C expression that evaluates to true if it is ok to perform a
1291 sibling call to DECL. */
1292 /* TODO: fix this up to allow at least some sibcalls */
1293 #define FUNCTION_OK_FOR_SIBCALL(DECL) 0
1295 /* Xtensa constant costs. */
1296 #define CONST_COSTS(X, CODE, OUTER_CODE) \
1297 case CONST_INT: \
1298 switch (OUTER_CODE) \
1299 { \
1300 case SET: \
1301 if (xtensa_simm12b (INTVAL (X))) return 4; \
1302 break; \
1303 case PLUS: \
1304 if (xtensa_simm8 (INTVAL (X))) return 0; \
1305 if (xtensa_simm8x256 (INTVAL (X))) return 0; \
1306 break; \
1307 case AND: \
1308 if (xtensa_mask_immediate (INTVAL (X))) return 0; \
1309 break; \
1310 case COMPARE: \
1311 if ((INTVAL (X) == 0) || xtensa_b4const (INTVAL (X))) return 0; \
1312 break; \
1313 case ASHIFT: \
1314 case ASHIFTRT: \
1315 case LSHIFTRT: \
1316 case ROTATE: \
1317 case ROTATERT: \
1319 default: break; \
1320 } \
1321 if (xtensa_simm12b (INTVAL (X))) return 5; \
1322 return 6; \
1323 case CONST: \
1324 case LABEL_REF: \
1325 case SYMBOL_REF: \
1326 return 5; \
1327 case CONST_DOUBLE: \
1328 return 7;
1330 /* Costs of various Xtensa operations. */
1331 #define RTX_COSTS(X, CODE, OUTER_CODE) \
1332 case MEM: \
1333 { \
1334 int num_words = \
1335 (GET_MODE_SIZE (GET_MODE (X)) > UNITS_PER_WORD) ? 2 : 1; \
1336 if (memory_address_p (GET_MODE (X), XEXP ((X), 0))) \
1337 return COSTS_N_INSNS (num_words); \
1338 \
1339 return COSTS_N_INSNS (2*num_words); \
1340 } \
1341 \
1342 case FFS: \
1343 return COSTS_N_INSNS (TARGET_NSA ? 5 : 50); \
1344 \
1345 case NOT: \
1346 return COSTS_N_INSNS ((GET_MODE (X) == DImode) ? 3 : 2); \
1347 \
1348 case AND: \
1349 case IOR: \
1350 case XOR: \
1351 if (GET_MODE (X) == DImode) return COSTS_N_INSNS (2); \
1352 return COSTS_N_INSNS (1); \
1353 \
1354 case ASHIFT: \
1355 case ASHIFTRT: \
1356 case LSHIFTRT: \
1357 if (GET_MODE (X) == DImode) return COSTS_N_INSNS (50); \
1358 return COSTS_N_INSNS (1); \
1359 \
1360 case ABS: \
1361 { \
1362 enum machine_mode xmode = GET_MODE (X); \
1363 if (xmode == SFmode) \
1364 return COSTS_N_INSNS (TARGET_HARD_FLOAT ? 1 : 50); \
1365 if (xmode == DFmode) \
1366 return COSTS_N_INSNS (50); \
1367 return COSTS_N_INSNS (4); \
1368 } \
1369 \
1370 case PLUS: \
1371 case MINUS: \
1372 { \
1373 enum machine_mode xmode = GET_MODE (X); \
1374 if (xmode == SFmode) \
1375 return COSTS_N_INSNS (TARGET_HARD_FLOAT ? 1 : 50); \
1376 if (xmode == DFmode || xmode == DImode) \
1377 return COSTS_N_INSNS (50); \
1378 return COSTS_N_INSNS (1); \
1379 } \
1380 \
1381 case NEG: \
1382 return COSTS_N_INSNS ((GET_MODE (X) == DImode) ? 4 : 2); \
1383 \
1384 case MULT: \
1385 { \
1386 enum machine_mode xmode = GET_MODE (X); \
1387 if (xmode == SFmode) \
1388 return COSTS_N_INSNS (TARGET_HARD_FLOAT ? 4 : 50); \
1389 if (xmode == DFmode || xmode == DImode) \
1390 return COSTS_N_INSNS (50); \
1391 if (TARGET_MUL32) \
1392 return COSTS_N_INSNS (4); \
1393 if (TARGET_MAC16) \
1394 return COSTS_N_INSNS (16); \
1395 if (TARGET_MUL16) \
1396 return COSTS_N_INSNS (12); \
1397 return COSTS_N_INSNS (50); \
1398 } \
1399 \
1400 case DIV: \
1401 case MOD: \
1402 { \
1403 enum machine_mode xmode = GET_MODE (X); \
1404 if (xmode == SFmode) \
1405 return COSTS_N_INSNS (TARGET_HARD_FLOAT_DIV ? 8 : 50); \
1406 if (xmode == DFmode) \
1407 return COSTS_N_INSNS (50); \
1408 } \
1410 \
1411 case UDIV: \
1412 case UMOD: \
1413 { \
1414 enum machine_mode xmode = GET_MODE (X); \
1415 if (xmode == DImode) \
1416 return COSTS_N_INSNS (50); \
1417 if (TARGET_DIV32) \
1418 return COSTS_N_INSNS (32); \
1419 return COSTS_N_INSNS (50); \
1420 } \
1421 \
1422 case SQRT: \
1423 if (GET_MODE (X) == SFmode) \
1424 return COSTS_N_INSNS (TARGET_HARD_FLOAT_SQRT ? 8 : 50); \
1425 return COSTS_N_INSNS (50); \
1426 \
1427 case SMIN: \
1428 case UMIN: \
1429 case SMAX: \
1430 case UMAX: \
1431 return COSTS_N_INSNS (TARGET_MINMAX ? 1 : 50); \
1432 \
1433 case SIGN_EXTRACT: \
1434 case SIGN_EXTEND: \
1435 return COSTS_N_INSNS (TARGET_SEXT ? 1 : 2); \
1436 \
1437 case ZERO_EXTRACT: \
1438 case ZERO_EXTEND: \
1439 return COSTS_N_INSNS (1);
1442 /* An expression giving the cost of an addressing mode that
1443 contains ADDRESS. */
1444 #define ADDRESS_COST(ADDR) 1
1446 /* A C expression for the cost of moving data from a register in
1447 class FROM to one in class TO. The classes are expressed using
1448 the enumeration values such as 'GENERAL_REGS'. A value of 2 is
1449 the default; other values are interpreted relative to that. */
1450 #define REGISTER_MOVE_COST(MODE, FROM, TO) \
1451 (((FROM) == (TO) && (FROM) != BR_REGS && (TO) != BR_REGS) \
1452 ? 2 \
1453 : (reg_class_subset_p ((FROM), AR_REGS) \
1454 && reg_class_subset_p ((TO), AR_REGS) \
1455 ? 2 \
1456 : (reg_class_subset_p ((FROM), AR_REGS) \
1457 && (TO) == ACC_REG \
1458 ? 3 \
1459 : ((FROM) == ACC_REG \
1460 && reg_class_subset_p ((TO), AR_REGS) \
1461 ? 3 \
1462 : 10))))
1464 #define MEMORY_MOVE_COST(MODE, CLASS, IN) 4
1466 #define BRANCH_COST 3
1468 /* Optionally define this if you have added predicates to
1469 'MACHINE.c'. This macro is called within an initializer of an
1470 array of structures. The first field in the structure is the
1471 name of a predicate and the second field is an array of rtl
1472 codes. For each predicate, list all rtl codes that can be in
1473 expressions matched by the predicate. The list should have a
1474 trailing comma. */
1476 #define PREDICATE_CODES \
1491 CONST, SYMBOL_REF, LABEL_REF }}, \
1498 /* Control the assembler format that we output. */
1500 /* How to refer to registers in assembler output.
1501 This sequence is indexed by compiler's hard-register-number (see above). */
1502 #define REGISTER_NAMES \
1503 { \
1510 }
1512 /* If defined, a C initializer for an array of structures containing a
1513 name and a register number. This macro defines additional names
1514 for hard registers, thus allowing the 'asm' option in declarations
1515 to refer to registers using alternate names. */
1516 #define ADDITIONAL_REGISTER_NAMES \
1517 { \
1519 }
1521 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1522 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address (FILE, ADDR)
1524 /* Recognize machine-specific patterns that may appear within
1525 constants. Used for PIC-specific UNSPECs. */
1526 #define OUTPUT_ADDR_CONST_EXTRA(STREAM, X, FAIL) \
1527 do { \
1528 if (flag_pic && GET_CODE (X) == UNSPEC && XVECLEN ((X), 0) == 1) \
1529 { \
1530 switch (XINT ((X), 1)) \
1531 { \
1532 case UNSPEC_PLT: \
1533 output_addr_const ((STREAM), XVECEXP ((X), 0, 0)); \
1535 break; \
1536 default: \
1537 goto FAIL; \
1538 } \
1539 break; \
1540 } \
1541 else \
1542 goto FAIL; \
1543 } while (0)
1545 /* Globalizing directive for a label. */
1548 /* This says how to define a global common symbol. */
1549 #define ASM_OUTPUT_COMMON(STREAM, NAME, SIZE, ROUNDED) \
1552 /* This says how to define a local common symbol (ie, not visible to
1553 linker). */
1554 #define ASM_OUTPUT_LOCAL(STREAM, NAME, SIZE, ROUNDED) \
1557 /* This is how to output an element of a case-vector that is absolute. */
1558 #define ASM_OUTPUT_ADDR_VEC_ELT(STREAM, VALUE) \
1560 LOCAL_LABEL_PREFIX, VALUE)
1562 /* This is how to output an element of a case-vector that is relative.
1563 This is used for pc-relative code. */
1564 #define ASM_OUTPUT_ADDR_DIFF_ELT(STREAM, BODY, VALUE, REL) \
1565 do { \
1567 LOCAL_LABEL_PREFIX, (VALUE), \
1568 LOCAL_LABEL_PREFIX, (REL)); \
1569 } while (0)
1571 /* This is how to output an assembler line that says to advance the
1572 location counter to a multiple of 2**LOG bytes. */
1573 #define ASM_OUTPUT_ALIGN(STREAM, LOG) \
1574 do { \
1575 if ((LOG) != 0) \
1577 } while (0)
1579 /* Indicate that jump tables go in the text section. This is
1580 necessary when compiling PIC code. */
1581 #define JUMP_TABLES_IN_TEXT_SECTION (flag_pic)
1584 /* Define this macro for the rare case where the RTL needs some sort of
1585 machine-dependent fixup immediately before register allocation is done.
1587 If the stack frame size is too big to fit in the immediate field of
1588 the ENTRY instruction, we need to store the frame size in the
1589 constant pool. However, the code in xtensa_function_prologue runs too
1590 late to be able to add anything to the constant pool. Since the
1591 final frame size isn't known until reload is complete, this seems
1592 like the best place to do it.
1594 There may also be some fixup required if there is an incoming argument
1595 in a7 and the function requires a frame pointer. */
1597 #define MACHINE_DEPENDENT_REORG(INSN) xtensa_reorg (INSN)
1600 /* Define the strings to put out for each section in the object file. */
1605 /* Define output to appear before the constant pool. If the function
1606 has been assigned to a specific ELF section, or if it goes into a
1607 unique section, set the name of that section to be the literal
1608 prefix. */
1609 #define ASM_OUTPUT_POOL_PROLOGUE(FILE, FUNNAME, FUNDECL, SIZE) \
1610 do { \
1611 tree fnsection; \
1612 resolve_unique_section ((FUNDECL), 0, flag_function_sections); \
1613 fnsection = DECL_SECTION_NAME (FUNDECL); \
1614 if (fnsection != NULL_TREE) \
1615 { \
1616 const char *fnsectname = TREE_STRING_POINTER (fnsection); \
1619 } \
1620 if ((SIZE) > 0) \
1621 { \
1622 function_section (FUNDECL); \
1624 } \
1625 } while (0)
1628 /* Define code to write out the ".end literal_prefix" directive for a
1629 function in a special section. This is appended to the standard ELF
1630 code for ASM_DECLARE_FUNCTION_SIZE. */
1631 #define XTENSA_DECLARE_FUNCTION_SIZE(FILE, FNAME, DECL) \
1632 if (DECL_SECTION_NAME (DECL) != NULL_TREE) \
1635 /* A C statement (with or without semicolon) to output a constant in
1636 the constant pool, if it needs special treatment. */
1637 #define ASM_OUTPUT_SPECIAL_POOL_ENTRY(FILE, X, MODE, ALIGN, LABELNO, JUMPTO) \
1638 do { \
1639 xtensa_output_literal (FILE, X, MODE, LABELNO); \
1640 goto JUMPTO; \
1641 } while (0)
1643 /* Store in OUTPUT a string (made with alloca) containing
1644 an assembler-name for a local static variable named NAME.
1645 LABELNO is an integer which is different for each call. */
1646 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1647 do { \
1648 (OUTPUT) = (char *) alloca (strlen (NAME) + 10); \
1650 } while (0)
1652 /* How to start an assembler comment. */
1655 /* Exception handling TODO!! */
1656 #define DWARF_UNWIND_INFO 0