/* Emit RTL for the GNU C-Compiler expander.
Copyright (C) 1987, 1988 Free Software Foundation, Inc.
This file is part of GNU CC.
GNU CC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/* Middle-to-low level generation of rtx code and insns.
This file contains the functions `gen_rtx', `gen_reg_rtx'
and `gen_label_rtx' that are the usual ways of creating rtl
expressions for most purposes.
It also has the functions for creating insns and linking
them in the doubly-linked chain.
The patterns of the insns are created by machine-dependent
routines in insn-emit.c, which is generated automatically from
the machine description. These routines use `gen_rtx' to make
the individual rtx's of the pattern; what is machine dependent
is the kind of rtx's they make and what arguments they use. */
#define max(A,B) ((A) > (B) ? (A) : (B))
#define min(A,B) ((A) < (B) ? (A) : (B))
/* This is reset to FIRST_PSEUDO_REGISTER at the start each function.
After rtl generation, it is 1 plus the largest register number used. */
int reg_rtx_no
= FIRST_PSEUDO_REGISTER
;
/* This is *not* reset after each function. It gives each CODE_LABEL
in the entire compilation a unique label number. */
static int label_num
= 1;
/* Value of `label_num' at start of current function. */
static int first_label_num
;
/* Nonzero means do not generate NOTEs for source line numbers. */
static int no_line_numbers
;
/* Commonly used rtx's, so that we only need space for one copy.
These are initialized once for the entire compilation.
All of these except perhaps fconst0_rtx and dconst0_rtx
are unique; no other rtx-object will be equal to any of these. */
rtx cc1_rtx
; /* (CC1) (not actually used nowadays) */
rtx const0_rtx
; /* (CONST_INT 0) */
rtx const1_rtx
; /* (CONST_INT 1) */
rtx fconst0_rtx
; /* (CONST_DOUBLE:SF 0) */
rtx dconst0_rtx
; /* (CONST_DOUBLE:DF 0) */
/* All references to the following fixed hard registers go through
these unique rtl objects. On machines where the frame-pointer and
arg-pointer are the same register, they use the same unique object.
After register allocation, other rtl objects which used to be pseudo-regs
may be clobbered to refer to the frame-pointer register.
But references that were originally to the frame-pointer can be
distinguished from the others because they contain frame_pointer_rtx.
In an inline procedure, the stack and frame pointer rtxs may not be
used for anything else. */
rtx stack_pointer_rtx
; /* (REG:Pmode STACK_POINTER_REGNUM) */
rtx frame_pointer_rtx
; /* (REG:Pmode FRAME_POINTER_REGNUM) */
rtx arg_pointer_rtx
; /* (REG:Pmode ARG_POINTER_REGNUM) */
rtx struct_value_rtx
; /* (REG:Pmode STRUCT_VALUE_REGNUM) */
rtx struct_value_incoming_rtx
; /* (REG:Pmode STRUCT_VALUE_INCOMING_REGNUM) */
rtx static_chain_rtx
; /* (REG:Pmode STATIC_CHAIN_REGNUM) */
rtx static_chain_incoming_rtx
; /* (REG:Pmode STATIC_CHAIN_INCOMING_REGNUM) */
/* The ends of the doubly-linked chain of rtl for the current function.
Both are reset to null at the start of rtl generation for the function.
start_sequence saves both of these on `sequence_stack' and then
starts a new, nested sequence of insns. */
static rtx first_insn
= NULL
;
static rtx last_insn
= NULL
;
/* Stack of pending (incomplete) sequences saved by `start_sequence'.
(INSN_LIST saved-first-insn
(INSN_LIST saved-last-insn ...more saved sequences...)).
The main insn-chain is saved in the last two links of the chain,
unless the chain is empty. */
/* INSN_UID for next insn emitted.
Reset to 1 for each function compiled. */
static int cur_insn_uid
= 1;
/* Line number and source file of the last line-number NOTE emitted.
This is used to avoid generating duplicates. */
static int last_linenum
= 0;
static char *last_filename
= 0;
/* A vector indexed by pseudo reg number. The allocated length
of this vector is regno_pointer_flag_length. Since this
vector is needed during the expansion phase when the total
number of registers in the function is not yet known,
it is copied and made bigger when necessary. */
char *regno_pointer_flag
;
int regno_pointer_flag_length
;
/* Indexed by pseudo register number, gives the rtx for that pseudo.
Allocated in parallel with regno_pointer_flag. */
/* Filename and line number of last line-number note,
whether we actually emitted it or not. */
extern char *emit_filename
;
/* rtx gen_rtx (code, mode, [element1, ..., elementn])
** This routine generates an RTX of the size specified by
** <code>, which is an RTX code. The RTX structure is initialized
** from the arguments <element1> through <elementn>, which are
** interpreted according to the specific RTX type's format. The
** special machine mode associated with the rtx (if any) is specified
** gen_rtx() can be invoked in a way which resembles the lisp-like
** rtx it will generate. For example, the following rtx structure:
** (plus:QI (mem:QI (reg:SI 1))
** (mem:QI (plusw:SI (reg:SI 2) (reg:SI 3))))
** ...would be generated by the following C code:
** gen_rtx (PLUS, QImode,
** gen_rtx (REG, SImode, 1)),
** gen_rtx (PLUS, SImode,
** gen_rtx (REG, SImode, 2),
** gen_rtx (REG, SImode, 3)))),
register int i
; /* Array indices... */
register char *fmt
; /* Current rtx's format... */
register rtx rt_val
; /* RTX to return to caller... */
code
= va_arg (p
, enum rtx_code
);
mode
= va_arg (p
, enum machine_mode
);
int arg
= va_arg (p
, int);
rt_val
= rtx_alloc (code
);
rt_val
= rtx_alloc (code
); /* Allocate the storage space. */
rt_val
->mode
= mode
; /* Store the machine mode... */
fmt
= GET_RTX_FORMAT (code
); /* Find the right format... */
for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
case '0': /* Unused field. */
case 'i': /* An integer? */
XINT (rt_val
, i
) = va_arg (p
, int);
case 's': /* A string? */
XSTR (rt_val
, i
) = va_arg (p
, char *);
case 'e': /* An expression? */
case 'u': /* An insn? Same except when printing. */
XEXP (rt_val
, i
) = va_arg (p
, rtx
);
case 'E': /* An RTX vector? */
XVEC (rt_val
, i
) = va_arg (p
, rtvec
);
return rt_val
; /* Return the new RTX... */
/* gen_rtvec (n, [rt1, ..., rtn])
** This routine creates an rtvec and stores within it the
** pointers to rtx's which are its arguments.
return NULL_RTVEC
; /* Don't allocate an empty rtvec... */
vector
= (rtx
*) alloca (n
* sizeof (rtx
));
vector
[i
] = va_arg (p
, rtx
);
return gen_rtvec_v (n
, vector
);
return NULL_RTVEC
; /* Don't allocate an empty rtvec... */
rt_val
= rtvec_alloc (n
); /* Allocate an rtvec... */
rt_val
->elem
[i
].rtx
= *argp
++;
/* Generate a REG rtx for a new pseudo register of mode MODE.
This pseudo is assigned the next sequential register number. */
/* Make sure regno_pointer_flag and regno_reg_rtx are large
enough to have an element for this pseudo reg number. */
if (reg_rtx_no
== regno_pointer_flag_length
)
(char *) oballoc (regno_pointer_flag_length
* 2);
bzero (new, regno_pointer_flag_length
* 2);
bcopy (regno_pointer_flag
, new, regno_pointer_flag_length
);
regno_pointer_flag
= new;
new1
= (rtx
*) oballoc (regno_pointer_flag_length
* 2 * sizeof (rtx
));
bzero (new1
, regno_pointer_flag_length
* 2 * sizeof (rtx
));
bcopy (regno_reg_rtx
, new1
, regno_pointer_flag_length
* sizeof (rtx
));
regno_pointer_flag_length
*= 2;
val
= gen_rtx (REG
, mode
, reg_rtx_no
);
regno_reg_rtx
[reg_rtx_no
++] = val
;
/* Identify REG as a probable pointer register. */
REGNO_POINTER_FLAG (REGNO (reg
)) = 1;
/* Return 1 plus largest pseudo reg number used in the current function. */
/* Return 1 + the largest label number used so far. */
/* Return first label number used in this function (if any were used). */
/* Assuming that X is an rtx (MEM, REG or SUBREG) for a fixed-point number,
return a MEM or SUBREG rtx that refers to the least-significant part of X.
MODE specifies how big a part of X to return;
it must not be larger than a word.
If X is a MEM whose address is a QUEUED, the value may be so also. */
/* This case loses if X is a subreg. To catch bugs early,
complain if an invalid MODE is used even in other cases. */
if (GET_MODE_SIZE (mode
) > UNITS_PER_WORD
&& GET_MODE_SIZE (mode
) != GET_MODE_UNIT_SIZE (GET_MODE (x
)))
if (GET_MODE (x
) == mode
)
if (GET_CODE (x
) == CONST_INT
)
return gen_rtx (CONST_INT
, VOIDmode
, INTVAL (x
) & GET_MODE_MASK (mode
));
if (GET_CODE (x
) == CONST_DOUBLE
)
/* In version 1.37, try this: */
/* if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT) abort (); */
/* Assume it's an int, so ..._LOW means the low-order word. */
return gen_rtx (CONST_INT
, VOIDmode
,
CONST_DOUBLE_LOW (x
) & GET_MODE_MASK (mode
));
offset
= (max (GET_MODE_SIZE (GET_MODE (x
)), UNITS_PER_WORD
)
- max (GET_MODE_SIZE (mode
), UNITS_PER_WORD
));
/* Adjust the address so that the address-after-the-data
offset
-= (min (UNITS_PER_WORD
, GET_MODE_SIZE (mode
))
- min (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
))));
return change_address (x
, mode
, plus_constant (XEXP (x
, 0), offset
));
else if (GET_CODE (x
) == SUBREG
)
return (GET_MODE (SUBREG_REG (x
)) == mode
&& SUBREG_WORD (x
) == 0
: gen_rtx (SUBREG
, mode
, SUBREG_REG (x
), SUBREG_WORD (x
)));
else if (GET_CODE (x
) == REG
)
if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
)
return gen_rtx (SUBREG
, mode
, x
,
((GET_MODE_SIZE (GET_MODE (x
))
- max (GET_MODE_SIZE (mode
), UNITS_PER_WORD
))
return gen_rtx (SUBREG
, mode
, x
, 0);
/* Like `gen_lowpart', but refer to the most significant part. */
offset
= (max (GET_MODE_SIZE (GET_MODE (x
)), UNITS_PER_WORD
)
- max (GET_MODE_SIZE (mode
), UNITS_PER_WORD
));
if (GET_MODE_SIZE (mode
) < UNITS_PER_WORD
)
offset
-= (GET_MODE_SIZE (mode
)
GET_MODE_SIZE (GET_MODE (x
))));
return change_address (x
, mode
, plus_constant (XEXP (x
, 0), offset
));
else if (GET_CODE (x
) == REG
)
if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
)
return gen_rtx (SUBREG
, mode
, x
,
((GET_MODE_SIZE (GET_MODE (x
))
- max (GET_MODE_SIZE (mode
), UNITS_PER_WORD
))
return gen_rtx (SUBREG
, mode
, x
, 0);
/* Return 1 iff X, assumed to be a SUBREG,
refers to the least significant part of its containing reg.
If X is not a SUBREG, always return 1 (it is its own low part!). */
if (GET_CODE (x
) != SUBREG
)
if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
)
register enum machine_mode mode
= GET_MODE (SUBREG_REG (x
));
== ((GET_MODE_SIZE (GET_MODE (x
))
- max (GET_MODE_SIZE (mode
), UNITS_PER_WORD
))
return SUBREG_WORD (x
) == 0;
/* Return a memory reference like MEMREF, but with its mode changed
to MODE and its address changed to ADDR.
(VOIDmode means don't change the mode.
NULL for ADDR means don't change the address.) */
change_address (memref
, mode
, addr
)
if (GET_CODE (memref
) != MEM
)
mode
= GET_MODE (memref
);
new = gen_rtx (MEM
, mode
, memory_address (mode
, addr
));
MEM_VOLATILE_P (new) = MEM_VOLATILE_P (memref
);
RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (memref
);
MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (memref
);
/* Return a newly created CODE_LABEL rtx with a unique label number. */
register rtx label
= gen_rtx (CODE_LABEL
, VOIDmode
, 0, 0, 0, label_num
++);
/* For procedure integration. */
/* Return a newly created INLINE_HEADER rtx. Should allocate this
from a permanent obstack when the opportunity arises. */
gen_inline_header_rtx (insn
, last_insn
,
first_labelno
, last_labelno
,
max_parm_regnum
, max_regnum
, args_size
,
int first_labelno
, last_labelno
, max_parm_regnum
, max_regnum
, args_size
;
rtx header
= gen_rtx (INLINE_HEADER
, VOIDmode
,
first_labelno
, last_labelno
,
max_parm_regnum
, max_regnum
, args_size
, stack_slots
);
/* Install new pointers to the first and last insns in the chain.
Used for an inline-procedure after copying the insn chain. */
set_new_first_and_last_insn (first
, last
)
/* Go through all the RTL insn bodies and copy any invalid shared structure.
It does not work to do this twice, because the mark bits set here
are not cleared afterwards. */
static int unshare_copies
= 0; /* Count rtx's that were copied. */
static rtx
copy_rtx_if_shared ();
extern rtx stack_slot_list
;
for (; insn
; insn
= NEXT_INSN (insn
))
if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
|| GET_CODE (insn
) == CALL_INSN
)
PATTERN (insn
) = copy_rtx_if_shared (PATTERN (insn
));
REG_NOTES (insn
) = copy_rtx_if_shared (REG_NOTES (insn
));
LOG_LINKS (insn
) = copy_rtx_if_shared (LOG_LINKS (insn
));
/* Make sure the addresses of stack slots are not shared
with anything in the insn chain. That could happen if
the stack slot is referenced only by its address. */
copy_rtx_if_shared (stack_slot_list
);
/* Mark ORIG as in use, and return a copy of it if it was already in use.
Recursively does the same for subexpressions. */
copy_rtx_if_shared (orig
)
register enum rtx_code code
;
register char *format_ptr
;
/* These types may be freely shared. */
/* The chain of insns is not being copied. */
/* A MEM is allowed to be shared if its address is constant
or is a constant plus one of the special registers. */
if (CONSTANT_ADDRESS_P (XEXP (x
, 0)))
if (GET_CODE (XEXP (x
, 0)) == PLUS
&& (XEXP (XEXP (x
, 0), 0) == frame_pointer_rtx
|| XEXP (XEXP (x
, 0), 0) == arg_pointer_rtx
)
&& CONSTANT_ADDRESS_P (XEXP (XEXP (x
, 0), 1)))
/* This MEM can appear in more than one place,
but its address better not be shared with anything else. */
XEXP (x
, 0) = copy_rtx_if_shared (XEXP (x
, 0));
if (XEXP (x
, 0) == frame_pointer_rtx
|| XEXP (x
, 0) == arg_pointer_rtx
)
/* This rtx may not be shared. If it has already been seen,
replace it with a copy of itself. */
bcopy (x
, copy
, (sizeof (*copy
) - sizeof (copy
->fld
)
+ sizeof (copy
->fld
[0]) * GET_RTX_LENGTH (code
)));
/* Now scan the subexpressions recursively.
We can store any replaced subexpressions directly into X
since we know X is not shared! Any vectors in X
must be copied if X was copied. */
format_ptr
= GET_RTX_FORMAT (code
);
for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
XEXP (x
, i
) = copy_rtx_if_shared (XEXP (x
, i
));
XVEC (x
, i
) = gen_rtvec_v (XVECLEN (x
, i
), &XVECEXP (x
, i
, 0));
for (j
= 0; j
< XVECLEN (x
, i
); j
++)
= copy_rtx_if_shared (XVECEXP (x
, i
, j
));
/* Copy X if necessary so that it won't be altered by changes in OTHER.
Return X or the rtx for the pseudo reg the value of X was copied into.
OTHER must be valid as a SET_DEST. */
make_safe_from (x
, other
)
switch (GET_CODE (other
))
other
= SUBREG_REG (other
);
if ((GET_CODE (other
) == MEM
&& GET_CODE (x
) != CONST_DOUBLE
&& GET_CODE (x
) != SUBREG
)
|| (GET_CODE (other
) == REG
&& (REGNO (other
) < FIRST_PSEUDO_REGISTER
|| reg_mentioned_p (other
, x
))))
rtx temp
= gen_reg_rtx (GET_MODE (x
));
emit_move_insn (temp
, x
);
/* Emission of insns (adding them to the doubly-linked list). */
/* Return the first insn of the current sequence or current function. */
/* Return the last insn emitted in current sequence or current function. */
/* Specify a new insn as the last in the chain. */
if (NEXT_INSN (insn
) != 0)
/* Return a number larger than any instruction's uid in this function. */
if (insn
) return NEXT_INSN (insn
);
if (insn
) return PREV_INSN (insn
);
/* Make and return an INSN rtx, initializing all its slots.
Store PATTERN in the pattern slots.
PAT_FORMALS is an idea that never really went anywhere. */
make_insn_raw (pattern
, pat_formals
)
INSN_UID(insn
) = cur_insn_uid
++;
PATTERN (insn
) = pattern
;
/* Like `make_insn' but make a JUMP_INSN instead of an insn. */
make_jump_insn_raw (pattern
, pat_formals
)
insn
= rtx_alloc(JUMP_INSN
);
INSN_UID(insn
) = cur_insn_uid
++;
PATTERN (insn
) = pattern
;
/* Add INSN to the end of the doubly-linked list.
INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
PREV_INSN (insn
) = last_insn
;
NEXT_INSN (last_insn
) = insn
;
/* Add INSN, an rtx of code INSN, into the doubly-linked list
add_insn_after (insn
, after
)
NEXT_INSN (insn
) = NEXT_INSN (after
);
PREV_INSN (insn
) = after
;
PREV_INSN (NEXT_INSN (insn
)) = insn
;
else if (last_insn
== after
)
rtx stack
= sequence_stack
;
/* Scan all pending sequences too. */
for (; stack
; stack
= XEXP (XEXP (stack
, 1), 1))
if (after
== XEXP (XEXP (stack
, 1), 0))
XEXP (XEXP (stack
, 1), 0) = insn
;
NEXT_INSN (after
) = insn
;
/* Delete all insns made since FROM.
FROM becomes the new last instruction. */
delete_insns_since (from
)
/* Move a consecutive bunch of insns to a different place in the chain.
The insns to be moved are those between FROM and TO.
They are moved to a new position after the insn AFTER. */
reorder_insns (from
, to
, after
)
/* Splice this bunch out of where it is now. */
NEXT_INSN (PREV_INSN (from
)) = NEXT_INSN (to
);
PREV_INSN (NEXT_INSN (to
)) = PREV_INSN (from
);
last_insn
= PREV_INSN (from
);
first_insn
= NEXT_INSN (to
);
/* Make the new neighbors point to it and it to them. */
PREV_INSN (NEXT_INSN (after
)) = to
;
NEXT_INSN (to
) = NEXT_INSN (after
);
PREV_INSN (from
) = after
;
NEXT_INSN (after
) = from
;
/* Emit an insn of given code and pattern
at a specified place within the doubly-linked list. */
/* Make an instruction with body PATTERN
and output it before the instruction BEFORE. */
emit_insn_before (pattern
, before
)
register rtx pattern
, before
;
if (GET_CODE (pattern
) == SEQUENCE
)
/* For an empty sequence, emit nothing. */
for (i
= 0; i
< XVECLEN (pattern
, 0); i
++)
add_insn_after (XVECEXP (pattern
, 0, i
), PREV_INSN (before
));
return PREV_INSN (before
);
insn
= make_insn_raw (pattern
, 0);
PREV_INSN (insn
) = PREV_INSN (before
);
NEXT_INSN (insn
) = before
;
NEXT_INSN (PREV_INSN (insn
)) = insn
;
PREV_INSN (before
) = insn
;
/* Make an instruction with body PATTERN and code JUMP_INSN
and output it before the instruction BEFORE. */
emit_jump_insn_before (pattern
, before
)
register rtx pattern
, before
;
register rtx insn
= make_jump_insn_raw (pattern
, 0);
PREV_INSN (insn
) = PREV_INSN (before
);
NEXT_INSN (insn
) = before
;
NEXT_INSN (PREV_INSN (insn
)) = insn
;
PREV_INSN (before
) = insn
;
/* Make an instruction with body PATTERN and code CALL_INSN
and output it before the instruction BEFORE. */
emit_call_insn_before (pattern
, before
)
register rtx pattern
, before
;
rtx insn
= emit_insn_before (pattern
, before
);
PUT_CODE (insn
, CALL_INSN
);
/* Make an insn of code INSN with body PATTERN
and output it after the insn AFTER. */
emit_insn_after (pattern
, after
)
register rtx pattern
, after
;
if (GET_CODE (pattern
) == SEQUENCE
)
/* For an empty sequence, emit nothing. */
for (i
= 0; i
< XVECLEN (pattern
, 0); i
++)
add_insn_after (XVECEXP (pattern
, 0, i
), after
);
after
= NEXT_INSN (after
);
register rtx insn
= make_insn_raw (pattern
, 0);
add_insn_after (insn
, after
);
/* Make an insn of code JUMP_INSN with body PATTERN
and output it after the insn AFTER. */
emit_jump_insn_after (pattern
, after
)
register rtx pattern
, after
;
register rtx insn
= make_jump_insn_raw (pattern
, 0);
add_insn_after (insn
, after
);
/* Make an insn of code BARRIER
and output it after the insn AFTER. */
emit_barrier_after (after
)
register rtx insn
= rtx_alloc (BARRIER
);
INSN_UID (insn
) = cur_insn_uid
++;
add_insn_after (insn
, after
);
/* Emit the label LABEL after the insn AFTER. */
emit_label_after (label
, after
)
/* This can be called twice for the same label
as a result of the confusion that follows a syntax error!
if (INSN_UID (label
) == 0)
INSN_UID (label
) = cur_insn_uid
++;
add_insn_after (label
, after
);
/* Emit a note of subtype SUBTYPE after the insn AFTER. */
emit_note_after (subtype
, after
)
register rtx note
= rtx_alloc (NOTE
);
INSN_UID (note
) = cur_insn_uid
++;
XINT (note
, 4) = subtype
;
add_insn_after (note
, after
);
/* Make an insn of code INSN with pattern PATTERN
and add it to the end of the doubly-linked list.
If PATTERN is a SEQUENCE, take the elements of it
and emit an insn for each element.
Returns the last insn emitted. */
if (GET_CODE (pattern
) == SEQUENCE
)
/* For an empty sequence, emit nothing. */
for (i
= 0; i
< XVECLEN (pattern
, 0); i
++)
add_insn (insn
= XVECEXP (pattern
, 0, i
));
insn
= make_insn_raw (pattern
, NULL
);
/* Emit the insns in a chain starting with INSN. */
rtx next
= NEXT_INSN (insn
);
/* Make an insn of code JUMP_INSN with pattern PATTERN
and add it to the end of the doubly-linked list. */
if (GET_CODE (pattern
) == SEQUENCE
)
return emit_insn (pattern
);
register rtx insn
= make_jump_insn_raw (pattern
, NULL
);
/* Make an insn of code CALL_INSN with pattern PATTERN
and add it to the end of the doubly-linked list. */
if (GET_CODE (pattern
) == SEQUENCE
)
return emit_insn (pattern
);
register rtx insn
= make_insn_raw (pattern
, NULL
);
PUT_CODE (insn
, CALL_INSN
);
/* Add the label LABEL to the end of the doubly-linked list. */
/* This can be called twice for the same label
as a result of the confusion that follows a syntax error!
if (INSN_UID (label
) == 0)
INSN_UID (label
) = cur_insn_uid
++;
/* Make an insn of code BARRIER
and add it to the end of the doubly-linked list. */
register rtx barrier
= rtx_alloc (BARRIER
);
INSN_UID (barrier
) = cur_insn_uid
++;
/* Make an insn of code NOTE
with data-fields specified by FILE and LINE
and add it to the end of the doubly-linked list,
but only if line-numbers are desired for debugging info. */
emit_line_note (file
, line
)
return emit_note (file
, line
);
/* Make an insn of code NOTE
with data-fields specified by FILE and LINE
and add it to the end of the doubly-linked list.
If it is a line-number NOTE, omit it if it matches the previous one. */
if (file
&& last_filename
&& !strcmp (file
, last_filename
)
if (no_line_numbers
&& line
> 0)
INSN_UID (note
) = cur_insn_uid
++;
/* Emit a NOTE, and don't omit it even if LINE it the previous note. */
emit_line_note_force (file
, line
)
return emit_line_note (file
, line
);
/* Cause next statement to emit a line note even if the line number
has not changed. This is used at the beginning of a function. */
/* Return an indication of which type of insn should have X as a body.
The value is CODE_LABEL, INSN, CALL_INSN or JUMP_INSN. */
if (GET_CODE (x
) == CODE_LABEL
)
if (GET_CODE (x
) == CALL
)
if (GET_CODE (x
) == RETURN
)
if (SET_DEST (x
) == pc_rtx
)
else if (GET_CODE (SET_SRC (x
)) == CALL
)
if (GET_CODE (x
) == PARALLEL
)
for (j
= XVECLEN (x
, 0) - 1; j
>= 0; j
--)
if (GET_CODE (XVECEXP (x
, 0, j
)) == CALL
)
else if (GET_CODE (XVECEXP (x
, 0, j
)) == SET
&& SET_DEST (XVECEXP (x
, 0, j
)) == pc_rtx
)
else if (GET_CODE (XVECEXP (x
, 0, j
)) == SET
&& GET_CODE (SET_SRC (XVECEXP (x
, 0, j
))) == CALL
)
/* Emit the rtl pattern X as an appropriate kind of insn.
If X is a label, it is simply added into the insn chain. */
enum rtx_code code
= classify_insn (x
);
else if (code
== JUMP_INSN
)
register rtx insn
= emit_jump_insn (x
);
if (simplejump_p (insn
) || GET_CODE (x
) == RETURN
)
else if (code
== CALL_INSN
)
/* Begin emitting insns to a sequence which can be packaged in an RTL_EXPR.
Return an rtx containing data on any sequence already in progress. */
= gen_rtx (INSN_LIST
, VOIDmode
,
first_insn
, gen_rtx (INSN_LIST
, VOIDmode
,
last_insn
, sequence_stack
));
/* Set up the insn chain starting with FIRST
as the current sequence, saving the previously current one. */
for (last
= first
; last
&& NEXT_INSN (last
); last
= NEXT_INSN (last
));
= gen_rtx (INSN_LIST
, VOIDmode
,
first_insn
, gen_rtx (INSN_LIST
, VOIDmode
,
last_insn
, sequence_stack
));
/* After emitting to a sequence, restore previous saved state.
The argument SAVED is no longer used.
To get the contents of the sequence just made,
you must call `gen_sequence' *before* calling here. */
first_insn
= XEXP (sequence_stack
, 0);
last_insn
= XEXP (XEXP (sequence_stack
, 1), 0);
sequence_stack
= XEXP (XEXP (sequence_stack
, 1), 1);
/* Generate a SEQUENCE rtx containing the insns already emitted
This is how the gen_... function from a DEFINE_EXPAND
constructs the SEQUENCE that it returns. */
/* Count the insns in the chain. */
for (tem
= first_insn
; tem
; tem
= NEXT_INSN (tem
))
/* For an empty sequence... */
return gen_rtx (SEQUENCE
, VOIDmode
, NULL
);
/* If only one insn, return its pattern rather than a SEQUENCE. */
&& (GET_CODE (first_insn
) == INSN
|| GET_CODE (first_insn
) == JUMP_INSN
|| GET_CODE (first_insn
) == CALL_INSN
))
return PATTERN (first_insn
);
/* Put them in a vector. */
newvec
= rtvec_alloc (len
);
for (tem
= first_insn
; tem
; tem
= NEXT_INSN (tem
), i
++)
newvec
->elem
[i
].rtx
= tem
;
/* Make a SEQUENCE from this vector. */
return gen_rtx (SEQUENCE
, VOIDmode
, newvec
);
/* Set up regno_reg_rtx, reg_rtx_no and regno_pointer_flag
according to the chain of insns starting with FIRST.
Also set cur_insn_uid to exceed the largest uid in that chain.
This is used when an inline function's rtl is saved
and passed to rest_of_compilation later. */
static void restore_reg_data_1 ();
register int max_uid
= 0;
for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
if (INSN_UID (insn
) >= max_uid
)
max_uid
= INSN_UID (insn
);
restore_reg_data_1 (PATTERN (insn
));
/* Don't duplicate the uids already in use. */
cur_insn_uid
= max_uid
+ 1;
/* If any regs are missing, make them up. */
for (i
= FIRST_PSEUDO_REGISTER
; i
< reg_rtx_no
; i
++)
if (regno_reg_rtx
[i
] == 0)
regno_reg_rtx
[i
] = gen_rtx (REG
, SImode
, i
);
restore_reg_data_1 (orig
)
register enum rtx_code code
;
register char *format_ptr
;
if (REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
/* Make sure regno_pointer_flag and regno_reg_rtx are large
enough to have an element for this pseudo reg number. */
if (REGNO (x
) >= reg_rtx_no
)
if (reg_rtx_no
>= regno_pointer_flag_length
)
int newlen
= max (regno_pointer_flag_length
* 2,
char *new = (char *) oballoc (newlen
);
bcopy (regno_pointer_flag
, new, regno_pointer_flag_length
);
new1
= (rtx
*) oballoc (newlen
* sizeof (rtx
));
bzero (new1
, newlen
* sizeof (rtx
));
bcopy (regno_reg_rtx
, new1
, regno_pointer_flag_length
* sizeof (rtx
));
regno_pointer_flag
= new;
regno_pointer_flag_length
= newlen
;
regno_reg_rtx
[REGNO (x
)] = x
;
if (GET_CODE (XEXP (x
, 0)) == REG
)
mark_reg_pointer (XEXP (x
, 0));
restore_reg_data_1 (XEXP (x
, 0));
/* Now scan the subexpressions recursively. */
format_ptr
= GET_RTX_FORMAT (code
);
for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
restore_reg_data_1 (XEXP (x
, i
));
for (j
= 0; j
< XVECLEN (x
, i
); j
++)
restore_reg_data_1 (XVECEXP (x
, i
, j
));
/* Initialize data structures and variables in this file
before generating rtl for each function.
WRITE_SYMBOLS is nonzero if any kind of debugging info
init_emit (write_symbols
)
reg_rtx_no
= FIRST_PSEUDO_REGISTER
;
first_label_num
= label_num
;
no_line_numbers
= ! write_symbols
;
/* Init the tables that describe all the pseudo regs. */
regno_pointer_flag_length
= FIRST_PSEUDO_REGISTER
+ 100;
= (char *) oballoc (regno_pointer_flag_length
);
bzero (regno_pointer_flag
, regno_pointer_flag_length
);
= (rtx
*) oballoc (regno_pointer_flag_length
* sizeof (rtx
));
bzero (regno_reg_rtx
, regno_pointer_flag_length
* sizeof (rtx
));
/* Create some permanent unique rtl objects shared between all functions. */
/* Create the unique rtx's for certain rtx codes and operand values. */
pc_rtx
= gen_rtx (PC
, VOIDmode
);
cc0_rtx
= gen_rtx (CC0
, VOIDmode
);
/* Don't use gen_rtx here since gen_rtx in this case
tries to use these variables. */
const0_rtx
= rtx_alloc (CONST_INT
);
const1_rtx
= rtx_alloc (CONST_INT
);
fconst0_rtx
= rtx_alloc (CONST_DOUBLE
);
dconst0_rtx
= rtx_alloc (CONST_DOUBLE
);
#ifdef REAL_IS_NOT_DOUBLE
u
.d
= REAL_VALUE_ATOF ("0");
bcopy (&u
, &CONST_DOUBLE_LOW (fconst0_rtx
), sizeof u
);
CONST_DOUBLE_MEM (fconst0_rtx
) = cc0_rtx
;
PUT_MODE (fconst0_rtx
, SFmode
);
bcopy (&u
, &CONST_DOUBLE_LOW (dconst0_rtx
), sizeof u
);
CONST_DOUBLE_MEM (dconst0_rtx
) = cc0_rtx
;
PUT_MODE (dconst0_rtx
, DFmode
);
stack_pointer_rtx
= gen_rtx (REG
, Pmode
, STACK_POINTER_REGNUM
);
frame_pointer_rtx
= gen_rtx (REG
, Pmode
, FRAME_POINTER_REGNUM
);
struct_value_rtx
= STRUCT_VALUE
;
struct_value_rtx
= gen_rtx (REG
, Pmode
, STRUCT_VALUE_REGNUM
);
#ifdef STRUCT_VALUE_INCOMING
struct_value_incoming_rtx
= STRUCT_VALUE_INCOMING
;
#ifdef STRUCT_VALUE_INCOMING_REGNUM
struct_value_incoming_rtx
= gen_rtx (REG
, Pmode
, STRUCT_VALUE_INCOMING_REGNUM
);
struct_value_incoming_rtx
= struct_value_rtx
;
static_chain_rtx
= gen_rtx (REG
, Pmode
, STATIC_CHAIN_REGNUM
);
#ifdef STATIC_CHAIN_INCOMING_REGNUM
if (STATIC_CHAIN_INCOMING_REGNUM
!= STATIC_CHAIN_REGNUM
)
static_chain_incoming_rtx
= gen_rtx (REG
, Pmode
, STATIC_CHAIN_INCOMING_REGNUM
);
static_chain_incoming_rtx
= static_chain_rtx
;
if (FRAME_POINTER_REGNUM
== ARG_POINTER_REGNUM
)
arg_pointer_rtx
= frame_pointer_rtx
;
arg_pointer_rtx
= gen_rtx (REG
, Pmode
, ARG_POINTER_REGNUM
);