gcc/function.h

   1 /* Structure for saving state for a nested function.
   2    Copyright (C) 1989, 92, 93, 94, 95, 96, 1997 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
  22 #ifndef NULL_TREE
  23 #define tree int *
  24 #endif
  25 #ifndef GET_CODE
  26 #define rtx int *
  27 #endif
  28
  29 struct var_refs_queue
  30 {
  31   rtx modified;
  32   enum machine_mode promoted_mode;
  33   int unsignedp;
  34   struct var_refs_queue *next;
  35 };
  36
  37 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
  38    Each element describes one pending sequence.
  39    The main insn-chain is saved in the last element of the chain,
  40    unless the chain is empty.  */
  41
  42 struct sequence_stack
  43 {
  44   /* First and last insns in the chain of the saved sequence.  */
  45   rtx first, last;
  46   tree sequence_rtl_expr;
  47   struct sequence_stack *next;
  48 };
  49
  50 extern struct sequence_stack *sequence_stack;
  51
  52 /* Stack of single obstacks.  */
  53
  54 struct simple_obstack_stack
  55 {
  56   struct obstack *obstack;
  57   struct simple_obstack_stack *next;
  58 };
  59 \f
  60 /* This structure can save all the important global and static variables
  61    describing the status of the current function.  */
  62
  63 struct function
  64 {
  65   struct function *next;
  66
  67   /* For function.c.  */
  68   char *name;
  69   tree decl;
  70   int pops_args;
  71   int returns_struct;
  72   int returns_pcc_struct;
  73   int returns_pointer;
  74   int needs_context;
  75   int calls_setjmp;
  76   int calls_longjmp;
  77   int calls_alloca;
  78   int has_nonlocal_label;
  79   int has_nonlocal_goto;
  80   int contains_functions;
  81   int is_thunk;
  82   rtx nonlocal_goto_handler_slot;
  83   rtx nonlocal_goto_stack_level;
  84   tree nonlocal_labels;
  85   int args_size;
  86   int pretend_args_size;
  87   rtx arg_offset_rtx;
  88   int varargs;
  89   int stdarg;
  90   int max_parm_reg;
  91   rtx *parm_reg_stack_loc;
  92   int outgoing_args_size;
  93   rtx return_rtx;
  94   rtx cleanup_label;
  95   rtx return_label;
  96   rtx save_expr_regs;
  97   rtx stack_slot_list;
  98   rtx parm_birth_insn;
  99   HOST_WIDE_INT frame_offset;
 100   rtx tail_recursion_label;
 101   rtx tail_recursion_reentry;
 102   rtx internal_arg_pointer;
 103   rtx arg_pointer_save_area;
 104   tree rtl_expr_chain;
 105   rtx last_parm_insn;
 106   tree context_display;
 107   tree trampoline_list;
 108   int function_call_count;
 109   struct temp_slot *temp_slots;
 110   int temp_slot_level;
 111   /* This slot is initialized as 0 and is added to
 112      during the nested function.  */
 113   struct var_refs_queue *fixup_var_refs_queue;
 114   CUMULATIVE_ARGS args_info;
 115
 116   /* For stmt.c  */
 117   struct nesting *block_stack;
 118   struct nesting *stack_block_stack;
 119   struct nesting *cond_stack;
 120   struct nesting *loop_stack;
 121   struct nesting *case_stack;
 122   struct nesting *nesting_stack;
 123   int nesting_depth;
 124   int block_start_count;
 125   tree last_expr_type;
 126   rtx last_expr_value;
 127   int expr_stmts_for_value;
 128   char *emit_filename;
 129   int emit_lineno;
 130   struct goto_fixup *goto_fixup_chain;
 131
 132   /* For exception handling information.  */
 133   struct eh_stack ehstack;
 134   struct eh_queue ehqueue;
 135   rtx catch_clauses;
 136   struct label_node *false_label_stack;
 137   struct label_node *caught_return_label_stack;
 138   tree protect_list;
 139   rtx dhc;
 140   rtx dcc;
 141
 142   /* For expr.c.  */
 143   int pending_stack_adjust;
 144   int inhibit_defer_pop;
 145   rtx saveregs_value;
 146   rtx apply_args_value;
 147   rtx forced_labels;
 148
 149   /* For emit-rtl.c.  */
 150   int reg_rtx_no;
 151   int first_label_num;
 152   rtx first_insn;
 153   rtx last_insn;
 154   tree sequence_rtl_expr;
 155   struct sequence_stack *sequence_stack;
 156   int cur_insn_uid;
 157   int last_linenum;
 158   char *last_filename;
 159   char *regno_pointer_flag;
 160   char *regno_pointer_align;
 161   int regno_pointer_flag_length;
 162   rtx *regno_reg_rtx;
 163
 164   /* For stor-layout.c.  */
 165   tree permanent_type_chain;
 166   tree temporary_type_chain;
 167   tree permanent_type_end;
 168   tree temporary_type_end;
 169   tree pending_sizes;
 170   int immediate_size_expand;
 171
 172   /* For tree.c.  */
 173   int all_types_permanent;
 174   struct momentary_level *momentary_stack;
 175   char *maybepermanent_firstobj;
 176   char *temporary_firstobj;
 177   char *momentary_firstobj;
 178   char *momentary_function_firstobj;
 179   struct obstack *current_obstack;
 180   struct obstack *function_obstack;
 181   struct obstack *function_maybepermanent_obstack;
 182   struct obstack *expression_obstack;
 183   struct obstack *saveable_obstack;
 184   struct obstack *rtl_obstack;
 185   struct simple_obstack_stack *inline_obstacks;
 186
 187   /* For integrate.c.  */
 188   int uses_const_pool;
 189
 190   /* For md files.  */
 191   int uses_pic_offset_table;
 192   /* tm.h can use this to store whatever it likes.  */
 193   struct machine_function *machine;
 194
 195   /* For reorg.  */
 196   rtx epilogue_delay_list;
 197
 198   /* For varasm.  */
 199   struct constant_descriptor **const_rtx_hash_table;
 200   struct pool_sym **const_rtx_sym_hash_table;
 201   struct pool_constant *first_pool, *last_pool;
 202   int pool_offset;
 203 };
 204
 205 /* The FUNCTION_DECL for an inline function currently being expanded.  */
 206 extern tree inline_function_decl;
 207
 208 /* Label that will go on function epilogue.
 209    Jumping to this label serves as a "return" instruction
 210    on machines which require execution of the epilogue on all returns.  */
 211 extern rtx return_label;
 212
 213 /* List (chain of EXPR_LISTs) of all stack slots in this function.
 214    Made for the sake of unshare_all_rtl.  */
 215 extern rtx stack_slot_list;
 216
 217 /* Given a function decl for a containing function,
 218    return the `struct function' for it.  */
 219 struct function *find_function_data PROTO((tree));
 220
 221 /* Pointer to chain of `struct function' for containing functions.  */
 222 extern struct function *outer_function_chain;
 223
 224 /* Put all this function's BLOCK nodes into a vector and return it.
 225    Also store in each NOTE for the beginning or end of a block
 226    the index of that block in the vector.  */
 227 extern tree *identify_blocks PROTO((tree, rtx));
 228
 229 /* Return size needed for stack frame based on slots so far allocated.
 230    This size counts from zero.  It is not rounded to STACK_BOUNDARY;
 231    the caller may have to do that.  */
 232 extern HOST_WIDE_INT get_frame_size PROTO((void));
 233
 234 /* These variables hold pointers to functions to
 235    save and restore machine-specific data,
 236    in push_function_context and pop_function_context.  */
 237 extern void (*save_machine_status) ();
 238 extern void (*restore_machine_status) ();
 239
 240 /* Save and restore varasm.c status for a nested function.  */
 241 extern void save_varasm_status          PROTO((struct function *));
 242 extern void restore_varasm_status       PROTO((struct function *));
 243
 244 #ifdef rtx
 245 #undef rtx
 246 #endif
 247
 248 #ifdef tree
 249 #undef tree
 250 #endif