gcc/integrate.h

   1 /* Function integration definitions for GNU C-Compiler
   2    Copyright (C) 1990, 1995, 1998, 1999, 2000 Free Software Foundation, Inc.
   3
   4 This file is part of GNU CC.
   5
   6 GNU CC is free software; you can redistribute it and/or modify
   7 it under the terms of the GNU General Public License as published by
   8 the Free Software Foundation; either version 2, or (at your option)
   9 any later version.
  10
  11 GNU CC is distributed in the hope that it will be useful,
  12 but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 GNU General Public License for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GNU CC; see the file COPYING.  If not, write to
  18 the Free Software Foundation, 59 Temple Place - Suite 330,
  19 Boston, MA 02111-1307, USA.  */
  20
  21 #include "varray.h"
  22
  23 /* This structure is used to remap objects in the function being inlined to
  24    those belonging to the calling function.  It is passed by
  25    expand_inline_function to its children.
  26
  27    This structure is also used when unrolling loops and otherwise
  28    replicating code, although not all fields are needed in this case;
  29    only those fields needed by copy_rtx_and_substitute() and its children
  30    are used.
  31
  32    This structure is used instead of static variables because
  33    expand_inline_function may be called recursively via expand_expr.  */
  34
  35 struct inline_remap
  36 {
  37   /* True if we are doing function integration, false otherwise.
  38      Used to control whether RTX_UNCHANGING bits are copied by
  39      copy_rtx_and_substitute. */
  40   int integrating;
  41   /* Definition of function be inlined.  */
  42   union tree_node *fndecl;
  43   /* Place to put insns needed at start of function.  */
  44   rtx insns_at_start;
  45   /* Mapping from old BLOCKs to new BLOCKs.  */
  46   varray_type block_map;
  47   /* Mapping from old registers to new registers.
  48      It is allocated and deallocated in `expand_inline_function' */
  49   rtx *reg_map;
  50   /* Mapping from old code-labels to new code-labels.
  51      The first element of this map is label_map[min_labelno].  */
  52   rtx *label_map;
  53   /* Mapping from old insn uid's to copied insns.  The first element
  54    of this map is insn_map[min_insnno]; the last element is
  55    insn_map[max_insnno].  We keep the bounds here for when the map
  56    only covers a partial range of insns (such as loop unrolling or
  57    code replication).  */
  58   rtx *insn_map;
  59   int min_insnno, max_insnno;
  60
  61   /* Map pseudo reg number in calling function to equivalent constant.  We
  62      cannot in general substitute constants into parameter pseudo registers,
  63      since some machine descriptions (many RISCs) won't always handle
  64      the resulting insns.  So if an incoming parameter has a constant
  65      equivalent, we record it here, and if the resulting insn is
  66      recognizable, we go with it.
  67
  68      We also use this mechanism to convert references to incoming arguments
  69      and stacked variables.  copy_rtx_and_substitute will replace the virtual
  70      incoming argument and virtual stacked variables registers with new
  71      pseudos that contain pointers into the replacement area allocated for
  72      this inline instance.  These pseudos are then marked as being equivalent
  73      to the appropriate address and substituted if valid.  */
  74   varray_type const_equiv_varray;
  75   /* This is incremented for each new basic block.
  76      It is used to store in the age field to record the domain of validity
  77      of each entry in const_equiv_varray.
  78      A value of -1 indicates an entry for a reg which is a parm.
  79      All other values are "positive".  */
  80 #define CONST_AGE_PARM (-1)
  81   unsigned int const_age;
  82
  83   /* Target of the inline function being expanded, or NULL if none.  */
  84   rtx inline_target;
  85   /* When an insn is being copied by copy_rtx_and_substitute,
  86      this is nonzero if we have copied an ASM_OPERANDS.
  87      In that case, it is the original input-operand vector.  */
  88   rtvec orig_asm_operands_vector;
  89   /* When an insn is being copied by copy_rtx_and_substitute,
  90      this is nonzero if we have copied an ASM_OPERANDS.
  91      In that case, it is the copied input-operand vector.  */
  92   rtvec copy_asm_operands_vector;
  93   /* Likewise, this is the copied constraints vector.  */
  94   rtvec copy_asm_constraints_vector;
  95
  96   /* Indications for regs being pointers and their alignment.  */
  97   char *regno_pointer_flag;
  98   char *regno_pointer_align;
  99
 100   /* The next few fields are used for subst_constants to record the SETs
 101      that it saw.  */
 102   int num_sets;
 103   struct equiv_table
 104     {
 105       rtx dest;
 106       rtx equiv;
 107     }  equiv_sets[MAX_RECOG_OPERANDS];
 108   /* Record the last thing assigned to pc.  This is used for folded
 109      conditional branch insns.  */
 110   rtx last_pc_value;
 111 #ifdef HAVE_cc0
 112   /* Record the last thing assigned to cc0.  */
 113   rtx last_cc0_value;
 114 #endif
 115 };
 116
 117 /* Return a copy of an rtx (as needed), substituting pseudo-register,
 118    labels, and frame-pointer offsets as necessary.  */
 119 extern rtx copy_rtx_and_substitute PARAMS ((rtx, struct inline_remap *, int));
 120
 121 /* Copy a declaration when one function is substituted inline into
 122    another.  */
 123 extern union tree_node *copy_decl_for_inlining PARAMS ((union tree_node *,
 124                                                       union tree_node *,
 125                                                       union tree_node *));
 126
 127 extern void try_constants PARAMS ((rtx, struct inline_remap *));
 128
 129 /* Return the label indicated.  */
 130 extern rtx get_label_from_map PARAMS ((struct inline_remap *, int));
 131
 132 /* Set the label indicated.  */
 133 #define set_label_in_map(MAP, I, X) ((MAP)->label_map[I] = (X))
 134
 135 /* Unfortunately, we need a global copy of const_equiv varray for
 136    communication with a function called from note_stores.  Be *very*
 137    careful that this is used properly in the presence of recursion.  */
 138
 139 extern varray_type global_const_equiv_varray;
 140
 141 #define MAYBE_EXTEND_CONST_EQUIV_VARRAY(MAP,MAX)                        \
 142   {                                                                     \
 143     if ((size_t)(MAX) >= VARRAY_SIZE ((MAP)->const_equiv_varray))       \
 144       {                                                                 \
 145         int is_global = (global_const_equiv_varray                      \
 146                          == (MAP)->const_equiv_varray);                 \
 147         VARRAY_GROW ((MAP)->const_equiv_varray, (MAX)+1);               \
 148         if (is_global)                                                  \
 149            global_const_equiv_varray = (MAP)->const_equiv_varray;       \
 150       }                                                                 \
 151   }
 152
 153 #define SET_CONST_EQUIV_DATA(MAP,REG,RTX,AGE)                           \
 154   {                                                                     \
 155     struct const_equiv_data *p;                                         \
 156     MAYBE_EXTEND_CONST_EQUIV_VARRAY ((MAP), REGNO (REG));               \
 157     p = &VARRAY_CONST_EQUIV ((MAP)->const_equiv_varray, REGNO (REG));   \
 158     p->rtx = (RTX);                                                     \
 159     p->age = (AGE);                                                     \
 160   }