gcc/target.h

   1 /* Data structure definitions for a generic GCC target.
   2    Copyright (C) 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
   3
   4 This program is free software; you can redistribute it and/or modify it
   5 under the terms of the GNU General Public License as published by the
   6 Free Software Foundation; either version 2, or (at your option) any
   7 later version.
   8
   9 This program is distributed in the hope that it will be useful,
  10 but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 GNU General Public License for more details.
  13
  14 You should have received a copy of the GNU General Public License
  15 along with this program; if not, write to the Free Software
  16 Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  17
  18  In other words, you are welcome to use, share and improve this program.
  19  You are forbidden to forbid anyone else to use, share and improve
  20  what you give them.   Help stamp out software-hoarding!  */
  21
  22 /* This file contains a data structure that describes a GCC target.
  23    At present it is incomplete, but in future it should grow to
  24    contain most or all target machine and target O/S specific
  25    information.
  26
  27    This structure has its initializer declared in target-def.h in the
  28    form of large macro TARGET_INITIALIZER that expands to many smaller
  29    macros.
  30
  31    The smaller macros each initialize one component of the structure,
  32    and each has a default.  Each target should have a file that
  33    includes target.h and target-def.h, and overrides any inappropriate
  34    defaults by undefining the relevant macro and defining a suitable
  35    replacement.  That file should then contain the definition of
  36    "targetm" like so:
  37
  38    struct gcc_target targetm = TARGET_INITIALIZER;
  39
  40    Doing things this way allows us to bring together everything that
  41    defines a GCC target.  By supplying a default that is appropriate
  42    to most targets, we can easily add new items without needing to
  43    edit dozens of target configuration files.  It should also allow us
  44    to gradually reduce the amount of conditional compilation that is
  45    scattered throughout GCC.  */
  46
  47 #ifndef GCC_TARGET_H
  48 #define GCC_TARGET_H
  49
  50 #include "tm.h"
  51 #include "insn-modes.h"
  52
  53 struct gcc_target
  54 {
  55   /* Functions that output assembler for the target.  */
  56   struct asm_out
  57   {
  58     /* Opening and closing parentheses for asm expression grouping.  */
  59     const char *open_paren, *close_paren;
  60
  61     /* Assembler instructions for creating various kinds of integer object.  */
  62     const char *byte_op;
  63     struct asm_int_op
  64     {
  65       const char *hi;
  66       const char *si;
  67       const char *di;
  68       const char *ti;
  69     } aligned_op, unaligned_op;
  70
  71     /* Try to output the assembler code for an integer object whose
  72        value is given by X.  SIZE is the size of the object in bytes and
  73        ALIGNED_P indicates whether it is aligned.  Return true if
  74        successful.  Only handles cases for which BYTE_OP, ALIGNED_OP
  75        and UNALIGNED_OP are NULL.  */
  76     bool (* integer) (rtx x, unsigned int size, int aligned_p);
  77
  78     /* Output code that will globalize a label.  */
  79     void (* globalize_label) (FILE *, const char *);
  80
  81     /* Output code that will emit a label for unwind info, if this
  82        target requires such labels.  Second argument is the decl the
  83        unwind info is associated with, third is a boolean: true if
  84        this is for exception handling, fourth is a boolean: true if
  85        this is only a placeholder for an omitted FDE.  */
  86     void (* unwind_label) (FILE *, tree, int, int);
  87
  88     /* Output an internal label.  */
  89     void (* internal_label) (FILE *, const char *, unsigned long);
  90
  91     /* Emit an assembler directive to set visibility for the symbol
  92        associated with the tree decl.  */
  93     void (* visibility) (tree, int);
  94
  95     /* Output the assembler code for entry to a function.  */
  96     void (* function_prologue) (FILE *, HOST_WIDE_INT);
  97
  98     /* Output the assembler code for end of prologue.  */
  99     void (* function_end_prologue) (FILE *);
 100
 101     /* Output the assembler code for start of epilogue.  */
 102     void (* function_begin_epilogue) (FILE *);
 103
 104     /* Output the assembler code for function exit.  */
 105     void (* function_epilogue) (FILE *, HOST_WIDE_INT);
 106
 107     /* Switch to an arbitrary section NAME with attributes as
 108        specified by FLAGS.  */
 109     void (* named_section) (const char *, unsigned int);
 110
 111     /* Switch to the section that holds the exception table.  */
 112     void (* exception_section) (void);
 113
 114     /* Switch to the section that holds the exception frames.  */
 115     void (* eh_frame_section) (void);
 116
 117     /* Select and switch to a section for EXP.  It may be a DECL or a
 118        constant.  RELOC is nonzero if runtime relocations must be applied;
 119        bit 1 will be set if the runtime relocations require non-local
 120        name resolution.  ALIGN is the required alignment of the data.  */
 121     void (* select_section) (tree, int, unsigned HOST_WIDE_INT);
 122
 123     /* Select and switch to a section for X with MODE.  ALIGN is
 124        the desired alignment of the data.  */
 125     void (* select_rtx_section) (enum machine_mode, rtx,
 126                                  unsigned HOST_WIDE_INT);
 127
 128     /* Select a unique section name for DECL.  RELOC is the same as
 129        for SELECT_SECTION.  */
 130     void (* unique_section) (tree, int);
 131
 132     /* Output a constructor for a symbol with a given priority.  */
 133     void (* constructor) (rtx, int);
 134
 135     /* Output a destructor for a symbol with a given priority.  */
 136     void (* destructor) (rtx, int);
 137
 138     /* Output the assembler code for a thunk function.  THUNK_DECL is the
 139        declaration for the thunk function itself, FUNCTION is the decl for
 140        the target function.  DELTA is an immediate constant offset to be
 141        added to THIS.  If VCALL_OFFSET is nonzero, the word at
 142        *(*this + vcall_offset) should be added to THIS.  */
 143     void (* output_mi_thunk) (FILE *file, tree thunk_decl,
 144                               HOST_WIDE_INT delta, HOST_WIDE_INT vcall_offset,
 145                               tree function_decl);
 146
 147     /* Determine whether output_mi_thunk would succeed.  */
 148     /* ??? Ideally, this hook would not exist, and success or failure
 149        would be returned from output_mi_thunk directly.  But there's
 150        too much undo-able setup involved in invoking output_mi_thunk.
 151        Could be fixed by making output_mi_thunk emit rtl instead of
 152        text to the output file.  */
 153     bool (* can_output_mi_thunk) (tree thunk_decl, HOST_WIDE_INT delta,
 154                                   HOST_WIDE_INT vcall_offset,
 155                                   tree function_decl);
 156
 157     /* Output any boilerplate text needed at the beginning of a
 158        translation unit.  */
 159     void (*file_start) (void);
 160
 161     /* Output any boilerplate text needed at the end of a
 162        translation unit.  */
 163     void (*file_end) (void);
 164
 165     /* Output an assembler pseudo-op to declare a library function name
 166        external.  */
 167     void (*external_libcall) (rtx);
 168   } asm_out;
 169
 170   /* Functions relating to instruction scheduling.  */
 171   struct sched
 172   {
 173     /* Given the current cost, COST, of an insn, INSN, calculate and
 174        return a new cost based on its relationship to DEP_INSN through
 175        the dependence LINK.  The default is to make no adjustment.  */
 176     int (* adjust_cost) (rtx insn, rtx link, rtx def_insn, int cost);
 177
 178     /* Adjust the priority of an insn as you see fit.  Returns the new
 179        priority.  */
 180     int (* adjust_priority) (rtx, int);
 181
 182     /* Function which returns the maximum number of insns that can be
 183        scheduled in the same machine cycle.  This must be constant
 184        over an entire compilation.  The default is 1.  */
 185     int (* issue_rate) (void);
 186
 187     /* Calculate how much this insn affects how many more insns we
 188        can emit this cycle.  Default is they all cost the same.  */
 189     int (* variable_issue) (FILE *, int, rtx, int);
 190
 191     /* Initialize machine-dependent scheduling code.  */
 192     void (* md_init) (FILE *, int, int);
 193
 194     /* Finalize machine-dependent scheduling code.  */
 195     void (* md_finish) (FILE *, int);
 196
 197     /* Initialize machine-dependent function while scheduling code.  */
 198     void (* md_init_global) (FILE *, int, int);
 199
 200     /* Finalize machine-dependent function wide scheduling code.  */
 201     void (* md_finish_global) (FILE *, int);
 202
 203     /* Reorder insns in a machine-dependent fashion, in two different
 204        places.  Default does nothing.  */
 205     int (* reorder) (FILE *, int, rtx *, int *, int);
 206     int (* reorder2) (FILE *, int, rtx *, int *, int);
 207
 208     /* The following member value is a pointer to a function called
 209        after evaluation forward dependencies of insns in chain given
 210        by two parameter values (head and tail correspondingly).  */
 211     void (* dependencies_evaluation_hook) (rtx, rtx);
 212
 213     /* The following member value is a pointer to a function returning
 214        nonzero if we should use DFA based scheduling.  The default is
 215        to use the old pipeline scheduler.  */
 216     int (* use_dfa_pipeline_interface) (void);
 217     /* The values of all the following members are used only for the
 218        DFA based scheduler: */
 219     /* The values of the following four members are pointers to
 220        functions used to simplify the automaton descriptions.
 221        dfa_pre_cycle_insn and dfa_post_cycle_insn give functions
 222        returning insns which are used to change the pipeline hazard
 223        recognizer state when the new simulated processor cycle
 224        correspondingly starts and finishes.  The function defined by
 225        init_dfa_pre_cycle_insn and init_dfa_post_cycle_insn are used
 226        to initialize the corresponding insns.  The default values of
 227        the members result in not changing the automaton state when
 228        the new simulated processor cycle correspondingly starts and
 229        finishes.  */
 230     void (* init_dfa_pre_cycle_insn) (void);
 231     rtx (* dfa_pre_cycle_insn) (void);
 232     void (* init_dfa_post_cycle_insn) (void);
 233     rtx (* dfa_post_cycle_insn) (void);
 234     /* The following member value is a pointer to a function returning value
 235        which defines how many insns in queue `ready' will we try for
 236        multi-pass scheduling.  If the member value is nonzero and the
 237        function returns positive value, the DFA based scheduler will make
 238        multi-pass scheduling for the first cycle.  In other words, we will
 239        try to choose ready insn which permits to start maximum number of
 240        insns on the same cycle.  */
 241     int (* first_cycle_multipass_dfa_lookahead) (void);
 242     /* The following member value is pointer to a function controlling
 243        what insns from the ready insn queue will be considered for the
 244        multipass insn scheduling.  If the hook returns zero for insn
 245        passed as the parameter, the insn will be not chosen to be
 246        issued.  */
 247     int (* first_cycle_multipass_dfa_lookahead_guard) (rtx);
 248     /* The following member value is pointer to a function called by
 249        the insn scheduler before issuing insn passed as the third
 250        parameter on given cycle.  If the hook returns nonzero, the
 251        insn is not issued on given processors cycle.  Instead of that,
 252        the processor cycle is advanced.  If the value passed through
 253        the last parameter is zero, the insn ready queue is not sorted
 254        on the new cycle start as usually.  The first parameter passes
 255        file for debugging output.  The second one passes the scheduler
 256        verbose level of the debugging output.  The forth and the fifth
 257        parameter values are correspondingly processor cycle on which
 258        the previous insn has been issued and the current processor
 259        cycle.  */
 260     int (* dfa_new_cycle) (FILE *, int, rtx, int, int, int *);
 261     /* The values of the following members are pointers to functions
 262        used to improve the first cycle multipass scheduling by
 263        inserting nop insns.  dfa_scheduler_bubble gives a function
 264        returning a nop insn with given index.  The indexes start with
 265        zero.  The function should return NULL if there are no more nop
 266        insns with indexes greater than given index.  To initialize the
 267        nop insn the function given by member
 268        init_dfa_scheduler_bubbles is used.  The default values of the
 269        members result in not inserting nop insns during the multipass
 270        scheduling.  */
 271     void (* init_dfa_bubbles) (void);
 272     rtx (* dfa_bubble) (int);
 273     /* The following member value is a pointer to a function called
 274        by the insn scheduler.  It should return true if there exists a
 275        dependence which is considered costly by the target, between
 276        the insn passed as the first parameter, and the insn passed as
 277        the second parameter.  The third parameter is the INSN_DEPEND
 278        link that represents the dependence between the two insns.  The
 279        fourth argument is the cost of the dependence as estimated by
 280        the scheduler.  The last argument is the distance in cycles
 281        between the already scheduled insn (first parameter) and the
 282        the second insn (second parameter).  */
 283     bool (* is_costly_dependence) (rtx, rtx, rtx, int, int);
 284   } sched;
 285
 286   /* Given two decls, merge their attributes and return the result.  */
 287   tree (* merge_decl_attributes) (tree, tree);
 288
 289   /* Given two types, merge their attributes and return the result.  */
 290   tree (* merge_type_attributes) (tree, tree);
 291
 292   /* Table of machine attributes and functions to handle them.
 293      Ignored if NULL.  */
 294   const struct attribute_spec *attribute_table;
 295
 296   /* Return zero if the attributes on TYPE1 and TYPE2 are incompatible,
 297      one if they are compatible and two if they are nearly compatible
 298      (which causes a warning to be generated).  */
 299   int (* comp_type_attributes) (tree type1, tree type2);
 300
 301   /* Assign default attributes to the newly defined TYPE.  */
 302   void (* set_default_type_attributes) (tree type);
 303
 304   /* Insert attributes on the newly created DECL.  */
 305   void (* insert_attributes) (tree decl, tree *attributes);
 306
 307   /* Return true if FNDECL (which has at least one machine attribute)
 308      can be inlined despite its machine attributes, false otherwise.  */
 309   bool (* function_attribute_inlinable_p) (tree fndecl);
 310
 311   /* Return true if bitfields in RECORD_TYPE should follow the
 312      Microsoft Visual C++ bitfield layout rules.  */
 313   bool (* ms_bitfield_layout_p) (tree record_type);
 314
 315   /* Return true if anonymous bitfields affect structure alignment.  */
 316   bool (* align_anon_bitfield) (void);
 317
 318   /* Set up target-specific built-in functions.  */
 319   void (* init_builtins) (void);
 320
 321   /* Expand a target-specific builtin.  */
 322   rtx (* expand_builtin) (tree exp, rtx target, rtx subtarget,
 323                           enum machine_mode mode, int ignore);
 324
 325   /* For a vendor-specific fundamental TYPE, return a pointer to
 326      a statically-allocated string containing the C++ mangling for
 327      TYPE.  In all other cases, return NULL.  */
 328   const char * (* mangle_fundamental_type) (tree type);
 329
 330   /* Make any adjustments to libfunc names needed for this target.  */
 331   void (* init_libfuncs) (void);
 332
 333   /* Given a decl, a section name, and whether the decl initializer
 334      has relocs, choose attributes for the section.  */
 335   /* ??? Should be merged with SELECT_SECTION and UNIQUE_SECTION.  */
 336   unsigned int (* section_type_flags) (tree, const char *, int);
 337
 338   /* True if new jumps cannot be created, to replace existing ones or
 339      not, at the current point in the compilation.  */
 340   bool (* cannot_modify_jumps_p) (void);
 341
 342   /* Return a register class for which branch target register
 343      optimizations should be applied.  */
 344   int (* branch_target_register_class) (void);
 345
 346   /* Return true if branch target register optimizations should include
 347      callee-saved registers that are not already live during the current
 348      function.  AFTER_PE_GEN is true if prologues and epilogues have
 349      already been generated.  */
 350   bool (* branch_target_register_callee_saved) (bool after_pe_gen);
 351
 352   /* True if the constant X cannot be placed in the constant pool.  */
 353   bool (* cannot_force_const_mem) (rtx);
 354
 355   /* True if the insn X cannot be duplicated.  */
 356   bool (* cannot_copy_insn_p) (rtx);
 357
 358   /* Given an address RTX, undo the effects of LEGITIMIZE_ADDRESS.  */
 359   rtx (* delegitimize_address) (rtx);
 360
 361   /* True if it is OK to do sibling call optimization for the specified
 362      call expression EXP.  DECL will be the called function, or NULL if
 363      this is an indirect call.  */
 364   bool (*function_ok_for_sibcall) (tree decl, tree exp);
 365
 366   /* True if EXP should be placed in a "small data" section.  */
 367   bool (* in_small_data_p) (tree);
 368
 369   /* True if EXP names an object for which name resolution must resolve
 370      to the current module.  */
 371   bool (* binds_local_p) (tree);
 372
 373   /* Do something target-specific to record properties of the DECL into
 374      the associated SYMBOL_REF.  */
 375   void (* encode_section_info) (tree, rtx, int);
 376
 377   /* Undo the effects of encode_section_info on the symbol string.  */
 378   const char * (* strip_name_encoding) (const char *);
 379
 380   /* True if MODE is valid for a pointer in __attribute__((mode("MODE"))).  */
 381   bool (* valid_pointer_mode) (enum machine_mode mode);
 382
 383   /* True if a vector is opaque.  */
 384   bool (* vector_opaque_p) (tree);
 385
 386   /* Compute a (partial) cost for rtx X.  Return true if the complete
 387      cost has been computed, and false if subexpressions should be
 388      scanned.  In either case, *TOTAL contains the cost result.  */
 389   /* Note that CODE and OUTER_CODE ought to be RTX_CODE, but that's
 390      not necessarily defined at this point.  */
 391   bool (* rtx_costs) (rtx x, int code, int outer_code, int *total);
 392
 393   /* Compute the cost of X, used as an address.  Never called with
 394      invalid addresses.  */
 395   int (* address_cost) (rtx x);
 396
 397   /* Given a register, this hook should return a parallel of registers
 398      to represent where to find the register pieces.  Define this hook
 399      if the register and its mode are represented in Dwarf in
 400      non-contiguous locations, or if the register should be
 401      represented in more than one register in Dwarf.  Otherwise, this
 402      hook should return NULL_RTX.  */
 403   rtx (* dwarf_register_span) (rtx);
 404
 405   /* Fetch the fixed register(s) which hold condition codes, for
 406      targets where it makes sense to look for duplicate assignments to
 407      the condition codes.  This should return true if there is such a
 408      register, false otherwise.  The arguments should be set to the
 409      fixed register numbers.  Up to two condition code registers are
 410      supported.  If there is only one for this target, the int pointed
 411      at by the second argument should be set to -1.  */
 412   bool (* fixed_condition_code_regs) (unsigned int *, unsigned int *);
 413
 414   /* If two condition code modes are compatible, return a condition
 415      code mode which is compatible with both, such that a comparison
 416      done in the returned mode will work for both of the original
 417      modes.  If the condition code modes are not compatible, return
 418      VOIDmode.  */
 419   enum machine_mode (* cc_modes_compatible) (enum machine_mode,
 420                                              enum machine_mode);
 421
 422   /* Do machine-dependent code transformations.  Called just before
 423      delayed-branch scheduling.  */
 424   void (* machine_dependent_reorg) (void);
 425
 426   /* Create the __builtin_va_list type.  */
 427   tree (* build_builtin_va_list) (void);
 428
 429   /* Validity-checking routines for PCH files, target-specific.
 430      get_pch_validity returns a pointer to the data to be stored,
 431      and stores the size in its argument.  pch_valid_p gets the same
 432      information back and returns NULL if the PCH is valid,
 433      or an error message if not.
 434   */
 435   void * (* get_pch_validity) (size_t *);
 436   const char * (* pch_valid_p) (const void *, size_t);
 437
 438   /* True if the compiler should give an enum type only as many
 439      bytes as it takes to represent the range of possible values of
 440      that type.  */
 441   bool (* default_short_enums) (void);
 442
 443   /* This target hook returns an rtx that is used to store the address
 444      of the current frame into the built-in setjmp buffer.  */
 445   rtx (* builtin_setjmp_frame_value) (void);
 446
 447   /* This target hook should add STRING_CST trees for any hard regs
 448      the port wishes to automatically clobber for all asms.  */
 449   tree (* md_asm_clobbers) (tree);
 450
 451   /* Functions relating to calls - argument passing, returns, etc.  */
 452   struct calls {
 453     bool (*promote_function_args) (tree fntype);
 454     bool (*promote_function_return) (tree fntype);
 455     bool (*promote_prototypes) (tree fntype);
 456     rtx (*struct_value_rtx) (tree fndecl, int incoming);
 457     bool (*return_in_memory) (tree type, tree fndecl);
 458     bool (*return_in_msb) (tree type);
 459     rtx (*expand_builtin_saveregs) (void);
 460     /* Returns pretend_argument_size.  */
 461     void (*setup_incoming_varargs) (CUMULATIVE_ARGS *ca, enum machine_mode mode,
 462                                     tree type, int *pretend_arg_size,
 463                                     int second_time);
 464     bool (*strict_argument_naming) (CUMULATIVE_ARGS *ca);
 465     /* Returns true if we should use
 466        targetm.calls.setup_incoming_varargs() and/or
 467        targetm.calls.strict_argument_naming().  */
 468     bool (*pretend_outgoing_varargs_named) (CUMULATIVE_ARGS *ca);
 469
 470     /* Given a complex type T, return true if a parameter of type T
 471        should be passed as two scalars.  */
 472     bool (* split_complex_arg) (tree type);
 473
 474     /* Gimplifies a VA_ARG_EXPR.  */
 475     tree (* gimplify_va_arg_expr) (tree valist, tree type, tree *pre_p,
 476                                    tree *post_p);
 477   } calls;
 478
 479   /* Functions specific to the C++ frontend.  */
 480   struct cxx {
 481     /* Return the integer type used for guard variables.  */
 482     tree (*guard_type) (void);
 483     /* Return true if only the low bit of the guard should be tested.  */
 484     bool (*guard_mask_bit) (void);
 485     /* Returns the size of the array cookie for an array of type.  */
 486     tree (*get_cookie_size) (tree);
 487     /* Returns true if the element size should be stored in the
 488        array cookie.  */
 489     bool (*cookie_has_size) (void);
 490     /* Allows backends to perform additional processing when
 491        deciding if a class should be exported or imported.  */
 492     int (*import_export_class) (tree, int);
 493   } cxx;
 494
 495   /* Leave the boolean fields at the end.  */
 496
 497   /* True if arbitrary sections are supported.  */
 498   bool have_named_sections;
 499
 500   /* True if "native" constructors and destructors are supported,
 501      false if we're using collect2 for the job.  */
 502   bool have_ctors_dtors;
 503
 504   /* True if thread-local storage is supported.  */
 505   bool have_tls;
 506
 507   /* True if a small readonly data section is supported.  */
 508   bool have_srodata_section;
 509
 510   /* True if EH frame info sections should be zero-terminated.  */
 511   bool terminate_dw2_eh_frame_info;
 512
 513   /* True if #NO_APP should be emitted at the beginning of
 514      assembly output.  */
 515   bool file_start_app_off;
 516
 517   /* True if output_file_directive should be called for main_input_filename
 518      at the beginning of assembly output.  */
 519   bool file_start_file_directive;
 520
 521   /* True if #pragma redefine_extname is to be supported.  */
 522   bool handle_pragma_redefine_extname;
 523
 524   /* True if #pragma extern_prefix is to be supported.  */
 525   bool handle_pragma_extern_prefix;
 526
 527   /* True if the RTL prologue and epilogue should be expanded after all
 528      passes that modify the instructions (and not merely reorder them)
 529      have been run.  */
 530   bool late_rtl_prologue_epilogue;
 531
 532   /* Leave the boolean fields at the end.  */
 533 };
 534
 535 extern struct gcc_target targetm;
 536
 537 #endif /* GCC_TARGET_H */