Daily bump.
[official-gcc.git] / gcc / function.h
blob0f34bcd612379788eb63d59ca2288d4b69001a50
1 /* Structure for saving state for a nested function.
2 Copyright (C) 1989-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #ifndef GCC_FUNCTION_H
21 #define GCC_FUNCTION_H
24 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
25 Each element describes one pending sequence.
26 The main insn-chain is saved in the last element of the chain,
27 unless the chain is empty. */
29 struct GTY(()) sequence_stack {
30 /* First and last insns in the chain of the saved sequence. */
31 rtx_insn *first;
32 rtx_insn *last;
33 struct sequence_stack *next;
36 struct GTY(()) emit_status {
37 void ensure_regno_capacity ();
39 /* This is reset to LAST_VIRTUAL_REGISTER + 1 at the start of each function.
40 After rtl generation, it is 1 plus the largest register number used. */
41 int x_reg_rtx_no;
43 /* Lowest label number in current function. */
44 int x_first_label_num;
46 /* seq.first and seq.last are the ends of the doubly-linked chain of
47 rtl for the current function. Both are reset to null at the
48 start of rtl generation for the function.
50 start_sequence saves both of these on seq.next and then starts
51 a new, nested sequence of insns.
53 seq.next is a stack of pending (incomplete) sequences saved by
54 start_sequence. Each element describes one pending sequence.
55 The main insn-chain is the last element of the chain. */
56 struct sequence_stack seq;
58 /* INSN_UID for next insn emitted.
59 Reset to 1 for each function compiled. */
60 int x_cur_insn_uid;
62 /* INSN_UID for next debug insn emitted. Only used if
63 --param min-nondebug-insn-uid=<value> is given with nonzero value. */
64 int x_cur_debug_insn_uid;
66 /* The length of the regno_pointer_align, regno_decl, and x_regno_reg_rtx
67 vectors. Since these vectors are needed during the expansion phase when
68 the total number of registers in the function is not yet known, the
69 vectors are copied and made bigger when necessary. */
70 int regno_pointer_align_length;
72 /* Indexed by pseudo register number, if nonzero gives the known alignment
73 for that pseudo (if REG_POINTER is set in x_regno_reg_rtx).
74 Allocated in parallel with x_regno_reg_rtx. */
75 unsigned char * GTY((skip)) regno_pointer_align;
79 /* Indexed by register number, gives an rtx for that register (and only
80 that register). For pseudo registers, it is the unique rtx for
81 that pseudo. For hard registers, it is an rtx of the mode specified
82 by reg_raw_mode.
84 FIXME: We could put it into emit_status struct, but gengtype is not
85 able to deal with length attribute nested in top level structures. */
87 extern GTY ((length ("crtl->emit.x_reg_rtx_no"))) rtx * regno_reg_rtx;
89 /* For backward compatibility... eventually these should all go away. */
90 #define reg_rtx_no (crtl->emit.x_reg_rtx_no)
92 #define REGNO_POINTER_ALIGN(REGNO) (crtl->emit.regno_pointer_align[REGNO])
94 struct GTY(()) expr_status {
95 /* Number of units that we should eventually pop off the stack.
96 These are the arguments to function calls that have already returned. */
97 int x_pending_stack_adjust;
99 /* Under some ABIs, it is the caller's responsibility to pop arguments
100 pushed for function calls. A naive implementation would simply pop
101 the arguments immediately after each call. However, if several
102 function calls are made in a row, it is typically cheaper to pop
103 all the arguments after all of the calls are complete since a
104 single pop instruction can be used. Therefore, GCC attempts to
105 defer popping the arguments until absolutely necessary. (For
106 example, at the end of a conditional, the arguments must be popped,
107 since code outside the conditional won't know whether or not the
108 arguments need to be popped.)
110 When INHIBIT_DEFER_POP is nonzero, however, the compiler does not
111 attempt to defer pops. Instead, the stack is popped immediately
112 after each call. Rather then setting this variable directly, use
113 NO_DEFER_POP and OK_DEFER_POP. */
114 int x_inhibit_defer_pop;
116 /* If PREFERRED_STACK_BOUNDARY and PUSH_ROUNDING are defined, the stack
117 boundary can be momentarily unaligned while pushing the arguments.
118 Record the delta since last aligned boundary here in order to get
119 stack alignment in the nested function calls working right. */
120 int x_stack_pointer_delta;
122 /* Nonzero means __builtin_saveregs has already been done in this function.
123 The value is the pseudoreg containing the value __builtin_saveregs
124 returned. */
125 rtx x_saveregs_value;
127 /* Similarly for __builtin_apply_args. */
128 rtx x_apply_args_value;
130 /* List of labels that must never be deleted. */
131 vec<rtx_insn *, va_gc> *x_forced_labels;
134 typedef struct call_site_record_d *call_site_record;
136 /* RTL representation of exception handling. */
137 struct GTY(()) rtl_eh {
138 rtx ehr_stackadj;
139 rtx ehr_handler;
140 rtx_code_label *ehr_label;
142 rtx sjlj_fc;
143 rtx_insn *sjlj_exit_after;
145 vec<uchar, va_gc> *action_record_data;
147 vec<call_site_record, va_gc> *call_site_record_v[2];
150 #define pending_stack_adjust (crtl->expr.x_pending_stack_adjust)
151 #define inhibit_defer_pop (crtl->expr.x_inhibit_defer_pop)
152 #define saveregs_value (crtl->expr.x_saveregs_value)
153 #define apply_args_value (crtl->expr.x_apply_args_value)
154 #define forced_labels (crtl->expr.x_forced_labels)
155 #define stack_pointer_delta (crtl->expr.x_stack_pointer_delta)
157 struct gimple_df;
158 struct call_site_record_d;
159 struct dw_fde_node;
161 struct GTY(()) varasm_status {
162 /* If we're using a per-function constant pool, this is it. */
163 struct rtx_constant_pool *pool;
165 /* Number of tree-constants deferred during the expansion of this
166 function. */
167 unsigned int deferred_constants;
171 /* Data for function partitioning. */
172 struct GTY(()) function_subsections {
173 /* Assembly labels for the hot and cold text sections, to
174 be used by debugger functions for determining the size of text
175 sections. */
177 const char *hot_section_label;
178 const char *cold_section_label;
179 const char *hot_section_end_label;
180 const char *cold_section_end_label;
183 /* Describe an empty area of space in the stack frame. These can be chained
184 into a list; this is used to keep track of space wasted for alignment
185 reasons. */
186 struct GTY(()) frame_space
188 struct frame_space *next;
190 HOST_WIDE_INT start;
191 HOST_WIDE_INT length;
194 struct GTY(()) stack_usage
196 /* # of bytes of static stack space allocated by the function. */
197 HOST_WIDE_INT static_stack_size;
199 /* # of bytes of dynamic stack space allocated by the function. This is
200 meaningful only if has_unbounded_dynamic_stack_size is zero. */
201 HOST_WIDE_INT dynamic_stack_size;
203 /* # of bytes of space pushed onto the stack after the prologue. If
204 !ACCUMULATE_OUTGOING_ARGS, it contains the outgoing arguments. */
205 int pushed_stack_size;
207 /* Nonzero if the amount of stack space allocated dynamically cannot
208 be bounded at compile-time. */
209 unsigned int has_unbounded_dynamic_stack_size : 1;
212 #define current_function_static_stack_size (cfun->su->static_stack_size)
213 #define current_function_dynamic_stack_size (cfun->su->dynamic_stack_size)
214 #define current_function_pushed_stack_size (cfun->su->pushed_stack_size)
215 #define current_function_has_unbounded_dynamic_stack_size \
216 (cfun->su->has_unbounded_dynamic_stack_size)
217 #define current_function_allocates_dynamic_stack_space \
218 (current_function_dynamic_stack_size != 0 \
219 || current_function_has_unbounded_dynamic_stack_size)
221 /* This structure can save all the important global and static variables
222 describing the status of the current function. */
224 struct GTY(()) function {
225 struct eh_status *eh;
227 /* The control flow graph for this function. */
228 struct control_flow_graph *cfg;
230 /* GIMPLE body for this function. */
231 gimple_seq gimple_body;
233 /* SSA and dataflow information. */
234 struct gimple_df *gimple_df;
236 /* The loops in this function. */
237 struct loops *x_current_loops;
239 /* Filled by the GIMPLE and RTL FEs, pass to start compilation with. */
240 char *pass_startwith;
242 /* The stack usage of this function. */
243 struct stack_usage *su;
245 /* Value histograms attached to particular statements. */
246 htab_t GTY((skip)) value_histograms;
248 /* For function.c. */
250 /* Points to the FUNCTION_DECL of this function. */
251 tree decl;
253 /* A PARM_DECL that should contain the static chain for this function.
254 It will be initialized at the beginning of the function. */
255 tree static_chain_decl;
257 /* An expression that contains the non-local goto save area. The first
258 word is the saved frame pointer and the second is the saved stack
259 pointer. */
260 tree nonlocal_goto_save_area;
262 /* Vector of function local variables, functions, types and constants. */
263 vec<tree, va_gc> *local_decls;
265 /* In a Cilk function, the VAR_DECL for the frame descriptor. */
266 tree cilk_frame_decl;
268 /* For md files. */
270 /* tm.h can use this to store whatever it likes. */
271 struct machine_function * GTY ((maybe_undef)) machine;
273 /* Language-specific code can use this to store whatever it likes. */
274 struct language_function * language;
276 /* Used types hash table. */
277 hash_set<tree> *GTY (()) used_types_hash;
279 /* Dwarf2 Frame Description Entry, containing the Call Frame Instructions
280 used for unwinding. Only set when either dwarf2 unwinding or dwarf2
281 debugging is enabled. */
282 struct dw_fde_node *fde;
284 /* Last statement uid. */
285 int last_stmt_uid;
287 /* Function sequence number for profiling, debugging, etc. */
288 int funcdef_no;
290 /* Line number of the start of the function for debugging purposes. */
291 location_t function_start_locus;
293 /* Line number of the end of the function. */
294 location_t function_end_locus;
296 /* Properties used by the pass manager. */
297 unsigned int curr_properties;
298 unsigned int last_verified;
300 /* Non-null if the function does something that would prevent it from
301 being copied; this applies to both versioning and inlining. Set to
302 a string describing the reason for failure. */
303 const char * GTY((skip)) cannot_be_copied_reason;
305 /* Last assigned dependence info clique. */
306 unsigned short last_clique;
308 /* Collected bit flags. */
310 /* Number of units of general registers that need saving in stdarg
311 function. What unit is depends on the backend, either it is number
312 of bytes, or it can be number of registers. */
313 unsigned int va_list_gpr_size : 8;
315 /* Number of units of floating point registers that need saving in stdarg
316 function. */
317 unsigned int va_list_fpr_size : 8;
319 /* Nonzero if function being compiled can call setjmp. */
320 unsigned int calls_setjmp : 1;
322 /* Nonzero if function being compiled can call alloca,
323 either as a subroutine or builtin. */
324 unsigned int calls_alloca : 1;
326 /* This will indicate whether a function is a cilk function */
327 unsigned int is_cilk_function : 1;
329 /* Nonzero if this is a Cilk function that spawns. */
330 unsigned int calls_cilk_spawn : 1;
332 /* Nonzero if function being compiled receives nonlocal gotos
333 from nested functions. */
334 unsigned int has_nonlocal_label : 1;
336 /* Nonzero if function being compiled has a forced label
337 placed into static storage. */
338 unsigned int has_forced_label_in_static : 1;
340 /* Nonzero if we've set cannot_be_copied_reason. I.e. if
341 (cannot_be_copied_set && !cannot_be_copied_reason), the function
342 can in fact be copied. */
343 unsigned int cannot_be_copied_set : 1;
345 /* Nonzero if current function uses stdarg.h or equivalent. */
346 unsigned int stdarg : 1;
348 unsigned int after_inlining : 1;
349 unsigned int always_inline_functions_inlined : 1;
351 /* Nonzero if function being compiled can throw synchronous non-call
352 exceptions. */
353 unsigned int can_throw_non_call_exceptions : 1;
355 /* Nonzero if instructions that may throw exceptions but don't otherwise
356 contribute to the execution of the program can be deleted. */
357 unsigned int can_delete_dead_exceptions : 1;
359 /* Fields below this point are not set for abstract functions; see
360 allocate_struct_function. */
362 /* Nonzero if function being compiled needs to be given an address
363 where the value should be stored. */
364 unsigned int returns_struct : 1;
366 /* Nonzero if function being compiled needs to
367 return the address of where it has put a structure value. */
368 unsigned int returns_pcc_struct : 1;
370 /* Nonzero if this function has local DECL_HARD_REGISTER variables.
371 In this case code motion has to be done more carefully. */
372 unsigned int has_local_explicit_reg_vars : 1;
374 /* Nonzero if the current function is a thunk, i.e., a lightweight
375 function implemented by the output_mi_thunk hook) that just
376 adjusts one of its arguments and forwards to another
377 function. */
378 unsigned int is_thunk : 1;
380 /* Nonzero if the current function contains any loops with
381 loop->force_vectorize set. */
382 unsigned int has_force_vectorize_loops : 1;
384 /* Nonzero if the current function contains any loops with
385 nonzero value in loop->simduid. */
386 unsigned int has_simduid_loops : 1;
388 /* Set when the tail call has been identified. */
389 unsigned int tail_call_marked : 1;
392 /* Add the decl D to the local_decls list of FUN. */
394 void add_local_decl (struct function *fun, tree d);
396 #define FOR_EACH_LOCAL_DECL(FUN, I, D) \
397 FOR_EACH_VEC_SAFE_ELT_REVERSE ((FUN)->local_decls, I, D)
399 /* If va_list_[gf]pr_size is set to this, it means we don't know how
400 many units need to be saved. */
401 #define VA_LIST_MAX_GPR_SIZE 255
402 #define VA_LIST_MAX_FPR_SIZE 255
404 /* The function currently being compiled. */
405 extern GTY(()) struct function *cfun;
407 /* In order to ensure that cfun is not set directly, we redefine it so
408 that it is not an lvalue. Rather than assign to cfun, use
409 push_cfun or set_cfun. */
410 #define cfun (cfun + 0)
412 /* Nonzero if we've already converted virtual regs to hard regs. */
413 extern int virtuals_instantiated;
415 /* Nonzero if at least one trampoline has been created. */
416 extern int trampolines_created;
418 struct GTY((for_user)) types_used_by_vars_entry {
419 tree type;
420 tree var_decl;
423 struct used_type_hasher : ggc_ptr_hash<types_used_by_vars_entry>
425 static hashval_t hash (types_used_by_vars_entry *);
426 static bool equal (types_used_by_vars_entry *, types_used_by_vars_entry *);
429 /* Hash table making the relationship between a global variable
430 and the types it references in its initializer. The key of the
431 entry is a referenced type, and the value is the DECL of the global
432 variable. types_use_by_vars_do_hash and types_used_by_vars_eq below are
433 the hash and equality functions to use for this hash table. */
434 extern GTY(()) hash_table<used_type_hasher> *types_used_by_vars_hash;
436 void types_used_by_var_decl_insert (tree type, tree var_decl);
438 /* During parsing of a global variable, this vector contains the types
439 referenced by the global variable. */
440 extern GTY(()) vec<tree, va_gc> *types_used_by_cur_var_decl;
443 /* Return the loop tree of FN. */
445 inline struct loops *
446 loops_for_fn (struct function *fn)
448 return fn->x_current_loops;
451 /* Set the loop tree of FN to LOOPS. */
453 inline void
454 set_loops_for_fn (struct function *fn, struct loops *loops)
456 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL);
457 fn->x_current_loops = loops;
460 /* For backward compatibility... eventually these should all go away. */
461 #define current_function_funcdef_no (cfun->funcdef_no)
463 #define current_loops (cfun->x_current_loops)
464 #define dom_computed (cfun->cfg->x_dom_computed)
465 #define n_bbs_in_dom_tree (cfun->cfg->x_n_bbs_in_dom_tree)
466 #define VALUE_HISTOGRAMS(fun) (fun)->value_histograms
468 /* A pointer to a function to create target specific, per-function
469 data structures. */
470 extern struct machine_function * (*init_machine_status) (void);
472 enum direction {none, upward, downward};
474 /* Structure to record the size of a sequence of arguments
475 as the sum of a tree-expression and a constant. This structure is
476 also used to store offsets from the stack, which might be negative,
477 so the variable part must be ssizetype, not sizetype. */
479 struct args_size
481 HOST_WIDE_INT constant;
482 tree var;
485 /* Package up various arg related fields of struct args for
486 locate_and_pad_parm. */
487 struct locate_and_pad_arg_data
489 /* Size of this argument on the stack, rounded up for any padding it
490 gets. If REG_PARM_STACK_SPACE is defined, then register parms are
491 counted here, otherwise they aren't. */
492 struct args_size size;
493 /* Offset of this argument from beginning of stack-args. */
494 struct args_size offset;
495 /* Offset to the start of the stack slot. Different from OFFSET
496 if this arg pads downward. */
497 struct args_size slot_offset;
498 /* The amount that the stack pointer needs to be adjusted to
499 force alignment for the next argument. */
500 struct args_size alignment_pad;
501 /* Which way we should pad this arg. */
502 enum direction where_pad;
503 /* slot_offset is at least this aligned. */
504 unsigned int boundary;
507 /* Add the value of the tree INC to the `struct args_size' TO. */
509 #define ADD_PARM_SIZE(TO, INC) \
510 do { \
511 tree inc = (INC); \
512 if (tree_fits_shwi_p (inc)) \
513 (TO).constant += tree_to_shwi (inc); \
514 else if ((TO).var == 0) \
515 (TO).var = fold_convert (ssizetype, inc); \
516 else \
517 (TO).var = size_binop (PLUS_EXPR, (TO).var, \
518 fold_convert (ssizetype, inc)); \
519 } while (0)
521 #define SUB_PARM_SIZE(TO, DEC) \
522 do { \
523 tree dec = (DEC); \
524 if (tree_fits_shwi_p (dec)) \
525 (TO).constant -= tree_to_shwi (dec); \
526 else if ((TO).var == 0) \
527 (TO).var = size_binop (MINUS_EXPR, ssize_int (0), \
528 fold_convert (ssizetype, dec)); \
529 else \
530 (TO).var = size_binop (MINUS_EXPR, (TO).var, \
531 fold_convert (ssizetype, dec)); \
532 } while (0)
534 /* Convert the implicit sum in a `struct args_size' into a tree
535 of type ssizetype. */
536 #define ARGS_SIZE_TREE(SIZE) \
537 ((SIZE).var == 0 ? ssize_int ((SIZE).constant) \
538 : size_binop (PLUS_EXPR, fold_convert (ssizetype, (SIZE).var), \
539 ssize_int ((SIZE).constant)))
541 /* Convert the implicit sum in a `struct args_size' into an rtx. */
542 #define ARGS_SIZE_RTX(SIZE) \
543 ((SIZE).var == 0 ? GEN_INT ((SIZE).constant) \
544 : expand_normal (ARGS_SIZE_TREE (SIZE)))
546 #define ASLK_REDUCE_ALIGN 1
547 #define ASLK_RECORD_PAD 2
549 /* If pointers to member functions use the least significant bit to
550 indicate whether a function is virtual, ensure a pointer
551 to this function will have that bit clear. */
552 #define MINIMUM_METHOD_BOUNDARY \
553 ((TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn) \
554 ? MAX (FUNCTION_BOUNDARY, 2 * BITS_PER_UNIT) : FUNCTION_BOUNDARY)
558 extern void push_function_context (void);
559 extern void pop_function_context (void);
561 /* Save and restore status information for a nested function. */
562 extern void free_after_parsing (struct function *);
563 extern void free_after_compilation (struct function *);
565 /* Return size needed for stack frame based on slots so far allocated.
566 This size counts from zero. It is not rounded to STACK_BOUNDARY;
567 the caller may have to do that. */
568 extern HOST_WIDE_INT get_frame_size (void);
570 /* Issue an error message and return TRUE if frame OFFSET overflows in
571 the signed target pointer arithmetics for function FUNC. Otherwise
572 return FALSE. */
573 extern bool frame_offset_overflow (HOST_WIDE_INT, tree);
575 extern unsigned int spill_slot_alignment (machine_mode);
577 extern rtx assign_stack_local_1 (machine_mode, HOST_WIDE_INT, int, int);
578 extern rtx assign_stack_local (machine_mode, HOST_WIDE_INT, int);
579 extern rtx assign_stack_temp_for_type (machine_mode, HOST_WIDE_INT, tree);
580 extern rtx assign_stack_temp (machine_mode, HOST_WIDE_INT);
581 extern rtx assign_temp (tree, int, int);
582 extern void update_temp_slot_address (rtx, rtx);
583 extern void preserve_temp_slots (rtx);
584 extern void free_temp_slots (void);
585 extern void push_temp_slots (void);
586 extern void pop_temp_slots (void);
587 extern void init_temp_slots (void);
588 extern rtx get_hard_reg_initial_reg (rtx);
589 extern rtx get_hard_reg_initial_val (machine_mode, unsigned int);
590 extern rtx has_hard_reg_initial_val (machine_mode, unsigned int);
592 /* Called from gimple_expand_cfg. */
593 extern unsigned int emit_initial_value_sets (void);
595 extern bool initial_value_entry (int i, rtx *, rtx *);
596 extern void instantiate_decl_rtl (rtx x);
597 extern int aggregate_value_p (const_tree, const_tree);
598 extern bool use_register_for_decl (const_tree);
599 extern gimple_seq gimplify_parameters (void);
600 extern void locate_and_pad_parm (machine_mode, tree, int, int, int,
601 tree, struct args_size *,
602 struct locate_and_pad_arg_data *);
603 extern void generate_setjmp_warnings (void);
605 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
606 and create duplicate blocks. */
607 extern void reorder_blocks (void);
608 extern void clear_block_marks (tree);
609 extern tree blocks_nreverse (tree);
610 extern tree block_chainon (tree, tree);
612 /* Set BLOCK_NUMBER for all the blocks in FN. */
613 extern void number_blocks (tree);
615 /* cfun shouldn't be set directly; use one of these functions instead. */
616 extern void set_cfun (struct function *new_cfun, bool force = false);
617 extern void push_cfun (struct function *new_cfun);
618 extern void pop_cfun (void);
620 extern int get_next_funcdef_no (void);
621 extern int get_last_funcdef_no (void);
622 extern void allocate_struct_function (tree, bool);
623 extern void push_struct_function (tree fndecl);
624 extern void push_dummy_function (bool);
625 extern void pop_dummy_function (void);
626 extern void init_dummy_function_start (void);
627 extern void init_function_start (tree);
628 extern void stack_protect_epilogue (void);
629 extern void expand_function_start (tree);
630 extern void expand_dummy_function_end (void);
632 extern void thread_prologue_and_epilogue_insns (void);
633 extern void diddle_return_value (void (*)(rtx, void*), void*);
634 extern void clobber_return_register (void);
635 extern void expand_function_end (void);
636 extern rtx get_arg_pointer_save_area (void);
637 extern void maybe_copy_prologue_epilogue_insn (rtx, rtx);
638 extern int prologue_contains (const rtx_insn *);
639 extern int epilogue_contains (const rtx_insn *);
640 extern int prologue_epilogue_contains (const rtx_insn *);
641 extern void record_prologue_seq (rtx_insn *);
642 extern void record_epilogue_seq (rtx_insn *);
643 extern void emit_return_into_block (bool simple_p, basic_block bb);
644 extern void set_return_jump_label (rtx_insn *);
645 extern bool active_insn_between (rtx_insn *head, rtx_insn *tail);
646 extern vec<edge> convert_jumps_to_returns (basic_block last_bb, bool simple_p,
647 vec<edge> unconverted);
648 extern basic_block emit_return_for_exit (edge exit_fallthru_edge,
649 bool simple_p);
650 extern void reposition_prologue_and_epilogue_notes (void);
652 /* Returns the name of the current function. */
653 extern const char *fndecl_name (tree);
654 extern const char *function_name (struct function *);
655 extern const char *current_function_name (void);
657 extern void used_types_insert (tree);
659 #endif /* GCC_FUNCTION_H */