2003-12-26 Guilhem Lavaux <guilhem@kaffe.org>
[official-gcc.git] / gcc / config / cris / cris.h
blob69483fae1fd42543342b61afb6ab3d603f18c59c
1 /* Definitions for GCC. Part of the machine description for CRIS.
2 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
3 Contributed by Axis Communications. Written by Hans-Peter Nilsson.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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.
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. */
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. */
40 /* Replacement for REG_P since it does not match SUBREGs. Happens for
41 testcase Axis-20000320 with gcc-2.9x. */
42 #define REG_S_P(x) \
43 (REG_P (x) || (GET_CODE (x) == SUBREG && REG_P (XEXP (x, 0))))
45 /* Last register in main register bank r0..r15. */
46 #define CRIS_LAST_GENERAL_REGISTER 15
48 /* Descriptions of registers used for arguments. */
49 #define CRIS_FIRST_ARG_REG 10
50 #define CRIS_MAX_ARGS_IN_REGS 4
52 /* Other convenience definitions. */
53 #define CRIS_PC_REGNUM 15
54 #define CRIS_SRP_REGNUM 16
56 /* Most of the time, we need the index into the register-names array.
57 When passing debug-info, we need the real register number. */
58 #define CRIS_CANONICAL_SRP_REGNUM (16 + 11)
59 #define CRIS_CANONICAL_MOF_REGNUM (16 + 7)
61 /* When generating PIC, these suffixes are added to the names of non-local
62 functions when being output. Contrary to other ports, we have offsets
63 relative to the GOT, not the PC. We might implement PC-relative PLT
64 semantics later for the general case; they are used in some cases right
65 now, such as MI thunks. */
66 #define CRIS_GOTPLT_SUFFIX ":GOTPLT"
67 #define CRIS_PLT_GOTOFFSET_SUFFIX ":PLTG"
68 #define CRIS_PLT_PCOFFSET_SUFFIX ":PLT"
70 /* If you tweak this, don't forget to check cris_expand_builtin_va_arg. */
71 #define CRIS_FUNCTION_ARG_SIZE(MODE, TYPE) \
72 ((MODE) != BLKmode ? GET_MODE_SIZE (MODE) \
73 : (unsigned) int_size_in_bytes (TYPE))
75 /* Check for max allowed stackframe. A "const char *" to be parsed. */
76 extern const char *cris_max_stackframe_str;
78 /* Which CPU version this is. A "const char *" to be parsed. */
79 extern const char *cris_cpu_str;
81 /* Which CPU version this is. The parsed and adjusted cris_cpu_str. */
82 extern int cris_cpu_version;
84 /* Which CPU version to tune for. A "const char *" to be parsed. */
85 extern const char *cris_tune_str;
87 /* The argument to "-melinux-stacksize=". We don't parse it currently;
88 it's just passed on to the linker. We might want to do something
89 here someday. */
90 extern const char *cris_elinux_stacksize_str;
92 /* Changing the order used to be necessary to put the fourth __make_dp
93 argument (a DImode parameter) in registers, to fit with the libfunc
94 parameter passing scheme used for intrinsic functions. FIXME: Check
95 performance and maybe remove definition from TARGET_LIBGCC2_CFLAGS now
96 that it isn't strictly necessary. We used to do this through
97 TARGET_LIBGCC2_CFLAGS, but that became increasingly difficult as the
98 parenthesis (that needed quoting) travels through several layers of
99 make and shell invocations. */
100 #ifdef IN_LIBGCC2
101 #define __make_dp(a,b,c,d) __cris_make_dp(d,a,b,c)
102 #endif
105 /* Node: Driver */
107 /* When using make with defaults.mak for Sun this will handily remove
108 any "-target sun*" switches. */
109 /* We need to override any previous definitions (linux.h) */
110 #undef WORD_SWITCH_TAKES_ARG
111 #define WORD_SWITCH_TAKES_ARG(STR) \
112 (DEFAULT_WORD_SWITCH_TAKES_ARG (STR) \
113 || !strcmp (STR, "target"))
115 /* Also provide canonical vN definitions when user specifies an alias.
116 Note that -melf overrides -maout. */
118 #define CPP_SPEC \
119 "%{mtune=*:-D__tune_%* %{mtune=v*:-D__CRIS_arch_tune=%*}}\
120 %{mtune=etrax4:-D__tune_v3 -D__CRIS_arch_tune=3}\
121 %{mtune=etrax100:-D__tune_v8 -D__CRIS_arch_tune=8}\
122 %{mtune=svinto:-D__tune_v8 -D__CRIS_arch_tune=8}\
123 %{mtune=etrax100lx:-D__tune_v10 -D__CRIS_arch_tune=10}\
124 %{mtune=ng:-D__tune_v10 -D__CRIS_arch_tune=10}\
125 %{mcpu=*:-D__arch_%* %{mcpu=v*:-D__CRIS_arch_version=%*}}\
126 %{mcpu=etrax4:-D__arch_v3 -D__CRIS_arch_version=3}\
127 %{mcpu=etrax100:-D__arch_v8 -D__CRIS_arch_version=8}\
128 %{mcpu=svinto:-D__arch_v8 -D__CRIS_arch_version=8}\
129 %{mcpu=etrax100lx:-D__arch_v10 -D__CRIS_arch_version=10}\
130 %{mcpu=ng:-D__arch_v10 -D__CRIS_arch_version=10}\
131 %{march=*:-D__arch_%* %{march=v*:-D__CRIS_arch_version=%*}}\
132 %{march=etrax4:-D__arch_v3 -D__CRIS_arch_version=3}\
133 %{march=etrax100:-D__arch_v8 -D__CRIS_arch_version=8}\
134 %{march=svinto:-D__arch_v8 -D__CRIS_arch_version=8}\
135 %{march=etrax100lx:-D__arch_v10 -D__CRIS_arch_version=10}\
136 %{march=ng:-D__arch_v10 -D__CRIS_arch_version=10}\
137 %{metrax100:-D__arch__v8 -D__CRIS_arch_version=8}\
138 %{metrax4:-D__arch__v3 -D__CRIS_arch_version=3}\
139 %(cpp_subtarget)"
141 /* For the cris-*-elf subtarget. */
142 #define CRIS_CPP_SUBTARGET_SPEC \
143 "%{mbest-lib-options:\
144 %{!moverride-best-lib-options:\
145 %{!march=*:%{!metrax*:%{!mcpu=*:-D__tune_v10 -D__CRIS_arch_tune=10}}}}}"
147 /* Remove those Sun-make "target" switches. */
148 /* Override previous definitions (linux.h). */
149 #undef CC1_SPEC
150 #define CC1_SPEC \
151 "%{target*:}\
152 %{metrax4:-march=v3}\
153 %{metrax100:-march=v8}\
154 %(cc1_subtarget)"
156 /* For the cris-*-elf subtarget. */
157 #define CRIS_CC1_SUBTARGET_SPEC \
158 "-melf\
159 %{mbest-lib-options:\
160 %{!moverride-best-lib-options:\
161 %{!march=*:%{!mcpu=*:-mtune=v10 -D__CRIS_arch_tune=10}}\
162 %{!finhibit-size-directive:\
163 %{!fno-function-sections: -ffunction-sections}\
164 %{!fno-data-sections: -fdata-sections}}}}"
166 /* This adds to CC1_SPEC. When bugs are removed from -fvtable-gc
167 (-fforce-addr causes invalid .vtable_entry asm in tinfo.cc and
168 nothing at all works in GCC 3.0-pre), add this line:
169 "%{mbest-lib-options:%{!moverride-best-lib-options:\
170 %{!melinux:%{!maout|melf:%{!fno-vtable-gc:-fvtable-gc}}}}}". */
171 #define CC1PLUS_SPEC ""
173 /* Override previous definitions (linux.h). */
174 #undef ASM_SPEC
175 #define ASM_SPEC \
176 "%{v:-v}\
177 %(asm_subtarget)"
179 /* For the cris-*-elf subtarget. */
180 #define CRIS_ASM_SUBTARGET_SPEC "--em=criself"
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.
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)"
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}}"
205 /* Which library to get. The only difference from the default is to get
206 libsc.a if -sim is given to the driver. Repeat -lc -lsysX
207 {X=sim,linux}, because libsysX needs (at least) errno from libc, and
208 then we want to resolve new unknowns in libc against libsysX, not
209 libnosys. */
210 /* Override previous definitions (linux.h). */
211 #undef LIB_SPEC
212 #define LIB_SPEC \
213 "%{sim*:-lc -lsyssim -lc -lsyssim}\
214 %{!sim*:%{g*:-lg}\
215 %{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p} -lbsp}\
216 -lnosys"
218 /* Linker startfile options; crt0 flavors.
220 At the moment there are no gcrt0.o or mcrt0.o, but keep them here and
221 link them to crt0.o to be prepared. Use scrt0.c if running the
222 simulator, linear style, or s2crt0.c if fixed style. */
223 /* We need to remove any previous definition (elfos.h). */
224 #undef STARTFILE_SPEC
225 #define STARTFILE_SPEC \
226 "%{sim2:s2crt0.o%s}\
227 %{!sim2:%{sim:scrt0.o%s}\
228 %{!sim:%{pg:gcrt0.o%s}\
229 %{!pg:%{p:mcrt0.o%s}%{!p:crt0.o%s}}}}\
230 crtbegin.o%s"
232 #undef ENDFILE_SPEC
233 #define ENDFILE_SPEC "crtend.o%s"
235 #define EXTRA_SPECS \
236 {"cpp_subtarget", CRIS_CPP_SUBTARGET_SPEC}, \
237 {"cc1_subtarget", CRIS_CC1_SUBTARGET_SPEC}, \
238 {"asm_subtarget", CRIS_ASM_SUBTARGET_SPEC}, \
239 {"link_subtarget", CRIS_LINK_SUBTARGET_SPEC}, \
240 CRIS_SUBTARGET_EXTRA_SPECS
242 #define CRIS_SUBTARGET_EXTRA_SPECS
245 /* Node: Run-time Target */
247 #define TARGET_CPU_CPP_BUILTINS() \
248 do \
250 builtin_define_std ("cris"); \
251 builtin_define_std ("CRIS"); \
252 builtin_define_std ("GNU_CRIS"); \
253 builtin_define ("__CRIS_ABI_version=2"); \
254 builtin_assert ("cpu=cris"); \
255 builtin_assert ("machine=cris"); \
257 while (0)
259 /* This needs to be at least 32 bits. */
260 extern int target_flags;
262 /* Currently this just affects alignment. FIXME: Redundant with
263 TARGET_ALIGN_BY_32, or put machine stuff here? */
264 #define TARGET_MASK_SVINTO 1
265 #define TARGET_SVINTO (target_flags & TARGET_MASK_SVINTO)
267 /* If to use condition-codes generated by insns other than the
268 immediately preceding compare/test insn.
269 Used to check for errors in notice_update_cc. */
270 #define TARGET_MASK_CCINIT 2
271 #define TARGET_CCINIT (target_flags & TARGET_MASK_CCINIT)
273 /* Debug option. */
274 #define TARGET_MASK_PDEBUG 4
275 #define TARGET_PDEBUG (target_flags & TARGET_MASK_PDEBUG)
277 /* If to use side-effect patterns. Used to debug the [rx=ry+i] type
278 patterns. */
279 #define TARGET_MASK_SIDE_EFFECT_PREFIXES 8
280 #define TARGET_SIDE_EFFECT_PREFIXES \
281 (target_flags & TARGET_MASK_SIDE_EFFECT_PREFIXES)
283 /* If to expand mul into mstep. Only used when making libc.a. */
284 #define TARGET_MASK_EXPAND_MUL 16
285 #define TARGET_EXPAND_MUL (target_flags & TARGET_MASK_EXPAND_MUL)
287 /* If to *keep* (not force) alignment of stack at 16 bits. */
288 #define TARGET_MASK_STACK_ALIGN 32
289 #define TARGET_STACK_ALIGN (target_flags & TARGET_MASK_STACK_ALIGN)
291 /* If to do alignment on individual non-modifiable objects. */
292 #define TARGET_MASK_CONST_ALIGN 64
293 #define TARGET_CONST_ALIGN (target_flags & TARGET_MASK_CONST_ALIGN)
295 /* If to do alignment on individual modifiable objects. */
296 #define TARGET_MASK_DATA_ALIGN 128
297 #define TARGET_DATA_ALIGN (target_flags & TARGET_MASK_DATA_ALIGN)
299 /* If not to omit function prologue and epilogue. */
300 #define TARGET_MASK_PROLOGUE_EPILOGUE 256
301 #define TARGET_PROLOGUE_EPILOGUE (target_flags & TARGET_MASK_PROLOGUE_EPILOGUE)
303 /* Instructions additions from Etrax 4 and up.
304 (Just "lz", which we don't really generate from GCC -- yet). */
305 #define TARGET_MASK_ETRAX4_ADD 512
306 #define TARGET_ETRAX4_ADD (target_flags & TARGET_MASK_ETRAX4_ADD)
308 /* Say that all alignment specifications say to prefer 32 rather
309 than 16 bits. */
310 #define TARGET_MASK_ALIGN_BY_32 1024
311 #define TARGET_ALIGN_BY_32 (target_flags & TARGET_MASK_ALIGN_BY_32)
313 /* This condition is of limited use, as gcc is riddled with #ifdef:s
314 controlling this, rather than if (...):s. */
315 #define TARGET_MASK_ELF 2048
316 #define TARGET_ELF (target_flags & TARGET_MASK_ELF)
318 /* Currently just used to error-check other options. Note that this is
319 *not* set for -melinux. */
320 #define TARGET_MASK_LINUX 4096
321 #define TARGET_LINUX (target_flags & TARGET_MASK_LINUX)
323 /* There's a small setup cost with using GOTPLT references, but should
324 in total be a win both in code-size and execution-time. */
325 #define TARGET_MASK_AVOID_GOTPLT 8192
326 #define TARGET_AVOID_GOTPLT (target_flags & TARGET_MASK_AVOID_GOTPLT)
328 #define TARGET_SWITCHES \
330 /* No "no-etrax" as it does not really imply any model. \
331 On the other hand, "etrax" implies the common (and large) \
332 subset matching all models. */ \
333 {"etrax4", TARGET_MASK_ETRAX4_ADD, \
334 N_("Compile for ETRAX 4 (CRIS v3)")}, \
335 {"no-etrax4", -TARGET_MASK_ETRAX4_ADD, ""}, \
336 {"etrax100", (TARGET_MASK_SVINTO \
337 + TARGET_MASK_ETRAX4_ADD \
338 + TARGET_MASK_ALIGN_BY_32), \
339 N_("Compile for ETRAX 100 (CRIS v8)")}, \
340 {"no-etrax100", -(TARGET_MASK_SVINTO \
341 + TARGET_MASK_ETRAX4_ADD), ""}, \
342 {"pdebug", TARGET_MASK_PDEBUG, \
343 N_("Emit verbose debug information in assembly code")}, \
344 {"no-pdebug", -TARGET_MASK_PDEBUG, ""}, \
345 {"cc-init", TARGET_MASK_CCINIT, \
346 N_("Do not use condition codes from normal instructions")}, \
347 {"no-cc-init", -TARGET_MASK_CCINIT, ""}, \
348 {"side-effects", TARGET_MASK_SIDE_EFFECT_PREFIXES, ""}, \
349 {"no-side-effects", -TARGET_MASK_SIDE_EFFECT_PREFIXES, \
350 N_("Do not emit addressing modes with side-effect assignment")}, \
351 {"stack-align", TARGET_MASK_STACK_ALIGN, ""}, \
352 {"no-stack-align", -TARGET_MASK_STACK_ALIGN, \
353 N_("Do not tune stack alignment")}, \
354 {"data-align", TARGET_MASK_DATA_ALIGN, ""}, \
355 {"no-data-align", -TARGET_MASK_DATA_ALIGN, \
356 N_("Do not tune writable data alignment")}, \
357 {"const-align", TARGET_MASK_CONST_ALIGN, ""}, \
358 {"no-const-align", -TARGET_MASK_CONST_ALIGN, \
359 N_("Do not tune code and read-only data alignment")}, \
360 {"32-bit", (TARGET_MASK_STACK_ALIGN \
361 + TARGET_MASK_CONST_ALIGN \
362 + TARGET_MASK_DATA_ALIGN \
363 + TARGET_MASK_ALIGN_BY_32), ""}, \
364 {"32bit", (TARGET_MASK_STACK_ALIGN \
365 + TARGET_MASK_CONST_ALIGN \
366 + TARGET_MASK_DATA_ALIGN \
367 + TARGET_MASK_ALIGN_BY_32), \
368 N_("Align code and data to 32 bits")}, \
369 {"16-bit", (TARGET_MASK_STACK_ALIGN \
370 + TARGET_MASK_CONST_ALIGN \
371 + TARGET_MASK_DATA_ALIGN), ""}, \
372 {"16bit", (TARGET_MASK_STACK_ALIGN \
373 + TARGET_MASK_CONST_ALIGN \
374 + TARGET_MASK_DATA_ALIGN), ""}, \
375 {"8-bit", -(TARGET_MASK_STACK_ALIGN \
376 + TARGET_MASK_CONST_ALIGN \
377 + TARGET_MASK_DATA_ALIGN), ""}, \
378 {"8bit", -(TARGET_MASK_STACK_ALIGN \
379 + TARGET_MASK_CONST_ALIGN \
380 + TARGET_MASK_DATA_ALIGN), \
381 N_("Don't align items in code or data")}, \
382 {"prologue-epilogue", TARGET_MASK_PROLOGUE_EPILOGUE, ""}, \
383 {"no-prologue-epilogue", -TARGET_MASK_PROLOGUE_EPILOGUE, \
384 N_("Do not emit function prologue or epilogue")}, \
385 /* We have to handle this m-option here since we can't wash it off in \
386 both CC1_SPEC and CC1PLUS_SPEC. */ \
387 {"best-lib-options", 0, \
388 N_("Use the most feature-enabling options allowed by other options")}, \
390 /* We must call it "override-" since calling it "no-" will cause \
391 gcc.c to forget it, if there's a "later" -mbest-lib-options. \
392 Kludgy, but needed for some multilibbed files. */ \
393 {"override-best-lib-options", 0, \
394 N_("Override -mbest-lib-options")}, \
395 CRIS_SUBTARGET_SWITCHES \
396 {"", TARGET_DEFAULT | CRIS_SUBTARGET_DEFAULT, ""}} \
398 /* For the cris-*-elf subtarget. */
399 #define CRIS_SUBTARGET_SWITCHES \
400 {"elf", 0, ""},
402 /* Default target_flags if no switches specified. */
403 #ifndef TARGET_DEFAULT
404 # define TARGET_DEFAULT \
405 (TARGET_MASK_SIDE_EFFECT_PREFIXES + TARGET_MASK_STACK_ALIGN \
406 + TARGET_MASK_CONST_ALIGN + TARGET_MASK_DATA_ALIGN \
407 + TARGET_MASK_PROLOGUE_EPILOGUE)
408 #endif
410 /* For the cris-*-elf subtarget. */
411 #define CRIS_SUBTARGET_DEFAULT TARGET_MASK_ELF
413 #define CRIS_CPU_BASE 0
414 #define CRIS_CPU_ETRAX4 3 /* Just lz added. */
415 #define CRIS_CPU_SVINTO 8 /* Added swap, jsrc & Co., 32-bit accesses. */
416 #define CRIS_CPU_NG 10 /* Added mul[su]. */
418 /* Local, providing a default for cris_cpu_version. */
419 #define CRIS_DEFAULT_CPU_VERSION CRIS_CPU_BASE
421 #define TARGET_HAS_MUL_INSNS (cris_cpu_version >= CRIS_CPU_NG)
423 #define TARGET_OPTIONS \
424 {{"cpu=", &cris_cpu_str, "", 0}, \
425 {"arch=", &cris_cpu_str, \
426 N_("Generate code for the specified chip or CPU version"), 0}, \
427 {"tune=", &cris_tune_str, \
428 N_("Tune alignment for the specified chip or CPU version"), 0}, \
429 {"max-stackframe=", &cris_max_stackframe_str, \
430 N_("Warn when a stackframe is larger than the specified size"), 0}, \
431 CRIS_SUBTARGET_LONG_OPTIONS \
432 {"ax-stackframe=", &cris_max_stackframe_str, "", 0} }
434 #define CRIS_SUBTARGET_LONG_OPTIONS
436 /* Print subsidiary information on the compiler version in use.
437 Do not use VD.D syntax (D=digit), since this will cause confusion
438 with the base gcc version among users, when we ask which version of
439 gcc-cris they are using. Please use some flavor of "R<number>" for
440 the version (no need for major.minor versions, I believe). */
441 #define TARGET_VERSION \
442 fprintf (stderr, " [Axis CRIS%s]", CRIS_SUBTARGET_VERSION)
444 /* For the cris-*-elf subtarget. */
445 #define CRIS_SUBTARGET_VERSION " - generic ELF"
447 #define OVERRIDE_OPTIONS cris_override_options ()
449 /* The following gives optimal code for gcc-2.7.2, but *may* be subject
450 to change. Omitting flag_force_addr gives .1-.7% faster code for gcc
451 *only*, but 1.3% larger code. On ipps it gives 5.3-10.6% slower
452 code(!) and 0.3% larger code. For products, images gets .1-1.8%
453 larger. Do not set strict aliasing from optimization options. */
454 #define OPTIMIZATION_OPTIONS(OPTIMIZE, SIZE) \
455 do \
457 if ((OPTIMIZE) >= 2 || (SIZE)) \
459 flag_force_addr = 1; \
460 flag_omit_frame_pointer = 1; \
463 while (0)
466 /* Node: Storage Layout */
468 #define BITS_BIG_ENDIAN 0
470 #define BYTES_BIG_ENDIAN 0
472 /* WORDS_BIG_ENDIAN is not defined in the hardware, but for consistency,
473 we use little-endianness, and we may also be able to use
474 post-increment on DImode indirect. */
475 #define WORDS_BIG_ENDIAN 0
477 #define UNITS_PER_WORD 4
479 /* A combination of defining PROMOTE_MODE, PROMOTE_FUNCTION_ARGS,
480 PROMOTE_FOR_CALL_ONLY and *not* defining PROMOTE_PROTOTYPES gives the
481 best code size and speed for gcc, ipps and products in gcc-2.7.2. */
482 #define CRIS_PROMOTED_MODE(MODE, UNSIGNEDP, TYPE) \
483 (GET_MODE_CLASS (MODE) == MODE_INT && GET_MODE_SIZE (MODE) < 4) \
484 ? SImode : MODE
486 #define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
487 (MODE) = CRIS_PROMOTED_MODE (MODE, UNSIGNEDP, TYPE)
489 #define PROMOTE_FUNCTION_ARGS
491 /* Defining PROMOTE_FUNCTION_RETURN in gcc-2.7.2 uncovers bug 981110 (even
492 if defining FUNCTION_VALUE with MODE as PROMOTED_MODE ;-)
494 FIXME: Report this when cris.h is part of GCC, so others can easily
495 see the problem. Maybe check other systems that define
496 PROMOTE_FUNCTION_RETURN. */
497 #define PROMOTE_FOR_CALL_ONLY
499 /* We will be using prototype promotion, so they will be 32 bit. */
500 #define PARM_BOUNDARY 32
502 /* Stack boundary is guided by -mstack-align, -mno-stack-align,
503 -malign.
504 Old comment: (2.1: still valid in 2.7.2?)
505 Note that to make this macro affect the alignment of stack
506 locals, a fix was required, and special precautions when handling
507 the stack pointer in various other macros (TARGET_ASM_FUNCTION_PROLOGUE
508 et al) were required. See file "function.c". If you would just define
509 this macro, it would only affect the builtin alloca and variable
510 local data (non-ANSI, non-K&R, Gnu C extension). */
511 #define STACK_BOUNDARY \
512 (TARGET_STACK_ALIGN ? (TARGET_ALIGN_BY_32 ? 32 : 16) : 8)
514 #define FUNCTION_BOUNDARY 16
516 /* Do not change BIGGEST_ALIGNMENT (when optimizing), as it will affect
517 strange places, at least in 2.1. */
518 #define BIGGEST_ALIGNMENT 8
520 /* If -m16bit, -m16-bit, -malign or -mdata-align,
521 align everything to 16 bit. */
522 #define DATA_ALIGNMENT(TYPE, BASIC_ALIGN) \
523 (TARGET_DATA_ALIGN \
524 ? (TARGET_ALIGN_BY_32 \
525 ? (BASIC_ALIGN < 32 ? 32 : BASIC_ALIGN) \
526 : (BASIC_ALIGN < 16 ? 16 : BASIC_ALIGN)) : BASIC_ALIGN)
528 /* Note that CONSTANT_ALIGNMENT has the effect of making gcc believe that
529 ALL references to constant stuff (in code segment, like strings) has
530 this alignment. That is a rather rushed assumption. Luckily we do not
531 care about the "alignment" operand to builtin memcpy (only place where
532 it counts), so it doesn't affect any bad spots. */
533 #define CONSTANT_ALIGNMENT(CONSTANT, BASIC_ALIGN) \
534 (TARGET_CONST_ALIGN \
535 ? (TARGET_ALIGN_BY_32 \
536 ? (BASIC_ALIGN < 32 ? 32 : BASIC_ALIGN) \
537 : (BASIC_ALIGN < 16 ? 16 : BASIC_ALIGN)) : BASIC_ALIGN)
539 /* FIXME: Define LOCAL_ALIGNMENT for word and dword or arrays and
540 structures (if -mstack-align=), and check that it is good. */
542 #define EMPTY_FIELD_BOUNDARY 8
544 #define STRUCTURE_SIZE_BOUNDARY 8
546 #define STRICT_ALIGNMENT 0
548 /* Remove any previous definition (elfos.h).
549 ??? If it wasn't for all the other stuff that affects layout of
550 structures and bit-fields, this could presumably cause incompatibility
551 with other GNU/Linux ports (i.e. elfos.h users). */
552 #undef PCC_BITFIELD_TYPE_MATTERS
554 /* This is only used for non-scalars. Strange stuff happens to structs
555 (FIXME: What?) if we use anything larger than largest actually used
556 datum size, so lets make it 32. The type "long long" will still work
557 as usual. We can still have DImode insns, but they will only be used
558 for scalar data (i.e. long long). */
559 #define MAX_FIXED_MODE_SIZE 32
562 /* Node: Type Layout */
564 /* Note that DOUBLE_TYPE_SIZE is not defined anymore, since the default
565 value gives a 64-bit double, which is what we now use. */
567 /* For compatibility and historical reasons, a char should be signed. */
568 #define DEFAULT_SIGNED_CHAR 1
570 /* No DEFAULT_SHORT_ENUMS, please. */
572 /* Note that WCHAR_TYPE_SIZE is used in cexp.y,
573 where TARGET_SHORT is not available. */
574 #undef WCHAR_TYPE
575 #define WCHAR_TYPE "long int"
577 #undef WCHAR_TYPE_SIZE
578 #define WCHAR_TYPE_SIZE 32
581 /* Node: Register Basics */
583 /* We count all 16 non-special registers, SRP and a faked argument
584 pointer register. */
585 #define FIRST_PSEUDO_REGISTER (16 + 1 + 1)
587 /* For CRIS, these are r15 (pc) and r14 (sp). Register r8 is used as a
588 frame-pointer, but is not fixed. SRP is not included in general
589 registers and will not be used automatically. All other special
590 registers are fixed at the moment. The faked argument pointer register
591 is fixed too. */
592 #define FIXED_REGISTERS \
593 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1}
595 /* Register r9 is used for structure-address, r10-r13 for parameters,
596 r10- for return values. */
597 #define CALL_USED_REGISTERS \
598 {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1}
600 #define CONDITIONAL_REGISTER_USAGE cris_conditional_register_usage ()
603 /* Node: Allocation Order */
605 /* We need this on CRIS, because call-used regs should be used first,
606 (so we don't need to push). Else start using registers from r0 and up.
607 This preference is mainly because if we put call-used-regs from r0
608 and up, then we can't use movem to push the rest, (which have to be
609 saved if we use them, and movem has to start with r0).
610 Change here if you change which registers to use as call registers.
612 The actual need to explicitly prefer call-used registers improved the
613 situation a lot for 2.1, but might not actually be needed anymore.
614 Still, this order reflects what GCC should find out by itself, so it
615 probably does not hurt.
617 Order of preference: Call-used-regs first, then r0 and up, last fp &
618 sp & pc as fillers.
619 Call-used regs in opposite order, so they will cause less conflict if
620 a function has few args (<= 3) and it wants a scratch reg.
621 Use struct-return address first, since very few functions use
622 structure return values so it is likely to be available. */
623 #define REG_ALLOC_ORDER \
624 {9, 13, 12, 11, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 14, 15, 16, 17}
627 /* Node: Values in Registers */
629 /* The VOIDmode test is so we can omit mode on anonymous insns. FIXME:
630 Still needed in 2.9x, at least for Axis-20000319. */
631 #define HARD_REGNO_NREGS(REGNO, MODE) \
632 (MODE == VOIDmode \
633 ? 1 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
635 /* CRIS permits all registers to hold all modes. */
636 #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
638 #define MODES_TIEABLE_P(MODE1, MODE2) 1
641 /* Node: Leaf Functions */
642 /* (no definitions) */
644 /* Node: Stack Registers */
645 /* (no definitions) */
648 /* Node: Register Classes */
650 /* CRIS has only one kind of registers, so NO_REGS and ALL_REGS
651 are the only classes. FIXME: It actually makes sense to have another
652 class for special registers, and yet another class for the
653 multiply-overflow register in v10; then a class for the return
654 register also makes sense. */
655 enum reg_class {NO_REGS, ALL_REGS, LIM_REG_CLASSES};
657 #define N_REG_CLASSES (int) LIM_REG_CLASSES
659 #define REG_CLASS_NAMES {"NO_REGS", "ALL_REGS"}
661 #define GENERAL_REGS ALL_REGS
663 /* Count in the faked argument register in GENERAL_REGS. Keep out SRP. */
664 #define REG_CLASS_CONTENTS {{0}, {0x2ffff}}
666 #define REGNO_REG_CLASS(REGNO) GENERAL_REGS
668 #define BASE_REG_CLASS GENERAL_REGS
670 #define INDEX_REG_CLASS GENERAL_REGS
672 /* Get reg_class from a letter such as appears in the machine
673 description. No letters are used, since 'r' is used for any
674 register. */
675 #define REG_CLASS_FROM_LETTER(C) NO_REGS
677 /* Since it uses reg_renumber, it is safe only once reg_renumber
678 has been allocated, which happens in local-alloc.c. */
679 #define REGNO_OK_FOR_BASE_P(REGNO) \
680 ((REGNO) <= CRIS_LAST_GENERAL_REGISTER \
681 || (REGNO) == ARG_POINTER_REGNUM \
682 || (unsigned) reg_renumber[REGNO] <= CRIS_LAST_GENERAL_REGISTER \
683 || (unsigned) reg_renumber[REGNO] == ARG_POINTER_REGNUM)
685 /* See REGNO_OK_FOR_BASE_P. */
686 #define REGNO_OK_FOR_INDEX_P(REGNO) REGNO_OK_FOR_BASE_P(REGNO)
688 /* It seems like gcc (2.7.2 and 2.9x of 2000-03-22) may send "NO_REGS" as
689 the class for a constant (testcase: __Mul in arit.c). To avoid forcing
690 out a constant into the constant pool, we will trap this case and
691 return something a bit more sane. FIXME: Check if this is a bug. */
692 #define PREFERRED_RELOAD_CLASS(X, CLASS) \
693 ((CLASS) == NO_REGS ? GENERAL_REGS : (CLASS))
695 /* For CRIS, this is always the size of MODE in words,
696 since all registers are the same size. To use omitted modes in
697 patterns with reload constraints, you must say the widest size
698 which is allowed for VOIDmode.
699 FIXME: Does that still apply for gcc-2.9x? Keep poisoned until such
700 patterns are added back. News: 2001-03-16: Happens as early as the
701 underscore-test. */
702 #define CLASS_MAX_NREGS(CLASS, MODE) \
703 ((MODE) == VOIDmode \
704 ? 1 /* + cris_fatal ("CLASS_MAX_NREGS with VOIDmode") */ \
705 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
707 /* We are now out of letters; we could use ten more. This forces us to
708 use C-code in the 'md' file. FIXME: Use some EXTRA_CONSTRAINTS. */
709 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
711 /* MOVEQ, CMPQ, ANDQ, ORQ. */ \
712 (C) == 'I' ? (VALUE) >= -32 && (VALUE) <= 31 : \
713 /* ADDQ, SUBQ. */ \
714 (C) == 'J' ? (VALUE) >= 0 && (VALUE) <= 63 : \
715 /* ASRQ, BTSTQ, LSRQ, LSLQ. */ \
716 (C) == 'K' ? (VALUE) >= 0 && (VALUE) <= 31 : \
717 /* A 16-bit signed number. */ \
718 (C) == 'L' ? (VALUE) >= -32768 && (VALUE) <= 32767 : \
719 /* The constant 0 for CLEAR. */ \
720 (C) == 'M' ? (VALUE) == 0 : \
721 /* A negative ADDQ or SUBQ. */ \
722 (C) == 'N' ? (VALUE) >= -63 && (VALUE) < 0 : \
723 /* Quickened ints, QI and HI. */ \
724 (C) == 'O' ? (VALUE) >= 0 && (VALUE) <= 65535 \
725 && ((VALUE) >= (65535-31) \
726 || ((VALUE) >= (255-31) \
727 && (VALUE) <= 255 )) : \
728 /* A 16-bit number signed *or* unsigned. */ \
729 (C) == 'P' ? (VALUE) >= -32768 && (VALUE) <= 65535 : \
732 /* It is really simple to make up a 0.0; it is the same as int-0 in
733 IEEE754. */
734 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
735 ((C) == 'G' && ((VALUE) == CONST0_RTX (DFmode) \
736 || (VALUE) == CONST0_RTX (SFmode)))
738 /* We need this on cris to distinguish delay-slottable addressing modes. */
739 #define EXTRA_CONSTRAINT(X, C) \
741 /* Slottable address mode? */ \
742 (C) == 'Q' ? EXTRA_CONSTRAINT_Q (X) : \
743 /* Operand to BDAP or BIAP? */ \
744 (C) == 'R' ? EXTRA_CONSTRAINT_R (X) : \
745 /* A local PIC symbol? */ \
746 (C) == 'S' ? EXTRA_CONSTRAINT_S (X) : \
747 /* A three-address addressing-mode? */ \
748 (C) == 'T' ? EXTRA_CONSTRAINT_T (X) : \
749 /* A global PIC symbol? */ \
750 (C) == 'U' ? EXTRA_CONSTRAINT_U (X) : \
753 #define EXTRA_CONSTRAINT_Q(X) \
755 /* Slottable addressing modes: \
756 A register? FIXME: Unnecessary. */ \
757 (BASE_P (X) && REGNO (X) != CRIS_PC_REGNUM) \
758 /* Indirect register: [reg]? */ \
759 || (GET_CODE (X) == MEM && BASE_P (XEXP (X, 0)) \
760 && REGNO (XEXP (X, 0)) != CRIS_PC_REGNUM) \
763 #define EXTRA_CONSTRAINT_R(X) \
765 /* An operand to BDAP or BIAP: \
766 A BIAP; r.S? */ \
767 BIAP_INDEX_P (X) \
768 /* A [reg] or (int) [reg], maybe with post-increment. */ \
769 || BDAP_INDEX_P (X) \
770 || CONSTANT_INDEX_P (X) \
773 #define EXTRA_CONSTRAINT_T(X) \
775 /* Memory three-address operand. All are indirect-memory: */ \
776 GET_CODE (X) == MEM \
777 && ((GET_CODE (XEXP (X, 0)) == MEM \
778 /* Double indirect: [[reg]] or [[reg+]]? */ \
779 && (BASE_OR_AUTOINCR_P (XEXP (XEXP (X, 0), 0)))) \
780 /* Just an explicit indirect reference: [const]? */ \
781 || CONSTANT_P (XEXP (X, 0)) \
782 /* Something that is indexed; [...+...]? */ \
783 || (GET_CODE (XEXP (X, 0)) == PLUS \
784 /* A BDAP constant: [reg+(8|16|32)bit offset]? */ \
785 && ((BASE_P (XEXP (XEXP (X, 0), 0)) \
786 && CONSTANT_INDEX_P (XEXP (XEXP (X, 0), 1))) \
787 /* Swap arguments to the above. FIXME: gcc-2.9x? */ \
788 || (BASE_P (XEXP (XEXP (X, 0), 1)) \
789 && CONSTANT_INDEX_P (XEXP (XEXP (X, 0), 0))) \
790 /* A BDAP register: [reg+[reg(+)].S]? */ \
791 || (BASE_P (XEXP (XEXP (X, 0), 0)) \
792 && BDAP_INDEX_P(XEXP(XEXP(X, 0), 1))) \
793 /* Same, but with swapped arguments. */ \
794 || (BASE_P (XEXP (XEXP (X, 0), 1)) \
795 && BDAP_INDEX_P (XEXP (XEXP (X, 0), 0))) \
796 /* A BIAP: [reg+reg.S]. */ \
797 || (BASE_P (XEXP (XEXP (X, 0), 0)) \
798 && BIAP_INDEX_P (XEXP (XEXP (X, 0), 1))) \
799 /* Same, but with swapped arguments. */ \
800 || (BASE_P (XEXP (XEXP (X, 0), 1)) \
801 && BIAP_INDEX_P (XEXP (XEXP (X, 0), 0)))))) \
804 #define EXTRA_CONSTRAINT_S(X) \
805 (flag_pic && CONSTANT_P (X) && cris_gotless_symbol (X))
807 #define EXTRA_CONSTRAINT_U(X) \
808 (flag_pic && CONSTANT_P (X) && cris_got_symbol (X))
811 /* Node: Frame Layout */
813 #define STACK_GROWS_DOWNWARD
814 #define FRAME_GROWS_DOWNWARD
816 /* It seems to be indicated in the code (at least 2.1) that this is
817 better a constant, and best 0. */
818 #define STARTING_FRAME_OFFSET 0
820 #define FIRST_PARM_OFFSET(FNDECL) 0
822 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
823 cris_return_addr_rtx (COUNT, FRAMEADDR)
825 #define INCOMING_RETURN_ADDR_RTX gen_rtx (REG, Pmode, CRIS_SRP_REGNUM)
827 /* FIXME: Any __builtin_eh_return callers must not return anything and
828 there must not be collisions with incoming parameters. Luckily the
829 number of __builtin_eh_return callers is limited. For now return
830 parameter registers in reverse order and hope for the best. */
831 #define EH_RETURN_DATA_REGNO(N) \
832 (IN_RANGE ((N), 0, 3) ? (CRIS_FIRST_ARG_REG + 3 - (N)) : INVALID_REGNUM)
834 /* Store the stack adjustment in the structure-return-address register. */
835 #define CRIS_STACKADJ_REG STRUCT_VALUE_REGNUM
836 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (SImode, CRIS_STACKADJ_REG)
838 #define EH_RETURN_HANDLER_RTX \
839 cris_return_addr_rtx (0, NULL)
841 #define INIT_EXPANDERS cris_init_expanders ()
843 /* FIXME: Move this to right node (it's not documented properly yet). */
844 #define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (CRIS_SRP_REGNUM)
846 /* FIXME: Move this to right node (it's not documented properly yet).
847 FIXME: Check what alignment we can assume regarding
848 TARGET_STACK_ALIGN and TARGET_ALIGN_BY_32. */
849 #define DWARF_CIE_DATA_ALIGNMENT -1
851 /* If we would ever need an exact mapping between canonical register
852 number and dwarf frame register, we would either need to include all
853 registers in the gcc description (with some marked fixed of course), or
854 an inverse mapping from dwarf register to gcc register. There is one
855 need in dwarf2out.c:expand_builtin_init_dwarf_reg_sizes. Right now, I
856 don't see that we need exact correspondence between DWARF *frame*
857 registers and DBX_REGISTER_NUMBER, so map them onto GCC registers. */
858 #define DWARF_FRAME_REGNUM(REG) (REG)
860 /* Node: Stack Checking */
861 /* (no definitions) FIXME: Check. */
863 /* Node: Frame Registers */
865 #define STACK_POINTER_REGNUM 14
867 /* Register used for frame pointer. This is also the last of the saved
868 registers, when a frame pointer is not used. */
869 #define FRAME_POINTER_REGNUM 8
871 /* Faked register, is always eliminated. We need it to eliminate
872 allocating stack slots for the return address and the frame pointer. */
873 #define ARG_POINTER_REGNUM 17
875 #define STATIC_CHAIN_REGNUM 7
878 /* Node: Elimination */
880 /* Really only needed if the stack frame has variable length (alloca
881 or variable sized local arguments (GNU C extension). */
882 #define FRAME_POINTER_REQUIRED 0
884 #define ELIMINABLE_REGS \
885 {{ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
886 {ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
887 {FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}}
889 /* We need not worry about when the frame-pointer is required for other
890 reasons. */
891 #define CAN_ELIMINATE(FROM, TO) 1
893 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
894 (OFFSET) = cris_initial_elimination_offset (FROM, TO)
897 /* Node: Stack Arguments */
899 /* Since many parameters take up one register each in any case,
900 PROMOTE_PROTOTYPES would seem like a good idea, but measurements
901 indicate that a combination using PROMOTE_MODE is better. */
903 #define ACCUMULATE_OUTGOING_ARGS 1
905 #define RETURN_POPS_ARGS(FUNDECL, FUNTYPE, STACKSIZE) 0
908 /* Node: Register Arguments */
910 /* The void_type_node is sent as a "closing" call. We have to stop it
911 since it's invalid to FUNCTION_ARG_PASS_BY_REFERENCE (or was invalid at
912 some time). */
913 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
914 ((CUM).regs < CRIS_MAX_ARGS_IN_REGS \
915 && (TYPE) != void_type_node \
916 && ! FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED) \
917 ? gen_rtx (REG, MODE, (CRIS_FIRST_ARG_REG) + (CUM).regs) \
918 : NULL_RTX)
920 /* The differences between this and the previous, is that this one checks
921 that an argument is named, since incoming stdarg/varargs arguments are
922 pushed onto the stack, and we don't have to check against the "closing"
923 void_type_node TYPE parameter. */
924 #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \
925 (((NAMED) && (CUM).regs < CRIS_MAX_ARGS_IN_REGS \
926 && ! FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)) \
927 ? gen_rtx (REG, MODE, CRIS_FIRST_ARG_REG + (CUM).regs) \
928 : NULL_RTX)
930 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
931 (((CUM).regs == (CRIS_MAX_ARGS_IN_REGS - 1) \
932 && !MUST_PASS_IN_STACK (MODE, TYPE) \
933 && CRIS_FUNCTION_ARG_SIZE (MODE, TYPE) > 4 \
934 && CRIS_FUNCTION_ARG_SIZE (MODE, TYPE) <= 8) \
935 ? 1 : 0)
937 /* Structs may be passed by value, but they must not be more than 8
938 bytes long. If you tweak this, don't forget to adjust
939 cris_expand_builtin_va_arg. */
940 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
941 (MUST_PASS_IN_STACK (MODE, TYPE) \
942 || CRIS_FUNCTION_ARG_SIZE (MODE, TYPE) > 8) \
944 /* Contrary to what you'd believe, defining FUNCTION_ARG_CALLEE_COPIES
945 seems like a (small total) loss, at least for gcc-2.7.2 compiling and
946 running gcc-2.1 (small win in size, small loss running -- 100.1%),
947 and similarly for size for products (.1 .. .3% bloat, sometimes win).
948 Due to the empirical likeliness of making slower code, it is not
949 defined. */
951 /* This no longer *needs* to be a structure; but keeping it as such should
952 not hurt (and hacking the ABI is simpler). */
953 #define CUMULATIVE_ARGS struct cum_args
954 struct cum_args {int regs;};
956 /* The regs member is an integer, the number of arguments got into
957 registers so far. */
958 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL) \
959 ((CUM).regs = 0)
961 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
962 ((CUM).regs \
963 = (FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
964 ? (CRIS_MAX_ARGS_IN_REGS) + 1 \
965 : ((CUM).regs \
966 + (3 + (CRIS_FUNCTION_ARG_SIZE (MODE, TYPE))) / 4)))
968 #define FUNCTION_ARG_REGNO_P(REGNO) \
969 ((REGNO) >= CRIS_FIRST_ARG_REG \
970 && (REGNO) < CRIS_FIRST_ARG_REG + (CRIS_MAX_ARGS_IN_REGS))
973 /* Node: Scalar Return */
975 /* Let's assume all functions return in r[CRIS_FIRST_ARG_REG] for the
976 time being. */
977 #define FUNCTION_VALUE(VALTYPE, FUNC) \
978 gen_rtx (REG, TYPE_MODE (VALTYPE), CRIS_FIRST_ARG_REG)
980 #define LIBCALL_VALUE(MODE) gen_rtx (REG, MODE, CRIS_FIRST_ARG_REG)
982 #define FUNCTION_VALUE_REGNO_P(N) ((N) == CRIS_FIRST_ARG_REG)
985 /* Node: Aggregate Return */
987 #if 0
988 /* FIXME: Let's try this some time, so we return structures in registers.
989 We would cast the result of int_size_in_bytes to unsigned, so we will
990 get a huge number for "structures" of variable size (-1). */
991 #define RETURN_IN_MEMORY(TYPE) \
992 ((unsigned) int_size_in_bytes (TYPE) > CRIS_MAX_ARGS_IN_REGS * UNITS_PER_WORD)
993 #endif
995 #define STRUCT_VALUE_REGNUM ((CRIS_FIRST_ARG_REG) - 1)
998 /* Node: Caller Saves */
999 /* (no definitions) */
1001 /* Node: Function entry */
1003 /* See cris.c for TARGET_ASM_FUNCTION_PROLOGUE and
1004 TARGET_ASM_FUNCTION_EPILOGUE. */
1006 /* If the epilogue uses the "ret" insn, we need to fill the
1007 delay slot. */
1008 #define DELAY_SLOTS_FOR_EPILOGUE cris_delay_slots_for_epilogue ()
1010 #define ELIGIBLE_FOR_EPILOGUE_DELAY(INSN, N) \
1011 cris_eligible_for_epilogue_delay (INSN)
1013 /* Node: Profiling */
1015 #define FUNCTION_PROFILER(FILE, LABELNO) \
1016 error ("no FUNCTION_PROFILER for CRIS")
1018 /* FIXME: Some of the undefined macros might be mandatory. If so, fix
1019 documentation. */
1022 /* Node: Varargs */
1024 /* We save the register number of the first anonymous argument in
1025 first_vararg_reg, and take care of this in the function prologue.
1026 This behavior is used by at least one more port (the ARM?), but
1027 may be unsafe when compiling nested functions. (With varargs? Hairy.)
1028 Note that nested-functions is a GNU C extension.
1030 FIXME: We can actually put the size in PRETEND and deduce the number
1031 of registers from it in the prologue and epilogue. */
1032 #define SETUP_INCOMING_VARARGS(ARGSSF, MODE, TYPE, PRETEND, SECOND) \
1033 do \
1035 if ((ARGSSF).regs < (CRIS_MAX_ARGS_IN_REGS)) \
1036 (PRETEND) = ((CRIS_MAX_ARGS_IN_REGS) - (ARGSSF).regs) * 4; \
1037 if (TARGET_PDEBUG) \
1039 fprintf (asm_out_file, \
1040 "\n; VA:: ANSI: %d args before, anon @ #%d, %dtime\n", \
1041 (ARGSSF).regs, PRETEND, SECOND); \
1044 while (0)
1046 /* FIXME: This and other EXPAND_BUILTIN_VA_... target macros are not
1047 documented, although used by several targets. */
1048 #define EXPAND_BUILTIN_VA_ARG(VALIST, TYPE) \
1049 cris_expand_builtin_va_arg (VALIST, TYPE)
1052 /* Node: Trampolines */
1054 /* This looks too complicated, and it is. I assigned r7 to be the
1055 static chain register, but it is call-saved, so we have to save it,
1056 and come back to restore it after the call, so we have to save srp...
1057 Anyway, trampolines are rare enough that we can cope with this
1058 somewhat lack of elegance.
1059 (Do not be tempted to "straighten up" whitespace in the asms; the
1060 assembler #NO_APP state mandates strict spacing). */
1061 #define TRAMPOLINE_TEMPLATE(FILE) \
1062 do \
1064 fprintf (FILE, "\tmove.d $%s,[$pc+20]\n", \
1065 reg_names[STATIC_CHAIN_REGNUM]); \
1066 fprintf (FILE, "\tmove $srp,[$pc+22]\n"); \
1067 fprintf (FILE, "\tmove.d 0,$%s\n", \
1068 reg_names[STATIC_CHAIN_REGNUM]); \
1069 fprintf (FILE, "\tjsr 0\n"); \
1070 fprintf (FILE, "\tmove.d 0,$%s\n", \
1071 reg_names[STATIC_CHAIN_REGNUM]); \
1072 fprintf (FILE, "\tjump 0\n"); \
1074 while (0)
1076 #define TRAMPOLINE_SIZE 32
1078 /* CRIS wants instructions on word-boundary.
1079 Note that due to a bug (reported) in 2.7.2 and earlier, this is
1080 actually treated as alignment in _bytes_, not _bits_. (Obviously
1081 this is not fatal, only a slight waste of stack space). */
1082 #define TRAMPOLINE_ALIGNMENT 16
1084 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1085 do \
1087 emit_move_insn (gen_rtx (MEM, SImode, \
1088 plus_constant (TRAMP, 10)), \
1089 CXT); \
1090 emit_move_insn (gen_rtx (MEM, SImode, \
1091 plus_constant (TRAMP, 16)), \
1092 FNADDR); \
1094 while (0)
1096 /* Note that there is no need to do anything with the cache for sake of
1097 a trampoline. */
1100 /* Node: Library Calls */
1102 /* If you change this, you have to check whatever libraries and systems
1103 that use it. */
1104 #define TARGET_EDOM 33
1107 /* Node: Addressing Modes */
1109 #define HAVE_POST_INCREMENT 1
1111 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X)
1113 #define MAX_REGS_PER_ADDRESS 2
1115 /* There are helper macros defined here which are used only in
1116 GO_IF_LEGITIMATE_ADDRESS.
1118 Note that you *have to* reject invalid addressing modes for mode
1119 MODE, even if it is legal for normal addressing modes. You cannot
1120 rely on the constraints to do this work. They can only be used to
1121 doublecheck your intentions. One example is that you HAVE TO reject
1122 (mem:DI (plus:SI (reg:SI x) (reg:SI y))) because for some reason
1123 this cannot be reloaded. (Which of course you can argue that gcc
1124 should have done.) FIXME: Strange. Check. */
1126 /* No symbol can be used as an index (or more correct, as a base) together
1127 with a register with PIC; the PIC register must be there. */
1128 #define CONSTANT_INDEX_P(X) \
1129 (CONSTANT_P (X) && !(flag_pic && cris_symbol (X)))
1131 /* True if X is a valid base register. */
1132 #define BASE_P(X) \
1133 (REG_P (X) && REG_OK_FOR_BASE_P (X))
1135 /* True if X is a valid base register with or without autoincrement. */
1136 #define BASE_OR_AUTOINCR_P(X) \
1137 (BASE_P (X) || (GET_CODE (X) == POST_INC && BASE_P (XEXP (X, 0))))
1139 /* True if X is a valid (register) index for BDAP, i.e. [Rs].S or [Rs+].S. */
1140 #define BDAP_INDEX_P(X) \
1141 ((GET_CODE (X) == MEM && GET_MODE (X) == SImode \
1142 && BASE_OR_AUTOINCR_P (XEXP (X, 0))) \
1143 || (GET_CODE (X) == SIGN_EXTEND \
1144 && GET_CODE (XEXP (X, 0)) == MEM \
1145 && (GET_MODE (XEXP (X, 0)) == HImode \
1146 || GET_MODE (XEXP (X, 0)) == QImode) \
1147 && BASE_OR_AUTOINCR_P (XEXP (XEXP (X, 0), 0))))
1149 /* True if X is a valid (register) index for BIAP, i.e. Rd.m. */
1150 #define BIAP_INDEX_P(X) \
1151 ((BASE_P (X) && REG_OK_FOR_INDEX_P (X)) \
1152 || (GET_CODE (X) == MULT \
1153 && BASE_P (XEXP (X, 0)) \
1154 && REG_OK_FOR_INDEX_P (XEXP (X, 0)) \
1155 && GET_CODE (XEXP (X, 1)) == CONST_INT \
1156 && (INTVAL (XEXP (X, 1)) == 2 \
1157 || INTVAL (XEXP (X, 1)) == 4)))
1159 /* True if X is an address that doesn't need a prefix i.e. [Rs] or [Rs+]. */
1160 #define SIMPLE_ADDRESS_P(X) \
1161 (BASE_P (X) \
1162 || (GET_CODE (X) == POST_INC \
1163 && BASE_P (XEXP (X, 0))))
1165 /* A PIC operand looks like a normal symbol here. At output we dress it
1166 in "[rPIC+symbol:GOT]" (global symbol) or "rPIC+symbol:GOTOFF" (local
1167 symbol) so we exclude all addressing modes where we can't replace a
1168 plain "symbol" with that. A global PIC symbol does not fit anywhere
1169 here (but is thankfully a general_operand in itself). A local PIC
1170 symbol is valid for the plain "symbol + offset" case. */
1171 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1173 rtx x1, x2; \
1174 if (SIMPLE_ADDRESS_P (X)) \
1175 goto ADDR; \
1176 if (CONSTANT_P (X) \
1177 && (! flag_pic \
1178 || cris_gotless_symbol (X) \
1179 || ! cris_symbol (X))) \
1180 goto ADDR; \
1181 /* Indexed? */ \
1182 if (GET_CODE (X) == PLUS) \
1184 x1 = XEXP (X, 0); \
1185 x2 = XEXP (X, 1); \
1186 /* BDAP o, Rd. */ \
1187 if ((BASE_P (x1) && CONSTANT_INDEX_P (x2)) \
1188 || (BASE_P (x2) && CONSTANT_INDEX_P (x1)) \
1189 /* BDAP Rs[+], Rd. */ \
1190 || (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD \
1191 && ((BASE_P (x1) && BDAP_INDEX_P (x2)) \
1192 || (BASE_P (x2) && BDAP_INDEX_P (x1)) \
1193 /* BIAP.m Rs, Rd */ \
1194 || (BASE_P (x1) && BIAP_INDEX_P (x2)) \
1195 || (BASE_P (x2) && BIAP_INDEX_P (x1))))) \
1196 goto ADDR; \
1198 else if (GET_CODE (X) == MEM) \
1200 /* DIP (Rs). Reject [[reg+]] and [[reg]] for \
1201 DImode (long long). */ \
1202 if (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD \
1203 && (BASE_P (XEXP (X, 0)) \
1204 || BASE_OR_AUTOINCR_P (XEXP (X, 0)))) \
1205 goto ADDR; \
1209 #ifndef REG_OK_STRICT
1210 /* Nonzero if X is a hard reg that can be used as a base reg
1211 or if it is a pseudo reg. */
1212 # define REG_OK_FOR_BASE_P(X) \
1213 (REGNO (X) <= CRIS_LAST_GENERAL_REGISTER \
1214 || REGNO (X) == ARG_POINTER_REGNUM \
1215 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1216 #else
1217 /* Nonzero if X is a hard reg that can be used as a base reg. */
1218 # define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1219 #endif
1221 #ifndef REG_OK_STRICT
1222 /* Nonzero if X is a hard reg that can be used as an index
1223 or if it is a pseudo reg. */
1224 # define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_BASE_P (X)
1225 #else
1226 /* Nonzero if X is a hard reg that can be used as an index. */
1227 # define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1228 #endif
1230 /* For now, don't do anything. GCC does a good job most often.
1232 Maybe we could do something about gcc:s misbehavior when it
1233 recalculates frame offsets for local variables, from fp+offs to
1234 sp+offs. The resulting address expression gets screwed up
1235 sometimes, but I'm not sure that it may be fixed here, since it is
1236 already split up in several instructions (Is this still true?).
1237 FIXME: Check and adjust for gcc-2.9x. */
1238 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) {}
1240 /* Kludge to solve Axis-990219: Work around imperfection in
1241 reload_load_address1:
1242 (plus (sign_extend (mem:qi (reg))) (reg))
1243 should be reloaded as (plus (reg) (reg)), not
1244 (plus (sign_extend (reg)) (reg)).
1245 There are no checks that reload_load_address_1 "reloads"
1246 addresses correctly, so invalidness is not caught or
1247 corrected.
1248 When the right thing happens in reload, the kludge can
1249 be removed; still not as of 2003-02-27. */
1251 #define LEGITIMIZE_RELOAD_ADDRESS(X, MODE, OPNUM, TYPE, IND_LEVELS, WIN) \
1252 do \
1254 if (GET_CODE (X) == PLUS \
1255 && REG_P (XEXP (X, 1)) \
1256 && GET_CODE (XEXP (X, 0)) == SIGN_EXTEND \
1257 && GET_CODE (XEXP (XEXP (X, 0), 0)) == MEM \
1258 && (GET_MODE (XEXP (XEXP (X, 0), 0)) == HImode \
1259 || GET_MODE (XEXP (XEXP (X, 0), 0)) == QImode) \
1260 && (REG_P (XEXP (XEXP (XEXP (X, 0), 0), 0)) \
1261 || (GET_CODE (XEXP (XEXP (XEXP (X, 0), 0), 0)) \
1262 == POST_INC \
1263 && REG_P (XEXP (XEXP (XEXP (XEXP (X, 0), 0), 0), \
1264 0))))) \
1266 int something_reloaded = 0; \
1268 if (REGNO (XEXP (X, 1)) >= FIRST_PSEUDO_REGISTER) \
1270 /* Second reg is pseudo, reload it. */ \
1271 push_reload (XEXP (X, 1), NULL_RTX, &XEXP (X, 1), \
1272 NULL, \
1273 GENERAL_REGS, GET_MODE (X), VOIDmode, 0, 0, \
1274 OPNUM, TYPE); \
1275 something_reloaded = 1; \
1278 if (REG_P (XEXP (XEXP (XEXP (X, 0), 0), 0)) \
1279 && (REGNO (XEXP (XEXP (XEXP (X, 0), 0), 0)) \
1280 >= FIRST_PSEUDO_REGISTER)) \
1282 /* First one is a pseudo - reload that. */ \
1283 push_reload (XEXP (XEXP (XEXP (X, 0), 0), 0), NULL_RTX, \
1284 &XEXP (XEXP (XEXP (X, 0), 0), 0), NULL, \
1285 GENERAL_REGS, \
1286 GET_MODE (X), VOIDmode, 0, 0, OPNUM, TYPE); \
1287 something_reloaded = 1; \
1290 if (! something_reloaded \
1291 || (GET_CODE (XEXP (XEXP (X, 0), 0)) == POST_INC \
1292 && (REGNO (XEXP (XEXP (XEXP (X, 0), 0), 0)) \
1293 >= FIRST_PSEUDO_REGISTER))) \
1294 /* Reload the sign_extend. Happens if neither reg is a \
1295 pseudo, or the first one was inside post_increment. */ \
1296 push_reload (XEXP (X, 0), NULL_RTX, &XEXP (X, 0), NULL, \
1297 GENERAL_REGS, GET_MODE (X), VOIDmode, 0, 0, \
1298 OPNUM, TYPE); \
1299 goto WIN; \
1302 while (0)
1304 /* In CRIS, only the postincrement address mode depends thus,
1305 since the increment depends on the size of the operand. */
1306 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \
1307 do \
1309 if (GET_CODE (ADDR) == POST_INC) \
1310 goto LABEL; \
1312 while (0)
1314 #define LEGITIMATE_CONSTANT_P(X) 1
1317 /* Node: Condition Code */
1319 #define NOTICE_UPDATE_CC(EXP, INSN) cris_notice_update_cc (EXP, INSN)
1321 /* FIXME: Maybe define CANONICALIZE_COMPARISON later, when playing with
1322 optimizations. It is needed; currently we do this with instruction
1323 patterns and NOTICE_UPDATE_CC. */
1326 /* Node: Costs */
1328 /* FIXME: Need to define REGISTER_MOVE_COST when more register classes are
1329 introduced. */
1331 /* This isn't strictly correct for v0..3 in buswidth-8bit mode, but
1332 should suffice. */
1333 #define MEMORY_MOVE_COST(M, CLASS, IN) \
1334 (((M) == QImode) ? 4 : ((M) == HImode) ? 4 : 6)
1336 /* Regardless of the presence of delay slots, the default value of 1 for
1337 BRANCH_COST is the best in the range (1, 2, 3), tested with gcc-2.7.2
1338 with testcases ipps and gcc, giving smallest and fastest code. */
1340 #define SLOW_BYTE_ACCESS 0
1342 /* This is the threshold *below* which inline move sequences of
1343 word-length sizes will be emitted. The "9" will translate to
1344 (9 - 1) * 4 = 32 bytes maximum moved, but using 16 instructions
1345 (8 instruction sequences) or less. */
1346 #define MOVE_RATIO 9
1349 /* Node: Sections */
1351 #define TEXT_SECTION_ASM_OP "\t.text"
1353 #define DATA_SECTION_ASM_OP "\t.data"
1355 #define FORCE_EH_FRAME_INFO_IN_DATA_SECTION (! TARGET_ELF)
1357 /* The jump table is immediately connected to the preceding insn. */
1358 #define JUMP_TABLES_IN_TEXT_SECTION 1
1360 /* We pull a little trick to register the _fini function with atexit,
1361 after (presumably) registering the eh frame info, since we don't handle
1362 _fini (a.k.a. ___fini_start) in crt0 or have a crti for "pure" ELF. If
1363 you change this, don't forget that you can't have library function
1364 references (e.g. to atexit) in crtend.o, since those won't be resolved
1365 to libraries; those are linked in *before* crtend.o. */
1366 #ifdef CRT_BEGIN
1367 # define CRT_CALL_STATIC_FUNCTION(SECTION_OP, FUNC) \
1368 static void __attribute__((__used__)) \
1369 call_ ## FUNC (void) \
1371 asm (SECTION_OP); \
1372 FUNC (); \
1373 if (__builtin_strcmp (#FUNC, "frame_dummy") == 0) \
1375 extern void __fini__start (void); \
1376 atexit (__fini__start); \
1378 asm (TEXT_SECTION_ASM_OP); \
1380 #endif
1382 /* Node: PIC */
1384 #define PIC_OFFSET_TABLE_REGNUM (flag_pic ? 0 : INVALID_REGNUM)
1386 #define LEGITIMATE_PIC_OPERAND_P(X) cris_legitimate_pic_operand (X)
1389 /* Node: File Framework */
1391 /* We don't want an .ident for gcc. To avoid that but still support
1392 #ident, we override ASM_OUTPUT_IDENT and, since the gcc .ident is its
1393 only use besides ASM_OUTPUT_IDENT, undef IDENT_ASM_OP from elfos.h. */
1394 #undef IDENT_ASM_OP
1395 #undef ASM_OUTPUT_IDENT
1396 #define ASM_OUTPUT_IDENT(FILE, NAME) \
1397 fprintf (FILE, "%s\"%s\"\n", "\t.ident\t", NAME);
1399 #define ASM_APP_ON "#APP\n"
1401 #define ASM_APP_OFF "#NO_APP\n"
1404 /* Node: Data Output */
1406 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) (C) == '@'
1408 /* Node: Uninitialized Data */
1410 /* Remember to round off odd values if we want data alignment,
1411 since we cannot do that with an .align directive.
1413 Using .comm causes the space not to be reserved in .bss, but by
1414 tricks with the symbol type. Not good if other tools than binutils
1415 are used on the object files. Since ".global ... .lcomm ..." works, we
1416 use that. Use .._ALIGNED_COMMON, since gcc whines when we only have
1417 ..._COMMON, and we prefer to whine ourselves; BIGGEST_ALIGNMENT is not
1418 the one to check. This done for a.out only. */
1419 /* FIXME: I suspect a bug in gcc with alignment. Do not warn until
1420 investigated; it mucks up the testsuite results. */
1421 #define CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, LOCAL) \
1422 do \
1424 int align_ = (ALIGN) / BITS_PER_UNIT; \
1425 if (TARGET_DATA_ALIGN && TARGET_ALIGN_BY_32 && align_ < 4) \
1426 align_ = 4; \
1427 else if (TARGET_DATA_ALIGN && align_ < 2) \
1428 align_ = 2; \
1429 /* FIXME: Do we need this? */ \
1430 else if (align_ < 1) \
1431 align_ = 1; \
1433 if (TARGET_ELF) \
1435 if (LOCAL) \
1437 fprintf ((FILE), "%s", LOCAL_ASM_OP); \
1438 assemble_name ((FILE), (NAME)); \
1439 fprintf ((FILE), "\n"); \
1441 fprintf ((FILE), "%s", COMMON_ASM_OP); \
1442 assemble_name ((FILE), (NAME)); \
1443 fprintf ((FILE), ",%u,%u\n", (int)(SIZE), align_); \
1445 else \
1447 /* We can't tell a one-only or weak COMM from a "global \
1448 COMM" so just make all non-locals weak. */ \
1449 if (! (LOCAL)) \
1450 ASM_WEAKEN_LABEL (FILE, NAME); \
1451 fputs ("\t.lcomm ", (FILE)); \
1452 assemble_name ((FILE), (NAME)); \
1453 fprintf ((FILE), ",%u\n", \
1454 ((int)(SIZE) + (align_ - 1)) & ~(align_ - 1)); \
1457 while (0)
1459 #define ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN) \
1460 CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, 0)
1462 #undef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1463 #define ASM_OUTPUT_ALIGNED_DECL_LOCAL(FILE, DECL, NAME, SIZE, ALIGN) \
1464 CRIS_ASM_OUTPUT_ALIGNED_DECL_COMMON(FILE, DECL, NAME, SIZE, ALIGN, 1)
1466 /* FIXME: define ASM_OUTPUT_SHARED_COMMON and emit an error when it is
1467 used with -melinux and a.out. */
1469 /* Node: Label Output */
1471 /* Globalizing directive for a label. */
1472 #define GLOBAL_ASM_OP "\t.global "
1474 #define SUPPORTS_WEAK 1
1476 /* Remove any previous definition (elfos.h). */
1477 #undef ASM_GENERATE_INTERNAL_LABEL
1478 #define ASM_GENERATE_INTERNAL_LABEL(LABEL, PREFIX, NUM) \
1479 sprintf (LABEL, "*%s%s%ld", LOCAL_LABEL_PREFIX, PREFIX, (long) NUM)
1481 /* Node: Initialization */
1482 /* (no definitions) */
1484 /* Node: Macros for Initialization */
1485 /* (no definitions) */
1487 /* Node: Instruction Output */
1489 #define REGISTER_NAMES \
1490 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \
1491 "r9", "r10", "r11", "r12", "r13", "sp", "pc", "srp", "faked_ap"}
1493 #define ADDITIONAL_REGISTER_NAMES \
1494 {{"r14", 14}, {"r15", 15}}
1496 #define PRINT_OPERAND(FILE, X, CODE) \
1497 cris_print_operand (FILE, X, CODE)
1499 /* For delay-slot handling. */
1500 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) (CODE == '#')
1502 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1503 cris_print_operand_address (FILE, ADDR)
1505 /* Output an empty line to illustrate the presence of the delay slot. */
1506 #define DBR_OUTPUT_SEQEND(FILE) \
1507 fprintf (FILE, "\n")
1509 #define LOCAL_LABEL_PREFIX (TARGET_ELF ? "." : "")
1511 /* cppinit.c initializes a const array from this, so it must be constant,
1512 can't have it different based on options. Luckily, the prefix is
1513 always allowed, so let's have it on all GCC-generated code. Note that
1514 we have this verbatim everywhere in the back-end, not using %R or %s or
1515 such. */
1516 #define REGISTER_PREFIX "$"
1518 /* Remove any previous definition (elfos.h). */
1519 /* We use -fno-leading-underscore to remove it, when necessary. */
1520 #undef USER_LABEL_PREFIX
1521 #define USER_LABEL_PREFIX "_"
1523 #define ASM_OUTPUT_REG_PUSH(FILE, REGNO) \
1524 fprintf (FILE, "\tpush $%s\n", reg_names[REGNO])
1526 #define ASM_OUTPUT_REG_POP(FILE, REGNO) \
1527 fprintf (FILE, "\tpop $%s\n", reg_names[REGNO])
1530 /* Node: Dispatch Tables */
1532 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1533 asm_fprintf (FILE, "\t.word %LL%d-%LL%d\n", VALUE, REL)
1535 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1536 asm_fprintf (FILE, "\t.dword %LL%d\n", VALUE)
1538 /* Defined to also emit an .align in elfos.h. We don't want that. */
1539 #undef ASM_OUTPUT_CASE_LABEL
1541 /* Since the "bound" insn loads the comparison value if the compared<
1542 value (register) is out of bounds (0..comparison value-1), we need
1543 to output another case to catch it.
1544 The way to find it is to look for the label_ref at the else-arm inside
1545 the expanded casesi core-insn.
1546 FIXME: Check this construct when changing to new version of gcc. */
1547 #define ASM_OUTPUT_CASE_END(STREAM, NUM, TABLE) \
1548 do \
1550 asm_fprintf (STREAM, "\t.word %LL%d-%LL%d%s\n", \
1551 CODE_LABEL_NUMBER \
1552 (XEXP (XEXP (XEXP \
1553 (XVECEXP \
1554 (PATTERN (PREV_INSN (PREV_INSN \
1555 (TABLE))), \
1556 0, 0), 1), 2), 0)), \
1557 NUM, \
1558 (TARGET_PDEBUG ? "; default" : "")); \
1560 while (0)
1563 /* Node: Exception Region Output */
1564 /* (no definitions) */
1565 /* FIXME: Fill in with our own optimized layout. */
1567 /* Node: Alignment Output */
1569 #define ASM_OUTPUT_ALIGN(FILE, LOG) \
1570 fprintf (FILE, "\t.align %d\n", (LOG))
1573 /* Node: All Debuggers */
1575 #define DBX_REGISTER_NUMBER(REGNO) \
1576 ((REGNO) == CRIS_SRP_REGNUM ? CRIS_CANONICAL_SRP_REGNUM : (REGNO))
1578 /* FIXME: Investigate DEBUGGER_AUTO_OFFSET, DEBUGGER_ARG_OFFSET. */
1581 /* Node: DBX Options */
1583 /* Is this correct? Check later. */
1584 #define DBX_NO_XREFS
1586 #define DBX_CONTIN_LENGTH 0
1588 /* FIXME: Is this needed when we have 0 DBX_CONTIN_LENGTH? */
1589 #define DBX_CONTIN_CHAR '?'
1592 /* Node: DBX Hooks */
1593 /* (no definitions) */
1595 /* Node: File names and DBX */
1596 /* (no definitions) */
1599 /* Node: SDB and DWARF */
1600 /* (no definitions) */
1602 /* Node: Misc */
1604 /* FIXME: Check this one more time. */
1605 #define PREDICATE_CODES \
1606 {"cris_orthogonal_operator", \
1607 {PLUS, MINUS, IOR, AND, UMIN}}, \
1608 {"cris_commutative_orth_op", \
1609 {PLUS, IOR, AND, UMIN}}, \
1610 {"cris_operand_extend_operator", \
1611 {PLUS, MINUS, UMIN}}, \
1612 {"cris_additive_operand_extend_operator", \
1613 {PLUS, MINUS}}, \
1614 {"cris_extend_operator", \
1615 {ZERO_EXTEND, SIGN_EXTEND}}, \
1616 {"cris_plus_or_bound_operator", \
1617 {PLUS, UMIN}}, \
1618 {"cris_mem_op", \
1619 {MEM}}, \
1620 {"cris_bdap_operand", \
1621 {SUBREG, REG, LABEL_REF, SYMBOL_REF, MEM, CONST_INT, \
1622 CONST_DOUBLE, CONST, SIGN_EXTEND}}, \
1623 {"cris_bdap_biap_operand", \
1624 {SUBREG, REG, LABEL_REF, SYMBOL_REF, MEM, CONST_INT, \
1625 CONST_DOUBLE, CONST, SIGN_EXTEND, MULT}}, \
1626 {"cris_general_operand_or_gotless_symbol", \
1627 {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF, \
1628 LABEL_REF, SUBREG, REG, MEM}}, \
1629 {"cris_general_operand_or_symbol", \
1630 {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF, \
1631 LABEL_REF, SUBREG, REG, MEM}}, \
1632 {"cris_general_operand_or_plt_symbol", \
1633 {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF, \
1634 LABEL_REF, SUBREG, REG, MEM}}, \
1635 {"cris_mem_call_operand", \
1636 {MEM}},
1638 /* A combination of the bound (umin) insn together with a
1639 sign-extended add via the table to PC seems optimal.
1640 If the table overflows, the assembler will take care of it.
1641 Theoretically, in extreme cases (uncertain if they occur), an error
1642 will be emitted, so FIXME: Check how large case-tables are emitted,
1643 possible add an option to emit SImode case-tables. */
1644 #define CASE_VECTOR_MODE HImode
1646 #define CASE_VECTOR_PC_RELATIVE 1
1648 /* FIXME: Investigate CASE_VECTOR_SHORTEN_MODE to make sure HImode is not
1649 used when broken-.word could possibly fail (plus testcase). */
1651 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
1653 /* This is the number of bytes that can be moved in one
1654 reasonably fast instruction sequence. For CRIS, this is two
1655 instructions: mem => reg, reg => mem. */
1656 #define MOVE_MAX 4
1658 /* Maybe SHIFT_COUNT_TRUNCATED is safe to define? FIXME: Check later. */
1660 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1662 #define Pmode SImode
1664 #define FUNCTION_MODE QImode
1666 #define NO_IMPLICIT_EXTERN_C
1669 * Local variables:
1670 * eval: (c-set-style "gnu")
1671 * indent-tabs-mode: t
1672 * End: