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