1 /* Definitions of target machine for GNU compiler. AT&T DSP1600.
2 Copyright (C) 1994, 1995, 1996, 1997, 1998, 2000, 2001
3 Free Software Foundation, Inc.
4 Contributed by Michael Collison (collison@world.std.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC 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.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 extern const char *low_reg_names[];
24 extern const char *text_seg_name;
25 extern const char *rsect_text;
26 extern const char *data_seg_name;
27 extern const char *rsect_data;
28 extern const char *bss_seg_name;
29 extern const char *rsect_bss;
30 extern const char *const_seg_name;
31 extern const char *rsect_const;
32 extern const char *chip_name;
33 extern const char *save_chip_name;
34 extern struct rtx_def *dsp16xx_compare_op0, *dsp16xx_compare_op1;
35 extern struct rtx_def *dsp16xx_addhf3_libcall;
36 extern struct rtx_def *dsp16xx_subhf3_libcall;
37 extern struct rtx_def *dsp16xx_mulhf3_libcall;
38 extern struct rtx_def *dsp16xx_divhf3_libcall;
39 extern struct rtx_def *dsp16xx_cmphf3_libcall;
40 extern struct rtx_def *dsp16xx_fixhfhi2_libcall;
41 extern struct rtx_def *dsp16xx_floathihf2_libcall;
42 extern struct rtx_def *dsp16xx_neghf2_libcall;
43 extern struct rtx_def *dsp16xx_umulhi3_libcall;
44 extern struct rtx_def *dsp16xx_mulhi3_libcall;
45 extern struct rtx_def *dsp16xx_udivqi3_libcall;
46 extern struct rtx_def *dsp16xx_udivhi3_libcall;
47 extern struct rtx_def *dsp16xx_divqi3_libcall;
48 extern struct rtx_def *dsp16xx_divhi3_libcall;
49 extern struct rtx_def *dsp16xx_modqi3_libcall;
50 extern struct rtx_def *dsp16xx_modhi3_libcall;
51 extern struct rtx_def *dsp16xx_umodqi3_libcall;
52 extern struct rtx_def *dsp16xx_umodhi3_libcall;
54 extern struct rtx_def *dsp16xx_ashrhi3_libcall;
55 extern struct rtx_def *dsp16xx_ashlhi3_libcall;
56 extern struct rtx_def *dsp16xx_lshrhi3_libcall;
58 /* RUN-TIME TARGET SPECIFICATION */
61 /* Name of the AT&T assembler */
63 #define ASM_PROG "as1600"
65 /* Name of the AT&T linker */
67 #define LD_PROG "ld1600"
69 /* Define which switches take word arguments */
70 #define WORD_SWITCH_TAKES_ARG(STR) \
71 (!strcmp (STR, "ifile") ? 1 : \
79 /* Define this as a spec to call the AT&T assembler */
81 #define CROSS_ASM_SPEC "%{!S:as1600 %a %i\n }"
83 /* Define this as a spec to call the AT&T linker */
85 #define CROSS_LINK_SPEC "%{!c:%{!M:%{!MM:%{!E:%{!S:ld1600 %l %X %{o*} %{m} \
86 %{r} %{s} %{t} %{u*} %{x}\
87 %{!A:%{!nostdlib:%{!nostartfiles:%S}}} %{static:}\
88 %{L*} %D %o %{!nostdlib:-le1600 %L -le1600}\
89 %{!A:%{!nostdlib:%{!nostartfiles:%E}}}\n }}}}}"
91 /* Nothing complicated here, just link with libc.a under normal
93 #define LIB_SPEC "-lc"
95 /* Specify the startup file to link with. */
96 #define STARTFILE_SPEC "%{mmap1:m1_crt0.o%s} \
97 %{mmap2:m2_crt0.o%s} \
98 %{mmap3:m3_crt0.o%s} \
99 %{mmap4:m4_crt0.o%s} \
100 %{!mmap*: %{!ifile*: m4_crt0.o%s} %{ifile*: \
101 %eA -ifile option requires a -map option}}"
103 /* Specify the end file to link with */
105 #define ENDFILE_SPEC "%{mmap1:m1_crtn.o%s} \
106 %{mmap2:m2_crtn.o%s} \
107 %{mmap3:m3_crtn.o%s} \
108 %{mmap4:m4_crtn.o%s} \
109 %{!mmap*: %{!ifile*: m4_crtn.o%s} %{ifile*: \
110 %eA -ifile option requires a -map option}}"
113 /* Tell gcc where to look for the startfile */
114 #define STANDARD_STARTFILE_PREFIX "/d1600/lib"
116 /* Tell gcc where to look for its executables */
117 #define STANDARD_EXEC_PREFIX "/d1600/bin"
119 /* Command line options to the AT&T assembler */
120 #define ASM_SPEC "%{v:-V} %{g*:-g}"
122 /* Command line options for the AT&T linker */
123 #define LINK_SPEC "%{v:-V} %{minit:-i} \
124 %{!ifile*:%{mmap1:-ifile m1_deflt.if%s} \
125 %{mmap2:-ifile m2_deflt.if%s} \
126 %{mmap3:-ifile m3_deflt.if%s} \
127 %{mmap4:-ifile m4_deflt.if%s} \
128 %{!mmap*:-ifile m4_deflt.if%s}} \
131 /* Names to predefine in the preprocessor for this target machine. */
133 #define CPP_PREDEFINES "-Ddsp1600 -DDSP1600 -DMSDOS"
135 #define CPP_PREDEFINES "-Ddsp1600 -DDSP1600 -Ddsp1610 -DDSP1610"
138 /* Run-time compilation parameters selecting different hardware subsets. */
140 extern int target_flags;
142 /* Macros used in the machine description to test the flags. */
144 #define MASK_REGPARM 0x00000001 /* Pass parameters in registers */
145 #define MASK_NEAR_CALL 0x00000002 /* The call is on the same 4k page */
146 #define MASK_NEAR_JUMP 0x00000004 /* The jump is on the same 4k page */
147 #define MASK_BMU 0x00000008 /* Use the 'bmu' shift instructions */
148 #define MASK_OPTIMIZE_MEMORY 0x00000010 /* Optimize to conserve memory */
149 #define MASK_OPTIMIZE_SPEED 0x00000020 /* Optimize for speed */
150 #define MASK_MAP1 0x00000040 /* Link with map1 */
151 #define MASK_MAP2 0x00000080 /* Link with map2 */
152 #define MASK_MAP3 0x00000100 /* Link with map3 */
153 #define MASK_MAP4 0x00000200 /* Link with map4 */
154 #define MASK_YBASE_HIGH 0x00000400 /* The ybase register window starts high */
155 #define MASK_INIT 0x00000800 /* Have the linker generate tables to
156 initialize data at startup */
157 #define MASK_INLINE_MULT 0x00001000 /* Inline 32 bit multiplies */
158 #define MASK_RESERVE_YBASE 0x00002000 /* Reserved the ybase registers */
160 /* Compile passing first two args in regs 0 and 1.
161 This exists only to test compiler features that will
162 be needed for RISC chips. It is not usable
163 and is not intended to be usable on this cpu. */
164 #define TARGET_REGPARM (target_flags & MASK_REGPARM)
166 /* The call is on the same 4k page, so instead of loading
167 the 'pt' register and branching, we can branch directly */
169 #define TARGET_NEAR_CALL (target_flags & MASK_NEAR_CALL)
171 /* The jump is on the same 4k page, so instead of loading
172 the 'pt' register and branching, we can branch directly */
174 #define TARGET_NEAR_JUMP (target_flags & MASK_NEAR_JUMP)
176 /* Generate shift instructions to use the 1610 Bit Manipulation
178 #define TARGET_BMU (target_flags & MASK_BMU)
180 /* Optimize to conserve memory */
181 #define TARGET_OPTIMIZE_MEMORY (target_flags & MASK_OPTIMIZE_MEMORY)
183 /* Optimize for maximum speed */
184 #define TARGET_OPTIMIZE_SPEED (target_flags & MASK_OPTIMIZE_SPEED)
186 #define TARGET_YBASE_HIGH (target_flags & MASK_YBASE_HIGH)
188 /* Direct the linker to output extra info for initialized data */
189 #define TARGET_MASK_INIT (target_flags & MASK_INIT)
191 #define TARGET_INLINE_MULT (target_flags & MASK_INLINE_MULT)
193 /* Reserve the ybase registers *(0) - *(31) */
194 #define TARGET_RESERVE_YBASE (target_flags & MASK_RESERVE_YBASE)
196 /* Macro to define tables used to set the flags.
197 This is a list in braces of pairs in braces,
198 each pair being { "NAME", VALUE }
199 where VALUE is the bits to set or minus the bits to clear.
200 An empty string NAME is used to identify the default VALUE. */
203 #define TARGET_SWITCHES \
205 { "regparm", MASK_REGPARM}, \
206 { "no-regparm", -MASK_REGPARM}, \
207 { "no-near-call", -MASK_NEAR_CALL}, \
208 { "near-jump", MASK_NEAR_JUMP}, \
209 { "no-near-jump", -MASK_NEAR_JUMP}, \
210 { "bmu", MASK_BMU}, \
211 { "no-bmu", -MASK_BMU}, \
212 { "Om", MASK_OPTIMIZE_MEMORY}, \
213 { "Os", MASK_OPTIMIZE_SPEED}, \
214 { "map1", MASK_MAP1}, \
215 { "map2", MASK_MAP2}, \
216 { "map3", MASK_MAP3}, \
217 { "map4", MASK_MAP4}, \
218 { "ybase-high", MASK_YBASE_HIGH}, \
219 { "init", MASK_INIT}, \
220 { "inline-mult", MASK_INLINE_MULT}, \
221 { "reserve-ybase", MASK_RESERVE_YBASE}, \
222 { "", TARGET_DEFAULT} \
225 /* Default target_flags if no switches are specified */
226 #ifndef TARGET_DEFAULT
227 #define TARGET_DEFAULT MASK_OPTIMIZE_MEMORY|MASK_REGPARM|MASK_YBASE_HIGH
230 /* This macro is similar to `TARGET_SWITCHES' but defines names of
231 command options that have values. Its definition is an
232 initializer with a subgrouping for each command option.
234 Each subgrouping contains a string constant, that defines the
235 fixed part of the option name, and the address of a variable.
236 The variable, type `char *', is set to the variable part of the
237 given option if the fixed part matches. The actual option name
238 is made by appending `-m' to the specified name.
240 Here is an example which defines `-mshort-data-NUMBER'. If the
241 given option is `-mshort-data-512', the variable `m88k_short_data'
242 will be set to the string `"512"'.
244 extern char *m88k_short_data;
245 #define TARGET_OPTIONS { { "short-data-", &m88k_short_data } } */
247 #define TARGET_OPTIONS \
249 { "text=", &text_seg_name }, \
250 { "data=", &data_seg_name }, \
251 { "bss=", &bss_seg_name }, \
252 { "const=", &const_seg_name }, \
253 { "chip=", &chip_name } \
256 /* Sometimes certain combinations of command options do not make sense
257 on a particular target machine. You can define a macro
258 `OVERRIDE_OPTIONS' to take account of this. This macro, if
259 defined, is executed once just after all the command options have
262 Don't use this macro to turn on various extra optimizations for
263 `-O'. That is what `OPTIMIZATION_OPTIONS' is for. */
265 #define OVERRIDE_OPTIONS override_options ()
267 #define OPTIMIZATION_OPTIONS(LEVEL,SIZE) \
270 flag_gnu_linker = FALSE; \
274 flag_strength_reduce = FALSE; \
275 flag_inline_functions = FALSE; \
282 /* Define if you don't want extended real, but do want to use the
283 software floating point emulator for REAL_ARITHMETIC and
284 decimal <-> binary conversion. */
285 #define REAL_ARITHMETIC
287 /* Define this if most significant bit is lowest numbered
288 in instructions that operate on numbered bit-fields.
290 #define BITS_BIG_ENDIAN 1
292 /* Define this if most significant byte of a word is the lowest numbered.
293 We define big-endian, but since the 1600 series cannot address bytes
294 it does not matter. */
295 #define BYTES_BIG_ENDIAN 1
297 /* Define this if most significant word of a multiword number is numbered.
298 For the 1600 we can decide arbitrarily since there are no machine instructions for them. */
299 #define WORDS_BIG_ENDIAN 1
301 /* number of bits in an addressable storage unit */
302 #define BITS_PER_UNIT 16
304 /* Width in bits of a "word", which is the contents of a machine register.
305 Note that this is not necessarily the width of data type `int';
306 if using 16-bit ints on a 68000, this would still be 32.
307 But on a machine with 16-bit registers, this would be 16. */
308 #define BITS_PER_WORD 16
310 /* Maximum number of bits in a word. */
311 #define MAX_BITS_PER_WORD 16
313 /* Width of a word, in units (bytes). */
314 #define UNITS_PER_WORD 1
316 /* Width in bits of a pointer.
317 See also the macro `Pmode' defined below. */
318 #define POINTER_SIZE 16
320 /* Allocation boundary (in *bits*) for storing pointers in memory. */
321 #define POINTER_BOUNDARY 16
323 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
324 #define PARM_BOUNDARY 16
326 /* Boundary (in *bits*) on which stack pointer should be aligned. */
327 #define STACK_BOUNDARY 16
329 /* Allocation boundary (in *bits*) for the code of a function. */
330 #define FUNCTION_BOUNDARY 16
332 /* Biggest alignment that any data type can require on this machine, in bits. */
333 #define BIGGEST_ALIGNMENT 16
335 /* Biggest alignment that any structure field can require on this machine, in bits */
336 #define BIGGEST_FIELD_ALIGNMENT 16
338 /* Alignment of field after `int : 0' in a structure. */
339 #define EMPTY_FIELD_BOUNDARY 16
341 /* Number of bits which any structure or union's size must be a multiple of. Each structure
342 or union's size is rounded up to a multiple of this */
343 #define STRUCTURE_SIZE_BOUNDARY 16
345 /* Define this if move instructions will actually fail to work
346 when given unaligned data. */
347 #define STRICT_ALIGNMENT 1
349 /* An integer expression for the size in bits of the largest integer machine mode that
350 should actually be used. All integer machine modes of this size or smaller can be
351 used for structures and unions with the appropriate sizes. */
352 #define MAX_FIXED_MODE_SIZE 32
354 /* LAYOUT OF SOURCE LANGUAGE DATA TYPES */
356 #define CHAR_TYPE_SIZE 16
357 #define SHORT_TYPE_SIZE 16
358 #define INT_TYPE_SIZE 16
359 #define LONG_TYPE_SIZE 32
360 #define LONG_LONG_TYPE_SIZE 32
361 #define FLOAT_TYPE_SIZE 32
362 #define DOUBLE_TYPE_SIZE 32
363 #define LONG_DOUBLE_TYPE_SIZE 32
365 /* An expression whose value is 1 or 0, according to whether the type char should be
366 signed or unsigned by default. */
368 #define DEFAULT_SIGNED_CHAR 1
370 /* A C expression to determine whether to give an enum type only as many bytes
371 as it takes to represent the range of possible values of that type. A nonzero
372 value means to do that; a zero value means all enum types should be allocated
375 #define DEFAULT_SHORT_ENUMS 0
377 /* A C expression for a string describing the name of the data type to use for
380 #define SIZE_TYPE "long unsigned int"
382 /* A C expression for a string describing the name of the datat type to use for the
383 result of subtracting two pointers */
385 #define PTRDIFF_TYPE "long int"
387 /* REGISTER USAGE. */
389 #define ALL_16_BIT_REGISTERS 1
391 /* Number of actual hardware registers.
392 The hardware registers are assigned numbers for the compiler
393 from 0 to FIRST_PSEUDO_REGISTER-1 */
395 #define FIRST_PSEUDO_REGISTER (REG_YBASE31 + 1)
397 /* 1 for registers that have pervasive standard uses
398 and are not available for the register allocator.
400 The registers are laid out as follows:
402 {a0,a0l,a1,a1l,x,y,yl,p,pl} - Data Arithmetic Unit
403 {r0,r1,r2,r3,j,k,ybase} - Y Space Address Arithmetic Unit
404 {pt} - X Space Address Arithmetic Unit
405 {ar0,ar1,ar2,ar3} - Bit Manipulation UNit
406 {pr} - Return Address Register
408 We reserve r2 for the Stack Pointer.
409 We specify r3 for the Frame Pointer but allow the compiler
410 to omit it when possible since we have so few pointer registers. */
438 #define REG_YBASE0 26
439 #define REG_YBASE1 27
440 #define REG_YBASE2 28
441 #define REG_YBASE3 29
442 #define REG_YBASE4 30
443 #define REG_YBASE5 31
444 #define REG_YBASE6 32
445 #define REG_YBASE7 33
446 #define REG_YBASE8 34
447 #define REG_YBASE9 35
448 #define REG_YBASE10 36
449 #define REG_YBASE11 37
450 #define REG_YBASE12 38
451 #define REG_YBASE13 39
452 #define REG_YBASE14 40
453 #define REG_YBASE15 41
454 #define REG_YBASE16 42
455 #define REG_YBASE17 43
456 #define REG_YBASE18 44
457 #define REG_YBASE19 45
458 #define REG_YBASE20 46
459 #define REG_YBASE21 47
460 #define REG_YBASE22 48
461 #define REG_YBASE23 49
462 #define REG_YBASE24 50
463 #define REG_YBASE25 51
464 #define REG_YBASE26 52
465 #define REG_YBASE27 53
466 #define REG_YBASE28 54
467 #define REG_YBASE29 55
468 #define REG_YBASE30 56
469 #define REG_YBASE31 57
471 /* Do we have a accumulator register? */
472 #define IS_ACCUM_REG(REGNO) ((REGNO) >= REG_A0 && (REGNO) <= REG_A1L)
473 #define IS_ACCUM_LOW_REG(REGNO) ((REGNO) == REG_A0L || (REGNO) == REG_A1L)
475 /* Do we have a virtual ybase register */
476 #define IS_YBASE_REGISTER_WINDOW(REGNO) ((REGNO) >= REG_YBASE0 && (REGNO) <= REG_YBASE31)
478 #define IS_ADDRESS_REGISTER(REGNO) ((REGNO) >= REG_R0 && (REGNO) <= REG_R3)
480 #define FIXED_REGISTERS \
481 {0, 0, 0, 0, 0, 0, 0, 0, 0, \
482 0, 0, 0, 1, 0, 0, 1, \
487 0, 0, 0, 0, 0, 0, 0, 0, \
488 0, 0, 0, 0, 0, 0, 0, 0, \
489 0, 0, 0, 0, 0, 0, 0, 0, \
490 0, 0, 0, 0, 0, 0, 0, 0}
492 /* 1 for registers not available across function calls.
493 These must include the FIXED_REGISTERS and also any
494 registers that can be used without being saved.
495 The latter must include the registers where values are returned
496 and the register where structure-value addresses are passed.
497 On the 1610 'a0' holds return values from functions. 'r0' holds
498 structure-value addresses.
500 In addition we don't save either j, k, ybase or any of the
501 bit manipulation registers. */
504 #define CALL_USED_REGISTERS \
505 {1, 1, 1, 1, 0, 1, 1, 1, 1, \
506 1, 0, 0, 1, 1, 1, 1, \
511 0, 0, 0, 0, 0, 0, 0, 0, \
512 0, 0, 0, 0, 0, 0, 0, 0, \
513 0, 0, 0, 0, 0, 0, 0, 0, \
514 0, 0, 0, 0, 0, 0, 0, 0}
516 /* List the order in which to allocate registers. Each register must be
517 listed once, even those in FIXED_REGISTERS.
519 We allocate in the following order:
522 #define REG_ALLOC_ORDER \
523 { REG_R0, REG_R1, REG_R2, REG_PROD, REG_Y, REG_X, \
524 REG_PRODL, REG_YL, REG_AR0, REG_AR1, \
525 REG_RB, REG_A0, REG_A1, REG_A0L, \
526 REG_A1L, REG_AR2, REG_AR3, \
527 REG_YBASE, REG_J, REG_K, REG_PR, REG_PT, REG_C0, \
528 REG_C1, REG_C2, REG_R3, \
529 REG_YBASE0, REG_YBASE1, REG_YBASE2, REG_YBASE3, \
530 REG_YBASE4, REG_YBASE5, REG_YBASE6, REG_YBASE7, \
531 REG_YBASE8, REG_YBASE9, REG_YBASE10, REG_YBASE11, \
532 REG_YBASE12, REG_YBASE13, REG_YBASE14, REG_YBASE15, \
533 REG_YBASE16, REG_YBASE17, REG_YBASE18, REG_YBASE19, \
534 REG_YBASE20, REG_YBASE21, REG_YBASE22, REG_YBASE23, \
535 REG_YBASE24, REG_YBASE25, REG_YBASE26, REG_YBASE27, \
536 REG_YBASE28, REG_YBASE29, REG_YBASE30, REG_YBASE31 }
538 /* Zero or more C statements that may conditionally modify two
539 variables `fixed_regs' and `call_used_regs' (both of type `char
540 []') after they have been initialized from the two preceding
543 This is necessary in case the fixed or call-clobbered registers
544 depend on target flags.
546 You need not define this macro if it has no work to do.
548 If the usage of an entire class of registers depends on the target
549 flags, you may indicate this to GCC by using this macro to modify
550 `fixed_regs' and `call_used_regs' to 1 for each of the registers in
551 the classes which should not be used by GCC. Also define the macro
552 `REG_CLASS_FROM_LETTER' to return `NO_REGS' if it is called with a
553 letter for a class that shouldn't be used.
555 (However, if this class is not included in `GENERAL_REGS' and all
556 of the insn patterns whose constraints permit this class are
557 controlled by target switches, then GCC will automatically avoid
558 using these registers when the target switches are opposed to
559 them.) If the user tells us there is no BMU, we can't use
560 ar0-ar3 for register allocation */
562 #define CONDITIONAL_REGISTER_USAGE \
569 for (regno = REG_AR0; regno <= REG_AR3; regno++) \
570 fixed_regs[regno] = call_used_regs[regno] = 1; \
572 if (TARGET_RESERVE_YBASE) \
576 for (regno = REG_YBASE0; regno <= REG_YBASE31; regno++) \
577 fixed_regs[regno] = call_used_regs[regno] = 1; \
582 /* Determine which register classes are very likely used by spill registers.
583 local-alloc.c won't allocate pseudos that have these classes as their
584 preferred class unless they are "preferred or nothing". */
586 #define CLASS_LIKELY_SPILLED_P(CLASS) \
587 ((CLASS) != ALL_REGS && (CLASS) != YBASE_VIRT_REGS)
589 /* Return number of consecutive hard regs needed starting at reg REGNO
590 to hold something of mode MODE.
591 This is ordinarily the length in words of a value of mode MODE
592 but can be less for certain modes in special long registers. */
594 #define HARD_REGNO_NREGS(REGNO, MODE) \
595 (GET_MODE_SIZE(MODE))
597 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE. */
599 #define HARD_REGNO_MODE_OK(REGNO, MODE) hard_regno_mode_ok(REGNO, MODE)
601 /* Value is 1 if it is a good idea to tie two pseudo registers
602 when one has mode MODE1 and one has mode MODE2.
603 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
604 for any hard reg, then this must be 0 for correct output. */
605 #define MODES_TIEABLE_P(MODE1, MODE2) \
606 (((MODE1) == (MODE2)) || \
607 (GET_MODE_CLASS((MODE1)) == MODE_FLOAT) \
608 == (GET_MODE_CLASS((MODE2)) == MODE_FLOAT))
610 /* Specify the registers used for certain standard purposes.
611 The values of these macros are register numbers. */
613 /* DSP1600 pc isn't overloaded on a register. */
614 /* #define PC_REGNUM */
616 /* Register to use for pushing function arguments.
617 This is r3 in our case */
618 #define STACK_POINTER_REGNUM REG_R3
620 /* Base register for access to local variables of the function.
621 This is r2 in our case */
622 #define FRAME_POINTER_REGNUM REG_R2
624 /* We can debug without the frame pointer */
625 #define CAN_DEBUG_WITHOUT_FP 1
627 /* The 1610 saves the return address in this register */
628 #define RETURN_ADDRESS_REGNUM REG_PR
630 /* Base register for access to arguments of the function. */
631 #define ARG_POINTER_REGNUM FRAME_POINTER_REGNUM
633 /* Register in which static-chain is passed to a function. */
635 #define STATIC_CHAIN_REGNUM 4
637 /* Register in which address to store a structure value
638 is passed to a function. This is 'r0' in our case */
639 #define STRUCT_VALUE_REGNUM REG_R0
641 /* Define the classes of registers for register constraints in the
642 machine description. Also define ranges of constants.
644 One of the classes must always be named ALL_REGS and include all hard regs.
645 If there is more than one class, another class must be named NO_REGS
646 and contain no registers.
648 The name GENERAL_REGS must be the name of a class (or an alias for
649 another name such as ALL_REGS). This is the class of registers
650 that is allowed by "g" or "r" in a register constraint.
651 Also, registers outside this class are allocated only when
652 instructions express preferences for them.
654 The classes must be numbered in nondecreasing order; that is,
655 a larger-numbered class must never be contained completely
656 in a smaller-numbered class.
658 For any two classes, it is very desirable that there be another
659 class that represents their union. */
678 YH_OR_ACCUM_HIGH_REGS,
681 YL_OR_ACCUM_LOW_REGS,
689 PL_OR_ACCUM_LOW_REGS,
691 YL_OR_PL_OR_ACCUM_LOW_REGS,
695 ACCUM_LOW_OR_YL_OR_P_REGS,
698 NO_FRAME_Y_ADDR_REGS,
700 ACCUM_LOW_OR_Y_ADDR_REGS,
701 ACCUM_OR_Y_ADDR_REGS,
705 NON_HIGH_YBASE_ELIGIBLE_REGS,
708 J_OR_DAU_16_BIT_REGS,
710 NOHIGH_NON_ADDR_REGS,
713 NOHIGH_NON_YBASE_REGS,
714 NO_ACCUM_NON_YBASE_REGS,
717 ACCUM_LOW_OR_YBASE_REGS,
721 ACCUM_LOW_YL_PL_OR_YBASE_REGS,
723 ACCUM_Y_P_OR_YBASE_REGS,
724 Y_ADDR_OR_YBASE_REGS,
725 YBASE_OR_NOHIGH_YBASE_ELIGIBLE_REGS,
726 YBASE_OR_YBASE_ELIGIBLE_REGS,
732 /* GENERAL_REGS must be the name of a register class */
733 #define GENERAL_REGS ALL_REGS
735 #define N_REG_CLASSES (int) LIM_REG_CLASSES
737 /* Give names of register classes as strings for dump file. */
739 #define REG_CLASS_NAMES \
752 "X_OR_ACCUM_LOW_REGS", \
755 "YH_OR_ACCUM_HIGH_REGS", \
758 "YL_OR_ACCUM_LOW_REGS", \
766 "PL_OR_ACCUM_LOW_REGS", \
768 "PL_OR_YL_OR_ACCUM_LOW_REGS", \
772 "ACCUM_LOW_OR_YL_OR_P_REGS", \
774 "ACCUM_Y_OR_P_REGS", \
775 "NO_FRAME_Y_ADDR_REGS", \
777 "ACCUM_LOW_OR_Y_ADDR_REGS", \
778 "ACCUM_OR_Y_ADDR_REGS", \
779 "X_OR_Y_ADDR_REGS", \
780 "Y_OR_Y_ADDR_REGS", \
781 "P_OR_Y_ADDR_REGS", \
782 "NON_HIGH_YBASE_ELIGIBLE_REGS", \
783 "YBASE_ELIGIBLE_REGS", \
785 "J_OR_DAU_16_BIT_REGS", \
787 "NOHIGH_NON_ADDR_REGS", \
789 "SLOW_MEM_LOAD_REGS", \
790 "NOHIGH_NON_YBASE_REGS", \
791 "NO_ACCUM_NON_YBASE_REGS", \
794 "ACCUM_LOW_OR_YBASE_REGS", \
795 "ACCUM_OR_YBASE_REGS", \
798 "ACCUM_LOW_YL_PL_OR_YBASE_REGS", \
800 "ACCUM_Y_P_OR_YBASE_REGS", \
801 "Y_ADDR_OR_YBASE_REGS", \
802 "YBASE_OR_NOHIGH_YBASE_ELIGIBLE_REGS", \
803 "YBASE_OR_YBASE_ELIGIBLE_REGS", \
804 "NO_HIGH_ALL_REGS", \
808 /* Define which registers fit in which classes.
809 This is an initializer for a vector of HARD_REG_SET
810 of length N_REG_CLASSES. */
812 #define REG_CLASS_CONTENTS \
814 {0x00000000, 0x00000000}, /* no reg */ \
815 {0x00000001, 0x00000000}, /* a0h */ \
816 {0x00000002, 0x00000000}, /* a0l */ \
817 {0x00000003, 0x00000000}, /* a0h:a0l */ \
818 {0x00000004, 0x00000000}, /* a1h */ \
819 {0x00000005, 0x00000000}, /* accum high */ \
820 {0x00000008, 0x00000000}, /* a1l */ \
821 {0x0000000A, 0x00000000}, /* accum low */ \
822 {0x0000000c, 0x00000000}, /* a1h:a1l */ \
823 {0x0000000f, 0x00000000}, /* accum regs */ \
824 {0x00000010, 0x00000000}, /* x reg */ \
825 {0x0000001A, 0x00000000}, /* x & accum_low_regs */ \
826 {0x0000001f, 0x00000000}, /* x & accum regs */ \
827 {0x00000020, 0x00000000}, /* y high */ \
828 {0x00000025, 0x00000000}, /* yh, accum high */ \
829 {0x00000030, 0x00000000}, /* x & yh */ \
830 {0x00000040, 0x00000000}, /* y low */ \
831 {0x0000004A, 0x00000000}, /* y low, accum_low */ \
832 {0x00000050, 0x00000000}, /* x & yl */ \
833 {0x00000060, 0x00000000}, /* yl:yh */ \
834 {0x00000070, 0x00000000}, /* x, yh,a nd yl */ \
835 {0x0000006F, 0x00000000}, /* accum, y */ \
836 {0x00000080, 0x00000000}, /* p high */ \
837 {0x00000090, 0x00000000}, /* x & ph */ \
838 {0x00000100, 0x00000000}, /* p low */ \
839 {0x0000010A, 0x00000000}, /* p_low and accum_low */ \
840 {0x00000110, 0x00000000}, /* x & pl */ \
841 {0x0000014A, 0x00000000}, /* pl,yl,a1l,a0l */ \
842 {0x00000180, 0x00000000}, /* pl:ph */ \
843 {0x0000018F, 0x00000000}, /* accum, p */ \
844 {0x000001C0, 0x00000000}, /* pl:ph and yl */ \
845 {0x000001CA, 0x00000000}, /* pl:ph, yl, a0l, a1l */ \
846 {0x000001E0, 0x00000000}, /* y or p */ \
847 {0x000001EF, 0x00000000}, /* accum, y or p */ \
848 {0x00000E00, 0x00000000}, /* r0-r2 */ \
849 {0x00001E00, 0x00000000}, /* r0-r3 */ \
850 {0x00001E0A, 0x00000000}, /* r0-r3, accum_low */ \
851 {0x00001E0F, 0x00000000}, /* accum,r0-r3 */ \
852 {0x00001E10, 0x00000000}, /* x,r0-r3 */ \
853 {0x00001E60, 0x00000000}, /* y,r0-r3 */ \
854 {0x00001F80, 0x00000000}, /* p,r0-r3 */ \
855 {0x00001FDA, 0x00000000}, /* ph:pl, r0-r3, x,a0l,a1l */ \
856 {0x00001fff, 0x00000000}, /* accum,x,y,p,r0-r3 */ \
857 {0x00002000, 0x00000000}, /* j */ \
858 {0x00002025, 0x00000000}, /* j, yh, a1h, a0h */ \
859 {0x001E0000, 0x00000000}, /* ar0-ar3 */ \
860 {0x03FFE1DA, 0x00000000}, /* non_addr except yh,a0h,a1h */ \
861 {0x03FFE1FF, 0x00000000}, /* non_addr regs */ \
862 {0x03FFFF8F, 0x00000000}, /* non ybase except yh, yl, and x */ \
863 {0x03FFFFDA, 0x00000000}, /* non ybase regs except yh,a0h,a1h */ \
864 {0x03FFFFF0, 0x00000000}, /* non ybase except a0,a0l,a1,a1l */ \
865 {0x03FFFFFF, 0x00000000}, /* non ybase regs */ \
866 {0xFC000000, 0x03FFFFFF}, /* virt ybase regs */ \
867 {0xFC00000A, 0x03FFFFFF}, /* accum_low, virt ybase regs */ \
868 {0xFC00000F, 0x03FFFFFF}, /* accum, virt ybase regs */ \
869 {0xFC000010, 0x03FFFFFF}, /* x,virt ybase regs */ \
870 {0xFC000060, 0x03FFFFFF}, /* y,virt ybase regs */ \
871 {0xFC00014A, 0x03FFFFFF}, /* accum_low, yl, pl, ybase */ \
872 {0xFC000180, 0x03FFFFFF}, /* p,virt ybase regs */ \
873 {0xFC0001EF, 0x03FFFFFF}, /* accum,y,p,ybase regs */ \
874 {0xFC001E00, 0x03FFFFFF}, /* r0-r3, ybase regs */ \
875 {0xFC001FDA, 0x03FFFFFF}, /* r0-r3, pl:ph,yl,x,a1l,a0l */ \
876 {0xFC001FFF, 0x03FFFFFF}, /* virt ybase, ybase eligible regs */ \
877 {0xFCFFFFDA, 0x03FFFFFF}, /* all regs except yh,a0h,a1h */ \
878 {0xFFFFFFFF, 0x03FFFFFF} /* all regs */ \
882 /* The same information, inverted:
883 Return the class number of the smallest class containing
884 reg number REGNO. This could be a conditional expression
885 or could index an array. */
887 #define REGNO_REG_CLASS(REGNO) regno_reg_class(REGNO)
889 /* The class value for index registers, and the one for base regs. */
891 #define INDEX_REG_CLASS NO_REGS
892 #define BASE_REG_CLASS Y_ADDR_REGS
894 /* Get reg_class from a letter such as appears in the machine description. */
896 #define REG_CLASS_FROM_LETTER(C) \
897 dsp16xx_reg_class_from_letter(C)
899 #define SECONDARY_RELOAD_CLASS(CLASS, MODE, X) \
900 secondary_reload_class(CLASS, MODE, X)
902 /* When defined, the compiler allows registers explicitly used in the
903 rtl to be used as spill registers but prevents the compiler from
904 extending the lifetime of these registers. */
906 #define SMALL_REGISTER_CLASSES 1
908 /* Macros to check register numbers against specific register classes. */
910 /* These assume that REGNO is a hard or pseudo reg number.
911 They give nonzero only if REGNO is a hard reg of the suitable class
912 or a pseudo reg currently allocated to a suitable hard reg.
913 Since they use reg_renumber, they are safe only once reg_renumber
914 has been allocated, which happens in local-alloc.c. */
916 /* A C expression which is nonzero if register REGNO is suitable for use
917 as a base register in operand addresses. It may be either a suitable
918 hard register or a pseudo register that has been allocated such a
921 On the 1610 the Y address pointers can be used as a base registers */
922 #define REGNO_OK_FOR_BASE_P(REGNO) \
923 (((REGNO) >= REG_R0 && (REGNO) < REG_R3 + 1) || ((unsigned) reg_renumber[REGNO] >= REG_R0 \
924 && (unsigned) reg_renumber[REGNO] < REG_R3 + 1))
926 #define REGNO_OK_FOR_YBASE_P(REGNO) \
927 (((REGNO) == REG_YBASE) || ((unsigned) reg_renumber[REGNO] == REG_YBASE))
929 #define REGNO_OK_FOR_INDEX_P(REGNO) 0
931 #ifdef ALL_16_BIT_REGISTERS
932 #define IS_32_BIT_REG(REGNO) 0
934 #define IS_32_BIT_REG(REGNO) \
935 ((REGNO) == REG_A0 || (REGNO) == REG_A1 || (REGNO) == REG_Y || (REGNO) == REG_PROD)
938 /* Given an rtx X being reloaded into a reg required to be
939 in class CLASS, return the class of reg to actually use.
940 In general this is just CLASS; but on some machines
941 in some cases it is preferable to use a more restrictive class.
942 Also, we must ensure that a PLUS is reloaded either
943 into an accumulator or an address register. */
945 #define PREFERRED_RELOAD_CLASS(X,CLASS) preferred_reload_class (X, CLASS)
947 /* A C expression that places additional restrictions on the register
948 class to use when it is necessary to be able to hold a value of
949 mode MODE in a reload register for which class CLASS would
952 Unlike `PREFERRED_RELOAD_CLASS', this macro should be used when
953 there are certain modes that simply can't go in certain reload
956 The value is a register class; perhaps CLASS, or perhaps another,
959 Don't define this macro unless the target machine has limitations
960 which require the macro to do something nontrivial. */
963 #define LIMIT_RELOAD_CLASS(MODE, CLASS) dsp16xx_limit_reload_class (MODE, CLASS)
966 /* A C expression for the maximum number of consecutive registers of class CLASS
967 needed to hold a value of mode MODE */
968 #define CLASS_MAX_NREGS(CLASS, MODE) \
969 class_max_nregs(CLASS, MODE)
971 /* The letters 'I' through 'P' in a register constraint string
972 can be used to stand for particular ranges of immediate operands.
973 This macro defines what the ranges are.
974 C is the letter, and VALUE is a constant value.
975 Return 1 if VALUE is in the range specified by C.
977 For the 16xx, the following constraints are used:
978 'I' requires a non-negative 16-bit value.
979 'J' requires a non-negative 9-bit value
980 'K' requires a constant 0 operand.
981 'L' requires 16-bit value
982 'M' 32-bit value -- low 16-bits zero
985 #define SMALL_INT(X) (SMALL_INTVAL (INTVAL (X)))
986 #define SMALL_INTVAL(I) ((unsigned) (I) < 0x10000)
987 #define SHORT_IMMEDIATE(X) (SHORT_INTVAL (INTVAL(X)))
988 #define SHORT_INTVAL(I) ((unsigned) (I) < 0x100)
990 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
991 ((C) == 'I' ? (SMALL_INTVAL(VALUE)) \
992 : (C) == 'J' ? (SHORT_INTVAL(VALUE)) \
993 : (C) == 'K' ? ((VALUE) == 0) \
994 : (C) == 'L' ? ! ((VALUE) & ~0x0000ffff) \
995 : (C) == 'M' ? ! ((VALUE) & ~0xffff0000) \
996 : (C) == 'N' ? ((VALUE) == -1 || (VALUE) == 1 || \
997 (VALUE) == -2 || (VALUE) == 2) \
1000 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) 1
1002 /* Optional extra constraints for this machine */
1003 #define EXTRA_CONSTRAINT(OP,C) \
1004 ((C) == 'R' ? symbolic_address_p (OP) \
1007 /* DESCRIBING STACK LAYOUT AND CALLING CONVENTIONS */
1009 /* Define this if pushing a word on the stack
1010 makes the stack pointer a smaller address. */
1011 /* #define STACK_GROWS_DOWNWARD */
1013 /* Define this if the nominal address of the stack frame
1014 is at the high-address end of the local variables;
1015 that is, each additional local variable allocated
1016 goes at a more negative offset in the frame. */
1017 /* #define FRAME_GROWS_DOWNWARD */
1019 #define ARGS_GROW_DOWNWARD
1021 /* We use post decrement on the 1600 because there isn't
1022 a pre-decrement addressing mode. This means that we
1023 assume the stack pointer always points at the next
1024 FREE location on the stack. */
1025 #define STACK_PUSH_CODE POST_INC
1027 /* Offset within stack frame to start allocating local variables at.
1028 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
1029 first local allocated. Otherwise, it is the offset to the BEGINNING
1030 of the first local allocated. */
1031 #define STARTING_FRAME_OFFSET 0
1033 /* Offset from the stack pointer register to the first
1034 location at which outgoing arguments are placed. */
1035 #define STACK_POINTER_OFFSET (0)
1037 struct dsp16xx_frame_info
1039 unsigned long total_size; /* # bytes that the entire frame takes up */
1040 unsigned long var_size; /* # bytes that variables take up */
1041 unsigned long args_size; /* # bytes that outgoing arguments take up */
1042 unsigned long extra_size; /* # bytes of extra gunk */
1043 unsigned int reg_size; /* # bytes needed to store regs */
1044 long fp_save_offset; /* offset from vfp to store registers */
1045 unsigned long sp_save_offset; /* offset from new sp to store registers */
1046 int initialized; /* != 0 if frame size already calculated */
1047 int num_regs; /* number of registers saved */
1048 int function_makes_calls; /* Does the function make calls */
1051 extern struct dsp16xx_frame_info current_frame_info;
1053 /* If we generate an insn to push BYTES bytes,
1054 this says how many the stack pointer really advances by. */
1055 /* #define PUSH_ROUNDING(BYTES) ((BYTES)) */
1057 /* If defined, the maximum amount of space required for outgoing
1058 arguments will be computed and placed into the variable
1059 'current_function_outgoing_args_size'. No space will be pushed
1060 onto the stack for each call; instead, the function prologue should
1061 increase the stack frame size by this amount.
1063 It is not proper to define both 'PUSH_ROUNDING' and
1064 'ACCUMULATE_OUTGOING_ARGS'. */
1065 #define ACCUMULATE_OUTGOING_ARGS 1
1067 /* Offset of first parameter from the argument pointer
1070 #define FIRST_PARM_OFFSET(FNDECL) (0)
1072 /* Value is 1 if returning from a function call automatically
1073 pops the arguments described by the number-of-args field in the call.
1074 FUNDECL is the declaration node of the function (as a tree),
1075 FUNTYPE is the data type of the function (as a tree),
1076 or for a library call it is an identifier node for the subroutine name. */
1078 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
1080 /* Define how to find the value returned by a function.
1081 VALTYPE is the data type of the value (as a tree).
1082 If the precise function being called is known, FUNC is its FUNCTION_DECL;
1083 otherwise, FUNC is 0. On the 1610 all function return their values
1084 in a0 (i.e. the upper 16 bits). If the return value is 32-bits the
1085 entire register is significant. */
1087 #define VALUE_REGNO(MODE) (REG_Y)
1089 #define FUNCTION_VALUE(VALTYPE, FUNC) \
1090 gen_rtx_REG (TYPE_MODE (VALTYPE), VALUE_REGNO(TYPE_MODE(VALTYPE)))
1092 /* Define how to find the value returned by a library function
1093 assuming the value has mode MODE. */
1094 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, VALUE_REGNO(MODE))
1096 /* 1 if N is a possible register number for a function value. */
1097 #define FUNCTION_VALUE_REGNO_P(N) ((N) == REG_Y)
1100 /* Define where to put the arguments to a function.
1101 Value is zero to push the argument on the stack,
1102 or a hard register in which to store the argument.
1104 MODE is the argument's machine mode.
1105 TYPE is the data type of the argument (as a tree).
1106 This is null for libcalls where that information may
1108 CUM is a variable of type CUMULATIVE_ARGS which gives info about
1109 the preceding args and about the function being called.
1110 NAMED is nonzero if this argument is a named parameter
1111 (otherwise it is an extra parameter matching an ellipsis). */
1113 /* On the 1610 all args are pushed, except if -mregparm is specified
1114 then the first two words of arguments are passed in a0, a1. */
1115 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
1116 dsp16xx_function_arg (CUM, MODE, TYPE, NAMED)
1118 /* Define the first register to be used for argument passing */
1119 #define FIRST_REG_FOR_FUNCTION_ARG REG_Y
1121 /* Define the profitability of saving registers around calls.
1122 NOTE: For now we turn this off because of a bug in the
1123 caller-saves code and also because i'm not sure it is helpful
1126 #define CALLER_SAVE_PROFITABLE(REFS,CALLS) 0
1128 /* This indicates that an argument is to be passed with an invisible reference
1129 (i.e., a pointer to the object is passed).
1131 On the dsp16xx, we do this if it must be passed on the stack. */
1133 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
1134 (MUST_PASS_IN_STACK (MODE, TYPE))
1136 /* For an arg passed partly in registers and partly in memory,
1137 this is the number of registers used.
1138 For args passed entirely in registers or entirely in memory, zero. */
1140 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) (0)
1142 /* Define a data type for recording info about an argument list
1143 during the scan of that argument list. This data type should
1144 hold all necessary information about the function itself
1145 and about the args processed so far, enough to enable macros
1146 such as FUNCTION_ARG to determine where the next arg should go. */
1147 #define CUMULATIVE_ARGS int
1149 /* Initialize a variable CUM of type CUMULATIVE_ARGS
1150 for a call to a function whose data type is FNTYPE.
1151 For a library call, FNTYPE is 0. */
1152 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) ((CUM) = 0)
1154 /* Update the data in CUM to advance over an argument
1155 of mode MODE and data type TYPE.
1156 (TYPE is null for libcalls where that information may not be available.) */
1158 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
1159 dsp16xx_function_arg_advance (&CUM, MODE,TYPE, NAMED)
1161 /* 1 if N is a possible register number for function argument passing. */
1162 #define FUNCTION_ARG_REGNO_P(N) \
1163 ((N) == REG_Y || (N) == REG_YL || (N) == REG_PROD || (N) == REG_PRODL)
1165 /* Output assembler code to FILE to increment profiler label # LABELNO
1166 for profiling a function entry. */
1168 #define FUNCTION_PROFILER(FILE, LABELNO) \
1169 internal_error ("Profiling not implemented yet.")
1171 /* Output assembler code to FILE to initialize this source file's
1172 basic block profiling info, if that has not already been done. */
1173 #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
1174 internal_error ("Profiling not implemented yet.")
1176 /* Output assembler code to FILE to increment the entry-count for
1177 the BLOCKNO'th basic block in this source file. */
1178 #define BLOCK_PROFILER(FILE, BLOCKNO) \
1179 internal_error ("Profiling not implemented yet.")
1182 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
1183 the stack pointer does not matter. The value is tested only in
1184 functions that have frame pointers.
1185 No definition is equivalent to always zero. */
1187 #define EXIT_IGNORE_STACK (0)
1189 #define TRAMPOLINE_TEMPLATE(FILE) \
1190 internal_error ("Trampolines not yet implemented");
1192 /* Length in units of the trampoline for entering a nested function.
1193 This is a dummy value */
1195 #define TRAMPOLINE_SIZE 20
1197 /* Emit RTL insns to initialize the variable parts of a trampoline.
1198 FNADDR is an RTX for the address of the function's pure code.
1199 CXT is an RTX for the static chain value for the function. */
1201 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1202 internal_error ("Trampolines not yet implemented");
1204 /* A C expression which is nonzero if a function must have and use a
1205 frame pointer. If its value is nonzero the functions will have a
1207 #define FRAME_POINTER_REQUIRED (current_function_calls_alloca)
1209 /* A C statement to store in the variable 'DEPTH' the difference
1210 between the frame pointer and the stack pointer values immediately
1211 after the function prologue. */
1212 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH) \
1213 { (DEPTH) = initial_frame_pointer_offset(); \
1216 /* IMPLICIT CALLS TO LIBRARY ROUTINES */
1218 #define ADDHF3_LIBCALL "__Emulate_addhf3"
1219 #define SUBHF3_LIBCALL "__Emulate_subhf3"
1220 #define MULHF3_LIBCALL "__Emulate_mulhf3"
1221 #define DIVHF3_LIBCALL "__Emulate_divhf3"
1222 #define CMPHF3_LIBCALL "__Emulate_cmphf3"
1223 #define FIXHFHI2_LIBCALL "__Emulate_fixhfhi2"
1224 #define FLOATHIHF2_LIBCALL "__Emulate_floathihf2"
1225 #define NEGHF2_LIBCALL "__Emulate_neghf2"
1227 #define UMULHI3_LIBCALL "__Emulate_umulhi3"
1228 #define MULHI3_LIBCALL "__Emulate_mulhi3"
1229 #define UDIVQI3_LIBCALL "__Emulate_udivqi3"
1230 #define UDIVHI3_LIBCALL "__Emulate_udivhi3"
1231 #define DIVQI3_LIBCALL "__Emulate_divqi3"
1232 #define DIVHI3_LIBCALL "__Emulate_divhi3"
1233 #define MODQI3_LIBCALL "__Emulate_modqi3"
1234 #define MODHI3_LIBCALL "__Emulate_modhi3"
1235 #define UMODQI3_LIBCALL "__Emulate_umodqi3"
1236 #define UMODHI3_LIBCALL "__Emulate_umodhi3"
1237 #define ASHRHI3_LIBCALL "__Emulate_ashrhi3"
1238 #define LSHRHI3_LIBCALL "__Emulate_lshrhi3"
1239 #define ASHLHI3_LIBCALL "__Emulate_ashlhi3"
1240 #define LSHLHI3_LIBCALL "__Emulate_lshlhi3" /* NOT USED */
1242 /* Define this macro if calls to the ANSI C library functions memcpy and
1243 memset should be generated instead of the BSD function bcopy & bzero. */
1244 #define TARGET_MEM_FUNCTIONS
1247 /* ADDRESSING MODES */
1249 /* The 1610 has post-increment and decrement, but no pre-modify */
1250 #define HAVE_POST_INCREMENT 1
1251 #define HAVE_POST_DECREMENT 1
1253 /* #define HAVE_PRE_DECREMENT 0 */
1254 /* #define HAVE_PRE_INCREMENT 0 */
1256 /* Recognize any constant value that is a valid address. */
1257 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X)
1259 /* Maximum number of registers that can appear in a valid memory address. */
1260 #define MAX_REGS_PER_ADDRESS 1
1262 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1263 and check its validity for a certain class.
1264 We have two alternate definitions for each of them.
1265 The usual definition accepts all pseudo regs; the other rejects
1266 them unless they have been allocated suitable hard regs.
1267 The symbol REG_OK_STRICT causes the latter definition to be used.
1269 Most source files want to accept pseudo regs in the hope that
1270 they will get allocated to the class that the insn wants them to be in.
1271 Source files for reload pass need to be strict.
1272 After reload, it makes no difference, since pseudo regs have
1273 been eliminated by then. */
1275 #ifndef REG_OK_STRICT
1277 /* Nonzero if X is a hard reg that can be used as an index
1278 or if it is a pseudo reg. */
1279 #define REG_OK_FOR_INDEX_P(X) 0
1281 /* Nonzero if X is a hard reg that can be used as a base reg
1282 or if it is a pseudo reg. */
1283 #define REG_OK_FOR_BASE_P(X) \
1284 ((REGNO (X) >= REG_R0 && REGNO (X) < REG_R3 + 1 ) \
1285 || (REGNO (X) >= FIRST_PSEUDO_REGISTER))
1287 /* Nonzero if X is the 'ybase' register */
1288 #define REG_OK_FOR_YBASE_P(X) \
1289 (REGNO(X) == REG_YBASE || (REGNO (X) >= FIRST_PSEUDO_REGISTER))
1292 /* Nonzero if X is a hard reg that can be used as an index. */
1293 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1295 /* Nonzero if X is a hard reg that can be used as a base reg. */
1296 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1298 /* Nonzero if X is the 'ybase' register */
1299 #define REG_OK_FOR_YBASE_P(X) REGNO_OK_FOR_YBASE_P (REGNO(X))
1303 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1304 that is a valid memory address for an instruction.
1305 The MODE argument is the machine mode for the MEM expression
1306 that wants to use this address.
1308 On the 1610, the actual legitimate addresses must be N (N must fit in
1309 5 bits), *rn (register indirect), *rn++, or *rn-- */
1311 #define INT_FITS_5_BITS(I) ((unsigned long) (I) < 0x20)
1312 #define INT_FITS_16_BITS(I) ((unsigned long) (I) < 0x10000)
1313 #define YBASE_CONST_OFFSET(I) ((I) >= -31 && (I) <= 0)
1314 #define YBASE_OFFSET(X) (GET_CODE (X) == CONST_INT && YBASE_CONST_OFFSET (INTVAL(X)))
1316 #define FITS_16_BITS(X) (GET_CODE (X) == CONST_INT && INT_FITS_16_BITS(INTVAL(X)))
1317 #define FITS_5_BITS(X) (GET_CODE (X) == CONST_INT && INT_FITS_5_BITS(INTVAL(X)))
1318 #define ILLEGAL_HIMODE_ADDR(MODE, CONST) ((MODE) == HImode && CONST == -31)
1320 #define INDIRECTABLE_ADDRESS_P(X) \
1321 ((GET_CODE(X) == REG && REG_OK_FOR_BASE_P(X)) \
1322 || ((GET_CODE(X) == POST_DEC || GET_CODE(X) == POST_INC) \
1323 && REG_P(XEXP(X,0)) && REG_OK_FOR_BASE_P(XEXP(X,0))) \
1324 || (GET_CODE(X) == CONST_INT && (unsigned long) (X) < 0x20))
1327 #define INDEXABLE_ADDRESS_P(X,MODE) \
1328 ((GET_CODE(X) == PLUS && GET_CODE (XEXP (X,0)) == REG && \
1329 XEXP(X,0) == stack_pointer_rtx && YBASE_OFFSET(XEXP(X,1)) && \
1330 !ILLEGAL_HIMODE_ADDR(MODE, INTVAL(XEXP(X,1)))) || \
1331 (GET_CODE(X) == PLUS && GET_CODE (XEXP (X,1)) == REG && \
1332 XEXP(X,1) == stack_pointer_rtx && YBASE_OFFSET(XEXP(X,0)) && \
1333 !ILLEGAL_HIMODE_ADDR(MODE, INTVAL(XEXP(X,0)))))
1335 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1337 if (INDIRECTABLE_ADDRESS_P(X)) \
1342 /* Try machine-dependent ways of modifying an illegitimate address
1343 to be legitimate. If we find one, return the new, valid address.
1344 This macro is used in only one place: `memory_address' in explow.c.
1346 OLDX is the address as it was before break_out_memory_refs was called.
1347 In some cases it is useful to look at this to decide what needs to be done.
1349 MODE and WIN are passed so that this macro can use
1350 GO_IF_LEGITIMATE_ADDRESS.
1352 It is always safe for this macro to do nothing. It exists to recognize
1353 opportunities to optimize the output.
1355 For the 1610, we need not do anything. However, if we don't,
1356 `memory_address' will try lots of things to get a valid address, most of
1357 which will result in dead code and extra pseudos. So we make the address
1360 This is easy: The only valid addresses are an offset from a register
1361 and we know the address isn't valid. So just call either `force_operand'
1362 or `force_reg' unless this is a (plus (reg ...) (const_int 0)). */
1364 #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) \
1365 { if (GET_CODE (X) == PLUS && XEXP (X, 1) == const0_rtx) \
1367 if (GET_CODE (X) == MULT || GET_CODE (X) == PLUS) \
1368 X = force_operand (X, 0); \
1370 X = force_reg (Pmode, X); \
1374 /* Go to LABEL if ADDR (a legitimate address expression)
1375 has an effect that depends on the machine mode it is used for.
1376 On the 1610, only postdecrement and postincrement address depend thus
1377 (the amount of decrement or increment being the length of the operand). */
1379 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1380 if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == POST_DEC) goto LABEL
1382 /* Nonzero if the constant value X is a legitimate general operand.
1383 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1384 #define LEGITIMATE_CONSTANT_P(X) (1)
1387 /* CONDITION CODE INFORMATION */
1389 /* Store in cc_status the expressions
1390 that the condition codes will describe
1391 after execution of an instruction whose pattern is EXP.
1392 Do not alter them if the instruction would not alter the cc's. */
1394 #define NOTICE_UPDATE_CC(EXP, INSN) \
1395 notice_update_cc( (EXP) )
1397 /* DESCRIBING RELATIVE COSTS OF OPERATIONS */
1399 /* Compute the cost of computing a constant rtl expression RTX
1400 whose rtx-code is CODE. The body of this macro is a portion
1401 of a switch statement. If the code is computed here,
1402 return it with a return statement. */
1403 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
1409 return COSTS_N_INSNS (1); \
1411 case CONST_DOUBLE: \
1412 return COSTS_N_INSNS (2);
1414 /* Like CONST_COSTS but applies to nonconstant RTL expressions.
1415 This can be used, for example to indicate how costly a multiply
1417 #define RTX_COSTS(X,CODE,OUTER_CODE) \
1419 return GET_MODE (X) == QImode ? COSTS_N_INSNS (2) : \
1420 COSTS_N_INSNS (4); \
1423 return COSTS_N_INSNS (38); \
1425 if (GET_MODE (X) == QImode) \
1426 return COSTS_N_INSNS (2); \
1428 return COSTS_N_INSNS (38); \
1430 if (GET_MODE_CLASS (GET_MODE (X)) == MODE_INT) \
1432 if (GET_CODE (XEXP (X,1)) == CONST_INT) \
1434 int number = INTVAL(XEXP (X,1)); \
1436 return COSTS_N_INSNS (1); \
1437 if (INT_FITS_16_BITS(number)) \
1438 return COSTS_N_INSNS (2); \
1440 return COSTS_N_INSNS (4); \
1442 return COSTS_N_INSNS (1); \
1445 return COSTS_N_INSNS (38); \
1447 if (GET_MODE_CLASS (GET_MODE (X)) == MODE_INT) \
1449 if (GET_CODE (XEXP (X,1)) == CONST_INT) \
1451 if (INT_FITS_16_BITS(INTVAL(XEXP(X,1)))) \
1452 return COSTS_N_INSNS (2); \
1454 return COSTS_N_INSNS (4); \
1456 return COSTS_N_INSNS (1); \
1459 return COSTS_N_INSNS (38); \
1460 case AND: case IOR: case XOR: \
1461 if (GET_CODE (XEXP (X,1)) == CONST_INT) \
1463 if (INT_FITS_16_BITS(INTVAL(XEXP(X,1)))) \
1464 return COSTS_N_INSNS (2); \
1466 return COSTS_N_INSNS (4); \
1468 return COSTS_N_INSNS (1); \
1469 case NEG: case NOT: \
1470 return COSTS_N_INSNS (1); \
1474 if (GET_CODE (XEXP (X,1)) == CONST_INT) \
1476 int number = INTVAL(XEXP (X,1)); \
1477 if (number == 1 || number == 4 || number == 8 || \
1479 return COSTS_N_INSNS (1); \
1481 return COSTS_N_INSNS (2); \
1483 return COSTS_N_INSNS (1);
1485 /* An expression giving the cost of an addressing mode that contains
1487 #define ADDRESS_COST(ADDR) dsp16xx_address_cost (ADDR)
1489 /* A c expression for the cost of moving data from a register in
1490 class FROM to one in class TO. The classes are expressed using
1491 the enumeration values such as GENERAL_REGS. A value of 2 is
1493 #define REGISTER_MOVE_COST(MODE,FROM,TO) dsp16xx_register_move_cost (FROM, TO)
1495 /* A C expression for the cost of moving data of mode MODE between
1496 a register and memory. A value of 2 is the default. */
1497 #define MEMORY_MOVE_COST(MODE,CLASS,IN) \
1498 (GET_MODE_CLASS(MODE) == MODE_INT && MODE == QImode ? 12 \
1501 /* A C expression for the cost of a branch instruction. A value of
1502 1 is the default; */
1503 #define BRANCH_COST 2
1506 /* Define this because otherwise gcc will try to put the function address
1507 in any old pseudo register. We can only use pt. */
1508 #define NO_FUNCTION_CSE
1510 /* Define this macro as a C expression which is nonzero if accessing less
1511 than a word of memory (i.e a char or short) is no faster than accessing
1512 a word of memory, i.e if such access require more than one instruction
1513 or if ther is no difference in cost between byte and (aligned) word
1515 #define SLOW_BYTE_ACCESS 1
1517 /* Define this macro if zero-extension (of a char or short to an int) can
1518 be done faster if the destination is a register that is know to be zero. */
1519 /* #define SLOW_ZERO_EXTEND */
1521 /* Define this macro if unaligned accesses have a cost many times greater than
1522 aligned accesses, for example if they are emulated in a trap handler */
1523 /* define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) */
1525 /* Define this macro to inhibit strength reduction of memory addresses */
1526 /* #define DONT_REDUCE_ADDR */
1529 /* DIVIDING THE OUTPUT IN SECTIONS */
1530 /* Output before read-only data. */
1532 #define DEFAULT_TEXT_SEG_NAME ".text"
1533 #define TEXT_SECTION_ASM_OP rsect_text
1535 /* Output before constants and strings */
1536 #define DEFAULT_CONST_SEG_NAME ".const"
1537 #define READONLY_SECTION_ASM_OP rsect_const
1538 #define READONLY_DATA_SECTION const_section
1540 /* Output before writable data. */
1541 #define DEFAULT_DATA_SEG_NAME ".data"
1542 #define DATA_SECTION_ASM_OP rsect_data
1544 #define DEFAULT_BSS_SEG_NAME ".bss"
1545 #define BSS_SECTION_ASM_OP rsect_bss
1547 /* We will default to using 1610 if the user doesn't
1549 #define DEFAULT_CHIP_NAME "1610"
1551 /* A list of names for sections other than the standard ones, which are
1552 'in_text' and 'in_data' (and .bss if BSS_SECTION_ASM_OP is defined). */
1553 #define EXTRA_SECTIONS in_const
1555 #define EXTRA_SECTION_FUNCTIONS \
1559 if (in_section != in_const) \
1561 fprintf (asm_out_file, "%s\n", READONLY_SECTION_ASM_OP); \
1562 in_section = in_const; \
1566 /* THE OVERALL FRAMEWORK OF AN ASSEMBLER FILE */
1568 /* Output at beginning of assembler file. */
1569 #define ASM_FILE_START(FILE) dsp16xx_file_start ()
1571 /* A C string constant describing how to begin a comment in the target
1572 assembler language. */
1573 /* define ASM_COMMENT_START */
1575 /* Output to assembler file text saying following lines
1576 may contain character constants, extra white space, comments, etc. */
1577 #define ASM_APP_ON ""
1579 /* Output to assembler file text saying following lines
1580 no longer contain unusual constructs. */
1581 #define ASM_APP_OFF ""
1583 /* OUTPUT OF DATA */
1585 /* This is how to output an assembler line defining a `double' constant. */
1586 #define ASM_OUTPUT_DOUBLE(FILE,VALUE) asm_output_float (FILE,VALUE)
1588 /* This is how to output an assembler line defining a `float' constant. */
1589 #define ASM_OUTPUT_FLOAT(FILE,VALUE) asm_output_float (FILE, VALUE)
1591 /* This is how to output an assembler line defining a 'float' constant of
1593 #define ASM_OUTPUT_SHORT_FLOAT(FILE,VALUE) asm_output_float (FILE, VALUE)
1595 /* This is how to output an assembler line defining an `char' constant. */
1596 #define ASM_OUTPUT_CHAR(FILE,VALUE) \
1597 ( fprintf (FILE, "\tint "), \
1598 output_addr_const (FILE, (VALUE)), \
1599 fprintf (FILE, "\n"))
1601 /* This is how to output an assembler line defining an `short' constant. */
1602 #define ASM_OUTPUT_SHORT(FILE,EXP) asm_output_long(FILE,INTVAL(EXP))
1604 /* This is how to output an assembler line defining a 'int' constant. */
1605 #define ASM_OUTPUT_INT(FILE, EXP) asm_output_long(FILE,INTVAL(EXP))
1607 /* This is how to output an assembler line for a numeric constant byte. */
1608 #define ASM_OUTPUT_BYTE(FILE,VALUE) \
1609 fprintf ((FILE), "\tint %ld\n", (long)(VALUE))
1612 /* This is how we output a 'c' character string. For the 16xx
1613 assembler we have to do it one letter at a time */
1615 #define ASCII_LENGTH 10
1617 #define ASM_OUTPUT_ASCII(MYFILE, MYSTRING, MYLENGTH) \
1619 FILE *_hide_asm_out_file = (MYFILE); \
1620 const unsigned char *_hide_p = (const unsigned char *) (MYSTRING); \
1621 int _hide_thissize = (MYLENGTH); \
1623 FILE *asm_out_file = _hide_asm_out_file; \
1624 const unsigned char *p = _hide_p; \
1625 int thissize = _hide_thissize; \
1628 for (i = 0; i < thissize; i++) \
1630 register int c = p[i]; \
1632 if (i % ASCII_LENGTH == 0) \
1633 fprintf (asm_out_file, "\tint "); \
1635 if (c >= ' ' && c < 0177 && c != '\'') \
1637 putc ('\'', asm_out_file); \
1638 putc (c, asm_out_file); \
1639 putc ('\'', asm_out_file); \
1643 fprintf (asm_out_file, "%d", c); \
1644 /* After an octal-escape, if a digit follows, \
1645 terminate one string constant and start another. \
1646 The Vax assembler fails to stop reading the escape \
1647 after three digits, so this is the only way we \
1648 can get it to parse the data properly. \
1649 if (i < thissize - 1 \
1650 && p[i + 1] >= '0' && p[i + 1] <= '9') \
1651 fprintf (asm_out_file, "\'\n\tint \'"); \
1655 we are not at the last char (i != thissize -1) \
1656 and (we are not at a line break multiple \
1657 but i == 0) (it will be the very first time) \
1658 then put out a comma to extend. \
1660 if ((i != thissize - 1) && ((i + 1) % ASCII_LENGTH)) \
1661 fprintf(asm_out_file, ","); \
1662 if (!((i + 1) % ASCII_LENGTH)) \
1663 fprintf (asm_out_file, "\n"); \
1665 fprintf (asm_out_file, "\n"); \
1670 /* Store in OUTPUT a string (made with alloca) containing
1671 an assembler-name for a local static variable or function
1672 named NAME. LABELNO is an integer which is different for
1675 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1677 int len = strlen (NAME); \
1678 char *temp = (char *) alloca (len + 3); \
1680 strcpy (&temp[1], (NAME)); \
1681 temp[len + 1] = '_'; \
1682 temp[len + 2] = 0; \
1683 (OUTPUT) = (char *) alloca (strlen (NAME) + 11); \
1684 ASM_GENERATE_INTERNAL_LABEL (OUTPUT, temp, LABELNO); \
1687 #define ASM_OPEN_PAREN "("
1688 #define ASM_CLOSE_PAREN ")"
1691 /* OUTPUT OF UNINITIALIZED VARIABLES */
1693 /* This says how to output an assembler line
1694 to define a global common symbol. */
1696 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1697 asm_output_common (FILE, NAME, SIZE, ROUNDED);
1699 /* This says how to output an assembler line
1700 to define a local common symbol. */
1702 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1703 asm_output_local (FILE, NAME, SIZE, ROUNDED);
1705 /* OUTPUT AND GENERATION OF LABELS */
1707 /* This is how to output the definition of a user-level label named NAME,
1708 such as the label on a static function or variable NAME. */
1709 #define ASM_OUTPUT_LABEL(FILE,NAME) \
1710 do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
1712 /* This is how to output a command to make the user-level label named NAME
1713 defined for reference from other files. */
1715 #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
1716 do { fputs (".global ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
1718 /* A C statement to output to the stdio stream any text necessary
1719 for declaring the name of an external symbol named name which
1720 is referenced in this compilation but not defined. */
1722 #define ASM_OUTPUT_EXTERNAL(FILE, DECL, NAME) \
1724 fprintf (FILE, ".extern "); \
1725 assemble_name (FILE, NAME); \
1726 fprintf (FILE, "\n"); \
1728 /* A C statement to output on stream an assembler pseudo-op to
1729 declare a library function named external. */
1731 #define ASM_OUTPUT_EXTERNAL_LIBCALL(FILE, FUN) \
1733 fprintf (FILE, ".extern "); \
1734 assemble_name (FILE, XSTR (FUN, 0)); \
1735 fprintf (FILE, "\n"); \
1738 /* The prefix to add to user-visible assembler symbols. */
1740 #define USER_LABEL_PREFIX "_"
1742 /* This is how to output an internal numbered label where
1743 PREFIX is the class of label and NUM is the number within the class. */
1744 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1745 fprintf (FILE, "%s%d:\n", PREFIX, NUM)
1747 /* This is how to store into the string LABEL
1748 the symbol_ref name of an internal numbered label where
1749 PREFIX is the class of label and NUM is the number within the class.
1750 This is suitable for output with `assemble_name'. */
1751 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1752 sprintf (LABEL, "*%s%d", PREFIX, NUM)
1755 /* OUTPUT OF ASSEMBLER INSTRUCTIONS */
1757 /* How to refer to registers in assembler output.
1758 This sequence is indexed by compiler's hard-register-number (see above). */
1760 #define REGISTER_NAMES \
1761 {"a0", "a0l", "a1", "a1l", "x", "y", "yl", "p", "pl", \
1762 "r0", "r1", "r2", "r3", "j", "k", "ybase", "pt", \
1763 "ar0", "ar1", "ar2", "ar3", \
1764 "c0", "c1", "c2", "pr", "rb", \
1765 "*(0)", "*(1)", "*(2)", "*(3)", "*(4)", "*(5)", \
1766 "*(6)", "*(7)", "*(8)", "*(9)", "*(10)", "*(11)", \
1767 "*(12)", "*(13)", "*(14)", "*(15)", "*(16)", "*(17)", \
1768 "*(18)", "*(19)", "*(20)", "*(21)", "*(22)", "*(23)", \
1769 "*(24)", "*(25)", "*(26)", "*(27)", "*(28)", "*(29)", \
1772 #define HIMODE_REGISTER_NAMES \
1773 {"a0", "a0", "a1", "a1", "x", "y", "y", "p", "p", \
1774 "r0", "r1", "r2", "r3", "j", "k", "ybase", "pt", \
1775 "ar0", "ar1", "ar2", "ar3", \
1776 "c0", "c1", "c2", "pr", "rb", \
1777 "*(0)", "*(1)", "*(2)", "*(3)", "*(4)", "*(5)", \
1778 "*(6)", "*(7)", "*(8)", "*(9)", "*(10)", "*(11)", \
1779 "*(12)", "*(13)", "*(14)", "*(15)", "*(16)", "*(17)", \
1780 "*(18)", "*(19)", "*(20)", "*(21)", "*(22)", "*(23)", \
1781 "*(24)", "*(25)", "*(26)", "*(27)", "*(28)", "*(29)", \
1784 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) 0
1786 /* Print operand X (an rtx) in assembler syntax to file FILE.
1787 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1788 For `%' followed by punctuation, CODE is the punctuation and X is null.
1790 DSP1610 extensions for operand codes:
1792 %H - print lower 16 bits of constant
1793 %U - print upper 16 bits of constant
1794 %w - print low half of register (e.g 'a0l')
1795 %u - print upper half of register (e.g 'a0')
1796 %b - print high half of accumulator for F3 ALU instructions
1797 %h - print constant in decimal */
1799 #define PRINT_OPERAND(FILE, X, CODE) print_operand(FILE, X, CODE)
1802 /* Print a memory address as an operand to reference that memory location. */
1804 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address (FILE, ADDR)
1806 /* This is how to output an insn to push a register on the stack.
1807 It need not be very fast code since it is used only for profiling */
1808 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
1809 internal_error ("Profiling not implemented yet.");
1811 /* This is how to output an insn to pop a register from the stack.
1812 It need not be very fast code since it is used only for profiling */
1813 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
1814 internal_error ("Profiling not implemented yet.");
1816 /* OUTPUT OF DISPATCH TABLES */
1818 /* This macro should be provided on machines where the addresses in a dispatch
1819 table are relative to the table's own address. */
1820 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1821 fprintf (FILE, "\tint L%d-L%d\n", VALUE, REL)
1823 /* This macro should be provided on machines where the addresses in a dispatch
1824 table are absolute. */
1825 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1826 fprintf (FILE, "\tint L%d\n", VALUE)
1828 /* ASSEMBLER COMMANDS FOR ALIGNMENT */
1830 /* This is how to output an assembler line that says to advance
1831 the location counter to a multiple of 2**LOG bytes. We should
1832 not have to do any alignment since the 1610 is a word machine. */
1833 #define ASM_OUTPUT_ALIGN(FILE,LOG)
1835 /* Define this macro if ASM_OUTPUT_SKIP should not be used in the text section
1836 because it fails to put zero1 in the bytes that are skipped. */
1837 #define ASM_NO_SKIP_IN_TEXT 1
1839 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1840 fprintf (FILE, "\t%d * int 0\n", (SIZE))
1842 /* CONTROLLING DEBUGGING INFORMATION FORMAT */
1844 /* Define this macro if GCC should produce COFF-style debugging output
1845 for SDB in response to the '-g' option */
1846 #define SDB_DEBUGGING_INFO
1848 /* Support generating stabs for the listing file generator */
1849 #define DBX_DEBUGGING_INFO
1851 /* The default format when -g is given is still COFF debug info */
1852 #define PREFERRED_DEBUGGING_TYPE SDB_DEBUG
1854 #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1856 /* MISCELLANEOUS PARAMETERS */
1858 /* Specify the machine mode that this machine uses
1859 for the index in the tablejump instruction. */
1860 #define CASE_VECTOR_MODE QImode
1862 /* Define as C expression which evaluates to nonzero if the tablejump
1863 instruction expects the table to contain offsets from the address of the
1865 Do not define this if the table should contain absolute addresses. */
1866 /* #define CASE_VECTOR_PC_RELATIVE 1 */
1868 /* Specify the tree operation to be used to convert reals to integers. */
1869 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
1871 /* This is the kind of divide that is easiest to do in the general case. */
1872 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
1874 /* Max number of bytes we can move from memory to memory
1875 in one reasonably fast instruction. */
1878 /* Defining this macro causes the compiler to omit a sign-extend, zero-extend,
1879 or bitwise 'and' instruction that truncates the count of a shift operation
1880 to a width equal to the number of bits needed to represent the size of the
1881 object being shifted. Do not define this macro unless the truncation applies
1882 to both shift operations and bit-field operations (if any). */
1883 /* #define SHIFT_COUNT_TRUNCATED */
1885 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1886 is done just by pretending it is already truncated. */
1887 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1889 /* When a prototype says `char' or `short', really pass an `int'. */
1890 #define PROMOTE_PROTOTYPES 1
1892 /* An alias for the machine mode used for pointers */
1893 #define Pmode QImode
1895 /* A function address in a call instruction
1896 is a byte address (for indexing purposes)
1897 so give the MEM rtx a byte's mode. */
1898 #define FUNCTION_MODE QImode
1900 #if !defined(__DATE__)
1901 #define TARGET_VERSION fprintf (stderr, " (%s)", VERSION_INFO1)
1903 #define TARGET_VERSION fprintf (stderr, " (%s, %s)", VERSION_INFO1, __DATE__)
1906 #define VERSION_INFO1 "AT&T DSP16xx C Cross Compiler, version 1.2.0"
1909 /* Define this as 1 if `char' should by default be signed; else as 0. */
1910 #define DEFAULT_SIGNED_CHAR 1
1912 /* If this macro is defined, GNU CC gathers statistics about the number and
1913 kind of tree node it allocates during each run. The option '-fstats' will
1914 tell the compiler to print these statistics about the sizes of it obstacks. */
1915 #define GATHER_STATISTICS
1917 /* Define this so gcc does not output a call to __main, since we
1918 are not currently supporting c++. */
1919 #define INIT_SECTION_ASM_OP 1