1 /* Definitions of target machine for GNU compiler for Intel X86
3 Copyright (C) 1988, 92, 94, 95, 96, 97, 1998 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* The purpose of this file is to define the characteristics of the i386,
23 independent of assembler syntax or operating system.
25 Three other files build on this one to describe a specific assembler syntax:
26 bsd386.h, att386.h, and sun386.h.
28 The actual tm.h file for a particular system should include
29 this file, and then the file for the appropriate assembler syntax.
31 Many macros that specify assembler syntax are omitted entirely from
32 this file because they really belong in the files for particular
33 assemblers. These include AS1, AS2, AS3, RP, IP, LPREFIX, L_SIZE,
34 PUT_OP_SIZE, USE_STAR, ADDR_BEG, ADDR_END, PRINT_IREG, PRINT_SCALE,
35 PRINT_B_I_S, and many that start with ASM_ or end in ASM_OP. */
37 /* $FreeBSD: src/contrib/gcc/config/i386/i386.h,v 1.5 1999/10/16 08:10:36 obrien Exp $ */
39 /* Names to predefine in the preprocessor for this target machine. */
43 /* Stubs for half-pic support if not OSF/1 reference platform. */
46 #define HALF_PIC_P() 0
47 #define HALF_PIC_NUMBER_PTRS 0
48 #define HALF_PIC_NUMBER_REFS 0
49 #define HALF_PIC_ENCODE(DECL)
50 #define HALF_PIC_DECLARE(NAME)
51 #define HALF_PIC_INIT() error ("half-pic init called on systems that don't support it.")
52 #define HALF_PIC_ADDRESS_P(X) 0
53 #define HALF_PIC_PTR(X) X
54 #define HALF_PIC_FINISH(STREAM)
57 /* Define the specific costs for a given cpu */
59 struct processor_costs {
60 int add; /* cost of an add instruction */
61 int lea; /* cost of a lea instruction */
62 int shift_var; /* variable shift costs */
63 int shift_const; /* constant shift costs */
64 int mult_init; /* cost of starting a multiply */
65 int mult_bit; /* cost of multiply per each bit set */
66 int divide; /* cost of a divide/mod */
69 extern struct processor_costs *ix86_cost;
71 /* Run-time compilation parameters selecting different hardware subsets. */
73 extern int target_flags;
75 /* Macros used in the machine description to test the flags. */
77 /* configure can arrange to make this 2, to force a 486. */
78 #ifndef TARGET_CPU_DEFAULT
79 #define TARGET_CPU_DEFAULT 0
82 /* Masks for the -m switches */
83 #define MASK_80387 000000000001 /* Hardware floating point */
84 #define MASK_NOTUSED1 000000000002 /* bit not currently used */
85 #define MASK_NOTUSED2 000000000004 /* bit not currently used */
86 #define MASK_RTD 000000000010 /* Use ret that pops args */
87 #define MASK_ALIGN_DOUBLE 000000000020 /* align doubles to 2 word boundary */
88 #define MASK_SVR3_SHLIB 000000000040 /* Uninit locals into bss */
89 #define MASK_IEEE_FP 000000000100 /* IEEE fp comparisons */
90 #define MASK_FLOAT_RETURNS 000000000200 /* Return float in st(0) */
91 #define MASK_NO_FANCY_MATH_387 000000000400 /* Disable sin, cos, sqrt */
92 #define MASK_OMIT_LEAF_FRAME_POINTER 0x00000800 /* omit leaf frame pointers */
93 /* Temporary codegen switches */
94 #define MASK_DEBUG_ADDR 000001000000 /* Debug GO_IF_LEGITIMATE_ADDRESS */
95 #define MASK_NO_WIDE_MULTIPLY 000002000000 /* Disable 32x32->64 multiplies */
96 #define MASK_NO_MOVE 000004000000 /* Don't generate mem->mem */
97 #define MASK_NO_PSEUDO 000010000000 /* Move op's args -> pseudos */
98 #define MASK_DEBUG_ARG 000020000000 /* Debug function_arg */
99 #define MASK_SCHEDULE_PROLOGUE 000040000000 /* Emit prologue as rtl */
100 #define MASK_STACK_PROBE 000100000000 /* Enable stack probing */
102 /* Use the floating point instructions */
103 #define TARGET_80387 (target_flags & MASK_80387)
105 /* Compile using ret insn that pops args.
106 This will not work unless you use prototypes at least
107 for all functions that can take varying numbers of args. */
108 #define TARGET_RTD (target_flags & MASK_RTD)
110 /* Align doubles to a two word boundary. This breaks compatibility with
111 the published ABI's for structures containing doubles, but produces
112 faster code on the pentium. */
113 #define TARGET_ALIGN_DOUBLE (target_flags & MASK_ALIGN_DOUBLE)
115 /* Put uninitialized locals into bss, not data.
116 Meaningful only on svr3. */
117 #define TARGET_SVR3_SHLIB (target_flags & MASK_SVR3_SHLIB)
119 /* Use IEEE floating point comparisons. These handle correctly the cases
120 where the result of a comparison is unordered. Normally SIGFPE is
121 generated in such cases, in which case this isn't needed. */
122 #define TARGET_IEEE_FP (target_flags & MASK_IEEE_FP)
124 /* Functions that return a floating point value may return that value
125 in the 387 FPU or in 386 integer registers. If set, this flag causes
126 the 387 to be used, which is compatible with most calling conventions. */
127 #define TARGET_FLOAT_RETURNS_IN_80387 (target_flags & MASK_FLOAT_RETURNS)
129 /* Disable generation of FP sin, cos and sqrt operations for 387.
130 This is because FreeBSD lacks these in the math-emulator-code */
131 #define TARGET_NO_FANCY_MATH_387 (target_flags & MASK_NO_FANCY_MATH_387)
133 /* Don't create frame pointers for leaf functions */
134 #define TARGET_OMIT_LEAF_FRAME_POINTER (target_flags & MASK_OMIT_LEAF_FRAME_POINTER)
136 /* Temporary switches for tuning code generation */
138 /* Disable 32x32->64 bit multiplies that are used for long long multiplies
139 and division by constants, but sometimes cause reload problems. */
140 #define TARGET_NO_WIDE_MULTIPLY (target_flags & MASK_NO_WIDE_MULTIPLY)
141 #define TARGET_WIDE_MULTIPLY (!TARGET_NO_WIDE_MULTIPLY)
143 /* Emit/Don't emit prologue as rtl */
144 #define TARGET_SCHEDULE_PROLOGUE (target_flags & MASK_SCHEDULE_PROLOGUE)
146 /* Debug GO_IF_LEGITIMATE_ADDRESS */
147 #define TARGET_DEBUG_ADDR (target_flags & MASK_DEBUG_ADDR)
149 /* Debug FUNCTION_ARG macros */
150 #define TARGET_DEBUG_ARG (target_flags & MASK_DEBUG_ARG)
152 /* Hack macros for tuning code generation */
153 #define TARGET_MOVE ((target_flags & MASK_NO_MOVE) == 0) /* Don't generate memory->memory */
154 #define TARGET_PSEUDO ((target_flags & MASK_NO_PSEUDO) == 0) /* Move op's args into pseudos */
156 #define TARGET_386 (ix86_cpu == PROCESSOR_I386)
157 #define TARGET_486 (ix86_cpu == PROCESSOR_I486)
158 #define TARGET_PENTIUM (ix86_cpu == PROCESSOR_PENTIUM)
159 #define TARGET_PENTIUMPRO (ix86_cpu == PROCESSOR_PENTIUMPRO)
160 #define TARGET_K6 (ix86_cpu == PROCESSOR_K6)
162 #define CPUMASK (1 << ix86_cpu)
163 extern const int x86_use_leave, x86_push_memory, x86_zero_extend_with_and;
164 extern const int x86_use_bit_test, x86_cmove, x86_deep_branch;
165 extern const int x86_unroll_strlen, x86_use_q_reg, x86_use_any_reg;
166 extern const int x86_double_with_add;
168 #define TARGET_USE_LEAVE (x86_use_leave & CPUMASK)
169 #define TARGET_PUSH_MEMORY (x86_push_memory & CPUMASK)
170 #define TARGET_ZERO_EXTEND_WITH_AND (x86_zero_extend_with_and & CPUMASK)
171 #define TARGET_USE_BIT_TEST (x86_use_bit_test & CPUMASK)
172 #define TARGET_UNROLL_STRLEN (x86_unroll_strlen & CPUMASK)
173 #define TARGET_USE_Q_REG (x86_use_q_reg & CPUMASK)
174 #define TARGET_USE_ANY_REG (x86_use_any_reg & CPUMASK)
175 #define TARGET_CMOVE (x86_cmove & (1 << ix86_arch))
176 #define TARGET_DEEP_BRANCH_PREDICTION (x86_deep_branch & CPUMASK)
177 #define TARGET_DOUBLE_WITH_ADD (x86_double_with_add & CPUMASK)
179 #define TARGET_STACK_PROBE (target_flags & MASK_STACK_PROBE)
181 #define TARGET_SWITCHES \
182 { { "80387", MASK_80387, "Use hardware fp" }, \
183 { "no-80387", -MASK_80387, "Do not use hardware fp" },\
184 { "hard-float", MASK_80387, "Use hardware fp" }, \
185 { "soft-float", -MASK_80387, "Do not use hardware fp" },\
186 { "no-soft-float", MASK_80387, "Use hardware fp" }, \
187 { "386", 0, "Same as -mcpu=i386" }, \
188 { "486", 0, "Same as -mcpu=i486" }, \
189 { "pentium", 0, "Same as -mcpu=pentium" }, \
190 { "pentiumpro", 0, "Same as -mcpu=pentiumpro" }, \
191 { "rtd", MASK_RTD, "Alternate calling convention" },\
192 { "no-rtd", -MASK_RTD, "Use normal calling convention" },\
193 { "align-double", MASK_ALIGN_DOUBLE, "Align some doubles on dword boundary" },\
194 { "no-align-double", -MASK_ALIGN_DOUBLE, "Align doubles on word boundary" }, \
195 { "svr3-shlib", MASK_SVR3_SHLIB, "Uninitialized locals in .bss" }, \
196 { "no-svr3-shlib", -MASK_SVR3_SHLIB, "Uninitialized locals in .data" }, \
197 { "ieee-fp", MASK_IEEE_FP, "Use IEEE math for fp comparisons" }, \
198 { "no-ieee-fp", -MASK_IEEE_FP, "Do not use IEEE math for fp comparisons" }, \
199 { "fp-ret-in-387", MASK_FLOAT_RETURNS, "Return values of functions in FPU registers" }, \
200 { "no-fp-ret-in-387", -MASK_FLOAT_RETURNS , "Do not return values of functions in FPU registers"}, \
201 { "no-fancy-math-387", MASK_NO_FANCY_MATH_387, "Do not generate sin, cos, sqrt for 387" }, \
202 { "fancy-math-387", -MASK_NO_FANCY_MATH_387, "Generate sin, cos, sqrt for FPU"}, \
203 { "omit-leaf-frame-pointer", MASK_OMIT_LEAF_FRAME_POINTER, "Omit the frame pointer in leaf functions" }, \
204 { "no-omit-leaf-frame-pointer",-MASK_OMIT_LEAF_FRAME_POINTER, "" }, \
205 { "no-wide-multiply", MASK_NO_WIDE_MULTIPLY, "multiplies of 32 bits constrained to 32 bits" }, \
206 { "wide-multiply", -MASK_NO_WIDE_MULTIPLY, "multiplies of 32 bits are 64 bits" }, \
207 { "schedule-prologue", MASK_SCHEDULE_PROLOGUE, "Schedule function prologues" }, \
208 { "no-schedule-prologue", -MASK_SCHEDULE_PROLOGUE, "" }, \
209 { "debug-addr", MASK_DEBUG_ADDR, 0 /* intentionally undoc */ }, \
210 { "no-debug-addr", -MASK_DEBUG_ADDR, 0 /* intentionally undoc */ }, \
211 { "move", -MASK_NO_MOVE, "Generate mem-mem moves" }, \
212 { "no-move", MASK_NO_MOVE, "Don't generate mem-mem moves" }, \
213 { "debug-arg", MASK_DEBUG_ARG, 0 /* intentionally undoc */ }, \
214 { "no-debug-arg", -MASK_DEBUG_ARG, 0 /* intentionally undoc */ }, \
215 { "stack-arg-probe", MASK_STACK_PROBE, "Enable stack probing" }, \
216 { "no-stack-arg-probe", -MASK_STACK_PROBE, "" }, \
217 { "windows", 0, 0 /* intentionally undoc */ }, \
218 { "dll", 0, 0 /* intentionally undoc */ }, \
220 { "", MASK_SCHEDULE_PROLOGUE | TARGET_DEFAULT, 0 }}
222 /* Which processor to schedule for. The cpu attribute defines a list that
223 mirrors this list, so changes to i386.md must be made at the same time. */
226 {PROCESSOR_I386, /* 80386 */
227 PROCESSOR_I486, /* 80486DX, 80486SX, 80486DX[24] */
229 PROCESSOR_PENTIUMPRO,
232 #define PROCESSOR_I386_STRING "i386"
233 #define PROCESSOR_I486_STRING "i486"
234 #define PROCESSOR_I586_STRING "i586"
235 #define PROCESSOR_PENTIUM_STRING "pentium"
236 #define PROCESSOR_I686_STRING "i686"
237 #define PROCESSOR_PENTIUMPRO_STRING "pentiumpro"
238 #define PROCESSOR_K6_STRING "k6"
240 extern enum processor_type ix86_cpu;
242 extern int ix86_arch;
244 /* Define the default processor. This is overridden by other tm.h files. */
245 #define PROCESSOR_DEFAULT (enum processor_type) TARGET_CPU_DEFAULT
246 #define PROCESSOR_DEFAULT_STRING \
247 (PROCESSOR_DEFAULT == PROCESSOR_I486 ? PROCESSOR_I486_STRING \
248 : PROCESSOR_DEFAULT == PROCESSOR_PENTIUM ? PROCESSOR_PENTIUM_STRING \
249 : PROCESSOR_DEFAULT == PROCESSOR_PENTIUMPRO ? PROCESSOR_PENTIUMPRO_STRING \
250 : PROCESSOR_DEFAULT == PROCESSOR_K6 ? PROCESSOR_K6_STRING \
251 : PROCESSOR_I386_STRING)
253 /* This macro is similar to `TARGET_SWITCHES' but defines names of
254 command options that have values. Its definition is an
255 initializer with a subgrouping for each command option.
257 Each subgrouping contains a string constant, that defines the
258 fixed part of the option name, and the address of a variable. The
259 variable, type `char *', is set to the variable part of the given
260 option if the fixed part matches. The actual option name is made
261 by appending `-m' to the specified name. */
262 #define TARGET_OPTIONS \
263 { { "cpu=", &ix86_cpu_string, "Schedule code for given CPU"}, \
264 { "arch=", &ix86_arch_string, "Generate code for given CPU"}, \
265 { "reg-alloc=", &i386_reg_alloc_order, "Control allocation order of integer registers" }, \
266 { "regparm=", &i386_regparm_string, "Number of registers used to pass integer arguments" }, \
267 { "align-loops=", &i386_align_loops_string, "Loop code aligned to this power of 2" }, \
268 { "align-jumps=", &i386_align_jumps_string, "Jump targets are aligned to this power of 2" }, \
269 { "align-functions=", &i386_align_funcs_string, "Function starts are aligned to this power of 2" }, \
270 { "preferred-stack-boundary=", &i386_preferred_stack_boundary_string, "Attempt to keep stack aligned to this power of 2" }, \
271 { "branch-cost=", &i386_branch_cost_string, "Branches are this expensive (1-5, arbitrary units)" }, \
275 /* Sometimes certain combinations of command options do not make
276 sense on a particular target machine. You can define a macro
277 `OVERRIDE_OPTIONS' to take account of this. This macro, if
278 defined, is executed once just after all the command options have
281 Don't use this macro to turn on various extra optimizations for
282 `-O'. That is what `OPTIMIZATION_OPTIONS' is for. */
284 #define OVERRIDE_OPTIONS override_options ()
286 /* These are meant to be redefined in the host dependent files */
287 #define SUBTARGET_SWITCHES
288 #define SUBTARGET_OPTIONS
290 /* Define this to change the optimizations performed by default. */
291 #define OPTIMIZATION_OPTIONS(LEVEL,SIZE) optimization_options(LEVEL,SIZE)
293 /* Specs for the compiler proper */
296 #define CC1_CPU_SPEC "\
298 %{m386:-mcpu=i386 -march=i386} \
299 %{m486:-mcpu=i486 -march=i486} \
300 %{mpentium:-mcpu=pentium} \
301 %{mpentiumpro:-mcpu=pentiumpro}}"
304 #define CPP_486_SPEC "%{!ansi:-Di486} -D__i486 -D__i486__"
305 #define CPP_586_SPEC "%{!ansi:-Di586 -Dpentium} \
306 -D__i586 -D__i586__ -D__pentium -D__pentium__"
307 #define CPP_K6_SPEC "%{!ansi:-Di586 -Dk6} \
308 -D__i586 -D__i586__ -D__k6 -D__k6__"
309 #define CPP_686_SPEC "%{!ansi:-Di686 -Dpentiumpro} \
310 -D__i686 -D__i686__ -D__pentiumpro -D__pentiumpro__"
312 #ifndef CPP_CPU_DEFAULT_SPEC
313 #if TARGET_CPU_DEFAULT == 1
314 #define CPP_CPU_DEFAULT_SPEC "%(cpp_486)"
316 #if TARGET_CPU_DEFAULT == 2
317 #define CPP_CPU_DEFAULT_SPEC "%(cpp_586)"
319 #if TARGET_CPU_DEFAULT == 3
320 #define CPP_CPU_DEFAULT_SPEC "%(cpp_686)"
322 #if TARGET_CPU_DEFAULT == 4
323 #define CPP_CPU_DEFAULT_SPEC "%(cpp_k6)"
325 #ifndef CPP_CPU_DEFAULT_SPEC
326 #define CPP_CPU_DEFAULT_SPEC ""
328 #endif /* CPP_CPU_DEFAULT_SPEC */
331 #define CPP_CPU_SPEC "\
332 -Acpu(i386) -Amachine(i386) \
333 %{!ansi:-Di386} -D__i386 -D__i386__ \
334 %{mcpu=i486:%(cpp_486)} %{m486:%(cpp_486)} \
335 %{mpentium:%(cpp_586)} %{mcpu=pentium:%(cpp_586)} \
336 %{mpentiumpro:%(cpp_686)} %{mcpu=pentiumpro:%(cpp_686)} \
337 %{mcpu=k6:%(cpp_k6)} \
338 %{!mcpu*:%{!m486:%{!mpentium*:%(cpp_cpu_default)}}}"
342 #define CC1_SPEC "%(cc1_spec) "
345 /* This macro defines names of additional specifications to put in the
346 specs that can be used in various specifications like CC1_SPEC. Its
347 definition is an initializer with a subgrouping for each command option.
349 Each subgrouping contains a string constant, that defines the
350 specification name, and a string constant that used by the GNU CC driver
353 Do not define this macro if it does not need to do anything. */
355 #ifndef SUBTARGET_EXTRA_SPECS
356 #define SUBTARGET_EXTRA_SPECS
359 #define EXTRA_SPECS \
360 { "cpp_486", CPP_486_SPEC}, \
361 { "cpp_586", CPP_586_SPEC}, \
362 { "cpp_k6", CPP_K6_SPEC}, \
363 { "cpp_686", CPP_686_SPEC}, \
364 { "cpp_cpu_default", CPP_CPU_DEFAULT_SPEC }, \
365 { "cpp_cpu", CPP_CPU_SPEC }, \
366 { "cc1_cpu", CC1_CPU_SPEC }, \
367 SUBTARGET_EXTRA_SPECS
369 /* target machine storage layout */
371 /* Define for XFmode extended real floating point support.
372 This will automatically cause REAL_ARITHMETIC to be defined. */
373 #define LONG_DOUBLE_TYPE_SIZE 96
375 /* Define if you don't want extended real, but do want to use the
376 software floating point emulator for REAL_ARITHMETIC and
377 decimal <-> binary conversion. */
378 /* #define REAL_ARITHMETIC */
380 /* Define this if most significant byte of a word is the lowest numbered. */
381 /* That is true on the 80386. */
383 #define BITS_BIG_ENDIAN 0
385 /* Define this if most significant byte of a word is the lowest numbered. */
386 /* That is not true on the 80386. */
387 #define BYTES_BIG_ENDIAN 0
389 /* Define this if most significant word of a multiword number is the lowest
391 /* Not true for 80386 */
392 #define WORDS_BIG_ENDIAN 0
394 /* number of bits in an addressable storage unit */
395 #define BITS_PER_UNIT 8
397 /* Width in bits of a "word", which is the contents of a machine register.
398 Note that this is not necessarily the width of data type `int';
399 if using 16-bit ints on a 80386, this would still be 32.
400 But on a machine with 16-bit registers, this would be 16. */
401 #define BITS_PER_WORD 32
403 /* Width of a word, in units (bytes). */
404 #define UNITS_PER_WORD 4
406 /* Width in bits of a pointer.
407 See also the macro `Pmode' defined below. */
408 #define POINTER_SIZE 32
410 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
411 #define PARM_BOUNDARY 32
413 /* Boundary (in *bits*) on which the stack pointer must be aligned. */
414 #define STACK_BOUNDARY 32
416 /* Boundary (in *bits*) on which the stack pointer preferrs to be
417 aligned; the compiler cannot rely on having this alignment. */
418 #define PREFERRED_STACK_BOUNDARY i386_preferred_stack_boundary
420 /* Allocation boundary (in *bits*) for the code of a function.
421 For i486, we get better performance by aligning to a cache
422 line (i.e. 16 byte) boundary. */
423 #define FUNCTION_BOUNDARY (1 << (i386_align_funcs + 3))
425 /* Alignment of field after `int : 0' in a structure. */
427 #define EMPTY_FIELD_BOUNDARY 32
429 /* Minimum size in bits of the largest boundary to which any
430 and all fundamental data types supported by the hardware
431 might need to be aligned. No data type wants to be aligned
432 rounder than this. The i386 supports 64-bit floating point
433 quantities, but these can be aligned on any 32-bit boundary.
434 The published ABIs say that doubles should be aligned on word
435 boundaries, but the Pentium gets better performance with them
436 aligned on 64 bit boundaries. */
437 #define BIGGEST_ALIGNMENT (TARGET_ALIGN_DOUBLE ? 64 : 32)
439 /* If defined, a C expression to compute the alignment given to a
440 constant that is being placed in memory. CONSTANT is the constant
441 and ALIGN is the alignment that the object would ordinarily have.
442 The value of this macro is used instead of that alignment to align
445 If this macro is not defined, then ALIGN is used.
447 The typical use of this macro is to increase alignment for string
448 constants to be word aligned so that `strcpy' calls that copy
449 constants can be done inline. */
451 #define CONSTANT_ALIGNMENT(EXP, ALIGN) \
452 (TREE_CODE (EXP) == REAL_CST \
453 ? ((TYPE_MODE (TREE_TYPE (EXP)) == DFmode && (ALIGN) < 64) \
455 : (TYPE_MODE (TREE_TYPE (EXP)) == XFmode && (ALIGN) < 128) \
458 : TREE_CODE (EXP) == STRING_CST \
459 ? ((TREE_STRING_LENGTH (EXP) >= 31 && (ALIGN) < 256) \
464 /* If defined, a C expression to compute the alignment for a static
465 variable. TYPE is the data type, and ALIGN is the alignment that
466 the object would ordinarily have. The value of this macro is used
467 instead of that alignment to align the object.
469 If this macro is not defined, then ALIGN is used.
471 One use of this macro is to increase alignment of medium-size
472 data to make it all fit in fewer cache lines. Another is to
473 cause character arrays to be word-aligned so that `strcpy' calls
474 that copy constants to character arrays can be done inline. */
476 #define DATA_ALIGNMENT(TYPE, ALIGN) \
477 ((AGGREGATE_TYPE_P (TYPE) \
478 && TYPE_SIZE (TYPE) \
479 && TREE_CODE (TYPE_SIZE (TYPE)) == INTEGER_CST \
480 && (TREE_INT_CST_LOW (TYPE_SIZE (TYPE)) >= 256 \
481 || TREE_INT_CST_HIGH (TYPE_SIZE (TYPE))) && (ALIGN) < 256) \
483 : TREE_CODE (TYPE) == ARRAY_TYPE \
484 ? ((TYPE_MODE (TREE_TYPE (TYPE)) == DFmode && (ALIGN) < 64) \
486 : (TYPE_MODE (TREE_TYPE (TYPE)) == XFmode && (ALIGN) < 128) \
489 : TREE_CODE (TYPE) == COMPLEX_TYPE \
490 ? ((TYPE_MODE (TYPE) == DCmode && (ALIGN) < 64) \
492 : (TYPE_MODE (TYPE) == XCmode && (ALIGN) < 128) \
495 : ((TREE_CODE (TYPE) == RECORD_TYPE \
496 || TREE_CODE (TYPE) == UNION_TYPE \
497 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) \
498 && TYPE_FIELDS (TYPE)) \
499 ? ((DECL_MODE (TYPE_FIELDS (TYPE)) == DFmode && (ALIGN) < 64) \
501 : (DECL_MODE (TYPE_FIELDS (TYPE)) == XFmode && (ALIGN) < 128) \
504 : TREE_CODE (TYPE) == REAL_TYPE \
505 ? ((TYPE_MODE (TYPE) == DFmode && (ALIGN) < 64) \
507 : (TYPE_MODE (TYPE) == XFmode && (ALIGN) < 128) \
512 /* If defined, a C expression to compute the alignment for a local
513 variable. TYPE is the data type, and ALIGN is the alignment that
514 the object would ordinarily have. The value of this macro is used
515 instead of that alignment to align the object.
517 If this macro is not defined, then ALIGN is used.
519 One use of this macro is to increase alignment of medium-size
520 data to make it all fit in fewer cache lines. */
522 #define LOCAL_ALIGNMENT(TYPE, ALIGN) \
523 (TREE_CODE (TYPE) == ARRAY_TYPE \
524 ? ((TYPE_MODE (TREE_TYPE (TYPE)) == DFmode && (ALIGN) < 64) \
526 : (TYPE_MODE (TREE_TYPE (TYPE)) == XFmode && (ALIGN) < 128) \
529 : TREE_CODE (TYPE) == COMPLEX_TYPE \
530 ? ((TYPE_MODE (TYPE) == DCmode && (ALIGN) < 64) \
532 : (TYPE_MODE (TYPE) == XCmode && (ALIGN) < 128) \
535 : ((TREE_CODE (TYPE) == RECORD_TYPE \
536 || TREE_CODE (TYPE) == UNION_TYPE \
537 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) \
538 && TYPE_FIELDS (TYPE)) \
539 ? ((DECL_MODE (TYPE_FIELDS (TYPE)) == DFmode && (ALIGN) < 64) \
541 : (DECL_MODE (TYPE_FIELDS (TYPE)) == XFmode && (ALIGN) < 128) \
544 : TREE_CODE (TYPE) == REAL_TYPE \
545 ? ((TYPE_MODE (TYPE) == DFmode && (ALIGN) < 64) \
547 : (TYPE_MODE (TYPE) == XFmode && (ALIGN) < 128) \
552 /* Set this non-zero if move instructions will actually fail to work
553 when given unaligned data. */
554 #define STRICT_ALIGNMENT 0
556 /* If bit field type is int, don't let it cross an int,
557 and give entire struct the alignment of an int. */
558 /* Required on the 386 since it doesn't have bitfield insns. */
559 #define PCC_BITFIELD_TYPE_MATTERS 1
561 /* Maximum power of 2 that code can be aligned to. */
562 #define MAX_CODE_ALIGN 6 /* 64 byte alignment */
564 /* Align loop starts for optimal branching. */
565 #define LOOP_ALIGN(LABEL) (i386_align_loops)
566 #define LOOP_ALIGN_MAX_SKIP (i386_align_loops_string ? 0 : 7)
568 /* This is how to align an instruction for optimal branching.
569 On i486 we'll get better performance by aligning on a
570 cache line (i.e. 16 byte) boundary. */
571 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) (i386_align_jumps)
572 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (i386_align_jumps_string ? 0 : 7)
575 /* Standard register usage. */
577 /* This processor has special stack-like registers. See reg-stack.c
581 #define IS_STACK_MODE(mode) (mode==DFmode || mode==SFmode || mode==XFmode)
583 /* Number of actual hardware registers.
584 The hardware registers are assigned numbers for the compiler
585 from 0 to just below FIRST_PSEUDO_REGISTER.
586 All registers that the compiler knows about must be given numbers,
587 even those that are not normally considered general registers.
589 In the 80386 we give the 8 general purpose registers the numbers 0-7.
590 We number the floating point registers 8-15.
591 Note that registers 0-7 can be accessed as a short or int,
592 while only 0-3 may be used with byte `mov' instructions.
594 Reg 16 does not correspond to any hardware register, but instead
595 appears in the RTL as an argument pointer prior to reload, and is
596 eliminated during reloading in favor of either the stack or frame
599 #define FIRST_PSEUDO_REGISTER 17
601 /* 1 for registers that have pervasive standard uses
602 and are not available for the register allocator.
603 On the 80386, the stack pointer is such, as is the arg pointer. */
604 #define FIXED_REGISTERS \
605 /*ax,dx,cx,bx,si,di,bp,sp,st,st1,st2,st3,st4,st5,st6,st7,arg*/ \
606 { 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1 }
608 /* 1 for registers not available across function calls.
609 These must include the FIXED_REGISTERS and also any
610 registers that can be used without being saved.
611 The latter must include the registers where values are returned
612 and the register where structure-value addresses are passed.
613 Aside from that, you can include as many other registers as you like. */
615 #define CALL_USED_REGISTERS \
616 /*ax,dx,cx,bx,si,di,bp,sp,st,st1,st2,st3,st4,st5,st6,st7,arg*/ \
617 { 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }
619 /* Order in which to allocate registers. Each register must be
620 listed once, even those in FIXED_REGISTERS. List frame pointer
621 late and fixed registers last. Note that, in general, we prefer
622 registers listed in CALL_USED_REGISTERS, keeping the others
623 available for storage of persistent values.
625 Three different versions of REG_ALLOC_ORDER have been tried:
627 If the order is edx, ecx, eax, ... it produces a slightly faster compiler,
628 but slower code on simple functions returning values in eax.
630 If the order is eax, ecx, edx, ... it causes reload to abort when compiling
631 perl 4.036 due to not being able to create a DImode register (to hold a 2
634 If the order is eax, edx, ecx, ... it produces better code for simple
635 functions, and a slightly slower compiler. Users complained about the code
636 generated by allocating edx first, so restore the 'natural' order of things. */
638 #define REG_ALLOC_ORDER \
639 /*ax,dx,cx,bx,si,di,bp,sp,st,st1,st2,st3,st4,st5,st6,st7,arg*/ \
640 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }
642 /* A C statement (sans semicolon) to choose the order in which to
643 allocate hard registers for pseudo-registers local to a basic
646 Store the desired register order in the array `reg_alloc_order'.
647 Element 0 should be the register to allocate first; element 1, the
648 next register; and so on.
650 The macro body should not assume anything about the contents of
651 `reg_alloc_order' before execution of the macro.
653 On most machines, it is not necessary to define this macro. */
655 #define ORDER_REGS_FOR_LOCAL_ALLOC order_regs_for_local_alloc ()
657 /* Macro to conditionally modify fixed_regs/call_used_regs. */
658 #define CONDITIONAL_REGISTER_USAGE \
662 fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
663 call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
665 if (! TARGET_80387 && ! TARGET_FLOAT_RETURNS_IN_80387) \
669 COPY_HARD_REG_SET (x, reg_class_contents[(int)FLOAT_REGS]); \
670 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++ ) \
671 if (TEST_HARD_REG_BIT (x, i)) \
672 fixed_regs[i] = call_used_regs[i] = 1; \
676 /* Return number of consecutive hard regs needed starting at reg REGNO
677 to hold something of mode MODE.
678 This is ordinarily the length in words of a value of mode MODE
679 but can be less for certain modes in special long registers.
681 Actually there are no two word move instructions for consecutive
682 registers. And only registers 0-3 may have mov byte instructions
686 #define HARD_REGNO_NREGS(REGNO, MODE) \
687 (FP_REGNO_P (REGNO) ? 1 \
688 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
690 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
691 On the 80386, the first 4 cpu registers can hold any mode
692 while the floating point registers may hold only floating point.
693 Make it clear that the fp regs could not hold a 16-byte float. */
695 /* The casts to int placate a compiler on a microvax,
696 for cross-compiler testing. */
698 #define HARD_REGNO_MODE_OK(REGNO, MODE) \
700 : FP_REGNO_P (REGNO) \
701 ? (((int) GET_MODE_CLASS (MODE) == (int) MODE_FLOAT \
702 || (int) GET_MODE_CLASS (MODE) == (int) MODE_COMPLEX_FLOAT) \
703 && GET_MODE_UNIT_SIZE (MODE) <= (LONG_DOUBLE_TYPE_SIZE == 96 ? 12 : 8))\
704 : (int) (MODE) != (int) QImode ? 1 \
705 : (reload_in_progress | reload_completed) == 1)
707 /* Value is 1 if it is a good idea to tie two pseudo registers
708 when one has mode MODE1 and one has mode MODE2.
709 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
710 for any hard reg, then this must be 0 for correct output. */
712 #define MODES_TIEABLE_P(MODE1, MODE2) \
713 ((MODE1) == (MODE2) \
714 || ((MODE1) == SImode && (MODE2) == HImode) \
715 || ((MODE1) == HImode && (MODE2) == SImode))
717 /* Specify the registers used for certain standard purposes.
718 The values of these macros are register numbers. */
720 /* on the 386 the pc register is %eip, and is not usable as a general
721 register. The ordinary mov instructions won't work */
722 /* #define PC_REGNUM */
724 /* Register to use for pushing function arguments. */
725 #define STACK_POINTER_REGNUM 7
727 /* Base register for access to local variables of the function. */
728 #define FRAME_POINTER_REGNUM 6
730 /* First floating point reg */
731 #define FIRST_FLOAT_REG 8
733 /* First & last stack-like regs */
734 #define FIRST_STACK_REG FIRST_FLOAT_REG
735 #define LAST_STACK_REG (FIRST_FLOAT_REG + 7)
737 /* Value should be nonzero if functions must have frame pointers.
738 Zero means the frame pointer need not be set up (and parms
739 may be accessed via the stack pointer) in functions that seem suitable.
740 This is computed in `reload', in reload1.c. */
741 #define FRAME_POINTER_REQUIRED (TARGET_OMIT_LEAF_FRAME_POINTER && !leaf_function_p ())
743 /* Base register for access to arguments of the function. */
744 #define ARG_POINTER_REGNUM 16
746 /* Register in which static-chain is passed to a function. */
747 #define STATIC_CHAIN_REGNUM 2
749 /* Register to hold the addressing base for position independent
750 code access to data items. */
751 #define PIC_OFFSET_TABLE_REGNUM 3
753 /* Register in which address to store a structure value
754 arrives in the function. On the 386, the prologue
755 copies this from the stack to register %eax. */
756 #define STRUCT_VALUE_INCOMING 0
758 /* Place in which caller passes the structure value address.
759 0 means push the value on the stack like an argument. */
760 #define STRUCT_VALUE 0
762 /* A C expression which can inhibit the returning of certain function
763 values in registers, based on the type of value. A nonzero value
764 says to return the function value in memory, just as large
765 structures are always returned. Here TYPE will be a C expression
766 of type `tree', representing the data type of the value.
768 Note that values of mode `BLKmode' must be explicitly handled by
769 this macro. Also, the option `-fpcc-struct-return' takes effect
770 regardless of this macro. On most systems, it is possible to
771 leave the macro undefined; this causes a default definition to be
772 used, whose value is the constant 1 for `BLKmode' values, and 0
775 Do not use this macro to indicate that structures and unions
776 should always be returned in memory. You should instead use
777 `DEFAULT_PCC_STRUCT_RETURN' to indicate this. */
779 #define RETURN_IN_MEMORY(TYPE) \
780 ((TYPE_MODE (TYPE) == BLKmode) || int_size_in_bytes (TYPE) > 12)
783 /* Define the classes of registers for register constraints in the
784 machine description. Also define ranges of constants.
786 One of the classes must always be named ALL_REGS and include all hard regs.
787 If there is more than one class, another class must be named NO_REGS
788 and contain no registers.
790 The name GENERAL_REGS must be the name of a class (or an alias for
791 another name such as ALL_REGS). This is the class of registers
792 that is allowed by "g" or "r" in a register constraint.
793 Also, registers outside this class are allocated only when
794 instructions express preferences for them.
796 The classes must be numbered in nondecreasing order; that is,
797 a larger-numbered class must never be contained completely
798 in a smaller-numbered class.
800 For any two classes, it is very desirable that there be another
801 class that represents their union.
803 It might seem that class BREG is unnecessary, since no useful 386
804 opcode needs reg %ebx. But some systems pass args to the OS in ebx,
805 and the "b" register constraint is useful in asms for syscalls. */
810 AREG, DREG, CREG, BREG,
811 AD_REGS, /* %eax/%edx for DImode */
812 Q_REGS, /* %eax %ebx %ecx %edx */
814 INDEX_REGS, /* %eax %ebx %ecx %edx %esi %edi %ebp */
815 GENERAL_REGS, /* %eax %ebx %ecx %edx %esi %edi %ebp %esp */
816 FP_TOP_REG, FP_SECOND_REG, /* %st(0) %st(1) */
818 ALL_REGS, LIM_REG_CLASSES
821 #define N_REG_CLASSES (int) LIM_REG_CLASSES
823 #define FLOAT_CLASS_P(CLASS) (reg_class_subset_p (CLASS, FLOAT_REGS))
825 /* Give names of register classes as strings for dump file. */
827 #define REG_CLASS_NAMES \
829 "AREG", "DREG", "CREG", "BREG", \
835 "FP_TOP_REG", "FP_SECOND_REG", \
839 /* Define which registers fit in which classes.
840 This is an initializer for a vector of HARD_REG_SET
841 of length N_REG_CLASSES. */
843 #define REG_CLASS_CONTENTS \
845 {0x1}, {0x2}, {0x4}, {0x8}, /* AREG, DREG, CREG, BREG */ \
846 {0x3}, /* AD_REGS */ \
847 {0xf}, /* Q_REGS */ \
848 {0x10}, {0x20}, /* SIREG, DIREG */ \
849 {0x7f}, /* INDEX_REGS */ \
850 {0x100ff}, /* GENERAL_REGS */ \
851 {0x0100}, {0x0200}, /* FP_TOP_REG, FP_SECOND_REG */ \
852 {0xff00}, /* FLOAT_REGS */ \
855 /* The same information, inverted:
856 Return the class number of the smallest class containing
857 reg number REGNO. This could be a conditional expression
858 or could index an array. */
860 #define REGNO_REG_CLASS(REGNO) (regclass_map[REGNO])
862 /* When defined, the compiler allows registers explicitly used in the
863 rtl to be used as spill registers but prevents the compiler from
864 extending the lifetime of these registers. */
866 #define SMALL_REGISTER_CLASSES 1
868 #define QI_REG_P(X) \
869 (REG_P (X) && REGNO (X) < 4)
870 #define NON_QI_REG_P(X) \
871 (REG_P (X) && REGNO (X) >= 4 && REGNO (X) < FIRST_PSEUDO_REGISTER)
873 #define FP_REG_P(X) (REG_P (X) && FP_REGNO_P (REGNO (X)))
874 #define FP_REGNO_P(n) ((n) >= FIRST_STACK_REG && (n) <= LAST_STACK_REG)
876 #define STACK_REG_P(xop) (REG_P (xop) && \
877 REGNO (xop) >= FIRST_STACK_REG && \
878 REGNO (xop) <= LAST_STACK_REG)
880 #define NON_STACK_REG_P(xop) (REG_P (xop) && ! STACK_REG_P (xop))
882 #define STACK_TOP_P(xop) (REG_P (xop) && REGNO (xop) == FIRST_STACK_REG)
884 /* 1 if register REGNO can magically overlap other regs.
885 Note that nonzero values work only in very special circumstances. */
887 /* #define OVERLAPPING_REGNO_P(REGNO) FP_REGNO_P (REGNO) */
889 /* The class value for index registers, and the one for base regs. */
891 #define INDEX_REG_CLASS INDEX_REGS
892 #define BASE_REG_CLASS GENERAL_REGS
894 /* Get reg_class from a letter such as appears in the machine description. */
896 #define REG_CLASS_FROM_LETTER(C) \
897 ((C) == 'r' ? GENERAL_REGS : \
898 (C) == 'q' ? Q_REGS : \
899 (C) == 'f' ? (TARGET_80387 || TARGET_FLOAT_RETURNS_IN_80387 \
902 (C) == 't' ? (TARGET_80387 || TARGET_FLOAT_RETURNS_IN_80387 \
905 (C) == 'u' ? (TARGET_80387 || TARGET_FLOAT_RETURNS_IN_80387 \
908 (C) == 'a' ? AREG : \
909 (C) == 'b' ? BREG : \
910 (C) == 'c' ? CREG : \
911 (C) == 'd' ? DREG : \
912 (C) == 'A' ? AD_REGS : \
913 (C) == 'D' ? DIREG : \
914 (C) == 'S' ? SIREG : NO_REGS)
916 /* The letters I, J, K, L and M in a register constraint string
917 can be used to stand for particular ranges of immediate operands.
918 This macro defines what the ranges are.
919 C is the letter, and VALUE is a constant value.
920 Return 1 if VALUE is in the range specified by C.
922 I is for non-DImode shifts.
923 J is for DImode shifts.
924 K and L are for an `andsi' optimization.
925 M is for shifts that can be executed by the "lea" opcode.
928 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
929 ((C) == 'I' ? (VALUE) >= 0 && (VALUE) <= 31 : \
930 (C) == 'J' ? (VALUE) >= 0 && (VALUE) <= 63 : \
931 (C) == 'K' ? (VALUE) == 0xff : \
932 (C) == 'L' ? (VALUE) == 0xffff : \
933 (C) == 'M' ? (VALUE) >= 0 && (VALUE) <= 3 : \
934 (C) == 'N' ? (VALUE) >= 0 && (VALUE) <= 255 :\
935 (C) == 'O' ? (VALUE) >= 0 && (VALUE) <= 32 : \
938 /* Similar, but for floating constants, and defining letters G and H.
939 Here VALUE is the CONST_DOUBLE rtx itself. We allow constants even if
940 TARGET_387 isn't set, because the stack register converter may need to
941 load 0.0 into the function value register. */
943 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
944 ((C) == 'G' ? standard_80387_constant_p (VALUE) : 0)
946 /* Place additional restrictions on the register class to use when it
947 is necessary to be able to hold a value of mode MODE in a reload
948 register for which class CLASS would ordinarily be used. */
950 #define LIMIT_RELOAD_CLASS(MODE, CLASS) \
951 ((MODE) == QImode && ((CLASS) == ALL_REGS || (CLASS) == GENERAL_REGS) \
954 /* Given an rtx X being reloaded into a reg required to be
955 in class CLASS, return the class of reg to actually use.
956 In general this is just CLASS; but on some machines
957 in some cases it is preferable to use a more restrictive class.
958 On the 80386 series, we prevent floating constants from being
959 reloaded into floating registers (since no move-insn can do that)
960 and we ensure that QImodes aren't reloaded into the esi or edi reg. */
962 /* Put float CONST_DOUBLE in the constant pool instead of fp regs.
963 QImode must go into class Q_REGS.
964 Narrow ALL_REGS to GENERAL_REGS. This supports allowing movsf and
965 movdf to do mem-to-mem moves through integer regs. */
967 #define PREFERRED_RELOAD_CLASS(X,CLASS) \
968 (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) != VOIDmode \
969 ? (standard_80387_constant_p (X) \
970 ? reg_class_subset_p (CLASS, FLOAT_REGS) ? CLASS : FLOAT_REGS \
972 : GET_MODE (X) == QImode && ! reg_class_subset_p (CLASS, Q_REGS) ? Q_REGS \
973 : ((CLASS) == ALL_REGS \
974 && GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT) ? GENERAL_REGS \
977 /* If we are copying between general and FP registers, we need a memory
980 #define SECONDARY_MEMORY_NEEDED(CLASS1,CLASS2,MODE) \
981 ((FLOAT_CLASS_P (CLASS1) && ! FLOAT_CLASS_P (CLASS2)) \
982 || (! FLOAT_CLASS_P (CLASS1) && FLOAT_CLASS_P (CLASS2)))
984 /* Return the maximum number of consecutive registers
985 needed to represent mode MODE in a register of class CLASS. */
986 /* On the 80386, this is the size of MODE in words,
987 except in the FP regs, where a single reg is always enough. */
988 #define CLASS_MAX_NREGS(CLASS, MODE) \
989 (FLOAT_CLASS_P (CLASS) ? 1 : \
990 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
992 /* A C expression whose value is nonzero if pseudos that have been
993 assigned to registers of class CLASS would likely be spilled
994 because registers of CLASS are needed for spill registers.
996 The default value of this macro returns 1 if CLASS has exactly one
997 register and zero otherwise. On most machines, this default
998 should be used. Only define this macro to some other expression
999 if pseudo allocated by `local-alloc.c' end up in memory because
1000 their hard registers were needed for spill registers. If this
1001 macro returns nonzero for those classes, those pseudos will only
1002 be allocated by `global.c', which knows how to reallocate the
1003 pseudo to another register. If there would not be another
1004 register available for reallocation, you should not change the
1005 definition of this macro since the only effect of such a
1006 definition would be to slow down register allocation. */
1008 #define CLASS_LIKELY_SPILLED_P(CLASS) \
1009 (((CLASS) == AREG) \
1010 || ((CLASS) == DREG) \
1011 || ((CLASS) == CREG) \
1012 || ((CLASS) == BREG) \
1013 || ((CLASS) == AD_REGS) \
1014 || ((CLASS) == SIREG) \
1015 || ((CLASS) == DIREG))
1018 /* Stack layout; function entry, exit and calling. */
1020 /* Define this if pushing a word on the stack
1021 makes the stack pointer a smaller address. */
1022 #define STACK_GROWS_DOWNWARD
1024 /* Define this if the nominal address of the stack frame
1025 is at the high-address end of the local variables;
1026 that is, each additional local variable allocated
1027 goes at a more negative offset in the frame. */
1028 #define FRAME_GROWS_DOWNWARD
1030 /* Offset within stack frame to start allocating local variables at.
1031 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
1032 first local allocated. Otherwise, it is the offset to the BEGINNING
1033 of the first local allocated. */
1034 #define STARTING_FRAME_OFFSET 0
1036 /* If we generate an insn to push BYTES bytes,
1037 this says how many the stack pointer really advances by.
1038 On 386 pushw decrements by exactly 2 no matter what the position was.
1039 On the 386 there is no pushb; we use pushw instead, and this
1040 has the effect of rounding up to 2. */
1042 #define PUSH_ROUNDING(BYTES) (((BYTES) + 1) & (-2))
1044 /* Offset of first parameter from the argument pointer register value. */
1045 #define FIRST_PARM_OFFSET(FNDECL) 0
1047 /* Value is the number of bytes of arguments automatically
1048 popped when returning from a subroutine call.
1049 FUNDECL is the declaration node of the function (as a tree),
1050 FUNTYPE is the data type of the function (as a tree),
1051 or for a library call it is an identifier node for the subroutine name.
1052 SIZE is the number of bytes of arguments passed on the stack.
1054 On the 80386, the RTD insn may be used to pop them if the number
1055 of args is fixed, but if the number is variable then the caller
1056 must pop them all. RTD can't be used for library calls now
1057 because the library is compiled with the Unix compiler.
1058 Use of RTD is a selectable option, since it is incompatible with
1059 standard Unix calling sequences. If the option is not selected,
1060 the caller must always pop the args.
1062 The attribute stdcall is equivalent to RTD on a per module basis. */
1064 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) \
1065 (i386_return_pops_args (FUNDECL, FUNTYPE, SIZE))
1067 /* Define how to find the value returned by a function.
1068 VALTYPE is the data type of the value (as a tree).
1069 If the precise function being called is known, FUNC is its FUNCTION_DECL;
1070 otherwise, FUNC is 0. */
1071 #define FUNCTION_VALUE(VALTYPE, FUNC) \
1072 gen_rtx_REG (TYPE_MODE (VALTYPE), \
1073 VALUE_REGNO (TYPE_MODE (VALTYPE)))
1075 /* Define how to find the value returned by a library function
1076 assuming the value has mode MODE. */
1078 #define LIBCALL_VALUE(MODE) \
1079 gen_rtx_REG (MODE, VALUE_REGNO (MODE))
1081 /* Define the size of the result block used for communication between
1082 untyped_call and untyped_return. The block contains a DImode value
1083 followed by the block used by fnsave and frstor. */
1085 #define APPLY_RESULT_SIZE (8+108)
1087 /* 1 if N is a possible register number for function argument passing. */
1088 #define FUNCTION_ARG_REGNO_P(N) ((N) >= 0 && (N) < REGPARM_MAX)
1090 /* Define a data type for recording info about an argument list
1091 during the scan of that argument list. This data type should
1092 hold all necessary information about the function itself
1093 and about the args processed so far, enough to enable macros
1094 such as FUNCTION_ARG to determine where the next arg should go. */
1096 typedef struct i386_args {
1097 int words; /* # words passed so far */
1098 int nregs; /* # registers available for passing */
1099 int regno; /* next available register number */
1102 /* Initialize a variable CUM of type CUMULATIVE_ARGS
1103 for a call to a function whose data type is FNTYPE.
1104 For a library call, FNTYPE is 0. */
1106 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \
1107 (init_cumulative_args (&CUM, FNTYPE, LIBNAME))
1109 /* Update the data in CUM to advance over an argument
1110 of mode MODE and data type TYPE.
1111 (TYPE is null for libcalls where that information may not be available.) */
1113 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
1114 (function_arg_advance (&CUM, MODE, TYPE, NAMED))
1116 /* Define where to put the arguments to a function.
1117 Value is zero to push the argument on the stack,
1118 or a hard register in which to store the argument.
1120 MODE is the argument's machine mode.
1121 TYPE is the data type of the argument (as a tree).
1122 This is null for libcalls where that information may
1124 CUM is a variable of type CUMULATIVE_ARGS which gives info about
1125 the preceding args and about the function being called.
1126 NAMED is nonzero if this argument is a named parameter
1127 (otherwise it is an extra parameter matching an ellipsis). */
1129 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
1130 (function_arg (&CUM, MODE, TYPE, NAMED))
1132 /* For an arg passed partly in registers and partly in memory,
1133 this is the number of registers used.
1134 For args passed entirely in registers or entirely in memory, zero. */
1136 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
1137 (function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED))
1139 /* This macro is invoked just before the start of a function.
1140 It is used here to output code for -fpic that will load the
1141 return address into %ebx. */
1143 #undef ASM_OUTPUT_FUNCTION_PREFIX
1144 #define ASM_OUTPUT_FUNCTION_PREFIX(FILE, FNNAME) \
1145 asm_output_function_prefix (FILE, FNNAME)
1147 /* This macro generates the assembly code for function entry.
1148 FILE is a stdio stream to output the code to.
1149 SIZE is an int: how many units of temporary storage to allocate.
1150 Refer to the array `regs_ever_live' to determine which registers
1151 to save; `regs_ever_live[I]' is nonzero if register number I
1152 is ever used in the function. This macro is responsible for
1153 knowing which registers should not be saved even if used. */
1155 #define FUNCTION_PROLOGUE(FILE, SIZE) \
1156 function_prologue (FILE, SIZE)
1158 /* Output assembler code to FILE to increment profiler label # LABELNO
1159 for profiling a function entry. */
1161 #define FUNCTION_PROFILER(FILE, LABELNO) \
1165 fprintf (FILE, "\tleal %sP%d@GOTOFF(%%ebx),%%edx\n", \
1166 LPREFIX, (LABELNO)); \
1167 fprintf (FILE, "\tcall *_mcount@GOT(%%ebx)\n"); \
1171 fprintf (FILE, "\tmovl $%sP%d,%%edx\n", LPREFIX, (LABELNO)); \
1172 fprintf (FILE, "\tcall _mcount\n"); \
1177 /* There are three profiling modes for basic blocks available.
1178 The modes are selected at compile time by using the options
1179 -a or -ax of the gnu compiler.
1180 The variable `profile_block_flag' will be set according to the
1183 profile_block_flag == 0, no option used:
1187 profile_block_flag == 1, -a option used.
1189 Count frequency of execution of every basic block.
1191 profile_block_flag == 2, -ax option used.
1193 Generate code to allow several different profiling modes at run time.
1194 Available modes are:
1195 Produce a trace of all basic blocks.
1196 Count frequency of jump instructions executed.
1197 In every mode it is possible to start profiling upon entering
1198 certain functions and to disable profiling of some other functions.
1200 The result of basic-block profiling will be written to a file `bb.out'.
1201 If the -ax option is used parameters for the profiling will be read
1206 /* The following macro shall output assembler code to FILE
1207 to initialize basic-block profiling.
1209 If profile_block_flag == 2
1211 Output code to call the subroutine `__bb_init_trace_func'
1212 and pass two parameters to it. The first parameter is
1213 the address of a block allocated in the object module.
1214 The second parameter is the number of the first basic block
1217 The name of the block is a local symbol made with this statement:
1219 ASM_GENERATE_INTERNAL_LABEL (BUFFER, "LPBX", 0);
1221 Of course, since you are writing the definition of
1222 `ASM_GENERATE_INTERNAL_LABEL' as well as that of this macro, you
1223 can take a short cut in the definition of this macro and use the
1224 name that you know will result.
1226 The number of the first basic block of the function is
1227 passed to the macro in BLOCK_OR_LABEL.
1229 If described in a virtual assembler language the code to be
1233 parameter2 <- BLOCK_OR_LABEL
1234 call __bb_init_trace_func
1236 else if profile_block_flag != 0
1238 Output code to call the subroutine `__bb_init_func'
1239 and pass one single parameter to it, which is the same
1240 as the first parameter to `__bb_init_trace_func'.
1242 The first word of this parameter is a flag which will be nonzero if
1243 the object module has already been initialized. So test this word
1244 first, and do not call `__bb_init_func' if the flag is nonzero.
1245 Note: When profile_block_flag == 2 the test need not be done
1246 but `__bb_init_trace_func' *must* be called.
1248 BLOCK_OR_LABEL may be used to generate a label number as a
1249 branch destination in case `__bb_init_func' will not be called.
1251 If described in a virtual assembler language the code to be
1262 #undef FUNCTION_BLOCK_PROFILER
1263 #define FUNCTION_BLOCK_PROFILER(FILE, BLOCK_OR_LABEL) \
1266 static int num_func = 0; \
1268 char block_table[80], false_label[80]; \
1270 ASM_GENERATE_INTERNAL_LABEL (block_table, "LPBX", 0); \
1272 xops[1] = gen_rtx_SYMBOL_REF (VOIDmode, block_table); \
1273 xops[5] = stack_pointer_rtx; \
1274 xops[7] = gen_rtx_REG (Pmode, 0); /* eax */ \
1276 CONSTANT_POOL_ADDRESS_P (xops[1]) = TRUE; \
1278 switch (profile_block_flag) \
1283 xops[2] = GEN_INT ((BLOCK_OR_LABEL)); \
1284 xops[3] = gen_rtx_MEM (Pmode, gen_rtx_SYMBOL_REF (VOIDmode, "__bb_init_trace_func")); \
1285 xops[6] = GEN_INT (8); \
1287 output_asm_insn (AS1(push%L2,%2), xops); \
1289 output_asm_insn (AS1(push%L1,%1), xops); \
1292 output_asm_insn (AS2 (lea%L7,%a1,%7), xops); \
1293 output_asm_insn (AS1 (push%L7,%7), xops); \
1296 output_asm_insn (AS1(call,%P3), xops); \
1297 output_asm_insn (AS2(add%L0,%6,%5), xops); \
1303 ASM_GENERATE_INTERNAL_LABEL (false_label, "LPBZ", num_func); \
1305 xops[0] = const0_rtx; \
1306 xops[2] = gen_rtx_MEM (Pmode, gen_rtx_SYMBOL_REF (VOIDmode, false_label)); \
1307 xops[3] = gen_rtx_MEM (Pmode, gen_rtx_SYMBOL_REF (VOIDmode, "__bb_init_func")); \
1308 xops[4] = gen_rtx_MEM (Pmode, xops[1]); \
1309 xops[6] = GEN_INT (4); \
1311 CONSTANT_POOL_ADDRESS_P (xops[2]) = TRUE; \
1313 output_asm_insn (AS2(cmp%L4,%0,%4), xops); \
1314 output_asm_insn (AS1(jne,%2), xops); \
1317 output_asm_insn (AS1(push%L1,%1), xops); \
1320 output_asm_insn (AS2 (lea%L7,%a1,%7), xops); \
1321 output_asm_insn (AS1 (push%L7,%7), xops); \
1324 output_asm_insn (AS1(call,%P3), xops); \
1325 output_asm_insn (AS2(add%L0,%6,%5), xops); \
1326 ASM_OUTPUT_INTERNAL_LABEL (FILE, "LPBZ", num_func); \
1335 /* The following macro shall output assembler code to FILE
1336 to increment a counter associated with basic block number BLOCKNO.
1338 If profile_block_flag == 2
1340 Output code to initialize the global structure `__bb' and
1341 call the function `__bb_trace_func' which will increment the
1344 `__bb' consists of two words. In the first word the number
1345 of the basic block has to be stored. In the second word
1346 the address of a block allocated in the object module
1349 The basic block number is given by BLOCKNO.
1351 The address of the block is given by the label created with
1353 ASM_GENERATE_INTERNAL_LABEL (BUFFER, "LPBX", 0);
1355 by FUNCTION_BLOCK_PROFILER.
1357 Of course, since you are writing the definition of
1358 `ASM_GENERATE_INTERNAL_LABEL' as well as that of this macro, you
1359 can take a short cut in the definition of this macro and use the
1360 name that you know will result.
1362 If described in a virtual assembler language the code to be
1365 move BLOCKNO -> (__bb)
1366 move LPBX0 -> (__bb+4)
1367 call __bb_trace_func
1369 Note that function `__bb_trace_func' must not change the
1370 machine state, especially the flag register. To grant
1371 this, you must output code to save and restore registers
1372 either in this macro or in the macros MACHINE_STATE_SAVE
1373 and MACHINE_STATE_RESTORE. The last two macros will be
1374 used in the function `__bb_trace_func', so you must make
1375 sure that the function prologue does not change any
1376 register prior to saving it with MACHINE_STATE_SAVE.
1378 else if profile_block_flag != 0
1380 Output code to increment the counter directly.
1381 Basic blocks are numbered separately from zero within each
1382 compiled object module. The count associated with block number
1383 BLOCKNO is at index BLOCKNO in an array of words; the name of
1384 this array is a local symbol made with this statement:
1386 ASM_GENERATE_INTERNAL_LABEL (BUFFER, "LPBX", 2);
1388 Of course, since you are writing the definition of
1389 `ASM_GENERATE_INTERNAL_LABEL' as well as that of this macro, you
1390 can take a short cut in the definition of this macro and use the
1391 name that you know will result.
1393 If described in a virtual assembler language the code to be
1396 inc (LPBX2+4*BLOCKNO)
1400 #define BLOCK_PROFILER(FILE, BLOCKNO) \
1403 rtx xops[8], cnt_rtx; \
1405 char *block_table = counts; \
1407 switch (profile_block_flag) \
1412 ASM_GENERATE_INTERNAL_LABEL (block_table, "LPBX", 0); \
1414 xops[1] = gen_rtx_SYMBOL_REF (VOIDmode, block_table); \
1415 xops[2] = GEN_INT ((BLOCKNO)); \
1416 xops[3] = gen_rtx_MEM (Pmode, gen_rtx_SYMBOL_REF (VOIDmode, "__bb_trace_func")); \
1417 xops[4] = gen_rtx_SYMBOL_REF (VOIDmode, "__bb"); \
1418 xops[5] = plus_constant (xops[4], 4); \
1419 xops[0] = gen_rtx_MEM (SImode, xops[4]); \
1420 xops[6] = gen_rtx_MEM (SImode, xops[5]); \
1422 CONSTANT_POOL_ADDRESS_P (xops[1]) = TRUE; \
1424 fprintf(FILE, "\tpushf\n"); \
1425 output_asm_insn (AS2(mov%L0,%2,%0), xops); \
1428 xops[7] = gen_rtx_REG (Pmode, 0); /* eax */ \
1429 output_asm_insn (AS1(push%L7,%7), xops); \
1430 output_asm_insn (AS2(lea%L7,%a1,%7), xops); \
1431 output_asm_insn (AS2(mov%L6,%7,%6), xops); \
1432 output_asm_insn (AS1(pop%L7,%7), xops); \
1435 output_asm_insn (AS2(mov%L6,%1,%6), xops); \
1436 output_asm_insn (AS1(call,%P3), xops); \
1437 fprintf(FILE, "\tpopf\n"); \
1443 ASM_GENERATE_INTERNAL_LABEL (counts, "LPBX", 2); \
1444 cnt_rtx = gen_rtx_SYMBOL_REF (VOIDmode, counts); \
1445 SYMBOL_REF_FLAG (cnt_rtx) = TRUE; \
1448 cnt_rtx = plus_constant (cnt_rtx, (BLOCKNO)*4); \
1451 cnt_rtx = gen_rtx_PLUS (Pmode, pic_offset_table_rtx, cnt_rtx); \
1453 xops[0] = gen_rtx_MEM (SImode, cnt_rtx); \
1454 output_asm_insn (AS1(inc%L0,%0), xops); \
1462 /* The following macro shall output assembler code to FILE
1463 to indicate a return from function during basic-block profiling.
1465 If profiling_block_flag == 2:
1467 Output assembler code to call function `__bb_trace_ret'.
1469 Note that function `__bb_trace_ret' must not change the
1470 machine state, especially the flag register. To grant
1471 this, you must output code to save and restore registers
1472 either in this macro or in the macros MACHINE_STATE_SAVE_RET
1473 and MACHINE_STATE_RESTORE_RET. The last two macros will be
1474 used in the function `__bb_trace_ret', so you must make
1475 sure that the function prologue does not change any
1476 register prior to saving it with MACHINE_STATE_SAVE_RET.
1478 else if profiling_block_flag != 0:
1480 The macro will not be used, so it need not distinguish
1484 #define FUNCTION_BLOCK_PROFILER_EXIT(FILE) \
1489 xops[0] = gen_rtx_MEM (Pmode, gen_rtx_SYMBOL_REF (VOIDmode, "__bb_trace_ret")); \
1491 output_asm_insn (AS1(call,%P0), xops); \
1496 /* The function `__bb_trace_func' is called in every basic block
1497 and is not allowed to change the machine state. Saving (restoring)
1498 the state can either be done in the BLOCK_PROFILER macro,
1499 before calling function (rsp. after returning from function)
1500 `__bb_trace_func', or it can be done inside the function by
1501 defining the macros:
1503 MACHINE_STATE_SAVE(ID)
1504 MACHINE_STATE_RESTORE(ID)
1506 In the latter case care must be taken, that the prologue code
1507 of function `__bb_trace_func' does not already change the
1508 state prior to saving it with MACHINE_STATE_SAVE.
1510 The parameter `ID' is a string identifying a unique macro use.
1512 On the i386 the initialization code at the begin of
1513 function `__bb_trace_func' contains a `sub' instruction
1514 therefore we handle save and restore of the flag register
1515 in the BLOCK_PROFILER macro. */
1517 #define MACHINE_STATE_SAVE(ID) \
1518 asm (" pushl %eax"); \
1519 asm (" pushl %ecx"); \
1520 asm (" pushl %edx"); \
1521 asm (" pushl %esi");
1523 #define MACHINE_STATE_RESTORE(ID) \
1524 asm (" popl %esi"); \
1525 asm (" popl %edx"); \
1526 asm (" popl %ecx"); \
1529 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
1530 the stack pointer does not matter. The value is tested only in
1531 functions that have frame pointers.
1532 No definition is equivalent to always zero. */
1533 /* Note on the 386 it might be more efficient not to define this since
1534 we have to restore it ourselves from the frame pointer, in order to
1537 #define EXIT_IGNORE_STACK 1
1539 /* This macro generates the assembly code for function exit,
1540 on machines that need it. If FUNCTION_EPILOGUE is not defined
1541 then individual return instructions are generated for each
1542 return statement. Args are same as for FUNCTION_PROLOGUE.
1544 The function epilogue should not depend on the current stack pointer!
1545 It should use the frame pointer only. This is mandatory because
1546 of alloca; we also take advantage of it to omit stack adjustments
1549 If the last non-note insn in the function is a BARRIER, then there
1550 is no need to emit a function prologue, because control does not fall
1551 off the end. This happens if the function ends in an "exit" call, or
1552 if a `return' insn is emitted directly into the function. */
1555 #define FUNCTION_BEGIN_EPILOGUE(FILE) \
1557 rtx last = get_last_insn (); \
1558 if (last && GET_CODE (last) == NOTE) \
1559 last = prev_nonnote_insn (last); \
1560 /* if (! last || GET_CODE (last) != BARRIER) \
1561 function_epilogue (FILE, SIZE);*/ \
1565 #define FUNCTION_EPILOGUE(FILE, SIZE) \
1566 function_epilogue (FILE, SIZE)
1568 /* Output assembler code for a block containing the constant parts
1569 of a trampoline, leaving space for the variable parts. */
1571 /* On the 386, the trampoline contains two instructions:
1574 The trampoline is generated entirely at runtime. The operand of JMP
1575 is the address of FUNCTION relative to the instruction following the
1576 JMP (which is 5 bytes long). */
1578 /* Length in units of the trampoline for entering a nested function. */
1580 #define TRAMPOLINE_SIZE 10
1582 /* Emit RTL insns to initialize the variable parts of a trampoline.
1583 FNADDR is an RTX for the address of the function's pure code.
1584 CXT is an RTX for the static chain value for the function. */
1586 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1588 /* Compute offset from the end of the jmp to the target function. */ \
1589 rtx disp = expand_binop (SImode, sub_optab, FNADDR, \
1590 plus_constant (TRAMP, 10), \
1591 NULL_RTX, 1, OPTAB_DIRECT); \
1592 emit_move_insn (gen_rtx_MEM (QImode, TRAMP), GEN_INT (0xb9)); \
1593 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 1)), CXT); \
1594 emit_move_insn (gen_rtx_MEM (QImode, plus_constant (TRAMP, 5)), GEN_INT (0xe9));\
1595 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 6)), disp); \
1598 /* Definitions for register eliminations.
1600 This is an array of structures. Each structure initializes one pair
1601 of eliminable registers. The "from" register number is given first,
1602 followed by "to". Eliminations of the same "from" register are listed
1603 in order of preference.
1605 We have two registers that can be eliminated on the i386. First, the
1606 frame pointer register can often be eliminated in favor of the stack
1607 pointer register. Secondly, the argument pointer register can always be
1608 eliminated; it is replaced with either the stack or frame pointer. */
1610 #define ELIMINABLE_REGS \
1611 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
1612 { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
1613 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}}
1615 /* Given FROM and TO register numbers, say whether this elimination is allowed.
1616 Frame pointer elimination is automatically handled.
1618 For the i386, if frame pointer elimination is being done, we would like to
1619 convert ap into sp, not fp.
1621 All other eliminations are valid. */
1623 #define CAN_ELIMINATE(FROM, TO) \
1624 ((FROM) == ARG_POINTER_REGNUM && (TO) == STACK_POINTER_REGNUM \
1625 ? ! frame_pointer_needed \
1628 /* Define the offset between two registers, one to be eliminated, and the other
1629 its replacement, at the start of a routine. */
1631 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
1633 if ((FROM) == ARG_POINTER_REGNUM && (TO) == FRAME_POINTER_REGNUM) \
1634 (OFFSET) = 8; /* Skip saved PC and previous frame pointer */ \
1639 int preferred_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; \
1640 HOST_WIDE_INT tsize = ix86_compute_frame_size (get_frame_size (), \
1643 (OFFSET) = (tsize + nregs * UNITS_PER_WORD); \
1646 if (frame_pointer_needed) \
1647 offset += UNITS_PER_WORD; \
1649 if ((FROM) == ARG_POINTER_REGNUM) \
1650 (OFFSET) += offset; \
1652 (OFFSET) -= ((offset + preferred_alignment - 1) \
1653 & -preferred_alignment) - offset; \
1657 /* Addressing modes, and classification of registers for them. */
1659 /* #define HAVE_POST_INCREMENT 0 */
1660 /* #define HAVE_POST_DECREMENT 0 */
1662 /* #define HAVE_PRE_DECREMENT 0 */
1663 /* #define HAVE_PRE_INCREMENT 0 */
1665 /* Macros to check register numbers against specific register classes. */
1667 /* These assume that REGNO is a hard or pseudo reg number.
1668 They give nonzero only if REGNO is a hard reg of the suitable class
1669 or a pseudo reg currently allocated to a suitable hard reg.
1670 Since they use reg_renumber, they are safe only once reg_renumber
1671 has been allocated, which happens in local-alloc.c. */
1673 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1674 ((REGNO) < STACK_POINTER_REGNUM \
1675 || (unsigned) reg_renumber[REGNO] < STACK_POINTER_REGNUM)
1677 #define REGNO_OK_FOR_BASE_P(REGNO) \
1678 ((REGNO) <= STACK_POINTER_REGNUM \
1679 || (REGNO) == ARG_POINTER_REGNUM \
1680 || (unsigned) reg_renumber[REGNO] <= STACK_POINTER_REGNUM)
1682 #define REGNO_OK_FOR_SIREG_P(REGNO) ((REGNO) == 4 || reg_renumber[REGNO] == 4)
1683 #define REGNO_OK_FOR_DIREG_P(REGNO) ((REGNO) == 5 || reg_renumber[REGNO] == 5)
1685 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1686 and check its validity for a certain class.
1687 We have two alternate definitions for each of them.
1688 The usual definition accepts all pseudo regs; the other rejects
1689 them unless they have been allocated suitable hard regs.
1690 The symbol REG_OK_STRICT causes the latter definition to be used.
1692 Most source files want to accept pseudo regs in the hope that
1693 they will get allocated to the class that the insn wants them to be in.
1694 Source files for reload pass need to be strict.
1695 After reload, it makes no difference, since pseudo regs have
1696 been eliminated by then. */
1699 /* Non strict versions, pseudos are ok */
1700 #define REG_OK_FOR_INDEX_NONSTRICT_P(X) \
1701 (REGNO (X) < STACK_POINTER_REGNUM \
1702 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1704 #define REG_OK_FOR_BASE_NONSTRICT_P(X) \
1705 (REGNO (X) <= STACK_POINTER_REGNUM \
1706 || REGNO (X) == ARG_POINTER_REGNUM \
1707 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1709 #define REG_OK_FOR_STRREG_NONSTRICT_P(X) \
1710 (REGNO (X) == 4 || REGNO (X) == 5 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1712 /* Strict versions, hard registers only */
1713 #define REG_OK_FOR_INDEX_STRICT_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1714 #define REG_OK_FOR_BASE_STRICT_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1715 #define REG_OK_FOR_STRREG_STRICT_P(X) \
1716 (REGNO_OK_FOR_DIREG_P (REGNO (X)) || REGNO_OK_FOR_SIREG_P (REGNO (X)))
1718 #ifndef REG_OK_STRICT
1719 #define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_INDEX_NONSTRICT_P(X)
1720 #define REG_OK_FOR_BASE_P(X) REG_OK_FOR_BASE_NONSTRICT_P(X)
1721 #define REG_OK_FOR_STRREG_P(X) REG_OK_FOR_STRREG_NONSTRICT_P(X)
1724 #define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_INDEX_STRICT_P(X)
1725 #define REG_OK_FOR_BASE_P(X) REG_OK_FOR_BASE_STRICT_P(X)
1726 #define REG_OK_FOR_STRREG_P(X) REG_OK_FOR_STRREG_STRICT_P(X)
1729 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1730 that is a valid memory address for an instruction.
1731 The MODE argument is the machine mode for the MEM expression
1732 that wants to use this address.
1734 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
1735 except for CONSTANT_ADDRESS_P which is usually machine-independent.
1737 See legitimize_pic_address in i386.c for details as to what
1738 constitutes a legitimate address when -fpic is used. */
1740 #define MAX_REGS_PER_ADDRESS 2
1742 #define CONSTANT_ADDRESS_P(X) \
1743 (GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1744 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST)
1746 /* Nonzero if the constant value X is a legitimate general operand.
1747 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1749 #define LEGITIMATE_CONSTANT_P(X) \
1750 (GET_CODE (X) == CONST_DOUBLE ? standard_80387_constant_p (X) : 1)
1752 #ifdef REG_OK_STRICT
1753 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1755 if (legitimate_address_p (MODE, X, 1)) \
1760 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1762 if (legitimate_address_p (MODE, X, 0)) \
1768 /* Try machine-dependent ways of modifying an illegitimate address
1769 to be legitimate. If we find one, return the new, valid address.
1770 This macro is used in only one place: `memory_address' in explow.c.
1772 OLDX is the address as it was before break_out_memory_refs was called.
1773 In some cases it is useful to look at this to decide what needs to be done.
1775 MODE and WIN are passed so that this macro can use
1776 GO_IF_LEGITIMATE_ADDRESS.
1778 It is always safe for this macro to do nothing. It exists to recognize
1779 opportunities to optimize the output.
1781 For the 80386, we handle X+REG by loading X into a register R and
1782 using R+REG. R will go in a general reg and indexing will be used.
1783 However, if REG is a broken-out memory address or multiplication,
1784 nothing needs to be done because REG can certainly go in a general reg.
1786 When -fpic is used, special handling is needed for symbolic references.
1787 See comments by legitimize_pic_address in i386.c for details. */
1789 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1791 (X) = legitimize_address (X, OLDX, MODE); \
1792 if (memory_address_p (MODE, X)) \
1796 #define REWRITE_ADDRESS(x) rewrite_address(x)
1798 /* Nonzero if the constant value X is a legitimate general operand
1799 when generating PIC code. It is given that flag_pic is on and
1800 that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1802 #define LEGITIMATE_PIC_OPERAND_P(X) \
1803 (! SYMBOLIC_CONST (X) || legitimate_pic_address_disp_p (X))
1805 #define SYMBOLIC_CONST(X) \
1806 (GET_CODE (X) == SYMBOL_REF \
1807 || GET_CODE (X) == LABEL_REF \
1808 || (GET_CODE (X) == CONST && symbolic_reference_mentioned_p (X)))
1810 /* Go to LABEL if ADDR (a legitimate address expression)
1811 has an effect that depends on the machine mode it is used for.
1812 On the 80386, only postdecrement and postincrement address depend thus
1813 (the amount of decrement or increment being the length of the operand). */
1814 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1815 if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == POST_DEC) goto LABEL
1817 /* Define this macro if references to a symbol must be treated
1818 differently depending on something about the variable or
1819 function named by the symbol (such as what section it is in).
1821 On i386, if using PIC, mark a SYMBOL_REF for a non-global symbol
1822 so that we may access it directly in the GOT. */
1824 #define ENCODE_SECTION_INFO(DECL) \
1829 rtx rtl = (TREE_CODE_CLASS (TREE_CODE (DECL)) != 'd' \
1830 ? TREE_CST_RTL (DECL) : DECL_RTL (DECL)); \
1832 if (TARGET_DEBUG_ADDR \
1833 && TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') \
1835 fprintf (stderr, "Encode %s, public = %d\n", \
1836 IDENTIFIER_POINTER (DECL_NAME (DECL)), \
1837 TREE_PUBLIC (DECL)); \
1840 SYMBOL_REF_FLAG (XEXP (rtl, 0)) \
1841 = (TREE_CODE_CLASS (TREE_CODE (DECL)) != 'd' \
1842 || ! TREE_PUBLIC (DECL)); \
1847 /* Initialize data used by insn expanders. This is called from
1848 init_emit, once for each function, before code is generated.
1849 For 386, clear stack slot assignments remembered from previous
1852 #define INIT_EXPANDERS clear_386_stack_locals ()
1854 /* The `FINALIZE_PIC' macro serves as a hook to emit these special
1855 codes once the function is being compiled into assembly code, but
1856 not before. (It is not done before, because in the case of
1857 compiling an inline function, it would lead to multiple PIC
1858 prologues being included in functions which used inline functions
1859 and were compiled to assembly language.) */
1861 #define FINALIZE_PIC \
1864 extern int current_function_uses_pic_offset_table; \
1866 current_function_uses_pic_offset_table |= profile_flag | profile_block_flag; \
1871 /* If defined, a C expression whose value is nonzero if IDENTIFIER
1872 with arguments ARGS is a valid machine specific attribute for DECL.
1873 The attributes in ATTRIBUTES have previously been assigned to DECL. */
1875 #define VALID_MACHINE_DECL_ATTRIBUTE(DECL, ATTRIBUTES, NAME, ARGS) \
1876 (i386_valid_decl_attribute_p (DECL, ATTRIBUTES, NAME, ARGS))
1878 /* If defined, a C expression whose value is nonzero if IDENTIFIER
1879 with arguments ARGS is a valid machine specific attribute for TYPE.
1880 The attributes in ATTRIBUTES have previously been assigned to TYPE. */
1882 #define VALID_MACHINE_TYPE_ATTRIBUTE(TYPE, ATTRIBUTES, NAME, ARGS) \
1883 (i386_valid_type_attribute_p (TYPE, ATTRIBUTES, NAME, ARGS))
1885 /* If defined, a C expression whose value is zero if the attributes on
1886 TYPE1 and TYPE2 are incompatible, one if they are compatible, and
1887 two if they are nearly compatible (which causes a warning to be
1890 #define COMP_TYPE_ATTRIBUTES(TYPE1, TYPE2) \
1891 (i386_comp_type_attributes (TYPE1, TYPE2))
1893 /* If defined, a C statement that assigns default attributes to newly
1896 /* #define SET_DEFAULT_TYPE_ATTRIBUTES (TYPE) */
1898 /* Max number of args passed in registers. If this is more than 3, we will
1899 have problems with ebx (register #4), since it is a caller save register and
1900 is also used as the pic register in ELF. So for now, don't allow more than
1901 3 registers to be passed in registers. */
1903 #define REGPARM_MAX 3
1906 /* Specify the machine mode that this machine uses
1907 for the index in the tablejump instruction. */
1908 #define CASE_VECTOR_MODE Pmode
1910 /* Define as C expression which evaluates to nonzero if the tablejump
1911 instruction expects the table to contain offsets from the address of the
1913 Do not define this if the table should contain absolute addresses. */
1914 /* #define CASE_VECTOR_PC_RELATIVE 1 */
1916 /* Specify the tree operation to be used to convert reals to integers.
1917 This should be changed to take advantage of fist --wfs ??
1919 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
1921 /* This is the kind of divide that is easiest to do in the general case. */
1922 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
1924 /* Define this as 1 if `char' should by default be signed; else as 0. */
1925 #define DEFAULT_SIGNED_CHAR 1
1927 /* Max number of bytes we can move from memory to memory
1928 in one reasonably fast instruction. */
1931 /* If a memory-to-memory move would take MOVE_RATIO or more simple
1932 move-instruction pairs, we will do a movstr or libcall instead.
1933 Increasing the value will always make code faster, but eventually
1934 incurs high cost in increased code size.
1936 If you don't define this, a reasonable default is used.
1938 Make this large on i386, since the block move is very inefficient with small
1939 blocks, and the hard register needs of the block move require much reload
1942 #define MOVE_RATIO 5
1944 /* Define if shifts truncate the shift count
1945 which implies one can omit a sign-extension or zero-extension
1946 of a shift count. */
1947 /* On i386, shifts do truncate the count. But bit opcodes don't. */
1949 /* #define SHIFT_COUNT_TRUNCATED */
1951 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1952 is done just by pretending it is already truncated. */
1953 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1955 /* We assume that the store-condition-codes instructions store 0 for false
1956 and some other value for true. This is the value stored for true. */
1958 #define STORE_FLAG_VALUE 1
1960 /* When a prototype says `char' or `short', really pass an `int'.
1961 (The 386 can't easily push less than an int.) */
1963 #define PROMOTE_PROTOTYPES
1965 /* Specify the machine mode that pointers have.
1966 After generation of rtl, the compiler makes no further distinction
1967 between pointers and any other objects of this machine mode. */
1968 #define Pmode SImode
1970 /* A function address in a call instruction
1971 is a byte address (for indexing purposes)
1972 so give the MEM rtx a byte's mode. */
1973 #define FUNCTION_MODE QImode
1975 /* A part of a C `switch' statement that describes the relative costs
1976 of constant RTL expressions. It must contain `case' labels for
1977 expression codes `const_int', `const', `symbol_ref', `label_ref'
1978 and `const_double'. Each case must ultimately reach a `return'
1979 statement to return the relative cost of the use of that kind of
1980 constant value in an expression. The cost may depend on the
1981 precise value of the constant, which is available for examination
1982 in X, and the rtx code of the expression in which it is contained,
1983 found in OUTER_CODE.
1985 CODE is the expression code--redundant, since it can be obtained
1986 with `GET_CODE (X)'. */
1988 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
1990 return (unsigned) INTVAL (RTX) < 256 ? 0 : 1; \
1994 return flag_pic && SYMBOLIC_CONST (RTX) ? 2 : 1; \
1996 case CONST_DOUBLE: \
1999 if (GET_MODE (RTX) == VOIDmode) \
2002 code = standard_80387_constant_p (RTX); \
2003 return code == 1 ? 0 : \
2008 /* Delete the definition here when TOPLEVEL_COSTS_N_INSNS gets added to cse.c */
2009 #define TOPLEVEL_COSTS_N_INSNS(N) {total = COSTS_N_INSNS (N); break;}
2011 /* Like `CONST_COSTS' but applies to nonconstant RTL expressions.
2012 This can be used, for example, to indicate how costly a multiply
2013 instruction is. In writing this macro, you can use the construct
2014 `COSTS_N_INSNS (N)' to specify a cost equal to N fast
2015 instructions. OUTER_CODE is the code of the expression in which X
2018 This macro is optional; do not define it if the default cost
2019 assumptions are adequate for the target machine. */
2021 #define RTX_COSTS(X,CODE,OUTER_CODE) \
2023 if (GET_CODE (XEXP (X, 1)) == CONST_INT \
2024 && GET_MODE (XEXP (X, 0)) == SImode) \
2026 HOST_WIDE_INT value = INTVAL (XEXP (X, 1)); \
2029 return COSTS_N_INSNS (ix86_cost->add) \
2030 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2032 if (value == 2 || value == 3) \
2033 return COSTS_N_INSNS (ix86_cost->lea) \
2034 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2036 /* fall through */ \
2042 if (GET_MODE (XEXP (X, 0)) == DImode) \
2044 if (GET_CODE (XEXP (X, 1)) == CONST_INT) \
2046 if (INTVAL (XEXP (X, 1)) > 32) \
2047 return COSTS_N_INSNS(ix86_cost->shift_const + 2); \
2048 return COSTS_N_INSNS(ix86_cost->shift_const * 2); \
2050 return ((GET_CODE (XEXP (X, 1)) == AND \
2051 ? COSTS_N_INSNS(ix86_cost->shift_var * 2) \
2052 : COSTS_N_INSNS(ix86_cost->shift_var * 6 + 2)) \
2053 + rtx_cost(XEXP (X, 0), OUTER_CODE)); \
2055 return COSTS_N_INSNS (GET_CODE (XEXP (X, 1)) == CONST_INT \
2056 ? ix86_cost->shift_const \
2057 : ix86_cost->shift_var) \
2058 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2061 if (GET_CODE (XEXP (X, 1)) == CONST_INT) \
2063 unsigned HOST_WIDE_INT value = INTVAL (XEXP (X, 1)); \
2067 return COSTS_N_INSNS (ix86_cost->add) \
2068 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2069 if (value == 4 || value == 8) \
2070 return COSTS_N_INSNS (ix86_cost->lea) \
2071 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2073 while (value != 0) \
2080 return COSTS_N_INSNS (ix86_cost->shift_const) \
2081 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2083 return COSTS_N_INSNS (ix86_cost->mult_init \
2084 + nbits * ix86_cost->mult_bit) \
2085 + rtx_cost(XEXP (X, 0), OUTER_CODE); \
2088 else /* This is arbitrary */ \
2089 TOPLEVEL_COSTS_N_INSNS (ix86_cost->mult_init \
2090 + 7 * ix86_cost->mult_bit); \
2096 TOPLEVEL_COSTS_N_INSNS (ix86_cost->divide); \
2099 if (GET_CODE (XEXP (X, 0)) == REG \
2100 && GET_MODE (XEXP (X, 0)) == SImode \
2101 && GET_CODE (XEXP (X, 1)) == PLUS) \
2102 return COSTS_N_INSNS (ix86_cost->lea); \
2104 /* fall through */ \
2109 if (GET_MODE (X) == DImode) \
2110 return COSTS_N_INSNS (ix86_cost->add) * 2 \
2111 + (rtx_cost (XEXP (X, 0), OUTER_CODE) \
2112 << (GET_MODE (XEXP (X, 0)) != DImode)) \
2113 + (rtx_cost (XEXP (X, 1), OUTER_CODE) \
2114 << (GET_MODE (XEXP (X, 1)) != DImode)); \
2117 if (GET_MODE (X) == DImode) \
2118 TOPLEVEL_COSTS_N_INSNS (ix86_cost->add * 2) \
2119 TOPLEVEL_COSTS_N_INSNS (ix86_cost->add)
2122 /* An expression giving the cost of an addressing mode that contains
2123 ADDRESS. If not defined, the cost is computed from the ADDRESS
2124 expression and the `CONST_COSTS' values.
2126 For most CISC machines, the default cost is a good approximation
2127 of the true cost of the addressing mode. However, on RISC
2128 machines, all instructions normally have the same length and
2129 execution time. Hence all addresses will have equal costs.
2131 In cases where more than one form of an address is known, the form
2132 with the lowest cost will be used. If multiple forms have the
2133 same, lowest, cost, the one that is the most complex will be used.
2135 For example, suppose an address that is equal to the sum of a
2136 register and a constant is used twice in the same basic block.
2137 When this macro is not defined, the address will be computed in a
2138 register and memory references will be indirect through that
2139 register. On machines where the cost of the addressing mode
2140 containing the sum is no higher than that of a simple indirect
2141 reference, this will produce an additional instruction and
2142 possibly require an additional register. Proper specification of
2143 this macro eliminates this overhead for such machines.
2145 Similar use of this macro is made in strength reduction of loops.
2147 ADDRESS need not be valid as an address. In such a case, the cost
2148 is not relevant and can be any value; invalid addresses need not be
2149 assigned a different cost.
2151 On machines where an address involving more than one register is as
2152 cheap as an address computation involving only one register,
2153 defining `ADDRESS_COST' to reflect this can cause two registers to
2154 be live over a region of code where only one would have been if
2155 `ADDRESS_COST' were not defined in that manner. This effect should
2156 be considered in the definition of this macro. Equivalent costs
2157 should probably only be given to addresses with different numbers
2158 of registers on machines with lots of registers.
2160 This macro will normally either not be defined or be defined as a
2163 For i386, it is better to use a complex address than let gcc copy
2164 the address into a reg and make a new pseudo. But not if the address
2165 requires to two regs - that would mean more pseudos with longer
2168 #define ADDRESS_COST(RTX) \
2169 ((CONSTANT_P (RTX) \
2170 || (GET_CODE (RTX) == PLUS && CONSTANT_P (XEXP (RTX, 1)) \
2171 && REG_P (XEXP (RTX, 0)))) ? 0 \
2175 /* A C expression for the cost of moving data of mode M between a
2176 register and memory. A value of 2 is the default; this cost is
2177 relative to those in `REGISTER_MOVE_COST'.
2179 If moving between registers and memory is more expensive than
2180 between two registers, you should define this macro to express the
2183 On the i386, copying between floating-point and fixed-point
2184 registers is expensive. */
2186 #define REGISTER_MOVE_COST(CLASS1, CLASS2) \
2187 (((FLOAT_CLASS_P (CLASS1) && ! FLOAT_CLASS_P (CLASS2)) \
2188 || (! FLOAT_CLASS_P (CLASS1) && FLOAT_CLASS_P (CLASS2))) ? 10 \
2192 /* A C expression for the cost of moving data of mode M between a
2193 register and memory. A value of 2 is the default; this cost is
2194 relative to those in `REGISTER_MOVE_COST'.
2196 If moving between registers and memory is more expensive than
2197 between two registers, you should define this macro to express the
2200 /* #define MEMORY_MOVE_COST(M,C,I) 2 */
2202 /* A C expression for the cost of a branch instruction. A value of 1
2203 is the default; other values are interpreted relative to that. */
2205 #define BRANCH_COST i386_branch_cost
2207 /* Define this macro as a C expression which is nonzero if accessing
2208 less than a word of memory (i.e. a `char' or a `short') is no
2209 faster than accessing a word of memory, i.e., if such access
2210 require more than one instruction or if there is no difference in
2211 cost between byte and (aligned) word loads.
2213 When this macro is not defined, the compiler will access a field by
2214 finding the smallest containing object; when it is defined, a
2215 fullword load will be used if alignment permits. Unless bytes
2216 accesses are faster than word accesses, using word accesses is
2217 preferable since it may eliminate subsequent memory access if
2218 subsequent accesses occur to other fields in the same word of the
2219 structure, but to different bytes. */
2221 #define SLOW_BYTE_ACCESS 0
2223 /* Nonzero if access to memory by shorts is slow and undesirable. */
2224 #define SLOW_SHORT_ACCESS 0
2226 /* Define this macro if zero-extension (of a `char' or `short' to an
2227 `int') can be done faster if the destination is a register that is
2230 If you define this macro, you must have instruction patterns that
2231 recognize RTL structures like this:
2233 (set (strict_low_part (subreg:QI (reg:SI ...) 0)) ...)
2235 and likewise for `HImode'. */
2237 /* #define SLOW_ZERO_EXTEND */
2239 /* Define this macro to be the value 1 if unaligned accesses have a
2240 cost many times greater than aligned accesses, for example if they
2241 are emulated in a trap handler.
2243 When this macro is non-zero, the compiler will act as if
2244 `STRICT_ALIGNMENT' were non-zero when generating code for block
2245 moves. This can cause significantly more instructions to be
2246 produced. Therefore, do not set this macro non-zero if unaligned
2247 accesses only add a cycle or two to the time for a memory access.
2249 If the value of this macro is always zero, it need not be defined. */
2251 /* #define SLOW_UNALIGNED_ACCESS 0 */
2253 /* Define this macro to inhibit strength reduction of memory
2254 addresses. (On some machines, such strength reduction seems to do
2255 harm rather than good.) */
2257 /* #define DONT_REDUCE_ADDR */
2259 /* Define this macro if it is as good or better to call a constant
2260 function address than to call an address kept in a register.
2262 Desirable on the 386 because a CALL with a constant address is
2263 faster than one with a register address. */
2265 #define NO_FUNCTION_CSE
2267 /* Define this macro if it is as good or better for a function to call
2268 itself with an explicit address than to call an address kept in a
2271 #define NO_RECURSIVE_FUNCTION_CSE
2273 /* A C statement (sans semicolon) to update the integer variable COST
2274 based on the relationship between INSN that is dependent on
2275 DEP_INSN through the dependence LINK. The default is to make no
2276 adjustment to COST. This can be used for example to specify to
2277 the scheduler that an output- or anti-dependence does not incur
2278 the same cost as a data-dependence. */
2280 #define ADJUST_COST(insn,link,dep_insn,cost) \
2281 (cost) = x86_adjust_cost(insn, link, dep_insn, cost)
2283 #define ADJUST_BLOCKAGE(last_insn,insn,blockage) \
2285 if (is_fp_store (last_insn) && is_fp_insn (insn) \
2286 && NEXT_INSN (last_insn) && NEXT_INSN (NEXT_INSN (last_insn)) \
2287 && NEXT_INSN (NEXT_INSN (NEXT_INSN (last_insn))) \
2288 && (GET_CODE (NEXT_INSN (last_insn)) == INSN) \
2289 && (GET_CODE (NEXT_INSN (NEXT_INSN (last_insn))) == JUMP_INSN) \
2290 && (GET_CODE (NEXT_INSN (NEXT_INSN (NEXT_INSN (last_insn)))) == NOTE) \
2291 && (NOTE_LINE_NUMBER (NEXT_INSN (NEXT_INSN (NEXT_INSN (last_insn)))) \
2292 == NOTE_INSN_LOOP_END)) \
2298 #define ISSUE_RATE ((int)ix86_cpu > (int)PROCESSOR_I486 ? 2 : 1)
2301 /* Add any extra modes needed to represent the condition code.
2303 For the i386, we need separate modes when floating-point equality
2304 comparisons are being done. */
2306 #define EXTRA_CC_MODES CCFPEQmode
2308 /* Define the names for the modes specified above. */
2309 #define EXTRA_CC_NAMES "CCFPEQ"
2311 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
2312 return the mode to be used for the comparison.
2314 For floating-point equality comparisons, CCFPEQmode should be used.
2315 VOIDmode should be used in all other cases. */
2317 #define SELECT_CC_MODE(OP,X,Y) \
2318 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT \
2319 && ((OP) == EQ || (OP) == NE) ? CCFPEQmode : VOIDmode)
2321 /* Define the information needed to generate branch and scc insns. This is
2322 stored from the compare operation. Note that we can't use "rtx" here
2323 since it hasn't been defined! */
2325 extern struct rtx_def *(*i386_compare_gen)(), *(*i386_compare_gen_eq)();
2327 /* Tell final.c how to eliminate redundant test instructions. */
2329 /* Here we define machine-dependent flags and fields in cc_status
2330 (see `conditions.h'). */
2332 /* Set if the cc value was actually from the 80387 and
2333 we are testing eax directly (i.e. no sahf) */
2334 #define CC_TEST_AX 020000
2336 /* Set if the cc value is actually in the 80387, so a floating point
2337 conditional branch must be output. */
2338 #define CC_IN_80387 04000
2340 /* Set if the CC value was stored in a nonstandard way, so that
2341 the state of equality is indicated by zero in the carry bit. */
2342 #define CC_Z_IN_NOT_C 010000
2344 /* Set if the CC value was actually from the 80387 and loaded directly
2345 into the eflags instead of via eax/sahf. */
2346 #define CC_FCOMI 040000
2348 /* Store in cc_status the expressions
2349 that the condition codes will describe
2350 after execution of an instruction whose pattern is EXP.
2351 Do not alter them if the instruction would not alter the cc's. */
2353 #define NOTICE_UPDATE_CC(EXP, INSN) \
2354 notice_update_cc((EXP))
2356 /* Output a signed jump insn. Use template NORMAL ordinarily, or
2357 FLOAT following a floating point comparison.
2358 Use NO_OV following an arithmetic insn that set the cc's
2359 before a test insn that was deleted.
2360 NO_OV may be zero, meaning final should reinsert the test insn
2361 because the jump cannot be handled properly without it. */
2363 #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
2365 if (cc_prev_status.flags & CC_IN_80387) \
2367 if (cc_prev_status.flags & CC_NO_OVERFLOW) \
2372 /* Control the assembler format that we output, to the extent
2373 this does not vary between assemblers. */
2375 /* How to refer to registers in assembler output.
2376 This sequence is indexed by compiler's hard-register-number (see above). */
2378 /* In order to refer to the first 8 regs as 32 bit regs prefix an "e"
2379 For non floating point regs, the following are the HImode names.
2381 For float regs, the stack top is sometimes referred to as "%st(0)"
2382 instead of just "%st". PRINT_REG handles this with the "y" code. */
2384 #define HI_REGISTER_NAMES \
2385 {"ax","dx","cx","bx","si","di","bp","sp", \
2386 "st","st(1)","st(2)","st(3)","st(4)","st(5)","st(6)","st(7)","" }
2388 #define REGISTER_NAMES HI_REGISTER_NAMES
2390 /* Table of additional register names to use in user input. */
2392 #define ADDITIONAL_REGISTER_NAMES \
2393 { { "eax", 0 }, { "edx", 1 }, { "ecx", 2 }, { "ebx", 3 }, \
2394 { "esi", 4 }, { "edi", 5 }, { "ebp", 6 }, { "esp", 7 }, \
2395 { "al", 0 }, { "dl", 1 }, { "cl", 2 }, { "bl", 3 }, \
2396 { "ah", 0 }, { "dh", 1 }, { "ch", 2 }, { "bh", 3 } }
2398 /* Note we are omitting these since currently I don't know how
2399 to get gcc to use these, since they want the same but different
2400 number as al, and ax.
2403 /* note the last four are not really qi_registers, but
2404 the md will have to never output movb into one of them
2405 only a movw . There is no movb into the last four regs */
2407 #define QI_REGISTER_NAMES \
2408 {"al", "dl", "cl", "bl", "si", "di", "bp", "sp",}
2410 /* These parallel the array above, and can be used to access bits 8:15
2411 of regs 0 through 3. */
2413 #define QI_HIGH_REGISTER_NAMES \
2414 {"ah", "dh", "ch", "bh", }
2416 /* How to renumber registers for dbx and gdb. */
2418 /* {0,2,1,3,6,7,4,5,12,13,14,15,16,17} */
2419 #define DBX_REGISTER_NUMBER(n) \
2430 /* Before the prologue, RA is at 0(%esp). */
2431 #define INCOMING_RETURN_ADDR_RTX \
2432 gen_rtx_MEM (VOIDmode, gen_rtx_REG (VOIDmode, STACK_POINTER_REGNUM))
2434 /* After the prologue, RA is at -4(AP) in the current frame. */
2435 #define RETURN_ADDR_RTX(COUNT, FRAME) \
2437 ? gen_rtx_MEM (Pmode, gen_rtx_PLUS (Pmode, arg_pointer_rtx, GEN_INT(-4)))\
2438 : gen_rtx_MEM (Pmode, gen_rtx_PLUS (Pmode, (FRAME), GEN_INT(4))))
2440 /* PC is dbx register 8; let's use that column for RA. */
2441 #define DWARF_FRAME_RETURN_COLUMN 8
2443 /* Before the prologue, the top of the frame is at 4(%esp). */
2444 #define INCOMING_FRAME_SP_OFFSET 4
2446 /* This is how to output the definition of a user-level label named NAME,
2447 such as the label on a static function or variable NAME. */
2449 #define ASM_OUTPUT_LABEL(FILE,NAME) \
2450 (assemble_name (FILE, NAME), fputs (":\n", FILE))
2452 /* This is how to output an assembler line defining a `double' constant. */
2454 #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
2456 REAL_VALUE_TO_TARGET_DOUBLE (VALUE, l); \
2457 fprintf (FILE, "%s 0x%lx,0x%lx\n", ASM_LONG, l[0], l[1]); \
2460 /* This is how to output a `long double' extended real constant. */
2462 #undef ASM_OUTPUT_LONG_DOUBLE
2463 #define ASM_OUTPUT_LONG_DOUBLE(FILE,VALUE) \
2465 REAL_VALUE_TO_TARGET_LONG_DOUBLE (VALUE, l); \
2466 fprintf (FILE, "%s 0x%lx,0x%lx,0x%lx\n", ASM_LONG, l[0], l[1], l[2]); \
2469 /* This is how to output an assembler line defining a `float' constant. */
2471 #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
2473 REAL_VALUE_TO_TARGET_SINGLE (VALUE, l); \
2474 fprintf ((FILE), "%s 0x%lx\n", ASM_LONG, l); \
2477 /* Store in OUTPUT a string (made with alloca) containing
2478 an assembler-name for a local static variable named NAME.
2479 LABELNO is an integer which is different for each call. */
2481 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
2482 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
2483 sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
2487 /* This is how to output an assembler line defining an `int' constant. */
2489 #define ASM_OUTPUT_INT(FILE,VALUE) \
2490 ( fprintf (FILE, "%s ", ASM_LONG), \
2491 output_addr_const (FILE,(VALUE)), \
2494 /* Likewise for `char' and `short' constants. */
2495 /* is this supposed to do align too?? */
2497 #define ASM_OUTPUT_SHORT(FILE,VALUE) \
2498 ( fprintf (FILE, "%s ", ASM_SHORT), \
2499 output_addr_const (FILE,(VALUE)), \
2503 #define ASM_OUTPUT_SHORT(FILE,VALUE) \
2504 ( fprintf (FILE, "%s ", ASM_BYTE_OP), \
2505 output_addr_const (FILE,(VALUE)), \
2506 fputs (",", FILE), \
2507 output_addr_const (FILE,(VALUE)), \
2508 fputs (" >> 8\n",FILE))
2512 #define ASM_OUTPUT_CHAR(FILE,VALUE) \
2513 ( fprintf (FILE, "%s ", ASM_BYTE_OP), \
2514 output_addr_const (FILE, (VALUE)), \
2517 /* This is how to output an assembler line for a numeric constant byte. */
2519 #define ASM_OUTPUT_BYTE(FILE,VALUE) \
2520 fprintf ((FILE), "%s 0x%x\n", ASM_BYTE_OP, (VALUE))
2522 /* This is how to output an insn to push a register on the stack.
2523 It need not be very fast code. */
2525 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
2526 fprintf (FILE, "\tpushl %%e%s\n", reg_names[REGNO])
2528 /* This is how to output an insn to pop a register from the stack.
2529 It need not be very fast code. */
2531 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
2532 fprintf (FILE, "\tpopl %%e%s\n", reg_names[REGNO])
2534 /* This is how to output an element of a case-vector that is absolute.
2537 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
2538 fprintf (FILE, "%s %s%d\n", ASM_LONG, LPREFIX, VALUE)
2540 /* This is how to output an element of a case-vector that is relative.
2541 We don't use these on the 386 yet, because the ATT assembler can't do
2542 forward reference the differences.
2545 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
2546 fprintf (FILE, "\t.word %s%d-%s%d\n",LPREFIX, VALUE,LPREFIX, REL)
2548 /* Define the parentheses used to group arithmetic operations
2549 in assembler code. */
2551 #define ASM_OPEN_PAREN ""
2552 #define ASM_CLOSE_PAREN ""
2554 /* Define results of standard character escape sequences. */
2555 #define TARGET_BELL 007
2556 #define TARGET_BS 010
2557 #define TARGET_TAB 011
2558 #define TARGET_NEWLINE 012
2559 #define TARGET_VT 013
2560 #define TARGET_FF 014
2561 #define TARGET_CR 015
2563 /* Print operand X (an rtx) in assembler syntax to file FILE.
2564 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
2565 The CODE z takes the size of operand from the following digit, and
2566 outputs b,w,or l respectively.
2568 On the 80386, we use several such letters:
2569 f -- float insn (print a CONST_DOUBLE as a float rather than in hex).
2570 L,W,B,Q,S,T -- print the opcode suffix for specified size of operand.
2571 R -- print the prefix for register names.
2572 z -- print the opcode suffix for the size of the current operand.
2573 * -- print a star (in certain assembler syntax)
2574 P -- if PIC, print an @PLT suffix.
2575 X -- don't print any sort of PIC '@' suffix for a symbol.
2576 J -- print jump insn for arithmetic_comparison_operator.
2577 s -- ??? something to do with double shifts. not actually used, afaik.
2578 C -- print a conditional move suffix corresponding to the op code.
2579 c -- likewise, but reverse the condition.
2580 F,f -- likewise, but for floating-point. */
2582 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
2583 ((CODE) == '*' || (CODE) == '_')
2585 /* Print the name of a register based on its machine mode and number.
2586 If CODE is 'w', pretend the mode is HImode.
2587 If CODE is 'b', pretend the mode is QImode.
2588 If CODE is 'k', pretend the mode is SImode.
2589 If CODE is 'h', pretend the reg is the `high' byte register.
2590 If CODE is 'y', print "st(0)" instead of "st", if the reg is stack op. */
2592 extern char *hi_reg_name[];
2593 extern char *qi_reg_name[];
2594 extern char *qi_high_reg_name[];
2596 #define PRINT_REG(X, CODE, FILE) \
2597 do { if (REGNO (X) == ARG_POINTER_REGNUM) \
2599 fprintf (FILE, "%s", RP); \
2600 switch ((CODE == 'w' ? 2 \
2605 : GET_MODE_SIZE (GET_MODE (X)))) \
2608 if (STACK_TOP_P (X)) \
2610 fputs ("st(0)", FILE); \
2616 if (! FP_REG_P (X)) fputs ("e", FILE); \
2618 fputs (hi_reg_name[REGNO (X)], FILE); \
2621 fputs (qi_reg_name[REGNO (X)], FILE); \
2624 fputs (qi_high_reg_name[REGNO (X)], FILE); \
2629 #define PRINT_OPERAND(FILE, X, CODE) \
2630 print_operand (FILE, X, CODE)
2632 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
2633 print_operand_address (FILE, ADDR)
2635 /* Print the name of a register for based on its machine mode and number.
2636 This macro is used to print debugging output.
2637 This macro is different from PRINT_REG in that it may be used in
2638 programs that are not linked with aux-output.o. */
2640 #define DEBUG_PRINT_REG(X, CODE, FILE) \
2641 do { static char *hi_name[] = HI_REGISTER_NAMES; \
2642 static char *qi_name[] = QI_REGISTER_NAMES; \
2643 fprintf (FILE, "%d %s", REGNO (X), RP); \
2644 if (REGNO (X) == ARG_POINTER_REGNUM) \
2645 { fputs ("argp", FILE); break; } \
2646 if (STACK_TOP_P (X)) \
2647 { fputs ("st(0)", FILE); break; } \
2649 { fputs (hi_name[REGNO(X)], FILE); break; } \
2650 switch (GET_MODE_SIZE (GET_MODE (X))) \
2653 fputs ("e", FILE); \
2655 fputs (hi_name[REGNO (X)], FILE); \
2658 fputs (qi_name[REGNO (X)], FILE); \
2663 /* Output the prefix for an immediate operand, or for an offset operand. */
2664 #define PRINT_IMMED_PREFIX(FILE) fputs (IP, (FILE))
2665 #define PRINT_OFFSET_PREFIX(FILE) fputs (IP, (FILE))
2667 /* Routines in libgcc that return floats must return them in an fp reg,
2668 just as other functions do which return such values.
2669 These macros make that happen. */
2671 #define FLOAT_VALUE_TYPE float
2672 #define INTIFY(FLOATVAL) FLOATVAL
2674 /* Nonzero if INSN magically clobbers register REGNO. */
2676 /* #define INSN_CLOBBERS_REGNO_P(INSN, REGNO) \
2677 (FP_REGNO_P (REGNO) \
2678 && (GET_CODE (INSN) == JUMP_INSN || GET_CODE (INSN) == BARRIER))
2681 /* a letter which is not needed by the normal asm syntax, which
2682 we can use for operand syntax in the extended asm */
2684 #define ASM_OPERAND_LETTER '#'
2685 #define RET return ""
2686 #define AT_SP(mode) (gen_rtx_MEM ((mode), stack_pointer_rtx))
2688 /* Helper macros to expand a binary/unary operator if needed */
2689 #define IX86_EXPAND_BINARY_OPERATOR(OP, MODE, OPERANDS) \
2691 if (!ix86_expand_binary_operator (OP, MODE, OPERANDS)) \
2695 #define IX86_EXPAND_UNARY_OPERATOR(OP, MODE, OPERANDS) \
2697 if (!ix86_expand_unary_operator (OP, MODE, OPERANDS,)) \
2702 /* Functions in i386.c */
2703 extern void override_options ();
2704 extern void order_regs_for_local_alloc ();
2705 extern char *output_strlen_unroll ();
2706 extern struct rtx_def *i386_sext16_if_const ();
2707 extern int i386_aligned_p ();
2708 extern int i386_cc_probably_useless_p ();
2709 extern int i386_valid_decl_attribute_p ();
2710 extern int i386_valid_type_attribute_p ();
2711 extern int i386_return_pops_args ();
2712 extern int i386_comp_type_attributes ();
2713 extern void init_cumulative_args ();
2714 extern void function_arg_advance ();
2715 extern struct rtx_def *function_arg ();
2716 extern int function_arg_partial_nregs ();
2717 extern char *output_strlen_unroll ();
2718 extern char *singlemove_string ();
2719 extern char *output_move_double ();
2720 extern char *output_move_pushmem ();
2721 extern int standard_80387_constant_p ();
2722 extern char *output_move_const_single ();
2723 extern int symbolic_operand ();
2724 extern int call_insn_operand ();
2725 extern int expander_call_insn_operand ();
2726 extern int symbolic_reference_mentioned_p ();
2727 extern int ix86_expand_binary_operator ();
2728 extern int ix86_binary_operator_ok ();
2729 extern int ix86_expand_unary_operator ();
2730 extern int ix86_unary_operator_ok ();
2731 extern void emit_pic_move ();
2732 extern void function_prologue ();
2733 extern int simple_386_epilogue ();
2734 extern void function_epilogue ();
2735 extern int legitimate_address_p ();
2736 extern struct rtx_def *legitimize_pic_address ();
2737 extern struct rtx_def *legitimize_address ();
2738 extern void print_operand ();
2739 extern void print_operand_address ();
2740 extern void notice_update_cc ();
2741 extern void split_di ();
2742 extern int binary_387_op ();
2743 extern int shift_op ();
2744 extern int VOIDmode_compare_op ();
2745 extern char *output_387_binary_op ();
2746 extern char *output_fix_trunc ();
2747 extern void output_float_extend ();
2748 extern char *output_float_compare ();
2749 extern char *output_fp_cc0_set ();
2750 extern void save_386_machine_status ();
2751 extern void restore_386_machine_status ();
2752 extern void clear_386_stack_locals ();
2753 extern struct rtx_def *assign_386_stack_local ();
2754 extern int is_mul ();
2755 extern int is_div ();
2756 extern int last_to_set_cc ();
2757 extern int doesnt_set_condition_code ();
2758 extern int sets_condition_code ();
2759 extern int str_immediate_operand ();
2760 extern int is_fp_insn ();
2761 extern int is_fp_dest ();
2762 extern int is_fp_store ();
2763 extern int agi_dependent ();
2764 extern int reg_mentioned_in_mem ();
2765 extern char *output_int_conditional_move ();
2766 extern char *output_fp_conditional_move ();
2767 extern int ix86_can_use_return_insn_p ();
2768 extern int small_shift_operand ();
2769 extern char *output_ashl ();
2770 extern int memory_address_info ();
2773 extern struct rtx_def *copy_all_rtx ();
2774 extern void rewrite_address ();
2777 /* Variables in i386.c */
2778 extern char *ix86_cpu_string; /* for -mcpu=<xxx> */
2779 extern char *ix86_arch_string; /* for -march=<xxx> */
2780 extern char *i386_reg_alloc_order; /* register allocation order */
2781 extern char *i386_regparm_string; /* # registers to use to pass args */
2782 extern char *i386_align_loops_string; /* power of two alignment for loops */
2783 extern char *i386_align_jumps_string; /* power of two alignment for non-loop jumps */
2784 extern char *i386_align_funcs_string; /* power of two alignment for functions */
2785 extern char *i386_preferred_stack_boundary_string;/* power of two alignment for stack boundary */
2786 extern char *i386_branch_cost_string; /* values 1-5: see jump.c */
2787 extern int i386_regparm; /* i386_regparm_string as a number */
2788 extern int i386_align_loops; /* power of two alignment for loops */
2789 extern int i386_align_jumps; /* power of two alignment for non-loop jumps */
2790 extern int i386_align_funcs; /* power of two alignment for functions */
2791 extern int i386_preferred_stack_boundary; /* preferred stack boundary alignment in bits */
2792 extern int i386_branch_cost; /* values 1-5: see jump.c */
2793 extern char *hi_reg_name[]; /* names for 16 bit regs */
2794 extern char *qi_reg_name[]; /* names for 8 bit regs (low) */
2795 extern char *qi_high_reg_name[]; /* names for 8 bit regs (high) */
2796 extern enum reg_class regclass_map[]; /* smalled class containing REGNO */
2797 extern struct rtx_def *i386_compare_op0; /* operand 0 for comparisons */
2798 extern struct rtx_def *i386_compare_op1; /* operand 1 for comparisons */
2800 /* External variables used */
2801 extern int optimize; /* optimization level */
2802 extern int obey_regdecls; /* TRUE if stupid register allocation */
2804 /* External functions used */
2805 extern struct rtx_def *force_operand ();
nant's projects / dragonfly.git / blob