Mercurial > hg > CbC > CbC_gcc
annotate gcc/config/mn10300/mn10300.h @ 55:77e2b8dfacca gcc-4.4.5
update it from 4.4.3 to 4.5.0
| author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 12 Feb 2010 23:39:51 +0900 |
| parents | a06113de4d67 |
| children | b7f97abdc517 |
| rev | line source |
|---|---|
| 0 | 1 /* Definitions of target machine for GNU compiler. |
| 2 Matsushita MN10300 series | |
| 3 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
4 2007, 2008, 2009 Free Software Foundation, Inc. |
| 0 | 5 Contributed by Jeff Law (law@cygnus.com). |
| 6 | |
| 7 This file is part of GCC. | |
| 8 | |
| 9 GCC is free software; you can redistribute it and/or modify | |
| 10 it under the terms of the GNU General Public License as published by | |
| 11 the Free Software Foundation; either version 3, or (at your option) | |
| 12 any later version. | |
| 13 | |
| 14 GCC is distributed in the hope that it will be useful, | |
| 15 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 17 GNU General Public License for more details. | |
| 18 | |
| 19 You should have received a copy of the GNU General Public License | |
| 20 along with GCC; see the file COPYING3. If not see | |
| 21 <http://www.gnu.org/licenses/>. */ | |
| 22 | |
| 23 | |
| 24 #undef ASM_SPEC | |
| 25 #undef LIB_SPEC | |
| 26 #undef ENDFILE_SPEC | |
| 27 #undef LINK_SPEC | |
| 28 #define LINK_SPEC "%{mrelax:--relax}" | |
| 29 #undef STARTFILE_SPEC | |
| 30 #define STARTFILE_SPEC "%{!mno-crt0:%{!shared:%{pg:gcrt0%O%s}%{!pg:%{p:mcrt0%O%s}%{!p:crt0%O%s}}}}" | |
| 31 | |
| 32 /* Names to predefine in the preprocessor for this target machine. */ | |
| 33 | |
| 34 #define TARGET_CPU_CPP_BUILTINS() \ | |
| 35 do \ | |
| 36 { \ | |
| 37 builtin_define ("__mn10300__"); \ | |
| 38 builtin_define ("__MN10300__"); \ | |
| 39 builtin_assert ("cpu=mn10300"); \ | |
| 40 builtin_assert ("machine=mn10300"); \ | |
| 41 } \ | |
| 42 while (0) | |
| 43 | |
| 44 #define CPP_SPEC "%{mam33:-D__AM33__} %{mam33-2:-D__AM33__=2 -D__AM33_2__}" | |
| 45 | |
| 46 extern GTY(()) int mn10300_unspec_int_label_counter; | |
| 47 | |
| 48 enum processor_type { | |
| 49 PROCESSOR_MN10300, | |
| 50 PROCESSOR_AM33, | |
| 51 PROCESSOR_AM33_2 | |
| 52 }; | |
| 53 | |
| 54 extern enum processor_type mn10300_processor; | |
| 55 | |
| 56 #define TARGET_AM33 (mn10300_processor >= PROCESSOR_AM33) | |
| 57 #define TARGET_AM33_2 (mn10300_processor == PROCESSOR_AM33_2) | |
| 58 | |
| 59 #ifndef PROCESSOR_DEFAULT | |
| 60 #define PROCESSOR_DEFAULT PROCESSOR_MN10300 | |
| 61 #endif | |
| 62 | |
| 63 #define OVERRIDE_OPTIONS mn10300_override_options () | |
| 64 | |
| 65 /* Print subsidiary information on the compiler version in use. */ | |
| 66 | |
| 67 #define TARGET_VERSION fprintf (stderr, " (MN10300)"); | |
| 68 | |
| 69 | |
| 70 /* Target machine storage layout */ | |
| 71 | |
| 72 /* Define this if most significant bit is lowest numbered | |
| 73 in instructions that operate on numbered bit-fields. | |
| 74 This is not true on the Matsushita MN1003. */ | |
| 75 #define BITS_BIG_ENDIAN 0 | |
| 76 | |
| 77 /* Define this if most significant byte of a word is the lowest numbered. */ | |
| 78 /* This is not true on the Matsushita MN10300. */ | |
| 79 #define BYTES_BIG_ENDIAN 0 | |
| 80 | |
| 81 /* Define this if most significant word of a multiword number is lowest | |
| 82 numbered. | |
| 83 This is not true on the Matsushita MN10300. */ | |
| 84 #define WORDS_BIG_ENDIAN 0 | |
| 85 | |
| 86 /* Width of a word, in units (bytes). */ | |
| 87 #define UNITS_PER_WORD 4 | |
| 88 | |
| 89 /* Allocation boundary (in *bits*) for storing arguments in argument list. */ | |
| 90 #define PARM_BOUNDARY 32 | |
| 91 | |
| 92 /* The stack goes in 32-bit lumps. */ | |
| 93 #define STACK_BOUNDARY 32 | |
| 94 | |
| 95 /* Allocation boundary (in *bits*) for the code of a function. | |
| 96 8 is the minimum boundary; it's unclear if bigger alignments | |
| 97 would improve performance. */ | |
| 98 #define FUNCTION_BOUNDARY 8 | |
| 99 | |
| 100 /* No data type wants to be aligned rounder than this. */ | |
| 101 #define BIGGEST_ALIGNMENT 32 | |
| 102 | |
| 103 /* Alignment of field after `int : 0' in a structure. */ | |
| 104 #define EMPTY_FIELD_BOUNDARY 32 | |
| 105 | |
| 106 /* Define this if move instructions will actually fail to work | |
| 107 when given unaligned data. */ | |
| 108 #define STRICT_ALIGNMENT 1 | |
| 109 | |
| 110 /* Define this as 1 if `char' should by default be signed; else as 0. */ | |
| 111 #define DEFAULT_SIGNED_CHAR 0 | |
| 112 | |
| 113 /* Standard register usage. */ | |
| 114 | |
| 115 /* Number of actual hardware registers. | |
| 116 The hardware registers are assigned numbers for the compiler | |
| 117 from 0 to just below FIRST_PSEUDO_REGISTER. | |
| 118 | |
| 119 All registers that the compiler knows about must be given numbers, | |
| 120 even those that are not normally considered general registers. */ | |
| 121 | |
| 122 #define FIRST_PSEUDO_REGISTER 50 | |
| 123 | |
| 124 /* Specify machine-specific register numbers. */ | |
| 125 #define FIRST_DATA_REGNUM 0 | |
| 126 #define LAST_DATA_REGNUM 3 | |
| 127 #define FIRST_ADDRESS_REGNUM 4 | |
| 128 #define LAST_ADDRESS_REGNUM 8 | |
| 129 #define FIRST_EXTENDED_REGNUM 10 | |
| 130 #define LAST_EXTENDED_REGNUM 17 | |
| 131 #define FIRST_FP_REGNUM 18 | |
| 132 #define LAST_FP_REGNUM 49 | |
| 133 | |
| 134 /* Specify the registers used for certain standard purposes. | |
| 135 The values of these macros are register numbers. */ | |
| 136 | |
| 137 /* Register to use for pushing function arguments. */ | |
| 138 #define STACK_POINTER_REGNUM (LAST_ADDRESS_REGNUM+1) | |
| 139 | |
| 140 /* Base register for access to local variables of the function. */ | |
| 141 #define FRAME_POINTER_REGNUM (LAST_ADDRESS_REGNUM-1) | |
| 142 | |
| 143 /* Base register for access to arguments of the function. This | |
| 144 is a fake register and will be eliminated into either the frame | |
| 145 pointer or stack pointer. */ | |
| 146 #define ARG_POINTER_REGNUM LAST_ADDRESS_REGNUM | |
| 147 | |
| 148 /* Register in which static-chain is passed to a function. */ | |
| 149 #define STATIC_CHAIN_REGNUM (FIRST_ADDRESS_REGNUM+1) | |
| 150 | |
| 151 /* 1 for registers that have pervasive standard uses | |
| 152 and are not available for the register allocator. */ | |
| 153 | |
| 154 #define FIXED_REGISTERS \ | |
| 155 { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0 \ | |
| 156 , 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 \ | |
| 157 , 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 \ | |
| 158 } | |
| 159 | |
| 160 /* 1 for registers not available across function calls. | |
| 161 These must include the FIXED_REGISTERS and also any | |
| 162 registers that can be used without being saved. | |
| 163 The latter must include the registers where values are returned | |
| 164 and the register where structure-value addresses are passed. | |
| 165 Aside from that, you can include as many other registers as you | |
| 166 like. */ | |
| 167 | |
| 168 #define CALL_USED_REGISTERS \ | |
| 169 { 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0 \ | |
| 170 , 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 \ | |
| 171 , 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 \ | |
| 172 } | |
| 173 | |
| 174 /* Note: The definition of CALL_REALLY_USED_REGISTERS is not | |
| 175 redundant. It is needed when compiling in PIC mode because | |
| 176 the a2 register becomes fixed (and hence must be marked as | |
| 177 call_used) but in order to preserve the ABI it is not marked | |
| 178 as call_really_used. */ | |
| 179 #define CALL_REALLY_USED_REGISTERS CALL_USED_REGISTERS | |
| 180 | |
| 181 #define REG_ALLOC_ORDER \ | |
| 182 { 0, 1, 4, 5, 2, 3, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 8, 9 \ | |
| 183 , 42, 43, 44, 45, 46, 47, 48, 49, 34, 35, 36, 37, 38, 39, 40, 41 \ | |
| 184 , 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33 \ | |
| 185 } | |
| 186 | |
| 187 #define CONDITIONAL_REGISTER_USAGE \ | |
| 188 { \ | |
| 189 unsigned int i; \ | |
| 190 \ | |
| 191 if (!TARGET_AM33) \ | |
| 192 { \ | |
| 193 for (i = FIRST_EXTENDED_REGNUM; \ | |
| 194 i <= LAST_EXTENDED_REGNUM; i++) \ | |
| 195 fixed_regs[i] = call_used_regs[i] = 1; \ | |
| 196 } \ | |
| 197 if (!TARGET_AM33_2) \ | |
| 198 { \ | |
| 199 for (i = FIRST_FP_REGNUM; \ | |
| 200 i <= LAST_FP_REGNUM; \ | |
| 201 i++) \ | |
| 202 fixed_regs[i] = call_used_regs[i] = 1; \ | |
| 203 } \ | |
| 204 if (flag_pic) \ | |
| 205 fixed_regs[PIC_OFFSET_TABLE_REGNUM] = \ | |
| 206 call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1;\ | |
| 207 } | |
| 208 | |
| 209 /* Return number of consecutive hard regs needed starting at reg REGNO | |
| 210 to hold something of mode MODE. | |
| 211 | |
| 212 This is ordinarily the length in words of a value of mode MODE | |
| 213 but can be less for certain modes in special long registers. */ | |
| 214 | |
| 215 #define HARD_REGNO_NREGS(REGNO, MODE) \ | |
| 216 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD) | |
| 217 | |
| 218 /* Value is 1 if hard register REGNO can hold a value of machine-mode | |
| 219 MODE. */ | |
| 220 | |
| 221 #define HARD_REGNO_MODE_OK(REGNO, MODE) \ | |
| 222 ((REGNO_REG_CLASS (REGNO) == DATA_REGS \ | |
| 223 || (TARGET_AM33 && REGNO_REG_CLASS (REGNO) == ADDRESS_REGS) \ | |
| 224 || REGNO_REG_CLASS (REGNO) == EXTENDED_REGS) \ | |
| 225 ? ((REGNO) & 1) == 0 || GET_MODE_SIZE (MODE) <= 4 \ | |
| 226 : ((REGNO) & 1) == 0 || GET_MODE_SIZE (MODE) == 4) | |
| 227 | |
| 228 /* Value is 1 if it is a good idea to tie two pseudo registers | |
| 229 when one has mode MODE1 and one has mode MODE2. | |
| 230 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2, | |
| 231 for any hard reg, then this must be 0 for correct output. */ | |
| 232 #define MODES_TIEABLE_P(MODE1, MODE2) \ | |
| 233 (TARGET_AM33 \ | |
| 234 || MODE1 == MODE2 \ | |
| 235 || (GET_MODE_SIZE (MODE1) <= 4 && GET_MODE_SIZE (MODE2) <= 4)) | |
| 236 | |
| 237 /* 4 data, and effectively 3 address registers is small as far as I'm | |
| 238 concerned. */ | |
| 239 #define SMALL_REGISTER_CLASSES 1 | |
| 240 | |
| 241 /* Define the classes of registers for register constraints in the | |
| 242 machine description. Also define ranges of constants. | |
| 243 | |
| 244 One of the classes must always be named ALL_REGS and include all hard regs. | |
| 245 If there is more than one class, another class must be named NO_REGS | |
| 246 and contain no registers. | |
| 247 | |
| 248 The name GENERAL_REGS must be the name of a class (or an alias for | |
| 249 another name such as ALL_REGS). This is the class of registers | |
| 250 that is allowed by "g" or "r" in a register constraint. | |
| 251 Also, registers outside this class are allocated only when | |
| 252 instructions express preferences for them. | |
| 253 | |
| 254 The classes must be numbered in nondecreasing order; that is, | |
| 255 a larger-numbered class must never be contained completely | |
| 256 in a smaller-numbered class. | |
| 257 | |
| 258 For any two classes, it is very desirable that there be another | |
| 259 class that represents their union. */ | |
| 260 | |
| 261 enum reg_class { | |
| 262 NO_REGS, DATA_REGS, ADDRESS_REGS, SP_REGS, | |
| 263 DATA_OR_ADDRESS_REGS, SP_OR_ADDRESS_REGS, | |
| 264 EXTENDED_REGS, DATA_OR_EXTENDED_REGS, ADDRESS_OR_EXTENDED_REGS, | |
| 265 SP_OR_EXTENDED_REGS, SP_OR_ADDRESS_OR_EXTENDED_REGS, | |
| 266 FP_REGS, FP_ACC_REGS, | |
| 267 GENERAL_REGS, ALL_REGS, LIM_REG_CLASSES | |
| 268 }; | |
| 269 | |
| 270 #define N_REG_CLASSES (int) LIM_REG_CLASSES | |
| 271 | |
| 272 /* Give names of register classes as strings for dump file. */ | |
| 273 | |
| 274 #define REG_CLASS_NAMES \ | |
| 275 { "NO_REGS", "DATA_REGS", "ADDRESS_REGS", \ | |
| 276 "SP_REGS", "DATA_OR_ADDRESS_REGS", "SP_OR_ADDRESS_REGS", \ | |
| 277 "EXTENDED_REGS", \ | |
| 278 "DATA_OR_EXTENDED_REGS", "ADDRESS_OR_EXTENDED_REGS", \ | |
| 279 "SP_OR_EXTENDED_REGS", "SP_OR_ADDRESS_OR_EXTENDED_REGS", \ | |
| 280 "FP_REGS", "FP_ACC_REGS", \ | |
| 281 "GENERAL_REGS", "ALL_REGS", "LIM_REGS" } | |
| 282 | |
| 283 /* Define which registers fit in which classes. | |
| 284 This is an initializer for a vector of HARD_REG_SET | |
| 285 of length N_REG_CLASSES. */ | |
| 286 | |
| 287 #define REG_CLASS_CONTENTS \ | |
| 288 { { 0, 0 }, /* No regs */ \ | |
| 289 { 0x0000f, 0 }, /* DATA_REGS */ \ | |
| 290 { 0x001f0, 0 }, /* ADDRESS_REGS */ \ | |
| 291 { 0x00200, 0 }, /* SP_REGS */ \ | |
| 292 { 0x001ff, 0 }, /* DATA_OR_ADDRESS_REGS */\ | |
| 293 { 0x003f0, 0 }, /* SP_OR_ADDRESS_REGS */\ | |
| 294 { 0x3fc00, 0 }, /* EXTENDED_REGS */ \ | |
| 295 { 0x3fc0f, 0 }, /* DATA_OR_EXTENDED_REGS */ \ | |
| 296 { 0x3fdf0, 0 }, /* ADDRESS_OR_EXTENDED_REGS */ \ | |
| 297 { 0x3fe00, 0 }, /* SP_OR_EXTENDED_REGS */ \ | |
| 298 { 0x3fff0, 0 }, /* SP_OR_ADDRESS_OR_EXTENDED_REGS */ \ | |
| 299 { 0xfffc0000, 0x3ffff }, /* FP_REGS */ \ | |
| 300 { 0x03fc0000, 0 }, /* FP_ACC_REGS */ \ | |
| 301 { 0x3fdff, 0 }, /* GENERAL_REGS */ \ | |
| 302 { 0xffffffff, 0x3ffff } /* ALL_REGS */ \ | |
| 303 } | |
| 304 | |
| 305 /* The following macro defines cover classes for Integrated Register | |
| 306 Allocator. Cover classes is a set of non-intersected register | |
| 307 classes covering all hard registers used for register allocation | |
| 308 purpose. Any move between two registers of a cover class should be | |
| 309 cheaper than load or store of the registers. The macro value is | |
| 310 array of register classes with LIM_REG_CLASSES used as the end | |
| 311 marker. */ | |
| 312 | |
| 313 #define IRA_COVER_CLASSES \ | |
| 314 { \ | |
| 315 GENERAL_REGS, FP_REGS, LIM_REG_CLASSES \ | |
| 316 } | |
| 317 | |
| 318 /* The same information, inverted: | |
| 319 Return the class number of the smallest class containing | |
| 320 reg number REGNO. This could be a conditional expression | |
| 321 or could index an array. */ | |
| 322 | |
| 323 #define REGNO_REG_CLASS(REGNO) \ | |
| 324 ((REGNO) <= LAST_DATA_REGNUM ? DATA_REGS : \ | |
| 325 (REGNO) <= LAST_ADDRESS_REGNUM ? ADDRESS_REGS : \ | |
| 326 (REGNO) == STACK_POINTER_REGNUM ? SP_REGS : \ | |
| 327 (REGNO) <= LAST_EXTENDED_REGNUM ? EXTENDED_REGS : \ | |
| 328 (REGNO) <= LAST_FP_REGNUM ? FP_REGS : \ | |
| 329 NO_REGS) | |
| 330 | |
| 331 /* The class value for index registers, and the one for base regs. */ | |
| 332 #define INDEX_REG_CLASS DATA_OR_EXTENDED_REGS | |
| 333 #define BASE_REG_CLASS SP_OR_ADDRESS_REGS | |
| 334 | |
| 335 /* Macros to check register numbers against specific register classes. */ | |
| 336 | |
| 337 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx | |
| 338 and check its validity for a certain class. | |
| 339 We have two alternate definitions for each of them. | |
| 340 The usual definition accepts all pseudo regs; the other rejects | |
| 341 them unless they have been allocated suitable hard regs. | |
| 342 The symbol REG_OK_STRICT causes the latter definition to be used. | |
| 343 | |
| 344 Most source files want to accept pseudo regs in the hope that | |
| 345 they will get allocated to the class that the insn wants them to be in. | |
| 346 Source files for reload pass need to be strict. | |
| 347 After reload, it makes no difference, since pseudo regs have | |
| 348 been eliminated by then. */ | |
| 349 | |
| 350 /* These assume that REGNO is a hard or pseudo reg number. | |
| 351 They give nonzero only if REGNO is a hard reg of the suitable class | |
| 352 or a pseudo reg currently allocated to a suitable hard reg. | |
| 353 Since they use reg_renumber, they are safe only once reg_renumber | |
| 354 has been allocated, which happens in local-alloc.c. */ | |
| 355 | |
| 356 #ifndef REG_OK_STRICT | |
| 357 # define REG_STRICT 0 | |
| 358 #else | |
| 359 # define REG_STRICT 1 | |
| 360 #endif | |
| 361 | |
| 362 # define REGNO_IN_RANGE_P(regno,min,max,strict) \ | |
| 363 (IN_RANGE ((regno), (min), (max)) \ | |
| 364 || ((strict) \ | |
| 365 ? (reg_renumber \ | |
| 366 && reg_renumber[(regno)] >= (min) \ | |
| 367 && reg_renumber[(regno)] <= (max)) \ | |
| 368 : (regno) >= FIRST_PSEUDO_REGISTER)) | |
| 369 | |
| 370 #define REGNO_DATA_P(regno, strict) \ | |
| 371 (REGNO_IN_RANGE_P ((regno), FIRST_DATA_REGNUM, LAST_DATA_REGNUM, \ | |
| 372 (strict))) | |
| 373 #define REGNO_ADDRESS_P(regno, strict) \ | |
| 374 (REGNO_IN_RANGE_P ((regno), FIRST_ADDRESS_REGNUM, LAST_ADDRESS_REGNUM, \ | |
| 375 (strict))) | |
| 376 #define REGNO_SP_P(regno, strict) \ | |
| 377 (REGNO_IN_RANGE_P ((regno), STACK_POINTER_REGNUM, STACK_POINTER_REGNUM, \ | |
| 378 (strict))) | |
| 379 #define REGNO_EXTENDED_P(regno, strict) \ | |
| 380 (REGNO_IN_RANGE_P ((regno), FIRST_EXTENDED_REGNUM, LAST_EXTENDED_REGNUM, \ | |
| 381 (strict))) | |
| 382 #define REGNO_AM33_P(regno, strict) \ | |
| 383 (REGNO_DATA_P ((regno), (strict)) || REGNO_ADDRESS_P ((regno), (strict)) \ | |
| 384 || REGNO_EXTENDED_P ((regno), (strict))) | |
| 385 #define REGNO_FP_P(regno, strict) \ | |
| 386 (REGNO_IN_RANGE_P ((regno), FIRST_FP_REGNUM, LAST_FP_REGNUM, (strict))) | |
| 387 | |
| 388 #define REGNO_STRICT_OK_FOR_BASE_P(regno, strict) \ | |
| 389 (REGNO_SP_P ((regno), (strict)) \ | |
| 390 || REGNO_ADDRESS_P ((regno), (strict)) \ | |
| 391 || REGNO_EXTENDED_P ((regno), (strict))) | |
| 392 #define REGNO_OK_FOR_BASE_P(regno) \ | |
| 393 (REGNO_STRICT_OK_FOR_BASE_P ((regno), REG_STRICT)) | |
| 394 #define REG_OK_FOR_BASE_P(X) \ | |
| 395 (REGNO_OK_FOR_BASE_P (REGNO (X))) | |
| 396 | |
| 397 #define REGNO_STRICT_OK_FOR_BIT_BASE_P(regno, strict) \ | |
| 398 (REGNO_SP_P ((regno), (strict)) || REGNO_ADDRESS_P ((regno), (strict))) | |
| 399 #define REGNO_OK_FOR_BIT_BASE_P(regno) \ | |
| 400 (REGNO_STRICT_OK_FOR_BIT_BASE_P ((regno), REG_STRICT)) | |
| 401 #define REG_OK_FOR_BIT_BASE_P(X) \ | |
| 402 (REGNO_OK_FOR_BIT_BASE_P (REGNO (X))) | |
| 403 | |
| 404 #define REGNO_STRICT_OK_FOR_INDEX_P(regno, strict) \ | |
| 405 (REGNO_DATA_P ((regno), (strict)) || REGNO_EXTENDED_P ((regno), (strict))) | |
| 406 #define REGNO_OK_FOR_INDEX_P(regno) \ | |
| 407 (REGNO_STRICT_OK_FOR_INDEX_P ((regno), REG_STRICT)) | |
| 408 #define REG_OK_FOR_INDEX_P(X) \ | |
| 409 (REGNO_OK_FOR_INDEX_P (REGNO (X))) | |
| 410 | |
| 411 /* Given an rtx X being reloaded into a reg required to be | |
| 412 in class CLASS, return the class of reg to actually use. | |
| 413 In general this is just CLASS; but on some machines | |
| 414 in some cases it is preferable to use a more restrictive class. */ | |
| 415 | |
| 416 #define PREFERRED_RELOAD_CLASS(X,CLASS) \ | |
| 417 ((X) == stack_pointer_rtx && (CLASS) != SP_REGS \ | |
| 418 ? ADDRESS_OR_EXTENDED_REGS \ | |
| 419 : (GET_CODE (X) == MEM \ | |
| 420 || (GET_CODE (X) == REG \ | |
| 421 && REGNO (X) >= FIRST_PSEUDO_REGISTER) \ | |
| 422 || (GET_CODE (X) == SUBREG \ | |
| 423 && GET_CODE (SUBREG_REG (X)) == REG \ | |
| 424 && REGNO (SUBREG_REG (X)) >= FIRST_PSEUDO_REGISTER) \ | |
| 425 ? LIMIT_RELOAD_CLASS (GET_MODE (X), CLASS) \ | |
| 426 : (CLASS))) | |
| 427 | |
| 428 #define PREFERRED_OUTPUT_RELOAD_CLASS(X,CLASS) \ | |
| 429 (X == stack_pointer_rtx && CLASS != SP_REGS \ | |
| 430 ? ADDRESS_OR_EXTENDED_REGS : CLASS) | |
| 431 | |
| 432 #define LIMIT_RELOAD_CLASS(MODE, CLASS) \ | |
| 433 (!TARGET_AM33 && (MODE == QImode || MODE == HImode) ? DATA_REGS : CLASS) | |
| 434 | |
| 435 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \ | |
| 436 mn10300_secondary_reload_class(CLASS,MODE,IN) | |
| 437 | |
| 438 /* Return the maximum number of consecutive registers | |
| 439 needed to represent mode MODE in a register of class CLASS. */ | |
| 440 | |
| 441 #define CLASS_MAX_NREGS(CLASS, MODE) \ | |
| 442 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD) | |
| 443 | |
| 444 /* A class that contains registers which the compiler must always | |
| 445 access in a mode that is the same size as the mode in which it | |
| 446 loaded the register. */ | |
| 447 #define CLASS_CANNOT_CHANGE_SIZE FP_REGS | |
| 448 | |
| 449 /* Return 1 if VALUE is in the range specified. */ | |
| 450 | |
| 451 #define INT_8_BITS(VALUE) ((unsigned) (VALUE) + 0x80 < 0x100) | |
| 452 #define INT_16_BITS(VALUE) ((unsigned) (VALUE) + 0x8000 < 0x10000) | |
| 453 | |
| 454 | |
| 455 /* Stack layout; function entry, exit and calling. */ | |
| 456 | |
| 457 /* Define this if pushing a word on the stack | |
| 458 makes the stack pointer a smaller address. */ | |
| 459 | |
| 460 #define STACK_GROWS_DOWNWARD | |
| 461 | |
| 462 /* Define this to nonzero if the nominal address of the stack frame | |
| 463 is at the high-address end of the local variables; | |
| 464 that is, each additional local variable allocated | |
| 465 goes at a more negative offset in the frame. */ | |
| 466 | |
| 467 #define FRAME_GROWS_DOWNWARD 1 | |
| 468 | |
| 469 /* Offset within stack frame to start allocating local variables at. | |
| 470 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the | |
| 471 first local allocated. Otherwise, it is the offset to the BEGINNING | |
| 472 of the first local allocated. */ | |
| 473 | |
| 474 #define STARTING_FRAME_OFFSET 0 | |
| 475 | |
| 476 /* Offset of first parameter from the argument pointer register value. */ | |
| 477 /* Is equal to the size of the saved fp + pc, even if an fp isn't | |
| 478 saved since the value is used before we know. */ | |
| 479 | |
| 480 #define FIRST_PARM_OFFSET(FNDECL) 4 | |
| 481 | |
| 482 #define ELIMINABLE_REGS \ | |
| 483 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \ | |
| 484 { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \ | |
| 485 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}} | |
| 486 | |
| 487 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \ | |
| 488 OFFSET = initial_offset (FROM, TO) | |
| 489 | |
| 490 /* We can debug without frame pointers on the mn10300, so eliminate | |
| 491 them whenever possible. */ | |
| 492 #define CAN_DEBUG_WITHOUT_FP | |
| 493 | |
| 494 /* Value is the number of bytes of arguments automatically | |
| 495 popped when returning from a subroutine call. | |
| 496 FUNDECL is the declaration node of the function (as a tree), | |
| 497 FUNTYPE is the data type of the function (as a tree), | |
| 498 or for a library call it is an identifier node for the subroutine name. | |
| 499 SIZE is the number of bytes of arguments passed on the stack. */ | |
| 500 | |
| 501 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0 | |
| 502 | |
| 503 /* We use d0/d1 for passing parameters, so allocate 8 bytes of space | |
| 504 for a register flushback area. */ | |
| 505 #define REG_PARM_STACK_SPACE(DECL) 8 | |
| 506 #define OUTGOING_REG_PARM_STACK_SPACE(FNTYPE) 1 | |
| 507 #define ACCUMULATE_OUTGOING_ARGS 1 | |
| 508 | |
| 509 /* So we can allocate space for return pointers once for the function | |
| 510 instead of around every call. */ | |
| 511 #define STACK_POINTER_OFFSET 4 | |
| 512 | |
| 513 /* 1 if N is a possible register number for function argument passing. | |
| 514 On the MN10300, no registers are used in this way. */ | |
| 515 | |
| 516 #define FUNCTION_ARG_REGNO_P(N) ((N) <= 1) | |
| 517 | |
| 518 | |
| 519 /* Define a data type for recording info about an argument list | |
| 520 during the scan of that argument list. This data type should | |
| 521 hold all necessary information about the function itself | |
| 522 and about the args processed so far, enough to enable macros | |
| 523 such as FUNCTION_ARG to determine where the next arg should go. | |
| 524 | |
| 525 On the MN10300, this is a single integer, which is a number of bytes | |
| 526 of arguments scanned so far. */ | |
| 527 | |
| 528 #define CUMULATIVE_ARGS struct cum_arg | |
| 529 struct cum_arg {int nbytes; }; | |
| 530 | |
| 531 /* Initialize a variable CUM of type CUMULATIVE_ARGS | |
| 532 for a call to a function whose data type is FNTYPE. | |
| 533 For a library call, FNTYPE is 0. | |
| 534 | |
| 535 On the MN10300, the offset starts at 0. */ | |
| 536 | |
| 537 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \ | |
| 538 ((CUM).nbytes = 0) | |
| 539 | |
| 540 /* Update the data in CUM to advance over an argument | |
| 541 of mode MODE and data type TYPE. | |
| 542 (TYPE is null for libcalls where that information may not be available.) */ | |
| 543 | |
| 544 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \ | |
| 545 ((CUM).nbytes += ((MODE) != BLKmode \ | |
| 546 ? (GET_MODE_SIZE (MODE) + 3) & ~3 \ | |
| 547 : (int_size_in_bytes (TYPE) + 3) & ~3)) | |
| 548 | |
| 549 /* Define where to put the arguments to a function. | |
| 550 Value is zero to push the argument on the stack, | |
| 551 or a hard register in which to store the argument. | |
| 552 | |
| 553 MODE is the argument's machine mode. | |
| 554 TYPE is the data type of the argument (as a tree). | |
| 555 This is null for libcalls where that information may | |
| 556 not be available. | |
| 557 CUM is a variable of type CUMULATIVE_ARGS which gives info about | |
| 558 the preceding args and about the function being called. | |
| 559 NAMED is nonzero if this argument is a named parameter | |
| 560 (otherwise it is an extra parameter matching an ellipsis). */ | |
| 561 | |
| 562 /* On the MN10300 all args are pushed. */ | |
| 563 | |
| 564 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \ | |
| 565 function_arg (&CUM, MODE, TYPE, NAMED) | |
| 566 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
567 #define FUNCTION_VALUE_REGNO_P(N) mn10300_function_value_regno_p (N) |
| 0 | 568 |
| 569 #define DEFAULT_PCC_STRUCT_RETURN 0 | |
| 570 | |
| 571 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function, | |
| 572 the stack pointer does not matter. The value is tested only in | |
| 573 functions that have frame pointers. | |
| 574 No definition is equivalent to always zero. */ | |
| 575 | |
| 576 #define EXIT_IGNORE_STACK 1 | |
| 577 | |
| 578 /* Output assembler code to FILE to increment profiler label # LABELNO | |
| 579 for profiling a function entry. */ | |
| 580 | |
| 581 #define FUNCTION_PROFILER(FILE, LABELNO) ; | |
| 582 | |
| 583 /* Length in units of the trampoline for entering a nested function. */ | |
| 584 | |
| 585 #define TRAMPOLINE_SIZE 0x1b | |
| 586 | |
| 587 #define TRAMPOLINE_ALIGNMENT 32 | |
| 588 | |
| 589 /* A C expression whose value is RTL representing the value of the return | |
| 590 address for the frame COUNT steps up from the current frame. | |
| 591 | |
| 592 On the mn10300, the return address is not at a constant location | |
| 593 due to the frame layout. Luckily, it is at a constant offset from | |
| 594 the argument pointer, so we define RETURN_ADDR_RTX to return a | |
| 595 MEM using arg_pointer_rtx. Reload will replace arg_pointer_rtx | |
| 596 with a reference to the stack/frame pointer + an appropriate offset. */ | |
| 597 | |
| 598 #define RETURN_ADDR_RTX(COUNT, FRAME) \ | |
| 599 ((COUNT == 0) \ | |
| 600 ? gen_rtx_MEM (Pmode, arg_pointer_rtx) \ | |
| 601 : (rtx) 0) | |
| 602 | |
| 603 /* Maximum number of registers that can appear in a valid memory address. */ | |
| 604 | |
| 605 #define MAX_REGS_PER_ADDRESS 2 | |
| 606 | |
| 607 | |
| 608 #define HAVE_POST_INCREMENT (TARGET_AM33) | |
| 609 | |
| 610 /* Accept either REG or SUBREG where a register is valid. */ | |
| 611 | |
| 612 #define RTX_OK_FOR_BASE_P(X, strict) \ | |
| 613 ((REG_P (X) && REGNO_STRICT_OK_FOR_BASE_P (REGNO (X), \ | |
| 614 (strict))) \ | |
| 615 || (GET_CODE (X) == SUBREG && REG_P (SUBREG_REG (X)) \ | |
| 616 && REGNO_STRICT_OK_FOR_BASE_P (REGNO (SUBREG_REG (X)), \ | |
| 617 (strict)))) | |
| 618 | |
| 619 | |
| 620 | |
| 621 /* Nonzero if the constant value X is a legitimate general operand. | |
| 622 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */ | |
| 623 | |
| 624 #define LEGITIMATE_CONSTANT_P(X) 1 | |
| 625 | |
| 626 /* Zero if this needs fixing up to become PIC. */ | |
| 627 | |
| 628 #define LEGITIMATE_PIC_OPERAND_P(X) (legitimate_pic_operand_p (X)) | |
| 629 | |
| 630 /* Register to hold the addressing base for | |
| 631 position independent code access to data items. */ | |
| 632 #define PIC_OFFSET_TABLE_REGNUM PIC_REG | |
| 633 | |
| 634 /* The name of the pseudo-symbol representing the Global Offset Table. */ | |
| 635 #define GOT_SYMBOL_NAME "*_GLOBAL_OFFSET_TABLE_" | |
| 636 | |
| 637 #define SYMBOLIC_CONST_P(X) \ | |
| 638 ((GET_CODE (X) == SYMBOL_REF || GET_CODE (X) == LABEL_REF) \ | |
| 639 && ! LEGITIMATE_PIC_OPERAND_P (X)) | |
| 640 | |
| 641 /* Non-global SYMBOL_REFs have SYMBOL_REF_FLAG enabled. */ | |
| 642 #define MN10300_GLOBAL_P(X) (! SYMBOL_REF_FLAG (X)) | |
| 643 | |
| 644 /* Recognize machine-specific patterns that may appear within | |
| 645 constants. Used for PIC-specific UNSPECs. */ | |
| 646 #define OUTPUT_ADDR_CONST_EXTRA(STREAM, X, FAIL) \ | |
| 647 do \ | |
| 648 if (GET_CODE (X) == UNSPEC) \ | |
| 649 { \ | |
| 650 switch (XINT ((X), 1)) \ | |
| 651 { \ | |
| 652 case UNSPEC_INT_LABEL: \ | |
| 653 asm_fprintf ((STREAM), ".%LLIL" HOST_WIDE_INT_PRINT_DEC, \ | |
| 654 INTVAL (XVECEXP ((X), 0, 0))); \ | |
| 655 break; \ | |
| 656 case UNSPEC_PIC: \ | |
| 657 /* GLOBAL_OFFSET_TABLE or local symbols, no suffix. */ \ | |
| 658 output_addr_const ((STREAM), XVECEXP ((X), 0, 0)); \ | |
| 659 break; \ | |
| 660 case UNSPEC_GOT: \ | |
| 661 output_addr_const ((STREAM), XVECEXP ((X), 0, 0)); \ | |
| 662 fputs ("@GOT", (STREAM)); \ | |
| 663 break; \ | |
| 664 case UNSPEC_GOTOFF: \ | |
| 665 output_addr_const ((STREAM), XVECEXP ((X), 0, 0)); \ | |
| 666 fputs ("@GOTOFF", (STREAM)); \ | |
| 667 break; \ | |
| 668 case UNSPEC_PLT: \ | |
| 669 output_addr_const ((STREAM), XVECEXP ((X), 0, 0)); \ | |
| 670 fputs ("@PLT", (STREAM)); \ | |
| 671 break; \ | |
| 672 case UNSPEC_GOTSYM_OFF: \ | |
| 673 assemble_name (STREAM, GOT_SYMBOL_NAME); \ | |
| 674 fputs ("-(", STREAM); \ | |
| 675 output_addr_const (STREAM, XVECEXP (X, 0, 0)); \ | |
| 676 fputs ("-.)", STREAM); \ | |
| 677 break; \ | |
| 678 default: \ | |
| 679 goto FAIL; \ | |
| 680 } \ | |
| 681 break; \ | |
| 682 } \ | |
| 683 else \ | |
| 684 goto FAIL; \ | |
| 685 while (0) | |
| 686 | |
| 687 /* Tell final.c how to eliminate redundant test instructions. */ | |
| 688 | |
| 689 /* Here we define machine-dependent flags and fields in cc_status | |
| 690 (see `conditions.h'). No extra ones are needed for the VAX. */ | |
| 691 | |
| 692 /* Store in cc_status the expressions | |
| 693 that the condition codes will describe | |
| 694 after execution of an instruction whose pattern is EXP. | |
| 695 Do not alter them if the instruction would not alter the cc's. */ | |
| 696 | |
| 697 #define CC_OVERFLOW_UNUSABLE 0x200 | |
| 698 #define CC_NO_CARRY CC_NO_OVERFLOW | |
| 699 #define NOTICE_UPDATE_CC(EXP, INSN) notice_update_cc(EXP, INSN) | |
| 700 | |
| 701 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \ | |
| 702 ((CLASS1 == CLASS2 && (CLASS1 == ADDRESS_REGS || CLASS1 == DATA_REGS)) ? 2 :\ | |
| 703 ((CLASS1 == ADDRESS_REGS || CLASS1 == DATA_REGS) && \ | |
| 704 (CLASS2 == ADDRESS_REGS || CLASS2 == DATA_REGS)) ? 4 : \ | |
| 705 (CLASS1 == SP_REGS && CLASS2 == ADDRESS_REGS) ? 2 : \ | |
| 706 (CLASS1 == ADDRESS_REGS && CLASS2 == SP_REGS) ? 4 : \ | |
| 707 ! TARGET_AM33 ? 6 : \ | |
| 708 (CLASS1 == SP_REGS || CLASS2 == SP_REGS) ? 6 : \ | |
| 709 (CLASS1 == CLASS2 && CLASS1 == EXTENDED_REGS) ? 6 : \ | |
| 710 (CLASS1 == FP_REGS || CLASS2 == FP_REGS) ? 6 : \ | |
| 711 (CLASS1 == EXTENDED_REGS || CLASS2 == EXTENDED_REGS) ? 4 : \ | |
| 712 4) | |
| 713 | |
| 714 /* Nonzero if access to memory by bytes or half words is no faster | |
| 715 than accessing full words. */ | |
| 716 #define SLOW_BYTE_ACCESS 1 | |
| 717 | |
| 718 #define NO_FUNCTION_CSE | |
| 719 | |
| 720 /* According expr.c, a value of around 6 should minimize code size, and | |
| 721 for the MN10300 series, that's our primary concern. */ | |
| 722 #define MOVE_RATIO(speed) 6 | |
| 723 | |
| 724 #define TEXT_SECTION_ASM_OP "\t.section .text" | |
| 725 #define DATA_SECTION_ASM_OP "\t.section .data" | |
| 726 #define BSS_SECTION_ASM_OP "\t.section .bss" | |
| 727 | |
| 728 #define ASM_COMMENT_START "#" | |
| 729 | |
| 730 /* Output to assembler file text saying following lines | |
| 731 may contain character constants, extra white space, comments, etc. */ | |
| 732 | |
| 733 #define ASM_APP_ON "#APP\n" | |
| 734 | |
| 735 /* Output to assembler file text saying following lines | |
| 736 no longer contain unusual constructs. */ | |
| 737 | |
| 738 #define ASM_APP_OFF "#NO_APP\n" | |
| 739 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
740 #undef USER_LABEL_PREFIX |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
741 #define USER_LABEL_PREFIX "_" |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
742 |
| 0 | 743 /* This says how to output the assembler to define a global |
| 744 uninitialized but not common symbol. | |
| 745 Try to use asm_output_bss to implement this macro. */ | |
| 746 | |
| 747 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \ | |
| 748 asm_output_aligned_bss ((FILE), (DECL), (NAME), (SIZE), (ALIGN)) | |
| 749 | |
| 750 /* Globalizing directive for a label. */ | |
| 751 #define GLOBAL_ASM_OP "\t.global " | |
| 752 | |
| 753 /* This is how to output a reference to a user-level label named NAME. | |
| 754 `assemble_name' uses this. */ | |
| 755 | |
| 756 #undef ASM_OUTPUT_LABELREF | |
| 757 #define ASM_OUTPUT_LABELREF(FILE, NAME) \ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
758 asm_fprintf (FILE, "%U%s", (*targetm.strip_name_encoding) (NAME)) |
| 0 | 759 |
| 760 #define ASM_PN_FORMAT "%s___%lu" | |
| 761 | |
| 762 /* This is how we tell the assembler that two symbols have the same value. */ | |
| 763 | |
| 764 #define ASM_OUTPUT_DEF(FILE,NAME1,NAME2) \ | |
| 765 do { assemble_name(FILE, NAME1); \ | |
| 766 fputs(" = ", FILE); \ | |
| 767 assemble_name(FILE, NAME2); \ | |
| 768 fputc('\n', FILE); } while (0) | |
| 769 | |
| 770 | |
| 771 /* How to refer to registers in assembler output. | |
| 772 This sequence is indexed by compiler's hard-register-number (see above). */ | |
| 773 | |
| 774 #define REGISTER_NAMES \ | |
| 775 { "d0", "d1", "d2", "d3", "a0", "a1", "a2", "a3", "ap", "sp", \ | |
| 776 "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7" \ | |
| 777 , "fs0", "fs1", "fs2", "fs3", "fs4", "fs5", "fs6", "fs7" \ | |
| 778 , "fs8", "fs9", "fs10", "fs11", "fs12", "fs13", "fs14", "fs15" \ | |
| 779 , "fs16", "fs17", "fs18", "fs19", "fs20", "fs21", "fs22", "fs23" \ | |
| 780 , "fs24", "fs25", "fs26", "fs27", "fs28", "fs29", "fs30", "fs31" \ | |
| 781 } | |
| 782 | |
| 783 #define ADDITIONAL_REGISTER_NAMES \ | |
| 784 { {"r8", 4}, {"r9", 5}, {"r10", 6}, {"r11", 7}, \ | |
| 785 {"r12", 0}, {"r13", 1}, {"r14", 2}, {"r15", 3}, \ | |
| 786 {"e0", 10}, {"e1", 11}, {"e2", 12}, {"e3", 13}, \ | |
| 787 {"e4", 14}, {"e5", 15}, {"e6", 16}, {"e7", 17} \ | |
| 788 , {"fd0", 18}, {"fd2", 20}, {"fd4", 22}, {"fd6", 24} \ | |
| 789 , {"fd8", 26}, {"fd10", 28}, {"fd12", 30}, {"fd14", 32} \ | |
| 790 , {"fd16", 34}, {"fd18", 36}, {"fd20", 38}, {"fd22", 40} \ | |
| 791 , {"fd24", 42}, {"fd26", 44}, {"fd28", 46}, {"fd30", 48} \ | |
| 792 } | |
| 793 | |
| 794 /* Print an instruction operand X on file FILE. | |
| 795 look in mn10300.c for details */ | |
| 796 | |
| 797 #define PRINT_OPERAND(FILE, X, CODE) print_operand(FILE,X,CODE) | |
| 798 | |
| 799 /* Print a memory operand whose address is X, on file FILE. | |
| 800 This uses a function in output-vax.c. */ | |
| 801 | |
| 802 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address (FILE, ADDR) | |
| 803 | |
| 804 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) | |
| 805 #define ASM_OUTPUT_REG_POP(FILE,REGNO) | |
| 806 | |
| 807 /* This is how to output an element of a case-vector that is absolute. */ | |
| 808 | |
| 809 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \ | |
| 810 fprintf (FILE, "\t%s .L%d\n", ".long", VALUE) | |
| 811 | |
| 812 /* This is how to output an element of a case-vector that is relative. */ | |
| 813 | |
| 814 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \ | |
| 815 fprintf (FILE, "\t%s .L%d-.L%d\n", ".long", VALUE, REL) | |
| 816 | |
| 817 #define ASM_OUTPUT_ALIGN(FILE,LOG) \ | |
| 818 if ((LOG) != 0) \ | |
| 819 fprintf (FILE, "\t.align %d\n", (LOG)) | |
| 820 | |
| 821 /* We don't have to worry about dbx compatibility for the mn10300. */ | |
| 822 #define DEFAULT_GDB_EXTENSIONS 1 | |
| 823 | |
| 824 /* Use dwarf2 debugging info by default. */ | |
| 825 #undef PREFERRED_DEBUGGING_TYPE | |
| 826 #define PREFERRED_DEBUGGING_TYPE DWARF2_DEBUG | |
| 827 | |
| 828 #define DWARF2_ASM_LINE_DEBUG_INFO 1 | |
| 829 | |
| 830 /* GDB always assumes the current function's frame begins at the value | |
| 831 of the stack pointer upon entry to the current function. Accessing | |
| 832 local variables and parameters passed on the stack is done using the | |
| 833 base of the frame + an offset provided by GCC. | |
| 834 | |
| 835 For functions which have frame pointers this method works fine; | |
| 836 the (frame pointer) == (stack pointer at function entry) and GCC provides | |
| 837 an offset relative to the frame pointer. | |
| 838 | |
| 839 This loses for functions without a frame pointer; GCC provides an offset | |
| 840 which is relative to the stack pointer after adjusting for the function's | |
| 841 frame size. GDB would prefer the offset to be relative to the value of | |
| 842 the stack pointer at the function's entry. Yuk! */ | |
| 843 #define DEBUGGER_AUTO_OFFSET(X) \ | |
| 844 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \ | |
| 845 + (frame_pointer_needed \ | |
| 846 ? 0 : -initial_offset (FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM))) | |
| 847 | |
| 848 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \ | |
| 849 ((GET_CODE (X) == PLUS ? OFFSET : 0) \ | |
| 850 + (frame_pointer_needed \ | |
| 851 ? 0 : -initial_offset (ARG_POINTER_REGNUM, STACK_POINTER_REGNUM))) | |
| 852 | |
| 853 /* Specify the machine mode that this machine uses | |
| 854 for the index in the tablejump instruction. */ | |
| 855 #define CASE_VECTOR_MODE Pmode | |
| 856 | |
| 857 /* Define if operations between registers always perform the operation | |
| 858 on the full register even if a narrower mode is specified. */ | |
| 859 #define WORD_REGISTER_OPERATIONS | |
| 860 | |
| 861 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND | |
| 862 | |
| 863 /* This flag, if defined, says the same insns that convert to a signed fixnum | |
| 864 also convert validly to an unsigned one. */ | |
| 865 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC | |
| 866 | |
| 867 /* Max number of bytes we can move from memory to memory | |
| 868 in one reasonably fast instruction. */ | |
| 869 #define MOVE_MAX 4 | |
| 870 | |
| 871 /* Define if shifts truncate the shift count | |
| 872 which implies one can omit a sign-extension or zero-extension | |
| 873 of a shift count. */ | |
| 874 #define SHIFT_COUNT_TRUNCATED 1 | |
| 875 | |
| 876 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits | |
| 877 is done just by pretending it is already truncated. */ | |
| 878 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1 | |
| 879 | |
| 880 /* Specify the machine mode that pointers have. | |
| 881 After generation of rtl, the compiler makes no further distinction | |
| 882 between pointers and any other objects of this machine mode. */ | |
| 883 #define Pmode SImode | |
| 884 | |
| 885 /* A function address in a call instruction | |
| 886 is a byte address (for indexing purposes) | |
| 887 so give the MEM rtx a byte's mode. */ | |
| 888 #define FUNCTION_MODE QImode | |
| 889 | |
| 890 /* The assembler op to get a word. */ | |
| 891 | |
| 892 #define FILE_ASM_OP "\t.file\n" | |
| 893 | |
| 894 typedef struct mn10300_cc_status_mdep | |
| 895 { | |
| 896 int fpCC; | |
| 897 } | |
| 898 cc_status_mdep; | |
| 899 | |
| 900 #define CC_STATUS_MDEP cc_status_mdep | |
| 901 | |
| 902 #define CC_STATUS_MDEP_INIT (cc_status.mdep.fpCC = 0) |