1 /* Definitions of target machine for GNU compiler, for the pdp-11
2 Copyright (C) 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002, 2004, 2005,
3 2006, 2007, 2008 Free Software Foundation, Inc.
4 Contributed by Michael K. Gschwind (mike@vlsivie.tuwien.ac.at).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 #define CONSTANT_POOL_BEFORE_FUNCTION 0
24 /* check whether load_fpu_reg or not */
25 #define LOAD_FPU_REG_P(x) ((x)>=8 && (x)<=11)
26 #define NO_LOAD_FPU_REG_P(x) ((x)==12 || (x)==13)
27 #define FPU_REG_P(x) (LOAD_FPU_REG_P(x) || NO_LOAD_FPU_REG_P(x))
28 #define CPU_REG_P(x) ((x)<8)
30 /* Names to predefine in the preprocessor for this target machine. */
32 #define TARGET_CPU_CPP_BUILTINS() \
35 builtin_define_std ("pdp11"); \
39 /* Print subsidiary information on the compiler version in use. */
40 #define TARGET_VERSION fprintf (stderr, " (pdp11)");
43 /* Generate DBX debugging information. */
45 /* #define DBX_DEBUGGING_INFO */
47 #define TARGET_40_PLUS (TARGET_40 || TARGET_45)
48 #define TARGET_10 (! TARGET_40_PLUS)
50 #define TARGET_UNIX_ASM_DEFAULT 0
52 #define ASSEMBLER_DIALECT (TARGET_UNIX_ASM ? 1 : 0)
57 #define SHORT_TYPE_SIZE 16
58 #define INT_TYPE_SIZE (TARGET_INT16 ? 16 : 32)
59 #define LONG_TYPE_SIZE 32
60 #define LONG_LONG_TYPE_SIZE 64
62 /* if we set FLOAT_TYPE_SIZE to 32, we could have the benefit
63 of saving core for huge arrays - the definitions are
64 already in md - but floats can never reside in
65 an FPU register - we keep the FPU in double float mode
67 #define FLOAT_TYPE_SIZE (TARGET_FLOAT32 ? 32 : 64)
68 #define DOUBLE_TYPE_SIZE 64
69 #define LONG_DOUBLE_TYPE_SIZE 64
71 /* machine types from ansi */
72 #define SIZE_TYPE "unsigned int" /* definition of size_t */
73 #define WCHAR_TYPE "int" /* or long int???? */
74 #define WCHAR_TYPE_SIZE 16
76 #define PTRDIFF_TYPE "int"
78 /* target machine storage layout */
80 /* Define this if most significant bit is lowest numbered
81 in instructions that operate on numbered bit-fields. */
82 #define BITS_BIG_ENDIAN 0
84 /* Define this if most significant byte of a word is the lowest numbered. */
85 #define BYTES_BIG_ENDIAN 0
87 /* Define this if most significant word of a multiword number is first. */
88 #define WORDS_BIG_ENDIAN 1
90 /* Define that floats are in VAX order, not high word first as for ints. */
91 #define FLOAT_WORDS_BIG_ENDIAN 0
93 /* Width of a word, in units (bytes).
95 UNITS OR BYTES - seems like units */
96 #define UNITS_PER_WORD 2
98 /* This machine doesn't use IEEE floats. */
99 /* Because the pdp11 (at least Unix) convention for 32-bit ints is
100 big endian, opposite for what you need for float, the vax float
101 conversion routines aren't actually used directly. But the underlying
102 format is indeed the vax/pdp11 float format. */
103 extern const struct real_format pdp11_f_format
;
104 extern const struct real_format pdp11_d_format
;
106 /* Maximum sized of reasonable data type
107 DImode or Dfmode ...*/
108 #define MAX_FIXED_MODE_SIZE 64
110 /* Allocation boundary (in *bits*) for storing pointers in memory. */
111 #define POINTER_BOUNDARY 16
113 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
114 #define PARM_BOUNDARY 16
116 /* Boundary (in *bits*) on which stack pointer should be aligned. */
117 #define STACK_BOUNDARY 16
119 /* Allocation boundary (in *bits*) for the code of a function. */
120 #define FUNCTION_BOUNDARY 16
122 /* Alignment of field after `int : 0' in a structure. */
123 #define EMPTY_FIELD_BOUNDARY 16
125 /* No data type wants to be aligned rounder than this. */
126 #define BIGGEST_ALIGNMENT 16
128 /* Define this if move instructions will actually fail to work
129 when given unaligned data. */
130 #define STRICT_ALIGNMENT 1
132 /* Standard register usage. */
134 /* Number of actual hardware registers.
135 The hardware registers are assigned numbers for the compiler
136 from 0 to just below FIRST_PSEUDO_REGISTER.
137 All registers that the compiler knows about must be given numbers,
138 even those that are not normally considered general registers.
140 we have 8 integer registers, plus 6 float
141 (don't use scratch float !) */
143 #define FIRST_PSEUDO_REGISTER 14
145 /* 1 for registers that have pervasive standard uses
146 and are not available for the register allocator.
148 On the pdp, these are:
151 reg 5 = fp; not necessarily!
154 /* don't let them touch fp regs for the time being !*/
156 #define FIXED_REGISTERS \
157 {0, 0, 0, 0, 0, 0, 1, 1, \
162 /* 1 for registers not available across function calls.
163 These must include the FIXED_REGISTERS and also any
164 registers that can be used without being saved.
165 The latter must include the registers where values are returned
166 and the register where structure-value addresses are passed.
167 Aside from that, you can include as many other registers as you like. */
169 /* don't know about fp */
170 #define CALL_USED_REGISTERS \
171 {1, 1, 0, 0, 0, 0, 1, 1, \
175 /* Make sure everything's fine if we *don't* have an FPU.
176 This assumes that putting a register in fixed_regs will keep the
177 compiler's mitts completely off it. We don't bother to zero it out
178 of register classes. Also fix incompatible register naming with
181 #define CONDITIONAL_REGISTER_USAGE \
187 COPY_HARD_REG_SET (x, reg_class_contents[(int)FPU_REGS]); \
188 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++ ) \
189 if (TEST_HARD_REG_BIT (x, i)) \
190 fixed_regs[i] = call_used_regs[i] = 1; \
194 call_used_regs[8] = 1; \
195 if (TARGET_UNIX_ASM) \
197 /* Change names of FPU registers for the UNIX assembler. */ \
198 reg_names[8] = "fr0"; \
199 reg_names[9] = "fr1"; \
200 reg_names[10] = "fr2"; \
201 reg_names[11] = "fr3"; \
202 reg_names[12] = "fr4"; \
203 reg_names[13] = "fr5"; \
207 /* Return number of consecutive hard regs needed starting at reg REGNO
208 to hold something of mode MODE.
209 This is ordinarily the length in words of a value of mode MODE
210 but can be less for certain modes in special long registers.
213 #define HARD_REGNO_NREGS(REGNO, MODE) \
215 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD) \
219 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
220 On the pdp, the cpu registers can hold any mode - check alignment
222 FPU can only hold DF - simplifies life!
224 #define HARD_REGNO_MODE_OK(REGNO, MODE) \
226 ((GET_MODE_BITSIZE(MODE) <= 16) \
227 || (GET_MODE_BITSIZE(MODE) == 32 && !((REGNO) & 1))) \
231 /* Value is 1 if it is a good idea to tie two pseudo registers
232 when one has mode MODE1 and one has mode MODE2.
233 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
234 for any hard reg, then this must be 0 for correct output. */
235 #define MODES_TIEABLE_P(MODE1, MODE2) 0
237 /* Specify the registers used for certain standard purposes.
238 The values of these macros are register numbers. */
240 /* the pdp11 pc overloaded on a register that the compiler knows about. */
243 /* Register to use for pushing function arguments. */
244 #define STACK_POINTER_REGNUM 6
246 /* Base register for access to local variables of the function. */
247 #define FRAME_POINTER_REGNUM 5
249 /* Base register for access to arguments of the function. */
250 #define ARG_POINTER_REGNUM 5
252 /* Register in which static-chain is passed to a function. */
253 /* ??? - i don't want to give up a reg for this! */
254 #define STATIC_CHAIN_REGNUM 4
256 /* Define the classes of registers for register constraints in the
257 machine description. Also define ranges of constants.
259 One of the classes must always be named ALL_REGS and include all hard regs.
260 If there is more than one class, another class must be named NO_REGS
261 and contain no registers.
263 The name GENERAL_REGS must be the name of a class (or an alias for
264 another name such as ALL_REGS). This is the class of registers
265 that is allowed by "g" or "r" in a register constraint.
266 Also, registers outside this class are allocated only when
267 instructions express preferences for them.
269 The classes must be numbered in nondecreasing order; that is,
270 a larger-numbered class must never be contained completely
271 in a smaller-numbered class.
273 For any two classes, it is very desirable that there be another
274 class that represents their union. */
276 /* The pdp has a couple of classes:
278 MUL_REGS are used for odd numbered regs, to use in 16-bit multiplication
279 (even numbered do 32-bit multiply)
280 LMUL_REGS long multiply registers (even numbered regs )
281 (don't need them, all 32-bit regs are even numbered!)
282 GENERAL_REGS is all cpu
283 LOAD_FPU_REGS is the first four cpu regs, they are easier to load
284 NO_LOAD_FPU_REGS is ac4 and ac5, currently - difficult to load them
285 FPU_REGS is all fpu regs
288 enum reg_class
{ NO_REGS
, MUL_REGS
, GENERAL_REGS
, LOAD_FPU_REGS
, NO_LOAD_FPU_REGS
, FPU_REGS
, ALL_REGS
, LIM_REG_CLASSES
};
290 #define N_REG_CLASSES (int) LIM_REG_CLASSES
292 /* have to allow this till cmpsi/tstsi are fixed in a better way !! */
293 #define SMALL_REGISTER_CLASSES 1
295 /* Since GENERAL_REGS is the same class as ALL_REGS,
296 don't give it a different class number; just make it an alias. */
298 /* #define GENERAL_REGS ALL_REGS */
300 /* Give names of register classes as strings for dump file. */
302 #define REG_CLASS_NAMES {"NO_REGS", "MUL_REGS", "GENERAL_REGS", "LOAD_FPU_REGS", "NO_LOAD_FPU_REGS", "FPU_REGS", "ALL_REGS" }
304 /* Define which registers fit in which classes.
305 This is an initializer for a vector of HARD_REG_SET
306 of length N_REG_CLASSES. */
308 #define REG_CLASS_CONTENTS {{0}, {0x00aa}, {0x00ff}, {0x0f00}, {0x3000}, {0x3f00}, {0x3fff}}
310 /* The same information, inverted:
311 Return the class number of the smallest class containing
312 reg number REGNO. This could be a conditional expression
313 or could index an array. */
315 #define REGNO_REG_CLASS(REGNO) \
316 ((REGNO)>=8?((REGNO)<=11?LOAD_FPU_REGS:NO_LOAD_FPU_REGS):(((REGNO)&1)?MUL_REGS:GENERAL_REGS))
319 /* The class value for index registers, and the one for base regs. */
320 #define INDEX_REG_CLASS GENERAL_REGS
321 #define BASE_REG_CLASS GENERAL_REGS
323 /* Get reg_class from a letter such as appears in the machine description. */
325 #define REG_CLASS_FROM_LETTER(C) \
326 ((C) == 'f' ? FPU_REGS : \
327 ((C) == 'd' ? MUL_REGS : \
328 ((C) == 'a' ? LOAD_FPU_REGS : NO_REGS)))
331 /* The letters I, J, K, L and M in a register constraint string
332 can be used to stand for particular ranges of immediate operands.
333 This macro defines what the ranges are.
334 C is the letter, and VALUE is a constant value.
335 Return 1 if VALUE is in the range specified by C.
339 K completely random 32 bit
340 L,M,N -1,1,0 respectively
341 O where doing shifts in sequence is faster than
345 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
346 ((C) == 'I' ? ((VALUE) & 0xffff0000) == 0 \
347 : (C) == 'J' ? ((VALUE) & 0x0000ffff) == 0 \
348 : (C) == 'K' ? (((VALUE) & 0xffff0000) != 0 \
349 && ((VALUE) & 0x0000ffff) != 0) \
350 : (C) == 'L' ? ((VALUE) == 1) \
351 : (C) == 'M' ? ((VALUE) == -1) \
352 : (C) == 'N' ? ((VALUE) == 0) \
353 : (C) == 'O' ? (abs(VALUE) >1 && abs(VALUE) <= 4) \
356 /* Similar, but for floating constants, and defining letters G and H.
357 Here VALUE is the CONST_DOUBLE rtx itself. */
359 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
360 ((C) == 'G' && XINT (VALUE, 0) == 0 && XINT (VALUE, 1) == 0)
363 /* Letters in the range `Q' through `U' may be defined in a
364 machine-dependent fashion to stand for arbitrary operand types.
365 The machine description macro `EXTRA_CONSTRAINT' is passed the
366 operand as its first argument and the constraint letter as its
369 `Q' is for memory references that require an extra word after the opcode.
370 `R' is for memory references which are encoded within the opcode. */
372 #define EXTRA_CONSTRAINT(OP,CODE) \
373 ((GET_CODE (OP) != MEM) ? 0 \
374 : !memory_address_p (GET_MODE (OP), XEXP (OP, 0)) ? 0 \
375 : ((CODE) == 'Q') ? !simple_memory_operand (OP, GET_MODE (OP)) \
376 : ((CODE) == 'R') ? simple_memory_operand (OP, GET_MODE (OP)) \
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 loading is easier into LOAD_FPU_REGS than FPU_REGS! */
386 #define PREFERRED_RELOAD_CLASS(X,CLASS) \
387 (((CLASS) != FPU_REGS)?(CLASS):LOAD_FPU_REGS)
389 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,x) \
390 (((CLASS) == NO_LOAD_FPU_REGS && !(REG_P(x) && LOAD_FPU_REG_P(REGNO(x))))?LOAD_FPU_REGS:NO_REGS)
392 /* Return the maximum number of consecutive registers
393 needed to represent mode MODE in a register of class CLASS. */
394 #define CLASS_MAX_NREGS(CLASS, MODE) \
395 ((CLASS == GENERAL_REGS || CLASS == MUL_REGS)? \
396 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD): \
401 /* Stack layout; function entry, exit and calling. */
403 /* Define this if pushing a word on the stack
404 makes the stack pointer a smaller address. */
405 #define STACK_GROWS_DOWNWARD
407 /* Define this to nonzero if the nominal address of the stack frame
408 is at the high-address end of the local variables;
409 that is, each additional local variable allocated
410 goes at a more negative offset in the frame.
412 #define FRAME_GROWS_DOWNWARD 1
414 /* Offset within stack frame to start allocating local variables at.
415 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
416 first local allocated. Otherwise, it is the offset to the BEGINNING
417 of the first local allocated. */
418 #define STARTING_FRAME_OFFSET 0
420 /* If we generate an insn to push BYTES bytes,
421 this says how many the stack pointer really advances by.
422 On the pdp11, the stack is on an even boundary */
423 #define PUSH_ROUNDING(BYTES) ((BYTES + 1) & ~1)
425 /* current_first_parm_offset stores the # of registers pushed on the
427 extern int current_first_parm_offset
;
429 /* Offset of first parameter from the argument pointer register value.
430 For the pdp11, this is nonzero to account for the return address.
432 2 - frame pointer (always saved, even when not used!!!!)
433 -- change some day !!!:q!
436 #define FIRST_PARM_OFFSET(FNDECL) 4
438 /* Value is 1 if returning from a function call automatically
439 pops the arguments described by the number-of-args field in the call.
440 FUNDECL is the declaration node of the function (as a tree),
441 FUNTYPE is the data type of the function (as a tree),
442 or for a library call it is an identifier node for the subroutine name. */
444 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
446 /* Define how to find the value returned by a function.
447 VALTYPE is the data type of the value (as a tree).
448 If the precise function being called is known, FUNC is its FUNCTION_DECL;
449 otherwise, FUNC is 0. */
450 #define BASE_RETURN_VALUE_REG(MODE) \
451 ((MODE) == DFmode ? 8 : 0)
453 /* On the pdp11 the value is found in R0 (or ac0???
454 not without FPU!!!! ) */
456 #define FUNCTION_VALUE(VALTYPE, FUNC) \
457 gen_rtx_REG (TYPE_MODE (VALTYPE), BASE_RETURN_VALUE_REG(TYPE_MODE(VALTYPE)))
459 /* and the called function leaves it in the first register.
460 Difference only on machines with register windows. */
462 #define FUNCTION_OUTGOING_VALUE(VALTYPE, FUNC) \
463 gen_rtx_REG (TYPE_MODE (VALTYPE), BASE_RETURN_VALUE_REG(TYPE_MODE(VALTYPE)))
465 /* Define how to find the value returned by a library function
466 assuming the value has mode MODE. */
468 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, BASE_RETURN_VALUE_REG(MODE))
470 /* 1 if N is a possible register number for a function value
471 as seen by the caller.
472 On the pdp, the first "output" reg is the only register thus used.
474 maybe ac0 ? - as option someday! */
476 #define FUNCTION_VALUE_REGNO_P(N) (((N) == 0) || (TARGET_AC0 && (N) == 8))
478 /* 1 if N is a possible register number for function argument passing.
481 #define FUNCTION_ARG_REGNO_P(N) 0
483 /* Define a data type for recording info about an argument list
484 during the scan of that argument list. This data type should
485 hold all necessary information about the function itself
486 and about the args processed so far, enough to enable macros
487 such as FUNCTION_ARG to determine where the next arg should go.
491 #define CUMULATIVE_ARGS int
493 /* Initialize a variable CUM of type CUMULATIVE_ARGS
494 for a call to a function whose data type is FNTYPE.
495 For a library call, FNTYPE is 0.
497 ...., the offset normally starts at 0, but starts at 1 word
498 when the function gets a structure-value-address as an
499 invisible first argument. */
501 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \
504 /* Update the data in CUM to advance over an argument
505 of mode MODE and data type TYPE.
506 (TYPE is null for libcalls where that information may not be available.)
511 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
512 ((CUM) += ((MODE) != BLKmode \
513 ? (GET_MODE_SIZE (MODE)) \
514 : (int_size_in_bytes (TYPE))))
516 /* Determine where to put an argument to a function.
517 Value is zero to push the argument on the stack,
518 or a hard register in which to store the argument.
520 MODE is the argument's machine mode.
521 TYPE is the data type of the argument (as a tree).
522 This is null for libcalls where that information may
524 CUM is a variable of type CUMULATIVE_ARGS which gives info about
525 the preceding args and about the function being called.
526 NAMED is nonzero if this argument is a named parameter
527 (otherwise it is an extra parameter matching an ellipsis). */
529 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) 0
531 /* Define where a function finds its arguments.
532 This would be different from FUNCTION_ARG if we had register windows. */
534 #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \
535 FUNCTION_ARG (CUM, MODE, TYPE, NAMED)
538 /* Output assembler code to FILE to increment profiler label # LABELNO
539 for profiling a function entry. */
541 #define FUNCTION_PROFILER(FILE, LABELNO) \
544 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
545 the stack pointer does not matter. The value is tested only in
546 functions that have frame pointers.
547 No definition is equivalent to always zero. */
549 extern int may_call_alloca
;
551 #define EXIT_IGNORE_STACK 1
553 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH_VAR) \
556 offset = get_frame_size(); \
557 for (regno = 0; regno < 8; regno++) \
558 if (df_regs_ever_live_p (regno) && ! call_used_regs[regno]) \
560 for (regno = 8; regno < 14; regno++) \
561 if (df_regs_ever_live_p (regno) && ! call_used_regs[regno]) \
563 /* offset -= 2; no fp on stack frame */ \
564 (DEPTH_VAR) = offset; \
568 /* Addressing modes, and classification of registers for them. */
570 #define HAVE_POST_INCREMENT 1
572 #define HAVE_PRE_DECREMENT 1
574 /* Macros to check register numbers against specific register classes. */
576 /* These assume that REGNO is a hard or pseudo reg number.
577 They give nonzero only if REGNO is a hard reg of the suitable class
578 or a pseudo reg currently allocated to a suitable hard reg.
579 Since they use reg_renumber, they are safe only once reg_renumber
580 has been allocated, which happens in local-alloc.c. */
582 #define REGNO_OK_FOR_INDEX_P(REGNO) \
583 ((REGNO) < 8 || (unsigned) reg_renumber[REGNO] < 8)
584 #define REGNO_OK_FOR_BASE_P(REGNO) \
585 ((REGNO) < 8 || (unsigned) reg_renumber[REGNO] < 8)
587 /* Now macros that check whether X is a register and also,
588 strictly, whether it is in a specified class.
593 /* Maximum number of registers that can appear in a valid memory address. */
595 #define MAX_REGS_PER_ADDRESS 1
597 /* Recognize any constant value that is a valid address. */
599 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X)
601 /* Nonzero if the constant value X is a legitimate general operand.
602 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
604 #define LEGITIMATE_CONSTANT_P(X) \
605 (GET_CODE (X) != CONST_DOUBLE || legitimate_const_double_p (X))
607 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
608 and check its validity for a certain class.
609 We have two alternate definitions for each of them.
610 The usual definition accepts all pseudo regs; the other rejects
611 them unless they have been allocated suitable hard regs.
612 The symbol REG_OK_STRICT causes the latter definition to be used.
614 Most source files want to accept pseudo regs in the hope that
615 they will get allocated to the class that the insn wants them to be in.
616 Source files for reload pass need to be strict.
617 After reload, it makes no difference, since pseudo regs have
618 been eliminated by then. */
620 #ifndef REG_OK_STRICT
622 /* Nonzero if X is a hard reg that can be used as an index
623 or if it is a pseudo reg. */
624 #define REG_OK_FOR_INDEX_P(X) (1)
625 /* Nonzero if X is a hard reg that can be used as a base reg
626 or if it is a pseudo reg. */
627 #define REG_OK_FOR_BASE_P(X) (1)
631 /* Nonzero if X is a hard reg that can be used as an index. */
632 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
633 /* Nonzero if X is a hard reg that can be used as a base reg. */
634 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
638 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
639 that is a valid memory address for an instruction.
640 The MODE argument is the machine mode for the MEM expression
641 that wants to use this address.
645 #define GO_IF_LEGITIMATE_ADDRESS(mode, operand, ADDR) \
650 if (GET_CODE (operand) == REG \
651 && REG_OK_FOR_BASE_P(operand)) \
654 /* accept @#address */ \
655 if (CONSTANT_ADDRESS_P (operand)) \
659 if (GET_CODE (operand) == PLUS \
660 && GET_CODE (XEXP (operand, 0)) == REG \
661 && REG_OK_FOR_BASE_P (XEXP (operand, 0)) \
662 && CONSTANT_ADDRESS_P (XEXP (operand, 1))) \
666 if (GET_CODE (operand) == PRE_DEC \
667 && GET_CODE (XEXP (operand, 0)) == REG \
668 && REG_OK_FOR_BASE_P (XEXP (operand, 0))) \
672 if (GET_CODE (operand) == POST_INC \
673 && GET_CODE (XEXP (operand, 0)) == REG \
674 && REG_OK_FOR_BASE_P (XEXP (operand, 0))) \
677 /* accept -(SP) -- which uses PRE_MODIFY for byte mode */ \
678 if (GET_CODE (operand) == PRE_MODIFY \
679 && GET_CODE (XEXP (operand, 0)) == REG \
680 && REGNO (XEXP (operand, 0)) == 6 \
681 && GET_CODE ((xfoob = XEXP (operand, 1))) == PLUS \
682 && GET_CODE (XEXP (xfoob, 0)) == REG \
683 && REGNO (XEXP (xfoob, 0)) == 6 \
684 && CONSTANT_P (XEXP (xfoob, 1)) \
685 && INTVAL (XEXP (xfoob,1)) == -2) \
688 /* accept (SP)+ -- which uses POST_MODIFY for byte mode */ \
689 if (GET_CODE (operand) == POST_MODIFY \
690 && GET_CODE (XEXP (operand, 0)) == REG \
691 && REGNO (XEXP (operand, 0)) == 6 \
692 && GET_CODE ((xfoob = XEXP (operand, 1))) == PLUS \
693 && GET_CODE (XEXP (xfoob, 0)) == REG \
694 && REGNO (XEXP (xfoob, 0)) == 6 \
695 && CONSTANT_P (XEXP (xfoob, 1)) \
696 && INTVAL (XEXP (xfoob,1)) == 2) \
700 /* handle another level of indirection ! */ \
701 if (GET_CODE(operand) != MEM) \
704 xfoob = XEXP (operand, 0); \
706 /* (MEM:xx (MEM:xx ())) is not valid for SI, DI and currently */ \
707 /* also forbidden for float, because we have to handle this */ \
708 /* in output_move_double and/or output_move_quad() - we could */ \
709 /* do it, but currently it's not worth it!!! */ \
710 /* now that DFmode cannot go into CPU register file, */ \
711 /* maybe I should allow float ... */ \
712 /* but then I have to handle memory-to-memory moves in movdf ?? */ \
714 if (GET_MODE_BITSIZE(mode) > 16) \
717 /* accept @(R0) - which is @0(R0) */ \
718 if (GET_CODE (xfoob) == REG \
719 && REG_OK_FOR_BASE_P(xfoob)) \
722 /* accept @address */ \
723 if (CONSTANT_ADDRESS_P (xfoob)) \
726 /* accept @X(R0) */ \
727 if (GET_CODE (xfoob) == PLUS \
728 && GET_CODE (XEXP (xfoob, 0)) == REG \
729 && REG_OK_FOR_BASE_P (XEXP (xfoob, 0)) \
730 && CONSTANT_ADDRESS_P (XEXP (xfoob, 1))) \
733 /* accept @-(R0) */ \
734 if (GET_CODE (xfoob) == PRE_DEC \
735 && GET_CODE (XEXP (xfoob, 0)) == REG \
736 && REG_OK_FOR_BASE_P (XEXP (xfoob, 0))) \
739 /* accept @(R0)+ */ \
740 if (GET_CODE (xfoob) == POST_INC \
741 && GET_CODE (XEXP (xfoob, 0)) == REG \
742 && REG_OK_FOR_BASE_P (XEXP (xfoob, 0))) \
745 /* anything else is invalid */ \
750 /* Specify the machine mode that this machine uses
751 for the index in the tablejump instruction. */
752 #define CASE_VECTOR_MODE HImode
754 /* Define this if a raw index is all that is needed for a
756 #define CASE_TAKES_INDEX_RAW
758 /* Define this as 1 if `char' should by default be signed; else as 0. */
759 #define DEFAULT_SIGNED_CHAR 1
761 /* Max number of bytes we can move from memory to memory
762 in one reasonably fast instruction.
767 /* Nonzero if access to memory by byte is slow and undesirable. -
769 #define SLOW_BYTE_ACCESS 0
771 /* Do not break .stabs pseudos into continuations. */
772 #define DBX_CONTIN_LENGTH 0
774 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
775 is done just by pretending it is already truncated. */
776 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
778 /* Give a comparison code (EQ, NE etc) and the first operand of a COMPARE,
779 return the mode to be used for the comparison. For floating-point, CCFPmode
782 #define SELECT_CC_MODE(OP,X,Y) \
783 (GET_MODE_CLASS(GET_MODE(X)) == MODE_FLOAT? CCFPmode : CCmode)
785 /* Specify the machine mode that pointers have.
786 After generation of rtl, the compiler makes no further distinction
787 between pointers and any other objects of this machine mode. */
790 /* A function address in a call instruction
791 is a word address (for indexing purposes)
792 so give the MEM rtx a word's mode. */
793 #define FUNCTION_MODE HImode
795 /* Define this if addresses of constant functions
796 shouldn't be put through pseudo regs where they can be cse'd.
797 Desirable on machines where ordinary constants are expensive
798 but a CALL with constant address is cheap. */
799 /* #define NO_FUNCTION_CSE */
802 /* cost of moving one register class to another */
803 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
804 register_move_cost (CLASS1, CLASS2)
806 /* Tell emit-rtl.c how to initialize special values on a per-function base. */
808 extern struct rtx_def
*cc0_reg_rtx
;
810 #define CC_STATUS_MDEP rtx
812 #define CC_STATUS_MDEP_INIT (cc_status.mdep = 0)
814 /* Tell final.c how to eliminate redundant test instructions. */
816 /* Here we define machine-dependent flags and fields in cc_status
817 (see `conditions.h'). */
819 #define CC_IN_FPU 04000
821 /* Do UPDATE_CC if EXP is a set, used in
824 floats only do compare correctly, else nullify ...
829 /* Store in cc_status the expressions
830 that the condition codes will describe
831 after execution of an instruction whose pattern is EXP.
832 Do not alter them if the instruction would not alter the cc's. */
834 #define NOTICE_UPDATE_CC(EXP, INSN) \
835 { if (GET_CODE (EXP) == SET) \
837 notice_update_cc_on_set(EXP, INSN); \
839 else if (GET_CODE (EXP) == PARALLEL \
840 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
842 notice_update_cc_on_set(XVECEXP (EXP, 0, 0), INSN); \
844 else if (GET_CODE (EXP) == CALL) \
845 { /* all bets are off */ CC_STATUS_INIT; } \
846 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
847 && cc_status.value2 \
848 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
850 printf ("here!\n"); \
851 cc_status.value2 = 0; \
855 /* Control the assembler format that we output. */
857 /* Output to assembler file text saying following lines
858 may contain character constants, extra white space, comments, etc. */
860 #define ASM_APP_ON ""
862 /* Output to assembler file text saying following lines
863 no longer contain unusual constructs. */
865 #define ASM_APP_OFF ""
867 /* Output before read-only data. */
869 #define TEXT_SECTION_ASM_OP "\t.text\n"
871 /* Output before writable data. */
873 #define DATA_SECTION_ASM_OP "\t.data\n"
875 /* How to refer to registers in assembler output.
876 This sequence is indexed by compiler's hard-register-number (see above). */
878 #define REGISTER_NAMES \
879 {"r0", "r1", "r2", "r3", "r4", "r5", "sp", "pc", \
880 "ac0", "ac1", "ac2", "ac3", "ac4", "ac5" }
882 /* Globalizing directive for a label. */
883 #define GLOBAL_ASM_OP "\t.globl "
885 /* The prefix to add to user-visible assembler symbols. */
887 #define USER_LABEL_PREFIX "_"
889 /* This is how to store into the string LABEL
890 the symbol_ref name of an internal numbered label where
891 PREFIX is the class of label and NUM is the number within the class.
892 This is suitable for output with `assemble_name'. */
894 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
895 sprintf (LABEL, "*%s_%lu", PREFIX, (unsigned long)(NUM))
897 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
898 output_ascii (FILE, P, SIZE)
900 /* This is how to output an element of a case-vector that is absolute. */
902 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
903 fprintf (FILE, "\t%sL_%d\n", TARGET_UNIX_ASM ? "" : ".word ", VALUE)
905 /* This is how to output an element of a case-vector that is relative.
906 Don't define this if it is not supported. */
908 /* #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) */
910 /* This is how to output an assembler line
911 that says to advance the location counter
912 to a multiple of 2**LOG bytes.
917 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
923 fprintf (FILE, "\t.even\n"); \
926 gcc_unreachable (); \
929 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
930 fprintf (FILE, "\t.=.+ %#ho\n", (unsigned short)(SIZE))
932 /* This says how to output an assembler line
933 to define a global common symbol. */
935 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
936 ( fprintf ((FILE), ".globl "), \
937 assemble_name ((FILE), (NAME)), \
938 fprintf ((FILE), "\n"), \
939 assemble_name ((FILE), (NAME)), \
940 fprintf ((FILE), ": .=.+ %#ho\n", (unsigned short)(ROUNDED)) \
943 /* This says how to output an assembler line
944 to define a local common symbol. */
946 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
947 ( assemble_name ((FILE), (NAME)), \
948 fprintf ((FILE), ":\t.=.+ %#ho\n", (unsigned short)(ROUNDED)))
950 /* Print operand X (an rtx) in assembler syntax to file FILE.
951 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
952 For `%' followed by punctuation, CODE is the punctuation and X is null.
957 #define PRINT_OPERAND(FILE, X, CODE) \
958 { if (CODE == '#') fprintf (FILE, "#"); \
959 else if (GET_CODE (X) == REG) \
960 fprintf (FILE, "%s", reg_names[REGNO (X)]); \
961 else if (GET_CODE (X) == MEM) \
962 output_address (XEXP (X, 0)); \
963 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) != SImode) \
964 { REAL_VALUE_TYPE r; \
966 REAL_VALUE_FROM_CONST_DOUBLE (r, X); \
967 REAL_VALUE_TO_TARGET_DOUBLE (r, sval); \
968 fprintf (FILE, "$%#lo", sval[0] >> 16); } \
969 else { putc ('$', FILE); output_addr_const_pdp11 (FILE, X); }}
971 /* Print a memory address as an operand to reference that memory location. */
973 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
974 print_operand_address (FILE, ADDR)
976 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
978 fprintf (FILE, "\tmov %s, -(sp)\n", reg_names[REGNO]) \
981 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
983 fprintf (FILE, "\tmov (sp)+, %s\n", reg_names[REGNO]) \
986 /* trampoline - how should i do it in separate i+d ?
987 have some allocate_trampoline magic???
989 the following should work for shared I/D: */
991 /* lets see whether this works as trampoline:
992 MV #STATIC, $4 0x940Y 0x0000 <- STATIC; Y = STATIC_CHAIN_REGNUM
993 JMP FUNCTION 0x0058 0x0000 <- FUNCTION
996 #define TRAMPOLINE_TEMPLATE(FILE) \
998 gcc_assert (!TARGET_SPLIT); \
1000 assemble_aligned_integer (2, GEN_INT (0x9400+STATIC_CHAIN_REGNUM)); \
1001 assemble_aligned_integer (2, const0_rtx); \
1002 assemble_aligned_integer (2, GEN_INT(0x0058)); \
1003 assemble_aligned_integer (2, const0_rtx); \
1006 #define TRAMPOLINE_SIZE 8
1007 #define TRAMPOLINE_ALIGNMENT 16
1009 /* Emit RTL insns to initialize the variable parts of a trampoline.
1010 FNADDR is an RTX for the address of the function's pure code.
1011 CXT is an RTX for the static chain value for the function. */
1013 #define INITIALIZE_TRAMPOLINE(TRAMP,FNADDR,CXT) \
1015 gcc_assert (!TARGET_SPLIT); \
1017 emit_move_insn (gen_rtx_MEM (HImode, plus_constant (TRAMP, 2)), CXT); \
1018 emit_move_insn (gen_rtx_MEM (HImode, plus_constant (TRAMP, 6)), FNADDR); \
1022 /* Some machines may desire to change what optimizations are
1023 performed for various optimization levels. This macro, if
1024 defined, is executed once just after the optimization level is
1025 determined and before the remainder of the command options have
1026 been parsed. Values set in this macro are used as the default
1027 values for the other command line options.
1029 LEVEL is the optimization level specified; 2 if -O2 is
1030 specified, 1 if -O is specified, and 0 if neither is specified. */
1032 #define OPTIMIZATION_OPTIONS(LEVEL,SIZE) \
1034 flag_finite_math_only = 0; \
1035 flag_trapping_math = 0; \
1036 flag_signaling_nans = 0; \
1039 flag_omit_frame_pointer = 1; \
1040 /* flag_unroll_loops = 1; */ \
1044 /* there is no point in avoiding branches on a pdp,
1045 since branches are really cheap - I just want to find out
1046 how much difference the BRANCH_COST macro makes in code */
1047 #define BRANCH_COST(speed_p, predictable_p) (TARGET_BRANCH_CHEAP ? 0 : 1)
1050 #define COMPARE_FLAG_MODE HImode