- Generated by
1.8.1.1
|
GCC Middle and Back End API Reference
|
Functions | |
| static void | walk_insn_part (rtx, int, int) |
| static void | gen_insn (rtx) |
| static void | gen_expand (rtx) |
| static void | gen_split (rtx) |
| static void | gen_peephole (rtx) |
| static void | gen_peephole2 (rtx) |
| static void | walk_insn_part () |
| static void | gen_insn () |
| static void | gen_expand () |
| static void | gen_split () |
| static void | gen_peephole () |
| static void | gen_peephole2 () |
| int | main () |
Variables | |
| static int | max_recog_operands |
| static int | max_dup_operands |
| static int | max_clobbers_per_insn |
| static int | have_cc0_flag |
| static int | have_cmove_flag |
| static int | have_cond_exec_flag |
| static int | have_lo_sum_flag |
| static int | have_peephole_flag |
| static int | have_peephole2_flag |
| static int | max_insns_per_split = 1 |
| static int | max_insns_per_peep2 |
| static int | clobbers_seen_this_insn |
| static int | dup_operands_seen_this_insn |
|
static |
Similar but scan a define_expand.
Walk the insn pattern to gather the #define's status.
Note that we don't bother recording the number of MATCH_DUPs
that occur in a gen_expand, because only reload cares about that. Compute the maximum SETs and CLOBBERS
in any one of the sub-insns;
don't sum across all of them.
|
static |
|
static |
Walk the insn pattern to gather the #define's status.
|
static |
Look through the patterns that are matched
to compute the maximum operand number.
|
static |
Look through the patterns that are matched
to compute the maximum operand number. Look at the number of insns this insn can be matched from.
|
static |
Similar but scan a define_split.
Look through the patterns that are matched
to compute the maximum operand number. Look at the number of insns this insn could split into.
References walk_insn_part().
| int main | ( | ) |
Allow at least 30 operands for the sake of asm constructs.
??? We *really* ought to reorganize things such that there
is no fixed upper bound. Read the machine description.
This is conditionally defined, in case the user writes code which emits
more splits than we can readily see (and knows s/he does it). We output CC0_P this way to make sure that X is declared
somewhere.
References gen_expand(), gen_insn(), gen_peephole(), gen_peephole2(), gen_split(), have_peephole2_flag, have_peephole_flag, insn_code_number, line_no, and read_md_rtx().
|
static |
Referenced by gen_split().
|
static |
RECOG_P will be nonzero if this pattern was seen in a context where it will be used to recognize, rather than just generate an insn. NON_PC_SET_SRC will be nonzero if this pattern was seen in a SET_SRC of a SET whose destination is not (pc).
Now scan the rtl's in the vector inside the MATCH_OPERATOR or
MATCH_PARALLEL. Only consider this machine as having a conditional move if the
two arms of the IF_THEN_ELSE are both MATCH_OPERAND. Otherwise,
we have some specific IF_THEN_ELSE construct (like the doz
instruction on the RS/6000) that can't be used in the general
context we want it for.
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
Referenced by main().
|
static |
Referenced by main().
|
static |
|
static |
|
static |
Maximum number of input insns for peephole2.
|
static |
Maximum number of insns seen in a split.
|
static |
@verbatim
Generate from machine description:
This file is part of GCC.
GCC 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 3, or (at your option) any later version.
GCC 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 GCC; see the file COPYING3. If not see http://www.gnu.org/licenses/.
flags to determine output of machine description dependent #define's.
1.8.1.1