b8698a0f37
2009-11-25 H.J. Lu <hongjiu.lu@intel.com> * alias.c: Remove trailing white spaces. * alloc-pool.c: Likewise. * alloc-pool.h: Likewise. * attribs.c: Likewise. * auto-inc-dec.c: Likewise. * basic-block.h: Likewise. * bb-reorder.c: Likewise. * bt-load.c: Likewise. * builtins.c: Likewise. * builtins.def: Likewise. * c-common.c: Likewise. * c-common.h: Likewise. * c-cppbuiltin.c: Likewise. * c-decl.c: Likewise. * c-format.c: Likewise. * c-lex.c: Likewise. * c-omp.c: Likewise. * c-opts.c: Likewise. * c-parser.c: Likewise. * c-pretty-print.c: Likewise. * c-tree.h: Likewise. * c-typeck.c: Likewise. * caller-save.c: Likewise. * calls.c: Likewise. * cfg.c: Likewise. * cfganal.c: Likewise. * cfgexpand.c: Likewise. * cfghooks.c: Likewise. * cfghooks.h: Likewise. * cfglayout.c: Likewise. * cfgloop.c: Likewise. * cfgloop.h: Likewise. * cfgloopmanip.c: Likewise. * cfgrtl.c: Likewise. * cgraph.c: Likewise. * cgraph.h: Likewise. * cgraphbuild.c: Likewise. * cgraphunit.c: Likewise. * cif-code.def: Likewise. * collect2.c: Likewise. * combine.c: Likewise. * convert.c: Likewise. * coverage.c: Likewise. * crtstuff.c: Likewise. * cse.c: Likewise. * cselib.c: Likewise. * dbgcnt.c: Likewise. * dbgcnt.def: Likewise. * dbgcnt.h: Likewise. * dbxout.c: Likewise. * dce.c: Likewise. * ddg.c: Likewise. * ddg.h: Likewise. * defaults.h: Likewise. * df-byte-scan.c: Likewise. * df-core.c: Likewise. * df-problems.c: Likewise. * df-scan.c: Likewise. * df.h: Likewise. * dfp.c: Likewise. * diagnostic.c: Likewise. * diagnostic.h: Likewise. * dominance.c: Likewise. * domwalk.c: Likewise. * double-int.c: Likewise. * double-int.h: Likewise. * dse.c: Likewise. * dwarf2asm.c: Likewise. * dwarf2asm.h: Likewise. * dwarf2out.c: Likewise. * ebitmap.c: Likewise. * ebitmap.h: Likewise. * emit-rtl.c: Likewise. * et-forest.c: Likewise. * except.c: Likewise. * except.h: Likewise. * expmed.c: Likewise. * expr.c: Likewise. * expr.h: Likewise. * final.c: Likewise. * flags.h: Likewise. * fold-const.c: Likewise. * function.c: Likewise. * function.h: Likewise. * fwprop.c: Likewise. * gcc.c: Likewise. * gcov-dump.c: Likewise. * gcov-io.c: Likewise. * gcov-io.h: Likewise. * gcov.c: Likewise. * gcse.c: Likewise. * genattr.c: Likewise. * genattrtab.c: Likewise. * genautomata.c: Likewise. * genchecksum.c: Likewise. * genconfig.c: Likewise. * genflags.c: Likewise. * gengtype-parse.c: Likewise. * gengtype.c: Likewise. * gengtype.h: Likewise. * genmddeps.c: Likewise. * genmodes.c: Likewise. * genopinit.c: Likewise. * genpreds.c: Likewise. * gensupport.c: Likewise. * ggc-common.c: Likewise. * ggc-page.c: Likewise. * ggc-zone.c: Likewise. * ggc.h: Likewise. * gimple-iterator.c: Likewise. * gimple-low.c: Likewise. * gimple-pretty-print.c: Likewise. * gimple.c: Likewise. * gimple.def: Likewise. * gimple.h: Likewise. * gimplify.c: Likewise. * graphds.c: Likewise. * graphite-clast-to-gimple.c: Likewise. * gthr-nks.h: Likewise. * gthr-posix.c: Likewise. * gthr-posix.h: Likewise. * gthr-posix95.h: Likewise. * gthr-single.h: Likewise. * gthr-tpf.h: Likewise. * gthr-vxworks.h: Likewise. * gthr.h: Likewise. * haifa-sched.c: Likewise. * hard-reg-set.h: Likewise. * hooks.c: Likewise. * hooks.h: Likewise. * hosthooks.h: Likewise. * hwint.h: Likewise. * ifcvt.c: Likewise. * incpath.c: Likewise. * init-regs.c: Likewise. * integrate.c: Likewise. * ipa-cp.c: Likewise. * ipa-inline.c: Likewise. * ipa-prop.c: Likewise. * ipa-pure-const.c: Likewise. * ipa-reference.c: Likewise. * ipa-struct-reorg.c: Likewise. * ipa-struct-reorg.h: Likewise. * ipa-type-escape.c: Likewise. * ipa-type-escape.h: Likewise. * ipa-utils.c: Likewise. * ipa-utils.h: Likewise. * ipa.c: Likewise. * ira-build.c: Likewise. * ira-color.c: Likewise. * ira-conflicts.c: Likewise. * ira-costs.c: Likewise. * ira-emit.c: Likewise. * ira-int.h: Likewise. * ira-lives.c: Likewise. * ira.c: Likewise. * jump.c: Likewise. * lambda-code.c: Likewise. * lambda-mat.c: Likewise. * lambda-trans.c: Likewise. * lambda.h: Likewise. * langhooks.c: Likewise. * lcm.c: Likewise. * libgcov.c: Likewise. * lists.c: Likewise. * loop-doloop.c: Likewise. * loop-init.c: Likewise. * loop-invariant.c: Likewise. * loop-iv.c: Likewise. * loop-unroll.c: Likewise. * lower-subreg.c: Likewise. * lto-cgraph.c: Likewise. * lto-compress.c: Likewise. * lto-opts.c: Likewise. * lto-section-in.c: Likewise. * lto-section-out.c: Likewise. * lto-streamer-in.c: Likewise. * lto-streamer-out.c: Likewise. * lto-streamer.c: Likewise. * lto-streamer.h: Likewise. * lto-symtab.c: Likewise. * lto-wpa-fixup.c: Likewise. * matrix-reorg.c: Likewise. * mcf.c: Likewise. * mode-switching.c: Likewise. * modulo-sched.c: Likewise. * omega.c: Likewise. * omega.h: Likewise. * omp-low.c: Likewise. * optabs.c: Likewise. * optabs.h: Likewise. * opts-common.c: Likewise. * opts.c: Likewise. * params.def: Likewise. * params.h: Likewise. * passes.c: Likewise. * plugin.c: Likewise. * postreload-gcse.c: Likewise. * postreload.c: Likewise. * predict.c: Likewise. * predict.def: Likewise. * pretty-print.c: Likewise. * pretty-print.h: Likewise. * print-rtl.c: Likewise. * print-tree.c: Likewise. * profile.c: Likewise. * read-rtl.c: Likewise. * real.c: Likewise. * recog.c: Likewise. * reg-stack.c: Likewise. * regcprop.c: Likewise. * reginfo.c: Likewise. * regmove.c: Likewise. * regrename.c: Likewise. * regs.h: Likewise. * regstat.c: Likewise. * reload.c: Likewise. * reload1.c: Likewise. * resource.c: Likewise. * rtl.c: Likewise. * rtl.def: Likewise. * rtl.h: Likewise. * rtlanal.c: Likewise. * sbitmap.c: Likewise. * sched-deps.c: Likewise. * sched-ebb.c: Likewise. * sched-int.h: Likewise. * sched-rgn.c: Likewise. * sched-vis.c: Likewise. * sdbout.c: Likewise. * sel-sched-dump.c: Likewise. * sel-sched-dump.h: Likewise. * sel-sched-ir.c: Likewise. * sel-sched-ir.h: Likewise. * sel-sched.c: Likewise. * sel-sched.h: Likewise. * sese.c: Likewise. * sese.h: Likewise. * simplify-rtx.c: Likewise. * stack-ptr-mod.c: Likewise. * stmt.c: Likewise. * stor-layout.c: Likewise. * store-motion.c: Likewise. * stringpool.c: Likewise. * stub-objc.c: Likewise. * sync-builtins.def: Likewise. * target-def.h: Likewise. * target.h: Likewise. * targhooks.c: Likewise. * targhooks.h: Likewise. * timevar.c: Likewise. * tlink.c: Likewise. * toplev.c: Likewise. * toplev.h: Likewise. * tracer.c: Likewise. * tree-affine.c: Likewise. * tree-affine.h: Likewise. * tree-browser.def: Likewise. * tree-call-cdce.c: Likewise. * tree-cfg.c: Likewise. * tree-cfgcleanup.c: Likewise. * tree-chrec.c: Likewise. * tree-chrec.h: Likewise. * tree-complex.c: Likewise. * tree-data-ref.c: Likewise. * tree-data-ref.h: Likewise. * tree-dfa.c: Likewise. * tree-dump.c: Likewise. * tree-dump.h: Likewise. * tree-eh.c: Likewise. * tree-flow-inline.h: Likewise. * tree-flow.h: Likewise. * tree-if-conv.c: Likewise. * tree-inline.c: Likewise. * tree-into-ssa.c: Likewise. * tree-loop-distribution.c: Likewise. * tree-loop-linear.c: Likewise. * tree-mudflap.c: Likewise. * tree-nested.c: Likewise. * tree-nomudflap.c: Likewise. * tree-nrv.c: Likewise. * tree-object-size.c: Likewise. * tree-optimize.c: Likewise. * tree-outof-ssa.c: Likewise. * tree-parloops.c: Likewise. * tree-pass.h: Likewise. * tree-phinodes.c: Likewise. * tree-predcom.c: Likewise. * tree-pretty-print.c: Likewise. * tree-profile.c: Likewise. * tree-scalar-evolution.c: Likewise. * tree-ssa-address.c: Likewise. * tree-ssa-alias.c: Likewise. * tree-ssa-ccp.c: Likewise. * tree-ssa-coalesce.c: Likewise. * tree-ssa-copy.c: Likewise. * tree-ssa-copyrename.c: Likewise. * tree-ssa-dce.c: Likewise. * tree-ssa-dom.c: Likewise. * tree-ssa-dse.c: Likewise. * tree-ssa-forwprop.c: Likewise. * tree-ssa-ifcombine.c: Likewise. * tree-ssa-live.c: Likewise. * tree-ssa-live.h: Likewise. * tree-ssa-loop-ch.c: Likewise. * tree-ssa-loop-im.c: Likewise. * tree-ssa-loop-ivcanon.c: Likewise. * tree-ssa-loop-ivopts.c: Likewise. * tree-ssa-loop-manip.c: Likewise. * tree-ssa-loop-niter.c: Likewise. * tree-ssa-loop-prefetch.c: Likewise. * tree-ssa-loop-unswitch.c: Likewise. * tree-ssa-loop.c: Likewise. * tree-ssa-math-opts.c: Likewise. * tree-ssa-operands.c: Likewise. * tree-ssa-operands.h: Likewise. * tree-ssa-phiopt.c: Likewise. * tree-ssa-phiprop.c: Likewise. * tree-ssa-pre.c: Likewise. * tree-ssa-propagate.c: Likewise. * tree-ssa-reassoc.c: Likewise. * tree-ssa-sccvn.c: Likewise. * tree-ssa-sink.c: Likewise. * tree-ssa-structalias.c: Likewise. * tree-ssa-ter.c: Likewise. * tree-ssa-threadedge.c: Likewise. * tree-ssa-threadupdate.c: Likewise. * tree-ssa-uncprop.c: Likewise. * tree-ssa.c: Likewise. * tree-ssanames.c: Likewise. * tree-switch-conversion.c: Likewise. * tree-tailcall.c: Likewise. * tree-vect-data-refs.c: Likewise. * tree-vect-generic.c: Likewise. * tree-vect-loop-manip.c: Likewise. * tree-vect-loop.c: Likewise. * tree-vect-patterns.c: Likewise. * tree-vect-slp.c: Likewise. * tree-vect-stmts.c: Likewise. * tree-vectorizer.c: Likewise. * tree-vectorizer.h: Likewise. * tree-vrp.c: Likewise. * tree.c: Likewise. * tree.def: Likewise. * tree.h: Likewise. * treestruct.def: Likewise. * unwind-compat.c: Likewise. * unwind-dw2-fde-glibc.c: Likewise. * unwind-dw2.c: Likewise. * value-prof.c: Likewise. * value-prof.h: Likewise. * var-tracking.c: Likewise. * varasm.c: Likewise. * varpool.c: Likewise. * vec.c: Likewise. * vec.h: Likewise. * vmsdbgout.c: Likewise. * web.c: Likewise. * xcoffout.c: Likewise. From-SVN: r154645
366 lines
9.3 KiB
C
366 lines
9.3 KiB
C
/* Generate from machine description:
|
|
- some #define configuration flags.
|
|
Copyright (C) 1987, 1991, 1997, 1998, 1999, 2000, 2003, 2004, 2007
|
|
Free Software Foundation, Inc.
|
|
|
|
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/>. */
|
|
|
|
|
|
#include "bconfig.h"
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "tm.h"
|
|
#include "rtl.h"
|
|
#include "errors.h"
|
|
#include "gensupport.h"
|
|
|
|
|
|
/* flags to determine output of machine description dependent #define's. */
|
|
static int max_recog_operands; /* Largest operand number seen. */
|
|
static int max_dup_operands; /* Largest number of match_dup in any insn. */
|
|
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;
|
|
|
|
/* Maximum number of insns seen in a split. */
|
|
static int max_insns_per_split = 1;
|
|
|
|
/* Maximum number of input insns for peephole2. */
|
|
static int max_insns_per_peep2;
|
|
|
|
static int clobbers_seen_this_insn;
|
|
static int dup_operands_seen_this_insn;
|
|
|
|
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);
|
|
|
|
/* 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). */
|
|
|
|
static void
|
|
walk_insn_part (rtx part, int recog_p, int non_pc_set_src)
|
|
{
|
|
int i, j;
|
|
RTX_CODE code;
|
|
const char *format_ptr;
|
|
|
|
if (part == 0)
|
|
return;
|
|
|
|
code = GET_CODE (part);
|
|
switch (code)
|
|
{
|
|
case CLOBBER:
|
|
clobbers_seen_this_insn++;
|
|
break;
|
|
|
|
case MATCH_OPERAND:
|
|
if (XINT (part, 0) > max_recog_operands)
|
|
max_recog_operands = XINT (part, 0);
|
|
return;
|
|
|
|
case MATCH_OP_DUP:
|
|
case MATCH_PAR_DUP:
|
|
++dup_operands_seen_this_insn;
|
|
case MATCH_SCRATCH:
|
|
case MATCH_PARALLEL:
|
|
case MATCH_OPERATOR:
|
|
if (XINT (part, 0) > max_recog_operands)
|
|
max_recog_operands = XINT (part, 0);
|
|
/* Now scan the rtl's in the vector inside the MATCH_OPERATOR or
|
|
MATCH_PARALLEL. */
|
|
break;
|
|
|
|
case LABEL_REF:
|
|
if (GET_CODE (XEXP (part, 0)) == MATCH_OPERAND
|
|
|| GET_CODE (XEXP (part, 0)) == MATCH_DUP)
|
|
break;
|
|
return;
|
|
|
|
case MATCH_DUP:
|
|
++dup_operands_seen_this_insn;
|
|
if (XINT (part, 0) > max_recog_operands)
|
|
max_recog_operands = XINT (part, 0);
|
|
return;
|
|
|
|
case CC0:
|
|
if (recog_p)
|
|
have_cc0_flag = 1;
|
|
return;
|
|
|
|
case LO_SUM:
|
|
if (recog_p)
|
|
have_lo_sum_flag = 1;
|
|
return;
|
|
|
|
case SET:
|
|
walk_insn_part (SET_DEST (part), 0, recog_p);
|
|
walk_insn_part (SET_SRC (part), recog_p,
|
|
GET_CODE (SET_DEST (part)) != PC);
|
|
return;
|
|
|
|
case IF_THEN_ELSE:
|
|
/* 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. */
|
|
|
|
if (recog_p && non_pc_set_src
|
|
&& GET_CODE (XEXP (part, 1)) == MATCH_OPERAND
|
|
&& GET_CODE (XEXP (part, 2)) == MATCH_OPERAND)
|
|
have_cmove_flag = 1;
|
|
break;
|
|
|
|
case COND_EXEC:
|
|
if (recog_p)
|
|
have_cond_exec_flag = 1;
|
|
break;
|
|
|
|
case REG: case CONST_INT: case SYMBOL_REF:
|
|
case PC:
|
|
return;
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
format_ptr = GET_RTX_FORMAT (GET_CODE (part));
|
|
|
|
for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
|
|
switch (*format_ptr++)
|
|
{
|
|
case 'e':
|
|
case 'u':
|
|
walk_insn_part (XEXP (part, i), recog_p, non_pc_set_src);
|
|
break;
|
|
case 'E':
|
|
if (XVEC (part, i) != NULL)
|
|
for (j = 0; j < XVECLEN (part, i); j++)
|
|
walk_insn_part (XVECEXP (part, i, j), recog_p, non_pc_set_src);
|
|
break;
|
|
}
|
|
}
|
|
|
|
static void
|
|
gen_insn (rtx insn)
|
|
{
|
|
int i;
|
|
|
|
/* Walk the insn pattern to gather the #define's status. */
|
|
clobbers_seen_this_insn = 0;
|
|
dup_operands_seen_this_insn = 0;
|
|
if (XVEC (insn, 1) != 0)
|
|
for (i = 0; i < XVECLEN (insn, 1); i++)
|
|
walk_insn_part (XVECEXP (insn, 1, i), 1, 0);
|
|
|
|
if (clobbers_seen_this_insn > max_clobbers_per_insn)
|
|
max_clobbers_per_insn = clobbers_seen_this_insn;
|
|
if (dup_operands_seen_this_insn > max_dup_operands)
|
|
max_dup_operands = dup_operands_seen_this_insn;
|
|
}
|
|
|
|
/* Similar but scan a define_expand. */
|
|
|
|
static void
|
|
gen_expand (rtx insn)
|
|
{
|
|
int i;
|
|
|
|
/* 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. */
|
|
if (XVEC (insn, 1) != 0)
|
|
for (i = 0; i < XVECLEN (insn, 1); i++)
|
|
{
|
|
/* Compute the maximum SETs and CLOBBERS
|
|
in any one of the sub-insns;
|
|
don't sum across all of them. */
|
|
clobbers_seen_this_insn = 0;
|
|
|
|
walk_insn_part (XVECEXP (insn, 1, i), 0, 0);
|
|
|
|
if (clobbers_seen_this_insn > max_clobbers_per_insn)
|
|
max_clobbers_per_insn = clobbers_seen_this_insn;
|
|
}
|
|
}
|
|
|
|
/* Similar but scan a define_split. */
|
|
|
|
static void
|
|
gen_split (rtx split)
|
|
{
|
|
int i;
|
|
|
|
/* Look through the patterns that are matched
|
|
to compute the maximum operand number. */
|
|
for (i = 0; i < XVECLEN (split, 0); i++)
|
|
walk_insn_part (XVECEXP (split, 0, i), 1, 0);
|
|
/* Look at the number of insns this insn could split into. */
|
|
if (XVECLEN (split, 2) > max_insns_per_split)
|
|
max_insns_per_split = XVECLEN (split, 2);
|
|
}
|
|
|
|
static void
|
|
gen_peephole (rtx peep)
|
|
{
|
|
int i;
|
|
|
|
/* Look through the patterns that are matched
|
|
to compute the maximum operand number. */
|
|
for (i = 0; i < XVECLEN (peep, 0); i++)
|
|
walk_insn_part (XVECEXP (peep, 0, i), 1, 0);
|
|
}
|
|
|
|
static void
|
|
gen_peephole2 (rtx peep)
|
|
{
|
|
int i, n;
|
|
|
|
/* Look through the patterns that are matched
|
|
to compute the maximum operand number. */
|
|
for (i = XVECLEN (peep, 0) - 1; i >= 0; --i)
|
|
walk_insn_part (XVECEXP (peep, 0, i), 1, 0);
|
|
|
|
/* Look at the number of insns this insn can be matched from. */
|
|
for (i = XVECLEN (peep, 0) - 1, n = 0; i >= 0; --i)
|
|
if (GET_CODE (XVECEXP (peep, 0, i)) != MATCH_DUP
|
|
&& GET_CODE (XVECEXP (peep, 0, i)) != MATCH_SCRATCH)
|
|
n++;
|
|
if (n > max_insns_per_peep2)
|
|
max_insns_per_peep2 = n;
|
|
}
|
|
|
|
int
|
|
main (int argc, char **argv)
|
|
{
|
|
rtx desc;
|
|
|
|
progname = "genconfig";
|
|
|
|
if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
|
|
return (FATAL_EXIT_CODE);
|
|
|
|
puts ("/* Generated automatically by the program `genconfig'");
|
|
puts (" from the machine description file `md'. */\n");
|
|
puts ("#ifndef GCC_INSN_CONFIG_H");
|
|
puts ("#define GCC_INSN_CONFIG_H\n");
|
|
|
|
/* 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. */
|
|
max_recog_operands = 29; /* We will add 1 later. */
|
|
max_dup_operands = 1;
|
|
|
|
/* Read the machine description. */
|
|
|
|
while (1)
|
|
{
|
|
int line_no, insn_code_number = 0;
|
|
|
|
desc = read_md_rtx (&line_no, &insn_code_number);
|
|
if (desc == NULL)
|
|
break;
|
|
|
|
switch (GET_CODE (desc))
|
|
{
|
|
case DEFINE_INSN:
|
|
gen_insn (desc);
|
|
break;
|
|
|
|
case DEFINE_EXPAND:
|
|
gen_expand (desc);
|
|
break;
|
|
|
|
case DEFINE_SPLIT:
|
|
gen_split (desc);
|
|
break;
|
|
|
|
case DEFINE_PEEPHOLE2:
|
|
have_peephole2_flag = 1;
|
|
gen_peephole2 (desc);
|
|
break;
|
|
|
|
case DEFINE_PEEPHOLE:
|
|
have_peephole_flag = 1;
|
|
gen_peephole (desc);
|
|
break;
|
|
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
printf ("#define MAX_RECOG_OPERANDS %d\n", max_recog_operands + 1);
|
|
printf ("#define MAX_DUP_OPERANDS %d\n", max_dup_operands);
|
|
|
|
/* 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). */
|
|
printf ("#ifndef MAX_INSNS_PER_SPLIT\n");
|
|
printf ("#define MAX_INSNS_PER_SPLIT %d\n", max_insns_per_split);
|
|
printf ("#endif\n");
|
|
|
|
if (have_cc0_flag)
|
|
{
|
|
printf ("#define HAVE_cc0 1\n");
|
|
printf ("#define CC0_P(X) ((X) == cc0_rtx)\n");
|
|
}
|
|
else
|
|
{
|
|
/* We output CC0_P this way to make sure that X is declared
|
|
somewhere. */
|
|
printf ("#define CC0_P(X) ((X) ? 0 : 0)\n");
|
|
}
|
|
|
|
if (have_cmove_flag)
|
|
printf ("#define HAVE_conditional_move 1\n");
|
|
|
|
if (have_cond_exec_flag)
|
|
printf ("#define HAVE_conditional_execution 1\n");
|
|
|
|
if (have_lo_sum_flag)
|
|
printf ("#define HAVE_lo_sum 1\n");
|
|
|
|
if (have_peephole_flag)
|
|
printf ("#define HAVE_peephole 1\n");
|
|
|
|
if (have_peephole2_flag)
|
|
{
|
|
printf ("#define HAVE_peephole2 1\n");
|
|
printf ("#define MAX_INSNS_PER_PEEP2 %d\n", max_insns_per_peep2);
|
|
}
|
|
|
|
puts("\n#endif /* GCC_INSN_CONFIG_H */");
|
|
|
|
if (ferror (stdout) || fflush (stdout) || fclose (stdout))
|
|
return FATAL_EXIT_CODE;
|
|
|
|
return SUCCESS_EXIT_CODE;
|
|
}
|