1 /* Definitions for GCC. Part of the machine description for CRIS. 2 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 3 Free Software Foundation, Inc. 4 Contributed by Axis Communications. Written by Hans-Peter Nilsson. 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, 51 Franklin Street, Fifth Floor, 21 Boston, MA 02110-1301, USA. */ 22 23 /* After the first "Node:" comment comes all preprocessor directives and 24 attached declarations described in the info files, the "Using and 25 Porting GCC" manual (uapgcc), in the same order as found in the "Target 26 macros" section in the gcc-2.9x CVS edition of 2000-03-17. FIXME: Not 27 really, but needs an update anyway. 28 29 There is no generic copy-of-uapgcc comment, you'll have to see uapgcc 30 for that. If applicable, there is a CRIS-specific comment. The order 31 of macro definitions follow the order in the manual. Every section in 32 the manual (node in the info pages) has an introductory `Node: 33 <subchapter>' comment. If no macros are defined for a section, only 34 the section-comment is present. */ 35 36 /* Note that other header files (e.g. config/elfos.h, config/linux.h, 37 config/cris/linux.h and config/cris/aout.h) are responsible for lots of 38 settings not repeated below. This file contains general CRIS 39 definitions and definitions for the cris-*-elf subtarget. */ 40 41 /* We don't want to use gcc_assert for everything, as that can be 42 compiled out. */ 43 #define CRIS_ASSERT(x) \ 44 do { if (!(x)) internal_error ("CRIS-port assertion failed: " #x); } while (0) 45 46 /* Replacement for REG_P since it does not match SUBREGs. Happens for 47 testcase Axis-20000320 with gcc-2.9x. */ 48 #define REG_S_P(x) \ 49 (REG_P (x) || (GET_CODE (x) == SUBREG && REG_P (XEXP (x, 0)))) 50 51 /* Last register in main register bank r0..r15. */ 52 #define CRIS_LAST_GENERAL_REGISTER 15 53 54 /* Descriptions of registers used for arguments. */ 55 #define CRIS_FIRST_ARG_REG 10 56 #define CRIS_MAX_ARGS_IN_REGS 4 57 58 /* See also *_REGNUM constants in cris.md. */ 59 60 /* Most of the time, we need the index into the register-names array. 61 When passing debug-info, we need the real hardware register number. */ 62 #define CRIS_CANONICAL_SRP_REGNUM (16 + 11) 63 #define CRIS_CANONICAL_MOF_REGNUM (16 + 7) 64 /* We have CCR in all models including v10, but that's 16 bits, so let's 65 prefer the DCCR number, which is a DMA pointer in pre-v8, so we'll 66 never clash with it for GCC purposes. */ 67 #define CRIS_CANONICAL_CC0_REGNUM (16 + 13) 68 69 /* When generating PIC, these suffixes are added to the names of non-local 70 functions when being output. Contrary to other ports, we have offsets 71 relative to the GOT, not the PC. We might implement PC-relative PLT 72 semantics later for the general case; they are used in some cases right 73 now, such as MI thunks. */ 74 #define CRIS_GOTPLT_SUFFIX ":GOTPLT" 75 #define CRIS_PLT_GOTOFFSET_SUFFIX ":PLTG" 76 #define CRIS_PLT_PCOFFSET_SUFFIX ":PLT" 77 78 #define CRIS_FUNCTION_ARG_SIZE(MODE, TYPE) \ 79 ((MODE) != BLKmode ? GET_MODE_SIZE (MODE) \ 80 : (unsigned) int_size_in_bytes (TYPE)) 81 82 /* Which CPU version this is. The parsed and adjusted cris_cpu_str. */ 83 extern int cris_cpu_version; 84 85 /* Changing the order used to be necessary to put the fourth __make_dp 86 argument (a DImode parameter) in registers, to fit with the libfunc 87 parameter passing scheme used for intrinsic functions. FIXME: Check 88 performance and maybe remove definition from TARGET_LIBGCC2_CFLAGS now 89 that it isn't strictly necessary. We used to do this through 90 TARGET_LIBGCC2_CFLAGS, but that became increasingly difficult as the 91 parenthesis (that needed quoting) travels through several layers of 92 make and shell invocations. */ 93 #ifdef IN_LIBGCC2 94 #define __make_dp(a,b,c,d) __cris_make_dp(d,a,b,c) 95 #endif 96 97 98 /* Node: Driver */ 99 100 /* When using make with defaults.mak for Sun this will handily remove 101 any "-target sun*" switches. */ 102 /* We need to override any previous definitions (linux.h) */ 103 #undef WORD_SWITCH_TAKES_ARG 104 #define WORD_SWITCH_TAKES_ARG(STR) \ 105 (DEFAULT_WORD_SWITCH_TAKES_ARG (STR) \ 106 || !strcmp (STR, "target")) 107 108 /* Also provide canonical vN definitions when user specifies an alias. 109 Note that -melf overrides -maout. */ 110 111 #define CPP_SPEC \ 112 "%{mtune=*:-D__tune_%* %{mtune=v*:-D__CRIS_arch_tune=%*}\ 113 %{mtune=etrax4:-D__tune_v3 -D__CRIS_arch_tune=3}\ 114 %{mtune=etrax100:-D__tune_v8 -D__CRIS_arch_tune=8}\ 115 %{mtune=svinto:-D__tune_v8 -D__CRIS_arch_tune=8}\ 116 %{mtune=etrax100lx:-D__tune_v10 -D__CRIS_arch_tune=10}\ 117 %{mtune=ng:-D__tune_v10 -D__CRIS_arch_tune=10}}\ 118 %{mcpu=*:-D__arch_%* %{mcpu=v*:-D__CRIS_arch_version=%*}\ 119 %{mcpu=etrax4:-D__arch_v3 -D__CRIS_arch_version=3}\ 120 %{mcpu=etrax100:-D__arch_v8 -D__CRIS_arch_version=8}\ 121 %{mcpu=svinto:-D__arch_v8 -D__CRIS_arch_version=8}\ 122 %{mcpu=etrax100lx:-D__arch_v10 -D__CRIS_arch_version=10}\ 123 %{mcpu=ng:-D__arch_v10 -D__CRIS_arch_version=10}}\ 124 %{march=*:-D__arch_%* %{march=v*:-D__CRIS_arch_version=%*}\ 125 %{march=etrax4:-D__arch_v3 -D__CRIS_arch_version=3}\ 126 %{march=etrax100:-D__arch_v8 -D__CRIS_arch_version=8}\ 127 %{march=svinto:-D__arch_v8 -D__CRIS_arch_version=8}\ 128 %{march=etrax100lx:-D__arch_v10 -D__CRIS_arch_version=10}\ 129 %{march=ng:-D__arch_v10 -D__CRIS_arch_version=10}}\ 130 %{metrax100:-D__arch__v8 -D__CRIS_arch_version=8}\ 131 %{metrax4:-D__arch__v3 -D__CRIS_arch_version=3}\ 132 %(cpp_subtarget)" 133 134 /* For the cris-*-elf subtarget. */ 135 #define CRIS_CPP_SUBTARGET_SPEC \ 136 "%{mbest-lib-options:\ 137 %{!moverride-best-lib-options:\ 138 %{!march=*:%{!metrax*:%{!mcpu=*:-D__tune_v10 -D__CRIS_arch_tune=10}}}}}" 139 140 /* Remove those Sun-make "target" switches. */ 141 /* Override previous definitions (linux.h). */ 142 #undef CC1_SPEC 143 #define CC1_SPEC \ 144 "%{target*:}\ 145 %{metrax4:-march=v3}\ 146 %{metrax100:-march=v8}\ 147 %(cc1_subtarget)" 148 149 /* For the cris-*-elf subtarget. */ 150 #define CRIS_CC1_SUBTARGET_SPEC \ 151 "-melf\ 152 %{mbest-lib-options:\ 153 %{!moverride-best-lib-options:\ 154 %{!march=*:%{!mcpu=*:-mtune=v10 -D__CRIS_arch_tune=10}}\ 155 %{!finhibit-size-directive:\ 156 %{!fno-function-sections: -ffunction-sections}\ 157 %{!fno-data-sections: -fdata-sections}}}}" 158 159 /* This adds to CC1_SPEC. When bugs are removed from -fvtable-gc 160 (-fforce-addr causes invalid .vtable_entry asm in tinfo.cc and 161 nothing at all works in GCC 3.0-pre), add this line: 162 "%{mbest-lib-options:%{!moverride-best-lib-options:\ 163 %{!melinux:%{!maout|melf:%{!fno-vtable-gc:-fvtable-gc}}}}}". */ 164 #define CC1PLUS_SPEC "" 165 166 #ifdef HAVE_AS_NO_MUL_BUG_ABORT_OPTION 167 #define MAYBE_AS_NO_MUL_BUG_ABORT \ 168 "%{mno-mul-bug-workaround:-no-mul-bug-abort} " 169 #else 170 #define MAYBE_AS_NO_MUL_BUG_ABORT 171 #endif 172 173 /* Override previous definitions (linux.h). */ 174 #undef ASM_SPEC 175 #define ASM_SPEC \ 176 MAYBE_AS_NO_MUL_BUG_ABORT \ 177 "%{v:-v}\ 178 %(asm_subtarget)" 179 180 /* For the cris-*-elf subtarget. */ 181 #define CRIS_ASM_SUBTARGET_SPEC "--em=criself" 182 183 /* FIXME: We should propagate the -melf option to make the criself 184 "emulation" unless a linker script is provided (-T*), but I don't know 185 how to do that if either of -Ttext, -Tdata or -Tbss is given but no 186 linker script, as is usually the case. Leave it to the user for the 187 time being. 188 189 Note that -melf overrides -maout except that a.out-compiled libraries 190 are linked in (multilibbing). The somewhat cryptic -rpath-link pair is 191 to avoid *only* picking up the linux multilib subdir from the "-B./" 192 option during build, while still giving it preference. We'd need some 193 %s-variant that checked for existence of some specific file. */ 194 /* Override previous definitions (svr4.h). */ 195 #undef LINK_SPEC 196 #define LINK_SPEC \ 197 "%{v:--verbose}\ 198 %(link_subtarget)" 199 200 /* For the cris-*-elf subtarget. */ 201 #define CRIS_LINK_SUBTARGET_SPEC \ 202 "-mcriself\ 203 %{sim2:%{!T*:-Tdata 0x4000000 -Tbss 0x8000000}}\ 204 %{!r:%{O2|O3: --gc-sections}}" 205 206 /* Which library to get. The simulator uses a different library for 207 the low-level syscalls (implementing the Linux syscall ABI instead 208 of direct-iron accesses). Default everything with the stub "nosys" 209 library. */ 210 /* Override previous definitions (linux.h). */ 211 #undef LIB_SPEC 212 #define LIB_SPEC \ 213 "%{sim*:--start-group -lc -lsyslinux --end-group}\ 214 %{!sim*:%{g*:-lg}\ 215 %{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p} -lbsp}\ 216 -lnosys" 217 218 /* Linker startfile options; crt0 flavors. 219 We need to remove any previous definition (elfos.h). */ 220 #undef STARTFILE_SPEC 221 #define STARTFILE_SPEC \ 222 "%{sim*:crt1.o%s}%{!sim*:crt0.o%s}\ 223 crti.o%s crtbegin.o%s" 224 225 #undef ENDFILE_SPEC 226 #define ENDFILE_SPEC "crtend.o%s crtn.o%s" 227 228 #define EXTRA_SPECS \ 229 {"cpp_subtarget", CRIS_CPP_SUBTARGET_SPEC}, \ 230 {"cc1_subtarget", CRIS_CC1_SUBTARGET_SPEC}, \ 231 {"asm_subtarget", CRIS_ASM_SUBTARGET_SPEC}, \ 232 {"link_subtarget", CRIS_LINK_SUBTARGET_SPEC}, \ 233 CRIS_SUBTARGET_EXTRA_SPECS 234 235 #define CRIS_SUBTARGET_EXTRA_SPECS 236 237 238 /* Node: Run-time Target */ 239 240 #define TARGET_CPU_CPP_BUILTINS() \ 241 do \ 242 { \ 243 builtin_define_std ("cris"); \ 244 builtin_define_std ("CRIS"); \ 245 builtin_define_std ("GNU_CRIS"); \ 246 builtin_define ("__CRIS_ABI_version=2"); \ 247 builtin_assert ("cpu=cris"); \ 248 builtin_assert ("machine=cris"); \ 249 } \ 250 while (0) 251 252 /* This needs to be at least 32 bits. */ 253 extern int target_flags; 254 255 /* Previously controlled by target_flags. */ 256 #define TARGET_ELF 1 257 258 /* Previously controlled by target_flags. Note that this is *not* set 259 for -melinux. */ 260 #define TARGET_LINUX 0 261 262 /* Default target_flags if no switches specified. */ 263 #ifndef TARGET_DEFAULT 264 # define TARGET_DEFAULT \ 265 (MASK_SIDE_EFFECT_PREFIXES + MASK_STACK_ALIGN \ 266 + MASK_CONST_ALIGN + MASK_DATA_ALIGN \ 267 + MASK_PROLOGUE_EPILOGUE + MASK_MUL_BUG) 268 #endif 269 270 /* For the cris-*-elf subtarget. */ 271 #define CRIS_SUBTARGET_DEFAULT 0 272 273 #define CRIS_CPU_BASE 0 274 #define CRIS_CPU_ETRAX4 3 /* Just lz added. */ 275 #define CRIS_CPU_SVINTO 8 /* Added swap, jsrc & Co., 32-bit accesses. */ 276 #define CRIS_CPU_NG 10 /* Added mul[su]. */ 277 278 /* Local, providing a default for cris_cpu_version. */ 279 #define CRIS_DEFAULT_CPU_VERSION CRIS_CPU_BASE 280 281 #define TARGET_HAS_MUL_INSNS (cris_cpu_version >= CRIS_CPU_NG) 282 283 #define CRIS_SUBTARGET_HANDLE_OPTION(x, y, z) 284 285 /* Print subsidiary information on the compiler version in use. 286 Do not use VD.D syntax (D=digit), since this will cause confusion 287 with the base gcc version among users, when we ask which version of 288 gcc-cris they are using. Please use some flavor of "R<number>" for 289 the version (no need for major.minor versions, I believe). */ 290 #define TARGET_VERSION \ 291 fprintf (stderr, " [Axis CRIS%s]", CRIS_SUBTARGET_VERSION) 292 293 /* For the cris-*-elf subtarget. */ 294 #define CRIS_SUBTARGET_VERSION " - generic ELF" 295 296 #define OVERRIDE_OPTIONS cris_override_options () 297 298 /* The following gives optimal code for gcc-2.7.2, but *may* be subject 299 to change. Omitting flag_force_addr gives .1-.7% faster code for gcc 300 *only*, but 1.3% larger code. On ipps it gives 5.3-10.6% slower 301 code(!) and 0.3% larger code. For products, images gets .1-1.8% 302 larger. Do not set strict aliasing from optimization options. */ 303 #define OPTIMIZATION_OPTIONS(OPTIMIZE, SIZE) \ 304 do \ 305 { \ 306 if ((OPTIMIZE) >= 2 || (SIZE)) \ 307 { \ 308 flag_force_addr = 1; \ 309 flag_omit_frame_pointer = 1; \ 310 } \ 311 } \ 312 while (0) 313 314 315 /* Node: Storage Layout */ 316 317 #define BITS_BIG_ENDIAN 0 318 319 #define BYTES_BIG_ENDIAN 0 320 321 /* WORDS_BIG_ENDIAN is not defined in the hardware, but for consistency, 322 we use little-endianness, and we may also be able to use 323 post-increment on DImode indirect. */ 324 #define WORDS_BIG_ENDIAN 0 325 326 #define UNITS_PER_WORD 4 327 328 /* A combination of defining PROMOTE_FUNCTION_MODE, 329 TARGET_PROMOTE_FUNCTION_ARGS that always returns true 330 and *not* defining TARGET_PROMOTE_PROTOTYPES or PROMOTE_MODE gives the 331 best code size and speed for gcc, ipps and products in gcc-2.7.2. */ 332 #define CRIS_PROMOTED_MODE(MODE, UNSIGNEDP, TYPE) \ 333 (GET_MODE_CLASS (MODE) == MODE_INT && GET_MODE_SIZE (MODE) < 4) \ 334 ? SImode : MODE 335 336 #define PROMOTE_FUNCTION_MODE(MODE, UNSIGNEDP, TYPE) \ 337 (MODE) = CRIS_PROMOTED_MODE (MODE, UNSIGNEDP, TYPE) 338 339 /* Defining PROMOTE_FUNCTION_RETURN in gcc-2.7.2 uncovers bug 981110 (even 340 if defining FUNCTION_VALUE with MODE as PROMOTED_MODE ;-) 341 342 FIXME: Report this when cris.h is part of GCC, so others can easily 343 see the problem. Maybe check other systems that define 344 TARGET_PROMOTE_FUNCTION_RETURN that always returns true. */ 345 346 /* We will be using prototype promotion, so they will be 32 bit. */ 347 #define PARM_BOUNDARY 32 348 349 /* Stack boundary is guided by -mstack-align, -mno-stack-align, 350 -malign. 351 Old comment: (2.1: still valid in 2.7.2?) 352 Note that to make this macro affect the alignment of stack 353 locals, a fix was required, and special precautions when handling 354 the stack pointer in various other macros (TARGET_ASM_FUNCTION_PROLOGUE 355 et al) were required. See file "function.c". If you would just define 356 this macro, it would only affect the builtin alloca and variable 357 local data (non-ANSI, non-K&R, Gnu C extension). */ 358 #define STACK_BOUNDARY \ 359 (TARGET_STACK_ALIGN ? (TARGET_ALIGN_BY_32 ? 32 : 16) : 8) 360 361 #define FUNCTION_BOUNDARY 16 362 363 /* Do not change BIGGEST_ALIGNMENT (when optimizing), as it will affect 364 strange places, at least in 2.1. */ 365 #define BIGGEST_ALIGNMENT 8 366 367 /* If -m16bit, -m16-bit, -malign or -mdata-align, 368 align everything to 16 bit. */ 369 #define DATA_ALIGNMENT(TYPE, BASIC_ALIGN) \ 370 (TARGET_DATA_ALIGN \ 371 ? (TARGET_ALIGN_BY_32 \ 372 ? (BASIC_ALIGN < 32 ? 32 : BASIC_ALIGN) \ 373 : (BASIC_ALIGN < 16 ? 16 : BASIC_ALIGN)) : BASIC_ALIGN) 374 375 /* Note that CONSTANT_ALIGNMENT has the effect of making gcc believe that 376 ALL references to constant stuff (in code segment, like strings) has 377 this alignment. That is a rather rushed assumption. Luckily we do not 378 care about the "alignment" operand to builtin memcpy (only place where 379 it counts), so it doesn't affect any bad spots. */ 380 #define CONSTANT_ALIGNMENT(CONSTANT, BASIC_ALIGN) \ 381 (TARGET_CONST_ALIGN \ 382 ? (TARGET_ALIGN_BY_32 \ 383 ? (BASIC_ALIGN < 32 ? 32 : BASIC_ALIGN) \ 384 : (BASIC_ALIGN < 16 ? 16 : BASIC_ALIGN)) : BASIC_ALIGN) 385 386 /* FIXME: Define LOCAL_ALIGNMENT for word and dword or arrays and 387 structures (if -mstack-align=), and check that it is good. */ 388 389 #define EMPTY_FIELD_BOUNDARY 8 390 391 #define STRUCTURE_SIZE_BOUNDARY 8 392 393 #define STRICT_ALIGNMENT 0 394 395 /* Remove any previous definition (elfos.h). 396 ??? If it wasn't for all the other stuff that affects layout of 397 structures and bit-fields, this could presumably cause incompatibility 398 with other GNU/Linux ports (i.e. elfos.h users). */ 399 #undef PCC_BITFIELD_TYPE_MATTERS 400 401 /* This is only used for non-scalars. Strange stuff happens to structs 402 (FIXME: What?) if we use anything larger than largest actually used 403 datum size, so lets make it 32. The type "long long" will still work 404 as usual. We can still have DImode insns, but they will only be used 405 for scalar data (i.e. long long). */ 406 #define MAX_FIXED_MODE_SIZE 32 407 408 409 /* Node: Type Layout */ 410 411 /* Note that DOUBLE_TYPE_SIZE is not defined anymore, since the default 412 value gives a 64-bit double, which is what we now use. */ 413 414 /* For compatibility and historical reasons, a char should be signed. */ 415 #define DEFAULT_SIGNED_CHAR 1 416 417 /* Note that WCHAR_TYPE_SIZE is used in cexp.y, 418 where TARGET_SHORT is not available. */ 419 #undef WCHAR_TYPE 420 #define WCHAR_TYPE "long int" 421 422 #undef WCHAR_TYPE_SIZE 423 #define WCHAR_TYPE_SIZE 32 424 425 426 /* Node: Register Basics */ 427 428 /* We count all 16 non-special registers, SRP, a faked argument 429 pointer register, MOF and CCR/DCCR. */ 430 #define FIRST_PSEUDO_REGISTER (16 + 1 + 1 + 1 + 1) 431 432 /* For CRIS, these are r15 (pc) and r14 (sp). Register r8 is used as a 433 frame-pointer, but is not fixed. SRP is not included in general 434 registers and will not be used automatically. All other special 435 registers are fixed at the moment. The faked argument pointer register 436 is fixed too. */ 437 #define FIXED_REGISTERS \ 438 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} 439 440 /* Register r9 is used for structure-address, r10-r13 for parameters, 441 r10- for return values. */ 442 #define CALL_USED_REGISTERS \ 443 {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1} 444 445 #define CONDITIONAL_REGISTER_USAGE cris_conditional_register_usage () 446 447 448 /* Node: Allocation Order */ 449 450 /* We need this on CRIS, because call-used regs should be used first, 451 (so we don't need to push). Else start using registers from r0 and up. 452 This preference is mainly because if we put call-used-regs from r0 453 and up, then we can't use movem to push the rest, (which have to be 454 saved if we use them, and movem has to start with r0). 455 Change here if you change which registers to use as call registers. 456 457 The actual need to explicitly prefer call-used registers improved the 458 situation a lot for 2.1, but might not actually be needed anymore. 459 Still, this order reflects what GCC should find out by itself, so it 460 probably does not hurt. 461 462 Order of preference: Call-used-regs first, then r0 and up, last fp & 463 sp & pc as fillers. 464 Call-used regs in opposite order, so they will cause less conflict if 465 a function has few args (<= 3) and it wants a scratch reg. 466 Use struct-return address first, since very few functions use 467 structure return values so it is likely to be available. */ 468 #define REG_ALLOC_ORDER \ 469 {9, 13, 12, 11, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 14, 15, 17, 16, 18, 19} 470 471 472 /* Node: Values in Registers */ 473 474 /* The VOIDmode test is so we can omit mode on anonymous insns. FIXME: 475 Still needed in 2.9x, at least for Axis-20000319. */ 476 #define HARD_REGNO_NREGS(REGNO, MODE) \ 477 (MODE == VOIDmode \ 478 ? 1 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)) 479 480 /* CRIS permits all registers to hold all modes. Well, except for the 481 condition-code register. And we can't hold larger-than-register size 482 modes in the last special register that can hold a full 32 bits. */ 483 #define HARD_REGNO_MODE_OK(REGNO, MODE) \ 484 (((MODE) == CCmode \ 485 || (REGNO) != CRIS_CC0_REGNUM) \ 486 && (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD \ 487 || (REGNO) != CRIS_MOF_REGNUM)) 488 489 /* Because CCmode isn't covered by the "narrower mode" statement in 490 tm.texi, we can still say all modes are tieable despite not having an 491 always 1 HARD_REGNO_MODE_OK. */ 492 #define MODES_TIEABLE_P(MODE1, MODE2) 1 493 494 495 /* Node: Leaf Functions */ 496 /* (no definitions) */ 497 498 /* Node: Stack Registers */ 499 /* (no definitions) */ 500 501 502 /* Node: Register Classes */ 503 504 enum reg_class 505 { 506 NO_REGS, 507 MOF_REGS, CC0_REGS, SPECIAL_REGS, GENERAL_REGS, ALL_REGS, 508 LIM_REG_CLASSES 509 }; 510 511 #define N_REG_CLASSES (int) LIM_REG_CLASSES 512 513 #define REG_CLASS_NAMES \ 514 {"NO_REGS", \ 515 "MOF_REGS", "CC0_REGS", "SPECIAL_REGS", "GENERAL_REGS", "ALL_REGS"} 516 517 #define CRIS_SPECIAL_REGS_CONTENTS \ 518 ((1 << CRIS_SRP_REGNUM) | (1 << CRIS_MOF_REGNUM) | (1 << CRIS_CC0_REGNUM)) 519 520 /* Count in the faked argument register in GENERAL_REGS. Keep out SRP. */ 521 #define REG_CLASS_CONTENTS \ 522 { \ 523 {0}, \ 524 {1 << CRIS_MOF_REGNUM}, \ 525 {1 << CRIS_CC0_REGNUM}, \ 526 {CRIS_SPECIAL_REGS_CONTENTS}, \ 527 {0xffff | (1 << CRIS_AP_REGNUM)}, \ 528 {0xffff | (1 << CRIS_AP_REGNUM) \ 529 | CRIS_SPECIAL_REGS_CONTENTS} \ 530 } 531 532 #define REGNO_REG_CLASS(REGNO) \ 533 ((REGNO) == CRIS_MOF_REGNUM ? MOF_REGS : \ 534 (REGNO) == CRIS_CC0_REGNUM ? CC0_REGS : \ 535 (REGNO) == CRIS_SRP_REGNUM ? SPECIAL_REGS : \ 536 GENERAL_REGS) 537 538 #define BASE_REG_CLASS GENERAL_REGS 539 540 #define INDEX_REG_CLASS GENERAL_REGS 541 542 #define REG_CLASS_FROM_LETTER(C) \ 543 ( \ 544 (C) == 'h' ? MOF_REGS : \ 545 (C) == 'x' ? SPECIAL_REGS : \ 546 (C) == 'c' ? CC0_REGS : \ 547 NO_REGS \ 548 ) 549 550 /* Since it uses reg_renumber, it is safe only once reg_renumber 551 has been allocated, which happens in local-alloc.c. */ 552 #define REGNO_OK_FOR_BASE_P(REGNO) \ 553 ((REGNO) <= CRIS_LAST_GENERAL_REGISTER \ 554 || (REGNO) == ARG_POINTER_REGNUM \ 555 || (unsigned) reg_renumber[REGNO] <= CRIS_LAST_GENERAL_REGISTER \ 556 || (unsigned) reg_renumber[REGNO] == ARG_POINTER_REGNUM) 557 558 /* See REGNO_OK_FOR_BASE_P. */ 559 #define REGNO_OK_FOR_INDEX_P(REGNO) REGNO_OK_FOR_BASE_P(REGNO) 560 561 /* It seems like gcc (2.7.2 and 2.9x of 2000-03-22) may send "NO_REGS" as 562 the class for a constant (testcase: __Mul in arit.c). To avoid forcing 563 out a constant into the constant pool, we will trap this case and 564 return something a bit more sane. FIXME: Check if this is a bug. 565 Beware that we must not "override" classes that can be specified as 566 constraint letters, or else asm operands using them will fail when 567 they need to be reloaded. FIXME: Investigate whether that constitutes 568 a bug. */ 569 #define PREFERRED_RELOAD_CLASS(X, CLASS) \ 570 ((CLASS) != MOF_REGS \ 571 && (CLASS) != CC0_REGS \ 572 && (CLASS) != SPECIAL_REGS \ 573 ? GENERAL_REGS : (CLASS)) 574 575 /* We can't move special registers to and from memory in smaller than 576 word_mode. */ 577 #define SECONDARY_RELOAD_CLASS(CLASS, MODE, X) \ 578 (((CLASS) != SPECIAL_REGS && (CLASS) != MOF_REGS) \ 579 || GET_MODE_SIZE (MODE) == 4 \ 580 || GET_CODE (X) != MEM \ 581 ? NO_REGS : GENERAL_REGS) 582 583 /* For CRIS, this is always the size of MODE in words, 584 since all registers are the same size. To use omitted modes in 585 patterns with reload constraints, you must say the widest size 586 which is allowed for VOIDmode. 587 FIXME: Does that still apply for gcc-2.9x? Keep poisoned until such 588 patterns are added back. News: 2001-03-16: Happens as early as the 589 underscore-test. */ 590 #define CLASS_MAX_NREGS(CLASS, MODE) \ 591 ((MODE) == VOIDmode \ 592 ? 1 /* + cris_fatal ("CLASS_MAX_NREGS with VOIDmode") */ \ 593 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)) 594 595 /* We are now out of letters; we could use ten more. This forces us to 596 use C-code in the 'md' file. FIXME: Use some EXTRA_CONSTRAINTS. */ 597 #define CONST_OK_FOR_LETTER_P(VALUE, C) \ 598 ( \ 599 /* MOVEQ, CMPQ, ANDQ, ORQ. */ \ 600 (C) == 'I' ? (VALUE) >= -32 && (VALUE) <= 31 : \ 601 /* ADDQ, SUBQ. */ \ 602 (C) == 'J' ? (VALUE) >= 0 && (VALUE) <= 63 : \ 603 /* ASRQ, BTSTQ, LSRQ, LSLQ. */ \ 604 (C) == 'K' ? (VALUE) >= 0 && (VALUE) <= 31 : \ 605 /* A 16-bit signed number. */ \ 606 (C) == 'L' ? (VALUE) >= -32768 && (VALUE) <= 32767 : \ 607 /* The constant 0 for CLEAR. */ \ 608 (C) == 'M' ? (VALUE) == 0 : \ 609 /* A negative ADDQ or SUBQ. */ \ 610 (C) == 'N' ? (VALUE) >= -63 && (VALUE) < 0 : \ 611 /* Quickened ints, QI and HI. */ \ 612 (C) == 'O' ? (VALUE) >= 0 && (VALUE) <= 65535 \ 613 && ((VALUE) >= (65535-31) \ 614 || ((VALUE) >= (255-31) \ 615 && (VALUE) <= 255 )) : \ 616 /* A 16-bit number signed *or* unsigned. */ \ 617 (C) == 'P' ? (VALUE) >= -32768 && (VALUE) <= 65535 : \ 618 0) 619 620 /* It is really simple to make up a 0.0; it is the same as int-0 in 621 IEEE754. */ 622 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \ 623 ((C) == 'G' && ((VALUE) == CONST0_RTX (DFmode) \ 624 || (VALUE) == CONST0_RTX (SFmode))) 625 626 /* We need this on cris to distinguish delay-slottable addressing modes. */ 627 #define EXTRA_CONSTRAINT(X, C) \ 628 ( \ 629 /* Slottable address mode? */ \ 630 (C) == 'Q' ? EXTRA_CONSTRAINT_Q (X) : \ 631 /* Operand to BDAP or BIAP? */ \ 632 (C) == 'R' ? EXTRA_CONSTRAINT_R (X) : \ 633 /* A local PIC symbol? */ \ 634 (C) == 'S' ? EXTRA_CONSTRAINT_S (X) : \ 635 /* A three-address addressing-mode? */ \ 636 (C) == 'T' ? EXTRA_CONSTRAINT_T (X) : \ 637 0) 638 639 #define EXTRA_MEMORY_CONSTRAINT(X, STR) ((X) == 'Q') 640 641 #define EXTRA_CONSTRAINT_Q(X) \ 642 ( \ 643 /* Just an indirect register (happens to also be \ 644 "all" slottable memory addressing modes not \ 645 covered by other constraints, i.e. '>'). */ \ 646 GET_CODE (X) == MEM && BASE_P (XEXP (X, 0)) \ 647 ) 648 649 #define EXTRA_CONSTRAINT_R(X) \ 650 ( \ 651 /* An operand to BDAP or BIAP: \ 652 A BIAP; r.S? */ \ 653 BIAP_INDEX_P (X) \ 654 /* A [reg] or (int) [reg], maybe with post-increment. */ \ 655 || BDAP_INDEX_P (X) \ 656 || CONSTANT_INDEX_P (X) \ 657 ) 658 659 #define EXTRA_CONSTRAINT_T(X) \ 660 ( \ 661 /* Memory three-address operand. All are indirect-memory: */ \ 662 GET_CODE (X) == MEM \ 663 && ((GET_CODE (XEXP (X, 0)) == MEM \ 664 /* Double indirect: [[reg]] or [[reg+]]? */ \ 665 && (BASE_OR_AUTOINCR_P (XEXP (XEXP (X, 0), 0)))) \ 666 /* Just an explicit indirect reference: [const]? */ \ 667 || CONSTANT_P (XEXP (X, 0)) \ 668 /* Something that is indexed; [...+...]? */ \ 669 || (GET_CODE (XEXP (X, 0)) == PLUS \ 670 /* A BDAP constant: [reg+(8|16|32)bit offset]? */ \ 671 && ((BASE_P (XEXP (XEXP (X, 0), 0)) \ 672 && CONSTANT_INDEX_P (XEXP (XEXP (X, 0), 1))) \ 673 /* A BDAP register: [reg+[reg(+)].S]? */ \ 674 || (BASE_P (XEXP (XEXP (X, 0), 0)) \ 675 && BDAP_INDEX_P(XEXP(XEXP(X, 0), 1))) \ 676 /* Same, but with swapped arguments (no canonical \ 677 ordering between e.g. REG and MEM as of LAST_UPDATED \ 678 "Thu May 12 03:59:11 UTC 2005"). */ \ 679 || (BASE_P (XEXP (XEXP (X, 0), 1)) \ 680 && BDAP_INDEX_P (XEXP (XEXP (X, 0), 0))) \ 681 /* A BIAP: [reg+reg.S] (MULT comes first). */ \ 682 || (BASE_P (XEXP (XEXP (X, 0), 1)) \ 683 && BIAP_INDEX_P (XEXP (XEXP (X, 0), 0)))))) \ 684 ) 685 686 /* PIC-constructs for symbols. */ 687 #define EXTRA_CONSTRAINT_S(X) \ 688 (flag_pic && GET_CODE (X) == CONST && cris_valid_pic_const (X)) 689 690 691 /* Node: Frame Layout */ 692 693 #define STACK_GROWS_DOWNWARD 694 #define FRAME_GROWS_DOWNWARD 1 695 696 /* It seems to be indicated in the code (at least 2.1) that this is 697 better a constant, and best 0. */ 698 #define STARTING_FRAME_OFFSET 0 699 700 #define FIRST_PARM_OFFSET(FNDECL) 0 701 702 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \ 703 cris_return_addr_rtx (COUNT, FRAMEADDR) 704 705 #define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, CRIS_SRP_REGNUM) 706 707 /* FIXME: Any __builtin_eh_return callers must not return anything and 708 there must not be collisions with incoming parameters. Luckily the 709 number of __builtin_eh_return callers is limited. For now return 710 parameter registers in reverse order and hope for the best. */ 711 #define EH_RETURN_DATA_REGNO(N) \ 712 (IN_RANGE ((N), 0, 3) ? (CRIS_FIRST_ARG_REG + 3 - (N)) : INVALID_REGNUM) 713 714 /* Store the stack adjustment in the structure-return-address register. */ 715 #define CRIS_STACKADJ_REG CRIS_STRUCT_VALUE_REGNUM 716 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (SImode, CRIS_STACKADJ_REG) 717 718 #define EH_RETURN_HANDLER_RTX \ 719 cris_return_addr_rtx (0, NULL) 720 721 #define INIT_EXPANDERS cris_init_expanders () 722 723 /* FIXME: Move this to right node (it's not documented properly yet). */ 724 #define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (CRIS_SRP_REGNUM) 725 726 /* FIXME: Move this to right node (it's not documented properly yet). 727 FIXME: Check what alignment we can assume regarding 728 TARGET_STACK_ALIGN and TARGET_ALIGN_BY_32. */ 729 #define DWARF_CIE_DATA_ALIGNMENT -1 730 731 /* If we would ever need an exact mapping between canonical register 732 number and dwarf frame register, we would either need to include all 733 registers in the gcc description (with some marked fixed of course), or 734 an inverse mapping from dwarf register to gcc register. There is one 735 need in dwarf2out.c:expand_builtin_init_dwarf_reg_sizes. Right now, I 736 don't see that we need exact correspondence between DWARF *frame* 737 registers and DBX_REGISTER_NUMBER, so map them onto GCC registers. */ 738 #define DWARF_FRAME_REGNUM(REG) (REG) 739 740 /* Node: Stack Checking */ 741 /* (no definitions) FIXME: Check. */ 742 743 /* Node: Frame Registers */ 744 745 #define STACK_POINTER_REGNUM CRIS_SP_REGNUM 746 747 /* Register used for frame pointer. This is also the last of the saved 748 registers, when a frame pointer is not used. */ 749 #define FRAME_POINTER_REGNUM CRIS_FP_REGNUM 750 751 /* Faked register, is always eliminated. We need it to eliminate 752 allocating stack slots for the return address and the frame pointer. */ 753 #define ARG_POINTER_REGNUM CRIS_AP_REGNUM 754 755 #define STATIC_CHAIN_REGNUM CRIS_STATIC_CHAIN_REGNUM 756 757 758 /* Node: Elimination */ 759 760 /* Really only needed if the stack frame has variable length (alloca 761 or variable sized local arguments (GNU C extension). */ 762 #define FRAME_POINTER_REQUIRED 0 763 764 #define ELIMINABLE_REGS \ 765 {{ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \ 766 {ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \ 767 {FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}} 768 769 /* We need not worry about when the frame-pointer is required for other 770 reasons. */ 771 #define CAN_ELIMINATE(FROM, TO) 1 772 773 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \ 774 (OFFSET) = cris_initial_elimination_offset (FROM, TO) 775 776 777 /* Node: Stack Arguments */ 778 779 /* Since many parameters take up one register each in any case, 780 defining TARGET_PROMOTE_PROTOTYPES that always returns true would 781 seem like a good idea, but measurements indicate that a combination 782 using PROMOTE_MODE is better. */ 783 784 #define ACCUMULATE_OUTGOING_ARGS 1 785 786 #define RETURN_POPS_ARGS(FUNDECL, FUNTYPE, STACKSIZE) 0 787 788 789 /* Node: Register Arguments */ 790 791 /* The void_type_node is sent as a "closing" call. */ 792 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \ 793 ((CUM).regs < CRIS_MAX_ARGS_IN_REGS \ 794 ? gen_rtx_REG (MODE, (CRIS_FIRST_ARG_REG) + (CUM).regs) \ 795 : NULL_RTX) 796 797 /* The differences between this and the previous, is that this one checks 798 that an argument is named, since incoming stdarg/varargs arguments are 799 pushed onto the stack, and we don't have to check against the "closing" 800 void_type_node TYPE parameter. */ 801 #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \ 802 ((NAMED) && (CUM).regs < CRIS_MAX_ARGS_IN_REGS \ 803 ? gen_rtx_REG (MODE, CRIS_FIRST_ARG_REG + (CUM).regs) \ 804 : NULL_RTX) 805 806 /* Contrary to what you'd believe, defining FUNCTION_ARG_CALLEE_COPIES 807 seems like a (small total) loss, at least for gcc-2.7.2 compiling and 808 running gcc-2.1 (small win in size, small loss running -- 100.1%), 809 and similarly for size for products (.1 .. .3% bloat, sometimes win). 810 Due to the empirical likeliness of making slower code, it is not 811 defined. */ 812 813 /* This no longer *needs* to be a structure; but keeping it as such should 814 not hurt (and hacking the ABI is simpler). */ 815 #define CUMULATIVE_ARGS struct cum_args 816 struct cum_args {int regs;}; 817 818 /* The regs member is an integer, the number of arguments got into 819 registers so far. */ 820 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \ 821 ((CUM).regs = 0) 822 823 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \ 824 ((CUM).regs += (3 + CRIS_FUNCTION_ARG_SIZE (MODE, TYPE)) / 4) 825 826 #define FUNCTION_ARG_REGNO_P(REGNO) \ 827 ((REGNO) >= CRIS_FIRST_ARG_REG \ 828 && (REGNO) < CRIS_FIRST_ARG_REG + (CRIS_MAX_ARGS_IN_REGS)) 829 830 831 /* Node: Scalar Return */ 832 833 /* Let's assume all functions return in r[CRIS_FIRST_ARG_REG] for the 834 time being. */ 835 #define FUNCTION_VALUE(VALTYPE, FUNC) \ 836 gen_rtx_REG (TYPE_MODE (VALTYPE), CRIS_FIRST_ARG_REG) 837 838 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, CRIS_FIRST_ARG_REG) 839 840 #define FUNCTION_VALUE_REGNO_P(N) ((N) == CRIS_FIRST_ARG_REG) 841 842 843 /* Node: Aggregate Return */ 844 845 #if 0 846 /* FIXME: Let's try this some time, so we return structures in registers. 847 We would cast the result of int_size_in_bytes to unsigned, so we will 848 get a huge number for "structures" of variable size (-1). */ 849 #define RETURN_IN_MEMORY(TYPE) \ 850 ((unsigned) int_size_in_bytes (TYPE) > CRIS_MAX_ARGS_IN_REGS * UNITS_PER_WORD) 851 #endif 852 853 #define CRIS_STRUCT_VALUE_REGNUM ((CRIS_FIRST_ARG_REG) - 1) 854 855 856 /* Node: Caller Saves */ 857 /* (no definitions) */ 858 859 /* Node: Function entry */ 860 861 /* See cris.c for TARGET_ASM_FUNCTION_PROLOGUE and 862 TARGET_ASM_FUNCTION_EPILOGUE. */ 863 864 /* Node: Profiling */ 865 866 #define FUNCTION_PROFILER(FILE, LABELNO) \ 867 error ("no FUNCTION_PROFILER for CRIS") 868 869 /* FIXME: Some of the undefined macros might be mandatory. If so, fix 870 documentation. */ 871 872 873 /* Node: Trampolines */ 874 875 /* This looks too complicated, and it is. I assigned r7 to be the 876 static chain register, but it is call-saved, so we have to save it, 877 and come back to restore it after the call, so we have to save srp... 878 Anyway, trampolines are rare enough that we can cope with this 879 somewhat lack of elegance. 880 (Do not be tempted to "straighten up" whitespace in the asms; the 881 assembler #NO_APP state mandates strict spacing). */ 882 #define TRAMPOLINE_TEMPLATE(FILE) \ 883 do \ 884 { \ 885 fprintf (FILE, "\tmove.d $%s,[$pc+20]\n", \ 886 reg_names[STATIC_CHAIN_REGNUM]); \ 887 fprintf (FILE, "\tmove $srp,[$pc+22]\n"); \ 888 fprintf (FILE, "\tmove.d 0,$%s\n", \ 889 reg_names[STATIC_CHAIN_REGNUM]); \ 890 fprintf (FILE, "\tjsr 0\n"); \ 891 fprintf (FILE, "\tmove.d 0,$%s\n", \ 892 reg_names[STATIC_CHAIN_REGNUM]); \ 893 fprintf (FILE, "\tjump 0\n"); \ 894 } \ 895 while (0) 896 897 #define TRAMPOLINE_SIZE 32 898 899 /* CRIS wants instructions on word-boundary. 900 Note that due to a bug (reported) in 2.7.2 and earlier, this is 901 actually treated as alignment in _bytes_, not _bits_. (Obviously 902 this is not fatal, only a slight waste of stack space). */ 903 #define TRAMPOLINE_ALIGNMENT 16 904 905 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \ 906 do \ 907 { \ 908 emit_move_insn (gen_rtx_MEM (SImode, \ 909 plus_constant (TRAMP, 10)), \ 910 CXT); \ 911 emit_move_insn (gen_rtx_MEM (SImode, \ 912 plus_constant (TRAMP, 16)), \ 913 FNADDR); \ 914 } \ 915 while (0) 916 917 /* Note that there is no need to do anything with the cache for sake of 918 a trampoline. */ 919 920 921 /* Node: Library Calls */ 922 923 /* If you change this, you have to check whatever libraries and systems 924 that use it. */ 925 #define TARGET_EDOM 33 926 927 928 /* Node: Addressing Modes */ 929 930 #define HAVE_POST_INCREMENT 1 931 932 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X) 933 934 #define MAX_REGS_PER_ADDRESS 2 935 936 /* There are helper macros defined here which are used only in 937 GO_IF_LEGITIMATE_ADDRESS. 938 939 Note that you *have to* reject invalid addressing modes for mode 940 MODE, even if it is legal for normal addressing modes. You cannot 941 rely on the constraints to do this work. They can only be used to 942 doublecheck your intentions. One example is that you HAVE TO reject 943 (mem:DI (plus:SI (reg:SI x) (reg:SI y))) because for some reason 944 this cannot be reloaded. (Which of course you can argue that gcc 945 should have done.) FIXME: Strange. Check. */ 946 947 /* No symbol can be used as an index (or more correct, as a base) together 948 with a register with PIC; the PIC register must be there. */ 949 #define CONSTANT_INDEX_P(X) \ 950 (CONSTANT_P (X) && (!flag_pic || cris_valid_pic_const (X))) 951 952 /* True if X is a valid base register. */ 953 #define BASE_P(X) \ 954 (REG_P (X) && REG_OK_FOR_BASE_P (X)) 955 956 /* True if X is a valid base register with or without autoincrement. */ 957 #define BASE_OR_AUTOINCR_P(X) \ 958 (BASE_P (X) || (GET_CODE (X) == POST_INC && BASE_P (XEXP (X, 0)))) 959 960 /* True if X is a valid (register) index for BDAP, i.e. [Rs].S or [Rs+].S. */ 961 #define BDAP_INDEX_P(X) \ 962 ((GET_CODE (X) == MEM && GET_MODE (X) == SImode \ 963 && BASE_OR_AUTOINCR_P (XEXP (X, 0))) \ 964 || (GET_CODE (X) == SIGN_EXTEND \ 965 && GET_CODE (XEXP (X, 0)) == MEM \ 966 && (GET_MODE (XEXP (X, 0)) == HImode \ 967 || GET_MODE (XEXP (X, 0)) == QImode) \ 968 && BASE_OR_AUTOINCR_P (XEXP (XEXP (X, 0), 0)))) 969 970 /* True if X is a valid (register) index for BIAP, i.e. Rd.m. */ 971 #define BIAP_INDEX_P(X) \ 972 ((BASE_P (X) && REG_OK_FOR_INDEX_P (X)) \ 973 || (GET_CODE (X) == MULT \ 974 && BASE_P (XEXP (X, 0)) \ 975 && REG_OK_FOR_INDEX_P (XEXP (X, 0)) \ 976 && GET_CODE (XEXP (X, 1)) == CONST_INT \ 977 && (INTVAL (XEXP (X, 1)) == 2 \ 978 || INTVAL (XEXP (X, 1)) == 4))) 979 980 /* True if X is an address that doesn't need a prefix i.e. [Rs] or [Rs+]. */ 981 #define SIMPLE_ADDRESS_P(X) \ 982 (BASE_P (X) \ 983 || (GET_CODE (X) == POST_INC \ 984 && BASE_P (XEXP (X, 0)))) 985 986 /* A PIC operand looks like a normal symbol here. At output we dress it 987 in "[rPIC+symbol:GOT]" (global symbol) or "rPIC+symbol:GOTOFF" (local 988 symbol) so we exclude all addressing modes where we can't replace a 989 plain "symbol" with that. A global PIC symbol does not fit anywhere 990 here (but is thankfully a general_operand in itself). A local PIC 991 symbol is valid for the plain "symbol + offset" case. */ 992 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \ 993 { \ 994 rtx x1, x2; \ 995 if (SIMPLE_ADDRESS_P (X)) \ 996 goto ADDR; \ 997 if (CONSTANT_INDEX_P (X)) \ 998 goto ADDR; \ 999 /* Indexed? */ \ 1000 if (GET_CODE (X) == PLUS) \ 1001 { \ 1002 x1 = XEXP (X, 0); \ 1003 x2 = XEXP (X, 1); \ 1004 /* BDAP o, Rd. */ \ 1005 if ((BASE_P (x1) && CONSTANT_INDEX_P (x2)) \ 1006 || (BASE_P (x2) && CONSTANT_INDEX_P (x1)) \ 1007 /* BDAP Rs[+], Rd. */ \ 1008 || (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD \ 1009 && ((BASE_P (x1) && BDAP_INDEX_P (x2)) \ 1010 || (BASE_P (x2) && BDAP_INDEX_P (x1)) \ 1011 /* BIAP.m Rs, Rd */ \ 1012 || (BASE_P (x1) && BIAP_INDEX_P (x2)) \ 1013 || (BASE_P (x2) && BIAP_INDEX_P (x1))))) \ 1014 goto ADDR; \ 1015 } \ 1016 else if (GET_CODE (X) == MEM) \ 1017 { \ 1018 /* DIP (Rs). Reject [[reg+]] and [[reg]] for \ 1019 DImode (long long). */ \ 1020 if (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD \ 1021 && (BASE_P (XEXP (X, 0)) \ 1022 || BASE_OR_AUTOINCR_P (XEXP (X, 0)))) \ 1023 goto ADDR; \ 1024 } \ 1025 } 1026 1027 #ifndef REG_OK_STRICT 1028 /* Nonzero if X is a hard reg that can be used as a base reg 1029 or if it is a pseudo reg. */ 1030 # define REG_OK_FOR_BASE_P(X) \ 1031 (REGNO (X) <= CRIS_LAST_GENERAL_REGISTER \ 1032 || REGNO (X) == ARG_POINTER_REGNUM \ 1033 || REGNO (X) >= FIRST_PSEUDO_REGISTER) 1034 #else 1035 /* Nonzero if X is a hard reg that can be used as a base reg. */ 1036 # define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X)) 1037 #endif 1038 1039 #ifndef REG_OK_STRICT 1040 /* Nonzero if X is a hard reg that can be used as an index 1041 or if it is a pseudo reg. */ 1042 # define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_BASE_P (X) 1043 #else 1044 /* Nonzero if X is a hard reg that can be used as an index. */ 1045 # define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X)) 1046 #endif 1047 1048 /* For now, don't do anything. GCC does a good job most often. 1049 1050 Maybe we could do something about gcc:s misbehavior when it 1051 recalculates frame offsets for local variables, from fp+offs to 1052 sp+offs. The resulting address expression gets screwed up 1053 sometimes, but I'm not sure that it may be fixed here, since it is 1054 already split up in several instructions (Is this still true?). 1055 FIXME: Check and adjust for gcc-2.9x. */ 1056 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) {} 1057 1058 /* Fix reloads known to cause suboptimal spilling. */ 1059 #define LEGITIMIZE_RELOAD_ADDRESS(X, MODE, OPNUM, TYPE, INDL, WIN) \ 1060 do \ 1061 { \ 1062 if (cris_reload_address_legitimized (X, MODE, OPNUM, TYPE, INDL)) \ 1063 goto WIN; \ 1064 } \ 1065 while (0) 1066 1067 /* In CRIS, only the postincrement address mode depends thus, 1068 since the increment depends on the size of the operand. */ 1069 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \ 1070 do \ 1071 { \ 1072 if (GET_CODE (ADDR) == POST_INC) \ 1073 goto LABEL; \ 1074 } \ 1075 while (0) 1076 1077 #define LEGITIMATE_CONSTANT_P(X) 1 1078 1079 1080 /* Node: Condition Code */ 1081 1082 #define NOTICE_UPDATE_CC(EXP, INSN) cris_notice_update_cc (EXP, INSN) 1083 1084 /* FIXME: Maybe define CANONICALIZE_COMPARISON later, when playing with 1085 optimizations. It is needed; currently we do this with instruction 1086 patterns and NOTICE_UPDATE_CC. */ 1087 1088 1089 /* Node: Costs */ 1090 1091 /* Can't move to and from a SPECIAL_REGS register, so we have to say 1092 their move cost within that class is higher. How about 7? That's 3 1093 for a move to a GENERAL_REGS register, 3 for the move from the 1094 GENERAL_REGS register, and 1 for the increased register pressure. 1095 Also, it's higher than the memory move cost, which is in order. 1096 We also do this for ALL_REGS, since we don't want that class to be 1097 preferred (even to memory) at all where GENERAL_REGS doesn't fit. 1098 Whenever it's about to be used, it's for SPECIAL_REGS. If we don't 1099 present a higher cost for ALL_REGS than memory, a SPECIAL_REGS may be 1100 used when a GENERAL_REGS should be used, even if there are call-saved 1101 GENERAL_REGS left to allocate. This is because the fall-back when 1102 the most preferred register class isn't available, isn't the next 1103 (or next good) wider register class, but the *most widest* register 1104 class. 1105 Give the cost 3 between a special register and a general register, 1106 because we want constraints verified. */ 1107 1108 #define REGISTER_MOVE_COST(MODE, FROM, TO) \ 1109 ((((FROM) == SPECIAL_REGS || (FROM) == MOF_REGS) \ 1110 && ((TO) == SPECIAL_REGS || (TO) == MOF_REGS)) \ 1111 || (FROM) == ALL_REGS \ 1112 || (TO) == ALL_REGS \ 1113 ? 7 : \ 1114 ((FROM) == SPECIAL_REGS || (FROM) == MOF_REGS \ 1115 || (TO) == SPECIAL_REGS || (TO) == MOF_REGS) \ 1116 ? 3 : 2) 1117 1118 /* This isn't strictly correct for v0..3 in buswidth-8bit mode, but 1119 should suffice. */ 1120 #define MEMORY_MOVE_COST(M, CLASS, IN) \ 1121 (((M) == QImode) ? 4 : ((M) == HImode) ? 4 : 6) 1122 1123 /* Regardless of the presence of delay slots, the default value of 1 for 1124 BRANCH_COST is the best in the range (1, 2, 3), tested with gcc-2.7.2 1125 with testcases ipps and gcc, giving smallest and fastest code. */ 1126 1127 #define SLOW_BYTE_ACCESS 0 1128 1129 /* This is the threshold *below* which inline move sequences of 1130 word-length sizes will be emitted. The "9" will translate to 1131 (9 - 1) * 4 = 32 bytes maximum moved, but using 16 instructions 1132 (8 instruction sequences) or less. */ 1133 #define MOVE_RATIO 9 1134 1135 1136 /* Node: Sections */ 1137 1138 #define TEXT_SECTION_ASM_OP "\t.text" 1139 1140 #define DATA_SECTION_ASM_OP "\t.data" 1141 1142 #define FORCE_EH_FRAME_INFO_IN_DATA_SECTION (! TARGET_ELF) 1143 1144 /* The jump table is immediately connected to the preceding insn. */ 1145 #define JUMP_TABLES_IN_TEXT_SECTION 1 1146 1147 1148 /* Node: PIC */ 1149 1150 /* Helper type. */ 1151 1152 enum cris_pic_symbol_type 1153 { 1154 cris_no_symbol = 0, 1155 cris_got_symbol = 1, 1156 cris_gotrel_symbol = 2, 1157 cris_got_symbol_needing_fixup = 3, 1158 cris_invalid_pic_symbol = 4 1159 }; 1160 1161 #define PIC_OFFSET_TABLE_REGNUM (flag_pic ? CRIS_GOT_REGNUM : INVALID_REGNUM) 1162 1163 #define LEGITIMATE_PIC_OPERAND_P(X) cris_legitimate_pic_operand (X) 1164 1165 1166 /* Node: File Framework */ 1167 1168 /* We don't want an .ident for gcc. To avoid that but still support 1169 #ident, we override ASM_OUTPUT_IDENT and, since the gcc .ident is its 1170 only use besides ASM_OUTPUT_IDENT, undef IDENT_ASM_OP from elfos.h. */ 1171 #undef IDENT_ASM_OP 1172 #undef ASM_OUTPUT_IDENT 1173 #define ASM_OUTPUT_IDENT(FILE, NAME) \ 1174 fprintf (FILE, "%s\"%s\"\n", "\t.ident\t", NAME); 1175 1176 #define ASM_APP_ON "#APP\n" 1177 1178 #define ASM_APP_OFF "#NO_APP\n" 1179 1180 1181 /* Node: Data Output */ 1182 1183 #define OUTPUT_ADDR_CONST_EXTRA(STREAM, X, FAIL) \ 1184 do { if (!cris_output_addr_const_extra (STREAM, X)) goto FAIL; } while (0) 1185 1186 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) (C) == '@' 1187 1188 /* Node: Uninitialized Data */ 1189 1190 /* Remember to round off odd values if we want data alignment, 1191 since we cannot do that with an .align directive. 1192 1193 Using .comm causes the space not to be reserved in .bss, but by 1194 tricks with the symbol type. Not good if other tools than binutils 1195 are used on the object files. Since ".global ... .lcomm ..." works, we 1196 use that. Use .._ALIGNED_COMMON, since gcc whines when we only have 1197 ..._COMMON, and we prefer to whine ourselves; BIGGEST_ALIGNMENT is not 1198 the one to check. This done for a.out only. */ 1199 /* FIXME: I suspect a bug in gcc with alignment. Do not warn until 1200 investigated; it mucks up the testsuite results. */ 1201 #define CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, LOCAL) \ 1202 do \ 1203 { \ 1204 int align_ = (ALIGN) / BITS_PER_UNIT; \ 1205 if (TARGET_DATA_ALIGN && TARGET_ALIGN_BY_32 && align_ < 4) \ 1206 align_ = 4; \ 1207 else if (TARGET_DATA_ALIGN && align_ < 2) \ 1208 align_ = 2; \ 1209 /* FIXME: Do we need this? */ \ 1210 else if (align_ < 1) \ 1211 align_ = 1; \ 1212 \ 1213 if (TARGET_ELF) \ 1214 { \ 1215 if (LOCAL) \ 1216 { \ 1217 fprintf ((FILE), "%s", LOCAL_ASM_OP); \ 1218 assemble_name ((FILE), (NAME)); \ 1219 fprintf ((FILE), "\n"); \ 1220 } \ 1221 fprintf ((FILE), "%s", COMMON_ASM_OP); \ 1222 assemble_name ((FILE), (NAME)); \ 1223 fprintf ((FILE), ",%u,%u\n", (int)(SIZE), align_); \ 1224 } \ 1225 else \ 1226 { \ 1227 /* We can't tell a one-only or weak COMM from a "global \ 1228 COMM" so just make all non-locals weak. */ \ 1229 if (! (LOCAL)) \ 1230 ASM_WEAKEN_LABEL (FILE, NAME); \ 1231 fputs ("\t.lcomm ", (FILE)); \ 1232 assemble_name ((FILE), (NAME)); \ 1233 fprintf ((FILE), ",%u\n", \ 1234 ((int)(SIZE) + (align_ - 1)) & ~(align_ - 1)); \ 1235 } \ 1236 } \ 1237 while (0) 1238 1239 #define ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN) \ 1240 CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, 0) 1241 1242 #undef ASM_OUTPUT_ALIGNED_DECL_LOCAL 1243 #define ASM_OUTPUT_ALIGNED_DECL_LOCAL(FILE, DECL, NAME, SIZE, ALIGN) \ 1244 CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, 1) 1245 1246 /* Node: Label Output */ 1247 1248 /* Globalizing directive for a label. */ 1249 #define GLOBAL_ASM_OP "\t.global " 1250 1251 #define SUPPORTS_WEAK 1 1252 1253 #define ASM_OUTPUT_SYMBOL_REF(STREAM, SYM) \ 1254 cris_asm_output_symbol_ref (STREAM, SYM) 1255 1256 #define ASM_OUTPUT_LABEL_REF(STREAM, BUF) \ 1257 cris_asm_output_label_ref (STREAM, BUF) 1258 1259 /* Remove any previous definition (elfos.h). */ 1260 #undef ASM_GENERATE_INTERNAL_LABEL 1261 #define ASM_GENERATE_INTERNAL_LABEL(LABEL, PREFIX, NUM) \ 1262 sprintf (LABEL, "*%s%s%ld", LOCAL_LABEL_PREFIX, PREFIX, (long) NUM) 1263 1264 /* Node: Initialization */ 1265 /* (no definitions) */ 1266 1267 /* Node: Macros for Initialization */ 1268 /* (no definitions) */ 1269 1270 /* Node: Instruction Output */ 1271 1272 #define REGISTER_NAMES \ 1273 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \ 1274 "r9", "r10", "r11", "r12", "r13", "sp", "pc", "srp", "mof", "faked_ap", "dccr"} 1275 1276 #define ADDITIONAL_REGISTER_NAMES \ 1277 {{"r14", 14}, {"r15", 15}} 1278 1279 #define PRINT_OPERAND(FILE, X, CODE) \ 1280 cris_print_operand (FILE, X, CODE) 1281 1282 /* For delay-slot handling. */ 1283 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \ 1284 ((CODE) == '#' || (CODE) == '!' || (CODE) == ':') 1285 1286 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \ 1287 cris_print_operand_address (FILE, ADDR) 1288 1289 /* Output an empty line to illustrate the presence of the delay slot. */ 1290 #define DBR_OUTPUT_SEQEND(FILE) \ 1291 fprintf (FILE, "\n") 1292 1293 #define LOCAL_LABEL_PREFIX (TARGET_ELF ? "." : "") 1294 1295 /* cppinit.c initializes a const array from this, so it must be constant, 1296 can't have it different based on options. Luckily, the prefix is 1297 always allowed, so let's have it on all GCC-generated code. Note that 1298 we have this verbatim everywhere in the back-end, not using %R or %s or 1299 such. */ 1300 #define REGISTER_PREFIX "$" 1301 1302 /* Remove any previous definition (elfos.h). */ 1303 /* We use -fno-leading-underscore to remove it, when necessary. */ 1304 #undef USER_LABEL_PREFIX 1305 #define USER_LABEL_PREFIX "_" 1306 1307 #define ASM_OUTPUT_REG_PUSH(FILE, REGNO) \ 1308 fprintf (FILE, "\tpush $%s\n", reg_names[REGNO]) 1309 1310 #define ASM_OUTPUT_REG_POP(FILE, REGNO) \ 1311 fprintf (FILE, "\tpop $%s\n", reg_names[REGNO]) 1312 1313 1314 /* Node: Dispatch Tables */ 1315 1316 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \ 1317 asm_fprintf (FILE, "\t.word %LL%d-%LL%d\n", VALUE, REL) 1318 1319 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \ 1320 asm_fprintf (FILE, "\t.dword %LL%d\n", VALUE) 1321 1322 /* Defined to also emit an .align in elfos.h. We don't want that. */ 1323 #undef ASM_OUTPUT_CASE_LABEL 1324 1325 /* Since the "bound" insn loads the comparison value if the compared< 1326 value (register) is out of bounds (0..comparison value-1), we need 1327 to output another case to catch it. 1328 The way to find it is to look for the label_ref at the else-arm inside 1329 the expanded casesi core-insn. 1330 FIXME: Check this construct when changing to new version of gcc. */ 1331 #define ASM_OUTPUT_CASE_END(STREAM, NUM, TABLE) \ 1332 do \ 1333 { \ 1334 asm_fprintf (STREAM, "\t.word %LL%d-%LL%d%s\n", \ 1335 CODE_LABEL_NUMBER \ 1336 (XEXP (XEXP (XEXP \ 1337 (XVECEXP \ 1338 (PATTERN \ 1339 (prev_nonnote_insn \ 1340 (PREV_INSN (TABLE))), \ 1341 0, 0), 1), 2), 0)), \ 1342 NUM, \ 1343 (TARGET_PDEBUG ? "; default" : "")); \ 1344 } \ 1345 while (0) 1346 1347 1348 /* Node: Exception Region Output */ 1349 /* (no definitions) */ 1350 /* FIXME: Fill in with our own optimized layout. */ 1351 1352 /* Node: Alignment Output */ 1353 1354 #define ASM_OUTPUT_ALIGN(FILE, LOG) \ 1355 fprintf (FILE, "\t.align %d\n", (LOG)) 1356 1357 1358 /* Node: All Debuggers */ 1359 1360 #define DBX_REGISTER_NUMBER(REGNO) \ 1361 ((REGNO) == CRIS_SRP_REGNUM ? CRIS_CANONICAL_SRP_REGNUM : \ 1362 (REGNO) == CRIS_MOF_REGNUM ? CRIS_CANONICAL_MOF_REGNUM : \ 1363 (REGNO) == CRIS_CC0_REGNUM ? CRIS_CANONICAL_CC0_REGNUM : \ 1364 (REGNO)) 1365 1366 /* FIXME: Investigate DEBUGGER_AUTO_OFFSET, DEBUGGER_ARG_OFFSET. */ 1367 1368 1369 /* Node: DBX Options */ 1370 1371 /* Is this correct? Check later. */ 1372 #define DBX_NO_XREFS 1373 1374 #define DBX_CONTIN_LENGTH 0 1375 1376 /* FIXME: Is this needed when we have 0 DBX_CONTIN_LENGTH? */ 1377 #define DBX_CONTIN_CHAR '?' 1378 1379 1380 /* Node: DBX Hooks */ 1381 /* (no definitions) */ 1382 1383 /* Node: File names and DBX */ 1384 /* (no definitions) */ 1385 1386 1387 /* Node: SDB and DWARF */ 1388 /* (no definitions) */ 1389 1390 /* Node: Misc */ 1391 1392 /* A combination of the bound (umin) insn together with a 1393 sign-extended add via the table to PC seems optimal. 1394 If the table overflows, the assembler will take care of it. 1395 Theoretically, in extreme cases (uncertain if they occur), an error 1396 will be emitted, so FIXME: Check how large case-tables are emitted, 1397 possible add an option to emit SImode case-tables. */ 1398 #define CASE_VECTOR_MODE HImode 1399 1400 #define CASE_VECTOR_PC_RELATIVE 1 1401 1402 /* FIXME: Investigate CASE_VECTOR_SHORTEN_MODE to make sure HImode is not 1403 used when broken-.word could possibly fail (plus testcase). */ 1404 1405 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC 1406 1407 /* This is the number of bytes that can be moved in one 1408 reasonably fast instruction sequence. For CRIS, this is two 1409 instructions: mem => reg, reg => mem. */ 1410 #define MOVE_MAX 4 1411 1412 /* Maybe SHIFT_COUNT_TRUNCATED is safe to define? FIXME: Check later. */ 1413 1414 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1 1415 1416 #define Pmode SImode 1417 1418 #define FUNCTION_MODE QImode 1419 1420 #define NO_IMPLICIT_EXTERN_C 1421 1422 /* 1423 * Local variables: 1424 * eval: (c-set-style "gnu") 1425 * indent-tabs-mode: t 1426 * End: 1427 */ 1428