1 /* Definitions of target machine for GCC for IA-32.
2 Copyright (C) 1988, 1992, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, 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 RP, IP, LPREFIX, PUT_OP_SIZE, USE_STAR,
34 ADDR_BEG, ADDR_END, PRINT_IREG, PRINT_SCALE, PRINT_B_I_S, and many
35 that start with ASM_ or end in ASM_OP. */
37 /* Define the specific costs for a given cpu */
39 struct processor_costs {
40 const int add; /* cost of an add instruction */
41 const int lea; /* cost of a lea instruction */
42 const int shift_var; /* variable shift costs */
43 const int shift_const; /* constant shift costs */
44 const int mult_init[5]; /* cost of starting a multiply
45 in QImode, HImode, SImode, DImode, TImode*/
46 const int mult_bit; /* cost of multiply per each bit set */
47 const int divide[5]; /* cost of a divide/mod
48 in QImode, HImode, SImode, DImode, TImode*/
49 int movsx; /* The cost of movsx operation. */
50 int movzx; /* The cost of movzx operation. */
51 const int large_insn; /* insns larger than this cost more */
52 const int move_ratio; /* The threshold of number of scalar
53 memory-to-memory move insns. */
54 const int movzbl_load; /* cost of loading using movzbl */
55 const int int_load[3]; /* cost of loading integer registers
56 in QImode, HImode and SImode relative
57 to reg-reg move (2). */
58 const int int_store[3]; /* cost of storing integer register
59 in QImode, HImode and SImode */
60 const int fp_move; /* cost of reg,reg fld/fst */
61 const int fp_load[3]; /* cost of loading FP register
62 in SFmode, DFmode and XFmode */
63 const int fp_store[3]; /* cost of storing FP register
64 in SFmode, DFmode and XFmode */
65 const int mmx_move; /* cost of moving MMX register. */
66 const int mmx_load[2]; /* cost of loading MMX register
67 in SImode and DImode */
68 const int mmx_store[2]; /* cost of storing MMX register
69 in SImode and DImode */
70 const int sse_move; /* cost of moving SSE register. */
71 const int sse_load[3]; /* cost of loading SSE register
72 in SImode, DImode and TImode*/
73 const int sse_store[3]; /* cost of storing SSE register
74 in SImode, DImode and TImode*/
75 const int mmxsse_to_integer; /* cost of moving mmxsse register to
76 integer and vice versa. */
77 const int prefetch_block; /* bytes moved to cache for prefetch. */
78 const int simultaneous_prefetches; /* number of parallel prefetch
80 const int branch_cost; /* Default value for BRANCH_COST. */
81 const int fadd; /* cost of FADD and FSUB instructions. */
82 const int fmul; /* cost of FMUL instruction. */
83 const int fdiv; /* cost of FDIV instruction. */
84 const int fabs; /* cost of FABS instruction. */
85 const int fchs; /* cost of FCHS instruction. */
86 const int fsqrt; /* cost of FSQRT instruction. */
89 extern const struct processor_costs *ix86_cost;
91 /* Macros used in the machine description to test the flags. */
93 /* configure can arrange to make this 2, to force a 486. */
95 #ifndef TARGET_CPU_DEFAULT
96 #define TARGET_CPU_DEFAULT TARGET_CPU_DEFAULT_generic
99 #ifndef TARGET_FPMATH_DEFAULT
100 #define TARGET_FPMATH_DEFAULT \
101 (TARGET_64BIT && TARGET_SSE ? FPMATH_SSE : FPMATH_387)
104 #define TARGET_FLOAT_RETURNS_IN_80387 TARGET_FLOAT_RETURNS
106 /* 64bit Sledgehammer mode. For libgcc2 we make sure this is a
107 compile-time constant. */
111 #define TARGET_64BIT 1
113 #define TARGET_64BIT 0
116 #ifndef TARGET_BI_ARCH
118 #if TARGET_64BIT_DEFAULT
119 #define TARGET_64BIT 1
121 #define TARGET_64BIT 0
126 #define HAS_LONG_COND_BRANCH 1
127 #define HAS_LONG_UNCOND_BRANCH 1
129 #define TARGET_386 (ix86_tune == PROCESSOR_I386)
130 #define TARGET_486 (ix86_tune == PROCESSOR_I486)
131 #define TARGET_PENTIUM (ix86_tune == PROCESSOR_PENTIUM)
132 #define TARGET_PENTIUMPRO (ix86_tune == PROCESSOR_PENTIUMPRO)
133 #define TARGET_K6 (ix86_tune == PROCESSOR_K6)
134 #define TARGET_ATHLON (ix86_tune == PROCESSOR_ATHLON)
135 #define TARGET_PENTIUM4 (ix86_tune == PROCESSOR_PENTIUM4)
136 #define TARGET_K8 (ix86_tune == PROCESSOR_K8)
137 #define TARGET_ATHLON_K8 (TARGET_K8 || TARGET_ATHLON)
138 #define TARGET_NOCONA (ix86_tune == PROCESSOR_NOCONA)
139 #define TARGET_GENERIC32 (ix86_tune == PROCESSOR_GENERIC32)
140 #define TARGET_GENERIC64 (ix86_tune == PROCESSOR_GENERIC64)
141 #define TARGET_GENERIC (TARGET_GENERIC32 || TARGET_GENERIC64)
143 #define TUNEMASK (1 << ix86_tune)
144 extern const int x86_use_leave, x86_push_memory, x86_zero_extend_with_and;
145 extern const int x86_use_bit_test, x86_cmove, x86_fisttp, x86_deep_branch;
146 extern const int x86_branch_hints, x86_unroll_strlen;
147 extern const int x86_double_with_add, x86_partial_reg_stall, x86_movx;
148 extern const int x86_use_himode_fiop, x86_use_simode_fiop;
149 extern const int x86_use_mov0, x86_use_cltd, x86_read_modify_write;
150 extern const int x86_read_modify, x86_split_long_moves;
151 extern const int x86_promote_QImode, x86_single_stringop, x86_fast_prefix;
152 extern const int x86_himode_math, x86_qimode_math, x86_promote_qi_regs;
153 extern const int x86_promote_hi_regs, x86_integer_DFmode_moves;
154 extern const int x86_add_esp_4, x86_add_esp_8, x86_sub_esp_4, x86_sub_esp_8;
155 extern const int x86_partial_reg_dependency, x86_memory_mismatch_stall;
156 extern const int x86_accumulate_outgoing_args, x86_prologue_using_move;
157 extern const int x86_epilogue_using_move, x86_decompose_lea;
158 extern const int x86_arch_always_fancy_math_387, x86_shift1;
159 extern const int x86_sse_partial_reg_dependency, x86_sse_split_regs;
160 extern const int x86_sse_typeless_stores, x86_sse_load0_by_pxor;
161 extern const int x86_use_ffreep;
162 extern const int x86_inter_unit_moves, x86_schedule;
163 extern const int x86_use_bt;
164 extern const int x86_cmpxchg, x86_cmpxchg8b, x86_cmpxchg16b, x86_xadd;
165 extern const int x86_use_incdec;
166 extern const int x86_pad_returns;
167 extern int x86_prefetch_sse;
169 #define TARGET_USE_LEAVE (x86_use_leave & TUNEMASK)
170 #define TARGET_PUSH_MEMORY (x86_push_memory & TUNEMASK)
171 #define TARGET_ZERO_EXTEND_WITH_AND (x86_zero_extend_with_and & TUNEMASK)
172 #define TARGET_USE_BIT_TEST (x86_use_bit_test & TUNEMASK)
173 #define TARGET_UNROLL_STRLEN (x86_unroll_strlen & TUNEMASK)
174 /* For sane SSE instruction set generation we need fcomi instruction. It is
175 safe to enable all CMOVE instructions. */
176 #define TARGET_CMOVE ((x86_cmove & (1 << ix86_arch)) || TARGET_SSE)
177 #define TARGET_FISTTP (((x86_fisttp & (1 << ix86_arch)) || TARGET_SSE3) \
179 #define TARGET_DEEP_BRANCH_PREDICTION (x86_deep_branch & TUNEMASK)
180 #define TARGET_BRANCH_PREDICTION_HINTS (x86_branch_hints & TUNEMASK)
181 #define TARGET_DOUBLE_WITH_ADD (x86_double_with_add & TUNEMASK)
182 #define TARGET_USE_SAHF ((x86_use_sahf & TUNEMASK) && !TARGET_64BIT)
183 #define TARGET_MOVX (x86_movx & TUNEMASK)
184 #define TARGET_PARTIAL_REG_STALL (x86_partial_reg_stall & TUNEMASK)
185 #define TARGET_USE_HIMODE_FIOP (x86_use_himode_fiop & TUNEMASK)
186 #define TARGET_USE_SIMODE_FIOP (x86_use_simode_fiop & TUNEMASK)
187 #define TARGET_USE_MOV0 (x86_use_mov0 & TUNEMASK)
188 #define TARGET_USE_CLTD (x86_use_cltd & TUNEMASK)
189 #define TARGET_SPLIT_LONG_MOVES (x86_split_long_moves & TUNEMASK)
190 #define TARGET_READ_MODIFY_WRITE (x86_read_modify_write & TUNEMASK)
191 #define TARGET_READ_MODIFY (x86_read_modify & TUNEMASK)
192 #define TARGET_PROMOTE_QImode (x86_promote_QImode & TUNEMASK)
193 #define TARGET_FAST_PREFIX (x86_fast_prefix & TUNEMASK)
194 #define TARGET_SINGLE_STRINGOP (x86_single_stringop & TUNEMASK)
195 #define TARGET_QIMODE_MATH (x86_qimode_math & TUNEMASK)
196 #define TARGET_HIMODE_MATH (x86_himode_math & TUNEMASK)
197 #define TARGET_PROMOTE_QI_REGS (x86_promote_qi_regs & TUNEMASK)
198 #define TARGET_PROMOTE_HI_REGS (x86_promote_hi_regs & TUNEMASK)
199 #define TARGET_ADD_ESP_4 (x86_add_esp_4 & TUNEMASK)
200 #define TARGET_ADD_ESP_8 (x86_add_esp_8 & TUNEMASK)
201 #define TARGET_SUB_ESP_4 (x86_sub_esp_4 & TUNEMASK)
202 #define TARGET_SUB_ESP_8 (x86_sub_esp_8 & TUNEMASK)
203 #define TARGET_INTEGER_DFMODE_MOVES (x86_integer_DFmode_moves & TUNEMASK)
204 #define TARGET_PARTIAL_REG_DEPENDENCY (x86_partial_reg_dependency & TUNEMASK)
205 #define TARGET_SSE_PARTIAL_REG_DEPENDENCY \
206 (x86_sse_partial_reg_dependency & TUNEMASK)
207 #define TARGET_SSE_SPLIT_REGS (x86_sse_split_regs & TUNEMASK)
208 #define TARGET_SSE_TYPELESS_STORES (x86_sse_typeless_stores & TUNEMASK)
209 #define TARGET_SSE_LOAD0_BY_PXOR (x86_sse_load0_by_pxor & TUNEMASK)
210 #define TARGET_MEMORY_MISMATCH_STALL (x86_memory_mismatch_stall & TUNEMASK)
211 #define TARGET_PROLOGUE_USING_MOVE (x86_prologue_using_move & TUNEMASK)
212 #define TARGET_EPILOGUE_USING_MOVE (x86_epilogue_using_move & TUNEMASK)
213 #define TARGET_PREFETCH_SSE (x86_prefetch_sse)
214 #define TARGET_SHIFT1 (x86_shift1 & TUNEMASK)
215 #define TARGET_USE_FFREEP (x86_use_ffreep & TUNEMASK)
216 #define TARGET_REP_MOVL_OPTIMAL (x86_rep_movl_optimal & TUNEMASK)
217 #define TARGET_INTER_UNIT_MOVES (x86_inter_unit_moves & TUNEMASK)
218 #define TARGET_FOUR_JUMP_LIMIT (x86_four_jump_limit & TUNEMASK)
219 #define TARGET_SCHEDULE (x86_schedule & TUNEMASK)
220 #define TARGET_USE_BT (x86_use_bt & TUNEMASK)
221 #define TARGET_USE_INCDEC (x86_use_incdec & TUNEMASK)
222 #define TARGET_PAD_RETURNS (x86_pad_returns & TUNEMASK)
224 #define ASSEMBLER_DIALECT (ix86_asm_dialect)
226 #define TARGET_SSE_MATH ((ix86_fpmath & FPMATH_SSE) != 0)
227 #define TARGET_MIX_SSE_I387 ((ix86_fpmath & FPMATH_SSE) \
228 && (ix86_fpmath & FPMATH_387))
230 #define TARGET_GNU_TLS (ix86_tls_dialect == TLS_DIALECT_GNU)
231 #define TARGET_GNU2_TLS (ix86_tls_dialect == TLS_DIALECT_GNU2)
232 #define TARGET_ANY_GNU_TLS (TARGET_GNU_TLS || TARGET_GNU2_TLS)
233 #define TARGET_SUN_TLS (ix86_tls_dialect == TLS_DIALECT_SUN)
235 #define TARGET_CMPXCHG (x86_cmpxchg & (1 << ix86_arch))
236 #define TARGET_CMPXCHG8B (x86_cmpxchg8b & (1 << ix86_arch))
237 #define TARGET_CMPXCHG16B (x86_cmpxchg16b & (1 << ix86_arch))
238 #define TARGET_XADD (x86_xadd & (1 << ix86_arch))
240 #ifndef TARGET_64BIT_DEFAULT
241 #define TARGET_64BIT_DEFAULT 0
243 #ifndef TARGET_TLS_DIRECT_SEG_REFS_DEFAULT
244 #define TARGET_TLS_DIRECT_SEG_REFS_DEFAULT 0
247 /* Once GDB has been enhanced to deal with functions without frame
248 pointers, we can change this to allow for elimination of
249 the frame pointer in leaf functions. */
250 #define TARGET_DEFAULT 0
252 /* This is not really a target flag, but is done this way so that
253 it's analogous to similar code for Mach-O on PowerPC. darwin.h
254 redefines this to 1. */
255 #define TARGET_MACHO 0
257 /* Subtargets may reset this to 1 in order to enable 96-bit long double
258 with the rounding mode forced to 53 bits. */
259 #define TARGET_96_ROUND_53_LONG_DOUBLE 0
261 /* Sometimes certain combinations of command options do not make
262 sense on a particular target machine. You can define a macro
263 `OVERRIDE_OPTIONS' to take account of this. This macro, if
264 defined, is executed once just after all the command options have
267 Don't use this macro to turn on various extra optimizations for
268 `-O'. That is what `OPTIMIZATION_OPTIONS' is for. */
270 #define OVERRIDE_OPTIONS override_options ()
272 /* Define this to change the optimizations performed by default. */
273 #define OPTIMIZATION_OPTIONS(LEVEL, SIZE) \
274 optimization_options ((LEVEL), (SIZE))
276 /* Support for configure-time defaults of some command line options. */
277 #define OPTION_DEFAULT_SPECS \
278 {"arch", "%{!march=*:-march=%(VALUE)}"}, \
279 {"tune", "%{!mtune=*:%{!mcpu=*:%{!march=*:-mtune=%(VALUE)}}}" }, \
280 {"cpu", "%{!mtune=*:%{!mcpu=*:%{!march=*:-mtune=%(VALUE)}}}" }
282 /* Specs for the compiler proper */
285 #define CC1_CPU_SPEC "\
288 %n`-m386' is deprecated. Use `-march=i386' or `-mtune=i386' instead.\n} \
290 %n`-m486' is deprecated. Use `-march=i486' or `-mtune=i486' instead.\n} \
291 %{mpentium:-mtune=pentium \
292 %n`-mpentium' is deprecated. Use `-march=pentium' or `-mtune=pentium' instead.\n} \
293 %{mpentiumpro:-mtune=pentiumpro \
294 %n`-mpentiumpro' is deprecated. Use `-march=pentiumpro' or `-mtune=pentiumpro' instead.\n} \
296 %n`-mcpu=' is deprecated. Use `-mtune=' or '-march=' instead.\n}} \
298 %{mintel-syntax:-masm=intel \
299 %n`-mintel-syntax' is deprecated. Use `-masm=intel' instead.\n} \
300 %{mno-intel-syntax:-masm=att \
301 %n`-mno-intel-syntax' is deprecated. Use `-masm=att' instead.\n}"
304 /* Target CPU builtins. */
305 #define TARGET_CPU_CPP_BUILTINS() \
308 size_t arch_len = strlen (ix86_arch_string); \
309 size_t tune_len = strlen (ix86_tune_string); \
310 int last_arch_char = ix86_arch_string[arch_len - 1]; \
311 int last_tune_char = ix86_tune_string[tune_len - 1]; \
315 builtin_assert ("cpu=x86_64"); \
316 builtin_assert ("machine=x86_64"); \
317 builtin_define ("__amd64"); \
318 builtin_define ("__amd64__"); \
319 builtin_define ("__x86_64"); \
320 builtin_define ("__x86_64__"); \
324 builtin_assert ("cpu=i386"); \
325 builtin_assert ("machine=i386"); \
326 builtin_define_std ("i386"); \
329 /* Built-ins based on -mtune= (or -march= if no \
332 builtin_define ("__tune_i386__"); \
333 else if (TARGET_486) \
334 builtin_define ("__tune_i486__"); \
335 else if (TARGET_PENTIUM) \
337 builtin_define ("__tune_i586__"); \
338 builtin_define ("__tune_pentium__"); \
339 if (last_tune_char == 'x') \
340 builtin_define ("__tune_pentium_mmx__"); \
342 else if (TARGET_PENTIUMPRO) \
344 builtin_define ("__tune_i686__"); \
345 builtin_define ("__tune_pentiumpro__"); \
346 switch (last_tune_char) \
349 builtin_define ("__tune_pentium3__"); \
352 builtin_define ("__tune_pentium2__"); \
356 else if (TARGET_K6) \
358 builtin_define ("__tune_k6__"); \
359 if (last_tune_char == '2') \
360 builtin_define ("__tune_k6_2__"); \
361 else if (last_tune_char == '3') \
362 builtin_define ("__tune_k6_3__"); \
364 else if (TARGET_ATHLON) \
366 builtin_define ("__tune_athlon__"); \
367 /* Only plain "athlon" lacks SSE. */ \
368 if (last_tune_char != 'n') \
369 builtin_define ("__tune_athlon_sse__"); \
371 else if (TARGET_K8) \
372 builtin_define ("__tune_k8__"); \
373 else if (TARGET_PENTIUM4) \
374 builtin_define ("__tune_pentium4__"); \
375 else if (TARGET_NOCONA) \
376 builtin_define ("__tune_nocona__"); \
379 builtin_define ("__MMX__"); \
381 builtin_define ("__3dNOW__"); \
382 if (TARGET_3DNOW_A) \
383 builtin_define ("__3dNOW_A__"); \
385 builtin_define ("__SSE__"); \
387 builtin_define ("__SSE2__"); \
389 builtin_define ("__SSE3__"); \
390 if (TARGET_SSE_MATH && TARGET_SSE) \
391 builtin_define ("__SSE_MATH__"); \
392 if (TARGET_SSE_MATH && TARGET_SSE2) \
393 builtin_define ("__SSE2_MATH__"); \
395 /* Built-ins based on -march=. */ \
396 if (ix86_arch == PROCESSOR_I486) \
398 builtin_define ("__i486"); \
399 builtin_define ("__i486__"); \
401 else if (ix86_arch == PROCESSOR_PENTIUM) \
403 builtin_define ("__i586"); \
404 builtin_define ("__i586__"); \
405 builtin_define ("__pentium"); \
406 builtin_define ("__pentium__"); \
407 if (last_arch_char == 'x') \
408 builtin_define ("__pentium_mmx__"); \
410 else if (ix86_arch == PROCESSOR_PENTIUMPRO) \
412 builtin_define ("__i686"); \
413 builtin_define ("__i686__"); \
414 builtin_define ("__pentiumpro"); \
415 builtin_define ("__pentiumpro__"); \
417 else if (ix86_arch == PROCESSOR_K6) \
420 builtin_define ("__k6"); \
421 builtin_define ("__k6__"); \
422 if (last_arch_char == '2') \
423 builtin_define ("__k6_2__"); \
424 else if (last_arch_char == '3') \
425 builtin_define ("__k6_3__"); \
427 else if (ix86_arch == PROCESSOR_ATHLON) \
429 builtin_define ("__athlon"); \
430 builtin_define ("__athlon__"); \
431 /* Only plain "athlon" lacks SSE. */ \
432 if (last_arch_char != 'n') \
433 builtin_define ("__athlon_sse__"); \
435 else if (ix86_arch == PROCESSOR_K8) \
437 builtin_define ("__k8"); \
438 builtin_define ("__k8__"); \
440 else if (ix86_arch == PROCESSOR_PENTIUM4) \
442 builtin_define ("__pentium4"); \
443 builtin_define ("__pentium4__"); \
445 else if (ix86_arch == PROCESSOR_NOCONA) \
447 builtin_define ("__nocona"); \
448 builtin_define ("__nocona__"); \
453 #define TARGET_CPU_DEFAULT_i386 0
454 #define TARGET_CPU_DEFAULT_i486 1
455 #define TARGET_CPU_DEFAULT_pentium 2
456 #define TARGET_CPU_DEFAULT_pentium_mmx 3
457 #define TARGET_CPU_DEFAULT_pentiumpro 4
458 #define TARGET_CPU_DEFAULT_pentium2 5
459 #define TARGET_CPU_DEFAULT_pentium3 6
460 #define TARGET_CPU_DEFAULT_pentium4 7
461 #define TARGET_CPU_DEFAULT_k6 8
462 #define TARGET_CPU_DEFAULT_k6_2 9
463 #define TARGET_CPU_DEFAULT_k6_3 10
464 #define TARGET_CPU_DEFAULT_athlon 11
465 #define TARGET_CPU_DEFAULT_athlon_sse 12
466 #define TARGET_CPU_DEFAULT_k8 13
467 #define TARGET_CPU_DEFAULT_pentium_m 14
468 #define TARGET_CPU_DEFAULT_prescott 15
469 #define TARGET_CPU_DEFAULT_nocona 16
470 #define TARGET_CPU_DEFAULT_generic 17
472 #define TARGET_CPU_DEFAULT_NAMES {"i386", "i486", "pentium", "pentium-mmx",\
473 "pentiumpro", "pentium2", "pentium3", \
474 "pentium4", "k6", "k6-2", "k6-3",\
475 "athlon", "athlon-4", "k8", \
476 "pentium-m", "prescott", "nocona", \
480 #define CC1_SPEC "%(cc1_cpu) "
483 /* This macro defines names of additional specifications to put in the
484 specs that can be used in various specifications like CC1_SPEC. Its
485 definition is an initializer with a subgrouping for each command option.
487 Each subgrouping contains a string constant, that defines the
488 specification name, and a string constant that used by the GCC driver
491 Do not define this macro if it does not need to do anything. */
493 #ifndef SUBTARGET_EXTRA_SPECS
494 #define SUBTARGET_EXTRA_SPECS
497 #define EXTRA_SPECS \
498 { "cc1_cpu", CC1_CPU_SPEC }, \
499 SUBTARGET_EXTRA_SPECS
501 #define LINK_GCC_MATH_SPEC "%{msselibm:-lgcc-math}"
503 /* target machine storage layout */
505 #define LONG_DOUBLE_TYPE_SIZE 80
507 /* Set the value of FLT_EVAL_METHOD in float.h. When using only the
508 FPU, assume that the fpcw is set to extended precision; when using
509 only SSE, rounding is correct; when using both SSE and the FPU,
510 the rounding precision is indeterminate, since either may be chosen
511 apparently at random. */
512 #define TARGET_FLT_EVAL_METHOD \
513 (TARGET_MIX_SSE_I387 ? -1 : TARGET_SSE_MATH ? 0 : 2)
515 #define SHORT_TYPE_SIZE 16
516 #define INT_TYPE_SIZE 32
517 #define FLOAT_TYPE_SIZE 32
518 #define LONG_TYPE_SIZE BITS_PER_WORD
519 #define DOUBLE_TYPE_SIZE 64
520 #define LONG_LONG_TYPE_SIZE 64
522 #if defined (TARGET_BI_ARCH) || TARGET_64BIT_DEFAULT
523 #define MAX_BITS_PER_WORD 64
525 #define MAX_BITS_PER_WORD 32
528 /* Define this if most significant byte of a word is the lowest numbered. */
529 /* That is true on the 80386. */
531 #define BITS_BIG_ENDIAN 0
533 /* Define this if most significant byte of a word is the lowest numbered. */
534 /* That is not true on the 80386. */
535 #define BYTES_BIG_ENDIAN 0
537 /* Define this if most significant word of a multiword number is the lowest
539 /* Not true for 80386 */
540 #define WORDS_BIG_ENDIAN 0
542 /* Width of a word, in units (bytes). */
543 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
545 #define MIN_UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
547 #define MIN_UNITS_PER_WORD 4
550 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
551 #define PARM_BOUNDARY BITS_PER_WORD
553 /* Boundary (in *bits*) on which stack pointer should be aligned. */
554 #define STACK_BOUNDARY BITS_PER_WORD
556 /* Boundary (in *bits*) on which the stack pointer prefers to be
557 aligned; the compiler cannot rely on having this alignment. */
558 #define PREFERRED_STACK_BOUNDARY ix86_preferred_stack_boundary
560 /* As of July 2001, many runtimes do not align the stack properly when
561 entering main. This causes expand_main_function to forcibly align
562 the stack, which results in aligned frames for functions called from
563 main, though it does nothing for the alignment of main itself. */
564 #define FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN \
565 (ix86_preferred_stack_boundary > STACK_BOUNDARY && !TARGET_64BIT)
567 /* Minimum allocation boundary for the code of a function. */
568 #define FUNCTION_BOUNDARY 8
570 /* C++ stores the virtual bit in the lowest bit of function pointers. */
571 #define TARGET_PTRMEMFUNC_VBIT_LOCATION ptrmemfunc_vbit_in_pfn
573 /* Alignment of field after `int : 0' in a structure. */
575 #define EMPTY_FIELD_BOUNDARY BITS_PER_WORD
577 /* Minimum size in bits of the largest boundary to which any
578 and all fundamental data types supported by the hardware
579 might need to be aligned. No data type wants to be aligned
582 Pentium+ prefers DFmode values to be aligned to 64 bit boundary
583 and Pentium Pro XFmode values at 128 bit boundaries. */
585 #define BIGGEST_ALIGNMENT 128
587 /* Decide whether a variable of mode MODE should be 128 bit aligned. */
588 #define ALIGN_MODE_128(MODE) \
589 ((MODE) == XFmode || SSE_REG_MODE_P (MODE))
591 /* The published ABIs say that doubles should be aligned on word
592 boundaries, so lower the alignment for structure fields unless
593 -malign-double is set. */
595 /* ??? Blah -- this macro is used directly by libobjc. Since it
596 supports no vector modes, cut out the complexity and fall back
597 on BIGGEST_FIELD_ALIGNMENT. */
598 #ifdef IN_TARGET_LIBS
600 #define BIGGEST_FIELD_ALIGNMENT 128
602 #define BIGGEST_FIELD_ALIGNMENT 32
605 #define ADJUST_FIELD_ALIGN(FIELD, COMPUTED) \
606 x86_field_alignment (FIELD, COMPUTED)
609 /* If defined, a C expression to compute the alignment given to a
610 constant that is being placed in memory. EXP is the constant
611 and ALIGN is the alignment that the object would ordinarily have.
612 The value of this macro is used instead of that alignment to align
615 If this macro is not defined, then ALIGN is used.
617 The typical use of this macro is to increase alignment for string
618 constants to be word aligned so that `strcpy' calls that copy
619 constants can be done inline. */
621 #define CONSTANT_ALIGNMENT(EXP, ALIGN) ix86_constant_alignment ((EXP), (ALIGN))
623 /* If defined, a C expression to compute the alignment for a static
624 variable. TYPE is the data type, and ALIGN is the alignment that
625 the object would ordinarily have. The value of this macro is used
626 instead of that alignment to align the object.
628 If this macro is not defined, then ALIGN is used.
630 One use of this macro is to increase alignment of medium-size
631 data to make it all fit in fewer cache lines. Another is to
632 cause character arrays to be word-aligned so that `strcpy' calls
633 that copy constants to character arrays can be done inline. */
635 #define DATA_ALIGNMENT(TYPE, ALIGN) ix86_data_alignment ((TYPE), (ALIGN))
637 /* If defined, a C expression to compute the alignment for a local
638 variable. TYPE is the data type, and ALIGN is the alignment that
639 the object would ordinarily have. The value of this macro is used
640 instead of that alignment to align the object.
642 If this macro is not defined, then ALIGN is used.
644 One use of this macro is to increase alignment of medium-size
645 data to make it all fit in fewer cache lines. */
647 #define LOCAL_ALIGNMENT(TYPE, ALIGN) ix86_local_alignment ((TYPE), (ALIGN))
649 /* If defined, a C expression that gives the alignment boundary, in
650 bits, of an argument with the specified mode and type. If it is
651 not defined, `PARM_BOUNDARY' is used for all arguments. */
653 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
654 ix86_function_arg_boundary ((MODE), (TYPE))
656 /* Set this nonzero if move instructions will actually fail to work
657 when given unaligned data. */
658 #define STRICT_ALIGNMENT 0
660 /* If bit field type is int, don't let it cross an int,
661 and give entire struct the alignment of an int. */
662 /* Required on the 386 since it doesn't have bit-field insns. */
663 #define PCC_BITFIELD_TYPE_MATTERS 1
665 /* Standard register usage. */
667 /* This processor has special stack-like registers. See reg-stack.c
671 #define IS_STACK_MODE(MODE) \
672 (((MODE) == SFmode && (!TARGET_SSE || !TARGET_SSE_MATH)) \
673 || ((MODE) == DFmode && (!TARGET_SSE2 || !TARGET_SSE_MATH)) \
676 /* Number of actual hardware registers.
677 The hardware registers are assigned numbers for the compiler
678 from 0 to just below FIRST_PSEUDO_REGISTER.
679 All registers that the compiler knows about must be given numbers,
680 even those that are not normally considered general registers.
682 In the 80386 we give the 8 general purpose registers the numbers 0-7.
683 We number the floating point registers 8-15.
684 Note that registers 0-7 can be accessed as a short or int,
685 while only 0-3 may be used with byte `mov' instructions.
687 Reg 16 does not correspond to any hardware register, but instead
688 appears in the RTL as an argument pointer prior to reload, and is
689 eliminated during reloading in favor of either the stack or frame
692 #define FIRST_PSEUDO_REGISTER 53
694 /* Number of hardware registers that go into the DWARF-2 unwind info.
695 If not defined, equals FIRST_PSEUDO_REGISTER. */
697 #define DWARF_FRAME_REGISTERS 17
699 /* 1 for registers that have pervasive standard uses
700 and are not available for the register allocator.
701 On the 80386, the stack pointer is such, as is the arg pointer.
703 The value is zero if the register is not fixed on either 32 or
704 64 bit targets, one if the register if fixed on both 32 and 64
705 bit targets, two if it is only fixed on 32bit targets and three
706 if its only fixed on 64bit targets.
707 Proper values are computed in the CONDITIONAL_REGISTER_USAGE.
709 #define FIXED_REGISTERS \
710 /*ax,dx,cx,bx,si,di,bp,sp,st,st1,st2,st3,st4,st5,st6,st7*/ \
711 { 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, \
712 /*arg,flags,fpsr,dir,frame*/ \
714 /*xmm0,xmm1,xmm2,xmm3,xmm4,xmm5,xmm6,xmm7*/ \
715 0, 0, 0, 0, 0, 0, 0, 0, \
716 /*mmx0,mmx1,mmx2,mmx3,mmx4,mmx5,mmx6,mmx7*/ \
717 0, 0, 0, 0, 0, 0, 0, 0, \
718 /* r8, r9, r10, r11, r12, r13, r14, r15*/ \
719 2, 2, 2, 2, 2, 2, 2, 2, \
720 /*xmm8,xmm9,xmm10,xmm11,xmm12,xmm13,xmm14,xmm15*/ \
721 2, 2, 2, 2, 2, 2, 2, 2}
724 /* 1 for registers not available across function calls.
725 These must include the FIXED_REGISTERS and also any
726 registers that can be used without being saved.
727 The latter must include the registers where values are returned
728 and the register where structure-value addresses are passed.
729 Aside from that, you can include as many other registers as you like.
731 The value is zero if the register is not call used on either 32 or
732 64 bit targets, one if the register if call used on both 32 and 64
733 bit targets, two if it is only call used on 32bit targets and three
734 if its only call used on 64bit targets.
735 Proper values are computed in the CONDITIONAL_REGISTER_USAGE.
737 #define CALL_USED_REGISTERS \
738 /*ax,dx,cx,bx,si,di,bp,sp,st,st1,st2,st3,st4,st5,st6,st7*/ \
739 { 1, 1, 1, 0, 3, 3, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
740 /*arg,flags,fpsr,dir,frame*/ \
742 /*xmm0,xmm1,xmm2,xmm3,xmm4,xmm5,xmm6,xmm7*/ \
743 1, 1, 1, 1, 1, 1, 1, 1, \
744 /*mmx0,mmx1,mmx2,mmx3,mmx4,mmx5,mmx6,mmx7*/ \
745 1, 1, 1, 1, 1, 1, 1, 1, \
746 /* r8, r9, r10, r11, r12, r13, r14, r15*/ \
747 1, 1, 1, 1, 2, 2, 2, 2, \
748 /*xmm8,xmm9,xmm10,xmm11,xmm12,xmm13,xmm14,xmm15*/ \
749 1, 1, 1, 1, 1, 1, 1, 1} \
751 /* Order in which to allocate registers. Each register must be
752 listed once, even those in FIXED_REGISTERS. List frame pointer
753 late and fixed registers last. Note that, in general, we prefer
754 registers listed in CALL_USED_REGISTERS, keeping the others
755 available for storage of persistent values.
757 The ORDER_REGS_FOR_LOCAL_ALLOC actually overwrite the order,
758 so this is just empty initializer for array. */
760 #define REG_ALLOC_ORDER \
761 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\
762 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, \
763 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, \
766 /* ORDER_REGS_FOR_LOCAL_ALLOC is a macro which permits reg_alloc_order
767 to be rearranged based on a particular function. When using sse math,
768 we want to allocate SSE before x87 registers and vice vera. */
770 #define ORDER_REGS_FOR_LOCAL_ALLOC x86_order_regs_for_local_alloc ()
773 /* Macro to conditionally modify fixed_regs/call_used_regs. */
774 #define CONDITIONAL_REGISTER_USAGE \
777 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) \
779 if (fixed_regs[i] > 1) \
780 fixed_regs[i] = (fixed_regs[i] == (TARGET_64BIT ? 3 : 2)); \
781 if (call_used_regs[i] > 1) \
782 call_used_regs[i] = (call_used_regs[i] \
783 == (TARGET_64BIT ? 3 : 2)); \
785 if (PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM) \
787 fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
788 call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
793 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) \
794 if (TEST_HARD_REG_BIT (reg_class_contents[(int)MMX_REGS], i)) \
795 fixed_regs[i] = call_used_regs[i] = 1, reg_names[i] = ""; \
800 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) \
801 if (TEST_HARD_REG_BIT (reg_class_contents[(int)SSE_REGS], i)) \
802 fixed_regs[i] = call_used_regs[i] = 1, reg_names[i] = ""; \
804 if (! TARGET_80387 && ! TARGET_FLOAT_RETURNS_IN_80387) \
808 COPY_HARD_REG_SET (x, reg_class_contents[(int)FLOAT_REGS]); \
809 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) \
810 if (TEST_HARD_REG_BIT (x, i)) \
811 fixed_regs[i] = call_used_regs[i] = 1, reg_names[i] = ""; \
813 if (! TARGET_64BIT) \
816 for (i = FIRST_REX_INT_REG; i <= LAST_REX_INT_REG; i++) \
818 for (i = FIRST_REX_SSE_REG; i <= LAST_REX_SSE_REG; i++) \
823 /* Return number of consecutive hard regs needed starting at reg REGNO
824 to hold something of mode MODE.
825 This is ordinarily the length in words of a value of mode MODE
826 but can be less for certain modes in special long registers.
828 Actually there are no two word move instructions for consecutive
829 registers. And only registers 0-3 may have mov byte instructions
833 #define HARD_REGNO_NREGS(REGNO, MODE) \
834 (FP_REGNO_P (REGNO) || SSE_REGNO_P (REGNO) || MMX_REGNO_P (REGNO) \
835 ? (COMPLEX_MODE_P (MODE) ? 2 : 1) \
836 : ((MODE) == XFmode \
837 ? (TARGET_64BIT ? 2 : 3) \
839 ? (TARGET_64BIT ? 4 : 6) \
840 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)))
842 #define VALID_SSE2_REG_MODE(MODE) \
843 ((MODE) == V16QImode || (MODE) == V8HImode || (MODE) == V2DFmode \
844 || (MODE) == V2DImode || (MODE) == DFmode)
846 #define VALID_SSE_REG_MODE(MODE) \
847 ((MODE) == TImode || (MODE) == V4SFmode || (MODE) == V4SImode \
848 || (MODE) == SFmode || (MODE) == TFmode)
850 #define VALID_MMX_REG_MODE_3DNOW(MODE) \
851 ((MODE) == V2SFmode || (MODE) == SFmode)
853 #define VALID_MMX_REG_MODE(MODE) \
854 ((MODE) == DImode || (MODE) == V8QImode || (MODE) == V4HImode \
855 || (MODE) == V2SImode || (MODE) == SImode)
857 /* ??? No autovectorization into MMX or 3DNOW until we can reliably
858 place emms and femms instructions. */
859 #define UNITS_PER_SIMD_WORD (TARGET_SSE ? 16 : UNITS_PER_WORD)
861 #define VALID_FP_MODE_P(MODE) \
862 ((MODE) == SFmode || (MODE) == DFmode || (MODE) == XFmode \
863 || (MODE) == SCmode || (MODE) == DCmode || (MODE) == XCmode) \
865 #define VALID_INT_MODE_P(MODE) \
866 ((MODE) == QImode || (MODE) == HImode || (MODE) == SImode \
867 || (MODE) == DImode \
868 || (MODE) == CQImode || (MODE) == CHImode || (MODE) == CSImode \
869 || (MODE) == CDImode \
870 || (TARGET_64BIT && ((MODE) == TImode || (MODE) == CTImode \
871 || (MODE) == TFmode || (MODE) == TCmode)))
873 /* Return true for modes passed in SSE registers. */
874 #define SSE_REG_MODE_P(MODE) \
875 ((MODE) == TImode || (MODE) == V16QImode || (MODE) == TFmode \
876 || (MODE) == V8HImode || (MODE) == V2DFmode || (MODE) == V2DImode \
877 || (MODE) == V4SFmode || (MODE) == V4SImode)
879 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE. */
881 #define HARD_REGNO_MODE_OK(REGNO, MODE) \
882 ix86_hard_regno_mode_ok ((REGNO), (MODE))
884 /* Value is 1 if it is a good idea to tie two pseudo registers
885 when one has mode MODE1 and one has mode MODE2.
886 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
887 for any hard reg, then this must be 0 for correct output. */
889 #define MODES_TIEABLE_P(MODE1, MODE2) ix86_modes_tieable_p (MODE1, MODE2)
891 /* It is possible to write patterns to move flags; but until someone
893 #define AVOID_CCMODE_COPIES
895 /* Specify the modes required to caller save a given hard regno.
896 We do this on i386 to prevent flags from being saved at all.
898 Kill any attempts to combine saving of modes. */
900 #define HARD_REGNO_CALLER_SAVE_MODE(REGNO, NREGS, MODE) \
901 (CC_REGNO_P (REGNO) ? VOIDmode \
902 : (MODE) == VOIDmode && (NREGS) != 1 ? VOIDmode \
903 : (MODE) == VOIDmode ? choose_hard_reg_mode ((REGNO), (NREGS), false)\
904 : (MODE) == HImode && !TARGET_PARTIAL_REG_STALL ? SImode \
905 : (MODE) == QImode && (REGNO) >= 4 && !TARGET_64BIT ? SImode \
907 /* Specify the registers used for certain standard purposes.
908 The values of these macros are register numbers. */
910 /* on the 386 the pc register is %eip, and is not usable as a general
911 register. The ordinary mov instructions won't work */
912 /* #define PC_REGNUM */
914 /* Register to use for pushing function arguments. */
915 #define STACK_POINTER_REGNUM 7
917 /* Base register for access to local variables of the function. */
918 #define HARD_FRAME_POINTER_REGNUM 6
920 /* Base register for access to local variables of the function. */
921 #define FRAME_POINTER_REGNUM 20
923 /* First floating point reg */
924 #define FIRST_FLOAT_REG 8
926 /* First & last stack-like regs */
927 #define FIRST_STACK_REG FIRST_FLOAT_REG
928 #define LAST_STACK_REG (FIRST_FLOAT_REG + 7)
930 #define FIRST_SSE_REG (FRAME_POINTER_REGNUM + 1)
931 #define LAST_SSE_REG (FIRST_SSE_REG + 7)
933 #define FIRST_MMX_REG (LAST_SSE_REG + 1)
934 #define LAST_MMX_REG (FIRST_MMX_REG + 7)
936 #define FIRST_REX_INT_REG (LAST_MMX_REG + 1)
937 #define LAST_REX_INT_REG (FIRST_REX_INT_REG + 7)
939 #define FIRST_REX_SSE_REG (LAST_REX_INT_REG + 1)
940 #define LAST_REX_SSE_REG (FIRST_REX_SSE_REG + 7)
942 /* Value should be nonzero if functions must have frame pointers.
943 Zero means the frame pointer need not be set up (and parms
944 may be accessed via the stack pointer) in functions that seem suitable.
945 This is computed in `reload', in reload1.c. */
946 #define FRAME_POINTER_REQUIRED ix86_frame_pointer_required ()
948 /* Override this in other tm.h files to cope with various OS lossage
949 requiring a frame pointer. */
950 #ifndef SUBTARGET_FRAME_POINTER_REQUIRED
951 #define SUBTARGET_FRAME_POINTER_REQUIRED 0
954 /* Make sure we can access arbitrary call frames. */
955 #define SETUP_FRAME_ADDRESSES() ix86_setup_frame_addresses ()
957 /* Base register for access to arguments of the function. */
958 #define ARG_POINTER_REGNUM 16
960 /* Register in which static-chain is passed to a function.
961 We do use ECX as static chain register for 32 bit ABI. On the
962 64bit ABI, ECX is an argument register, so we use R10 instead. */
963 #define STATIC_CHAIN_REGNUM (TARGET_64BIT ? FIRST_REX_INT_REG + 10 - 8 : 2)
965 /* Register to hold the addressing base for position independent
966 code access to data items. We don't use PIC pointer for 64bit
967 mode. Define the regnum to dummy value to prevent gcc from
968 pessimizing code dealing with EBX.
970 To avoid clobbering a call-saved register unnecessarily, we renumber
971 the pic register when possible. The change is visible after the
972 prologue has been emitted. */
974 #define REAL_PIC_OFFSET_TABLE_REGNUM 3
976 #define PIC_OFFSET_TABLE_REGNUM \
977 ((TARGET_64BIT && ix86_cmodel == CM_SMALL_PIC) \
978 || !flag_pic ? INVALID_REGNUM \
979 : reload_completed ? REGNO (pic_offset_table_rtx) \
980 : REAL_PIC_OFFSET_TABLE_REGNUM)
982 #define GOT_SYMBOL_NAME "_GLOBAL_OFFSET_TABLE_"
984 /* A C expression which can inhibit the returning of certain function
985 values in registers, based on the type of value. A nonzero value
986 says to return the function value in memory, just as large
987 structures are always returned. Here TYPE will be a C expression
988 of type `tree', representing the data type of the value.
990 Note that values of mode `BLKmode' must be explicitly handled by
991 this macro. Also, the option `-fpcc-struct-return' takes effect
992 regardless of this macro. On most systems, it is possible to
993 leave the macro undefined; this causes a default definition to be
994 used, whose value is the constant 1 for `BLKmode' values, and 0
997 Do not use this macro to indicate that structures and unions
998 should always be returned in memory. You should instead use
999 `DEFAULT_PCC_STRUCT_RETURN' to indicate this. */
1001 #define RETURN_IN_MEMORY(TYPE) \
1002 ix86_return_in_memory (TYPE)
1004 /* This is overridden by <cygwin.h>. */
1005 #define MS_AGGREGATE_RETURN 0
1007 /* This is overridden by <netware.h>. */
1008 #define KEEP_AGGREGATE_RETURN_POINTER 0
1010 /* Define the classes of registers for register constraints in the
1011 machine description. Also define ranges of constants.
1013 One of the classes must always be named ALL_REGS and include all hard regs.
1014 If there is more than one class, another class must be named NO_REGS
1015 and contain no registers.
1017 The name GENERAL_REGS must be the name of a class (or an alias for
1018 another name such as ALL_REGS). This is the class of registers
1019 that is allowed by "g" or "r" in a register constraint.
1020 Also, registers outside this class are allocated only when
1021 instructions express preferences for them.
1023 The classes must be numbered in nondecreasing order; that is,
1024 a larger-numbered class must never be contained completely
1025 in a smaller-numbered class.
1027 For any two classes, it is very desirable that there be another
1028 class that represents their union.
1030 It might seem that class BREG is unnecessary, since no useful 386
1031 opcode needs reg %ebx. But some systems pass args to the OS in ebx,
1032 and the "b" register constraint is useful in asms for syscalls.
1034 The flags and fpsr registers are in no class. */
1039 AREG, DREG, CREG, BREG, SIREG, DIREG,
1040 AD_REGS, /* %eax/%edx for DImode */
1041 Q_REGS, /* %eax %ebx %ecx %edx */
1042 NON_Q_REGS, /* %esi %edi %ebp %esp */
1043 INDEX_REGS, /* %eax %ebx %ecx %edx %esi %edi %ebp */
1044 LEGACY_REGS, /* %eax %ebx %ecx %edx %esi %edi %ebp %esp */
1045 GENERAL_REGS, /* %eax %ebx %ecx %edx %esi %edi %ebp %esp %r8 - %r15*/
1046 FP_TOP_REG, FP_SECOND_REG, /* %st(0) %st(1) */
1056 ALL_REGS, LIM_REG_CLASSES
1059 #define N_REG_CLASSES ((int) LIM_REG_CLASSES)
1061 #define INTEGER_CLASS_P(CLASS) \
1062 reg_class_subset_p ((CLASS), GENERAL_REGS)
1063 #define FLOAT_CLASS_P(CLASS) \
1064 reg_class_subset_p ((CLASS), FLOAT_REGS)
1065 #define SSE_CLASS_P(CLASS) \
1066 ((CLASS) == SSE_REGS)
1067 #define MMX_CLASS_P(CLASS) \
1068 ((CLASS) == MMX_REGS)
1069 #define MAYBE_INTEGER_CLASS_P(CLASS) \
1070 reg_classes_intersect_p ((CLASS), GENERAL_REGS)
1071 #define MAYBE_FLOAT_CLASS_P(CLASS) \
1072 reg_classes_intersect_p ((CLASS), FLOAT_REGS)
1073 #define MAYBE_SSE_CLASS_P(CLASS) \
1074 reg_classes_intersect_p (SSE_REGS, (CLASS))
1075 #define MAYBE_MMX_CLASS_P(CLASS) \
1076 reg_classes_intersect_p (MMX_REGS, (CLASS))
1078 #define Q_CLASS_P(CLASS) \
1079 reg_class_subset_p ((CLASS), Q_REGS)
1081 /* Give names of register classes as strings for dump file. */
1083 #define REG_CLASS_NAMES \
1085 "AREG", "DREG", "CREG", "BREG", \
1088 "Q_REGS", "NON_Q_REGS", \
1092 "FP_TOP_REG", "FP_SECOND_REG", \
1096 "FP_TOP_SSE_REGS", \
1097 "FP_SECOND_SSE_REGS", \
1101 "FLOAT_INT_SSE_REGS", \
1104 /* Define which registers fit in which classes.
1105 This is an initializer for a vector of HARD_REG_SET
1106 of length N_REG_CLASSES. */
1108 #define REG_CLASS_CONTENTS \
1110 { 0x01, 0x0 }, { 0x02, 0x0 }, /* AREG, DREG */ \
1111 { 0x04, 0x0 }, { 0x08, 0x0 }, /* CREG, BREG */ \
1112 { 0x10, 0x0 }, { 0x20, 0x0 }, /* SIREG, DIREG */ \
1113 { 0x03, 0x0 }, /* AD_REGS */ \
1114 { 0x0f, 0x0 }, /* Q_REGS */ \
1115 { 0x1100f0, 0x1fe0 }, /* NON_Q_REGS */ \
1116 { 0x7f, 0x1fe0 }, /* INDEX_REGS */ \
1117 { 0x1100ff, 0x0 }, /* LEGACY_REGS */ \
1118 { 0x1100ff, 0x1fe0 }, /* GENERAL_REGS */ \
1119 { 0x100, 0x0 }, { 0x0200, 0x0 },/* FP_TOP_REG, FP_SECOND_REG */\
1120 { 0xff00, 0x0 }, /* FLOAT_REGS */ \
1121 { 0x1fe00000,0x1fe000 }, /* SSE_REGS */ \
1122 { 0xe0000000, 0x1f }, /* MMX_REGS */ \
1123 { 0x1fe00100,0x1fe000 }, /* FP_TOP_SSE_REG */ \
1124 { 0x1fe00200,0x1fe000 }, /* FP_SECOND_SSE_REG */ \
1125 { 0x1fe0ff00,0x1fe000 }, /* FLOAT_SSE_REGS */ \
1126 { 0x1ffff, 0x1fe0 }, /* FLOAT_INT_REGS */ \
1127 { 0x1fe100ff,0x1fffe0 }, /* INT_SSE_REGS */ \
1128 { 0x1fe1ffff,0x1fffe0 }, /* FLOAT_INT_SSE_REGS */ \
1129 { 0xffffffff,0x1fffff } \
1132 /* The same information, inverted:
1133 Return the class number of the smallest class containing
1134 reg number REGNO. This could be a conditional expression
1135 or could index an array. */
1137 #define REGNO_REG_CLASS(REGNO) (regclass_map[REGNO])
1139 /* When defined, the compiler allows registers explicitly used in the
1140 rtl to be used as spill registers but prevents the compiler from
1141 extending the lifetime of these registers. */
1143 #define SMALL_REGISTER_CLASSES 1
1145 #define QI_REG_P(X) \
1146 (REG_P (X) && REGNO (X) < 4)
1148 #define GENERAL_REGNO_P(N) \
1149 ((N) < 8 || REX_INT_REGNO_P (N))
1151 #define GENERAL_REG_P(X) \
1152 (REG_P (X) && GENERAL_REGNO_P (REGNO (X)))
1154 #define ANY_QI_REG_P(X) (TARGET_64BIT ? GENERAL_REG_P(X) : QI_REG_P (X))
1156 #define NON_QI_REG_P(X) \
1157 (REG_P (X) && REGNO (X) >= 4 && REGNO (X) < FIRST_PSEUDO_REGISTER)
1159 #define REX_INT_REGNO_P(N) ((N) >= FIRST_REX_INT_REG && (N) <= LAST_REX_INT_REG)
1160 #define REX_INT_REG_P(X) (REG_P (X) && REX_INT_REGNO_P (REGNO (X)))
1162 #define FP_REG_P(X) (REG_P (X) && FP_REGNO_P (REGNO (X)))
1163 #define FP_REGNO_P(N) ((N) >= FIRST_STACK_REG && (N) <= LAST_STACK_REG)
1164 #define ANY_FP_REG_P(X) (REG_P (X) && ANY_FP_REGNO_P (REGNO (X)))
1165 #define ANY_FP_REGNO_P(N) (FP_REGNO_P (N) || SSE_REGNO_P (N))
1167 #define SSE_REGNO_P(N) \
1168 (((N) >= FIRST_SSE_REG && (N) <= LAST_SSE_REG) \
1169 || ((N) >= FIRST_REX_SSE_REG && (N) <= LAST_REX_SSE_REG))
1171 #define REX_SSE_REGNO_P(N) \
1172 ((N) >= FIRST_REX_SSE_REG && (N) <= LAST_REX_SSE_REG)
1174 #define SSE_REGNO(N) \
1175 ((N) < 8 ? FIRST_SSE_REG + (N) : FIRST_REX_SSE_REG + (N) - 8)
1176 #define SSE_REG_P(N) (REG_P (N) && SSE_REGNO_P (REGNO (N)))
1178 #define SSE_FLOAT_MODE_P(MODE) \
1179 ((TARGET_SSE && (MODE) == SFmode) || (TARGET_SSE2 && (MODE) == DFmode))
1181 #define MMX_REGNO_P(N) ((N) >= FIRST_MMX_REG && (N) <= LAST_MMX_REG)
1182 #define MMX_REG_P(XOP) (REG_P (XOP) && MMX_REGNO_P (REGNO (XOP)))
1184 #define STACK_REG_P(XOP) \
1186 REGNO (XOP) >= FIRST_STACK_REG && \
1187 REGNO (XOP) <= LAST_STACK_REG)
1189 #define NON_STACK_REG_P(XOP) (REG_P (XOP) && ! STACK_REG_P (XOP))
1191 #define STACK_TOP_P(XOP) (REG_P (XOP) && REGNO (XOP) == FIRST_STACK_REG)
1193 #define CC_REG_P(X) (REG_P (X) && CC_REGNO_P (REGNO (X)))
1194 #define CC_REGNO_P(X) ((X) == FLAGS_REG || (X) == FPSR_REG)
1196 /* The class value for index registers, and the one for base regs. */
1198 #define INDEX_REG_CLASS INDEX_REGS
1199 #define BASE_REG_CLASS GENERAL_REGS
1201 /* Place additional restrictions on the register class to use when it
1202 is necessary to be able to hold a value of mode MODE in a reload
1203 register for which class CLASS would ordinarily be used. */
1205 #define LIMIT_RELOAD_CLASS(MODE, CLASS) \
1206 ((MODE) == QImode && !TARGET_64BIT \
1207 && ((CLASS) == ALL_REGS || (CLASS) == GENERAL_REGS \
1208 || (CLASS) == LEGACY_REGS || (CLASS) == INDEX_REGS) \
1211 /* Given an rtx X being reloaded into a reg required to be
1212 in class CLASS, return the class of reg to actually use.
1213 In general this is just CLASS; but on some machines
1214 in some cases it is preferable to use a more restrictive class.
1215 On the 80386 series, we prevent floating constants from being
1216 reloaded into floating registers (since no move-insn can do that)
1217 and we ensure that QImodes aren't reloaded into the esi or edi reg. */
1219 /* Put float CONST_DOUBLE in the constant pool instead of fp regs.
1220 QImode must go into class Q_REGS.
1221 Narrow ALL_REGS to GENERAL_REGS. This supports allowing movsf and
1222 movdf to do mem-to-mem moves through integer regs. */
1224 #define PREFERRED_RELOAD_CLASS(X, CLASS) \
1225 ix86_preferred_reload_class ((X), (CLASS))
1227 /* Discourage putting floating-point values in SSE registers unless
1228 SSE math is being used, and likewise for the 387 registers. */
1230 #define PREFERRED_OUTPUT_RELOAD_CLASS(X, CLASS) \
1231 ix86_preferred_output_reload_class ((X), (CLASS))
1233 /* If we are copying between general and FP registers, we need a memory
1234 location. The same is true for SSE and MMX registers. */
1235 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
1236 ix86_secondary_memory_needed ((CLASS1), (CLASS2), (MODE), 1)
1238 /* QImode spills from non-QI registers need a scratch. This does not
1239 happen often -- the only example so far requires an uninitialized
1242 #define SECONDARY_OUTPUT_RELOAD_CLASS(CLASS, MODE, OUT) \
1243 (((CLASS) == GENERAL_REGS || (CLASS) == LEGACY_REGS \
1244 || (CLASS) == INDEX_REGS) && !TARGET_64BIT && (MODE) == QImode \
1247 /* Return the maximum number of consecutive registers
1248 needed to represent mode MODE in a register of class CLASS. */
1249 /* On the 80386, this is the size of MODE in words,
1250 except in the FP regs, where a single reg is always enough. */
1251 #define CLASS_MAX_NREGS(CLASS, MODE) \
1252 (!MAYBE_INTEGER_CLASS_P (CLASS) \
1253 ? (COMPLEX_MODE_P (MODE) ? 2 : 1) \
1254 : (((((MODE) == XFmode ? 12 : GET_MODE_SIZE (MODE))) \
1255 + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
1257 /* A C expression whose value is nonzero if pseudos that have been
1258 assigned to registers of class CLASS would likely be spilled
1259 because registers of CLASS are needed for spill registers.
1261 The default value of this macro returns 1 if CLASS has exactly one
1262 register and zero otherwise. On most machines, this default
1263 should be used. Only define this macro to some other expression
1264 if pseudo allocated by `local-alloc.c' end up in memory because
1265 their hard registers were needed for spill registers. If this
1266 macro returns nonzero for those classes, those pseudos will only
1267 be allocated by `global.c', which knows how to reallocate the
1268 pseudo to another register. If there would not be another
1269 register available for reallocation, you should not change the
1270 definition of this macro since the only effect of such a
1271 definition would be to slow down register allocation. */
1273 #define CLASS_LIKELY_SPILLED_P(CLASS) \
1274 (((CLASS) == AREG) \
1275 || ((CLASS) == DREG) \
1276 || ((CLASS) == CREG) \
1277 || ((CLASS) == BREG) \
1278 || ((CLASS) == AD_REGS) \
1279 || ((CLASS) == SIREG) \
1280 || ((CLASS) == DIREG) \
1281 || ((CLASS) == FP_TOP_REG) \
1282 || ((CLASS) == FP_SECOND_REG))
1284 /* Return a class of registers that cannot change FROM mode to TO mode. */
1286 #define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
1287 ix86_cannot_change_mode_class (FROM, TO, CLASS)
1289 /* Stack layout; function entry, exit and calling. */
1291 /* Define this if pushing a word on the stack
1292 makes the stack pointer a smaller address. */
1293 #define STACK_GROWS_DOWNWARD
1295 /* Define this to nonzero if the nominal address of the stack frame
1296 is at the high-address end of the local variables;
1297 that is, each additional local variable allocated
1298 goes at a more negative offset in the frame. */
1299 #define FRAME_GROWS_DOWNWARD 1
1301 /* Offset within stack frame to start allocating local variables at.
1302 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
1303 first local allocated. Otherwise, it is the offset to the BEGINNING
1304 of the first local allocated. */
1305 #define STARTING_FRAME_OFFSET 0
1307 /* If we generate an insn to push BYTES bytes,
1308 this says how many the stack pointer really advances by.
1309 On 386, we have pushw instruction that decrements by exactly 2 no
1310 matter what the position was, there is no pushb.
1311 But as CIE data alignment factor on this arch is -4, we need to make
1312 sure all stack pointer adjustments are in multiple of 4.
1314 For 64bit ABI we round up to 8 bytes.
1317 #define PUSH_ROUNDING(BYTES) \
1319 ? (((BYTES) + 7) & (-8)) \
1320 : (((BYTES) + 3) & (-4)))
1322 /* If defined, the maximum amount of space required for outgoing arguments will
1323 be computed and placed into the variable
1324 `current_function_outgoing_args_size'. No space will be pushed onto the
1325 stack for each call; instead, the function prologue should increase the stack
1326 frame size by this amount. */
1328 #define ACCUMULATE_OUTGOING_ARGS TARGET_ACCUMULATE_OUTGOING_ARGS
1330 /* If defined, a C expression whose value is nonzero when we want to use PUSH
1331 instructions to pass outgoing arguments. */
1333 #define PUSH_ARGS (TARGET_PUSH_ARGS && !ACCUMULATE_OUTGOING_ARGS)
1335 /* We want the stack and args grow in opposite directions, even if
1337 #define PUSH_ARGS_REVERSED 1
1339 /* Offset of first parameter from the argument pointer register value. */
1340 #define FIRST_PARM_OFFSET(FNDECL) 0
1342 /* Define this macro if functions should assume that stack space has been
1343 allocated for arguments even when their values are passed in registers.
1345 The value of this macro is the size, in bytes, of the area reserved for
1346 arguments passed in registers for the function represented by FNDECL.
1348 This space can be allocated by the caller, or be a part of the
1349 machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE' says
1351 #define REG_PARM_STACK_SPACE(FNDECL) 0
1353 /* Value is the number of bytes of arguments automatically
1354 popped when returning from a subroutine call.
1355 FUNDECL is the declaration node of the function (as a tree),
1356 FUNTYPE is the data type of the function (as a tree),
1357 or for a library call it is an identifier node for the subroutine name.
1358 SIZE is the number of bytes of arguments passed on the stack.
1360 On the 80386, the RTD insn may be used to pop them if the number
1361 of args is fixed, but if the number is variable then the caller
1362 must pop them all. RTD can't be used for library calls now
1363 because the library is compiled with the Unix compiler.
1364 Use of RTD is a selectable option, since it is incompatible with
1365 standard Unix calling sequences. If the option is not selected,
1366 the caller must always pop the args.
1368 The attribute stdcall is equivalent to RTD on a per module basis. */
1370 #define RETURN_POPS_ARGS(FUNDECL, FUNTYPE, SIZE) \
1371 ix86_return_pops_args ((FUNDECL), (FUNTYPE), (SIZE))
1373 #define FUNCTION_VALUE_REGNO_P(N) \
1374 ix86_function_value_regno_p (N)
1376 /* Define how to find the value returned by a library function
1377 assuming the value has mode MODE. */
1379 #define LIBCALL_VALUE(MODE) \
1380 ix86_libcall_value (MODE)
1382 /* Define the size of the result block used for communication between
1383 untyped_call and untyped_return. The block contains a DImode value
1384 followed by the block used by fnsave and frstor. */
1386 #define APPLY_RESULT_SIZE (8+108)
1388 /* 1 if N is a possible register number for function argument passing. */
1389 #define FUNCTION_ARG_REGNO_P(N) ix86_function_arg_regno_p (N)
1391 /* Define a data type for recording info about an argument list
1392 during the scan of that argument list. This data type should
1393 hold all necessary information about the function itself
1394 and about the args processed so far, enough to enable macros
1395 such as FUNCTION_ARG to determine where the next arg should go. */
1397 typedef struct ix86_args {
1398 int words; /* # words passed so far */
1399 int nregs; /* # registers available for passing */
1400 int regno; /* next available register number */
1401 int fastcall; /* fastcall calling convention is used */
1402 int sse_words; /* # sse words passed so far */
1403 int sse_nregs; /* # sse registers available for passing */
1404 int warn_sse; /* True when we want to warn about SSE ABI. */
1405 int warn_mmx; /* True when we want to warn about MMX ABI. */
1406 int sse_regno; /* next available sse register number */
1407 int mmx_words; /* # mmx words passed so far */
1408 int mmx_nregs; /* # mmx registers available for passing */
1409 int mmx_regno; /* next available mmx register number */
1410 int maybe_vaarg; /* true for calls to possibly vardic fncts. */
1411 int float_in_sse; /* 1 if in 32-bit mode SFmode (2 for DFmode) should
1412 be passed in SSE registers. Otherwise 0. */
1415 /* Initialize a variable CUM of type CUMULATIVE_ARGS
1416 for a call to a function whose data type is FNTYPE.
1417 For a library call, FNTYPE is 0. */
1419 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
1420 init_cumulative_args (&(CUM), (FNTYPE), (LIBNAME), (FNDECL))
1422 /* Update the data in CUM to advance over an argument
1423 of mode MODE and data type TYPE.
1424 (TYPE is null for libcalls where that information may not be available.) */
1426 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
1427 function_arg_advance (&(CUM), (MODE), (TYPE), (NAMED))
1429 /* Define where to put the arguments to a function.
1430 Value is zero to push the argument on the stack,
1431 or a hard register in which to store the argument.
1433 MODE is the argument's machine mode.
1434 TYPE is the data type of the argument (as a tree).
1435 This is null for libcalls where that information may
1437 CUM is a variable of type CUMULATIVE_ARGS which gives info about
1438 the preceding args and about the function being called.
1439 NAMED is nonzero if this argument is a named parameter
1440 (otherwise it is an extra parameter matching an ellipsis). */
1442 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
1443 function_arg (&(CUM), (MODE), (TYPE), (NAMED))
1445 /* Implement `va_start' for varargs and stdarg. */
1446 #define EXPAND_BUILTIN_VA_START(VALIST, NEXTARG) \
1447 ix86_va_start (VALIST, NEXTARG)
1449 #define TARGET_ASM_FILE_END ix86_file_end
1450 #define NEED_INDICATE_EXEC_STACK 0
1452 /* Output assembler code to FILE to increment profiler label # LABELNO
1453 for profiling a function entry. */
1455 #define FUNCTION_PROFILER(FILE, LABELNO) x86_function_profiler (FILE, LABELNO)
1457 #define MCOUNT_NAME "_mcount"
1459 #define PROFILE_COUNT_REGISTER "edx"
1461 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
1462 the stack pointer does not matter. The value is tested only in
1463 functions that have frame pointers.
1464 No definition is equivalent to always zero. */
1465 /* Note on the 386 it might be more efficient not to define this since
1466 we have to restore it ourselves from the frame pointer, in order to
1469 #define EXIT_IGNORE_STACK 1
1471 /* Output assembler code for a block containing the constant parts
1472 of a trampoline, leaving space for the variable parts. */
1474 /* On the 386, the trampoline contains two instructions:
1477 The trampoline is generated entirely at runtime. The operand of JMP
1478 is the address of FUNCTION relative to the instruction following the
1479 JMP (which is 5 bytes long). */
1481 /* Length in units of the trampoline for entering a nested function. */
1483 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 23 : 10)
1485 /* Emit RTL insns to initialize the variable parts of a trampoline.
1486 FNADDR is an RTX for the address of the function's pure code.
1487 CXT is an RTX for the static chain value for the function. */
1489 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1490 x86_initialize_trampoline ((TRAMP), (FNADDR), (CXT))
1492 /* Definitions for register eliminations.
1494 This is an array of structures. Each structure initializes one pair
1495 of eliminable registers. The "from" register number is given first,
1496 followed by "to". Eliminations of the same "from" register are listed
1497 in order of preference.
1499 There are two registers that can always be eliminated on the i386.
1500 The frame pointer and the arg pointer can be replaced by either the
1501 hard frame pointer or to the stack pointer, depending upon the
1502 circumstances. The hard frame pointer is not used before reload and
1503 so it is not eligible for elimination. */
1505 #define ELIMINABLE_REGS \
1506 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
1507 { ARG_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
1508 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
1509 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}} \
1511 /* Given FROM and TO register numbers, say whether this elimination is
1512 allowed. Frame pointer elimination is automatically handled.
1514 All other eliminations are valid. */
1516 #define CAN_ELIMINATE(FROM, TO) \
1517 ((TO) == STACK_POINTER_REGNUM ? ! frame_pointer_needed : 1)
1519 /* Define the offset between two registers, one to be eliminated, and the other
1520 its replacement, at the start of a routine. */
1522 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
1523 ((OFFSET) = ix86_initial_elimination_offset ((FROM), (TO)))
1525 /* Addressing modes, and classification of registers for them. */
1527 /* Macros to check register numbers against specific register classes. */
1529 /* These assume that REGNO is a hard or pseudo reg number.
1530 They give nonzero only if REGNO is a hard reg of the suitable class
1531 or a pseudo reg currently allocated to a suitable hard reg.
1532 Since they use reg_renumber, they are safe only once reg_renumber
1533 has been allocated, which happens in local-alloc.c. */
1535 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1536 ((REGNO) < STACK_POINTER_REGNUM \
1537 || (REGNO >= FIRST_REX_INT_REG \
1538 && (REGNO) <= LAST_REX_INT_REG) \
1539 || ((unsigned) reg_renumber[(REGNO)] >= FIRST_REX_INT_REG \
1540 && (unsigned) reg_renumber[(REGNO)] <= LAST_REX_INT_REG) \
1541 || (unsigned) reg_renumber[(REGNO)] < STACK_POINTER_REGNUM)
1543 #define REGNO_OK_FOR_BASE_P(REGNO) \
1544 ((REGNO) <= STACK_POINTER_REGNUM \
1545 || (REGNO) == ARG_POINTER_REGNUM \
1546 || (REGNO) == FRAME_POINTER_REGNUM \
1547 || (REGNO >= FIRST_REX_INT_REG \
1548 && (REGNO) <= LAST_REX_INT_REG) \
1549 || ((unsigned) reg_renumber[(REGNO)] >= FIRST_REX_INT_REG \
1550 && (unsigned) reg_renumber[(REGNO)] <= LAST_REX_INT_REG) \
1551 || (unsigned) reg_renumber[(REGNO)] <= STACK_POINTER_REGNUM)
1553 #define REGNO_OK_FOR_SIREG_P(REGNO) \
1554 ((REGNO) == 4 || reg_renumber[(REGNO)] == 4)
1555 #define REGNO_OK_FOR_DIREG_P(REGNO) \
1556 ((REGNO) == 5 || reg_renumber[(REGNO)] == 5)
1558 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1559 and check its validity for a certain class.
1560 We have two alternate definitions for each of them.
1561 The usual definition accepts all pseudo regs; the other rejects
1562 them unless they have been allocated suitable hard regs.
1563 The symbol REG_OK_STRICT causes the latter definition to be used.
1565 Most source files want to accept pseudo regs in the hope that
1566 they will get allocated to the class that the insn wants them to be in.
1567 Source files for reload pass need to be strict.
1568 After reload, it makes no difference, since pseudo regs have
1569 been eliminated by then. */
1572 /* Non strict versions, pseudos are ok. */
1573 #define REG_OK_FOR_INDEX_NONSTRICT_P(X) \
1574 (REGNO (X) < STACK_POINTER_REGNUM \
1575 || (REGNO (X) >= FIRST_REX_INT_REG \
1576 && REGNO (X) <= LAST_REX_INT_REG) \
1577 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1579 #define REG_OK_FOR_BASE_NONSTRICT_P(X) \
1580 (REGNO (X) <= STACK_POINTER_REGNUM \
1581 || REGNO (X) == ARG_POINTER_REGNUM \
1582 || REGNO (X) == FRAME_POINTER_REGNUM \
1583 || (REGNO (X) >= FIRST_REX_INT_REG \
1584 && REGNO (X) <= LAST_REX_INT_REG) \
1585 || REGNO (X) >= FIRST_PSEUDO_REGISTER)
1587 /* Strict versions, hard registers only */
1588 #define REG_OK_FOR_INDEX_STRICT_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1589 #define REG_OK_FOR_BASE_STRICT_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1591 #ifndef REG_OK_STRICT
1592 #define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_INDEX_NONSTRICT_P (X)
1593 #define REG_OK_FOR_BASE_P(X) REG_OK_FOR_BASE_NONSTRICT_P (X)
1596 #define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_INDEX_STRICT_P (X)
1597 #define REG_OK_FOR_BASE_P(X) REG_OK_FOR_BASE_STRICT_P (X)
1600 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1601 that is a valid memory address for an instruction.
1602 The MODE argument is the machine mode for the MEM expression
1603 that wants to use this address.
1605 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
1606 except for CONSTANT_ADDRESS_P which is usually machine-independent.
1608 See legitimize_pic_address in i386.c for details as to what
1609 constitutes a legitimate address when -fpic is used. */
1611 #define MAX_REGS_PER_ADDRESS 2
1613 #define CONSTANT_ADDRESS_P(X) constant_address_p (X)
1615 /* Nonzero if the constant value X is a legitimate general operand.
1616 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1618 #define LEGITIMATE_CONSTANT_P(X) legitimate_constant_p (X)
1620 #ifdef REG_OK_STRICT
1621 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1623 if (legitimate_address_p ((MODE), (X), 1)) \
1628 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1630 if (legitimate_address_p ((MODE), (X), 0)) \
1636 /* If defined, a C expression to determine the base term of address X.
1637 This macro is used in only one place: `find_base_term' in alias.c.
1639 It is always safe for this macro to not be defined. It exists so
1640 that alias analysis can understand machine-dependent addresses.
1642 The typical use of this macro is to handle addresses containing
1643 a label_ref or symbol_ref within an UNSPEC. */
1645 #define FIND_BASE_TERM(X) ix86_find_base_term (X)
1647 /* Try machine-dependent ways of modifying an illegitimate address
1648 to be legitimate. If we find one, return the new, valid address.
1649 This macro is used in only one place: `memory_address' in explow.c.
1651 OLDX is the address as it was before break_out_memory_refs was called.
1652 In some cases it is useful to look at this to decide what needs to be done.
1654 MODE and WIN are passed so that this macro can use
1655 GO_IF_LEGITIMATE_ADDRESS.
1657 It is always safe for this macro to do nothing. It exists to recognize
1658 opportunities to optimize the output.
1660 For the 80386, we handle X+REG by loading X into a register R and
1661 using R+REG. R will go in a general reg and indexing will be used.
1662 However, if REG is a broken-out memory address or multiplication,
1663 nothing needs to be done because REG can certainly go in a general reg.
1665 When -fpic is used, special handling is needed for symbolic references.
1666 See comments by legitimize_pic_address in i386.c for details. */
1668 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1670 (X) = legitimize_address ((X), (OLDX), (MODE)); \
1671 if (memory_address_p ((MODE), (X))) \
1675 #define REWRITE_ADDRESS(X) rewrite_address (X)
1677 /* Nonzero if the constant value X is a legitimate general operand
1678 when generating PIC code. It is given that flag_pic is on and
1679 that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
1681 #define LEGITIMATE_PIC_OPERAND_P(X) legitimate_pic_operand_p (X)
1683 #define SYMBOLIC_CONST(X) \
1684 (GET_CODE (X) == SYMBOL_REF \
1685 || GET_CODE (X) == LABEL_REF \
1686 || (GET_CODE (X) == CONST && symbolic_reference_mentioned_p (X)))
1688 /* Go to LABEL if ADDR (a legitimate address expression)
1689 has an effect that depends on the machine mode it is used for.
1690 On the 80386, only postdecrement and postincrement address depend thus
1691 (the amount of decrement or increment being the length of the operand). */
1692 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \
1694 if (GET_CODE (ADDR) == POST_INC \
1695 || GET_CODE (ADDR) == POST_DEC) \
1699 /* Max number of args passed in registers. If this is more than 3, we will
1700 have problems with ebx (register #4), since it is a caller save register and
1701 is also used as the pic register in ELF. So for now, don't allow more than
1702 3 registers to be passed in registers. */
1704 #define REGPARM_MAX (TARGET_64BIT ? 6 : 3)
1706 #define SSE_REGPARM_MAX (TARGET_64BIT ? 8 : (TARGET_SSE ? 3 : 0))
1708 #define MMX_REGPARM_MAX (TARGET_64BIT ? 0 : (TARGET_MMX ? 3 : 0))
1711 /* Specify the machine mode that this machine uses
1712 for the index in the tablejump instruction. */
1713 #define CASE_VECTOR_MODE (!TARGET_64BIT || flag_pic ? SImode : DImode)
1715 /* Define this as 1 if `char' should by default be signed; else as 0. */
1716 #define DEFAULT_SIGNED_CHAR 1
1718 /* Number of bytes moved into a data cache for a single prefetch operation. */
1719 #define PREFETCH_BLOCK ix86_cost->prefetch_block
1721 /* Number of prefetch operations that can be done in parallel. */
1722 #define SIMULTANEOUS_PREFETCHES ix86_cost->simultaneous_prefetches
1724 /* Max number of bytes we can move from memory to memory
1725 in one reasonably fast instruction. */
1728 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1729 move efficiently, as opposed to MOVE_MAX which is the maximum
1730 number of bytes we can move with a single instruction. */
1731 #define MOVE_MAX_PIECES (TARGET_64BIT ? 8 : 4)
1733 /* If a memory-to-memory move would take MOVE_RATIO or more simple
1734 move-instruction pairs, we will do a movmem or libcall instead.
1735 Increasing the value will always make code faster, but eventually
1736 incurs high cost in increased code size.
1738 If you don't define this, a reasonable default is used. */
1740 #define MOVE_RATIO (optimize_size ? 3 : ix86_cost->move_ratio)
1742 /* If a clear memory operation would take CLEAR_RATIO or more simple
1743 move-instruction sequences, we will do a clrmem or libcall instead. */
1745 #define CLEAR_RATIO (optimize_size ? 2 \
1746 : ix86_cost->move_ratio > 6 ? 6 : ix86_cost->move_ratio)
1748 /* Define if shifts truncate the shift count
1749 which implies one can omit a sign-extension or zero-extension
1750 of a shift count. */
1751 /* On i386, shifts do truncate the count. But bit opcodes don't. */
1753 /* #define SHIFT_COUNT_TRUNCATED */
1755 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1756 is done just by pretending it is already truncated. */
1757 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1759 /* A macro to update M and UNSIGNEDP when an object whose type is
1760 TYPE and which has the specified mode and signedness is to be
1761 stored in a register. This macro is only called when TYPE is a
1764 On i386 it is sometimes useful to promote HImode and QImode
1765 quantities to SImode. The choice depends on target type. */
1767 #define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
1769 if (((MODE) == HImode && TARGET_PROMOTE_HI_REGS) \
1770 || ((MODE) == QImode && TARGET_PROMOTE_QI_REGS)) \
1774 /* Specify the machine mode that pointers have.
1775 After generation of rtl, the compiler makes no further distinction
1776 between pointers and any other objects of this machine mode. */
1777 #define Pmode (TARGET_64BIT ? DImode : SImode)
1779 /* A function address in a call instruction
1780 is a byte address (for indexing purposes)
1781 so give the MEM rtx a byte's mode. */
1782 #define FUNCTION_MODE QImode
1784 /* A C expression for the cost of moving data from a register in class FROM to
1785 one in class TO. The classes are expressed using the enumeration values
1786 such as `GENERAL_REGS'. A value of 2 is the default; other values are
1787 interpreted relative to that.
1789 It is not required that the cost always equal 2 when FROM is the same as TO;
1790 on some machines it is expensive to move between registers if they are not
1791 general registers. */
1793 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1794 ix86_register_move_cost ((MODE), (CLASS1), (CLASS2))
1796 /* A C expression for the cost of moving data of mode M between a
1797 register and memory. A value of 2 is the default; this cost is
1798 relative to those in `REGISTER_MOVE_COST'.
1800 If moving between registers and memory is more expensive than
1801 between two registers, you should define this macro to express the
1804 #define MEMORY_MOVE_COST(MODE, CLASS, IN) \
1805 ix86_memory_move_cost ((MODE), (CLASS), (IN))
1807 /* A C expression for the cost of a branch instruction. A value of 1
1808 is the default; other values are interpreted relative to that. */
1810 #define BRANCH_COST ix86_branch_cost
1812 /* Define this macro as a C expression which is nonzero if accessing
1813 less than a word of memory (i.e. a `char' or a `short') is no
1814 faster than accessing a word of memory, i.e., if such access
1815 require more than one instruction or if there is no difference in
1816 cost between byte and (aligned) word loads.
1818 When this macro is not defined, the compiler will access a field by
1819 finding the smallest containing object; when it is defined, a
1820 fullword load will be used if alignment permits. Unless bytes
1821 accesses are faster than word accesses, using word accesses is
1822 preferable since it may eliminate subsequent memory access if
1823 subsequent accesses occur to other fields in the same word of the
1824 structure, but to different bytes. */
1826 #define SLOW_BYTE_ACCESS 0
1828 /* Nonzero if access to memory by shorts is slow and undesirable. */
1829 #define SLOW_SHORT_ACCESS 0
1831 /* Define this macro to be the value 1 if unaligned accesses have a
1832 cost many times greater than aligned accesses, for example if they
1833 are emulated in a trap handler.
1835 When this macro is nonzero, the compiler will act as if
1836 `STRICT_ALIGNMENT' were nonzero when generating code for block
1837 moves. This can cause significantly more instructions to be
1838 produced. Therefore, do not set this macro nonzero if unaligned
1839 accesses only add a cycle or two to the time for a memory access.
1841 If the value of this macro is always zero, it need not be defined. */
1843 /* #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) 0 */
1845 /* Define this macro if it is as good or better to call a constant
1846 function address than to call an address kept in a register.
1848 Desirable on the 386 because a CALL with a constant address is
1849 faster than one with a register address. */
1851 #define NO_FUNCTION_CSE
1853 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1854 return the mode to be used for the comparison.
1856 For floating-point equality comparisons, CCFPEQmode should be used.
1857 VOIDmode should be used in all other cases.
1859 For integer comparisons against zero, reduce to CCNOmode or CCZmode if
1860 possible, to allow for more combinations. */
1862 #define SELECT_CC_MODE(OP, X, Y) ix86_cc_mode ((OP), (X), (Y))
1864 /* Return nonzero if MODE implies a floating point inequality can be
1867 #define REVERSIBLE_CC_MODE(MODE) 1
1869 /* A C expression whose value is reversed condition code of the CODE for
1870 comparison done in CC_MODE mode. */
1871 #define REVERSE_CONDITION(CODE, MODE) ix86_reverse_condition ((CODE), (MODE))
1874 /* Control the assembler format that we output, to the extent
1875 this does not vary between assemblers. */
1877 /* How to refer to registers in assembler output.
1878 This sequence is indexed by compiler's hard-register-number (see above). */
1880 /* In order to refer to the first 8 regs as 32 bit regs, prefix an "e".
1881 For non floating point regs, the following are the HImode names.
1883 For float regs, the stack top is sometimes referred to as "%st(0)"
1884 instead of just "%st". PRINT_OPERAND handles this with the "y" code. */
1886 #define HI_REGISTER_NAMES \
1887 {"ax","dx","cx","bx","si","di","bp","sp", \
1888 "st","st(1)","st(2)","st(3)","st(4)","st(5)","st(6)","st(7)", \
1889 "argp", "flags", "fpsr", "dirflag", "frame", \
1890 "xmm0","xmm1","xmm2","xmm3","xmm4","xmm5","xmm6","xmm7", \
1891 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7" , \
1892 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", \
1893 "xmm8", "xmm9", "xmm10", "xmm11", "xmm12", "xmm13", "xmm14", "xmm15"}
1895 #define REGISTER_NAMES HI_REGISTER_NAMES
1897 /* Table of additional register names to use in user input. */
1899 #define ADDITIONAL_REGISTER_NAMES \
1900 { { "eax", 0 }, { "edx", 1 }, { "ecx", 2 }, { "ebx", 3 }, \
1901 { "esi", 4 }, { "edi", 5 }, { "ebp", 6 }, { "esp", 7 }, \
1902 { "rax", 0 }, { "rdx", 1 }, { "rcx", 2 }, { "rbx", 3 }, \
1903 { "rsi", 4 }, { "rdi", 5 }, { "rbp", 6 }, { "rsp", 7 }, \
1904 { "al", 0 }, { "dl", 1 }, { "cl", 2 }, { "bl", 3 }, \
1905 { "ah", 0 }, { "dh", 1 }, { "ch", 2 }, { "bh", 3 } }
1907 /* Note we are omitting these since currently I don't know how
1908 to get gcc to use these, since they want the same but different
1909 number as al, and ax.
1912 #define QI_REGISTER_NAMES \
1913 {"al", "dl", "cl", "bl", "sil", "dil", "bpl", "spl",}
1915 /* These parallel the array above, and can be used to access bits 8:15
1916 of regs 0 through 3. */
1918 #define QI_HIGH_REGISTER_NAMES \
1919 {"ah", "dh", "ch", "bh", }
1921 /* How to renumber registers for dbx and gdb. */
1923 #define DBX_REGISTER_NUMBER(N) \
1924 (TARGET_64BIT ? dbx64_register_map[(N)] : dbx_register_map[(N)])
1926 extern int const dbx_register_map[FIRST_PSEUDO_REGISTER];
1927 extern int const dbx64_register_map[FIRST_PSEUDO_REGISTER];
1928 extern int const svr4_dbx_register_map[FIRST_PSEUDO_REGISTER];
1930 /* Before the prologue, RA is at 0(%esp). */
1931 #define INCOMING_RETURN_ADDR_RTX \
1932 gen_rtx_MEM (VOIDmode, gen_rtx_REG (VOIDmode, STACK_POINTER_REGNUM))
1934 /* After the prologue, RA is at -4(AP) in the current frame. */
1935 #define RETURN_ADDR_RTX(COUNT, FRAME) \
1937 ? gen_rtx_MEM (Pmode, plus_constant (arg_pointer_rtx, -UNITS_PER_WORD)) \
1938 : gen_rtx_MEM (Pmode, plus_constant (FRAME, UNITS_PER_WORD)))
1940 /* PC is dbx register 8; let's use that column for RA. */
1941 #define DWARF_FRAME_RETURN_COLUMN (TARGET_64BIT ? 16 : 8)
1943 /* Before the prologue, the top of the frame is at 4(%esp). */
1944 #define INCOMING_FRAME_SP_OFFSET UNITS_PER_WORD
1946 /* Describe how we implement __builtin_eh_return. */
1947 #define EH_RETURN_DATA_REGNO(N) ((N) < 2 ? (N) : INVALID_REGNUM)
1948 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 2)
1951 /* Select a format to encode pointers in exception handling data. CODE
1952 is 0 for data, 1 for code labels, 2 for function pointers. GLOBAL is
1953 true if the symbol may be affected by dynamic relocations.
1955 ??? All x86 object file formats are capable of representing this.
1956 After all, the relocation needed is the same as for the call insn.
1957 Whether or not a particular assembler allows us to enter such, I
1958 guess we'll have to see. */
1959 #define ASM_PREFERRED_EH_DATA_FORMAT(CODE, GLOBAL) \
1960 asm_preferred_eh_data_format ((CODE), (GLOBAL))
1962 /* This is how to output an insn to push a register on the stack.
1963 It need not be very fast code. */
1965 #define ASM_OUTPUT_REG_PUSH(FILE, REGNO) \
1968 asm_fprintf ((FILE), "\tpush{q}\t%%r%s\n", \
1969 reg_names[(REGNO)] + (REX_INT_REGNO_P (REGNO) != 0)); \
1971 asm_fprintf ((FILE), "\tpush{l}\t%%e%s\n", reg_names[(REGNO)]); \
1974 /* This is how to output an insn to pop a register from the stack.
1975 It need not be very fast code. */
1977 #define ASM_OUTPUT_REG_POP(FILE, REGNO) \
1980 asm_fprintf ((FILE), "\tpop{q}\t%%r%s\n", \
1981 reg_names[(REGNO)] + (REX_INT_REGNO_P (REGNO) != 0)); \
1983 asm_fprintf ((FILE), "\tpop{l}\t%%e%s\n", reg_names[(REGNO)]); \
1986 /* This is how to output an element of a case-vector that is absolute. */
1988 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1989 ix86_output_addr_vec_elt ((FILE), (VALUE))
1991 /* This is how to output an element of a case-vector that is relative. */
1993 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1994 ix86_output_addr_diff_elt ((FILE), (VALUE), (REL))
1996 /* Under some conditions we need jump tables in the text section, because
1997 the assembler cannot handle label differences between sections. */
1999 #define JUMP_TABLES_IN_TEXT_SECTION \
2000 (!TARGET_64BIT && flag_pic && !HAVE_AS_GOTOFF_IN_DATA)
2002 /* Switch to init or fini section via SECTION_OP, emit a call to FUNC,
2003 and switch back. For x86 we do this only to save a few bytes that
2004 would otherwise be unused in the text section. */
2005 #define CRT_CALL_STATIC_FUNCTION(SECTION_OP, FUNC) \
2006 asm (SECTION_OP "\n\t" \
2007 "call " USER_LABEL_PREFIX #FUNC "\n" \
2008 TEXT_SECTION_ASM_OP);
2010 /* Print operand X (an rtx) in assembler syntax to file FILE.
2011 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
2012 Effect of various CODE letters is described in i386.c near
2013 print_operand function. */
2015 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
2016 ((CODE) == '*' || (CODE) == '+' || (CODE) == '&')
2018 #define PRINT_OPERAND(FILE, X, CODE) \
2019 print_operand ((FILE), (X), (CODE))
2021 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
2022 print_operand_address ((FILE), (ADDR))
2024 #define OUTPUT_ADDR_CONST_EXTRA(FILE, X, FAIL) \
2026 if (! output_addr_const_extra (FILE, (X))) \
2030 /* a letter which is not needed by the normal asm syntax, which
2031 we can use for operand syntax in the extended asm */
2033 #define ASM_OPERAND_LETTER '#'
2034 #define RET return ""
2035 #define AT_SP(MODE) (gen_rtx_MEM ((MODE), stack_pointer_rtx))
2037 /* Which processor to schedule for. The cpu attribute defines a list that
2038 mirrors this list, so changes to i386.md must be made at the same time. */
2042 PROCESSOR_I386, /* 80386 */
2043 PROCESSOR_I486, /* 80486DX, 80486SX, 80486DX[24] */
2045 PROCESSOR_PENTIUMPRO,
2051 PROCESSOR_GENERIC32,
2052 PROCESSOR_GENERIC64,
2056 extern enum processor_type ix86_tune;
2057 extern enum processor_type ix86_arch;
2065 extern enum fpmath_unit ix86_fpmath;
2074 extern enum tls_dialect ix86_tls_dialect;
2077 CM_32, /* The traditional 32-bit ABI. */
2078 CM_SMALL, /* Assumes all code and data fits in the low 31 bits. */
2079 CM_KERNEL, /* Assumes all code and data fits in the high 31 bits. */
2080 CM_MEDIUM, /* Assumes code fits in the low 31 bits; data unlimited. */
2081 CM_LARGE, /* No assumptions. */
2082 CM_SMALL_PIC, /* Assumes code+data+got/plt fits in a 31 bit region. */
2083 CM_MEDIUM_PIC /* Assumes code+got/plt fits in a 31 bit region. */
2086 extern enum cmodel ix86_cmodel;
2088 /* Size of the RED_ZONE area. */
2089 #define RED_ZONE_SIZE 128
2090 /* Reserved area of the red zone for temporaries. */
2091 #define RED_ZONE_RESERVE 8
2098 extern enum asm_dialect ix86_asm_dialect;
2099 extern unsigned int ix86_preferred_stack_boundary;
2100 extern int ix86_branch_cost, ix86_section_threshold;
2102 /* Smallest class containing REGNO. */
2103 extern enum reg_class const regclass_map[FIRST_PSEUDO_REGISTER];
2105 extern rtx ix86_compare_op0; /* operand 0 for comparisons */
2106 extern rtx ix86_compare_op1; /* operand 1 for comparisons */
2107 extern rtx ix86_compare_emitted;
2109 /* To properly truncate FP values into integers, we need to set i387 control
2110 word. We can't emit proper mode switching code before reload, as spills
2111 generated by reload may truncate values incorrectly, but we still can avoid
2112 redundant computation of new control word by the mode switching pass.
2113 The fldcw instructions are still emitted redundantly, but this is probably
2114 not going to be noticeable problem, as most CPUs do have fast path for
2117 The machinery is to emit simple truncation instructions and split them
2118 before reload to instructions having USEs of two memory locations that
2119 are filled by this code to old and new control word.
2121 Post-reload pass may be later used to eliminate the redundant fildcw if
2133 enum ix86_stack_slot
2141 MAX_386_STACK_LOCALS
2144 /* Define this macro if the port needs extra instructions inserted
2145 for mode switching in an optimizing compilation. */
2147 #define OPTIMIZE_MODE_SWITCHING(ENTITY) \
2148 ix86_optimize_mode_switching[(ENTITY)]
2150 /* If you define `OPTIMIZE_MODE_SWITCHING', you have to define this as
2151 initializer for an array of integers. Each initializer element N
2152 refers to an entity that needs mode switching, and specifies the
2153 number of different modes that might need to be set for this
2154 entity. The position of the initializer in the initializer -
2155 starting counting at zero - determines the integer that is used to
2156 refer to the mode-switched entity in question. */
2158 #define NUM_MODES_FOR_MODE_SWITCHING \
2159 { I387_CW_ANY, I387_CW_ANY, I387_CW_ANY, I387_CW_ANY }
2161 /* ENTITY is an integer specifying a mode-switched entity. If
2162 `OPTIMIZE_MODE_SWITCHING' is defined, you must define this macro to
2163 return an integer value not larger than the corresponding element
2164 in `NUM_MODES_FOR_MODE_SWITCHING', to denote the mode that ENTITY
2165 must be switched into prior to the execution of INSN. */
2167 #define MODE_NEEDED(ENTITY, I) ix86_mode_needed ((ENTITY), (I))
2169 /* This macro specifies the order in which modes for ENTITY are
2170 processed. 0 is the highest priority. */
2172 #define MODE_PRIORITY_TO_MODE(ENTITY, N) (N)
2174 /* Generate one or more insns to set ENTITY to MODE. HARD_REG_LIVE
2175 is the set of hard registers live at the point where the insn(s)
2176 are to be inserted. */
2178 #define EMIT_MODE_SET(ENTITY, MODE, HARD_REGS_LIVE) \
2179 ((MODE) != I387_CW_ANY && (MODE) != I387_CW_UNINITIALIZED \
2180 ? emit_i387_cw_initialization (MODE), 0 \
2184 /* Avoid renaming of stack registers, as doing so in combination with
2185 scheduling just increases amount of live registers at time and in
2186 the turn amount of fxch instructions needed.
2188 ??? Maybe Pentium chips benefits from renaming, someone can try.... */
2190 #define HARD_REGNO_RENAME_OK(SRC, TARGET) \
2191 ((SRC) < FIRST_STACK_REG || (SRC) > LAST_STACK_REG)
2194 #define DLL_IMPORT_EXPORT_PREFIX '#'
2196 #define FASTCALL_PREFIX '@'
2198 struct machine_function GTY(())
2200 struct stack_local_entry *stack_locals;
2201 const char *some_ld_name;
2202 rtx force_align_arg_pointer;
2203 int save_varrargs_registers;
2204 int accesses_prev_frame;
2205 int optimize_mode_switching[MAX_386_ENTITIES];
2206 /* Set by ix86_compute_frame_layout and used by prologue/epilogue expander to
2207 determine the style used. */
2208 int use_fast_prologue_epilogue;
2209 /* Number of saved registers USE_FAST_PROLOGUE_EPILOGUE has been computed
2211 int use_fast_prologue_epilogue_nregs;
2212 /* If true, the current function needs the default PIC register, not
2213 an alternate register (on x86) and must not use the red zone (on
2214 x86_64), even if it's a leaf function. We don't want the
2215 function to be regarded as non-leaf because TLS calls need not
2216 affect register allocation. This flag is set when a TLS call
2217 instruction is expanded within a function, and never reset, even
2218 if all such instructions are optimized away. Use the
2219 ix86_current_function_calls_tls_descriptor macro for a better
2221 int tls_descriptor_call_expanded_p;
2224 #define ix86_stack_locals (cfun->machine->stack_locals)
2225 #define ix86_save_varrargs_registers (cfun->machine->save_varrargs_registers)
2226 #define ix86_optimize_mode_switching (cfun->machine->optimize_mode_switching)
2227 #define ix86_tls_descriptor_calls_expanded_in_cfun \
2228 (cfun->machine->tls_descriptor_call_expanded_p)
2229 /* Since tls_descriptor_call_expanded is not cleared, even if all TLS
2230 calls are optimized away, we try to detect cases in which it was
2231 optimized away. Since such instructions (use (reg REG_SP)), we can
2232 verify whether there's any such instruction live by testing that
2234 #define ix86_current_function_calls_tls_descriptor \
2235 (ix86_tls_descriptor_calls_expanded_in_cfun && regs_ever_live[SP_REG])
2237 /* Control behavior of x86_file_start. */
2238 #define X86_FILE_START_VERSION_DIRECTIVE false
2239 #define X86_FILE_START_FLTUSED false
2241 /* Flag to mark data that is in the large address area. */
2242 #define SYMBOL_FLAG_FAR_ADDR (SYMBOL_FLAG_MACH_DEP << 0)
2243 #define SYMBOL_REF_FAR_ADDR_P(X) \
2244 ((SYMBOL_REF_FLAGS (X) & SYMBOL_FLAG_FAR_ADDR) != 0)