![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to m88k.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [GCC 2.x] / gcc / config|
Return to m88k.h CVS log | Up to [GCC 2.x] / gcc / config |
1.1 root 1: /* Definitions of target machine for GNU compiler.
2: Motorola m88100 in an 88open OCS/BCS environment.
3: Copyright (C) 1988, 1989, 1990, 1991 Free Software Foundation, Inc.
4: Contributed by Michael Tiemann ([email protected])
5: Enhanced by Michael Meissner ([email protected])
6: Currently supported by Tom Wood ([email protected])
7:
8: This file is part of GNU CC.
9:
10: GNU CC is free software; you can redistribute it and/or modify
11: it under the terms of the GNU General Public License as published by
12: the Free Software Foundation; either version 2, or (at your option)
13: any later version.
14:
15: GNU CC is distributed in the hope that it will be useful,
16: but WITHOUT ANY WARRANTY; without even the implied warranty of
17: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18: GNU General Public License for more details.
19:
20: You should have received a copy of the GNU General Public License
21: along with GNU CC; see the file COPYING. If not, write to
22: the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
23:
24: /* The m88100 port of GNU CC adheres to the various standards from 88open.
25: These documents are available by writing:
26:
27: 88open Consortium Ltd.
28: 100 Homeland Court, Suite 800
29: San Jose, CA 95112
30: (408) 436-6600
31:
32: In brief, the current standards are:
33:
34: Binary Compatibility Standard, Release 1.1A, May 1991
35: This provides for portability of application-level software at the
36: executable level for AT&T System V Release 3.2.
37:
38: Object Compatibility Standard, Release 1.1A, May 1991
39: This provides for portability of application-level software at the
40: object file and library level for C, Fortran, and Cobol, and again,
41: largely for SVR3.
42:
43: Under development are standards for AT&T System V Release 4, based on the
44: [generic] System V Application Binary Interface from AT&T. These include:
45:
46: System V Application Binary Interface, Motorola 88000 Processor Supplement
47: Another document from AT&T for SVR4 specific to the m88100.
48: Available from Prentice Hall.
49:
50: System V Application Binary Interface, Motorola 88000 Processor Supplement,
51: Release 1.1, Draft H, May 6, 1991
52: A proposed update to the AT&T document from 88open.
53:
54: System V ABI Implementation Guide for the M88000 Processor,
55: Release 1.0, January 1991
56: A companion ABI document from 88open. */
57:
58: /* Other m88k*.h files include this one and override certain items.
59: At present, these are m88kv3.h, m88kv4.h, m88kdgux.h, and m88kluna.h.
60: Additionally, m88kv4.h and m88kdgux.h include svr4.h first. All other
61: m88k targets except m88kluna.h are based on svr3.h. */
62:
63: /* Choose SVR3 as the default. */
64: #if !defined(DBX_DEBUGGING_INFO) && !defined(DWARF_DEBUGGING_INFO)
65: #include "svr3.h"
66: #endif
67:
68: /* External types used. */
69:
70: /* What instructions are needed to manufacture an integer constant. */
71: enum m88k_instruction {
72: m88k_zero,
73: m88k_or,
74: m88k_subu,
75: m88k_or_lo16,
76: m88k_or_lo8,
77: m88k_set,
78: m88k_oru_hi16,
79: m88k_oru_or
80: };
81:
82: /* External variables/functions defined in m88k.c. */
83:
84: extern char *m88k_pound_sign;
85: extern char *m88k_short_data;
1.1.1.4 ! root 86: extern char *m88k_version;
! 87: extern char m88k_volatile_code;
1.1 root 88:
89: extern int m88k_gp_threshold;
90: extern int m88k_prologue_done;
91: extern int m88k_function_number;
92: extern int m88k_fp_offset;
93: extern int m88k_stack_size;
94: extern int m88k_case_index;
1.1.1.4 ! root 95: extern int m88k_version_0300;
1.1 root 96:
97: extern struct rtx_def *m88k_compare_reg;
98: extern struct rtx_def *m88k_compare_op0;
99: extern struct rtx_def *m88k_compare_op1;
100:
1.1.1.2 root 101: extern enum attr_cpu m88k_cpu;
102:
1.1.1.4 ! root 103: extern int null_prologue ();
1.1 root 104: extern int integer_ok_for_set ();
105: extern int m88k_debugger_offset ();
106:
107: extern void emit_bcnd ();
108: extern void expand_block_move ();
109: extern void m88k_layout_frame ();
1.1.1.4 ! root 110: extern void m88k_expand_prologue ();
! 111: extern void m88k_begin_prologue ();
! 112: extern void m88k_end_prologue ();
! 113: extern void m88k_expand_epilogue ();
! 114: extern void m88k_begin_epilogue ();
! 115: extern void m88k_end_epilogue ();
1.1 root 116: extern void output_function_profiler ();
117: extern void output_function_block_profiler ();
118: extern void output_block_profiler ();
119: extern void output_file_start ();
120: extern void output_ascii ();
121: extern void output_label ();
122: extern void print_operand ();
123: extern void print_operand_address ();
124:
125: extern char *output_load_const_int ();
126: extern char *output_load_const_float ();
127: extern char *output_load_const_double ();
128: extern char *output_load_const_dimode ();
129: extern char *output_and ();
130: extern char *output_ior ();
131: extern char *output_xor ();
132: extern char *output_call ();
133:
134: extern struct rtx_def *emit_test ();
135: extern struct rtx_def *legitimize_address ();
136: extern struct rtx_def *legitimize_operand ();
137: extern struct rtx_def *m88k_function_arg ();
138: extern struct rtx_def *m88k_builtin_saveregs ();
139:
140: extern enum m88k_instruction classify_integer ();
141:
142: /* external variables defined elsewhere in the compiler */
143:
144: extern int target_flags; /* -m compiler switches */
145: extern int frame_pointer_needed; /* current function has a FP */
146: extern int current_function_pretend_args_size; /* args size without ... */
147: extern int flag_delayed_branch; /* -fdelayed-branch */
148: extern int flag_pic; /* -fpic */
149: extern char * reg_names[];
150:
151: /* Specify the default monitors. The meaning of these values can
152: be obtained by doing "grep MONITOR_GCC *m88k*". Generally, the
153: values downward from 0x8000 are tests that will soon go away.
154: values upward from 0x1 are generally useful tests that will remain. */
155:
156: #ifndef MONITOR_GCC
157: #define MONITOR_GCC 0
158: #endif
159:
160: /*** Controlling the Compilation Driver, `gcc' ***/
161:
162: /* Some machines may desire to change what optimizations are performed for
163: various optimization levels. This macro, if defined, is executed once
164: just after the optimization level is determined and before the remainder
165: of the command options have been parsed. Values set in this macro are
166: used as the default values for the other command line options.
167:
168: LEVEL is the optimization level specified; 2 if -O2 is specified,
169: 1 if -O is specified, and 0 if neither is specified. */
170:
171: /* This macro used to store 0 in flag_signed_bitfields.
172: Not only is that misuse of this macro; the whole idea is wrong.
173:
174: The GNU C dialect makes bitfields signed by default,
175: regardless of machine type. Making any machine inconsistent in this
176: regard is bad for portability.
177:
178: I chose to make bitfields signed by default because this is consistent
179: with the way ordinary variables are handled: `int' equals `signed int'.
180: If there is a good reason to prefer making bitfields unsigned by default,
181: it cannot have anything to do with the choice of machine.
182: If the reason is good enough, we should change the convention for all machines.
183:
184: -- rms, 20 July 1991. */
185:
186: #define OPTIMIZATION_OPTIONS(LEVEL) \
187: do { \
188: if (LEVEL) \
189: { \
190: flag_omit_frame_pointer = 1; \
191: } \
192: } while (0)
193:
1.1.1.4 ! root 194: /* If -m88100 is in effect, add -D__m88100__; similarly for -m88110.
! 195: Here, the CPU_DEFAULT is assumed to be -m88100. */
! 196: #undef CPP_SPEC
! 197: #define CPP_SPEC "%{!m88000:%{!m88100:%{m88110:-D__m88110__}}} \
! 198: %{!m88000:%{!m88110:-D__m88100__}}"
! 199:
1.1 root 200: /* LIB_SPEC, LINK_SPEC, and STARTFILE_SPEC defined in svr3.h.
201: ASM_SPEC, ASM_FINAL_SPEC, LIB_SPEC, LINK_SPEC, and STARTFILE_SPEC redefined
202: in svr4.h.
203: CPP_SPEC, ASM_SPEC, ASM_FINAL_SPEC, LIB_SPEC, LINK_SPEC, and
204: STARTFILE_SPEC redefined in m88kdgux.h. */
205:
206: /*** Run-time Target Specification ***/
207:
208: /* Names to predefine in the preprocessor for this target machine.
209: Redefined in m88kv3.h, m88kv4.h, m88kdgux.h, and m88kluna.h. */
210: #define CPP_PREDEFINES "-Dm88000 -Dm88k -Dunix -D__CLASSIFY_TYPE__=2"
211:
212: #define TARGET_VERSION fprintf (stderr, " (%s%s)", \
213: VERSION_INFO1, VERSION_INFO2)
214:
215: /* Print subsidiary information on the compiler version in use.
216: Redefined in m88kv4.h, and m88kluna.h. */
217: #define VERSION_INFO1 "88open OCS/BCS, "
1.1.1.4 ! root 218: #define VERSION_INFO2 "10/21/92"
1.1 root 219: #define VERSION_STRING version_string
1.1.1.4 ! root 220: #define TM_SCCS_ID "@(#)m88k.h 2.2.14.1 10/21/92 23:03:03"
1.1 root 221:
222: /* Run-time compilation parameters selecting different hardware subsets. */
223:
224: /* Macro to define tables used to set the flags.
225: This is a list in braces of pairs in braces,
226: each pair being { "NAME", VALUE }
227: where VALUE is the bits to set or minus the bits to clear.
228: An empty string NAME is used to identify the default VALUE. */
229:
230: #define MASK_88100 0x00000001 /* Target m88100 */
231: #define MASK_88110 0x00000002 /* Target m88110 */
232: #define MASK_OCS_DEBUG_INFO 0x00000004 /* Emit .tdesc info */
233: #define MASK_OCS_FRAME_POSITION 0x00000008 /* Debug frame = CFA, not r30 */
234: #define MASK_SVR4 0x00000010 /* Target is AT&T System V.4 */
235: #define MASK_NO_UNDERSCORES 0x00000040 /* Don't emit a leading `_' */
236: #define MASK_BIG_PIC 0x00000080 /* PIC with large got-rel's -fPIC */
237: #define MASK_TRAP_LARGE_SHIFT 0x00000100 /* Trap if shift not <= 31 */
238: #define MASK_HANDLE_LARGE_SHIFT 0x00000200 /* Handle shift count >= 32 */
239: #define MASK_CHECK_ZERO_DIV 0x00000400 /* Check for int div. by 0 */
240: #define MASK_USE_DIV 0x00000800 /* No signed div. checks */
241: #define MASK_IDENTIFY_REVISION 0x00001000 /* Emit ident, with GCC rev */
242: #define MASK_WARN_PASS_STRUCT 0x00002000 /* Warn about passed structs */
243: #define MASK_OPTIMIZE_ARG_AREA 0x00004000 /* Save stack space */
1.1.1.4 ! root 244: #define MASK_SERIALIZE_VOLATILE 0x00008000 /* Serialize volatile refs */
! 245: #define MASK_NO_SERIALIZE_VOLATILE 0x00010000 /* Don't serialize */
1.1 root 246:
247: #define MASK_88000 (MASK_88100 | MASK_88110)
248: #define MASK_EITHER_LARGE_SHIFT (MASK_TRAP_LARGE_SHIFT | \
249: MASK_HANDLE_LARGE_SHIFT)
1.1.1.4 ! root 250: #define MASK_SERIALIZE (MASK_SERIALIZE_VOLATILE | MASK_NO_SERIALIZE_VOLATILE)
1.1 root 251:
252: #define TARGET_88100 ((target_flags & MASK_88000) == MASK_88100)
253: #define TARGET_88110 ((target_flags & MASK_88000) == MASK_88110)
254: #define TARGET_88000 ((target_flags & MASK_88000) == MASK_88000)
255:
256: #define TARGET_OCS_DEBUG_INFO (target_flags & MASK_OCS_DEBUG_INFO)
257: #define TARGET_OCS_FRAME_POSITION (target_flags & MASK_OCS_FRAME_POSITION)
258: #define TARGET_SVR4 (target_flags & MASK_SVR4)
259: #define TARGET_NO_UNDERSCORES (target_flags & MASK_NO_UNDERSCORES)
260: #define TARGET_BIG_PIC (target_flags & MASK_BIG_PIC)
261: #define TARGET_TRAP_LARGE_SHIFT (target_flags & MASK_TRAP_LARGE_SHIFT)
262: #define TARGET_HANDLE_LARGE_SHIFT (target_flags & MASK_HANDLE_LARGE_SHIFT)
263: #define TARGET_CHECK_ZERO_DIV (target_flags & MASK_CHECK_ZERO_DIV)
264: #define TARGET_USE_DIV (target_flags & MASK_USE_DIV)
265: #define TARGET_IDENTIFY_REVISION (target_flags & MASK_IDENTIFY_REVISION)
266: #define TARGET_WARN_PASS_STRUCT (target_flags & MASK_WARN_PASS_STRUCT)
267: #define TARGET_OPTIMIZE_ARG_AREA (target_flags & MASK_OPTIMIZE_ARG_AREA)
1.1.1.4 ! root 268: #define TARGET_SERIALIZE_VOLATILE (target_flags & MASK_SERIALIZE_VOLATILE)
1.1 root 269:
270: #define TARGET_EITHER_LARGE_SHIFT (target_flags & MASK_EITHER_LARGE_SHIFT)
271:
272: /* Redefined in m88kv3.h,m88kv4.h, and m88kdgux.h. */
273: #define TARGET_DEFAULT (MASK_CHECK_ZERO_DIV)
274: #define CPU_DEFAULT MASK_88100
275:
276: #define TARGET_SWITCHES \
277: { \
278: { "88110", MASK_88110 }, \
279: { "88100", MASK_88100 }, \
280: { "88000", MASK_88000 }, \
281: { "ocs-debug-info", MASK_OCS_DEBUG_INFO }, \
282: { "no-ocs-debug-info", -MASK_OCS_DEBUG_INFO }, \
283: { "ocs-frame-position", MASK_OCS_FRAME_POSITION }, \
284: { "no-ocs-frame-position", -MASK_OCS_FRAME_POSITION }, \
285: { "svr4", MASK_SVR4 }, \
286: { "svr3", -MASK_SVR4 }, \
287: { "no-underscores", MASK_NO_UNDERSCORES }, \
288: { "big-pic", MASK_BIG_PIC }, \
289: { "trap-large-shift", MASK_TRAP_LARGE_SHIFT }, \
290: { "handle-large-shift", MASK_HANDLE_LARGE_SHIFT }, \
291: { "check-zero-division", MASK_CHECK_ZERO_DIV }, \
292: { "no-check-zero-division", -MASK_CHECK_ZERO_DIV }, \
293: { "use-div-instruction", MASK_USE_DIV }, \
294: { "identify-revision", MASK_IDENTIFY_REVISION }, \
295: { "warn-passed-structs", MASK_WARN_PASS_STRUCT }, \
296: { "optimize-arg-area", MASK_OPTIMIZE_ARG_AREA }, \
297: { "no-optimize-arg-area", -MASK_OPTIMIZE_ARG_AREA }, \
1.1.1.4 ! root 298: { "serialize-volatile", MASK_SERIALIZE_VOLATILE }, \
! 299: { "no-serialize-volatile", MASK_NO_SERIALIZE_VOLATILE }, \
1.1 root 300: SUBTARGET_SWITCHES \
301: /* Default switches */ \
302: { "", TARGET_DEFAULT }, \
303: }
304:
305: /* Redefined in m88kdgux.h. */
306: #define SUBTARGET_SWITCHES
307:
308: /* Macro to define table for command options with values. */
309:
1.1.1.4 ! root 310: #define TARGET_OPTIONS { { "short-data-", &m88k_short_data }, \
! 311: { "version-", &m88k_version } }
1.1 root 312:
313: /* Do any checking or such that is needed after processing the -m switches. */
314:
315: #define OVERRIDE_OPTIONS \
316: do { \
317: register int i; \
318: \
319: if ((target_flags & MASK_88000) == 0) \
320: target_flags |= CPU_DEFAULT; \
321: \
1.1.1.2 root 322: m88k_cpu = (TARGET_88000 ? CPU_M88000 \
323: : (TARGET_88100 ? CPU_M88100 : CPU_M88110)); \
324: \
1.1.1.4 ! root 325: if (! TARGET_88100 && (target_flags & MASK_SERIALIZE) == 0) \
! 326: target_flags |= MASK_SERIALIZE_VOLATILE; \
! 327: \
! 328: if ((target_flags & MASK_NO_SERIALIZE_VOLATILE) != 0) \
! 329: target_flags &= ~MASK_SERIALIZE_VOLATILE; \
! 330: \
1.1 root 331: if (TARGET_BIG_PIC) \
332: flag_pic = 2; \
333: \
334: if ((target_flags & MASK_EITHER_LARGE_SHIFT) == MASK_EITHER_LARGE_SHIFT) \
335: error ("-mtrap-large-shift and -mhandle-large-shift are incompatible");\
336: \
1.1.1.4 ! root 337: m88k_version_0300 = (m88k_version != 0 \
! 338: && strcmp (m88k_version, "03.00") >= 0); \
! 339: \
1.1 root 340: if (VERSION_0300_SYNTAX) \
341: { \
342: for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) \
343: reg_names[i]--; \
344: m88k_pound_sign = "#"; \
1.1.1.4 ! root 345: if (m88k_version == 0) \
! 346: m88k_version = "03.00"; \
! 347: else if (strcmp (m88k_version, "03.00") < 0) \
! 348: error ("Specified assembler version (%s) is less that 03.00", \
! 349: m88k_version); \
1.1 root 350: } \
351: \
1.1.1.4 ! root 352: m88k_version_0300 = (m88k_version != 0 \
! 353: && strcmp (m88k_version, "03.00") >= 0); \
! 354: \
1.1 root 355: if (m88k_short_data) \
356: { \
357: char *p = m88k_short_data; \
358: while (*p) \
359: if (*p >= '0' && *p <= '9') \
360: p++; \
361: else \
362: { \
363: error ("Invalid option `-mshort-data-%s'", m88k_short_data); \
364: break; \
365: } \
366: m88k_gp_threshold = atoi (m88k_short_data); \
367: if (flag_pic) \
368: error ("-mshort-data-%s and PIC are incompatible", m88k_short_data); \
369: } \
370: } while (0)
371:
372: /*** Storage Layout ***/
373:
374: /* Sizes in bits of the various types. */
375: #define CHAR_TYPE_SIZE 8
376: #define SHORT_TYPE_SIZE 16
377: #define INT_TYPE_SIZE 32
378: #define LONG_TYPE_SIZE 32
379: #define LONG_LONG_TYPE_SIZE 64
380: #define FLOAT_TYPE_SIZE 32
381: #define DOUBLE_TYPE_SIZE 64
382: #define LONG_DOUBLE_TYPE_SIZE 64
383:
384: /* Define this if most significant bit is lowest numbered
385: in instructions that operate on numbered bit-fields.
386: Somewhat arbitrary. It matches the bit field patterns. */
387: #define BITS_BIG_ENDIAN 1
388:
389: /* Define this if most significant byte of a word is the lowest numbered.
390: That is true on the m88000. */
391: #define BYTES_BIG_ENDIAN 1
392:
393: /* Define this if most significant word of a multiword number is the lowest
394: numbered.
395: For the m88000 we can decide arbitrarily since there are no machine
396: instructions for them. */
397: #define WORDS_BIG_ENDIAN 1
398:
1.1.1.2 root 399: /* Number of bits in an addressable storage unit */
1.1 root 400: #define BITS_PER_UNIT 8
401:
402: /* Width in bits of a "word", which is the contents of a machine register.
403: Note that this is not necessarily the width of data type `int';
404: if using 16-bit ints on a 68000, this would still be 32.
405: But on a machine with 16-bit registers, this would be 16. */
406: #define BITS_PER_WORD 32
407:
408: /* Width of a word, in units (bytes). */
409: #define UNITS_PER_WORD 4
410:
411: /* Width in bits of a pointer.
412: See also the macro `Pmode' defined below. */
413: #define POINTER_SIZE 32
414:
415: /* Allocation boundary (in *bits*) for storing arguments in argument list. */
416: #define PARM_BOUNDARY 32
417:
418: /* Largest alignment for stack parameters (if greater than PARM_BOUNDARY). */
419: #define MAX_PARM_BOUNDARY 64
420:
421: /* Boundary (in *bits*) on which stack pointer should be aligned. */
422: #define STACK_BOUNDARY 128
423:
1.1.1.4 ! root 424: /* Allocation boundary (in *bits*) for the code of a function. On the
! 425: m88100, it is desirable to align to a cache line. However, SVR3 targets
! 426: only provided 8 byte alignment. The m88110 cache is small, so align
! 427: to an 8 byte boundary. Pack code tightly when compiling crtstuff.c. */
! 428: #define FUNCTION_BOUNDARY (flag_inhibit_size_directive ? 32 : \
! 429: (TARGET_88100 && TARGET_SVR4 ? 128 : 64))
1.1 root 430:
431: /* No data type wants to be aligned rounder than this. */
432: #define BIGGEST_ALIGNMENT 64
433:
1.1.1.4 ! root 434: /* The best alignment to use in cases where we have a choice. */
! 435: #define FASTEST_ALIGNMENT (TARGET_88100 ? 32 : 64)
! 436:
! 437: /* Make strings 4/8 byte aligned so strcpy from constants will be faster. */
1.1 root 438: #define CONSTANT_ALIGNMENT(EXP, ALIGN) \
1.1.1.4 ! root 439: ((TREE_CODE (EXP) == STRING_CST \
! 440: && (ALIGN) < FASTEST_ALIGNMENT) \
! 441: ? FASTEST_ALIGNMENT : (ALIGN))
1.1 root 442:
1.1.1.4 ! root 443: /* Make arrays of chars 4/8 byte aligned for the same reasons. */
1.1 root 444: #define DATA_ALIGNMENT(TYPE, ALIGN) \
445: (TREE_CODE (TYPE) == ARRAY_TYPE \
446: && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
1.1.1.4 ! root 447: && (ALIGN) < FASTEST_ALIGNMENT ? FASTEST_ALIGNMENT : (ALIGN))
1.1 root 448:
449: /* Alignment of field after `int : 0' in a structure.
450: Ignored with PCC_BITFIELD_TYPE_MATTERS. */
451: /* #define EMPTY_FIELD_BOUNDARY 8 */
452:
453: /* Every structure's size must be a multiple of this. */
454: #define STRUCTURE_SIZE_BOUNDARY 8
455:
1.1.1.2 root 456: /* Set this nonzero if move instructions will actually fail to work
1.1 root 457: when given unaligned data. */
1.1.1.2 root 458: #define STRICT_ALIGNMENT 1
1.1 root 459:
460: /* A bitfield declared as `int' forces `int' alignment for the struct. */
461: #define PCC_BITFIELD_TYPE_MATTERS 1
462:
463: /* Maximum size (in bits) to use for the largest integral type that
464: replaces a BLKmode type. */
465: /* #define MAX_FIXED_MODE_SIZE 0 */
466:
1.1.1.3 root 467: /* Check a `double' value for validity for a particular machine mode.
468: This is defined to avoid crashes outputting certain constants.
469: Since we output the number in hex, the assembler won't choke on it. */
470: /* #define CHECK_FLOAT_VALUE(MODE,VALUE) */
1.1 root 471:
472: /* A code distinguishing the floating point format of the target machine. */
473: /* #define TARGET_FLOAT_FORMAT IEEE_FLOAT_FORMAT */
474:
475: /*** Register Usage ***/
476:
477: /* Number of actual hardware registers.
478: The hardware registers are assigned numbers for the compiler
479: from 0 to just below FIRST_PSEUDO_REGISTER.
480: All registers that the compiler knows about must be given numbers,
481: even those that are not normally considered general registers.
482:
1.1.1.3 root 483: The m88100 has a General Register File (GRF) of 32 32-bit registers.
484: The m88110 adds an Extended Register File (XRF) of 32 80-bit registers. */
485: #define FIRST_PSEUDO_REGISTER 64
486: #define FIRST_EXTENDED_REGISTER 32
487:
488: /* General notes on extended registers, their use and misuse.
489:
490: Possible good uses:
491:
492: spill area instead of memory.
493: -waste if only used once
494:
1.1.1.4 ! root 495: floating point calculations
1.1.1.3 root 496: -probably a waste unless we have run out of general purpose registers
497:
498: freeing up general purpose registers
499: -e.g. may be able to have more loop invariants if floating
500: point is moved into extended registers.
501:
502:
503: I've noticed wasteful moves into and out of extended registers; e.g. a load
504: into x21, then inside a loop a move into r24, then r24 used as input to
505: an fadd. Why not just load into r24 to begin with? Maybe the new cse.c
506: will address this. This wastes a move, but the load,store and move could
507: have been saved had extended registers been used throughout.
508: E.g. in the code following code, if z and xz are placed in extended
509: registers, there is no need to save preserve registers.
510:
511: long c=1,d=1,e=1,f=1,g=1,h=1,i=1,j=1,k;
512:
513: double z=0,xz=4.5;
514:
515: foo(a,b)
516: long a,b;
517: {
518: while (a < b)
519: {
520: k = b + c + d + e + f + g + h + a + i + j++;
521: z += xz;
522: a++;
523: }
524: printf("k= %d; z=%f;\n", k, z);
525: }
526:
527: I've found that it is possible to change the constraints (putting * before
528: the 'r' constraints int the fadd.ddd instruction) and get the entire
529: addition and store to go into extended registers. However, this also
530: forces simple addition and return of floating point arguments to a
531: function into extended registers. Not the correct solution.
532:
533: Found the following note in local-alloc.c which may explain why I can't
534: get both registers to be in extended registers since two are allocated in
535: local-alloc and one in global-alloc. Doesn't explain (I don't believe)
536: why an extended register is used instead of just using the preserve
537: register.
538:
539: from local-alloc.c:
540: We have provision to exempt registers, even when they are contained
541: within the block, that can be tied to others that are not contained in it.
542: This is so that global_alloc could process them both and tie them then.
543: But this is currently disabled since tying in global_alloc is not
544: yet implemented.
545:
1.1.1.4 ! root 546: The explanation of why the preserved register is not used is as follows,
! 547: I believe. The registers are being allocated in order. Tying is not
1.1.1.3 root 548: done so efficiently, so when it comes time to do the first allocation,
549: there are no registers left to use without spilling except extended
550: registers. Then when the next pseudo register needs a hard reg, there
551: are still no registers to be had for free, but this one must be a GRF
552: reg instead of an extended reg, so a preserve register is spilled. Thus
553: the move from extended to GRF is necessitated. I do not believe this can
554: be 'fixed' through the config/*m88k* files.
555:
556: gcc seems to sometimes make worse use of register allocation -- not counting
557: moves -- whenever extended registers are present. For example in the
558: whetstone, the simple for loop (slightly modified)
559: for(i = 1; i <= n1; i++)
560: {
561: x1 = (x1 + x2 + x3 - x4) * t;
562: x2 = (x1 + x2 - x3 + x4) * t;
563: x3 = (x1 - x2 + x3 + x4) * t;
564: x4 = (x1 + x2 + x3 + x4) * t;
565: }
566: in general loads the high bits of the addresses of x2-x4 and i into registers
567: outside the loop. Whenever extended registers are used, it loads all of
568: these inside the loop. My conjecture is that since the 88110 has so many
569: registers, and gcc makes no distinction at this point -- just that they are
570: not fixed, that in loop.c it believes it can expect a number of registers
571: to be available. Then it allocates 'too many' in local-alloc which causes
572: problems later. 'Too many' are allocated because a large portion of the
573: registers are extended registers and cannot be used for certain purposes
574: ( e.g. hold the address of a variable). When this loop is compiled on its
575: own, the problem does not occur. I don't know the solution yet, though it
576: is probably in the base sources. Possibly a different way to calculate
577: "threshold". */
578:
579: /* 1 for registers that have pervasive standard uses and are not available
580: for the register allocator. Registers r14-r25 and x22-x29 are expected
581: to be preserved across function calls.
1.1 root 582:
1.1.1.3 root 583: On the 88000, the standard uses of the General Register File (GRF) are:
1.1 root 584: Reg 0 = Pseudo argument pointer (hardware fixed to 0).
585: Reg 1 = Subroutine return pointer (hardware).
586: Reg 2-9 = Parameter registers (OCS).
587: Reg 10 = OCS reserved temporary.
588: Reg 11 = Static link if needed [OCS reserved temporary].
589: Reg 12 = Address of structure return (OCS).
590: Reg 13 = OCS reserved temporary.
591: Reg 14-25 = Preserved register set.
592: Reg 26-29 = Reserved by OCS and ABI.
593: Reg 30 = Frame pointer (Common use).
1.1.1.3 root 594: Reg 31 = Stack pointer.
595:
596: The following follows the current 88open UCS specification for the
597: Extended Register File (XRF):
598: Reg 32 = x0 Always equal to zero
1.1.1.4 ! root 599: Reg 33-53 = x1-x21 Temporary registers (Caller Save)
1.1.1.3 root 600: Reg 54-61 = x22-x29 Preserver registers (Callee Save)
601: Reg 62-63 = x30-x31 Reserved for future ABI use.
602:
603: Note: The current 88110 extended register mapping is subject to change.
604: The bias towards caller-save registers is based on the
605: presumption that memory traffic can potentially be reduced by
606: allowing the "caller" to save only that part of the register
607: which is actually being used. (i.e. don't do a st.x if a st.d
608: is sufficient). Also, in scientific code (a.k.a. Fortran), the
609: large number of variables defined in common blocks may require
610: that almost all registers be saved across calls anyway. */
1.1 root 611:
612: #define FIXED_REGISTERS \
1.1.1.3 root 613: {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \
614: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, \
615: 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \
616: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1}
1.1 root 617:
618: /* 1 for registers not available across function calls.
619: These must include the FIXED_REGISTERS and also any
620: registers that can be used without being saved.
621: The latter must include the registers where values are returned
622: and the register where structure-value addresses are passed.
623: Aside from that, you can include as many other registers as you like. */
624:
625: #define CALL_USED_REGISTERS \
626: {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, \
1.1.1.3 root 627: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, \
628: 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
629: 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1}
1.1 root 630:
631: /* Macro to conditionally modify fixed_regs/call_used_regs. */
632: #define CONDITIONAL_REGISTER_USAGE \
633: { \
1.1.1.3 root 634: if (! TARGET_88110) \
635: { \
636: register int i; \
637: for (i = FIRST_EXTENDED_REGISTER; i < FIRST_PSEUDO_REGISTER; i++) \
638: { \
639: fixed_regs[i] = 1; \
640: call_used_regs[i] = 1; \
641: } \
642: } \
1.1 root 643: if (flag_pic) \
1.1.1.3 root 644: { \
645: /* Current hack to deal with -fpic -O2 problems. */ \
646: fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
647: call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
648: global_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
649: } \
1.1 root 650: }
651:
652: /* These interfaces that don't apply to the m88000. */
653: /* OVERLAPPING_REGNO_P(REGNO) 0 */
654: /* INSN_CLOBBERS_REGNO_P(INSN, REGNO) 0 */
655: /* PRESERVE_DEATH_INFO_REGNO_P(REGNO) 0 */
656:
657: /* Return number of consecutive hard regs needed starting at reg REGNO
658: to hold something of mode MODE.
659: This is ordinarily the length in words of a value of mode MODE
660: but can be less for certain modes in special long registers.
661:
1.1.1.3 root 662: On the m88000, GRF registers hold 32-bits and XRF registers hold 80-bits.
663: An XRF register can hold any mode, but two GRF registers are required
664: for larger modes. */
665: #define HARD_REGNO_NREGS(REGNO, MODE) \
666: ((REGNO < FIRST_PSEUDO_REGISTER && REGNO >= FIRST_EXTENDED_REGISTER) \
667: ? 1 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
1.1 root 668:
669: /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
670:
671: For double integers, we never put the value into an odd register so that
672: the operators don't run into the situation where the high part of one of
1.1.1.3 root 673: the inputs is the low part of the result register. (It's ok if the output
674: registers are the same as the input registers.) The XRF registers can
675: hold all modes, but only DF and SF modes can be manipulated in these
676: registers. The compiler should be allowed to use these as a fast spill
677: area. */
678: #define HARD_REGNO_MODE_OK(REGNO, MODE) \
679: ((REGNO < FIRST_PSEUDO_REGISTER && REGNO >= FIRST_EXTENDED_REGISTER) \
680: ? TARGET_88110 \
681: : (((MODE) != DImode && (MODE) != DFmode && (MODE) != DCmode) \
682: || ((REGNO) & 1) == 0))
1.1 root 683:
684: /* Value is 1 if it is a good idea to tie two pseudo registers
685: when one has mode MODE1 and one has mode MODE2.
686: If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
687: for any hard reg, then this must be 0 for correct output. */
688: #define MODES_TIEABLE_P(MODE1, MODE2) \
689: (((MODE1) == DFmode || (MODE1) == DCmode || (MODE1) == DImode) \
690: == ((MODE2) == DFmode || (MODE2) == DCmode || (MODE2) == DImode))
691:
692: /* Specify the registers used for certain standard purposes.
693: The values of these macros are register numbers. */
694:
695: /* the m88000 pc isn't overloaded on a register that the compiler knows about. */
696: /* #define PC_REGNUM */
697:
698: /* Register to use for pushing function arguments. */
699: #define STACK_POINTER_REGNUM 31
700:
701: /* Base register for access to local variables of the function. */
702: #define FRAME_POINTER_REGNUM 30
703:
704: /* Base register for access to arguments of the function. */
705: #define ARG_POINTER_REGNUM 0
706:
707: /* Register used in cases where a temporary is known to be safe to use. */
708: #define TEMP_REGNUM 10
709:
710: /* Register in which static-chain is passed to a function. */
711: #define STATIC_CHAIN_REGNUM 11
712:
713: /* Register in which address to store a structure value
714: is passed to a function. */
715: #define STRUCT_VALUE_REGNUM 12
716:
717: /* Register to hold the addressing base for position independent
718: code access to data items. */
719: #define PIC_OFFSET_TABLE_REGNUM 25
720:
721: /* Order in which registers are preferred (most to least). Use temp
722: registers, then param registers top down. Preserve registers are
723: top down to maximize use of double memory ops for register save.
1.1.1.3 root 724: The 88open reserved registers (r26-r29 and x30-x31) may commonly be used
725: in most environments with the -fcall-used- or -fcall-saved- options. */
726: #define REG_ALLOC_ORDER \
727: { \
728: 13, 12, 11, 10, 29, 28, 27, 26, \
729: 62, 63, 9, 8, 7, 6, 5, 4, \
730: 3, 2, 1, 53, 52, 51, 50, 49, \
731: 48, 47, 46, 45, 44, 43, 42, 41, \
732: 40, 39, 38, 37, 36, 35, 34, 33, \
733: 25, 24, 23, 22, 21, 20, 19, 18, \
734: 17, 16, 15, 14, 61, 60, 59, 58, \
735: 57, 56, 55, 54, 30, 31, 0, 32}
736:
737: /* Order for leaf functions. */
738: #define REG_LEAF_ALLOC_ORDER \
739: { \
740: 9, 8, 7, 6, 13, 12, 11, 10, \
741: 29, 28, 27, 26, 62, 63, 5, 4, \
742: 3, 2, 0, 53, 52, 51, 50, 49, \
743: 48, 47, 46, 45, 44, 43, 42, 41, \
744: 40, 39, 38, 37, 36, 35, 34, 33, \
745: 25, 24, 23, 22, 21, 20, 19, 18, \
746: 17, 16, 15, 14, 61, 60, 59, 58, \
747: 57, 56, 55, 54, 30, 31, 1, 32}
748:
749: /* Switch between the leaf and non-leaf orderings. The purpose is to avoid
750: write-over scoreboard delays between caller and callee. */
751: #define ORDER_REGS_FOR_LOCAL_ALLOC \
752: { \
753: static int leaf[] = REG_LEAF_ALLOC_ORDER; \
754: static int nonleaf[] = REG_ALLOC_ORDER; \
755: \
756: bcopy (regs_ever_live[1] ? nonleaf : leaf, reg_alloc_order, \
757: FIRST_PSEUDO_REGISTER * sizeof (int)); \
758: }
1.1 root 759:
760: /*** Register Classes ***/
761:
762: /* Define the classes of registers for register constraints in the
763: machine description. Also define ranges of constants.
764:
765: One of the classes must always be named ALL_REGS and include all hard regs.
766: If there is more than one class, another class must be named NO_REGS
767: and contain no registers.
768:
769: The name GENERAL_REGS must be the name of a class (or an alias for
770: another name such as ALL_REGS). This is the class of registers
771: that is allowed by "g" or "r" in a register constraint.
772: Also, registers outside this class are allocated only when
773: instructions express preferences for them.
774:
775: The classes must be numbered in nondecreasing order; that is,
776: a larger-numbered class must never be contained completely
777: in a smaller-numbered class.
778:
779: For any two classes, it is very desirable that there be another
780: class that represents their union. */
781:
1.1.1.3 root 782: /* The m88000 hardware has two kinds of registers. In addition, we denote
1.1 root 783: the arg pointer as a separate class. */
784:
1.1.1.3 root 785: enum reg_class { NO_REGS, AP_REG, XRF_REGS, GENERAL_REGS, AGRF_REGS,
786: XGRF_REGS, ALL_REGS, LIM_REG_CLASSES };
1.1 root 787:
788: #define N_REG_CLASSES (int) LIM_REG_CLASSES
789:
790: /* Give names of register classes as strings for dump file. */
1.1.1.3 root 791: #define REG_CLASS_NAMES {"NO_REGS", "AP_REG", "XRF_REGS", "GENERAL_REGS", \
792: "AGRF_REGS", "XGRF_REGS", "ALL_REGS" }
1.1 root 793:
794: /* Define which registers fit in which classes.
795: This is an initializer for a vector of HARD_REG_SET
796: of length N_REG_CLASSES. */
1.1.1.3 root 797: #define REG_CLASS_CONTENTS {{0x00000000, 0x00000000}, \
798: {0x00000001, 0x00000000}, \
799: {0x00000000, 0xffffffff}, \
800: {0xfffffffe, 0x00000000}, \
801: {0xffffffff, 0x00000000}, \
802: {0xfffffffe, 0xffffffff}, \
803: {0xffffffff, 0xffffffff}}
1.1 root 804:
805: /* The same information, inverted:
806: Return the class number of the smallest class containing
807: reg number REGNO. This could be a conditional expression
808: or could index an array. */
1.1.1.3 root 809: #define REGNO_REG_CLASS(REGNO) \
810: ((REGNO) ? ((REGNO < 32) ? GENERAL_REGS : XRF_REGS) : AP_REG)
1.1 root 811:
812: /* The class value for index registers, and the one for base regs. */
1.1.1.3 root 813: #define BASE_REG_CLASS AGRF_REGS
1.1 root 814: #define INDEX_REG_CLASS GENERAL_REGS
815:
1.1.1.3 root 816: /* Get reg_class from a letter such as appears in the machine description.
817: For the 88000, the following class/letter is defined for the XRF:
818: x - Extended register file */
819: #define REG_CLASS_FROM_LETTER(C) \
820: (((C) == 'x') ? XRF_REGS : NO_REGS)
1.1 root 821:
822: /* Macros to check register numbers against specific register classes.
823: These assume that REGNO is a hard or pseudo reg number.
824: They give nonzero only if REGNO is a hard reg of the suitable class
825: or a pseudo reg currently allocated to a suitable hard reg.
826: Since they use reg_renumber, they are safe only once reg_renumber
827: has been allocated, which happens in local-alloc.c. */
1.1.1.3 root 828: #define REGNO_OK_FOR_BASE_P(REGNO) \
829: ((REGNO) < FIRST_EXTENDED_REGISTER \
830: || (unsigned) reg_renumber[REGNO] < FIRST_EXTENDED_REGISTER)
831: #define REGNO_OK_FOR_INDEX_P(REGNO) \
832: (((REGNO) && (REGNO) < FIRST_EXTENDED_REGISTER) \
833: || (unsigned) reg_renumber[REGNO] < FIRST_EXTENDED_REGISTER)
1.1 root 834:
835: /* Given an rtx X being reloaded into a reg required to be
836: in class CLASS, return the class of reg to actually use.
837: In general this is just CLASS; but on some machines
838: in some cases it is preferable to use a more restrictive class.
839: Double constants should be in a register iff they can be made cheaply. */
1.1.1.3 root 840: #define PREFERRED_RELOAD_CLASS(X,CLASS) \
841: (CONSTANT_P(X) && (CLASS == XRF_REGS) ? NO_REGS : (CLASS))
1.1 root 842:
1.1.1.4 ! root 843: /* Return the register class of a scratch register needed to load IN
! 844: into a register of class CLASS in MODE. On the m88k, when PIC, we
! 845: need a temporary when loading some addresses into a register. */
! 846: #define SECONDARY_INPUT_RELOAD_CLASS(CLASS, MODE, IN) \
! 847: ((flag_pic \
! 848: && GET_CODE (IN) == CONST \
! 849: && GET_CODE (XEXP (IN, 0)) == PLUS \
! 850: && GET_CODE (XEXP (XEXP (IN, 0), 0)) == CONST_INT \
! 851: && ! SMALL_INT (XEXP (XEXP (IN, 0), 1))) ? GENERAL_REGS : NO_REGS)
! 852:
1.1 root 853: /* Return the maximum number of consecutive registers
854: needed to represent mode MODE in a register of class CLASS. */
1.1.1.3 root 855: #define CLASS_MAX_NREGS(CLASS, MODE) \
856: ((((CLASS) == XRF_REGS) ? 1 \
857: : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)))
1.1 root 858:
859: /* Letters in the range `I' through `P' in a register constraint string can
860: be used to stand for particular ranges of immediate operands. The C
861: expression is true iff C is a known letter and VALUE is appropriate for
862: that letter.
863:
1.1.1.2 root 864: For the m88000, the following constants are used:
1.1 root 865: `I' requires a non-negative 16-bit value.
866: `J' requires a non-positive 16-bit value.
867: `K' is unused.
868: `L' requires a constant with only the upper 16-bits set.
869: `M' requires constant values that can be formed with `set'.
870: `N' requires a negative value.
871: `O' requires zero.
872: `P' requires a non-negative value. */
873:
874: /* Quick tests for certain values. */
875: #define SMALL_INT(X) (SMALL_INTVAL (INTVAL (X)))
876: #define SMALL_INTVAL(I) ((unsigned) (I) < 0x10000)
877: #define ADD_INT(X) (ADD_INTVAL (INTVAL (X)))
878: #define ADD_INTVAL(I) ((unsigned) (I) + 0xffff < 0x1ffff)
879: #define POWER_OF_2(I) ((I) && POWER_OF_2_or_0(I))
880: #define POWER_OF_2_or_0(I) (((I) & ((unsigned)(I) - 1)) == 0)
881:
882: #define CONST_OK_FOR_LETTER_P(VALUE, C) \
883: ((C) == 'I' ? SMALL_INTVAL (VALUE) \
884: : (C) == 'J' ? SMALL_INTVAL (-(VALUE)) \
885: : (C) == 'L' ? ((VALUE) & 0xffff) == 0 \
886: : (C) == 'M' ? integer_ok_for_set (VALUE) \
887: : (C) == 'N' ? (VALUE) < 0 \
888: : (C) == 'O' ? (VALUE) == 0 \
889: : (C) == 'P' ? (VALUE) >= 0 \
890: : 0)
891:
892: /* Similar, but for floating constants, and defining letters G and H.
893: Here VALUE is the CONST_DOUBLE rtx itself. For the m88000, the
894: constraints are: `G' requires zero, and `H' requires one or two. */
895: #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
896: ((C) == 'G' ? (CONST_DOUBLE_HIGH (VALUE) == 0 \
897: && CONST_DOUBLE_LOW (VALUE) == 0) \
898: : 0)
899:
900: /* Letters in the range `Q' through `U' in a register constraint string
901: may be defined in a machine-dependent fashion to stand for arbitrary
902: operand types.
903:
904: For the m88k, `Q' handles addresses in a call context. */
905:
906: #define EXTRA_CONSTRAINT(OP, C) \
907: ((C) == 'Q' ? symbolic_address_p (OP) : 0)
908:
909: /*** Describing Stack Layout ***/
910:
911: /* Define this if pushing a word on the stack moves the stack pointer
912: to a smaller address. */
913: #define STACK_GROWS_DOWNWARD
914:
915: /* Define this if the addresses of local variable slots are at negative
916: offsets from the frame pointer. */
917: /* #define FRAME_GROWS_DOWNWARD */
918:
919: /* Offset from the frame pointer to the first local variable slot to be
920: allocated. For the m88k, the debugger wants the return address (r1)
921: stored at location r30+4, and the previous frame pointer stored at
922: location r30. */
923: #define STARTING_FRAME_OFFSET 8
924:
925: /* If we generate an insn to push BYTES bytes, this says how many the
926: stack pointer really advances by. The m88k has no push instruction. */
927: /* #define PUSH_ROUNDING(BYTES) */
928:
929: /* If defined, the maximum amount of space required for outgoing arguments
930: will be computed and placed into the variable
931: `current_function_outgoing_args_size'. No space will be pushed
932: onto the stack for each call; instead, the function prologue should
933: increase the stack frame size by this amount. */
934: #define ACCUMULATE_OUTGOING_ARGS
935:
936: /* Offset from the stack pointer register to the first location at which
937: outgoing arguments are placed. Use the default value zero. */
938: /* #define STACK_POINTER_OFFSET 0 */
939:
940: /* Offset of first parameter from the argument pointer register value.
941: Using an argument pointer, this is 0 for the m88k. GCC knows
942: how to eliminate the argument pointer references if necessary. */
943: #define FIRST_PARM_OFFSET(FNDECL) 0
944:
945: /* Define this if functions should assume that stack space has been
946: allocated for arguments even when their values are passed in
947: registers.
948:
949: The value of this macro is the size, in bytes, of the area reserved for
950: arguments passed in registers.
951:
952: This space can either be allocated by the caller or be a part of the
953: machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE'
954: says which. */
955: #define REG_PARM_STACK_SPACE(FNDECL) 32
956:
957: /* Define this macro if REG_PARM_STACK_SPACE is defined but stack
958: parameters don't skip the area specified by REG_PARM_STACK_SPACE.
959: Normally, when a parameter is not passed in registers, it is placed on
960: the stack beyond the REG_PARM_STACK_SPACE area. Defining this macro
961: suppresses this behavior and causes the parameter to be passed on the
962: stack in its natural location. */
963: #define STACK_PARMS_IN_REG_PARM_AREA
964:
965: /* Define this if it is the responsibility of the caller to allocate the
966: area reserved for arguments passed in registers. If
967: `ACCUMULATE_OUTGOING_ARGS' is also defined, the only effect of this
968: macro is to determine whether the space is included in
969: `current_function_outgoing_args_size'. */
970: /* #define OUTGOING_REG_PARM_STACK_SPACE */
971:
972: /* Offset from the stack pointer register to an item dynamically allocated
973: on the stack, e.g., by `alloca'.
974:
975: The default value for this macro is `STACK_POINTER_OFFSET' plus the
976: length of the outgoing arguments. The default is correct for most
977: machines. See `function.c' for details. */
978: /* #define STACK_DYNAMIC_OFFSET(FUNDECL) ... */
979:
980: /* Value is the number of bytes of arguments automatically
981: popped when returning from a subroutine call.
982: FUNTYPE is the data type of the function (as a tree),
983: or for a library call it is an identifier node for the subroutine name.
984: SIZE is the number of bytes of arguments passed on the stack. */
985: #define RETURN_POPS_ARGS(FUNTYPE,SIZE) 0
986:
987: /* Define how to find the value returned by a function.
988: VALTYPE is the data type of the value (as a tree).
989: If the precise function being called is known, FUNC is its FUNCTION_DECL;
990: otherwise, FUNC is 0. */
991: #define FUNCTION_VALUE(VALTYPE, FUNC) \
992: gen_rtx (REG, \
993: TYPE_MODE (VALTYPE) == BLKmode ? SImode : TYPE_MODE (VALTYPE), \
994: 2)
995:
996: /* Define this if it differs from FUNCTION_VALUE. */
997: /* #define FUNCTION_OUTGOING_VALUE(VALTYPE, FUNC) ... */
998:
999: /* Disable the promotion of some structures and unions to registers. */
1000: #define RETURN_IN_MEMORY(TYPE) \
1001: ((TREE_CODE (TYPE) == RECORD_TYPE || TREE_CODE(TYPE) == UNION_TYPE) \
1002: && !(TYPE_MODE (TYPE) == SImode \
1003: || (TYPE_MODE (TYPE) == BLKmode \
1004: && TYPE_ALIGN (TYPE) == BITS_PER_WORD \
1005: && int_size_in_bytes (TYPE) == UNITS_PER_WORD)))
1006:
1007: /* Define how to find the value returned by a library function
1008: assuming the value has mode MODE. */
1009: #define LIBCALL_VALUE(MODE) gen_rtx (REG, MODE, 2)
1010:
1011: /* True if N is a possible register number for a function value
1012: as seen by the caller. */
1013: #define FUNCTION_VALUE_REGNO_P(N) ((N) == 2)
1014:
1015: /* Determine whether a function argument is passed in a register, and
1016: which register. See m88k.c. */
1017: #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
1018: m88k_function_arg (CUM, MODE, TYPE, NAMED)
1019:
1020: /* Define this if it differs from FUNCTION_ARG. */
1021: /* #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) ... */
1022:
1023: /* A C expression for the number of words, at the beginning of an
1024: argument, must be put in registers. The value must be zero for
1025: arguments that are passed entirely in registers or that are entirely
1026: pushed on the stack. */
1027: #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) (0)
1028:
1029: /* A C expression that indicates when an argument must be passed by
1030: reference. If nonzero for an argument, a copy of that argument is
1031: made in memory and a pointer to the argument is passed instead of the
1032: argument itself. The pointer is passed in whatever way is appropriate
1033: for passing a pointer to that type. */
1034: #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) (0)
1035:
1036: /* A C type for declaring a variable that is used as the first argument
1037: of `FUNCTION_ARG' and other related values. It suffices to count
1038: the number of words of argument so far. */
1039: #define CUMULATIVE_ARGS int
1040:
1041: /* Initialize a variable CUM of type CUMULATIVE_ARGS for a call to a
1042: function whose data type is FNTYPE. For a library call, FNTYPE is 0. */
1043: #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME) ((CUM) = 0)
1044:
1045: /* A C statement (sans semicolon) to update the summarizer variable
1046: CUM to advance past an argument in the argument list. The values
1047: MODE, TYPE and NAMED describe that argument. Once this is done,
1048: the variable CUM is suitable for analyzing the *following* argument
1049: with `FUNCTION_ARG', etc. (TYPE is null for libcalls where that
1050: information may not be available.) */
1051: #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
1052: do { \
1053: enum machine_mode __mode = (TYPE) ? TYPE_MODE (TYPE) : (MODE); \
1054: if ((CUM & 1) \
1055: && (__mode == DImode || __mode == DFmode \
1056: || ((TYPE) && TYPE_ALIGN (TYPE) > BITS_PER_WORD))) \
1057: CUM++; \
1058: CUM += (((__mode != BLKmode) \
1059: ? GET_MODE_SIZE (MODE) : int_size_in_bytes (TYPE)) \
1060: + 3) / 4; \
1061: } while (0)
1062:
1063: /* True if N is a possible register number for function argument passing.
1064: On the m88000, these are registers 2 through 9. */
1065: #define FUNCTION_ARG_REGNO_P(N) ((N) <= 9 && (N) >= 2)
1066:
1067: /* A C expression which determines whether, and in which direction,
1068: to pad out an argument with extra space. The value should be of
1069: type `enum direction': either `upward' to pad above the argument,
1070: `downward' to pad below, or `none' to inhibit padding.
1071:
1072: This macro does not control the *amount* of padding; that is always
1073: just enough to reach the next multiple of `FUNCTION_ARG_BOUNDARY'. */
1074: #define FUNCTION_ARG_PADDING(MODE, TYPE) \
1075: ((MODE) == BLKmode \
1076: || ((TYPE) && (TREE_CODE (TYPE) == RECORD_TYPE \
1077: || TREE_CODE (TYPE) == UNION_TYPE)) \
1078: ? upward : GET_MODE_BITSIZE (MODE) < PARM_BOUNDARY ? downward : none)
1079:
1080: /* If defined, a C expression that gives the alignment boundary, in bits,
1081: of an argument with the specified mode and type. If it is not defined,
1082: `PARM_BOUNDARY' is used for all arguments. */
1083: #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
1084: (((TYPE) ? TYPE_ALIGN (TYPE) : GET_MODE_SIZE (MODE)) <= PARM_BOUNDARY \
1085: ? PARM_BOUNDARY : 2 * PARM_BOUNDARY)
1086:
1087: /* Generate necessary RTL for __builtin_saveregs().
1088: ARGLIST is the argument list; see expr.c. */
1089: #define EXPAND_BUILTIN_SAVEREGS(ARGLIST) m88k_builtin_saveregs (ARGLIST)
1090:
1091: /* Generate the assembly code for function entry. */
1.1.1.4 ! root 1092: #define FUNCTION_PROLOGUE(FILE, SIZE) m88k_begin_prologue(FILE, SIZE)
! 1093:
! 1094: /* Perform special actions at the point where the prologue ends. */
! 1095: #define FUNCTION_END_PROLOGUE(FILE) m88k_end_prologue(FILE)
1.1 root 1096:
1097: /* Output assembler code to FILE to increment profiler label # LABELNO
1098: for profiling a function entry. Redefined in m88kv3.h, m88kv4.h and
1099: m88kdgux.h. */
1100: #define FUNCTION_PROFILER(FILE, LABELNO) \
1101: output_function_profiler (FILE, LABELNO, "mcount", 1)
1102:
1.1.1.4 ! root 1103: /* Maximum length in instructions of the code output by FUNCTION_PROFILER. */
! 1104: #define FUNCTION_PROFILER_LENGTH (5+3+1+5)
! 1105:
1.1 root 1106: /* Output assembler code to FILE to initialize basic-block profiling for
1107: the current module. LABELNO is unique to each instance. */
1108: #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
1109: output_function_block_profiler (FILE, LABELNO)
1110:
1.1.1.4 ! root 1111: /* Maximum length in instructions of the code output by
! 1112: FUNCTION_BLOCK_PROFILER. */
! 1113: #define FUNCTION_BLOCK_PROFILER_LENGTH (3+5+2+5)
! 1114:
1.1 root 1115: /* Output assembler code to FILE to increment the count associated with
1116: the basic block number BLOCKNO. */
1117: #define BLOCK_PROFILER(FILE, BLOCKNO) output_block_profiler (FILE, BLOCKNO)
1118:
1.1.1.4 ! root 1119: /* Maximum length in instructions of the code output by BLOCK_PROFILER. */
! 1120: #define BLOCK_PROFILER_LENGTH 4
! 1121:
1.1 root 1122: /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
1123: the stack pointer does not matter. The value is tested only in
1124: functions that have frame pointers.
1125: No definition is equivalent to always zero. */
1126: #define EXIT_IGNORE_STACK (1)
1127:
1128: /* Generate the assembly code for function exit. */
1.1.1.4 ! root 1129: #define FUNCTION_EPILOGUE(FILE, SIZE) m88k_end_epilogue(FILE, SIZE)
1.1 root 1130:
1.1.1.4 ! root 1131: /* Perform special actions at the point where the epilogue begins. */
! 1132: #define FUNCTION_BEGIN_EPILOGUE(FILE) m88k_begin_epilogue(FILE)
1.1 root 1133:
1134: /* Value should be nonzero if functions must have frame pointers.
1135: Zero means the frame pointer need not be set up (and parms
1136: may be accessed via the stack pointer) in functions that seem suitable.
1137: This is computed in `reload', in reload1.c. */
1138: #define FRAME_POINTER_REQUIRED \
1139: (frame_pointer_needed \
1140: || (write_symbols != NO_DEBUG && !TARGET_OCS_FRAME_POSITION))
1141:
1142: /* Definitions for register eliminations.
1143:
1144: We have two registers that can be eliminated on the m88k. First, the
1145: frame pointer register can often be eliminated in favor of the stack
1146: pointer register. Secondly, the argument pointer register can always be
1147: eliminated; it is replaced with either the stack or frame pointer. */
1148:
1149: /* This is an array of structures. Each structure initializes one pair
1150: of eliminable registers. The "from" register number is given first,
1151: followed by "to". Eliminations of the same "from" register are listed
1152: in order of preference. */
1153: #define ELIMINABLE_REGS \
1154: {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
1155: { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
1156: { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}}
1157:
1158: /* Given FROM and TO register numbers, say whether this elimination
1159: is allowed. */
1160: #define CAN_ELIMINATE(FROM, TO) \
1161: (!((FROM) == FRAME_POINTER_REGNUM && FRAME_POINTER_REQUIRED))
1162:
1163: /* Define the offset between two registers, one to be eliminated, and the other
1164: its replacement, at the start of a routine. */
1165: #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
1166: { m88k_layout_frame (); \
1167: if ((FROM) == FRAME_POINTER_REGNUM && (TO) == STACK_POINTER_REGNUM) \
1168: (OFFSET) = m88k_fp_offset; \
1169: else if ((FROM) == ARG_POINTER_REGNUM && (TO) == FRAME_POINTER_REGNUM) \
1170: (OFFSET) = m88k_stack_size - m88k_fp_offset; \
1171: else if ((FROM) == ARG_POINTER_REGNUM && (TO) == STACK_POINTER_REGNUM) \
1172: (OFFSET) = m88k_stack_size; \
1173: else \
1174: abort (); \
1175: }
1176:
1177: /*** Trampolines for Nested Functions ***/
1178:
1179: /* Output assembler code for a block containing the constant parts
1180: of a trampoline, leaving space for the variable parts.
1181:
1182: This block is placed on the stack and filled in. It is aligned
1183: 0 mod 128 and those portions that are executed are constant.
1184: This should work for instruction caches that have cache lines up
1185: to the aligned amount (128 is arbitrary), provided no other code
1186: producer is attempting to play the same game. This of course is
1187: in violation of any number of 88open standards. */
1188:
1189: #define TRAMPOLINE_TEMPLATE(FILE) \
1190: { \
1191: /* Save the return address (r1) in the static chain reg (r11). */ \
1192: fprintf (FILE, "\tor\t %s,%s,0\n", reg_names[11], reg_names[1]); \
1193: /* Locate this block; transfer to the next instruction. */ \
1194: fprintf (FILE, "\tbsr\t 1\n"); \
1195: /* Save r10; use it as the relative pointer; restore r1. */ \
1196: fprintf (FILE, "\tst\t %s,%s,24\n", reg_names[10], reg_names[1]); \
1197: fprintf (FILE, "\tor\t %s,%s,0\n", reg_names[10], reg_names[1]); \
1198: fprintf (FILE, "\tor\t %s,%s,0\n", reg_names[1], reg_names[11]); \
1199: /* Load the function's address and go there. */ \
1200: fprintf (FILE, "\tld\t %s,%s,32\n", reg_names[11], reg_names[10]); \
1201: fprintf (FILE, "\tjmp.n\t %s\n", reg_names[11]); \
1202: /* Restore r10 and load the static chain register. */ \
1203: fprintf (FILE, "\tld.d\t %s,%s,24\n", reg_names[10], reg_names[10]); \
1204: /* Storage: r10 save area, static chain, function address. */ \
1205: ASM_OUTPUT_INT (FILE, const0_rtx); \
1206: ASM_OUTPUT_INT (FILE, const0_rtx); \
1207: ASM_OUTPUT_INT (FILE, const0_rtx); \
1208: }
1209:
1210: /* Length in units of the trampoline for entering a nested function.
1211: This is really two components. The first 32 bytes are fixed and
1212: must be copied; the last 12 bytes are just storage that's filled
1213: in later. So for allocation purposes, it's 32+12 bytes, but for
1.1.1.2 root 1214: initialization purposes, it's 32 bytes. */
1.1 root 1215:
1216: #define TRAMPOLINE_SIZE (32+12)
1217:
1218: /* Alignment required for a trampoline. 128 is used to find the
1219: beginning of a line in the instruction cache and to allow for
1220: instruction cache lines of up to 128 bytes. */
1221:
1222: #define TRAMPOLINE_ALIGNMENT 128
1223:
1224: /* Emit RTL insns to initialize the variable parts of a trampoline.
1225: FNADDR is an RTX for the address of the function's pure code.
1226: CXT is an RTX for the static chain value for the function. */
1227:
1228: #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1229: { \
1230: emit_move_insn (gen_rtx (MEM, SImode, plus_constant (TRAMP, 40)), FNADDR); \
1231: emit_move_insn (gen_rtx (MEM, SImode, plus_constant (TRAMP, 36)), CXT); \
1232: }
1233:
1234: /*** Library Subroutine Names ***/
1235:
1236: /* Define this macro if GNU CC should generate calls to the System V
1237: (and ANSI C) library functions `memcpy' and `memset' rather than
1238: the BSD functions `bcopy' and `bzero'. */
1239: #define TARGET_MEM_FUNCTIONS
1240:
1241: /*** Addressing Modes ***/
1242:
1243: /* #define HAVE_POST_INCREMENT */
1244: /* #define HAVE_POST_DECREMENT */
1245:
1246: /* #define HAVE_PRE_DECREMENT */
1247: /* #define HAVE_PRE_INCREMENT */
1248:
1249: /* Recognize any constant value that is a valid address. */
1250: #define CONSTANT_ADDRESS_P(X) (CONSTANT_P (X))
1251:
1252: /* Maximum number of registers that can appear in a valid memory address. */
1253: #define MAX_REGS_PER_ADDRESS 2
1254:
1255: /* The condition for memory shift insns. */
1256: #define SCALED_ADDRESS_P(ADDR) \
1257: (GET_CODE (ADDR) == PLUS \
1258: && (GET_CODE (XEXP (ADDR, 0)) == MULT \
1259: || GET_CODE (XEXP (ADDR, 1)) == MULT))
1260:
1261: /* Can the reference to X be made short? */
1262: #define SHORT_ADDRESS_P(X,TEMP) \
1263: ((TEMP) = (GET_CODE (X) == CONST ? get_related_value (X) : X), \
1264: ((TEMP) && GET_CODE (TEMP) == SYMBOL_REF && SYMBOL_REF_FLAG (TEMP)))
1265:
1266: /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1267: that is a valid memory address for an instruction.
1268: The MODE argument is the machine mode for the MEM expression
1269: that wants to use this address.
1270:
1271: On the m88000, a legitimate address has the form REG, REG+REG,
1272: REG+SMALLINT, REG+(REG*modesize) (REG[REG]), or SMALLINT.
1273:
1274: The register elimination process should deal with the argument
1275: pointer and frame pointer changing to REG+SMALLINT. */
1276:
1277: #define LEGITIMATE_INDEX_P(X, MODE) \
1278: ((GET_CODE (X) == CONST_INT \
1279: && SMALL_INT (X)) \
1280: || (REG_P (X) \
1281: && REG_OK_FOR_INDEX_P (X)) \
1282: || (GET_CODE (X) == MULT \
1283: && REG_P (XEXP (X, 0)) \
1284: && REG_OK_FOR_INDEX_P (XEXP (X, 0)) \
1285: && GET_CODE (XEXP (X, 1)) == CONST_INT \
1286: && INTVAL (XEXP (X, 1)) == GET_MODE_SIZE (MODE)))
1287:
1288: #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1289: { \
1290: register rtx _x; \
1291: if (REG_P (X)) \
1292: { \
1293: if (REG_OK_FOR_BASE_P (X)) \
1294: goto ADDR; \
1295: } \
1296: else if (GET_CODE (X) == PLUS) \
1297: { \
1298: register rtx _x0 = XEXP (X, 0); \
1299: register rtx _x1 = XEXP (X, 1); \
1300: if ((flag_pic \
1301: && _x0 == pic_offset_table_rtx \
1302: && (flag_pic == 2 \
1303: ? REG_P (_x1) \
1304: : (GET_CODE (_x1) == SYMBOL_REF \
1305: || GET_CODE (_x1) == LABEL_REF))) \
1306: || (REG_P (_x0) \
1307: && (REG_OK_FOR_BASE_P (_x0) \
1308: && LEGITIMATE_INDEX_P (_x1, MODE))) \
1309: || (REG_P (_x1) \
1310: && (REG_OK_FOR_BASE_P (_x1) \
1311: && LEGITIMATE_INDEX_P (_x0, MODE)))) \
1312: goto ADDR; \
1313: } \
1314: else if (GET_CODE (X) == LO_SUM) \
1315: { \
1316: register rtx _x0 = XEXP (X, 0); \
1317: register rtx _x1 = XEXP (X, 1); \
1318: if (((REG_P (_x0) \
1319: && REG_OK_FOR_BASE_P (_x0)) \
1320: || (GET_CODE (_x0) == SUBREG \
1321: && REG_P (SUBREG_REG (_x0)) \
1322: && REG_OK_FOR_BASE_P (SUBREG_REG (_x0)))) \
1323: && CONSTANT_P (_x1)) \
1324: goto ADDR; \
1325: } \
1326: else if (GET_CODE (X) == CONST_INT \
1327: && SMALL_INT (X)) \
1328: goto ADDR; \
1329: else if (SHORT_ADDRESS_P (X, _x)) \
1330: goto ADDR; \
1331: }
1332:
1333: /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1334: and check its validity for a certain class.
1335: We have two alternate definitions for each of them.
1336: The usual definition accepts all pseudo regs; the other rejects
1337: them unless they have been allocated suitable hard regs.
1338: The symbol REG_OK_STRICT causes the latter definition to be used.
1339:
1340: Most source files want to accept pseudo regs in the hope that
1341: they will get allocated to the class that the insn wants them to be in.
1342: Source files for reload pass need to be strict.
1343: After reload, it makes no difference, since pseudo regs have
1344: been eliminated by then. */
1345:
1346: #ifndef REG_OK_STRICT
1347:
1348: /* Nonzero if X is a hard reg that can be used as an index
1349: or if it is a pseudo reg. Not the argument pointer. */
1350: #define REG_OK_FOR_INDEX_P(X) (X)
1351: /* Nonzero if X is a hard reg that can be used as a base reg
1352: or if it is a pseudo reg. */
1353: #define REG_OK_FOR_BASE_P(X) (1)
1354:
1355: #else
1356:
1357: /* Nonzero if X is a hard reg that can be used as an index. */
1358: #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1359: /* Nonzero if X is a hard reg that can be used as a base reg. */
1360: #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1361:
1362: #endif
1363:
1364: /* Try machine-dependent ways of modifying an illegitimate address
1365: to be legitimate. If we find one, return the new, valid address.
1366: This macro is used in only one place: `memory_address' in explow.c.
1367:
1368: OLDX is the address as it was before break_out_memory_refs was called.
1369: In some cases it is useful to look at this to decide what needs to be done.
1370:
1371: MODE and WIN are passed so that this macro can use
1372: GO_IF_LEGITIMATE_ADDRESS.
1373:
1374: It is always safe for this macro to do nothing. It exists to recognize
1375: opportunities to optimize the output. */
1376:
1377: /* On the m88000, change REG+N into REG+REG, and REG+(X*Y) into REG+REG. */
1378:
1379: #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) \
1380: { \
1381: if (GET_CODE (X) == PLUS && CONSTANT_ADDRESS_P (XEXP (X, 1))) \
1382: (X) = gen_rtx (PLUS, SImode, XEXP (X, 0), \
1383: copy_to_mode_reg (SImode, XEXP (X, 1))); \
1384: if (GET_CODE (X) == PLUS && CONSTANT_ADDRESS_P (XEXP (X, 0))) \
1385: (X) = gen_rtx (PLUS, SImode, XEXP (X, 1), \
1386: copy_to_mode_reg (SImode, XEXP (X, 0))); \
1387: if (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 0)) == MULT) \
1388: (X) = gen_rtx (PLUS, SImode, XEXP (X, 1), \
1389: force_operand (XEXP (X, 0), 0)); \
1390: if (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == MULT) \
1391: (X) = gen_rtx (PLUS, SImode, XEXP (X, 0), \
1392: force_operand (XEXP (X, 1), 0)); \
1393: if (GET_CODE (X) == SYMBOL_REF || GET_CODE (X) == CONST \
1394: || GET_CODE (X) == LABEL_REF) \
1.1.1.4 ! root 1395: (X) = legitimize_address (flag_pic, X, 0, 0); \
1.1 root 1396: if (memory_address_p (MODE, X)) \
1397: goto WIN; }
1398:
1399: /* Go to LABEL if ADDR (a legitimate address expression)
1400: has an effect that depends on the machine mode it is used for.
1401: On the the m88000 this is never true. */
1402:
1403: #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL)
1404:
1405: /* Nonzero if the constant value X is a legitimate general operand.
1406: It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1407: #define LEGITIMATE_CONSTANT_P(X) (1)
1408:
1409: /*** Condition Code Information ***/
1410:
1411: /* C code for a data type which is used for declaring the `mdep'
1412: component of `cc_status'. It defaults to `int'. */
1413: /* #define CC_STATUS_MDEP int */
1414:
1415: /* A C expression to initialize the `mdep' field to "empty". */
1416: /* #define CC_STATUS_MDEP_INIT (cc_status.mdep = 0) */
1417:
1418: /* Macro to zap the normal portions of CC_STATUS, but leave the
1419: machine dependent parts (ie, literal synthesis) alone. */
1420: /* #define CC_STATUS_INIT_NO_MDEP \
1421: (cc_status.flags = 0, cc_status.value1 = 0, cc_status.value2 = 0) */
1422:
1423: /* When using a register to hold the condition codes, the cc_status
1424: mechanism cannot be used. */
1425: #define NOTICE_UPDATE_CC(EXP, INSN) (0)
1426:
1427: /*** Miscellaneous Parameters ***/
1428:
1429: /* Define the codes that are matched by predicates in m88k.c. */
1430: #define PREDICATE_CODES \
1431: {"move_operand", {SUBREG, REG, CONST_INT, LO_SUM, MEM}}, \
1432: {"call_address_operand", {SUBREG, REG, SYMBOL_REF, LABEL_REF, CONST}}, \
1433: {"arith_operand", {SUBREG, REG, CONST_INT}}, \
1434: {"arith5_operand", {SUBREG, REG, CONST_INT}}, \
1435: {"arith32_operand", {SUBREG, REG, CONST_INT}}, \
1436: {"arith64_operand", {SUBREG, REG, CONST_INT}}, \
1437: {"int5_operand", {CONST_INT}}, \
1438: {"int32_operand", {CONST_INT}}, \
1439: {"add_operand", {SUBREG, REG, CONST_INT}}, \
1440: {"reg_or_bbx_mask_operand", {SUBREG, REG, CONST_INT}}, \
1441: {"real_or_0_operand", {SUBREG, REG, CONST_DOUBLE}}, \
1442: {"relop", {EQ, NE, LT, LE, GE, GT, LTU, LEU, GEU, GTU}}, \
1443: {"relop_no_unsigned", {EQ, NE, LT, LE, GE, GT}}, \
1444: {"equality_op", {EQ, NE}}, \
1445: {"pc_or_label_ref", {PC, LABEL_REF}},
1446:
1.1.1.3 root 1447: /* The case table contains either words or branch instructions. This says
1448: which. We always claim that the vector is PC-relative. It is position
1449: independent when -fpic is used. */
1450: #define CASE_VECTOR_INSNS (TARGET_88100 || flag_pic)
1451:
1.1 root 1452: /* An alias for a machine mode name. This is the machine mode that
1453: elements of a jump-table should have. */
1454: #define CASE_VECTOR_MODE SImode
1455:
1456: /* Define this macro if jump-tables should contain relative addresses. */
1457: #define CASE_VECTOR_PC_RELATIVE
1458:
1459: /* Define this if control falls through a `case' insn when the index
1460: value is out of range. This means the specified default-label is
1461: actually ignored by the `case' insn proper. */
1462: /* #define CASE_DROPS_THROUGH */
1463:
1.1.1.4 ! root 1464: /* Define this to be the smallest number of different values for which it
! 1465: is best to use a jump-table instead of a tree of conditional branches.
! 1466: The default is 4 for machines with a casesi instruction and 5 otherwise.
! 1467: The best 88110 number is around 7, though the exact number isn't yet
! 1468: known. A third alternative for the 88110 is to use a binary tree of
! 1469: bb1 instructions on bits 2/1/0 if the range is dense. This may not
! 1470: win very much though. */
! 1471: #define CASE_VALUES_THRESHOLD (TARGET_88100 ? 4 : 7)
! 1472:
1.1 root 1473: /* Specify the tree operation to be used to convert reals to integers. */
1474: #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
1475:
1476: /* This is the kind of divide that is easiest to do in the general case. */
1477: #define EASY_DIV_EXPR TRUNC_DIV_EXPR
1478:
1479: /* Define this as 1 if `char' should by default be signed; else as 0. */
1480: #define DEFAULT_SIGNED_CHAR 1
1481:
1482: /* The 88open ABI says size_t is unsigned int. */
1483: #define SIZE_TYPE "unsigned int"
1484:
1485: /* Allow and ignore #sccs directives */
1486: #define SCCS_DIRECTIVE
1487:
1.1.1.4 ! root 1488: /* Handle #pragma pack and sometimes #pragma weak. */
! 1489: #define HANDLE_SYSV_PRAGMA
1.1 root 1490:
1491: /* Tell when to handle #pragma weak. This is only done for V.4. */
1492: #define HANDLE_PRAGMA_WEAK TARGET_SVR4
1493:
1494: /* Max number of bytes we can move from memory to memory
1495: in one reasonably fast instruction. */
1.1.1.4 ! root 1496: #define MOVE_MAX 8
1.1 root 1497:
1498: /* Define if normal loads of shorter-than-word items from memory clears
1499: the rest of the bigs in the register. */
1500: #define BYTE_LOADS_ZERO_EXTEND
1501:
1502: /* Zero if access to memory by bytes is faster. */
1503: #define SLOW_BYTE_ACCESS 1
1504:
1505: /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1506: is done just by pretending it is already truncated. */
1507: #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1508:
1509: /* Define this if addresses of constant functions
1510: shouldn't be put through pseudo regs where they can be cse'd.
1511: Desirable on machines where ordinary constants are expensive
1512: but a CALL with constant address is cheap. */
1513: #define NO_FUNCTION_CSE
1514:
1515: /* Define this macro if an argument declared as `char' or
1516: `short' in a prototype should actually be passed as an
1517: `int'. In addition to avoiding errors in certain cases of
1518: mismatch, it also makes for better code on certain machines. */
1519: #define PROMOTE_PROTOTYPES
1520:
1521: /* Define this macro if a float function always returns float
1522: (even in traditional mode). Redefined in m88kluna.h. */
1523: #define TRADITIONAL_RETURN_FLOAT
1524:
1525: /* We assume that the store-condition-codes instructions store 0 for false
1526: and some other value for true. This is the value stored for true. */
1527: #define STORE_FLAG_VALUE -1
1528:
1529: /* Specify the machine mode that pointers have.
1530: After generation of rtl, the compiler makes no further distinction
1531: between pointers and any other objects of this machine mode. */
1532: #define Pmode SImode
1533:
1534: /* A function address in a call instruction
1535: is a word address (for indexing purposes)
1536: so give the MEM rtx word mode. */
1537: #define FUNCTION_MODE SImode
1538:
1.1.1.4 ! root 1539: /* A barrier will be aligned so account for the possible expansion.
! 1540: A volatile load may be preceeded by a serializing instruction.
! 1541: Account for profiling code output at NOTE_INSN_PROLOGUE_END.
! 1542: Account for block profiling code at basic block boundaries. */
! 1543: #define ADJUST_INSN_LENGTH(RTX, LENGTH) \
! 1544: if (GET_CODE (RTX) == BARRIER \
! 1545: || (TARGET_SERIALIZE_VOLATILE \
! 1546: && GET_CODE (RTX) == INSN \
! 1547: && GET_CODE (PATTERN (RTX)) == SET \
! 1548: && ((GET_CODE (SET_SRC (PATTERN (RTX))) == MEM \
! 1549: && MEM_VOLATILE_P (SET_SRC (PATTERN (RTX))))))) \
! 1550: LENGTH += 1; \
! 1551: else if (GET_CODE (RTX) == NOTE \
! 1552: && NOTE_LINE_NUMBER (RTX) == NOTE_INSN_PROLOGUE_END) \
! 1553: { \
! 1554: if (profile_block_flag) \
! 1555: LENGTH += FUNCTION_BLOCK_PROFILER_LENGTH; \
! 1556: if (profile_flag) \
! 1557: LENGTH += (FUNCTION_PROFILER_LENGTH + REG_PUSH_LENGTH \
! 1558: + REG_POP_LENGTH); \
! 1559: } \
! 1560: else if (profile_block_flag \
! 1561: && (GET_CODE (RTX) == CODE_LABEL \
! 1562: || GET_CODE (RTX) == JUMP_INSN \
! 1563: || (GET_CODE (RTX) == INSN \
! 1564: && GET_CODE (PATTERN (RTX)) == SEQUENCE \
! 1565: && GET_CODE (XVECEXP (PATTERN (RTX), 0, 0)) == JUMP_INSN)))\
! 1566: LENGTH += BLOCK_PROFILER_LENGTH;
! 1567:
! 1568: /* Track the state of the last volatile memory reference. Clear the
! 1569: state with CC_STATUS_INIT for now. */
! 1570: #define CC_STATUS_INIT m88k_volatile_code = '\0'
1.1.1.3 root 1571:
1.1 root 1572: /* Compute the cost of computing a constant rtl expression RTX
1573: whose rtx-code is CODE. The body of this macro is a portion
1574: of a switch statement. If the code is computed here,
1575: return it with a return statement. Otherwise, break from the switch.
1576:
1577: We assume that any 16 bit integer can easily be recreated, so we
1578: indicate 0 cost, in an attempt to get GCC not to optimize things
1579: like comparison against a constant.
1580:
1581: The cost of CONST_DOUBLE is zero (if it can be placed in an insn, it
1582: is as good as a register; since it can't be placed in any insn, it
1583: won't do anything in cse, but it will cause expand_binop to pass the
1584: constant to the define_expands). */
1.1.1.3 root 1585: #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
1.1 root 1586: case CONST_INT: \
1587: if (SMALL_INT (RTX)) \
1588: return 0; \
1589: else if (SMALL_INTVAL (- INTVAL (RTX))) \
1590: return 2; \
1591: else if (classify_integer (SImode, INTVAL (RTX)) != m88k_oru_or) \
1592: return 4; \
1593: return 7; \
1594: case HIGH: \
1595: return 2; \
1596: case CONST: \
1597: case LABEL_REF: \
1598: case SYMBOL_REF: \
1599: if (flag_pic) \
1600: return (flag_pic == 2) ? 11 : 8; \
1601: return 5; \
1602: case CONST_DOUBLE: \
1603: return 0;
1604:
1605: /* Provide the costs of an addressing mode that contains ADDR.
1.1.1.2 root 1606: If ADDR is not a valid address, its cost is irrelevant.
1.1 root 1607: REG+REG is made slightly more expensive because it might keep
1608: a register live for longer than we might like. */
1609: #define ADDRESS_COST(ADDR) \
1610: (GET_CODE (ADDR) == REG ? 1 : \
1611: GET_CODE (ADDR) == LO_SUM ? 1 : \
1612: GET_CODE (ADDR) == HIGH ? 2 : \
1613: GET_CODE (ADDR) == MULT ? 1 : \
1614: GET_CODE (ADDR) != PLUS ? 4 : \
1615: (REG_P (XEXP (ADDR, 0)) && REG_P (XEXP (ADDR, 1))) ? 2 : 1)
1616:
1617: /* Provide the costs of a rtl expression. This is in the body of a
1618: switch on CODE. */
1.1.1.3 root 1619: #define RTX_COSTS(X,CODE,OUTER_CODE) \
1.1 root 1620: case MEM: \
1621: return COSTS_N_INSNS (2); \
1622: case MULT: \
1623: return COSTS_N_INSNS (3); \
1624: case DIV: \
1625: case UDIV: \
1626: case MOD: \
1627: case UMOD: \
1628: return COSTS_N_INSNS (38);
1629:
1630: /* A C expressions returning the cost of moving data of MODE from a register
1631: to or from memory. This is more costly than between registers. */
1632: #define MEMORY_MOVE_COST(MODE) 4
1633:
1634: /* Provide the cost of a branch. Exact meaning under development. */
1635: #define BRANCH_COST (TARGET_88100 ? 1 : 2)
1636:
1.1.1.4 ! root 1637: /* A C statement (sans semicolon) to update the integer variable COST
! 1638: based on the relationship between INSN that is dependent on
! 1639: DEP_INSN through the dependence LINK. The default is to make no
! 1640: adjustment to COST. On the m88k, ignore the cost of anti- and
! 1641: output-dependencies. On the m88100, a store can issue two cycles
! 1642: before the value (not the address) has finished computing. */
! 1643: #define ADJUST_COST(INSN,LINK,DEP_INSN,COST) \
! 1644: do { \
! 1645: if (REG_NOTE_KIND (LINK) != 0) \
! 1646: (COST) = 0; /* Anti or output dependence. */ \
! 1647: else if (! TARGET_88100 \
! 1648: && recog_memoized (INSN) >= 0 \
! 1649: && get_attr_type (INSN) == TYPE_STORE \
! 1650: && SET_SRC (PATTERN (INSN)) == SET_DEST (PATTERN (DEP_INSN))) \
! 1651: (COST) -= 4; /* 88110 store reservation station. */ \
! 1652: } while (0)
! 1653:
1.1 root 1654: /* Define this to be nonzero if the character `$' should be allowed
1655: by default in identifier names. */
1656: #define DOLLARS_IN_IDENTIFIERS 1
1657:
1658: /* Do not break .stabs pseudos into continuations. */
1659: #define DBX_CONTIN_LENGTH 0
1660:
1661: /*** Output of Assembler Code ***/
1662:
1663: /* Control the assembler format that we output. */
1664:
1665: /* Which assembler syntax. Redefined in m88kdgux.h. */
1666: #define VERSION_0300_SYNTAX TARGET_SVR4
1667:
1668: /* Allow pseudo-ops to be overridden. Override these in svr[34].h. */
1669: #undef INT_ASM_OP
1670: #undef ASCII_DATA_ASM_OP
1671: #undef CONST_SECTION_ASM_OP
1672: #undef CTORS_SECTION_ASM_OP
1673: #undef DTORS_SECTION_ASM_OP
1674: #undef INIT_SECTION_ASM_OP
1675: #undef FINI_SECTION_ASM_OP
1676: #undef TYPE_ASM_OP
1677: #undef SIZE_ASM_OP
1.1.1.3 root 1678: #undef WEAK_ASM_OP
1679: #undef SET_ASM_OP
1680: #undef SKIP_ASM_OP
1681: #undef COMMON_ASM_OP
1.1.1.4 ! root 1682: #undef ALIGN_ASM_OP
! 1683: #undef IDENT_ASM_OP
1.1 root 1684:
1685: /* These are used in varasm.c as well. */
1.1.1.2 root 1686: #define TEXT_SECTION_ASM_OP "text"
1687: #define DATA_SECTION_ASM_OP "data"
1.1 root 1688:
1689: /* Other sections. */
1690: #define CONST_SECTION_ASM_OP (VERSION_0300_SYNTAX \
1.1.1.2 root 1691: ? "section\t .rodata,\"a\"" \
1692: : "section\t .rodata,\"x\"")
1.1 root 1693: #define TDESC_SECTION_ASM_OP (VERSION_0300_SYNTAX \
1.1.1.2 root 1694: ? "section\t .tdesc,\"a\"" \
1695: : "section\t .tdesc,\"x\"")
1.1 root 1696:
1697: /* These must be constant strings for crtstuff.c. */
1.1.1.2 root 1698: #define CTORS_SECTION_ASM_OP "section\t .ctors,\"d\""
1699: #define DTORS_SECTION_ASM_OP "section\t .dtors,\"d\""
1700: #define INIT_SECTION_ASM_OP "section\t .init,\"x\""
1701: #define FINI_SECTION_ASM_OP "section\t .fini,\"x\""
1.1 root 1702:
1703: /* These are pretty much common to all assemblers. */
1.1.1.2 root 1704: #define IDENT_ASM_OP "ident"
1705: #define FILE_ASM_OP "file"
1706: #define SECTION_ASM_OP "section"
1.1.1.3 root 1707: #define SET_ASM_OP "def"
1.1.1.2 root 1708: #define GLOBAL_ASM_OP "global"
1709: #define ALIGN_ASM_OP "align"
1710: #define SKIP_ASM_OP "zero"
1711: #define COMMON_ASM_OP "comm"
1.1.1.3 root 1712: #define BSS_ASM_OP "bss"
1.1.1.2 root 1713: #define FLOAT_ASM_OP "float"
1714: #define DOUBLE_ASM_OP "double"
1715: #define INT_ASM_OP "word"
1.1 root 1716: #define ASM_LONG INT_ASM_OP
1.1.1.2 root 1717: #define SHORT_ASM_OP "half"
1718: #define CHAR_ASM_OP "byte"
1719: #define ASCII_DATA_ASM_OP "string"
1.1 root 1720:
1721: /* These are particular to the global pool optimization. */
1.1.1.2 root 1722: #define SBSS_ASM_OP "sbss"
1723: #define SCOMM_ASM_OP "scomm"
1724: #define SDATA_SECTION_ASM_OP "sdata"
1.1 root 1725:
1726: /* These are specific to PIC. */
1.1.1.2 root 1727: #define TYPE_ASM_OP "type"
1728: #define SIZE_ASM_OP "size"
1729: #define WEAK_ASM_OP "weak"
1.1 root 1730: #ifndef AS_BUG_POUND_TYPE /* Faulty assemblers require @ rather than #. */
1731: #undef TYPE_OPERAND_FMT
1732: #define TYPE_OPERAND_FMT "#%s"
1733: #endif
1734:
1735: /* These are specific to version 03.00 assembler syntax. */
1.1.1.2 root 1736: #define INTERNAL_ASM_OP "local"
1737: #define VERSION_ASM_OP "version"
1738: #define UNALIGNED_SHORT_ASM_OP "uahalf"
1739: #define UNALIGNED_INT_ASM_OP "uaword"
1.1.1.3 root 1740: #define PUSHSECTION_ASM_OP "section"
1741: #define POPSECTION_ASM_OP "previous"
1.1 root 1742:
1743: /* Output any initial stuff to the assembly file. Always put out
1744: a file directive, even if not debugging.
1745:
1746: Immediately after putting out the file, put out a "sem.<value>"
1747: declaration. This should be harmless on other systems, and
1.1.1.2 root 1748: is used in DG/UX by the debuggers to supplement COFF. The
1.1 root 1749: fields in the integer value are as follows:
1750:
1751: Bits Value Meaning
1752: ---- ----- -------
1753: 0-1 0 No information about stack locations
1754: 1 Auto/param locations are based on r30
1755: 2 Auto/param locations are based on CFA
1756:
1757: 3-2 0 No information on dimension order
1758: 1 Array dims in sym table matches source language
1759: 2 Array dims in sym table is in reverse order
1760:
1761: 5-4 0 No information about the case of global names
1762: 1 Global names appear in the symbol table as in the source
1763: 2 Global names have been converted to lower case
1764: 3 Global names have been converted to upper case. */
1765:
1766: #ifdef SDB_DEBUGGING_INFO
1767: #define ASM_COFFSEM(FILE) \
1768: if (write_symbols == SDB_DEBUG) \
1769: { \
1770: fprintf (FILE, "\nsem.%x:\t\t; %s\n", \
1771: (((TARGET_OCS_FRAME_POSITION) ? 2 : 1) << 0) + (1 << 2) + (1 << 4),\
1772: (TARGET_OCS_FRAME_POSITION) \
1773: ? "frame is CFA, normal array dims, case unchanged" \
1774: : "frame is r30, normal array dims, case unchanged"); \
1775: }
1776: #else
1777: #define ASM_COFFSEM(FILE)
1778: #endif
1779:
1780: /* Output the first line of the assembly file. Redefined in m88kdgux.h. */
1781:
1782: #define ASM_FIRST_LINE(FILE) \
1783: do { \
1.1.1.4 ! root 1784: if (m88k_version) \
! 1785: fprintf (FILE, "\t%s\t \"%s\"\n", VERSION_ASM_OP, m88k_version); \
1.1 root 1786: } while (0)
1787:
1788: /* Override svr[34].h. */
1789: #undef ASM_FILE_START
1790: #define ASM_FILE_START(FILE) \
1791: output_file_start (FILE, f_options, sizeof f_options / sizeof f_options[0], \
1792: W_options, sizeof W_options / sizeof W_options[0])
1793:
1794: #undef ASM_FILE_END
1795:
1796: #define ASM_OUTPUT_SOURCE_FILENAME(FILE, NAME) \
1.1.1.2 root 1797: fprintf (FILE, "\t%s\t \"%s\"\n", FILE_ASM_OP, NAME)
1.1 root 1798:
1799: #ifdef SDB_DEBUGGING_INFO
1800: #define ASM_OUTPUT_SOURCE_LINE(FILE, LINE) \
1801: if (m88k_prologue_done) \
1802: fprintf (FILE, "\n\tln\t %d\t\t\t\t; Real source line %d\n",\
1803: LINE - sdb_begin_function_line, LINE)
1804: #endif
1805:
1806: /* Code to handle #ident directives. Override svr[34].h definition. */
1807: #undef ASM_OUTPUT_IDENT
1808: #ifdef DBX_DEBUGGING_INFO
1809: #define ASM_OUTPUT_IDENT(FILE, NAME)
1810: #else
1811: #define ASM_OUTPUT_IDENT(FILE, NAME) \
1.1.1.3 root 1812: output_ascii (FILE, IDENT_ASM_OP, 4000, NAME, strlen (NAME));
1.1 root 1813: #endif
1814:
1815: /* Output to assembler file text saying following lines
1816: may contain character constants, extra white space, comments, etc. */
1817: #define ASM_APP_ON ""
1818:
1819: /* Output to assembler file text saying following lines
1820: no longer contain unusual constructs. */
1821: #define ASM_APP_OFF ""
1822:
1823: /* Format the assembly opcode so that the arguments are all aligned.
1824: The maximum instruction size is 8 characters (fxxx.xxx), so a tab and a
1825: space will do to align the output. Abandon the output if a `%' is
1826: encountered. */
1827: #define ASM_OUTPUT_OPCODE(STREAM, PTR) \
1828: { \
1829: int ch; \
1830: char *orig_ptr; \
1831: \
1832: for (orig_ptr = (PTR); \
1833: (ch = *(PTR)) && ch != ' ' && ch != '\t' && ch != '\n' && ch != '%'; \
1834: (PTR)++) \
1835: putc (ch, STREAM); \
1836: \
1837: if (ch == ' ' && orig_ptr != (PTR) && (PTR) - orig_ptr < 8) \
1838: putc ('\t', STREAM); \
1839: }
1840:
1841: /* How to refer to registers in assembler output.
1842: This sequence is indexed by compiler's hard-register-number.
1843: Updated by OVERRIDE_OPTIONS to include the # for version 03.00 syntax. */
1844:
1845: #define REGISTER_NAMES \
1846: {"#r0"+1, "#r1"+1, "#r2"+1, "#r3"+1, "#r4"+1, "#r5"+1, "#r6"+1, "#r7"+1, \
1847: "#r8"+1, "#r9"+1, "#r10"+1,"#r11"+1,"#r12"+1,"#r13"+1,"#r14"+1,"#r15"+1,\
1848: "#r16"+1,"#r17"+1,"#r18"+1,"#r19"+1,"#r20"+1,"#r21"+1,"#r22"+1,"#r23"+1,\
1.1.1.3 root 1849: "#r24"+1,"#r25"+1,"#r26"+1,"#r27"+1,"#r28"+1,"#r29"+1,"#r30"+1,"#r31"+1,\
1850: "#x0"+1, "#x1"+1, "#x2"+1, "#x3"+1, "#x4"+1, "#x5"+1, "#x6"+1, "#x7"+1, \
1851: "#x8"+1, "#x9"+1, "#x10"+1,"#x11"+1,"#x12"+1,"#x13"+1,"#x14"+1,"#x15"+1,\
1852: "#x16"+1,"#x17"+1,"#x18"+1,"#x19"+1,"#x20"+1,"#x21"+1,"#x22"+1,"#x23"+1,\
1853: "#x24"+1,"#x25"+1,"#x26"+1,"#x27"+1,"#x28"+1,"#x29"+1,"#x30"+1,"#x31"+1}
1.1 root 1854:
1.1.1.4 ! root 1855: /* Define additional names for use in asm clobbers and asm declarations.
! 1856:
! 1857: We define the fake Condition Code register as an alias for reg 0 (which
! 1858: is our `condition code' register), so that condition codes can easily
! 1859: be clobbered by an asm. The carry bit in the PSR is now used. */
! 1860:
! 1861: #define ADDITIONAL_REGISTER_NAMES {"psr", 0, "cc", 0}
! 1862:
1.1 root 1863: /* How to renumber registers for dbx and gdb. */
1864: #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1865:
1866: /* Tell when to declare ASM names. Override svr4.h to provide this hook. */
1867: #undef DECLARE_ASM_NAME
1868: #define DECLARE_ASM_NAME TARGET_SVR4
1869:
1870: /* Write the extra assembler code needed to declare a function properly. */
1871: #undef ASM_DECLARE_FUNCTION_NAME
1872: #define ASM_DECLARE_FUNCTION_NAME(FILE, NAME, DECL) \
1873: do { \
1874: if (DECLARE_ASM_NAME) \
1875: { \
1.1.1.2 root 1876: fprintf (FILE, "\t%s\t ", TYPE_ASM_OP); \
1.1 root 1877: assemble_name (FILE, NAME); \
1878: putc (',', FILE); \
1879: fprintf (FILE, TYPE_OPERAND_FMT, "function"); \
1880: putc ('\n', FILE); \
1881: } \
1882: ASM_OUTPUT_LABEL(FILE, NAME); \
1883: } while (0)
1884:
1885: /* Write the extra assembler code needed to declare an object properly. */
1886: #undef ASM_DECLARE_OBJECT_NAME
1887: #define ASM_DECLARE_OBJECT_NAME(FILE, NAME, DECL) \
1888: do { \
1889: if (DECLARE_ASM_NAME) \
1890: { \
1.1.1.2 root 1891: fprintf (FILE, "\t%s\t ", TYPE_ASM_OP); \
1.1 root 1892: assemble_name (FILE, NAME); \
1893: putc (',', FILE); \
1894: fprintf (FILE, TYPE_OPERAND_FMT, "object"); \
1895: putc ('\n', FILE); \
1896: if (!flag_inhibit_size_directive) \
1897: { \
1.1.1.2 root 1898: fprintf (FILE, "\t%s\t ", SIZE_ASM_OP); \
1.1 root 1899: assemble_name (FILE, NAME); \
1900: fprintf (FILE, ",%d\n", int_size_in_bytes (TREE_TYPE (decl))); \
1901: } \
1902: } \
1903: ASM_OUTPUT_LABEL(FILE, NAME); \
1904: } while (0)
1905:
1906: /* This is how to declare the size of a function. */
1907: #undef ASM_DECLARE_FUNCTION_SIZE
1908: #define ASM_DECLARE_FUNCTION_SIZE(FILE, FNAME, DECL) \
1909: do { \
1910: if (DECLARE_ASM_NAME) \
1911: { \
1912: if (!flag_inhibit_size_directive) \
1913: { \
1914: char label[256]; \
1915: static int labelno; \
1916: labelno++; \
1917: ASM_GENERATE_INTERNAL_LABEL (label, "Lfe", labelno); \
1918: ASM_OUTPUT_INTERNAL_LABEL (FILE, "Lfe", labelno); \
1.1.1.2 root 1919: fprintf (FILE, "\t%s\t ", SIZE_ASM_OP); \
1.1 root 1920: assemble_name (FILE, (FNAME)); \
1921: fprintf (FILE, ",%s-", &label[1]); \
1922: assemble_name (FILE, (FNAME)); \
1923: putc ('\n', FILE); \
1924: } \
1925: } \
1926: } while (0)
1927:
1928: /* This is how to output the definition of a user-level label named NAME,
1929: such as the label on a static function or variable NAME. */
1930: #define ASM_OUTPUT_LABEL(FILE,NAME) \
1931: do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
1932:
1933: /* This is how to output a command to make the user-level label named NAME
1934: defined for reference from other files. */
1935: #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
1936: do { \
1.1.1.2 root 1937: fprintf (FILE, "\t%s\t ", GLOBAL_ASM_OP); \
1.1 root 1938: assemble_name (FILE, NAME); \
1939: putc ('\n', FILE); \
1940: } while (0)
1941:
1942: /* This is how to output a reference to a user-level label named NAME.
1943: Override svr[34].h. */
1944: #undef ASM_OUTPUT_LABELREF
1945: #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1946: { \
1947: if (! TARGET_NO_UNDERSCORES && ! VERSION_0300_SYNTAX) \
1948: fputc ('_', FILE); \
1949: fputs (NAME, FILE); \
1950: }
1951:
1952: /* This is how to output an internal numbered label where
1953: PREFIX is the class of label and NUM is the number within the class.
1954: For V.4, labels use `.' rather than `@'. */
1955:
1.1.1.3 root 1956: #undef ASM_OUTPUT_INTERNAL_LABEL
1.1 root 1957: #ifdef AS_BUG_DOT_LABELS /* The assembler requires a declaration of local. */
1958: #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1.1.1.2 root 1959: fprintf (FILE, VERSION_0300_SYNTAX ? ".%s%d:\n\t%s\t .%s%d\n" : "@%s%d:\n", \
1.1 root 1960: PREFIX, NUM, INTERNAL_ASM_OP, PREFIX, NUM)
1961: #else
1962: #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1963: fprintf (FILE, VERSION_0300_SYNTAX ? ".%s%d:\n" : "@%s%d:\n", PREFIX, NUM)
1964: #endif /* AS_BUG_DOT_LABELS */
1965:
1966: /* This is how to store into the string LABEL
1967: the symbol_ref name of an internal numbered label where
1968: PREFIX is the class of label and NUM is the number within the class.
1969: This is suitable for output with `assemble_name'. This must agree
1970: with ASM_OUTPUT_INTERNAL_LABEL above, except for being prefixed
1971: with an `*'. */
1972:
1.1.1.3 root 1973: #undef ASM_GENERATE_INTERNAL_LABEL
1.1 root 1974: #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1975: sprintf (LABEL, VERSION_0300_SYNTAX ? "*.%s%d" : "*@%s%d", PREFIX, NUM)
1976:
1977: /* Internal macro to get a single precision floating point value into
1978: an int, so we can print it's value in hex. */
1979: #define FLOAT_TO_INT_INTERNAL( FVALUE, IVALUE ) \
1980: { union { \
1981: REAL_VALUE_TYPE d; \
1982: struct { \
1983: unsigned sign : 1; \
1984: unsigned exponent1 : 1; \
1985: unsigned exponent2 : 3; \
1986: unsigned exponent3 : 7; \
1987: unsigned mantissa1 : 20; \
1988: unsigned mantissa2 : 3; \
1989: unsigned mantissa3 : 29; \
1990: } s; \
1991: } _u; \
1992: \
1993: union { \
1994: int i; \
1995: struct { \
1996: unsigned sign : 1; \
1997: unsigned exponent1 : 1; \
1998: unsigned exponent3 : 7; \
1999: unsigned mantissa1 : 20; \
2000: unsigned mantissa2 : 3; \
2001: } s; \
2002: } _u2; \
2003: \
2004: _u.d = REAL_VALUE_TRUNCATE (SFmode, FVALUE); \
2005: _u2.s.sign = _u.s.sign; \
2006: _u2.s.exponent1 = _u.s.exponent1; \
2007: _u2.s.exponent3 = _u.s.exponent3; \
2008: _u2.s.mantissa1 = _u.s.mantissa1; \
2009: _u2.s.mantissa2 = _u.s.mantissa2; \
2010: IVALUE = _u2.i; \
2011: }
2012:
2013: /* This is how to output an assembler line defining a `double' constant.
2014: Use "word" pseudos to avoid printing NaNs, infinity, etc. */
2015: #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
2016: do { \
2017: union { REAL_VALUE_TYPE d; long l[2]; } x; \
2018: x.d = (VALUE); \
1.1.1.2 root 2019: fprintf (FILE, "\t%s\t 0x%.8x, 0x%.8x\n", INT_ASM_OP, \
1.1 root 2020: x.l[0], x.l[1]); \
2021: } while (0)
2022:
2023: /* This is how to output an assembler line defining a `float' constant. */
2024: #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
2025: do { \
2026: int i; \
2027: FLOAT_TO_INT_INTERNAL (VALUE, i); \
1.1.1.2 root 2028: fprintf (FILE, "\t%s\t 0x%.8x\n", INT_ASM_OP, i); \
1.1 root 2029: } while (0)
2030:
2031: /* Likewise for `int', `short', and `char' constants. */
2032: #define ASM_OUTPUT_INT(FILE,VALUE) \
1.1.1.2 root 2033: ( fprintf (FILE, "\t%s\t ", INT_ASM_OP), \
1.1 root 2034: output_addr_const (FILE, (VALUE)), \
2035: fprintf (FILE, "\n"))
2036:
2037: #define ASM_OUTPUT_SHORT(FILE,VALUE) \
1.1.1.2 root 2038: ( fprintf (FILE, "\t%s\t ", SHORT_ASM_OP), \
1.1 root 2039: output_addr_const (FILE, (VALUE)), \
2040: fprintf (FILE, "\n"))
2041:
2042: #define ASM_OUTPUT_CHAR(FILE,VALUE) \
1.1.1.2 root 2043: ( fprintf (FILE, "\t%s\t ", CHAR_ASM_OP), \
1.1 root 2044: output_addr_const (FILE, (VALUE)), \
2045: fprintf (FILE, "\n"))
2046:
2047: /* This is how to output an assembler line for a numeric constant byte. */
2048: #define ASM_OUTPUT_BYTE(FILE,VALUE) \
1.1.1.2 root 2049: fprintf (FILE, "\t%s\t 0x%x\n", CHAR_ASM_OP, (VALUE))
1.1 root 2050:
1.1.1.3 root 2051: /* The single-byte pseudo-op is the default. Override svr[34].h. */
1.1 root 2052: #undef ASM_BYTE_OP
1.1.1.3 root 2053: #define ASM_BYTE_OP "byte"
1.1 root 2054: #undef ASM_OUTPUT_ASCII
2055: #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1.1.1.3 root 2056: output_ascii (FILE, ASCII_DATA_ASM_OP, 48, P, SIZE)
1.1 root 2057:
1.1.1.4 ! root 2058: /* Override svr4.h. Change to the readonly data section for a table of
! 2059: addresses. final_scan_insn changes back to the text section. */
! 2060: #undef ASM_OUTPUT_CASE_LABEL
! 2061: #define ASM_OUTPUT_CASE_LABEL(FILE, PREFIX, NUM, TABLE) \
! 2062: do { \
! 2063: if (! CASE_VECTOR_INSNS) \
! 2064: { \
! 2065: readonly_data_section (); \
! 2066: ASM_OUTPUT_ALIGN (FILE, 2); \
! 2067: } \
! 2068: ASM_OUTPUT_INTERNAL_LABEL (FILE, PREFIX, NUM); \
! 2069: } while (0)
! 2070:
1.1 root 2071: /* Epilogue for case labels. This jump instruction is called by casesi
2072: to transfer to the appropriate branch instruction within the table.
2073: The label `@L<n>e' is coined to mark the end of the table. */
2074: #define ASM_OUTPUT_CASE_END(FILE, NUM, TABLE) \
2075: do { \
1.1.1.3 root 2076: if (CASE_VECTOR_INSNS) \
2077: { \
2078: char label[256]; \
2079: ASM_GENERATE_INTERNAL_LABEL (label, "L", NUM); \
2080: fprintf (FILE, "%se:\n", &label[1]); \
2081: if (! flag_delayed_branch) \
2082: fprintf (FILE, "\tlda\t %s,%s[%s]\n", reg_names[1], \
2083: reg_names[1], reg_names[m88k_case_index]); \
2084: fprintf (FILE, "\tjmp\t %s\n", reg_names[1]); \
2085: } \
1.1 root 2086: } while (0)
2087:
2088: /* This is how to output an element of a case-vector that is absolute. */
2089: #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
2090: do { \
2091: char buffer[256]; \
2092: ASM_GENERATE_INTERNAL_LABEL (buffer, "L", VALUE); \
1.1.1.3 root 2093: fprintf (FILE, CASE_VECTOR_INSNS ? "\tbr\t %s\n" : "\tword\t %s\n", \
2094: &buffer[1]); \
1.1 root 2095: } while (0)
2096:
2097: /* This is how to output an element of a case-vector that is relative. */
2098: #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) \
2099: ASM_OUTPUT_ADDR_VEC_ELT (FILE, VALUE)
2100:
2101: /* This is how to output an assembler line
2102: that says to advance the location counter
2103: to a multiple of 2**LOG bytes. */
2104: #define ASM_OUTPUT_ALIGN(FILE,LOG) \
2105: if ((LOG) != 0) \
1.1.1.2 root 2106: fprintf (FILE, "\t%s\t %d\n", ALIGN_ASM_OP, 1<<(LOG))
1.1 root 2107:
1.1.1.4 ! root 2108: /* On the m88100, align the text address to half a cache boundary when it
! 2109: can only be reached by jumping. Pack code tightly when compiling
! 2110: crtstuff.c. */
1.1 root 2111: #define ASM_OUTPUT_ALIGN_CODE(FILE) \
1.1.1.4 ! root 2112: ASM_OUTPUT_ALIGN (FILE, \
! 2113: (TARGET_88100 && !flag_inhibit_size_directive ? 3 : 2))
1.1 root 2114:
2115: /* Override svr[34].h. */
2116: #undef ASM_OUTPUT_SKIP
2117: #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1.1.1.2 root 2118: fprintf (FILE, "\t%s\t %u\n", SKIP_ASM_OP, (SIZE))
1.1 root 2119:
2120: /* Override svr4.h. */
2121: #undef ASM_OUTPUT_EXTERNAL_LIBCALL
2122:
2123: /* This says how to output an assembler line to define a global common
2124: symbol. Size can be zero for the unusual case of a `struct { int : 0; }'.
2125: Override svr[34].h. */
2126: #undef ASM_OUTPUT_COMMON
2127: #undef ASM_OUTPUT_ALIGNED_COMMON
2128: #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1.1.1.2 root 2129: ( fprintf ((FILE), "\t%s\t ", \
2130: ((SIZE) ? (SIZE) : 1) <= m88k_gp_threshold ? SCOMM_ASM_OP : COMMON_ASM_OP), \
1.1 root 2131: assemble_name ((FILE), (NAME)), \
2132: fprintf ((FILE), ",%u\n", (SIZE) ? (SIZE) : 1))
2133:
1.1.1.2 root 2134: /* This says how to output an assembler line to define a local common
1.1 root 2135: symbol. Override svr[34].h. */
2136: #undef ASM_OUTPUT_LOCAL
2137: #undef ASM_OUTPUT_ALIGNED_LOCAL
2138: #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1.1.1.2 root 2139: ( fprintf ((FILE), "\t%s\t ", \
1.1.1.3 root 2140: ((SIZE) ? (SIZE) : 1) <= m88k_gp_threshold ? SBSS_ASM_OP : BSS_ASM_OP), \
1.1 root 2141: assemble_name ((FILE), (NAME)), \
2142: fprintf ((FILE), ",%u,%d\n", (SIZE) ? (SIZE) : 1, (SIZE) <= 4 ? 4 : 8))
2143:
2144: /* Store in OUTPUT a string (made with alloca) containing
2145: an assembler-name for a local static variable named NAME.
2146: LABELNO is an integer which is different for each call. */
2147: #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
2148: ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
2149: sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
2150:
2151: /* This is how to output an insn to push a register on the stack.
2152: It need not be very fast code. */
2153: #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
2154: fprintf (FILE, "\tsubu\t %s,%s,%d\n\tst\t %s,%s,0\n", \
2155: reg_names[STACK_POINTER_REGNUM], \
2156: reg_names[STACK_POINTER_REGNUM], \
2157: (STACK_BOUNDARY / BITS_PER_UNIT), \
2158: reg_names[REGNO], \
2159: reg_names[STACK_POINTER_REGNUM])
2160:
1.1.1.4 ! root 2161: /* Length in instructions of the code output by ASM_OUTPUT_REG_PUSH. */
! 2162: #define REG_PUSH_LENGTH 2
! 2163:
1.1 root 2164: /* This is how to output an insn to pop a register from the stack. */
2165: #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
2166: fprintf (FILE, "\tld\t %s,%s,0\n\taddu\t %s,%s,%d\n", \
2167: reg_names[REGNO], \
2168: reg_names[STACK_POINTER_REGNUM], \
2169: reg_names[STACK_POINTER_REGNUM], \
2170: reg_names[STACK_POINTER_REGNUM], \
2171: (STACK_BOUNDARY / BITS_PER_UNIT))
2172:
1.1.1.4 ! root 2173: /* Length in instructions of the code output by ASM_OUTPUT_REG_POP. */
! 2174: #define REG_POP_LENGTH 2
! 2175:
1.1 root 2176: /* Define the parentheses used to group arithmetic operations
2177: in assembler code. */
2178: #define ASM_OPEN_PAREN "("
2179: #define ASM_CLOSE_PAREN ")"
2180:
2181: /* Define results of standard character escape sequences. */
2182: #define TARGET_BELL 007
2183: #define TARGET_BS 010
2184: #define TARGET_TAB 011
2185: #define TARGET_NEWLINE 012
2186: #define TARGET_VT 013
2187: #define TARGET_FF 014
2188: #define TARGET_CR 015
2189:
2190: /* Macros to deal with OCS debug information */
2191:
2192: #define OCS_START_PREFIX "Ltb"
2193: #define OCS_END_PREFIX "Lte"
2194:
2195: #define PUT_OCS_FUNCTION_START(FILE) \
2196: { ASM_OUTPUT_INTERNAL_LABEL (FILE, OCS_START_PREFIX, m88k_function_number); }
2197:
2198: #define PUT_OCS_FUNCTION_END(FILE) \
2199: { ASM_OUTPUT_INTERNAL_LABEL (FILE, OCS_END_PREFIX, m88k_function_number); }
2200:
2201: /* Macros for debug information */
2202: #define DEBUGGER_AUTO_OFFSET(X) \
2203: (m88k_debugger_offset (X, 0) \
2204: + (TARGET_OCS_FRAME_POSITION ? 0 : m88k_stack_size - m88k_fp_offset))
2205:
2206: #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
2207: (m88k_debugger_offset (X, OFFSET) \
2208: + (TARGET_OCS_FRAME_POSITION ? 0 : m88k_stack_size - m88k_fp_offset))
2209:
2210: /* Macros to deal with SDB debug information */
2211: #ifdef SDB_DEBUGGING_INFO
2212:
2213: /* Output structure tag names even when it causes a forward reference. */
2214: #define SDB_ALLOW_FORWARD_REFERENCES
2215:
2216: /* Print out extra debug information in the assembler file */
2217: #define PUT_SDB_SCL(a) \
2218: do { \
2219: register int s = (a); \
2220: register char *scl; \
2221: switch (s) \
2222: { \
2223: case C_EFCN: scl = "end of function"; break; \
2224: case C_NULL: scl = "NULL storage class"; break; \
2225: case C_AUTO: scl = "automatic"; break; \
2226: case C_EXT: scl = "external"; break; \
2227: case C_STAT: scl = "static"; break; \
2228: case C_REG: scl = "register"; break; \
2229: case C_EXTDEF: scl = "external definition"; break; \
2230: case C_LABEL: scl = "label"; break; \
2231: case C_ULABEL: scl = "undefined label"; break; \
2232: case C_MOS: scl = "structure member"; break; \
2233: case C_ARG: scl = "argument"; break; \
2234: case C_STRTAG: scl = "structure tag"; break; \
2235: case C_MOU: scl = "union member"; break; \
2236: case C_UNTAG: scl = "union tag"; break; \
2237: case C_TPDEF: scl = "typedef"; break; \
2238: case C_USTATIC: scl = "uninitialized static"; break; \
2239: case C_ENTAG: scl = "enumeration tag"; break; \
2240: case C_MOE: scl = "member of enumeration"; break; \
2241: case C_REGPARM: scl = "register parameter"; break; \
2242: case C_FIELD: scl = "bit field"; break; \
2243: case C_BLOCK: scl = "block start/end"; break; \
2244: case C_FCN: scl = "function start/end"; break; \
2245: case C_EOS: scl = "end of structure"; break; \
2246: case C_FILE: scl = "filename"; break; \
2247: case C_LINE: scl = "line"; break; \
2248: case C_ALIAS: scl = "duplicated tag"; break; \
2249: case C_HIDDEN: scl = "hidden"; break; \
2250: default: scl = "unknown"; break; \
2251: } \
2252: \
2253: fprintf(asm_out_file, "\tscl\t %d\t\t\t\t; %s\n", s, scl); \
2254: } while (0)
2255:
2256: #define PUT_SDB_TYPE(a) \
2257: do { \
2258: register int t = (a); \
2259: static char buffer[100]; \
2260: register char *p = buffer, *q; \
2261: register int typ = t; \
2262: register int i,d; \
2263: \
2264: for (i = 0; i <= 5; i++) \
2265: { \
2266: switch ((typ >> ((i*N_TSHIFT) + N_BTSHFT)) & 03) \
2267: { \
2268: case DT_PTR: \
2269: strcpy (p, "ptr to "); \
2270: p += sizeof("ptr to"); \
2271: break; \
2272: \
2273: case DT_ARY: \
2274: strcpy (p, "array of "); \
2275: p += sizeof("array of"); \
2276: break; \
2277: \
2278: case DT_FCN: \
2279: strcpy (p, "func ret "); \
2280: p += sizeof("func ret"); \
2281: break; \
2282: } \
2283: } \
2284: \
2285: switch (typ & N_BTMASK) \
2286: { \
2287: case T_NULL: q = "<no type>"; break; \
2288: case T_CHAR: q = "char"; break; \
2289: case T_SHORT: q = "short"; break; \
2290: case T_INT: q = "int"; break; \
2291: case T_LONG: q = "long"; break; \
2292: case T_FLOAT: q = "float"; break; \
2293: case T_DOUBLE: q = "double"; break; \
2294: case T_STRUCT: q = "struct"; break; \
2295: case T_UNION: q = "union"; break; \
2296: case T_ENUM: q = "enum"; break; \
2297: case T_MOE: q = "enum member"; break; \
2298: case T_UCHAR: q = "unsigned char"; break; \
2299: case T_USHORT: q = "unsigned short"; break; \
2300: case T_UINT: q = "unsigned int"; break; \
2301: case T_ULONG: q = "unsigned long"; break; \
2302: default: q = "void"; break; \
2303: } \
2304: \
2305: strcpy (p, q); \
2306: fprintf(asm_out_file, "\ttype\t %d\t\t\t\t; %s\n", \
2307: t, buffer); \
2308: } while (0)
2309:
2310: #define PUT_SDB_INT_VAL(a) \
2311: fprintf (asm_out_file, "\tval\t %d\n", (a))
2312:
2313: #define PUT_SDB_VAL(a) \
2314: ( fprintf (asm_out_file, "\tval\t "), \
2315: output_addr_const (asm_out_file, (a)), \
2316: fputc ('\n', asm_out_file))
2317:
2318: #define PUT_SDB_DEF(a) \
2319: do { fprintf (asm_out_file, "\tsdef\t "); \
2320: ASM_OUTPUT_LABELREF (asm_out_file, a); \
2321: fputc ('\n', asm_out_file); \
2322: } while (0)
2323:
2324: #define PUT_SDB_PLAIN_DEF(a) \
2325: fprintf(asm_out_file,"\tsdef\t .%s\n", a)
2326:
2327: /* Simply and endef now. */
2328: #define PUT_SDB_ENDEF \
2329: fputs("\tendef\n\n", asm_out_file)
2330:
2331: #define PUT_SDB_SIZE(a) \
2332: fprintf (asm_out_file, "\tsize\t %d\n", (a))
2333:
2334: /* Max dimensions to store for debug information (limited by COFF). */
2335: #define SDB_MAX_DIM 6
2336:
2337: /* New method for dim operations. */
2338: #define PUT_SDB_START_DIM \
2339: fputs("\tdim\t ", asm_out_file)
2340:
2341: /* How to end the DIM sequence. */
2342: #define PUT_SDB_LAST_DIM(a) \
2343: fprintf(asm_out_file, "%d\n", a)
2344:
2345: #define PUT_SDB_TAG(a) \
2346: do { \
2347: fprintf (asm_out_file, "\ttag\t "); \
2348: ASM_OUTPUT_LABELREF (asm_out_file, a); \
2349: fputc ('\n', asm_out_file); \
2350: } while( 0 )
2351:
2352: #define PUT_SDB_BLOCK_OR_FUNCTION(NAME, SCL, LINE) \
2353: do { \
2354: fprintf (asm_out_file, "\n\tsdef\t %s\n\tval\t .\n", \
2355: NAME); \
2356: PUT_SDB_SCL( SCL ); \
2357: fprintf (asm_out_file, "\tline\t %d\n\tendef\n\n", \
2358: (LINE)); \
2359: } while (0)
2360:
2361: #define PUT_SDB_BLOCK_START(LINE) \
2362: PUT_SDB_BLOCK_OR_FUNCTION (".bb", C_BLOCK, (LINE))
2363:
2364: #define PUT_SDB_BLOCK_END(LINE) \
2365: PUT_SDB_BLOCK_OR_FUNCTION (".eb", C_BLOCK, (LINE))
2366:
2367: #define PUT_SDB_FUNCTION_START(LINE) \
2368: do { \
2369: fprintf (asm_out_file, "\tln\t 1\n"); \
2370: PUT_SDB_BLOCK_OR_FUNCTION (".bf", C_FCN, (LINE)); \
2371: } while (0)
2372:
2373: #define PUT_SDB_FUNCTION_END(LINE) \
2374: do { \
2375: PUT_SDB_BLOCK_OR_FUNCTION (".ef", C_FCN, (LINE)); \
2376: } while (0)
2377:
2378: #define PUT_SDB_EPILOGUE_END(NAME) \
2379: do { \
2380: text_section (); \
2381: fprintf (asm_out_file, "\n\tsdef\t "); \
2382: ASM_OUTPUT_LABELREF(asm_out_file, (NAME)); \
2383: fputc('\n', asm_out_file); \
2384: PUT_SDB_SCL( C_EFCN ); \
2385: fprintf (asm_out_file, "\tendef\n\n"); \
2386: } while (0)
2387:
2388: #define SDB_GENERATE_FAKE(BUFFER, NUMBER) \
2389: sprintf ((BUFFER), ".%dfake", (NUMBER));
2390:
2391: #endif /* SDB_DEBUGGING_INFO */
2392:
2393: /* Support const and tdesc sections. Generally, a const section will
2394: be distinct from the text section whenever we do V.4-like things
2395: and so follows DECLARE_ASM_NAME. Note that strings go in text
2396: rather than const. Override svr[34].h. */
2397:
2398: #undef USE_CONST_SECTION
2399: #undef EXTRA_SECTIONS
2400:
2401: #define USE_CONST_SECTION DECLARE_ASM_NAME
2402:
1.1.1.4 ! root 2403: #if defined(USING_SVR4_H)
1.1 root 2404:
2405: #define EXTRA_SECTIONS in_const, in_tdesc, in_sdata, in_ctors, in_dtors
2406: #define INIT_SECTION_FUNCTION
2407: #define FINI_SECTION_FUNCTION
2408:
1.1.1.4 ! root 2409: #else
! 2410: #if defined(USING_SVR3_H)
1.1 root 2411:
1.1.1.4 ! root 2412: #define EXTRA_SECTIONS in_const, in_tdesc, in_sdata, in_ctors, in_dtors, \
! 2413: in_init, in_fini
1.1 root 2414:
2415: #else /* m88kluna or other not based on svr[34].h. */
2416:
1.1.1.3 root 2417: #undef INIT_SECTION_ASM_OP
1.1 root 2418: #define EXTRA_SECTIONS in_const, in_tdesc, in_sdata
2419: #define CONST_SECTION_FUNCTION \
2420: void \
2421: const_section () \
2422: { \
2423: text_section(); \
2424: }
2425: #define CTORS_SECTION_FUNCTION
2426: #define DTORS_SECTION_FUNCTION
2427: #define INIT_SECTION_FUNCTION
2428: #define FINI_SECTION_FUNCTION
2429:
1.1.1.4 ! root 2430: #endif /* USING_SVR3_H */
! 2431: #endif /* USING_SVR4_H */
1.1 root 2432:
2433: #undef EXTRA_SECTION_FUNCTIONS
2434: #define EXTRA_SECTION_FUNCTIONS \
2435: CONST_SECTION_FUNCTION \
2436: \
2437: void \
2438: tdesc_section () \
2439: { \
2440: if (in_section != in_tdesc) \
2441: { \
2442: fprintf (asm_out_file, "%s\n", TDESC_SECTION_ASM_OP); \
2443: in_section = in_tdesc; \
2444: } \
2445: } \
2446: \
2447: void \
2448: sdata_section () \
2449: { \
2450: if (in_section != in_sdata) \
2451: { \
2452: fprintf (asm_out_file, "%s\n", SDATA_SECTION_ASM_OP); \
2453: in_section = in_sdata; \
2454: } \
2455: } \
2456: \
2457: CTORS_SECTION_FUNCTION \
2458: DTORS_SECTION_FUNCTION \
2459: INIT_SECTION_FUNCTION \
2460: FINI_SECTION_FUNCTION
2461:
2462: /* A C statement or statements to switch to the appropriate
2463: section for output of DECL. DECL is either a `VAR_DECL' node
2464: or a constant of some sort. RELOC indicates whether forming
2465: the initial value of DECL requires link-time relocations.
2466:
2467: For strings, the section is selected before the segment info is encoded. */
2468: #undef SELECT_SECTION
2469: #define SELECT_SECTION(DECL,RELOC) \
2470: { \
2471: if (TREE_CODE (DECL) == STRING_CST) \
2472: { \
2473: if (! flag_writable_strings) \
2474: const_section (); \
2475: else if (m88k_gp_threshold > 0 \
2476: && TREE_STRING_LENGTH (DECL) <= m88k_gp_threshold) \
2477: sdata_section (); \
2478: else \
2479: data_section (); \
2480: } \
2481: else if (TREE_CODE (DECL) == VAR_DECL) \
2482: { \
2483: if (SYMBOL_REF_FLAG (XEXP (DECL_RTL (DECL), 0))) \
2484: sdata_section (); \
2485: else if ((flag_pic && RELOC) \
2486: || !TREE_READONLY (DECL) || TREE_SIDE_EFFECTS (DECL)) \
2487: data_section (); \
2488: else \
2489: const_section (); \
2490: } \
2491: else \
2492: const_section (); \
2493: }
2494:
1.1.1.4 ! root 2495: /* Jump tables consist of branch instructions and should be output in
! 2496: the text section. When we use a table of addresses, we explicitly
! 2497: change to the readonly data section. */
! 2498: #define JUMP_TABLES_IN_TEXT_SECTION 1
! 2499:
1.1 root 2500: /* Define this macro if references to a symbol must be treated differently
2501: depending on something about the variable or function named by the
2502: symbol (such as what section it is in).
2503:
2504: The macro definition, if any, is executed immediately after the rtl for
2505: DECL has been created and stored in `DECL_RTL (DECL)'. The value of the
2506: rtl will be a `mem' whose address is a `symbol_ref'.
2507:
2508: For the m88k, determine if the item should go in the global pool. */
2509: #define ENCODE_SECTION_INFO(DECL) \
2510: do { \
2511: if (m88k_gp_threshold > 0) \
2512: if (TREE_CODE (DECL) == VAR_DECL) \
2513: { \
2514: if (!TREE_READONLY (DECL) || TREE_SIDE_EFFECTS (DECL)) \
2515: { \
2516: int size = int_size_in_bytes (TREE_TYPE (DECL)); \
2517: \
2518: if (size > 0 && size <= m88k_gp_threshold) \
2519: SYMBOL_REF_FLAG (XEXP (DECL_RTL (DECL), 0)) = 1; \
2520: } \
2521: } \
2522: else if (TREE_CODE (DECL) == STRING_CST \
2523: && flag_writable_strings \
2524: && TREE_STRING_LENGTH (DECL) <= m88k_gp_threshold) \
2525: SYMBOL_REF_FLAG (XEXP (TREE_CST_RTL (DECL), 0)) = 1; \
2526: } while (0)
2527:
2528: /* Print operand X (an rtx) in assembler syntax to file FILE.
2529: CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
2530: For `%' followed by punctuation, CODE is the punctuation and X is null. */
2531: #define PRINT_OPERAND_PUNCT_VALID_P(c) \
2532: ((c) == '#' || (c) == '.' || (c) == '!' || (c) == '*' || (c) == ';')
2533:
2534: #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
2535:
2536: /* Print a memory address as an operand to reference that memory location. */
2537: #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address (FILE, ADDR)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.