1 /* Definitions of target machine for GNU compiler, for the pdp-11
2 Copyright (C) 1994-2017 Free Software Foundation, Inc.
3 Contributed by Michael K. Gschwind (mike@vlsivie.tuwien.ac.at).
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #define CONSTANT_POOL_BEFORE_FUNCTION 0
23 /* check whether load_fpu_reg or not */
24 #define LOAD_FPU_REG_P(x) ((x) >= AC0_REGNUM && (x) <= AC3_REGNUM)
25 #define NO_LOAD_FPU_REG_P(x) ((x) == AC4_REGNUM || (x) == AC5_REGNUM)
26 #define FPU_REG_P(x) (LOAD_FPU_REG_P(x) || NO_LOAD_FPU_REG_P(x))
27 #define CPU_REG_P(x) ((x) <= PC_REGNUM)
29 /* Names to predefine in the preprocessor for this target machine. */
31 #define TARGET_CPU_CPP_BUILTINS() \
34 builtin_define_std ("pdp11"); \
39 /* Generate DBX debugging information. */
41 #define DBX_DEBUGGING_INFO
43 #define TARGET_40_PLUS (TARGET_40 || TARGET_45)
44 #define TARGET_10 (! TARGET_40_PLUS)
46 #define TARGET_UNIX_ASM_DEFAULT 0
48 #define ASSEMBLER_DIALECT (TARGET_UNIX_ASM ? 1 : 0)
53 #define SHORT_TYPE_SIZE 16
54 #define INT_TYPE_SIZE (TARGET_INT16 ? 16 : 32)
55 #define LONG_TYPE_SIZE 32
56 #define LONG_LONG_TYPE_SIZE 64
58 /* if we set FLOAT_TYPE_SIZE to 32, we could have the benefit
59 of saving core for huge arrays - the definitions are
60 already in md - but floats can never reside in
61 an FPU register - we keep the FPU in double float mode
63 #define FLOAT_TYPE_SIZE (TARGET_FLOAT32 ? 32 : 64)
64 #define DOUBLE_TYPE_SIZE 64
65 #define LONG_DOUBLE_TYPE_SIZE 64
67 /* machine types from ansi */
68 #define SIZE_TYPE "unsigned int" /* definition of size_t */
69 #define WCHAR_TYPE "int" /* or long int???? */
70 #define WCHAR_TYPE_SIZE 16
72 #define PTRDIFF_TYPE "int"
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 #define BITS_BIG_ENDIAN 0
80 /* Define this if most significant byte of a word is the lowest numbered. */
81 #define BYTES_BIG_ENDIAN 0
83 /* Define this if most significant word of a multiword number is first. */
84 #define WORDS_BIG_ENDIAN 1
86 /* Define that floats are in VAX order, not high word first as for ints. */
87 #define FLOAT_WORDS_BIG_ENDIAN 0
89 /* Width of a word, in units (bytes).
91 UNITS OR BYTES - seems like units */
92 #define UNITS_PER_WORD 2
94 /* This machine doesn't use IEEE floats. */
95 /* Because the pdp11 (at least Unix) convention for 32-bit ints is
96 big endian, opposite for what you need for float, the vax float
97 conversion routines aren't actually used directly. But the underlying
98 format is indeed the vax/pdp11 float format. */
99 extern const struct real_format pdp11_f_format
;
100 extern const struct real_format pdp11_d_format
;
102 /* Maximum sized of reasonable data type
103 DImode or Dfmode ...*/
104 #define MAX_FIXED_MODE_SIZE 64
106 /* Allocation boundary (in *bits*) for storing pointers in memory. */
107 #define POINTER_BOUNDARY 16
109 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
110 #define PARM_BOUNDARY 16
112 /* Boundary (in *bits*) on which stack pointer should be aligned. */
113 #define STACK_BOUNDARY 16
115 /* Allocation boundary (in *bits*) for the code of a function. */
116 #define FUNCTION_BOUNDARY 16
118 /* Alignment of field after `int : 0' in a structure. */
119 #define EMPTY_FIELD_BOUNDARY 16
121 /* No data type wants to be aligned rounder than this. */
122 #define BIGGEST_ALIGNMENT 16
124 /* Define this if move instructions will actually fail to work
125 when given unaligned data. */
126 #define STRICT_ALIGNMENT 1
128 /* Standard register usage. */
130 /* Number of actual hardware registers.
131 The hardware registers are assigned numbers for the compiler
132 from 0 to just below FIRST_PSEUDO_REGISTER.
133 All registers that the compiler knows about must be given numbers,
134 even those that are not normally considered general registers.
136 we have 8 integer registers, plus 6 float
137 (don't use scratch float !) */
139 /* 1 for registers that have pervasive standard uses
140 and are not available for the register allocator.
142 On the pdp, these are:
145 reg 5 = fp; not necessarily!
148 #define FIXED_REGISTERS \
149 {0, 0, 0, 0, 0, 0, 1, 1, \
150 0, 0, 0, 0, 0, 0, 1, 1 }
154 /* 1 for registers not available across function calls.
155 These must include the FIXED_REGISTERS and also any
156 registers that can be used without being saved.
157 The latter must include the registers where values are returned
158 and the register where structure-value addresses are passed.
159 Aside from that, you can include as many other registers as you like. */
161 /* don't know about fp */
162 #define CALL_USED_REGISTERS \
163 {1, 1, 0, 0, 0, 0, 1, 1, \
164 0, 0, 0, 0, 0, 0, 1, 1 }
167 /* Specify the registers used for certain standard purposes.
168 The values of these macros are register numbers. */
170 /* Register in which static-chain is passed to a function. */
171 /* ??? - i don't want to give up a reg for this! */
172 #define STATIC_CHAIN_REGNUM 4
174 /* Define the classes of registers for register constraints in the
175 machine description. Also define ranges of constants.
177 One of the classes must always be named ALL_REGS and include all hard regs.
178 If there is more than one class, another class must be named NO_REGS
179 and contain no registers.
181 The name GENERAL_REGS must be the name of a class (or an alias for
182 another name such as ALL_REGS). This is the class of registers
183 that is allowed by "g" or "r" in a register constraint.
184 Also, registers outside this class are allocated only when
185 instructions express preferences for them.
187 The classes must be numbered in nondecreasing order; that is,
188 a larger-numbered class must never be contained completely
189 in a smaller-numbered class.
191 For any two classes, it is very desirable that there be another
192 class that represents their union. */
194 /* The pdp has a couple of classes:
196 MUL_REGS are used for odd numbered regs, to use in 16-bit multiplication
197 (even numbered do 32-bit multiply)
198 LMUL_REGS long multiply registers (even numbered regs )
199 (don't need them, all 32-bit regs are even numbered!)
200 GENERAL_REGS is all cpu
201 LOAD_FPU_REGS is the first four cpu regs, they are easier to load
202 NO_LOAD_FPU_REGS is ac4 and ac5, currently - difficult to load them
203 FPU_REGS is all fpu regs
206 enum reg_class
{ NO_REGS
, MUL_REGS
, GENERAL_REGS
, LOAD_FPU_REGS
, NO_LOAD_FPU_REGS
, FPU_REGS
, ALL_REGS
, LIM_REG_CLASSES
};
208 #define N_REG_CLASSES (int) LIM_REG_CLASSES
210 /* have to allow this till cmpsi/tstsi are fixed in a better way !! */
211 #define TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P hook_bool_mode_true
213 /* Since GENERAL_REGS is the same class as ALL_REGS,
214 don't give it a different class number; just make it an alias. */
216 /* #define GENERAL_REGS ALL_REGS */
218 /* Give names of register classes as strings for dump file. */
220 #define REG_CLASS_NAMES {"NO_REGS", "MUL_REGS", "GENERAL_REGS", "LOAD_FPU_REGS", "NO_LOAD_FPU_REGS", "FPU_REGS", "ALL_REGS" }
222 /* Define which registers fit in which classes.
223 This is an initializer for a vector of HARD_REG_SET
224 of length N_REG_CLASSES. */
226 #define REG_CLASS_CONTENTS {{0}, {0x00aa}, {0xc0ff}, {0x0f00}, {0x3000}, {0x3f00}, {0xffff}}
228 /* The same information, inverted:
229 Return the class number of the smallest class containing
230 reg number REGNO. This could be a conditional expression
231 or could index an array. */
233 #define REGNO_REG_CLASS(REGNO) pdp11_regno_reg_class (REGNO)
235 /* The class value for index registers, and the one for base regs. */
236 #define INDEX_REG_CLASS GENERAL_REGS
237 #define BASE_REG_CLASS GENERAL_REGS
239 /* Hook for testing if memory is needed for moving between registers. */
240 #define SECONDARY_MEMORY_NEEDED(class1, class2, m) \
241 pdp11_secondary_memory_needed (class1, class2, m)
243 /* Return the maximum number of consecutive registers
244 needed to represent mode MODE in a register of class CLASS. */
245 #define CLASS_MAX_NREGS(CLASS, MODE) \
246 ((CLASS == GENERAL_REGS || CLASS == MUL_REGS)? \
247 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD): \
251 #define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
252 pdp11_cannot_change_mode_class (FROM, TO, CLASS)
254 /* Stack layout; function entry, exit and calling. */
256 /* Define this if pushing a word on the stack
257 makes the stack pointer a smaller address. */
258 #define STACK_GROWS_DOWNWARD 1
260 /* Define this to nonzero if the nominal address of the stack frame
261 is at the high-address end of the local variables;
262 that is, each additional local variable allocated
263 goes at a more negative offset in the frame.
265 #define FRAME_GROWS_DOWNWARD 1
267 /* Offset within stack frame to start allocating local variables at.
268 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
269 first local allocated. Otherwise, it is the offset to the BEGINNING
270 of the first local allocated. */
271 #define STARTING_FRAME_OFFSET 0
273 /* If we generate an insn to push BYTES bytes,
274 this says how many the stack pointer really advances by.
275 On the pdp11, the stack is on an even boundary */
276 #define PUSH_ROUNDING(BYTES) ((BYTES + 1) & ~1)
278 /* current_first_parm_offset stores the # of registers pushed on the
280 extern int current_first_parm_offset
;
282 /* Offset of first parameter from the argument pointer register value. */
283 #define FIRST_PARM_OFFSET(FNDECL) 0
285 /* Define how to find the value returned by a function.
286 VALTYPE is the data type of the value (as a tree).
287 If the precise function being called is known, FUNC is its FUNCTION_DECL;
288 otherwise, FUNC is 0. */
289 #define BASE_RETURN_VALUE_REG(MODE) \
290 (FLOAT_MODE_P (MODE) ? AC0_REGNUM : RETVAL_REGNUM)
292 /* 1 if N is a possible register number for function argument passing.
295 #define FUNCTION_ARG_REGNO_P(N) 0
297 /* Define a data type for recording info about an argument list
298 during the scan of that argument list. This data type should
299 hold all necessary information about the function itself
300 and about the args processed so far, enough to enable macros
301 such as FUNCTION_ARG to determine where the next arg should go.
305 #define CUMULATIVE_ARGS int
307 /* Initialize a variable CUM of type CUMULATIVE_ARGS
308 for a call to a function whose data type is FNTYPE.
309 For a library call, FNTYPE is 0.
311 ...., the offset normally starts at 0, but starts at 1 word
312 when the function gets a structure-value-address as an
313 invisible first argument. */
315 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \
318 /* Output assembler code to FILE to increment profiler label # LABELNO
319 for profiling a function entry. */
321 #define FUNCTION_PROFILER(FILE, LABELNO) \
324 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
325 the stack pointer does not matter. The value is tested only in
326 functions that have frame pointers.
327 No definition is equivalent to always zero. */
329 extern int may_call_alloca
;
331 #define EXIT_IGNORE_STACK 1
333 /* Definitions for register eliminations.
335 This is an array of structures. Each structure initializes one pair
336 of eliminable registers. The "from" register number is given first,
337 followed by "to". Eliminations of the same "from" register are listed
338 in order of preference.
340 There are two registers that can always be eliminated on the pdp11.
341 The frame pointer and the arg pointer can be replaced by either the
342 hard frame pointer or to the stack pointer, depending upon the
343 circumstances. The hard frame pointer is not used before reload and
344 so it is not eligible for elimination. */
346 #define ELIMINABLE_REGS \
347 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
348 { ARG_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
349 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
350 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}} \
352 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
353 ((OFFSET) = pdp11_initial_elimination_offset ((FROM), (TO)))
356 /* Addressing modes, and classification of registers for them. */
358 #define HAVE_POST_INCREMENT 1
360 #define HAVE_PRE_DECREMENT 1
362 /* Macros to check register numbers against specific register classes. */
364 /* These assume that REGNO is a hard or pseudo reg number.
365 They give nonzero only if REGNO is a hard reg of the suitable class
366 or a pseudo reg currently allocated to a suitable hard reg.
367 Since they use reg_renumber, they are safe only once reg_renumber
368 has been allocated, which happens in reginfo.c during register
371 #define REGNO_OK_FOR_BASE_P(REGNO) \
372 ((REGNO) <= PC_REGNUM || (unsigned) reg_renumber[REGNO] <= PC_REGNUM || \
373 (REGNO) == ARG_POINTER_REGNUM || (REGNO) == FRAME_POINTER_REGNUM)
375 #define REGNO_OK_FOR_INDEX_P(REGNO) REGNO_OK_FOR_BASE_P (REGNO)
377 /* Now macros that check whether X is a register and also,
378 strictly, whether it is in a specified class.
383 /* Maximum number of registers that can appear in a valid memory address. */
385 #define MAX_REGS_PER_ADDRESS 1
387 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
388 and check its validity for a certain class.
389 We have two alternate definitions for each of them.
390 The usual definition accepts all pseudo regs; the other rejects
391 them unless they have been allocated suitable hard regs.
392 The symbol REG_OK_STRICT causes the latter definition to be used.
394 Most source files want to accept pseudo regs in the hope that
395 they will get allocated to the class that the insn wants them to be in.
396 Source files for reload pass need to be strict.
397 After reload, it makes no difference, since pseudo regs have
398 been eliminated by then. */
400 #ifndef REG_OK_STRICT
402 /* Nonzero if X is a hard reg that can be used as an index
403 or if it is a pseudo reg. */
404 #define REG_OK_FOR_INDEX_P(X) (1)
405 /* Nonzero if X is a hard reg that can be used as a base reg
406 or if it is a pseudo reg. */
407 #define REG_OK_FOR_BASE_P(X) (1)
411 /* Nonzero if X is a hard reg that can be used as an index. */
412 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
413 /* Nonzero if X is a hard reg that can be used as a base reg. */
414 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
418 /* Specify the machine mode that this machine uses
419 for the index in the tablejump instruction. */
420 #define CASE_VECTOR_MODE HImode
422 /* Define this if a raw index is all that is needed for a
424 #define CASE_TAKES_INDEX_RAW
426 /* Define this as 1 if `char' should by default be signed; else as 0. */
427 #define DEFAULT_SIGNED_CHAR 1
429 /* Max number of bytes we can move from memory to memory
430 in one reasonably fast instruction.
435 /* Nonzero if access to memory by byte is slow and undesirable. -
437 #define SLOW_BYTE_ACCESS 0
439 /* Do not break .stabs pseudos into continuations. */
440 #define DBX_CONTIN_LENGTH 0
442 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
443 is done just by pretending it is already truncated. */
444 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
446 /* Give a comparison code (EQ, NE etc) and the first operand of a COMPARE,
447 return the mode to be used for the comparison. For floating-point, CCFPmode
450 #define SELECT_CC_MODE(OP,X,Y) \
451 (GET_MODE_CLASS(GET_MODE(X)) == MODE_FLOAT? CCFPmode : CCmode)
453 /* Specify the machine mode that pointers have.
454 After generation of rtl, the compiler makes no further distinction
455 between pointers and any other objects of this machine mode. */
458 /* A function address in a call instruction
459 is a word address (for indexing purposes)
460 so give the MEM rtx a word's mode. */
461 #define FUNCTION_MODE HImode
463 /* Define this if addresses of constant functions
464 shouldn't be put through pseudo regs where they can be cse'd.
465 Desirable on machines where ordinary constants are expensive
466 but a CALL with constant address is cheap. */
467 /* #define NO_FUNCTION_CSE */
470 /* Tell emit-rtl.c how to initialize special values on a per-function base. */
471 extern rtx cc0_reg_rtx
;
473 #define CC_STATUS_MDEP rtx
475 #define CC_STATUS_MDEP_INIT (cc_status.mdep = 0)
477 /* Tell final.c how to eliminate redundant test instructions. */
479 /* Here we define machine-dependent flags and fields in cc_status
480 (see `conditions.h'). */
482 #define CC_IN_FPU 04000
484 /* Do UPDATE_CC if EXP is a set, used in
487 floats only do compare correctly, else nullify ...
492 /* Store in cc_status the expressions
493 that the condition codes will describe
494 after execution of an instruction whose pattern is EXP.
495 Do not alter them if the instruction would not alter the cc's. */
497 #define NOTICE_UPDATE_CC(EXP, INSN) \
498 { if (GET_CODE (EXP) == SET) \
500 notice_update_cc_on_set(EXP, INSN); \
502 else if (GET_CODE (EXP) == PARALLEL \
503 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
505 notice_update_cc_on_set(XVECEXP (EXP, 0, 0), INSN); \
507 else if (GET_CODE (EXP) == CALL) \
508 { /* all bets are off */ CC_STATUS_INIT; } \
509 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
510 && cc_status.value2 \
511 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
513 printf ("here!\n"); \
514 cc_status.value2 = 0; \
518 /* Control the assembler format that we output. */
520 /* Output to assembler file text saying following lines
521 may contain character constants, extra white space, comments, etc. */
523 #define ASM_APP_ON ""
525 /* Output to assembler file text saying following lines
526 no longer contain unusual constructs. */
528 #define ASM_APP_OFF ""
530 /* Output before read-only data. */
532 #define TEXT_SECTION_ASM_OP "\t.text\n"
534 /* Output before writable data. */
536 #define DATA_SECTION_ASM_OP "\t.data\n"
538 /* How to refer to registers in assembler output.
539 This sequence is indexed by compiler's hard-register-number (see above). */
541 #define REGISTER_NAMES \
542 {"r0", "r1", "r2", "r3", "r4", "r5", "sp", "pc", \
543 "ac0", "ac1", "ac2", "ac3", "ac4", "ac5", "fp", "ap" }
545 /* Globalizing directive for a label. */
546 #define GLOBAL_ASM_OP "\t.globl "
548 /* The prefix to add to user-visible assembler symbols. */
550 #define USER_LABEL_PREFIX "_"
552 /* This is how to store into the string LABEL
553 the symbol_ref name of an internal numbered label where
554 PREFIX is the class of label and NUM is the number within the class.
555 This is suitable for output with `assemble_name'. */
557 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
558 sprintf (LABEL, "*%s_%lu", PREFIX, (unsigned long)(NUM))
560 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
561 output_ascii (FILE, P, SIZE)
563 /* This is how to output an element of a case-vector that is absolute. */
565 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
566 fprintf (FILE, "\t%sL_%d\n", TARGET_UNIX_ASM ? "" : ".word ", VALUE)
568 /* This is how to output an element of a case-vector that is relative.
569 Don't define this if it is not supported. */
571 /* #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) */
573 /* This is how to output an assembler line
574 that says to advance the location counter
575 to a multiple of 2**LOG bytes.
580 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
586 fprintf (FILE, "\t.even\n"); \
589 gcc_unreachable (); \
592 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
593 fprintf (FILE, "\t.=.+ %#ho\n", (unsigned short)(SIZE))
595 /* This says how to output an assembler line
596 to define a global common symbol. */
598 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGN) \
599 pdp11_asm_output_var (FILE, NAME, SIZE, ALIGN, true)
602 /* This says how to output an assembler line
603 to define a local common symbol. */
605 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGN) \
606 pdp11_asm_output_var (FILE, NAME, SIZE, ALIGN, false)
608 /* Print a memory address as an operand to reference that memory location. */
610 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
611 print_operand_address (FILE, ADDR)
613 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
615 fprintf (FILE, "\tmov %s, -(sp)\n", reg_names[REGNO]) \
618 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
620 fprintf (FILE, "\tmov (sp)+, %s\n", reg_names[REGNO]) \
623 #define TRAMPOLINE_SIZE 8
624 #define TRAMPOLINE_ALIGNMENT 16
626 /* there is no point in avoiding branches on a pdp,
627 since branches are really cheap - I just want to find out
628 how much difference the BRANCH_COST macro makes in code */
629 #define BRANCH_COST(speed_p, predictable_p) pdp11_branch_cost ()
631 #define COMPARE_FLAG_MODE HImode
633 #define TARGET_HAVE_NAMED_SECTIONS false
635 /* pdp11-unknown-aout target has no support of C99 runtime */
636 #undef TARGET_LIBC_HAS_FUNCTION
637 #define TARGET_LIBC_HAS_FUNCTION no_c99_libc_has_function