1/* Structure for saving state for a nested function.
2 Copyright (C) 1989-2017 Free Software Foundation, Inc.
3
4This file is part of GCC.
5
6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
9version.
10
11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14for more details.
15
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3. If not see
18<http://www.gnu.org/licenses/>. */
19
20#ifndef GCC_FUNCTION_H
21#define GCC_FUNCTION_H
22
23
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. */
28
29struct 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;
34};
35
36struct GTY(()) emit_status {
37 void ensure_regno_capacity ();
38
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;
42
43 /* Lowest label number in current function. */
44 int x_first_label_num;
45
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.
49
50 start_sequence saves both of these on seq.next and then starts
51 a new, nested sequence of insns.
52
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;
57
58 /* INSN_UID for next insn emitted.
59 Reset to 1 for each function compiled. */
60 int x_cur_insn_uid;
61
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;
65
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;
71
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;
76};
77
78
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.
83
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. */
86
87extern GTY ((length ("crtl->emit.x_reg_rtx_no"))) rtx * regno_reg_rtx;
88
89/* For backward compatibility... eventually these should all go away. */
90#define reg_rtx_no (crtl->emit.x_reg_rtx_no)
91
92#define REGNO_POINTER_ALIGN(REGNO) (crtl->emit.regno_pointer_align[REGNO])
93
94struct 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;
98
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.)
109
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;
115
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;
121
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;
126
127 /* Similarly for __builtin_apply_args. */
128 rtx x_apply_args_value;
129
130 /* List of labels that must never be deleted. */
131 vec<rtx_insn *, va_gc> *x_forced_labels;
132};
133
134typedef struct call_site_record_d *call_site_record;
135
136/* RTL representation of exception handling. */
137struct GTY(()) rtl_eh {
138 rtx ehr_stackadj;
139 rtx ehr_handler;
140 rtx_code_label *ehr_label;
141
142 rtx sjlj_fc;
143 rtx_insn *sjlj_exit_after;
144
145 vec<uchar, va_gc> *action_record_data;
146
147 vec<call_site_record, va_gc> *call_site_record_v[2];
148};
149
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)
156
157struct gimple_df;
158struct call_site_record_d;
159struct dw_fde_node;
160
161struct GTY(()) varasm_status {
162 /* If we're using a per-function constant pool, this is it. */
163 struct rtx_constant_pool *pool;
164
165 /* Number of tree-constants deferred during the expansion of this
166 function. */
167 unsigned int deferred_constants;
168};
169
170
171/* Data for function partitioning. */
172struct 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. */
176
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;
181};
182
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. */
186struct GTY(()) frame_space
187{
188 struct frame_space *next;
189
190 HOST_WIDE_INT start;
191 HOST_WIDE_INT length;
192};
193
194struct GTY(()) stack_usage
195{
196 /* # of bytes of static stack space allocated by the function. */
197 HOST_WIDE_INT static_stack_size;
198
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;
202
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;
206
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;
210};
211
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)
220
221/* This structure can save all the important global and static variables
222 describing the status of the current function. */
223
224struct GTY(()) function {
225 struct eh_status *eh;
226
227 /* The control flow graph for this function. */
228 struct control_flow_graph *cfg;
229
230 /* GIMPLE body for this function. */
231 gimple_seq gimple_body;
232
233 /* SSA and dataflow information. */
234 struct gimple_df *gimple_df;
235
236 /* The loops in this function. */
237 struct loops *x_current_loops;
238
239 /* Filled by the GIMPLE and RTL FEs, pass to start compilation with. */
240 char *pass_startwith;
241
242 /* The stack usage of this function. */
243 struct stack_usage *su;
244
245 /* Value histograms attached to particular statements. */
246 htab_t GTY((skip)) value_histograms;
247
248 /* For function.c. */
249
250 /* Points to the FUNCTION_DECL of this function. */
251 tree decl;
252
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;
256
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;
261
262 /* Vector of function local variables, functions, types and constants. */
263 vec<tree, va_gc> *local_decls;
264
265 /* For md files. */
266
267 /* tm.h can use this to store whatever it likes. */
268 struct machine_function * GTY ((maybe_undef)) machine;
269
270 /* Language-specific code can use this to store whatever it likes. */
271 struct language_function * language;
272
273 /* Used types hash table. */
274 hash_set<tree> *GTY (()) used_types_hash;
275
276 /* Dwarf2 Frame Description Entry, containing the Call Frame Instructions
277 used for unwinding. Only set when either dwarf2 unwinding or dwarf2
278 debugging is enabled. */
279 struct dw_fde_node *fde;
280
281 /* Last statement uid. */
282 int last_stmt_uid;
283
284 /* Debug marker counter. Count begin stmt markers. We don't have
285 to keep it exact, it's more of a rough estimate to enable us to
286 decide whether they are too many to copy during inlining, or when
287 expanding to RTL. */
288 int debug_marker_count;
289
290 /* Function sequence number for profiling, debugging, etc. */
291 int funcdef_no;
292
293 /* Line number of the start of the function for debugging purposes. */
294 location_t function_start_locus;
295
296 /* Line number of the end of the function. */
297 location_t function_end_locus;
298
299 /* Properties used by the pass manager. */
300 unsigned int curr_properties;
301 unsigned int last_verified;
302
303 /* Non-null if the function does something that would prevent it from
304 being copied; this applies to both versioning and inlining. Set to
305 a string describing the reason for failure. */
306 const char * GTY((skip)) cannot_be_copied_reason;
307
308 /* Last assigned dependence info clique. */
309 unsigned short last_clique;
310
311 /* Collected bit flags. */
312
313 /* Number of units of general registers that need saving in stdarg
314 function. What unit is depends on the backend, either it is number
315 of bytes, or it can be number of registers. */
316 unsigned int va_list_gpr_size : 8;
317
318 /* Number of units of floating point registers that need saving in stdarg
319 function. */
320 unsigned int va_list_fpr_size : 8;
321
322 /* Nonzero if function being compiled can call setjmp. */
323 unsigned int calls_setjmp : 1;
324
325 /* Nonzero if function being compiled can call alloca,
326 either as a subroutine or builtin. */
327 unsigned int calls_alloca : 1;
328
329 /* Nonzero if function being compiled receives nonlocal gotos
330 from nested functions. */
331 unsigned int has_nonlocal_label : 1;
332
333 /* Nonzero if function being compiled has a forced label
334 placed into static storage. */
335 unsigned int has_forced_label_in_static : 1;
336
337 /* Nonzero if we've set cannot_be_copied_reason. I.e. if
338 (cannot_be_copied_set && !cannot_be_copied_reason), the function
339 can in fact be copied. */
340 unsigned int cannot_be_copied_set : 1;
341
342 /* Nonzero if current function uses stdarg.h or equivalent. */
343 unsigned int stdarg : 1;
344
345 unsigned int after_inlining : 1;
346 unsigned int always_inline_functions_inlined : 1;
347
348 /* Nonzero if function being compiled can throw synchronous non-call
349 exceptions. */
350 unsigned int can_throw_non_call_exceptions : 1;
351
352 /* Nonzero if instructions that may throw exceptions but don't otherwise
353 contribute to the execution of the program can be deleted. */
354 unsigned int can_delete_dead_exceptions : 1;
355
356 /* Fields below this point are not set for abstract functions; see
357 allocate_struct_function. */
358
359 /* Nonzero if function being compiled needs to be given an address
360 where the value should be stored. */
361 unsigned int returns_struct : 1;
362
363 /* Nonzero if function being compiled needs to
364 return the address of where it has put a structure value. */
365 unsigned int returns_pcc_struct : 1;
366
367 /* Nonzero if this function has local DECL_HARD_REGISTER variables.
368 In this case code motion has to be done more carefully. */
369 unsigned int has_local_explicit_reg_vars : 1;
370
371 /* Nonzero if the current function is a thunk, i.e., a lightweight
372 function implemented by the output_mi_thunk hook) that just
373 adjusts one of its arguments and forwards to another
374 function. */
375 unsigned int is_thunk : 1;
376
377 /* Nonzero if the current function contains any loops with
378 loop->force_vectorize set. */
379 unsigned int has_force_vectorize_loops : 1;
380
381 /* Nonzero if the current function contains any loops with
382 nonzero value in loop->simduid. */
383 unsigned int has_simduid_loops : 1;
384
385 /* Nonzero when the tail call has been identified. */
386 unsigned int tail_call_marked : 1;
387
388 /* Nonzero if the current function contains a #pragma GCC unroll. */
389 unsigned int has_unroll : 1;
390
391 /* Set when the function was compiled with generation of debug
392 (begin stmt, inline entry, ...) markers enabled. */
393 unsigned int debug_nonbind_markers : 1;
394};
395
396/* Add the decl D to the local_decls list of FUN. */
397
398void add_local_decl (struct function *fun, tree d);
399
400#define FOR_EACH_LOCAL_DECL(FUN, I, D) \
401 FOR_EACH_VEC_SAFE_ELT_REVERSE ((FUN)->local_decls, I, D)
402
403/* If va_list_[gf]pr_size is set to this, it means we don't know how
404 many units need to be saved. */
405#define VA_LIST_MAX_GPR_SIZE 255
406#define VA_LIST_MAX_FPR_SIZE 255
407
408/* The function currently being compiled. */
409extern GTY(()) struct function *cfun;
410
411/* In order to ensure that cfun is not set directly, we redefine it so
412 that it is not an lvalue. Rather than assign to cfun, use
413 push_cfun or set_cfun. */
414#define cfun (cfun + 0)
415
416/* Nonzero if we've already converted virtual regs to hard regs. */
417extern int virtuals_instantiated;
418
419/* Nonzero if at least one trampoline has been created. */
420extern int trampolines_created;
421
422struct GTY((for_user)) types_used_by_vars_entry {
423 tree type;
424 tree var_decl;
425};
426
427struct used_type_hasher : ggc_ptr_hash<types_used_by_vars_entry>
428{
429 static hashval_t hash (types_used_by_vars_entry *);
430 static bool equal (types_used_by_vars_entry *, types_used_by_vars_entry *);
431};
432
433/* Hash table making the relationship between a global variable
434 and the types it references in its initializer. The key of the
435 entry is a referenced type, and the value is the DECL of the global
436 variable. types_use_by_vars_do_hash and types_used_by_vars_eq below are
437 the hash and equality functions to use for this hash table. */
438extern GTY(()) hash_table<used_type_hasher> *types_used_by_vars_hash;
439
440void types_used_by_var_decl_insert (tree type, tree var_decl);
441
442/* During parsing of a global variable, this vector contains the types
443 referenced by the global variable. */
444extern GTY(()) vec<tree, va_gc> *types_used_by_cur_var_decl;
445
446
447/* Return the loop tree of FN. */
448
449inline struct loops *
450loops_for_fn (struct function *fn)
451{
452 return fn->x_current_loops;
453}
454
455/* Set the loop tree of FN to LOOPS. */
456
457inline void
458set_loops_for_fn (struct function *fn, struct loops *loops)
459{
460 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL);
461 fn->x_current_loops = loops;
462}
463
464/* For backward compatibility... eventually these should all go away. */
465#define current_function_funcdef_no (cfun->funcdef_no)
466
467#define current_loops (cfun->x_current_loops)
468#define dom_computed (cfun->cfg->x_dom_computed)
469#define n_bbs_in_dom_tree (cfun->cfg->x_n_bbs_in_dom_tree)
470#define VALUE_HISTOGRAMS(fun) (fun)->value_histograms
471
472/* A pointer to a function to create target specific, per-function
473 data structures. */
474extern struct machine_function * (*init_machine_status) (void);
475
476/* Structure to record the size of a sequence of arguments
477 as the sum of a tree-expression and a constant. This structure is
478 also used to store offsets from the stack, which might be negative,
479 so the variable part must be ssizetype, not sizetype. */
480
481struct args_size
482{
483 HOST_WIDE_INT constant;
484 tree var;
485};
486
487/* Package up various arg related fields of struct args for
488 locate_and_pad_parm. */
489struct locate_and_pad_arg_data
490{
491 /* Size of this argument on the stack, rounded up for any padding it
492 gets. If REG_PARM_STACK_SPACE is defined, then register parms are
493 counted here, otherwise they aren't. */
494 struct args_size size;
495 /* Offset of this argument from beginning of stack-args. */
496 struct args_size offset;
497 /* Offset to the start of the stack slot. Different from OFFSET
498 if this arg pads downward. */
499 struct args_size slot_offset;
500 /* The amount that the stack pointer needs to be adjusted to
501 force alignment for the next argument. */
502 struct args_size alignment_pad;
503 /* Which way we should pad this arg. */
504 pad_direction where_pad;
505 /* slot_offset is at least this aligned. */
506 unsigned int boundary;
507};
508
509/* Add the value of the tree INC to the `struct args_size' TO. */
510
511#define ADD_PARM_SIZE(TO, INC) \
512do { \
513 tree inc = (INC); \
514 if (tree_fits_shwi_p (inc)) \
515 (TO).constant += tree_to_shwi (inc); \
516 else if ((TO).var == 0) \
517 (TO).var = fold_convert (ssizetype, inc); \
518 else \
519 (TO).var = size_binop (PLUS_EXPR, (TO).var, \
520 fold_convert (ssizetype, inc)); \
521} while (0)
522
523#define SUB_PARM_SIZE(TO, DEC) \
524do { \
525 tree dec = (DEC); \
526 if (tree_fits_shwi_p (dec)) \
527 (TO).constant -= tree_to_shwi (dec); \
528 else if ((TO).var == 0) \
529 (TO).var = size_binop (MINUS_EXPR, ssize_int (0), \
530 fold_convert (ssizetype, dec)); \
531 else \
532 (TO).var = size_binop (MINUS_EXPR, (TO).var, \
533 fold_convert (ssizetype, dec)); \
534} while (0)
535
536/* Convert the implicit sum in a `struct args_size' into a tree
537 of type ssizetype. */
538#define ARGS_SIZE_TREE(SIZE) \
539((SIZE).var == 0 ? ssize_int ((SIZE).constant) \
540 : size_binop (PLUS_EXPR, fold_convert (ssizetype, (SIZE).var), \
541 ssize_int ((SIZE).constant)))
542
543/* Convert the implicit sum in a `struct args_size' into an rtx. */
544#define ARGS_SIZE_RTX(SIZE) \
545((SIZE).var == 0 ? GEN_INT ((SIZE).constant) \
546 : expand_normal (ARGS_SIZE_TREE (SIZE)))
547
548#define ASLK_REDUCE_ALIGN 1
549#define ASLK_RECORD_PAD 2
550
551/* If pointers to member functions use the least significant bit to
552 indicate whether a function is virtual, ensure a pointer
553 to this function will have that bit clear. */
554#define MINIMUM_METHOD_BOUNDARY \
555 ((TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn) \
556 ? MAX (FUNCTION_BOUNDARY, 2 * BITS_PER_UNIT) : FUNCTION_BOUNDARY)
557
558enum stack_clash_probes {
559 NO_PROBE_NO_FRAME,
560 NO_PROBE_SMALL_FRAME,
561 PROBE_INLINE,
562 PROBE_LOOP
563};
564
565extern void dump_stack_clash_frame_info (enum stack_clash_probes, bool);
566
567
568extern void push_function_context (void);
569extern void pop_function_context (void);
570
571/* Save and restore status information for a nested function. */
572extern void free_after_parsing (struct function *);
573extern void free_after_compilation (struct function *);
574
575/* Return size needed for stack frame based on slots so far allocated.
576 This size counts from zero. It is not rounded to STACK_BOUNDARY;
577 the caller may have to do that. */
578extern HOST_WIDE_INT get_frame_size (void);
579
580/* Issue an error message and return TRUE if frame OFFSET overflows in
581 the signed target pointer arithmetics for function FUNC. Otherwise
582 return FALSE. */
583extern bool frame_offset_overflow (HOST_WIDE_INT, tree);
584
585extern unsigned int spill_slot_alignment (machine_mode);
586
587extern rtx assign_stack_local_1 (machine_mode, HOST_WIDE_INT, int, int);
588extern rtx assign_stack_local (machine_mode, HOST_WIDE_INT, int);
589extern rtx assign_stack_temp_for_type (machine_mode, HOST_WIDE_INT, tree);
590extern rtx assign_stack_temp (machine_mode, HOST_WIDE_INT);
591extern rtx assign_temp (tree, int, int);
592extern void update_temp_slot_address (rtx, rtx);
593extern void preserve_temp_slots (rtx);
594extern void free_temp_slots (void);
595extern void push_temp_slots (void);
596extern void pop_temp_slots (void);
597extern void init_temp_slots (void);
598extern rtx get_hard_reg_initial_reg (rtx);
599extern rtx get_hard_reg_initial_val (machine_mode, unsigned int);
600extern rtx has_hard_reg_initial_val (machine_mode, unsigned int);
601
602/* Called from gimple_expand_cfg. */
603extern unsigned int emit_initial_value_sets (void);
604
605extern bool initial_value_entry (int i, rtx *, rtx *);
606extern void instantiate_decl_rtl (rtx x);
607extern int aggregate_value_p (const_tree, const_tree);
608extern bool use_register_for_decl (const_tree);
609extern gimple_seq gimplify_parameters (void);
610extern void locate_and_pad_parm (machine_mode, tree, int, int, int,
611 tree, struct args_size *,
612 struct locate_and_pad_arg_data *);
613extern void generate_setjmp_warnings (void);
614
615/* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
616 and create duplicate blocks. */
617extern void reorder_blocks (void);
618extern void clear_block_marks (tree);
619extern tree blocks_nreverse (tree);
620extern tree block_chainon (tree, tree);
621
622/* Set BLOCK_NUMBER for all the blocks in FN. */
623extern void number_blocks (tree);
624
625/* cfun shouldn't be set directly; use one of these functions instead. */
626extern void set_cfun (struct function *new_cfun, bool force = false);
627extern void push_cfun (struct function *new_cfun);
628extern void pop_cfun (void);
629
630extern int get_next_funcdef_no (void);
631extern int get_last_funcdef_no (void);
632extern void allocate_struct_function (tree, bool);
633extern void push_struct_function (tree fndecl);
634extern void push_dummy_function (bool);
635extern void pop_dummy_function (void);
636extern void init_dummy_function_start (void);
637extern void init_function_start (tree);
638extern void stack_protect_epilogue (void);
639extern void expand_function_start (tree);
640extern void expand_dummy_function_end (void);
641
642extern void thread_prologue_and_epilogue_insns (void);
643extern void diddle_return_value (void (*)(rtx, void*), void*);
644extern void clobber_return_register (void);
645extern void expand_function_end (void);
646extern rtx get_arg_pointer_save_area (void);
647extern void maybe_copy_prologue_epilogue_insn (rtx, rtx);
648extern int prologue_contains (const rtx_insn *);
649extern int epilogue_contains (const rtx_insn *);
650extern int prologue_epilogue_contains (const rtx_insn *);
651extern void record_prologue_seq (rtx_insn *);
652extern void record_epilogue_seq (rtx_insn *);
653extern void emit_return_into_block (bool simple_p, basic_block bb);
654extern void set_return_jump_label (rtx_insn *);
655extern bool active_insn_between (rtx_insn *head, rtx_insn *tail);
656extern vec<edge> convert_jumps_to_returns (basic_block last_bb, bool simple_p,
657 vec<edge> unconverted);
658extern basic_block emit_return_for_exit (edge exit_fallthru_edge,
659 bool simple_p);
660extern void reposition_prologue_and_epilogue_notes (void);
661
662/* Returns the name of the current function. */
663extern const char *fndecl_name (tree);
664extern const char *function_name (struct function *);
665extern const char *current_function_name (void);
666
667extern void used_types_insert (tree);
668
669#endif /* GCC_FUNCTION_H */
670