[RS6000] biarch test fail
[official-gcc.git] / gcc / emit-rtl.h
blob92ad0dd6fc0e1b010d053b8e6c18492489b9b785
1 /* Exported functions from emit-rtl.c
2 Copyright (C) 2004-2020 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_EMIT_RTL_H
21 #define GCC_EMIT_RTL_H
23 class temp_slot;
24 typedef class temp_slot *temp_slot_p;
25 class predefined_function_abi;
27 /* Information mainlined about RTL representation of incoming arguments. */
28 struct GTY(()) incoming_args {
29 /* Number of bytes of args popped by function being compiled on its return.
30 Zero if no bytes are to be popped.
31 May affect compilation of return insn or of function epilogue. */
32 poly_int64_pod pops_args;
34 /* If function's args have a fixed size, this is that size, in bytes.
35 Otherwise, it is -1.
36 May affect compilation of return insn or of function epilogue. */
37 poly_int64_pod size;
39 /* # bytes the prologue should push and pretend that the caller pushed them.
40 The prologue must do this, but only if parms can be passed in
41 registers. */
42 int pretend_args_size;
44 /* This is the offset from the arg pointer to the place where the first
45 anonymous arg can be found, if there is one. */
46 rtx arg_offset_rtx;
48 /* Quantities of various kinds of registers
49 used for the current function's args. */
50 CUMULATIVE_ARGS info;
52 /* The arg pointer hard register, or the pseudo into which it was copied. */
53 rtx internal_arg_pointer;
57 /* Datastructures maintained for currently processed function in RTL form. */
58 struct GTY(()) rtl_data {
59 void init_stack_alignment ();
61 struct expr_status expr;
62 struct emit_status emit;
63 struct varasm_status varasm;
64 struct incoming_args args;
65 struct function_subsections subsections;
66 struct rtl_eh eh;
68 /* The ABI of the function, i.e. the interface it presents to its callers.
69 This is the ABI that should be queried to see which registers the
70 function needs to save before it uses them.
72 Other functions (including those called by this function) might use
73 different ABIs. */
74 const predefined_function_abi *GTY((skip)) abi;
76 /* For function.c */
78 /* # of bytes of outgoing arguments. If ACCUMULATE_OUTGOING_ARGS is
79 defined, the needed space is pushed by the prologue. */
80 poly_int64_pod outgoing_args_size;
82 /* If nonzero, an RTL expression for the location at which the current
83 function returns its result. If the current function returns its
84 result in a register, current_function_return_rtx will always be
85 the hard register containing the result. */
86 rtx return_rtx;
88 /* Vector of initial-value pairs. Each pair consists of a pseudo
89 register of approprite mode that stores the initial value a hard
90 register REGNO, and that hard register itself. */
91 /* ??? This could be a VEC but there is currently no way to define an
92 opaque VEC type. */
93 struct initial_value_struct *hard_reg_initial_vals;
95 /* A variable living at the top of the frame that holds a known value.
96 Used for detecting stack clobbers. */
97 tree stack_protect_guard;
99 /* The __stack_chk_guard variable or expression holding the stack
100 protector canary value. */
101 tree stack_protect_guard_decl;
103 /* List (chain of INSN_LIST) of labels heading the current handlers for
104 nonlocal gotos. */
105 rtx_insn_list *x_nonlocal_goto_handler_labels;
107 /* Label that will go on function epilogue.
108 Jumping to this label serves as a "return" instruction
109 on machines which require execution of the epilogue on all returns. */
110 rtx_code_label *x_return_label;
112 /* Label that will go on the end of function epilogue.
113 Jumping to this label serves as a "naked return" instruction
114 on machines which require execution of the epilogue on all returns. */
115 rtx_code_label *x_naked_return_label;
117 /* List (chain of EXPR_LISTs) of all stack slots in this function.
118 Made for the sake of unshare_all_rtl. */
119 vec<rtx, va_gc> *x_stack_slot_list;
121 /* List of empty areas in the stack frame. */
122 class frame_space *frame_space_list;
124 /* Place after which to insert the tail_recursion_label if we need one. */
125 rtx_note *x_stack_check_probe_note;
127 /* Location at which to save the argument pointer if it will need to be
128 referenced. There are two cases where this is done: if nonlocal gotos
129 exist, or if vars stored at an offset from the argument pointer will be
130 needed by inner routines. */
131 rtx x_arg_pointer_save_area;
133 /* Dynamic Realign Argument Pointer used for realigning stack. */
134 rtx drap_reg;
136 /* Offset to end of allocated area of stack frame.
137 If stack grows down, this is the address of the last stack slot allocated.
138 If stack grows up, this is the address for the next slot. */
139 poly_int64_pod x_frame_offset;
141 /* Insn after which register parms and SAVE_EXPRs are born, if nonopt. */
142 rtx_insn *x_parm_birth_insn;
144 /* List of all used temporaries allocated, by level. */
145 vec<temp_slot_p, va_gc> *x_used_temp_slots;
147 /* List of available temp slots. */
148 class temp_slot *x_avail_temp_slots;
150 /* Current nesting level for temporaries. */
151 int x_temp_slot_level;
153 /* The largest alignment needed on the stack, including requirement
154 for outgoing stack alignment. */
155 unsigned int stack_alignment_needed;
157 /* Preferred alignment of the end of stack frame, which is preferred
158 to call other functions. */
159 unsigned int preferred_stack_boundary;
161 /* The minimum alignment of parameter stack. */
162 unsigned int parm_stack_boundary;
164 /* The largest alignment of slot allocated on the stack. */
165 unsigned int max_used_stack_slot_alignment;
167 /* The stack alignment estimated before reload, with consideration of
168 following factors:
169 1. Alignment of local stack variables (max_used_stack_slot_alignment)
170 2. Alignment requirement to call other functions
171 (preferred_stack_boundary)
172 3. Alignment of non-local stack variables but might be spilled in
173 local stack. */
174 unsigned int stack_alignment_estimated;
176 /* How many NOP insns to place at each function entry by default. */
177 unsigned short patch_area_size;
179 /* How far the real asm entry point is into this area. */
180 unsigned short patch_area_entry;
182 /* For reorg. */
184 /* Nonzero if function being compiled called builtin_return_addr or
185 builtin_frame_address with nonzero count. */
186 bool accesses_prior_frames;
188 /* Nonzero if the function calls __builtin_eh_return. */
189 bool calls_eh_return;
191 /* Nonzero if function saves all registers, e.g. if it has a nonlocal
192 label that can reach the exit block via non-exceptional paths. */
193 bool saves_all_registers;
195 /* Nonzero if function being compiled has nonlocal gotos to parent
196 function. */
197 bool has_nonlocal_goto;
199 /* Nonzero if function being compiled has an asm statement. */
200 bool has_asm_statement;
202 /* This bit is used by the exception handling logic. It is set if all
203 calls (if any) are sibling calls. Such functions do not have to
204 have EH tables generated, as they cannot throw. A call to such a
205 function, however, should be treated as throwing if any of its callees
206 can throw. */
207 bool all_throwers_are_sibcalls;
209 /* Nonzero if stack limit checking should be enabled in the current
210 function. */
211 bool limit_stack;
213 /* Nonzero if profiling code should be generated. */
214 bool profile;
216 /* Nonzero if the current function uses the constant pool. */
217 bool uses_const_pool;
219 /* Nonzero if the current function uses pic_offset_table_rtx. */
220 bool uses_pic_offset_table;
222 /* Nonzero if the current function needs an lsda for exception handling. */
223 bool uses_eh_lsda;
225 /* Set when the tail call has been produced. */
226 bool tail_call_emit;
228 /* Nonzero if code to initialize arg_pointer_save_area has been emitted. */
229 bool arg_pointer_save_area_init;
231 /* Nonzero if current function must be given a frame pointer.
232 Set in reload1.c or lra-eliminations.c if anything is allocated
233 on the stack there. */
234 bool frame_pointer_needed;
236 /* When set, expand should optimize for speed. */
237 bool maybe_hot_insn_p;
239 /* Nonzero if function stack realignment is needed. This flag may be
240 set twice: before and after reload. It is set before reload wrt
241 stack alignment estimation before reload. It will be changed after
242 reload if by then criteria of stack realignment is different.
243 The value set after reload is the accurate one and is finalized. */
244 bool stack_realign_needed;
246 /* Nonzero if function stack realignment is tried. This flag is set
247 only once before reload. It affects register elimination. This
248 is used to generate DWARF debug info for stack variables. */
249 bool stack_realign_tried;
251 /* Nonzero if function being compiled needs dynamic realigned
252 argument pointer (drap) if stack needs realigning. */
253 bool need_drap;
255 /* Nonzero if function stack realignment estimation is done, namely
256 stack_realign_needed flag has been set before reload wrt estimated
257 stack alignment info. */
258 bool stack_realign_processed;
260 /* Nonzero if function stack realignment has been finalized, namely
261 stack_realign_needed flag has been set and finalized after reload. */
262 bool stack_realign_finalized;
264 /* True if dbr_schedule has already been called for this function. */
265 bool dbr_scheduled_p;
267 /* True if current function cannot throw. Unlike
268 TREE_NOTHROW (current_function_decl) it is set even for overwritable
269 function where currently compiled version of it is nothrow. */
270 bool nothrow;
272 /* True if we performed shrink-wrapping for the current function. */
273 bool shrink_wrapped;
275 /* True if we performed shrink-wrapping for separate components for
276 the current function. */
277 bool shrink_wrapped_separate;
279 /* Nonzero if function being compiled doesn't modify the stack pointer
280 (ignoring the prologue and epilogue). This is only valid after
281 pass_stack_ptr_mod has run. */
282 bool sp_is_unchanging;
284 /* True if the stack pointer is clobbered by asm statement. */
285 bool sp_is_clobbered_by_asm;
287 /* Nonzero if function being compiled doesn't contain any calls
288 (ignoring the prologue and epilogue). This is set prior to
289 register allocation in IRA and is valid for the remaining
290 compiler passes. */
291 bool is_leaf;
293 /* Nonzero if the function being compiled is a leaf function which only
294 uses leaf registers. This is valid after reload (specifically after
295 sched2) and is useful only if the port defines LEAF_REGISTERS. */
296 bool uses_only_leaf_regs;
298 /* Nonzero if the function being compiled has undergone hot/cold partitioning
299 (under flag_reorder_blocks_and_partition) and has at least one cold
300 block. */
301 bool has_bb_partition;
303 /* Nonzero if the function being compiled has completed the bb reordering
304 pass. */
305 bool bb_reorder_complete;
307 /* Like regs_ever_live, but 1 if a reg is set or clobbered from an
308 asm. Unlike regs_ever_live, elements of this array corresponding
309 to eliminable regs (like the frame pointer) are set if an asm
310 sets them. */
311 HARD_REG_SET asm_clobbers;
313 /* The highest address seen during shorten_branches. */
314 int max_insn_address;
317 #define return_label (crtl->x_return_label)
318 #define naked_return_label (crtl->x_naked_return_label)
319 #define stack_slot_list (crtl->x_stack_slot_list)
320 #define parm_birth_insn (crtl->x_parm_birth_insn)
321 #define frame_offset (crtl->x_frame_offset)
322 #define stack_check_probe_note (crtl->x_stack_check_probe_note)
323 #define arg_pointer_save_area (crtl->x_arg_pointer_save_area)
324 #define used_temp_slots (crtl->x_used_temp_slots)
325 #define avail_temp_slots (crtl->x_avail_temp_slots)
326 #define temp_slot_level (crtl->x_temp_slot_level)
327 #define nonlocal_goto_handler_labels (crtl->x_nonlocal_goto_handler_labels)
328 #define frame_pointer_needed (crtl->frame_pointer_needed)
329 #define stack_realign_fp (crtl->stack_realign_needed && !crtl->need_drap)
330 #define stack_realign_drap (crtl->stack_realign_needed && crtl->need_drap)
332 extern GTY(()) struct rtl_data x_rtl;
334 /* Accessor to RTL datastructures. We keep them statically allocated now since
335 we never keep multiple functions. For threaded compiler we might however
336 want to do differently. */
337 #define crtl (&x_rtl)
339 /* Return whether two MEM_ATTRs are equal. */
340 bool mem_attrs_eq_p (const class mem_attrs *, const class mem_attrs *);
342 /* Set the alias set of MEM to SET. */
343 extern void set_mem_alias_set (rtx, alias_set_type);
345 /* Set the alignment of MEM to ALIGN bits. */
346 extern void set_mem_align (rtx, unsigned int);
348 /* Set the address space of MEM to ADDRSPACE. */
349 extern void set_mem_addr_space (rtx, addr_space_t);
351 /* Set the expr for MEM to EXPR. */
352 extern void set_mem_expr (rtx, tree);
354 /* Set the offset for MEM to OFFSET. */
355 extern void set_mem_offset (rtx, poly_int64);
357 /* Clear the offset recorded for MEM. */
358 extern void clear_mem_offset (rtx);
360 /* Set the size for MEM to SIZE. */
361 extern void set_mem_size (rtx, poly_int64);
363 /* Clear the size recorded for MEM. */
364 extern void clear_mem_size (rtx);
366 /* Set the attributes for MEM appropriate for a spill slot. */
367 extern void set_mem_attrs_for_spill (rtx);
368 extern tree get_spill_slot_decl (bool);
370 /* Return a memory reference like MEMREF, but with its address changed to
371 ADDR. The caller is asserting that the actual piece of memory pointed
372 to is the same, just the form of the address is being changed, such as
373 by putting something into a register. */
374 extern rtx replace_equiv_address (rtx, rtx, bool = false);
376 /* Likewise, but the reference is not required to be valid. */
377 extern rtx replace_equiv_address_nv (rtx, rtx, bool = false);
379 extern rtx gen_blockage (void);
380 extern rtvec gen_rtvec (int, ...);
381 extern rtx copy_insn_1 (rtx);
382 extern rtx copy_insn (rtx);
383 extern rtx_insn *copy_delay_slot_insn (rtx_insn *);
384 extern rtx gen_int_mode (poly_int64, machine_mode);
385 extern rtx_insn *emit_copy_of_insn_after (rtx_insn *, rtx_insn *);
386 extern void set_reg_attrs_from_value (rtx, rtx);
387 extern void set_reg_attrs_for_parm (rtx, rtx);
388 extern void set_reg_attrs_for_decl_rtl (tree t, rtx x);
389 extern void adjust_reg_mode (rtx, machine_mode);
390 extern int mem_expr_equal_p (const_tree, const_tree);
391 extern rtx gen_int_shift_amount (machine_mode, poly_int64);
393 extern bool need_atomic_barrier_p (enum memmodel, bool);
395 /* Return the current sequence. */
397 static inline struct sequence_stack *
398 get_current_sequence (void)
400 return &crtl->emit.seq;
403 /* Return the outermost sequence. */
405 static inline struct sequence_stack *
406 get_topmost_sequence (void)
408 struct sequence_stack *seq, *top;
410 seq = get_current_sequence ();
413 top = seq;
414 seq = seq->next;
415 } while (seq);
416 return top;
419 /* Return the first insn of the current sequence or current function. */
421 static inline rtx_insn *
422 get_insns (void)
424 return get_current_sequence ()->first;
427 /* Specify a new insn as the first in the chain. */
429 static inline void
430 set_first_insn (rtx_insn *insn)
432 gcc_checking_assert (!insn || !PREV_INSN (insn));
433 get_current_sequence ()->first = insn;
436 /* Return the last insn emitted in current sequence or current function. */
438 static inline rtx_insn *
439 get_last_insn (void)
441 return get_current_sequence ()->last;
444 /* Specify a new insn as the last in the chain. */
446 static inline void
447 set_last_insn (rtx_insn *insn)
449 gcc_checking_assert (!insn || !NEXT_INSN (insn));
450 get_current_sequence ()->last = insn;
453 /* Return a number larger than any instruction's uid in this function. */
455 static inline int
456 get_max_uid (void)
458 return crtl->emit.x_cur_insn_uid;
461 extern bool valid_for_const_vector_p (machine_mode, rtx);
462 extern rtx gen_const_vec_duplicate (machine_mode, rtx);
463 extern rtx gen_vec_duplicate (machine_mode, rtx);
465 extern rtx gen_const_vec_series (machine_mode, rtx, rtx);
466 extern rtx gen_vec_series (machine_mode, rtx, rtx);
468 extern void set_decl_incoming_rtl (tree, rtx, bool);
470 /* Return a memory reference like MEMREF, but with its mode changed
471 to MODE and its address changed to ADDR.
472 (VOIDmode means don't change the mode.
473 NULL for ADDR means don't change the address.) */
474 extern rtx change_address (rtx, machine_mode, rtx);
476 /* Return a memory reference like MEMREF, but with its mode changed
477 to MODE and its address offset by OFFSET bytes. */
478 #define adjust_address(MEMREF, MODE, OFFSET) \
479 adjust_address_1 (MEMREF, MODE, OFFSET, 1, 1, 0, 0)
481 /* Likewise, but the reference is not required to be valid. */
482 #define adjust_address_nv(MEMREF, MODE, OFFSET) \
483 adjust_address_1 (MEMREF, MODE, OFFSET, 0, 1, 0, 0)
485 /* Return a memory reference like MEMREF, but with its mode changed
486 to MODE and its address offset by OFFSET bytes. Assume that it's
487 for a bitfield and conservatively drop the underlying object if we
488 cannot be sure to stay within its bounds. */
489 #define adjust_bitfield_address(MEMREF, MODE, OFFSET) \
490 adjust_address_1 (MEMREF, MODE, OFFSET, 1, 1, 1, 0)
492 /* As for adjust_bitfield_address, but specify that the width of
493 BLKmode accesses is SIZE bytes. */
494 #define adjust_bitfield_address_size(MEMREF, MODE, OFFSET, SIZE) \
495 adjust_address_1 (MEMREF, MODE, OFFSET, 1, 1, 1, SIZE)
497 /* Likewise, but the reference is not required to be valid. */
498 #define adjust_bitfield_address_nv(MEMREF, MODE, OFFSET) \
499 adjust_address_1 (MEMREF, MODE, OFFSET, 0, 1, 1, 0)
501 /* Return a memory reference like MEMREF, but with its mode changed
502 to MODE and its address changed to ADDR, which is assumed to be
503 increased by OFFSET bytes from MEMREF. */
504 #define adjust_automodify_address(MEMREF, MODE, ADDR, OFFSET) \
505 adjust_automodify_address_1 (MEMREF, MODE, ADDR, OFFSET, 1)
507 /* Likewise, but the reference is not required to be valid. */
508 #define adjust_automodify_address_nv(MEMREF, MODE, ADDR, OFFSET) \
509 adjust_automodify_address_1 (MEMREF, MODE, ADDR, OFFSET, 0)
511 extern rtx adjust_address_1 (rtx, machine_mode, poly_int64, int, int,
512 int, poly_int64);
513 extern rtx adjust_automodify_address_1 (rtx, machine_mode, rtx,
514 poly_int64, int);
516 /* Return a memory reference like MEMREF, but whose address is changed by
517 adding OFFSET, an RTX, to it. POW2 is the highest power of two factor
518 known to be in OFFSET (possibly 1). */
519 extern rtx offset_address (rtx, rtx, unsigned HOST_WIDE_INT);
521 /* Given REF, a MEM, and T, either the type of X or the expression
522 corresponding to REF, set the memory attributes. OBJECTP is nonzero
523 if we are making a new object of this type. */
524 extern void set_mem_attributes (rtx, tree, int);
526 /* Similar, except that BITPOS has not yet been applied to REF, so if
527 we alter MEM_OFFSET according to T then we should subtract BITPOS
528 expecting that it'll be added back in later. */
529 extern void set_mem_attributes_minus_bitpos (rtx, tree, int, poly_int64);
531 /* Return OFFSET if XEXP (MEM, 0) - OFFSET is known to be ALIGN
532 bits aligned for 0 <= OFFSET < ALIGN / BITS_PER_UNIT, or
533 -1 if not known. */
534 extern int get_mem_align_offset (rtx, unsigned int);
536 /* Return a memory reference like MEMREF, but with its mode widened to
537 MODE and adjusted by OFFSET. */
538 extern rtx widen_memory_access (rtx, machine_mode, poly_int64);
540 extern void maybe_set_max_label_num (rtx_code_label *x);
542 #endif /* GCC_EMIT_RTL_H */