Buy the book!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
The RTL representation of the code for a function is a doubly-linked
chain of objects called insns. Insns are expressions with
special codes that are used for no other purpose. Some insns are
actual instructions; others represent dispatch tables for
statements; others represent labels to jump to or various sorts of
In addition to its own specific data, each insn must have a unique
id-number that distinguishes it from all other insns in the current
function (after delayed branch scheduling, copies of an insn with the
same id-number may be present in multiple places in a function, but
these copies will always be identical and will only appear inside a
sequence), and chain pointers to the preceding and following
insns. These three fields occupy the same position in every insn,
independent of the expression code of the insn. They could be accessed
XINT, but instead three special macros are
The first insn in the chain is obtained by calling
last insn is the result of calling
get_last_insn. Within the
chain delimited by these insns, the
PREV_INSN pointers must always correspond: if insn is not
the first insn,
NEXT_INSN (PREV_INSN (insn)) == insn
is always true and if insn is not the last insn,
PREV_INSN (NEXT_INSN (insn)) == insn
is always true.
After delay slot scheduling, some of the insns in the chain might be
sequence expressions, which contain a vector of insns. The value
NEXT_INSN in all but the last of these insns is the next insn
in the vector; the value of
NEXT_INSN of the last insn in the vector
is the same as the value of
NEXT_INSN for the
which it is contained. Similar rules apply for
This means that the above invariants are not necessarily true for insns
sequence expressions. Specifically, if insn is the
first insn in a
NEXT_INSN (PREV_INSN (insn))
is the insn containing the
sequence expression, as is the value
PREV_INSN (NEXT_INSN (insn)) if insn is the last
insn in the
sequence expression. You can use these expressions
to find the containing
Every insn has one of the following six expression codes:
insnis used for instructions that do not jump and do not do function calls.
sequenceexpressions are always contained in insns with code
insneven if one of those insns should jump or do function calls.
Insns with code
insn have four additional fields beyond the three
mandatory ones listed above. These four are described in a table below.
jump_insnis used for instructions that may jump (or, more generally, may contain
label_refexpressions). If there is an instruction to return from the current function, it is recorded as a
jump_insn insns have the same extra fields as
accessed in the same way and in addition contain a field
JUMP_LABEL which is defined once jump optimization has completed.
For simple conditional and unconditional jumps, this field contains
code_label to which this insn will (possibly conditionally)
branch. In a more complex jump,
JUMP_LABEL records one of the
labels that the insn refers to; the only way to find the others is to
scan the entire body of the insn. In an
Return insns count as jumps, but since they do not refer to any
call_insnis used for instructions that may do function calls. It is important to distinguish these instructions because they imply that certain registers and memory locations may be altered unpredictably.
call_insn insns have the same extra fields as
accessed in the same way and in addition contain a field
CALL_INSN_FUNCTION_USAGE, which contains a list (chain of
expr_list expressions) containing
expressions that denote hard registers and
MEMs used or
clobbered by the called function.
MEM generally points to a stack slots in which arguments passed
to the libcall by reference (see section FUNCTION_ARG_PASS_BY_REFERENCE) are stored. If the argument is
caller-copied (see section FUNCTION_ARG_CALLEE_COPIES),
the stack slot will be mentioned in
entries; if it's callee-copied, only a
USE will appear, and the
MEM may point to addresses that are not stack slots. These
MEMs are used only in libcalls, because, unlike regular function
CONST_CALLs (which libcalls generally are, see section CONST_CALL_P) aren't assumed to read and write all memory, so flow
would consider the stores dead and remove them. Note that, since a
libcall must never return values in memory (see section RETURN_IN_MEMORY), there will never be a
CLOBBER for a memory
address holding a return value.
CLOBBERed registers in this list augment registers specified in
CALL_USED_REGISTERS (see section 10.8.1 Basic Characteristics of Registers).
code_labelinsn represents a label that a jump insn can jump to. It contains two special fields of data in addition to the three standard ones.
CODE_LABEL_NUMBERis used to hold the label number, a number that identifies this label uniquely among all the labels in the compilation (not just in the current function). Ultimately, the label is represented in the assembler output as an assembler label, usually of the form `Ln' where n is the label number.
code_label appears in an RTL expression, it normally
appears within a
label_ref which represents the address of
the label, as a number.
Besides as a
code_label, a label can also be represented as a
note of type
LABEL_NUSES is only defined once the jump optimization
phase is completed and contains the number of times this label is
referenced in the current function.
LABEL_ALTERNATE_NAME is used to associate a name with
code_label. If this field is defined, the alternate name will
be emitted instead of an internally generated label name.
volatilefunctions, which do not return (e.g.,
exit). They contain no information beyond the three standard fields.
noteinsns are used to represent additional debugging and declarative information. They contain two nonstandard fields, an integer which is accessed with the macro
NOTE_LINE_NUMBERand a string accessed with
NOTE_LINE_NUMBER is positive, the note represents the
position of a source line and
NOTE_SOURCE_FILE is the source file name
that the line came from. These notes control generation of line
number data in the assembler output.
NOTE_LINE_NUMBER is not really a line number but a
code with one of the following values (and
must contain a null pointer):
code_label, but was not used for other purposes than taking its address and was transformed to mark that no code jumps to it.
NOTE_INSN_DELETED_LABELis associated with the given region.
forloop. They enable the loop optimizer to find loops quickly.
continuestatements jump to.
returnstatements jump to (on machine where a single instruction does not suffice for returning). This note may be deleted by jump optimization.
setjmpor a related function.
These codes are printed symbolically when they appear in debugging dumps.
The machine mode of an insn is normally
VOIDmode, but some
phases use the mode for various purposes.
The common subexpression elimination pass sets the mode of an insn to
QImode when it is the first insn in a block that has already
The second Haifa scheduling pass, for targets that can multiple issue,
sets the mode of an insn to
TImode when it is believed that the
instruction begins an issue group. That is, when the instruction
cannot issue simultaneously with the previous. This may be relied on
by later passes, in particular machine-dependent reorg.
Here is a table of the extra fields of
sequence. If it is a
parallel, each element of the
parallelmust be one these codes, except that
parallelexpressions cannot be nested and
addr_diff_vecare not permitted inside a
Such matching is never attempted and this field remains -1 on an insn
whose pattern consists of a single
Matching is also never attempted on insns that result from an
statement. These contain at least one
asm_noperands returns a non-negative value for
In the debugging output, this field is printed as a number followed by a symbolic representation that locates the pattern in the `md' file as some small positive or negative offset from a named pattern.
insn_listexpressions) giving information about dependencies between instructions within a basic block. Neither a jump nor a label may come between the related insns.
insn_listexpressions) giving miscellaneous information about the insn. It is often information pertaining to the registers used in this insn.
LOG_LINKS field of an insn is a chain of
expressions. Each of these has two operands: the first is an insn,
and the second is another
insn_list expression (the next one in
the chain). The last
insn_list in the chain has a null pointer
as second operand. The significant thing about the chain is which
insns appear in it (as first operands of
expressions). Their order is not significant.
This list is originally set up by the flow analysis pass; it is a null
pointer until then. Flow only adds links for those data dependencies
which can be used for instruction combination. For each insn, the flow
analysis pass adds a link to insns which store into registers values
that are used for the first time in this insn. The instruction
scheduling pass adds extra links so that every dependence will be
represented. Links represent data dependencies, antidependencies and
output dependencies; the machine mode of the link distinguishes these
three types: antidependencies have mode
dependencies have mode
REG_DEP_OUTPUT, and data dependencies have
REG_NOTES field of an insn is a chain similar to the
LOG_LINKS field but it includes
expr_list expressions in
insn_list expressions. There are several kinds of
register notes, which are distinguished by the machine mode, which in a
register note is really understood as being an
The first operand op of the note is data whose meaning depends on
the kind of note.
REG_NOTE_KIND (x) returns the kind of
register note. Its counterpart, the macro
(x, newkind) sets the register note type of x to be
Register notes are of three classes: They may say something about an
input to an insn, they may say something about an output of an insn, or
they may create a linkage between two insns. There are also a set
of values that are only used in
These register notes annotate inputs to an insn:
It does not follow that the register op has no useful value after this insn since op is not necessarily modified by this insn. Rather, no subsequent instruction uses the contents of op.
REG_DEADnote, which indicates that the value in an input will not be used subsequently. These two notes are independent; both may be present for the same register.
REG_NONNEG note is added to insns only if the machine
description has a `decrement_and_branch_until_zero' pattern.
Insns with this note are usually part of a block that begins with a
clobber insn specifying a multi-word pseudo register (which will
be the output of the block), a group of insns that each set one word of
the value and have the
REG_NO_CONFLICT note attached, and a final
insn that copies the output to itself with an attached
note giving the expression being computed. This block is encapsulated
REG_RETVAL notes on the first and
last insns, respectively.
NOTE_INSN_DELETED_LABEL, but is not a
jump_insn, or it is a
jump_insnthat required the label to be held in a register. The presence of this note allows jump optimization to be aware that op is, in fact, being used, and flow optimization to build an accurate flow graph.
The following notes describe attributes of outputs of an insn:
strict_low_partexpression, the note refers to the register that is contained in
REG_EQUIV, the register is equivalent to op throughout
the entire function, and could validly be replaced in all its
occurrences by op. ("Validly" here refers to the data flow of
the program; simple replacement may make some insns invalid.) For
example, when a constant is loaded into a register that is never
assigned any other value, this kind of note is used.
When a parameter is copied into a pseudo-register at entry to a function, a note of this kind records that the register is equivalent to the stack slot where the parameter was passed. Although in this case the register may be set by other insns, it is still valid to replace the register by the stack slot throughout the function.
REG_EQUIV note is also used on an instruction which copies a
register parameter into a pseudo-register at entry to a function, if
there is a stack slot where that parameter could be stored. Although
other insns may set the pseudo-register, it is valid for the compiler to
replace the pseudo-register by stack slot throughout the function,
provided the compiler ensures that the stack slot is properly
initialized by making the replacement in the initial copy instruction as
well. This is used on machines for which the calling convention
allocates stack space for register parameters. See
REG_PARM_STACK_SPACE in 10.10.6 Passing Function Arguments on the Stack.
In the case of
REG_EQUAL, the register that is set by this insn
will be equal to op at run time at the end of this insn but not
necessarily elsewhere in the function. In this case, op
is typically an arithmetic expression. For example, when a sequence of
insns such as a library call is used to perform an arithmetic operation,
this kind of note is attached to the insn that produces or copies the
These two notes are used in different ways by the compiler passes.
REG_EQUAL is used by passes prior to register allocation (such as
common subexpression elimination and loop optimization) to tell them how
to think of that value.
REG_EQUIV notes are used by register
allocation to indicate that there is an available substitute expression
(either a constant or a
mem expression for the location of a
parameter on the stack) that may be used in place of a register if
insufficient registers are available.
Except for stack homes for parameters, which are indicated by a
REG_EQUIV note and are not useful to the early optimization
passes and pseudo registers that are equivalent to a memory location
throughout their entire life, which is not detected until later in
the compilation, all equivalences are initially indicated by an attached
REG_EQUAL note. In the early stages of register allocation, a
REG_EQUAL note is changed into a
REG_EQUIV note if
op is a constant and the insn represents the only set of its
Thus, compiler passes prior to register allocation need only check for
REG_EQUAL notes and passes subsequent to register allocation
need only check for
note; its absence implies nothing.
These notes describe linkages between insns. They occur in pairs: one insn has one of a pair of notes that points to a second insn, which has the inverse note pointing back to the first insn.
Loop optimization uses this note to treat such a sequence as a single operation for code motion purposes and flow analysis uses this note to delete such sequences whose results are dead.
REG_EQUAL note will also usually be attached to this insn to
provide the expression being computed by the sequence.
These notes will be deleted after reload, since they are no longer accurate or useful.
REG_RETVAL: it is placed on the first insn of a multi-insn sequence, and it points to the last one.
These notes are deleted after reload, since they are no longer useful or accurate.
cc0, the insns which set and use
cc0set and use
cc0are adjacent. However, when branch delay slot filling is done, this may no longer be true. In this case a
REG_CC_USERnote will be placed on the insn setting
cc0to point to the insn using
REG_CC_SETTERnote will be placed on the insn using
cc0to point to the insn setting
These values are only used in the
LOG_LINKS field, and indicate
the type of dependency that each link represents. Links which indicate
a data dependence (a read after write dependence) do not use any code,
they simply have mode
VOIDmode, and are printed without any
These notes describe information gathered from gcov profile data. They
are stored in the
REG_NOTES field of an insn as an
For convenience, the machine mode in an
expr_list is printed using these symbolic codes in debugging dumps.
The only difference between the expression codes
expr_list is that the first operand of an
assumed to be an insn and is printed in debugging dumps as the insn's
unique id; the first operand of an
expr_list is printed in the
ordinary way as an expression.
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
|webmaster||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|