]> git.ipfire.org Git - thirdparty/gcc.git/blob - gcc/config/pdp11/pdp11.h
Turn HARD_REGNO_MODE_OK into a target hook
[thirdparty/gcc.git] / gcc / config / pdp11 / pdp11.h
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).
4
5 This file is part of GCC.
6
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)
10 any later version.
11
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.
16
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/>. */
20
21 #define CONSTANT_POOL_BEFORE_FUNCTION 0
22
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)
28
29 /* Names to predefine in the preprocessor for this target machine. */
30
31 #define TARGET_CPU_CPP_BUILTINS() \
32 do \
33 { \
34 builtin_define_std ("pdp11"); \
35 } \
36 while (0)
37
38
39 /* Generate DBX debugging information. */
40
41 #define DBX_DEBUGGING_INFO
42
43 #define TARGET_40_PLUS (TARGET_40 || TARGET_45)
44 #define TARGET_10 (! TARGET_40_PLUS)
45
46 #define TARGET_UNIX_ASM_DEFAULT 0
47
48 #define ASSEMBLER_DIALECT (TARGET_UNIX_ASM ? 1 : 0)
49
50 \f
51
52 /* TYPE SIZES */
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
57
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
62 all the time !! */
63 #define FLOAT_TYPE_SIZE (TARGET_FLOAT32 ? 32 : 64)
64 #define DOUBLE_TYPE_SIZE 64
65 #define LONG_DOUBLE_TYPE_SIZE 64
66
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
71
72 #define PTRDIFF_TYPE "int"
73
74 /* target machine storage layout */
75
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
79
80 /* Define this if most significant byte of a word is the lowest numbered. */
81 #define BYTES_BIG_ENDIAN 0
82
83 /* Define this if most significant word of a multiword number is first. */
84 #define WORDS_BIG_ENDIAN 1
85
86 /* Define that floats are in VAX order, not high word first as for ints. */
87 #define FLOAT_WORDS_BIG_ENDIAN 0
88
89 /* Width of a word, in units (bytes).
90
91 UNITS OR BYTES - seems like units */
92 #define UNITS_PER_WORD 2
93
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;
101
102 /* Maximum sized of reasonable data type
103 DImode or Dfmode ...*/
104 #define MAX_FIXED_MODE_SIZE 64
105
106 /* Allocation boundary (in *bits*) for storing pointers in memory. */
107 #define POINTER_BOUNDARY 16
108
109 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
110 #define PARM_BOUNDARY 16
111
112 /* Boundary (in *bits*) on which stack pointer should be aligned. */
113 #define STACK_BOUNDARY 16
114
115 /* Allocation boundary (in *bits*) for the code of a function. */
116 #define FUNCTION_BOUNDARY 16
117
118 /* Alignment of field after `int : 0' in a structure. */
119 #define EMPTY_FIELD_BOUNDARY 16
120
121 /* No data type wants to be aligned rounder than this. */
122 #define BIGGEST_ALIGNMENT 16
123
124 /* Define this if move instructions will actually fail to work
125 when given unaligned data. */
126 #define STRICT_ALIGNMENT 1
127 \f
128 /* Standard register usage. */
129
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.
135
136 we have 8 integer registers, plus 6 float
137 (don't use scratch float !) */
138
139 /* 1 for registers that have pervasive standard uses
140 and are not available for the register allocator.
141
142 On the pdp, these are:
143 Reg 7 = pc;
144 reg 6 = sp;
145 reg 5 = fp; not necessarily!
146 */
147
148 #define FIXED_REGISTERS \
149 {0, 0, 0, 0, 0, 0, 1, 1, \
150 0, 0, 0, 0, 0, 0, 1, 1 }
151
152
153
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. */
160
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 }
165
166
167 /* Return number of consecutive hard regs needed starting at reg REGNO
168 to hold something of mode MODE.
169 This is ordinarily the length in words of a value of mode MODE
170 but can be less for certain modes in special long registers.
171 */
172
173 #define HARD_REGNO_NREGS(REGNO, MODE) \
174 ((REGNO <= PC_REGNUM)? \
175 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD) \
176 :1)
177
178
179 /* Value is 1 if it is a good idea to tie two pseudo registers
180 when one has mode MODE1 and one has mode MODE2.
181 If TARGET_HARD_REGNO_MODE_OK could produce different values for MODE1
182 and MODE2, for any hard reg, then this must be 0 for correct output. */
183 #define MODES_TIEABLE_P(MODE1, MODE2) 0
184
185 /* Specify the registers used for certain standard purposes.
186 The values of these macros are register numbers. */
187
188 /* Register in which static-chain is passed to a function. */
189 /* ??? - i don't want to give up a reg for this! */
190 #define STATIC_CHAIN_REGNUM 4
191 \f
192 /* Define the classes of registers for register constraints in the
193 machine description. Also define ranges of constants.
194
195 One of the classes must always be named ALL_REGS and include all hard regs.
196 If there is more than one class, another class must be named NO_REGS
197 and contain no registers.
198
199 The name GENERAL_REGS must be the name of a class (or an alias for
200 another name such as ALL_REGS). This is the class of registers
201 that is allowed by "g" or "r" in a register constraint.
202 Also, registers outside this class are allocated only when
203 instructions express preferences for them.
204
205 The classes must be numbered in nondecreasing order; that is,
206 a larger-numbered class must never be contained completely
207 in a smaller-numbered class.
208
209 For any two classes, it is very desirable that there be another
210 class that represents their union. */
211
212 /* The pdp has a couple of classes:
213
214 MUL_REGS are used for odd numbered regs, to use in 16-bit multiplication
215 (even numbered do 32-bit multiply)
216 LMUL_REGS long multiply registers (even numbered regs )
217 (don't need them, all 32-bit regs are even numbered!)
218 GENERAL_REGS is all cpu
219 LOAD_FPU_REGS is the first four cpu regs, they are easier to load
220 NO_LOAD_FPU_REGS is ac4 and ac5, currently - difficult to load them
221 FPU_REGS is all fpu regs
222 */
223
224 enum reg_class { NO_REGS, MUL_REGS, GENERAL_REGS, LOAD_FPU_REGS, NO_LOAD_FPU_REGS, FPU_REGS, ALL_REGS, LIM_REG_CLASSES };
225
226 #define N_REG_CLASSES (int) LIM_REG_CLASSES
227
228 /* have to allow this till cmpsi/tstsi are fixed in a better way !! */
229 #define TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P hook_bool_mode_true
230
231 /* Since GENERAL_REGS is the same class as ALL_REGS,
232 don't give it a different class number; just make it an alias. */
233
234 /* #define GENERAL_REGS ALL_REGS */
235
236 /* Give names of register classes as strings for dump file. */
237
238 #define REG_CLASS_NAMES {"NO_REGS", "MUL_REGS", "GENERAL_REGS", "LOAD_FPU_REGS", "NO_LOAD_FPU_REGS", "FPU_REGS", "ALL_REGS" }
239
240 /* Define which registers fit in which classes.
241 This is an initializer for a vector of HARD_REG_SET
242 of length N_REG_CLASSES. */
243
244 #define REG_CLASS_CONTENTS {{0}, {0x00aa}, {0xc0ff}, {0x0f00}, {0x3000}, {0x3f00}, {0xffff}}
245
246 /* The same information, inverted:
247 Return the class number of the smallest class containing
248 reg number REGNO. This could be a conditional expression
249 or could index an array. */
250
251 #define REGNO_REG_CLASS(REGNO) pdp11_regno_reg_class (REGNO)
252
253 /* The class value for index registers, and the one for base regs. */
254 #define INDEX_REG_CLASS GENERAL_REGS
255 #define BASE_REG_CLASS GENERAL_REGS
256
257 /* Hook for testing if memory is needed for moving between registers. */
258 #define SECONDARY_MEMORY_NEEDED(class1, class2, m) \
259 pdp11_secondary_memory_needed (class1, class2, m)
260
261 /* Return the maximum number of consecutive registers
262 needed to represent mode MODE in a register of class CLASS. */
263 #define CLASS_MAX_NREGS(CLASS, MODE) \
264 ((CLASS == GENERAL_REGS || CLASS == MUL_REGS)? \
265 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD): \
266 1 \
267 )
268
269 #define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
270 pdp11_cannot_change_mode_class (FROM, TO, CLASS)
271 \f
272 /* Stack layout; function entry, exit and calling. */
273
274 /* Define this if pushing a word on the stack
275 makes the stack pointer a smaller address. */
276 #define STACK_GROWS_DOWNWARD 1
277
278 /* Define this to nonzero if the nominal address of the stack frame
279 is at the high-address end of the local variables;
280 that is, each additional local variable allocated
281 goes at a more negative offset in the frame.
282 */
283 #define FRAME_GROWS_DOWNWARD 1
284
285 /* Offset within stack frame to start allocating local variables at.
286 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
287 first local allocated. Otherwise, it is the offset to the BEGINNING
288 of the first local allocated. */
289 #define STARTING_FRAME_OFFSET 0
290
291 /* If we generate an insn to push BYTES bytes,
292 this says how many the stack pointer really advances by.
293 On the pdp11, the stack is on an even boundary */
294 #define PUSH_ROUNDING(BYTES) ((BYTES + 1) & ~1)
295
296 /* current_first_parm_offset stores the # of registers pushed on the
297 stack */
298 extern int current_first_parm_offset;
299
300 /* Offset of first parameter from the argument pointer register value. */
301 #define FIRST_PARM_OFFSET(FNDECL) 0
302
303 /* Define how to find the value returned by a function.
304 VALTYPE is the data type of the value (as a tree).
305 If the precise function being called is known, FUNC is its FUNCTION_DECL;
306 otherwise, FUNC is 0. */
307 #define BASE_RETURN_VALUE_REG(MODE) \
308 (FLOAT_MODE_P (MODE) ? AC0_REGNUM : RETVAL_REGNUM)
309
310 /* 1 if N is a possible register number for function argument passing.
311 - not used on pdp */
312
313 #define FUNCTION_ARG_REGNO_P(N) 0
314 \f
315 /* Define a data type for recording info about an argument list
316 during the scan of that argument list. This data type should
317 hold all necessary information about the function itself
318 and about the args processed so far, enough to enable macros
319 such as FUNCTION_ARG to determine where the next arg should go.
320
321 */
322
323 #define CUMULATIVE_ARGS int
324
325 /* Initialize a variable CUM of type CUMULATIVE_ARGS
326 for a call to a function whose data type is FNTYPE.
327 For a library call, FNTYPE is 0.
328
329 ...., the offset normally starts at 0, but starts at 1 word
330 when the function gets a structure-value-address as an
331 invisible first argument. */
332
333 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \
334 ((CUM) = 0)
335
336 /* Output assembler code to FILE to increment profiler label # LABELNO
337 for profiling a function entry. */
338
339 #define FUNCTION_PROFILER(FILE, LABELNO) \
340 gcc_unreachable ();
341
342 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
343 the stack pointer does not matter. The value is tested only in
344 functions that have frame pointers.
345 No definition is equivalent to always zero. */
346
347 extern int may_call_alloca;
348
349 #define EXIT_IGNORE_STACK 1
350
351 /* Definitions for register eliminations.
352
353 This is an array of structures. Each structure initializes one pair
354 of eliminable registers. The "from" register number is given first,
355 followed by "to". Eliminations of the same "from" register are listed
356 in order of preference.
357
358 There are two registers that can always be eliminated on the pdp11.
359 The frame pointer and the arg pointer can be replaced by either the
360 hard frame pointer or to the stack pointer, depending upon the
361 circumstances. The hard frame pointer is not used before reload and
362 so it is not eligible for elimination. */
363
364 #define ELIMINABLE_REGS \
365 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
366 { ARG_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
367 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
368 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}} \
369
370 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
371 ((OFFSET) = pdp11_initial_elimination_offset ((FROM), (TO)))
372
373 \f
374 /* Addressing modes, and classification of registers for them. */
375
376 #define HAVE_POST_INCREMENT 1
377
378 #define HAVE_PRE_DECREMENT 1
379
380 /* Macros to check register numbers against specific register classes. */
381
382 /* These assume that REGNO is a hard or pseudo reg number.
383 They give nonzero only if REGNO is a hard reg of the suitable class
384 or a pseudo reg currently allocated to a suitable hard reg.
385 Since they use reg_renumber, they are safe only once reg_renumber
386 has been allocated, which happens in reginfo.c during register
387 allocation. */
388
389 #define REGNO_OK_FOR_BASE_P(REGNO) \
390 ((REGNO) <= PC_REGNUM || (unsigned) reg_renumber[REGNO] <= PC_REGNUM || \
391 (REGNO) == ARG_POINTER_REGNUM || (REGNO) == FRAME_POINTER_REGNUM)
392
393 #define REGNO_OK_FOR_INDEX_P(REGNO) REGNO_OK_FOR_BASE_P (REGNO)
394
395 /* Now macros that check whether X is a register and also,
396 strictly, whether it is in a specified class.
397 */
398
399
400 \f
401 /* Maximum number of registers that can appear in a valid memory address. */
402
403 #define MAX_REGS_PER_ADDRESS 1
404
405 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
406 and check its validity for a certain class.
407 We have two alternate definitions for each of them.
408 The usual definition accepts all pseudo regs; the other rejects
409 them unless they have been allocated suitable hard regs.
410 The symbol REG_OK_STRICT causes the latter definition to be used.
411
412 Most source files want to accept pseudo regs in the hope that
413 they will get allocated to the class that the insn wants them to be in.
414 Source files for reload pass need to be strict.
415 After reload, it makes no difference, since pseudo regs have
416 been eliminated by then. */
417
418 #ifndef REG_OK_STRICT
419
420 /* Nonzero if X is a hard reg that can be used as an index
421 or if it is a pseudo reg. */
422 #define REG_OK_FOR_INDEX_P(X) (1)
423 /* Nonzero if X is a hard reg that can be used as a base reg
424 or if it is a pseudo reg. */
425 #define REG_OK_FOR_BASE_P(X) (1)
426
427 #else
428
429 /* Nonzero if X is a hard reg that can be used as an index. */
430 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
431 /* Nonzero if X is a hard reg that can be used as a base reg. */
432 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
433
434 #endif
435 \f
436 /* Specify the machine mode that this machine uses
437 for the index in the tablejump instruction. */
438 #define CASE_VECTOR_MODE HImode
439
440 /* Define this if a raw index is all that is needed for a
441 `tablejump' insn. */
442 #define CASE_TAKES_INDEX_RAW
443
444 /* Define this as 1 if `char' should by default be signed; else as 0. */
445 #define DEFAULT_SIGNED_CHAR 1
446
447 /* Max number of bytes we can move from memory to memory
448 in one reasonably fast instruction.
449 */
450
451 #define MOVE_MAX 2
452
453 /* Nonzero if access to memory by byte is slow and undesirable. -
454 */
455 #define SLOW_BYTE_ACCESS 0
456
457 /* Do not break .stabs pseudos into continuations. */
458 #define DBX_CONTIN_LENGTH 0
459
460 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
461 is done just by pretending it is already truncated. */
462 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
463
464 /* Give a comparison code (EQ, NE etc) and the first operand of a COMPARE,
465 return the mode to be used for the comparison. For floating-point, CCFPmode
466 should be used. */
467
468 #define SELECT_CC_MODE(OP,X,Y) \
469 (GET_MODE_CLASS(GET_MODE(X)) == MODE_FLOAT? CCFPmode : CCmode)
470
471 /* Specify the machine mode that pointers have.
472 After generation of rtl, the compiler makes no further distinction
473 between pointers and any other objects of this machine mode. */
474 #define Pmode HImode
475
476 /* A function address in a call instruction
477 is a word address (for indexing purposes)
478 so give the MEM rtx a word's mode. */
479 #define FUNCTION_MODE HImode
480
481 /* Define this if addresses of constant functions
482 shouldn't be put through pseudo regs where they can be cse'd.
483 Desirable on machines where ordinary constants are expensive
484 but a CALL with constant address is cheap. */
485 /* #define NO_FUNCTION_CSE */
486
487 \f
488 /* Tell emit-rtl.c how to initialize special values on a per-function base. */
489 extern rtx cc0_reg_rtx;
490
491 #define CC_STATUS_MDEP rtx
492
493 #define CC_STATUS_MDEP_INIT (cc_status.mdep = 0)
494 \f
495 /* Tell final.c how to eliminate redundant test instructions. */
496
497 /* Here we define machine-dependent flags and fields in cc_status
498 (see `conditions.h'). */
499
500 #define CC_IN_FPU 04000
501
502 /* Do UPDATE_CC if EXP is a set, used in
503 NOTICE_UPDATE_CC
504
505 floats only do compare correctly, else nullify ...
506
507 get cc0 out soon ...
508 */
509
510 /* Store in cc_status the expressions
511 that the condition codes will describe
512 after execution of an instruction whose pattern is EXP.
513 Do not alter them if the instruction would not alter the cc's. */
514
515 #define NOTICE_UPDATE_CC(EXP, INSN) \
516 { if (GET_CODE (EXP) == SET) \
517 { \
518 notice_update_cc_on_set(EXP, INSN); \
519 } \
520 else if (GET_CODE (EXP) == PARALLEL \
521 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
522 { \
523 notice_update_cc_on_set(XVECEXP (EXP, 0, 0), INSN); \
524 } \
525 else if (GET_CODE (EXP) == CALL) \
526 { /* all bets are off */ CC_STATUS_INIT; } \
527 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
528 && cc_status.value2 \
529 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
530 { \
531 printf ("here!\n"); \
532 cc_status.value2 = 0; \
533 } \
534 }
535 \f
536 /* Control the assembler format that we output. */
537
538 /* Output to assembler file text saying following lines
539 may contain character constants, extra white space, comments, etc. */
540
541 #define ASM_APP_ON ""
542
543 /* Output to assembler file text saying following lines
544 no longer contain unusual constructs. */
545
546 #define ASM_APP_OFF ""
547
548 /* Output before read-only data. */
549
550 #define TEXT_SECTION_ASM_OP "\t.text\n"
551
552 /* Output before writable data. */
553
554 #define DATA_SECTION_ASM_OP "\t.data\n"
555
556 /* How to refer to registers in assembler output.
557 This sequence is indexed by compiler's hard-register-number (see above). */
558
559 #define REGISTER_NAMES \
560 {"r0", "r1", "r2", "r3", "r4", "r5", "sp", "pc", \
561 "ac0", "ac1", "ac2", "ac3", "ac4", "ac5", "fp", "ap" }
562
563 /* Globalizing directive for a label. */
564 #define GLOBAL_ASM_OP "\t.globl "
565
566 /* The prefix to add to user-visible assembler symbols. */
567
568 #define USER_LABEL_PREFIX "_"
569
570 /* This is how to store into the string LABEL
571 the symbol_ref name of an internal numbered label where
572 PREFIX is the class of label and NUM is the number within the class.
573 This is suitable for output with `assemble_name'. */
574
575 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
576 sprintf (LABEL, "*%s_%lu", PREFIX, (unsigned long)(NUM))
577
578 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
579 output_ascii (FILE, P, SIZE)
580
581 /* This is how to output an element of a case-vector that is absolute. */
582
583 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
584 fprintf (FILE, "\t%sL_%d\n", TARGET_UNIX_ASM ? "" : ".word ", VALUE)
585
586 /* This is how to output an element of a case-vector that is relative.
587 Don't define this if it is not supported. */
588
589 /* #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) */
590
591 /* This is how to output an assembler line
592 that says to advance the location counter
593 to a multiple of 2**LOG bytes.
594
595 who needs this????
596 */
597
598 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
599 switch (LOG) \
600 { \
601 case 0: \
602 break; \
603 case 1: \
604 fprintf (FILE, "\t.even\n"); \
605 break; \
606 default: \
607 gcc_unreachable (); \
608 }
609
610 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
611 fprintf (FILE, "\t.=.+ %#ho\n", (unsigned short)(SIZE))
612
613 /* This says how to output an assembler line
614 to define a global common symbol. */
615
616 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGN) \
617 pdp11_asm_output_var (FILE, NAME, SIZE, ALIGN, true)
618
619
620 /* This says how to output an assembler line
621 to define a local common symbol. */
622
623 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGN) \
624 pdp11_asm_output_var (FILE, NAME, SIZE, ALIGN, false)
625
626 /* Print a memory address as an operand to reference that memory location. */
627
628 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
629 print_operand_address (FILE, ADDR)
630
631 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
632 ( \
633 fprintf (FILE, "\tmov %s, -(sp)\n", reg_names[REGNO]) \
634 )
635
636 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
637 ( \
638 fprintf (FILE, "\tmov (sp)+, %s\n", reg_names[REGNO]) \
639 )
640
641 #define TRAMPOLINE_SIZE 8
642 #define TRAMPOLINE_ALIGNMENT 16
643
644 /* there is no point in avoiding branches on a pdp,
645 since branches are really cheap - I just want to find out
646 how much difference the BRANCH_COST macro makes in code */
647 #define BRANCH_COST(speed_p, predictable_p) pdp11_branch_cost ()
648
649 #define COMPARE_FLAG_MODE HImode
650
651 #define TARGET_HAVE_NAMED_SECTIONS false
652
653 /* pdp11-unknown-aout target has no support of C99 runtime */
654 #undef TARGET_LIBC_HAS_FUNCTION
655 #define TARGET_LIBC_HAS_FUNCTION no_c99_libc_has_function