1 /* Definitions of target machine for GNU compiler. Matsushita MN10300 series
2 Copyright (C) 1996, 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
3 Contributed by Jeff Law (law@cygnus.com).
5 This file is part of GNU CC.
7 GNU CC 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)
12 GNU CC 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 GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
30 #define STARTFILE_SPEC "%{!mno-crt0:%{!shared:%{pg:gcrt0%O%s}%{!pg:%{p:mcrt0%O%s}%{!p:crt0%O%s}}}}"
32 /* Names to predefine in the preprocessor for this target machine. */
34 #define CPP_PREDEFINES "-D__mn10300__ -D__MN10300__"
36 #define CPP_SPEC "%{mam33:-D__AM33__}"
38 /* Run-time compilation parameters selecting different hardware subsets. */
40 extern int target_flags;
42 /* Macros used in the machine description to test the flags. */
44 /* Macro to define tables used to set the flags.
45 This is a list in braces of pairs in braces,
46 each pair being { "NAME", VALUE }
47 where VALUE is the bits to set or minus the bits to clear.
48 An empty string NAME is used to identify the default VALUE. */
50 /* Generate code to work around mul/mulq bugs on the mn10300. */
51 #define TARGET_MULT_BUG (target_flags & 0x1)
53 /* Generate code for the AM33 processor. */
54 #define TARGET_AM33 (target_flags & 0x2)
56 #define TARGET_SWITCHES \
57 {{ "mult-bug", 0x1, N_("Work around hardware multiply bug")}, \
58 { "no-mult-bug", -0x1, N_("Do not work around hardware multiply bug")},\
59 { "am33", 0x2, N_("Target the AM33 processor")}, \
60 { "am33", -(0x1), ""},\
61 { "no-am33", -0x2, ""}, \
62 { "no-crt0", 0, N_("No default crt0.o") }, \
63 { "", TARGET_DEFAULT, NULL}}
65 #ifndef TARGET_DEFAULT
66 #define TARGET_DEFAULT 0x1
69 /* Print subsidiary information on the compiler version in use. */
71 #define TARGET_VERSION fprintf (stderr, " (MN10300)");
74 /* Target machine storage layout */
76 /* Define this if most significant bit is lowest numbered
77 in instructions that operate on numbered bit-fields.
78 This is not true on the Matsushita MN1003. */
79 #define BITS_BIG_ENDIAN 0
81 /* Define this if most significant byte of a word is the lowest numbered. */
82 /* This is not true on the Matsushita MN10300. */
83 #define BYTES_BIG_ENDIAN 0
85 /* Define this if most significant word of a multiword number is lowest
87 This is not true on the Matsushita MN10300. */
88 #define WORDS_BIG_ENDIAN 0
90 /* Number of bits in an addressable storage unit */
91 #define BITS_PER_UNIT 8
93 /* Width in bits of a "word", which is the contents of a machine register.
94 Note that this is not necessarily the width of data type `int';
95 if using 16-bit ints on a 68000, this would still be 32.
96 But on a machine with 16-bit registers, this would be 16. */
97 #define BITS_PER_WORD 32
99 /* Width of a word, in units (bytes). */
100 #define UNITS_PER_WORD 4
102 /* Width in bits of a pointer.
103 See also the macro `Pmode' defined below. */
104 #define POINTER_SIZE 32
106 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
107 #define PARM_BOUNDARY 32
109 /* The stack goes in 32 bit lumps. */
110 #define STACK_BOUNDARY 32
112 /* Allocation boundary (in *bits*) for the code of a function.
113 8 is the minimum boundary; it's unclear if bigger alignments
114 would improve performance. */
115 #define FUNCTION_BOUNDARY 8
117 /* No data type wants to be aligned rounder than this. */
118 #define BIGGEST_ALIGNMENT 32
120 /* Alignment of field after `int : 0' in a structure. */
121 #define EMPTY_FIELD_BOUNDARY 32
123 /* Define this if move instructions will actually fail to work
124 when given unaligned data. */
125 #define STRICT_ALIGNMENT 1
127 /* Define this as 1 if `char' should by default be signed; else as 0. */
128 #define DEFAULT_SIGNED_CHAR 0
130 /* Define results of standard character escape sequences. */
131 #define TARGET_BELL 007
132 #define TARGET_BS 010
133 #define TARGET_TAB 011
134 #define TARGET_NEWLINE 012
135 #define TARGET_VT 013
136 #define TARGET_FF 014
137 #define TARGET_CR 015
139 /* Standard register usage. */
141 /* Number of actual hardware registers.
142 The hardware registers are assigned numbers for the compiler
143 from 0 to just below FIRST_PSEUDO_REGISTER.
145 All registers that the compiler knows about must be given numbers,
146 even those that are not normally considered general registers. */
148 #define FIRST_PSEUDO_REGISTER 18
150 /* Specify machine-specific register numbers. */
151 #define FIRST_DATA_REGNUM 0
152 #define LAST_DATA_REGNUM 3
153 #define FIRST_ADDRESS_REGNUM 4
154 #define LAST_ADDRESS_REGNUM 8
155 #define FIRST_EXTENDED_REGNUM 10
156 #define LAST_EXTENDED_REGNUM 17
158 /* Specify the registers used for certain standard purposes.
159 The values of these macros are register numbers. */
161 /* Register to use for pushing function arguments. */
162 #define STACK_POINTER_REGNUM (LAST_ADDRESS_REGNUM+1)
164 /* Base register for access to local variables of the function. */
165 #define FRAME_POINTER_REGNUM (LAST_ADDRESS_REGNUM-1)
167 /* Base register for access to arguments of the function. This
168 is a fake register and will be eliminated into either the frame
169 pointer or stack pointer. */
170 #define ARG_POINTER_REGNUM LAST_ADDRESS_REGNUM
172 /* Register in which static-chain is passed to a function. */
173 #define STATIC_CHAIN_REGNUM (FIRST_ADDRESS_REGNUM+1)
175 /* 1 for registers that have pervasive standard uses
176 and are not available for the register allocator. */
178 #define FIXED_REGISTERS \
179 { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0}
181 /* 1 for registers not available across function calls.
182 These must include the FIXED_REGISTERS and also any
183 registers that can be used without being saved.
184 The latter must include the registers where values are returned
185 and the register where structure-value addresses are passed.
186 Aside from that, you can include as many other registers as you
189 #define CALL_USED_REGISTERS \
190 { 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0}
192 #define REG_ALLOC_ORDER \
193 { 0, 1, 4, 5, 2, 3, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 8, 9}
195 #define CONDITIONAL_REGISTER_USAGE \
199 for (i = FIRST_EXTENDED_REGNUM; \
200 i <= LAST_EXTENDED_REGNUM; i++) \
201 fixed_regs[i] = call_used_regs[i] = 1; \
205 /* Return number of consecutive hard regs needed starting at reg REGNO
206 to hold something of mode MODE.
208 This is ordinarily the length in words of a value of mode MODE
209 but can be less for certain modes in special long registers. */
211 #define HARD_REGNO_NREGS(REGNO, MODE) \
212 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
214 /* Value is 1 if hard register REGNO can hold a value of machine-mode
217 #define HARD_REGNO_MODE_OK(REGNO, MODE) \
218 ((REGNO_REG_CLASS (REGNO) == DATA_REGS \
219 || (TARGET_AM33 && REGNO_REG_CLASS (REGNO) == ADDRESS_REGS) \
220 || REGNO_REG_CLASS (REGNO) == EXTENDED_REGS) \
221 ? ((REGNO) & 1) == 0 || GET_MODE_SIZE (MODE) <= 4 \
222 : ((REGNO) & 1) == 0 || GET_MODE_SIZE (MODE) == 4)
224 /* Value is 1 if it is a good idea to tie two pseudo registers
225 when one has mode MODE1 and one has mode MODE2.
226 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
227 for any hard reg, then this must be 0 for correct output. */
228 #define MODES_TIEABLE_P(MODE1, MODE2) \
231 || (GET_MODE_SIZE (MODE1) <= 4 && GET_MODE_SIZE (MODE2) <= 4))
233 /* 4 data, and effectively 3 address registers is small as far as I'm
235 #define SMALL_REGISTER_CLASSES 1
237 /* Define the classes of registers for register constraints in the
238 machine description. Also define ranges of constants.
240 One of the classes must always be named ALL_REGS and include all hard regs.
241 If there is more than one class, another class must be named NO_REGS
242 and contain no registers.
244 The name GENERAL_REGS must be the name of a class (or an alias for
245 another name such as ALL_REGS). This is the class of registers
246 that is allowed by "g" or "r" in a register constraint.
247 Also, registers outside this class are allocated only when
248 instructions express preferences for them.
250 The classes must be numbered in nondecreasing order; that is,
251 a larger-numbered class must never be contained completely
252 in a smaller-numbered class.
254 For any two classes, it is very desirable that there be another
255 class that represents their union. */
258 NO_REGS, DATA_REGS, ADDRESS_REGS, SP_REGS,
259 DATA_OR_ADDRESS_REGS, SP_OR_ADDRESS_REGS,
260 EXTENDED_REGS, DATA_OR_EXTENDED_REGS, ADDRESS_OR_EXTENDED_REGS,
261 SP_OR_EXTENDED_REGS, SP_OR_ADDRESS_OR_EXTENDED_REGS,
262 GENERAL_REGS, ALL_REGS, LIM_REG_CLASSES
265 #define N_REG_CLASSES (int) LIM_REG_CLASSES
267 /* Give names of register classes as strings for dump file. */
269 #define REG_CLASS_NAMES \
270 { "NO_REGS", "DATA_REGS", "ADDRESS_REGS", \
271 "SP_REGS", "DATA_OR_ADDRESS_REGS", "SP_OR_ADDRESS_REGS", \
273 "DATA_OR_EXTENDED_REGS", "ADDRESS_OR_EXTENDED_REGS", \
274 "SP_OR_EXTENDED_REGS", "SP_OR_ADDRESS_OR_EXTENDED_REGS", \
275 "GENERAL_REGS", "ALL_REGS", "LIM_REGS" }
277 /* Define which registers fit in which classes.
278 This is an initializer for a vector of HARD_REG_SET
279 of length N_REG_CLASSES. */
281 #define REG_CLASS_CONTENTS \
282 { {0}, /* No regs */ \
283 {0x0000f}, /* DATA_REGS */ \
284 {0x001f0}, /* ADDRESS_REGS */ \
285 {0x00200}, /* SP_REGS */ \
286 {0x001ff}, /* DATA_OR_ADDRESS_REGS */\
287 {0x003f0}, /* SP_OR_ADDRESS_REGS */\
288 {0x3fc00}, /* EXTENDED_REGS */ \
289 {0x3fc0f}, /* DATA_OR_EXTENDED_REGS */ \
290 {0x3fdf0}, /* ADDRESS_OR_EXTENDED_REGS */ \
291 {0x3fe00}, /* SP_OR_EXTENDED_REGS */ \
292 {0x3fff0}, /* SP_OR_ADDRESS_OR_EXTENDED_REGS */ \
293 {0x3fdff}, /* GENERAL_REGS */ \
294 {0x3ffff}, /* ALL_REGS */ \
297 /* The same information, inverted:
298 Return the class number of the smallest class containing
299 reg number REGNO. This could be a conditional expression
300 or could index an array. */
302 #define REGNO_REG_CLASS(REGNO) \
303 ((REGNO) <= LAST_DATA_REGNUM ? DATA_REGS : \
304 (REGNO) <= LAST_ADDRESS_REGNUM ? ADDRESS_REGS : \
305 (REGNO) == STACK_POINTER_REGNUM ? SP_REGS : \
306 (REGNO) <= LAST_EXTENDED_REGNUM ? EXTENDED_REGS : \
309 /* The class value for index registers, and the one for base regs. */
310 #define INDEX_REG_CLASS DATA_OR_EXTENDED_REGS
311 #define BASE_REG_CLASS SP_OR_ADDRESS_REGS
313 /* Get reg_class from a letter such as appears in the machine description. */
315 #define REG_CLASS_FROM_LETTER(C) \
316 ((C) == 'd' ? DATA_REGS : \
317 (C) == 'a' ? ADDRESS_REGS : \
318 (C) == 'y' ? SP_REGS : \
319 ! TARGET_AM33 ? NO_REGS : \
320 (C) == 'x' ? EXTENDED_REGS : \
323 /* Macros to check register numbers against specific register classes. */
325 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
326 and check its validity for a certain class.
327 We have two alternate definitions for each of them.
328 The usual definition accepts all pseudo regs; the other rejects
329 them unless they have been allocated suitable hard regs.
330 The symbol REG_OK_STRICT causes the latter definition to be used.
332 Most source files want to accept pseudo regs in the hope that
333 they will get allocated to the class that the insn wants them to be in.
334 Source files for reload pass need to be strict.
335 After reload, it makes no difference, since pseudo regs have
336 been eliminated by then. */
338 /* These assume that REGNO is a hard or pseudo reg number.
339 They give nonzero only if REGNO is a hard reg of the suitable class
340 or a pseudo reg currently allocated to a suitable hard reg.
341 Since they use reg_renumber, they are safe only once reg_renumber
342 has been allocated, which happens in local-alloc.c. */
344 #ifndef REG_OK_STRICT
345 # define REGNO_IN_RANGE_P(regno,min,max) \
346 (((regno) >= (min) && (regno) <= (max)) || (regno) >= FIRST_PSEUDO_REGISTER)
348 # define REGNO_IN_RANGE_P(regno,min,max) \
349 (((regno) >= (min) && (regno) <= (max)) \
351 && reg_renumber[(regno)] >= (min) && reg_renumber[(regno)] <= (max)))
354 #define REGNO_DATA_P(regno) \
355 REGNO_IN_RANGE_P ((regno), FIRST_DATA_REGNUM, LAST_DATA_REGNUM)
356 #define REGNO_ADDRESS_P(regno) \
357 REGNO_IN_RANGE_P ((regno), FIRST_ADDRESS_REGNUM, LAST_ADDRESS_REGNUM)
358 #define REGNO_SP_P(regno) \
359 REGNO_IN_RANGE_P ((regno), STACK_POINTER_REGNUM, STACK_POINTER_REGNUM)
360 #define REGNO_EXTENDED_P(regno) \
361 REGNO_IN_RANGE_P ((regno), FIRST_EXTENDED_REGNUM, LAST_EXTENDED_REGNUM)
362 #define REGNO_AM33_P(regno) \
363 (REGNO_DATA_P ((regno)) || REGNO_ADDRESS_P ((regno)) \
364 || REGNO_EXTENDED_P ((regno)))
366 #define REGNO_OK_FOR_BASE_P(regno) \
367 (REGNO_SP_P ((regno)) \
368 || REGNO_ADDRESS_P ((regno)) || REGNO_EXTENDED_P ((regno)))
369 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
371 #define REGNO_OK_FOR_BIT_BASE_P(regno) \
372 (REGNO_SP_P ((regno)) || REGNO_ADDRESS_P ((regno)))
373 #define REG_OK_FOR_BIT_BASE_P(X) REGNO_OK_FOR_BIT_BASE_P (REGNO (X))
375 #define REGNO_OK_FOR_INDEX_P(regno) \
376 (REGNO_DATA_P ((regno)) || REGNO_EXTENDED_P ((regno)))
377 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
379 /* Given an rtx X being reloaded into a reg required to be
380 in class CLASS, return the class of reg to actually use.
381 In general this is just CLASS; but on some machines
382 in some cases it is preferable to use a more restrictive class. */
384 #define PREFERRED_RELOAD_CLASS(X,CLASS) \
385 ((X) == stack_pointer_rtx && (CLASS) != SP_REGS \
386 ? ADDRESS_OR_EXTENDED_REGS \
387 : (GET_CODE (X) == MEM \
388 || (GET_CODE (X) == REG \
389 && REGNO (X) >= FIRST_PSEUDO_REGISTER) \
390 || (GET_CODE (X) == SUBREG \
391 && GET_CODE (SUBREG_REG (X)) == REG \
392 && REGNO (SUBREG_REG (X)) >= FIRST_PSEUDO_REGISTER) \
393 ? LIMIT_RELOAD_CLASS (GET_MODE (X), CLASS) \
396 #define PREFERRED_OUTPUT_RELOAD_CLASS(X,CLASS) \
397 (X == stack_pointer_rtx && CLASS != SP_REGS \
398 ? ADDRESS_OR_EXTENDED_REGS : CLASS)
400 #define LIMIT_RELOAD_CLASS(MODE, CLASS) \
401 (!TARGET_AM33 && (MODE == QImode || MODE == HImode) ? DATA_REGS : CLASS)
403 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
404 secondary_reload_class(CLASS,MODE,IN)
406 /* Return the maximum number of consecutive registers
407 needed to represent mode MODE in a register of class CLASS. */
409 #define CLASS_MAX_NREGS(CLASS, MODE) \
410 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
412 /* The letters I, J, K, L, M, N, O, P in a register constraint string
413 can be used to stand for particular ranges of immediate operands.
414 This macro defines what the ranges are.
415 C is the letter, and VALUE is a constant value.
416 Return 1 if VALUE is in the range specified by C. */
418 #define INT_8_BITS(VALUE) ((unsigned) (VALUE) + 0x80 < 0x100)
419 #define INT_16_BITS(VALUE) ((unsigned) (VALUE) + 0x8000 < 0x10000)
421 #define CONST_OK_FOR_I(VALUE) ((VALUE) == 0)
422 #define CONST_OK_FOR_J(VALUE) ((VALUE) == 1)
423 #define CONST_OK_FOR_K(VALUE) ((VALUE) == 2)
424 #define CONST_OK_FOR_L(VALUE) ((VALUE) == 4)
425 #define CONST_OK_FOR_M(VALUE) ((VALUE) == 3)
426 #define CONST_OK_FOR_N(VALUE) ((VALUE) == 255 || (VALUE) == 65535)
428 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
429 ((C) == 'I' ? CONST_OK_FOR_I (VALUE) : \
430 (C) == 'J' ? CONST_OK_FOR_J (VALUE) : \
431 (C) == 'K' ? CONST_OK_FOR_K (VALUE) : \
432 (C) == 'L' ? CONST_OK_FOR_L (VALUE) : \
433 (C) == 'M' ? CONST_OK_FOR_M (VALUE) : \
434 (C) == 'N' ? CONST_OK_FOR_N (VALUE) : 0)
437 /* Similar, but for floating constants, and defining letters G and H.
438 Here VALUE is the CONST_DOUBLE rtx itself.
440 `G' is a floating-point zero. */
442 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
443 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
444 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) : 0)
447 /* Stack layout; function entry, exit and calling. */
449 /* Define this if pushing a word on the stack
450 makes the stack pointer a smaller address. */
452 #define STACK_GROWS_DOWNWARD
454 /* Define this if the nominal address of the stack frame
455 is at the high-address end of the local variables;
456 that is, each additional local variable allocated
457 goes at a more negative offset in the frame. */
459 #define FRAME_GROWS_DOWNWARD
461 /* Offset within stack frame to start allocating local variables at.
462 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
463 first local allocated. Otherwise, it is the offset to the BEGINNING
464 of the first local allocated. */
466 #define STARTING_FRAME_OFFSET 0
468 /* Offset of first parameter from the argument pointer register value. */
469 /* Is equal to the size of the saved fp + pc, even if an fp isn't
470 saved since the value is used before we know. */
472 #define FIRST_PARM_OFFSET(FNDECL) 4
474 #define ELIMINABLE_REGS \
475 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
476 { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
477 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}}
479 #define CAN_ELIMINATE(FROM, TO) 1
481 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
482 OFFSET = initial_offset (FROM, TO)
484 /* We can debug without frame pointers on the mn10300, so eliminate
485 them whenever possible. */
486 #define FRAME_POINTER_REQUIRED 0
487 #define CAN_DEBUG_WITHOUT_FP
489 /* A guess for the MN10300. */
490 #define PROMOTE_PROTOTYPES 1
492 /* Value is the number of bytes of arguments automatically
493 popped when returning from a subroutine call.
494 FUNDECL is the declaration node of the function (as a tree),
495 FUNTYPE is the data type of the function (as a tree),
496 or for a library call it is an identifier node for the subroutine name.
497 SIZE is the number of bytes of arguments passed on the stack. */
499 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
501 /* We use d0/d1 for passing parameters, so allocate 8 bytes of space
502 for a register flushback area. */
503 #define REG_PARM_STACK_SPACE(DECL) 8
504 #define OUTGOING_REG_PARM_STACK_SPACE
505 #define ACCUMULATE_OUTGOING_ARGS 1
507 /* So we can allocate space for return pointers once for the function
508 instead of around every call. */
509 #define STACK_POINTER_OFFSET 4
511 /* 1 if N is a possible register number for function argument passing.
512 On the MN10300, no registers are used in this way. */
514 #define FUNCTION_ARG_REGNO_P(N) ((N) <= 1)
517 /* Define a data type for recording info about an argument list
518 during the scan of that argument list. This data type should
519 hold all necessary information about the function itself
520 and about the args processed so far, enough to enable macros
521 such as FUNCTION_ARG to determine where the next arg should go.
523 On the MN10300, this is a single integer, which is a number of bytes
524 of arguments scanned so far. */
526 #define CUMULATIVE_ARGS struct cum_arg
527 struct cum_arg {int nbytes; };
529 /* Initialize a variable CUM of type CUMULATIVE_ARGS
530 for a call to a function whose data type is FNTYPE.
531 For a library call, FNTYPE is 0.
533 On the MN10300, the offset starts at 0. */
535 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \
538 /* Update the data in CUM to advance over an argument
539 of mode MODE and data type TYPE.
540 (TYPE is null for libcalls where that information may not be available.) */
542 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
543 ((CUM).nbytes += ((MODE) != BLKmode \
544 ? (GET_MODE_SIZE (MODE) + 3) & ~3 \
545 : (int_size_in_bytes (TYPE) + 3) & ~3))
547 /* Define where to put the arguments to a function.
548 Value is zero to push the argument on the stack,
549 or a hard register in which to store the argument.
551 MODE is the argument's machine mode.
552 TYPE is the data type of the argument (as a tree).
553 This is null for libcalls where that information may
555 CUM is a variable of type CUMULATIVE_ARGS which gives info about
556 the preceding args and about the function being called.
557 NAMED is nonzero if this argument is a named parameter
558 (otherwise it is an extra parameter matching an ellipsis). */
560 /* On the MN10300 all args are pushed. */
562 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
563 function_arg (&CUM, MODE, TYPE, NAMED)
565 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
566 function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED)
568 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
569 ((TYPE) && int_size_in_bytes (TYPE) > 8)
571 #define FUNCTION_ARG_CALLEE_COPIES(CUM, MODE, TYPE, NAMED) \
572 ((TYPE) && int_size_in_bytes (TYPE) > 8)
574 /* Define how to find the value returned by a function.
575 VALTYPE is the data type of the value (as a tree).
576 If the precise function being called is known, FUNC is its FUNCTION_DECL;
577 otherwise, FUNC is 0. */
579 #define FUNCTION_VALUE(VALTYPE, FUNC) \
580 gen_rtx_REG (TYPE_MODE (VALTYPE), POINTER_TYPE_P (VALTYPE) \
581 ? FIRST_ADDRESS_REGNUM : FIRST_DATA_REGNUM)
583 /* Define how to find the value returned by a library function
584 assuming the value has mode MODE. */
586 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, FIRST_DATA_REGNUM)
588 /* 1 if N is a possible register number for a function value. */
590 #define FUNCTION_VALUE_REGNO_P(N) \
591 ((N) == FIRST_DATA_REGNUM || (N) == FIRST_ADDRESS_REGNUM)
593 /* Return values > 8 bytes in length in memory. */
594 #define DEFAULT_PCC_STRUCT_RETURN 0
595 #define RETURN_IN_MEMORY(TYPE) \
596 (int_size_in_bytes (TYPE) > 8 || TYPE_MODE (TYPE) == BLKmode)
598 /* Register in which address to store a structure value
599 is passed to a function. On the MN10300 it's passed as
600 the first parameter. */
602 #define STRUCT_VALUE FIRST_DATA_REGNUM
604 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
605 the stack pointer does not matter. The value is tested only in
606 functions that have frame pointers.
607 No definition is equivalent to always zero. */
609 #define EXIT_IGNORE_STACK 1
611 /* Output assembler code to FILE to increment profiler label # LABELNO
612 for profiling a function entry. */
614 #define FUNCTION_PROFILER(FILE, LABELNO) ;
616 #define TRAMPOLINE_TEMPLATE(FILE) \
618 fprintf (FILE, "\tadd -4,sp\n"); \
619 fprintf (FILE, "\t.long 0x0004fffa\n"); \
620 fprintf (FILE, "\tmov (0,sp),a0\n"); \
621 fprintf (FILE, "\tadd 4,sp\n"); \
622 fprintf (FILE, "\tmov (13,a0),a1\n"); \
623 fprintf (FILE, "\tmov (17,a0),a0\n"); \
624 fprintf (FILE, "\tjmp (a0)\n"); \
625 fprintf (FILE, "\t.long 0\n"); \
626 fprintf (FILE, "\t.long 0\n"); \
629 /* Length in units of the trampoline for entering a nested function. */
631 #define TRAMPOLINE_SIZE 0x1b
633 #define TRAMPOLINE_ALIGNMENT 32
635 /* Emit RTL insns to initialize the variable parts of a trampoline.
636 FNADDR is an RTX for the address of the function's pure code.
637 CXT is an RTX for the static chain value for the function. */
639 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
641 emit_move_insn (gen_rtx_MEM (SImode, plus_constant ((TRAMP), 0x14)), \
643 emit_move_insn (gen_rtx_MEM (SImode, plus_constant ((TRAMP), 0x18)), \
646 /* A C expression whose value is RTL representing the value of the return
647 address for the frame COUNT steps up from the current frame.
649 On the mn10300, the return address is not at a constant location
650 due to the frame layout. Luckily, it is at a constant offset from
651 the argument pointer, so we define RETURN_ADDR_RTX to return a
652 MEM using arg_pointer_rtx. Reload will replace arg_pointer_rtx
653 with a reference to the stack/frame pointer + an appropriate offset. */
655 #define RETURN_ADDR_RTX(COUNT, FRAME) \
657 ? gen_rtx_MEM (Pmode, arg_pointer_rtx) \
660 /* Emit code for a call to builtin_saveregs. We must emit USE insns which
661 reference the 2 integer arg registers.
662 Ordinarily they are not call used registers, but they are for
663 _builtin_saveregs, so we must make this explicit. */
665 #define EXPAND_BUILTIN_SAVEREGS() mn10300_builtin_saveregs ()
667 /* Implement `va_start' for varargs and stdarg. */
668 #define EXPAND_BUILTIN_VA_START(stdarg, valist, nextarg) \
669 mn10300_va_start (stdarg, valist, nextarg)
671 /* Implement `va_arg'. */
672 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
673 mn10300_va_arg (valist, type)
675 /* Addressing modes, and classification of registers for them. */
678 /* 1 if X is an rtx for a constant that is a valid address. */
680 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X)
682 /* Extra constraints. */
684 #define OK_FOR_R(OP) \
685 (GET_CODE (OP) == MEM \
686 && GET_MODE (OP) == QImode \
687 && (CONSTANT_ADDRESS_P (XEXP (OP, 0)) \
688 || (GET_CODE (XEXP (OP, 0)) == REG \
689 && REG_OK_FOR_BIT_BASE_P (XEXP (OP, 0)) \
690 && XEXP (OP, 0) != stack_pointer_rtx) \
691 || (GET_CODE (XEXP (OP, 0)) == PLUS \
692 && GET_CODE (XEXP (XEXP (OP, 0), 0)) == REG \
693 && REG_OK_FOR_BIT_BASE_P (XEXP (XEXP (OP, 0), 0)) \
694 && XEXP (XEXP (OP, 0), 0) != stack_pointer_rtx \
695 && GET_CODE (XEXP (XEXP (OP, 0), 1)) == CONST_INT \
696 && INT_8_BITS (INTVAL (XEXP (XEXP (OP, 0), 1))))))
698 #define EXTRA_CONSTRAINT(OP, C) \
699 ((C) == 'R' ? OK_FOR_R (OP) : (C) == 'S' ? GET_CODE (OP) == SYMBOL_REF : 0)
701 /* Maximum number of registers that can appear in a valid memory address. */
703 #define MAX_REGS_PER_ADDRESS 2
706 #define HAVE_POST_INCREMENT (TARGET_AM33)
708 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
709 that is a valid memory address for an instruction.
710 The MODE argument is the machine mode for the MEM expression
711 that wants to use this address.
713 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
714 except for CONSTANT_ADDRESS_P which is actually
717 On the mn10300, the value in the address register must be
718 in the same memory space/segment as the effective address.
720 This is problematical for reload since it does not understand
721 that base+index != index+base in a memory reference.
723 Note it is still possible to use reg+reg addressing modes,
724 it's just much more difficult. For a discussion of a possible
725 workaround and solution, see the comments in pa.c before the
726 function record_unscaled_index_insn_codes. */
728 /* Accept either REG or SUBREG where a register is valid. */
730 #define RTX_OK_FOR_BASE_P(X) \
731 ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
732 || (GET_CODE (X) == SUBREG && REG_P (SUBREG_REG (X)) \
733 && REG_OK_FOR_BASE_P (SUBREG_REG (X))))
735 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
737 if (CONSTANT_ADDRESS_P (X)) \
739 if (RTX_OK_FOR_BASE_P (X)) \
742 && GET_CODE (X) == POST_INC \
743 && RTX_OK_FOR_BASE_P (XEXP (X, 0)) \
744 && (MODE == SImode || MODE == SFmode || MODE == HImode))\
746 if (GET_CODE (X) == PLUS) \
748 rtx base = 0, index = 0; \
749 if (REG_P (XEXP (X, 0)) \
750 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
751 base = XEXP (X, 0), index = XEXP (X, 1); \
752 if (REG_P (XEXP (X, 1)) \
753 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
754 base = XEXP (X, 1), index = XEXP (X, 0); \
755 if (base != 0 && index != 0) \
757 if (GET_CODE (index) == CONST_INT) \
764 /* Try machine-dependent ways of modifying an illegitimate address
765 to be legitimate. If we find one, return the new, valid address.
766 This macro is used in only one place: `memory_address' in explow.c.
768 OLDX is the address as it was before break_out_memory_refs was called.
769 In some cases it is useful to look at this to decide what needs to be done.
771 MODE and WIN are passed so that this macro can use
772 GO_IF_LEGITIMATE_ADDRESS.
774 It is always safe for this macro to do nothing. It exists to recognize
775 opportunities to optimize the output. */
777 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
778 { rtx orig_x = (X); \
779 (X) = legitimize_address (X, OLDX, MODE); \
780 if ((X) != orig_x && memory_address_p (MODE, X)) \
783 /* Go to LABEL if ADDR (a legitimate address expression)
784 has an effect that depends on the machine mode it is used for. */
786 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
787 if (GET_CODE (ADDR) == POST_INC) \
790 /* Nonzero if the constant value X is a legitimate general operand.
791 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
793 #define LEGITIMATE_CONSTANT_P(X) 1
796 /* Tell final.c how to eliminate redundant test instructions. */
798 /* Here we define machine-dependent flags and fields in cc_status
799 (see `conditions.h'). No extra ones are needed for the vax. */
801 /* Store in cc_status the expressions
802 that the condition codes will describe
803 after execution of an instruction whose pattern is EXP.
804 Do not alter them if the instruction would not alter the cc's. */
806 #define CC_OVERFLOW_UNUSABLE 0x200
807 #define CC_NO_CARRY CC_NO_OVERFLOW
808 #define NOTICE_UPDATE_CC(EXP, INSN) notice_update_cc(EXP, INSN)
810 /* Compute the cost of computing a constant rtl expression RTX
811 whose rtx-code is CODE. The body of this macro is a portion
812 of a switch statement. If the code is computed here,
813 return it with a return statement. Otherwise, break from the switch. */
815 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
817 /* Zeros are extremely cheap. */ \
818 if (INTVAL (RTX) == 0 && OUTER_CODE == SET) \
820 /* If it fits in 8 bits, then it's still relatively cheap. */ \
821 if (INT_8_BITS (INTVAL (RTX))) \
823 /* This is the "base" cost, includes constants where either the \
824 upper or lower 16bits are all zeros. */ \
825 if (INT_16_BITS (INTVAL (RTX)) \
826 || (INTVAL (RTX) & 0xffff) == 0 \
827 || (INTVAL (RTX) & 0xffff0000) == 0) \
830 /* These are more costly than a CONST_INT, but we can relax them, \
831 so they're less costly than a CONST_DOUBLE. */ \
836 /* We don't optimize CONST_DOUBLEs well nor do we relax them well, \
837 so their cost is very high. */ \
841 #define REGISTER_MOVE_COST(CLASS1, CLASS2) \
842 ((CLASS1 == CLASS2 && (CLASS1 == ADDRESS_REGS || CLASS1 == DATA_REGS)) ? 2 :\
843 ((CLASS1 == ADDRESS_REGS || CLASS1 == DATA_REGS) && \
844 (CLASS2 == ADDRESS_REGS || CLASS2 == DATA_REGS)) ? 4 : \
845 (CLASS1 == SP_REGS && CLASS2 == ADDRESS_REGS) ? 2 : \
846 (CLASS1 == ADDRESS_REGS && CLASS2 == SP_REGS) ? 4 : \
847 ! TARGET_AM33 ? 6 : \
848 (CLASS1 == SP_REGS || CLASS2 == SP_REGS) ? 6 : \
849 (CLASS1 == CLASS2 && CLASS1 == EXTENDED_REGS) ? 6 : \
850 (CLASS1 == EXTENDED_REGS || CLASS2 == EXTENDED_REGS) ? 4 : \
853 #define ADDRESS_COST(X) mn10300_address_cost((X), 0)
855 /* A crude cut at RTX_COSTS for the MN10300. */
857 /* Provide the costs of a rtl expression. This is in the body of a
859 #define RTX_COSTS(RTX,CODE,OUTER_CODE) \
868 /* Nonzero if access to memory by bytes or half words is no faster
869 than accessing full words. */
870 #define SLOW_BYTE_ACCESS 1
872 /* Dispatch tables on the mn10300 are extremely expensive in terms of code
873 and readonly data size. So we crank up the case threshold value to
874 encourage a series of if/else comparisons to implement many small switch
875 statements. In theory, this value could be increased much more if we
876 were solely optimizing for space, but we keep it "reasonable" to avoid
877 serious code efficiency lossage. */
878 #define CASE_VALUES_THRESHOLD 6
880 #define NO_FUNCTION_CSE
882 /* According expr.c, a value of around 6 should minimize code size, and
883 for the MN10300 series, that's our primary concern. */
886 #define TEXT_SECTION_ASM_OP "\t.section .text"
887 #define DATA_SECTION_ASM_OP "\t.section .data"
888 #define BSS_SECTION_ASM_OP "\t.section .bss"
890 /* Output at beginning/end of assembler file. */
891 #undef ASM_FILE_START
892 #define ASM_FILE_START(FILE) asm_file_start(FILE)
894 #define ASM_COMMENT_START "#"
896 /* Output to assembler file text saying following lines
897 may contain character constants, extra white space, comments, etc. */
899 #define ASM_APP_ON "#APP\n"
901 /* Output to assembler file text saying following lines
902 no longer contain unusual constructs. */
904 #define ASM_APP_OFF "#NO_APP\n"
906 /* This is how to output an assembler line defining a `double' constant.
907 It is .dfloat or .gfloat, depending. */
909 #define ASM_OUTPUT_DOUBLE(FILE, VALUE) \
910 do { char dstr[30]; \
911 REAL_VALUE_TO_DECIMAL ((VALUE), "%.20e", dstr); \
912 fprintf (FILE, "\t.double %s\n", dstr); \
916 /* This is how to output an assembler line defining a `float' constant. */
917 #define ASM_OUTPUT_FLOAT(FILE, VALUE) \
918 do { char dstr[30]; \
919 REAL_VALUE_TO_DECIMAL ((VALUE), "%.20e", dstr); \
920 fprintf (FILE, "\t.float %s\n", dstr); \
923 /* This is how to output an assembler line defining an `int' constant. */
925 #define ASM_OUTPUT_INT(FILE, VALUE) \
926 ( fprintf (FILE, "\t.long "), \
927 output_addr_const (FILE, (VALUE)), \
928 fprintf (FILE, "\n"))
930 /* Likewise for `char' and `short' constants. */
932 #define ASM_OUTPUT_SHORT(FILE, VALUE) \
933 ( fprintf (FILE, "\t.hword "), \
934 output_addr_const (FILE, (VALUE)), \
935 fprintf (FILE, "\n"))
937 #define ASM_OUTPUT_CHAR(FILE, VALUE) \
938 ( fprintf (FILE, "\t.byte "), \
939 output_addr_const (FILE, (VALUE)), \
940 fprintf (FILE, "\n"))
942 /* This is how to output an assembler line for a numeric constant byte. */
943 #define ASM_OUTPUT_BYTE(FILE, VALUE) \
944 fprintf (FILE, "\t.byte 0x%x\n", (VALUE))
946 /* Define the parentheses used to group arithmetic operations
947 in assembler code. */
949 #define ASM_OPEN_PAREN "("
950 #define ASM_CLOSE_PAREN ")"
952 /* This says how to output the assembler to define a global
953 uninitialized but not common symbol.
954 Try to use asm_output_bss to implement this macro. */
956 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
957 asm_output_aligned_bss ((FILE), (DECL), (NAME), (SIZE), (ALIGN))
959 /* This is how to output the definition of a user-level label named NAME,
960 such as the label on a static function or variable NAME. */
962 #define ASM_OUTPUT_LABEL(FILE, NAME) \
963 do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
965 /* This is how to output a command to make the user-level label named NAME
966 defined for reference from other files. */
968 #define ASM_GLOBALIZE_LABEL(FILE, NAME) \
969 do { fputs ("\t.global ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
971 /* This is how to output a reference to a user-level label named NAME.
972 `assemble_name' uses this. */
974 #undef ASM_OUTPUT_LABELREF
975 #define ASM_OUTPUT_LABELREF(FILE, NAME) \
977 const char* real_name; \
978 STRIP_NAME_ENCODING (real_name, (NAME)); \
979 fprintf (FILE, "_%s", real_name); \
982 /* Store in OUTPUT a string (made with alloca) containing
983 an assembler-name for a local static variable named NAME.
984 LABELNO is an integer which is different for each call. */
986 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
987 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
988 sprintf ((OUTPUT), "%s___%d", (NAME), (LABELNO)))
990 /* This is how we tell the assembler that two symbols have the same value. */
992 #define ASM_OUTPUT_DEF(FILE,NAME1,NAME2) \
993 do { assemble_name(FILE, NAME1); \
994 fputs(" = ", FILE); \
995 assemble_name(FILE, NAME2); \
996 fputc('\n', FILE); } while (0)
999 /* How to refer to registers in assembler output.
1000 This sequence is indexed by compiler's hard-register-number (see above). */
1002 #define REGISTER_NAMES \
1003 { "d0", "d1", "d2", "d3", "a0", "a1", "a2", "a3", "ap", "sp", \
1004 "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7" \
1007 #define ADDITIONAL_REGISTER_NAMES \
1008 { {"r8", 4}, {"r9", 5}, {"r10", 6}, {"r11", 7}, \
1009 {"r12", 0}, {"r13", 1}, {"r14", 2}, {"r15", 3}, \
1010 {"e0", 10}, {"e1", 11}, {"e2", 12}, {"e3", 13}, \
1011 {"e4", 14}, {"e5", 15}, {"e6", 16}, {"e7", 17} \
1014 /* Print an instruction operand X on file FILE.
1015 look in mn10300.c for details */
1017 #define PRINT_OPERAND(FILE, X, CODE) print_operand(FILE,X,CODE)
1019 /* Print a memory operand whose address is X, on file FILE.
1020 This uses a function in output-vax.c. */
1022 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address (FILE, ADDR)
1024 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO)
1025 #define ASM_OUTPUT_REG_POP(FILE,REGNO)
1027 /* This is how to output an element of a case-vector that is absolute. */
1029 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1030 asm_fprintf (FILE, "\t%s .L%d\n", ".long", VALUE)
1032 /* This is how to output an element of a case-vector that is relative. */
1034 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1035 fprintf (FILE, "\t%s .L%d-.L%d\n", ".long", VALUE, REL)
1037 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1039 fprintf (FILE, "\t.align %d\n", (LOG))
1041 /* We don't have to worry about dbx compatibility for the mn10300. */
1042 #define DEFAULT_GDB_EXTENSIONS 1
1044 /* Use dwarf2 debugging info by default. */
1045 #undef PREFERRED_DEBUGGING_TYPE
1046 #define PREFERRED_DEBUGGING_TYPE DWARF2_DEBUG
1048 #define DWARF2_ASM_LINE_DEBUG_INFO 1
1050 #define DBX_REGISTER_NUMBER(REGNO) \
1051 (REGNO_DATA_P ((REGNO)) ? (0 + (REGNO) - FIRST_DATA_REGNUM) \
1052 : REGNO_ADDRESS_P ((REGNO)) ? (4 + (REGNO) - FIRST_ADDRESS_REGNUM) \
1053 : REGNO_SP_P ((REGNO)) ? 8 \
1054 : REGNO_EXTENDED_P ((REGNO)) ? (15 + (REGNO) - FIRST_EXTENDED_REGNUM) \
1057 /* GDB always assumes the current function's frame begins at the value
1058 of the stack pointer upon entry to the current function. Accessing
1059 local variables and parameters passed on the stack is done using the
1060 base of the frame + an offset provided by GCC.
1062 For functions which have frame pointers this method works fine;
1063 the (frame pointer) == (stack pointer at function entry) and GCC provides
1064 an offset relative to the frame pointer.
1066 This loses for functions without a frame pointer; GCC provides an offset
1067 which is relative to the stack pointer after adjusting for the function's
1068 frame size. GDB would prefer the offset to be relative to the value of
1069 the stack pointer at the function's entry. Yuk! */
1070 #define DEBUGGER_AUTO_OFFSET(X) \
1071 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
1072 + (frame_pointer_needed \
1073 ? 0 : -initial_offset (FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM)))
1075 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
1076 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
1077 + (frame_pointer_needed \
1078 ? 0 : -initial_offset (ARG_POINTER_REGNUM, STACK_POINTER_REGNUM)))
1080 /* Define to use software floating point emulator for REAL_ARITHMETIC and
1081 decimal <-> binary conversion. */
1082 #define REAL_ARITHMETIC
1084 /* Specify the machine mode that this machine uses
1085 for the index in the tablejump instruction. */
1086 #define CASE_VECTOR_MODE Pmode
1088 /* Define if operations between registers always perform the operation
1089 on the full register even if a narrower mode is specified. */
1090 #define WORD_REGISTER_OPERATIONS
1092 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1094 /* Specify the tree operation to be used to convert reals to integers. */
1095 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
1097 /* This flag, if defined, says the same insns that convert to a signed fixnum
1098 also convert validly to an unsigned one. */
1099 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
1101 /* This is the kind of divide that is easiest to do in the general case. */
1102 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
1104 /* Max number of bytes we can move from memory to memory
1105 in one reasonably fast instruction. */
1108 /* Define if shifts truncate the shift count
1109 which implies one can omit a sign-extension or zero-extension
1110 of a shift count. */
1111 #define SHIFT_COUNT_TRUNCATED 1
1113 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1114 is done just by pretending it is already truncated. */
1115 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1117 /* Specify the machine mode that pointers have.
1118 After generation of rtl, the compiler makes no further distinction
1119 between pointers and any other objects of this machine mode. */
1120 #define Pmode SImode
1122 /* A function address in a call instruction
1123 is a byte address (for indexing purposes)
1124 so give the MEM rtx a byte's mode. */
1125 #define FUNCTION_MODE QImode
1127 /* The assembler op to get a word. */
1129 #define FILE_ASM_OP "\t.file\n"