1991-11-05 00:01:28 +01:00
|
|
|
|
/* Generate code from to output assembler insns as recognized from rtl.
|
2003-01-13 22:37:13 +01:00
|
|
|
|
Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000, 2002,
|
|
|
|
|
2003 Free Software Foundation, Inc.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
This file is part of GCC.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
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 2, or (at your option) any later
|
|
|
|
|
version.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
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.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
along with GCC; see the file COPYING. If not, write to the Free
|
|
|
|
|
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|
|
|
|
02111-1307, USA. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* This program reads the machine description for the compiler target machine
|
|
|
|
|
and produces a file containing these things:
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
1. An array of `struct insn_data', which is indexed by insn code number,
|
|
|
|
|
which contains:
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
a. `name' is the name for that pattern. Nameless patterns are
|
|
|
|
|
given a name.
|
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
b. `output' hold either the output template, an array of output
|
|
|
|
|
templates, or an output function.
|
|
|
|
|
|
|
|
|
|
c. `genfun' is the function to generate a body for that pattern,
|
1999-09-12 14:46:08 +02:00
|
|
|
|
given operands as arguments.
|
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d. `n_operands' is the number of distinct operands in the pattern
|
1999-09-12 14:46:08 +02:00
|
|
|
|
for that insn,
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
e. `n_dups' is the number of match_dup's that appear in the insn's
|
1999-09-12 14:46:08 +02:00
|
|
|
|
pattern. This says how many elements of `recog_data.dup_loc' are
|
|
|
|
|
significant after an insn has been recognized.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
f. `n_alternatives' is the number of alternatives in the constraints
|
1999-09-12 14:46:08 +02:00
|
|
|
|
of each pattern.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
g. `output_format' tells what type of thing `output' is.
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
h. `operand' is the base of an array of operand data for the insn.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
2. An array of `struct insn_operand data', used by `operand' above.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
a. `predicate', an int-valued function, is the match_operand predicate
|
|
|
|
|
for this operand.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
b. `constraint' is the constraint for this operand. This exists
|
|
|
|
|
only if register constraints appear in match_operand rtx's.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
c. `address_p' indicates that the operand appears within ADDRESS
|
|
|
|
|
rtx's. This exists only if there are *no* register constraints
|
|
|
|
|
in the match_operand rtx's.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d. `mode' is the machine mode that that operand is supposed to have.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-10-23 00:02:17 +02:00
|
|
|
|
f. `eliminable', is nonzero for operands that are matched normally by
|
|
|
|
|
MATCH_OPERAND; it is zero for operands that should not be changed during
|
|
|
|
|
register elimination such as MATCH_OPERATORs.
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
The code number of an insn is simply its position in the machine
|
|
|
|
|
description; code numbers are assigned sequentially to entries in
|
|
|
|
|
the description, starting with code number 0.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
Thus, the following entry in the machine description
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
(define_insn "clrdf"
|
|
|
|
|
[(set (match_operand:DF 0 "general_operand" "")
|
|
|
|
|
(const_int 0))]
|
|
|
|
|
""
|
|
|
|
|
"clrd %0")
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
assuming it is the 25th entry present, would cause
|
|
|
|
|
insn_data[24].template to be "clrd %0", and
|
|
|
|
|
insn_data[24].n_operands to be 1. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2002-12-16 19:23:00 +01:00
|
|
|
|
#include "bconfig.h"
|
Cutover various gen*.c files to using system.h:
* Makefile.in (genconfig.o, genflags.o, gencodes.o, genemit.o,
genopinit.o, genrecog.o, genextract.o, genpeep.o, genattr.o,
genattrtab.o, genoutput.o): Depend on system.h.
* genattr.c: Include system.h. Add arguments to various function
prototypes. Remove redundant prototype of read_rtx().
* genattrtab.c: Likewise.
* gencodes.c: Likewise.
* genconfig.c: Likewise.
* genemit.c: Likewise.
* genextract.c: Likewise.
* genflags.c: Likewise.
* genopinit.c: Likewise.
* genoutput.c: Likewise.
* genpeep.c: Likewise.
* genrecog.c: Likewise.
From-SVN: r18794
1998-03-24 11:16:53 +01:00
|
|
|
|
#include "system.h"
|
2002-12-16 19:23:00 +01:00
|
|
|
|
#include "coretypes.h"
|
|
|
|
|
#include "tm.h"
|
1991-11-05 00:01:28 +01:00
|
|
|
|
#include "rtl.h"
|
2000-05-28 04:17:59 +02:00
|
|
|
|
#include "errors.h"
|
2000-05-03 19:45:26 +02:00
|
|
|
|
#include "gensupport.h"
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* No instruction can have more operands than this. Sorry for this
|
|
|
|
|
arbitrary limit, but what machine will have an instruction with
|
|
|
|
|
this many operands? */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
#define MAX_MAX_OPERANDS 40
|
|
|
|
|
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
static int n_occurrences PARAMS ((int, const char *));
|
|
|
|
|
static const char *strip_whitespace PARAMS ((const char *));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
/* insns in the machine description are assigned sequential code numbers
|
|
|
|
|
that are used by insn-recog.c (produced by genrecog) to communicate
|
|
|
|
|
to insn-output.c (produced by this program). */
|
|
|
|
|
|
|
|
|
|
static int next_code_number;
|
|
|
|
|
|
|
|
|
|
/* This counts all definitions in the md file,
|
|
|
|
|
for the sake of error messages. */
|
|
|
|
|
|
|
|
|
|
static int next_index_number;
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* This counts all operands used in the md file. The first is null. */
|
|
|
|
|
|
|
|
|
|
static int next_operand_number = 1;
|
|
|
|
|
|
|
|
|
|
/* Record in this chain all information about the operands we will output. */
|
|
|
|
|
|
|
|
|
|
struct operand_data
|
|
|
|
|
{
|
|
|
|
|
struct operand_data *next;
|
|
|
|
|
int index;
|
1999-09-15 16:13:50 +02:00
|
|
|
|
const char *predicate;
|
|
|
|
|
const char *constraint;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
enum machine_mode mode;
|
|
|
|
|
unsigned char n_alternatives;
|
|
|
|
|
char address_p;
|
|
|
|
|
char strict_low;
|
1999-10-23 00:02:17 +02:00
|
|
|
|
char eliminable;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
char seen;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Begin with a null operand at index 0. */
|
|
|
|
|
|
|
|
|
|
static struct operand_data null_operand =
|
|
|
|
|
{
|
1999-11-05 10:12:56 +01:00
|
|
|
|
0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0
|
1999-09-12 14:46:08 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static struct operand_data *odata = &null_operand;
|
|
|
|
|
static struct operand_data **odata_end = &null_operand.next;
|
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
/* Must match the constants in recog.h. */
|
|
|
|
|
|
|
|
|
|
#define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
|
|
|
|
|
#define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
|
|
|
|
|
#define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
|
|
|
|
|
#define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
/* Record in this chain all information that we will output,
|
|
|
|
|
associated with the code number of the insn. */
|
|
|
|
|
|
|
|
|
|
struct data
|
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
struct data *next;
|
1999-09-15 16:13:50 +02:00
|
|
|
|
const char *name;
|
|
|
|
|
const char *template;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
int code_number;
|
|
|
|
|
int index_number;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
int lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
int n_operands; /* Number of operands this insn recognizes */
|
|
|
|
|
int n_dups; /* Number times match_dup appears in pattern */
|
|
|
|
|
int n_alternatives; /* Number of alternatives in each constraint */
|
1999-09-12 14:46:08 +02:00
|
|
|
|
int operand_number; /* Operand index in the big array. */
|
1999-09-14 06:19:34 +02:00
|
|
|
|
int output_format; /* INSN_OUTPUT_FORMAT_*. */
|
1999-09-12 14:46:08 +02:00
|
|
|
|
struct operand_data operand[MAX_MAX_OPERANDS];
|
1991-11-05 00:01:28 +01:00
|
|
|
|
};
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* This variable points to the first link in the insn chain. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
static struct data *idata, **idata_end = &idata;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-01-17 16:17:38 +01:00
|
|
|
|
static void output_prologue PARAMS ((void));
|
|
|
|
|
static void output_predicate_decls PARAMS ((void));
|
|
|
|
|
static void output_operand_data PARAMS ((void));
|
|
|
|
|
static void output_insn_data PARAMS ((void));
|
|
|
|
|
static void output_get_insn_name PARAMS ((void));
|
|
|
|
|
static void scan_operands PARAMS ((struct data *, rtx, int, int));
|
|
|
|
|
static int compare_operands PARAMS ((struct operand_data *,
|
1999-09-12 14:46:08 +02:00
|
|
|
|
struct operand_data *));
|
2000-01-17 16:17:38 +01:00
|
|
|
|
static void place_operands PARAMS ((struct data *));
|
rtl.h (rtunion_def): Constify member `rtstr'.
* rtl.h (rtunion_def): Constify member `rtstr'.
(emit_line_note_after, emit_line_note, emit_line_note_force,
emit_note, decode_asm_operands): Constify.
* cse.c (canon_hash): Likewise.
* dbxout.c (dbxout_block): Likewise.
* diagnostic.c (file_and_line_for_asm, v_error_for_asm,
v_warning_for_asm): Likewise.
* dwarfout.c (function_start_label): Likewise.
* emit-rtl.c (emit_line_note_after, emit_line_note, emit_note,
emit_line_note_force): Likewise.
* final.c (last_filename, asm_insn_count, final_scan_insn,
output_source_line): Likewise.
* function.h (struct emit_status): Likewise.
* gcse.c (hash_expr_1): Likewise.
* genattr.c (gen_attr, main): Likewise.
* genattrtab.c (struct function_unit, current_alternative_string,
write_attr_valueq, n_comma_elts, next_comma_elt, attr_eq,
attr_numeral, check_attr_test, check_attr_value,
convert_set_attr_alternative, convert_set_attr,
compute_alternative_mask, simplify_by_exploding, gen_attr,
gen_unit): Likewise.
* genflags.c (gen_insn): Likewise.
* gengenrtl.c (type_from_format): Likewise.
* genopinit.c (gen_insn): Likewise.
* genoutput.c (n_occurrences, process_template, process_template):
Likewise.
* ggc-page.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc-simple.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc.h (ggc_mark_string, ggc_mark, ggc_mark_if_gcable,
ggc_set_mark, ggc_get_size): Likewise.
* objc/objc-act.c (build_module_descriptor, finish_objc): Likewise.
* optabs.c (init_one_libfunc): Likewise.
* output.h (assemble_start_function): Likewise.
* recog.c (decode_asm_operands): Likewise.
* toplev.c (rest_of_compilation): Likewise.
* tree.h (emit_line_note_after, emit_line_note,
emit_line_note_force): Likewise.
* varasm.c (asm_output_bss, asm_output_aligned_bss,
asm_emit_uninitialised, assemble_start_function,
assemble_variable, const_hash, compare_constant_1,
find_pool_constant, mark_constant_pool, assemble_alias): Likewise.
* xcoffout.h (DBX_FINISH_SYMBOL): Likewise.
* alpha/alpha.md (call_vms, call_value_vms): Likewise.
* arm/aof.h (ASM_OUTPUT_ASCII): Likewise.
* arm/aout.h (ASM_OUTPUT_ASCII): Likewise.
* arm/arm-protos.h (output_ascii_pseudo_op, arm_dllexport_name_p,
arm_dllimport_name_p): Likewise.
* arm/arm.c (arm_encode_call_attribute, output_ascii_pseudo_op):
Likewise.
* arm/arm.h (ASM_OUTPUT_MI_THUNK): Likewise.
* arm/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/pe.c (arm_dllexport_name_p, arm_dllimport_name_p,
arm_mark_dllexport, arm_mark_dllimport,
arm_pe_encode_section_info): Likewise.
* arm/telf.h (ASM_OUTPUT_DEF_FROM_DECLS,
ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/thumb.c (thumb_function_prologue): Likewise.
* arm/thumb.h (ASM_OUTPUT_ASCII): Likewise.
* avr/avr.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* clipper/clix.h (ASM_OUTPUT_ASCII): Likewise.
* fx80/fx80.h (ASM_OUTPUT_ASCII): Likewise.
* i386/cygwin.h (ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/freebsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/i386-interix.h (ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII, ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/i386-protos.h (asm_output_function_prefix): Likewise.
* i386/i386.c (asm_output_function_prefix): Likewise.
* i386/i386elf.h (ASM_OUTPUT_ASCII): Likewise.
* i386/osfrose.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/ptx4-i.h (ASM_OUTPUT_ASCII): Likewise.
* i386/sco5.h (ASM_FINISH_DECLARE_OBJECT,
ASM_OUTPUT_LIMITED_STRING, ASM_OUTPUT_ASCII,
ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/sysv4.h (ASM_OUTPUT_ASCII): Likewise.
* i860/paragon.h (ASM_OUTPUT_ASCII): Likewise.
* i860/sysv3.h (ASM_OUTPUT_ASCII): Likewise.
* m32r/m32r.c (m32r_encode_section_info): Likewise.
* mcore-elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mcore/mcore.c (mcore_encode_section_info): Likewise.
* mips/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/elf64.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/iris6.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/mips.h (ASM_OUTPUT_IDENT): Likewise.
* mips/mips.md (movdi, movsi): Likewise.
* mips/netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* openbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* ptx4.h (ASM_FINISH_DECLARE_OBJECT, ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII): Likewise.
* rs6000/rs6000.c (rs6000_allocate_stack_space, output_epilog,
output_mi_thunk, output_toc): Likewise.
* rs6000/rs6000.md (movsi): Likewise.
* rs6000/sysv4.h (ASM_OUTPUT_INT, ASM_OUTPUT_SECTION_NAME): Likewise.
* tahoe/harris.h (ASM_OUTPUT_ASCII): Likewise.
* v850/v850.c (print_operand, print_operand_address,
v850_encode_data_area): Likewise.
ch:
* grant.c (globalize_decl): Constify a char*.
cp:
* decl2.c (finish_objects): Constify a char*.
* method.c (emit_thunk): Likewise.
From-SVN: r32388
2000-03-07 21:39:10 +01:00
|
|
|
|
static void process_template PARAMS ((struct data *, const char *));
|
2000-01-17 16:17:38 +01:00
|
|
|
|
static void validate_insn_alternatives PARAMS ((struct data *));
|
2000-11-28 22:31:47 +01:00
|
|
|
|
static void validate_insn_operands PARAMS ((struct data *));
|
2000-05-27 22:01:10 +02:00
|
|
|
|
static void gen_insn PARAMS ((rtx, int));
|
|
|
|
|
static void gen_peephole PARAMS ((rtx, int));
|
|
|
|
|
static void gen_expand PARAMS ((rtx, int));
|
|
|
|
|
static void gen_split PARAMS ((rtx, int));
|
defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
* defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
(EXTRA_ADDRESS_CONSTRAINT): Likewise.
(CONSTRAINT_LEN): Provide default definition.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P): Likewise.
(EXTRA_CONSTRAINT_STR): Likewise.
(REG_CLASS_FROM_CONSTRAINT): Define.
* genoutput.c (check_constraint_len, constraint_len): New functions.
(validate_insn_alternatives): Check CONSTRAINT_LEN for each
constraint / modifier.
(gen_insn): Call check_constraint_len.
* local-alloc.c (block_alloc): Update to use new macros / pass
second argument to EXTRA_{MEMORY,ADDRESS}_CONSTRAINT.
* ra-build.c (handle_asm_insn): Likewise.
* recog.c (asm_operand_ok, preprocess_constraints): Likewise.
(constrain_operands, peep2_find_free_register): Likewise.
* regclass.c (record_operand_costs, record_reg_classes): Likewise.
* regmove.c (find_matches): Likewise.
* reload.c (push_secondary_reload, find_reloads): Likewise.
(alternative_allows_memconst): Likewise.
* reload1.c (maybe_fix_stack_asms): Likewise.
(reload_cse_simplify_operands): Likewise.
* stmt.c (parse_output_constraint, parse_input_constraint): Likewise.
* doc/tm.texi (CONSTRAINT_LEN, REG_CLASS_FROM_CONSTRAINT): Document.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P, EXTRA_CONSTRAINT_STR): Likewise.
(EXTRA_MEMORY_CONSTRAINT, EXTRA_ADDRESS_CONSTRAINT): Add STR argument.
* config/s390/s390.h (EXTRA_MEMORY_CONSTRAINT): Likewise.
From-SVN: r61119
2003-01-09 18:28:49 +01:00
|
|
|
|
static void check_constraint_len PARAMS ((void));
|
|
|
|
|
static int constraint_len PARAMS ((const char *, int));
|
c-lex.c (is_class_name): Delete declaration.
* c-lex.c (is_class_name): Delete declaration.
(whitespace_cr): Make static and add prototype.
* c-lex.h (make_pointer_declarator, reinit_parse_for_function,
yylex, get_directive_line): Turn declarations into prototypes.
(position_after_whitespace, check_newline, yyerror,, is_class_name,
forget_protocol_qualifiers, remember_protocol_qualifiers): Add
prototypes.
* genattr.c (extend_range, write_upcase, gen_attr, write_units): Add
prototypes.
* gencodes.c (gen_insn): Add prototype.
* genconfig.c (walk_insn, gen_insn, gen_expand, gen_split,
gen_peephole): Add prototypes.
* genflags.c (num_operands, gen_proto, gen_nonproto, gen_insn): Add
prototypes.
* gengenrtl.c (type_from_format, accessor_from_format, special_rtx,
special_format, find_formats, gendecl, genmacro, gendef, genlegend,
genheader, gencode): Add prototypes.
* genopinit.c (gen_insn): Add prototype.
* genoutput.c (output_prologue, output_epilogue, scan_operands,
process_template, validate_insn_alternatives, gen_insn, gen_peephole,
gen_expand, gen_split, n_occurrences): Add prototypes.
* genpeep.c (gen_peephole): Add prototype.
* loop.c (find_and_verify_loops, mark_loop_jump, prescan_loop,
reg_in_basic_block_p, consec_sets_invariant_p, libcall_other_reg,
labels_in_range_p, count_loop_regs_set, note_addr_stored,
loop_reg_used_before_p, scan_loop, replace_call_address,
skip_consec_insns, libcall_benefit, ignore_some_movables,
force_movables, combine_movables, rtx_equal_for_loop_p, move_movables,
strength_reduce, valid_initial_value_p, find_mem_givs, record_biv,
check_final_value, record_giv, update_giv_derive, basic_induction_var,
simplify_giv_expr, general_induction_var, consec_sets_giv,
check_dbra_loop, express_from, combine_givs_p, combine_givs,
product_cheap_p, maybe_eliminate_biv, maybe_eliminate_biv_1,
last_use_this_basic_block, record_initial, update_reg_last_use,
iteration_info, analyze_loop_iterations, insert_bct,
instrument_loop_bct, indirect_jump_in_function_p): Turn declarations
into prototypes.
From-SVN: r19038
1998-04-08 01:47:11 +02:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
const char *
|
|
|
|
|
get_insn_name (index)
|
1999-01-19 21:24:22 +01:00
|
|
|
|
int index;
|
|
|
|
|
{
|
|
|
|
|
static char buf[100];
|
|
|
|
|
|
|
|
|
|
struct data *i, *last_named = NULL;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
for (i = idata; i ; i = i->next)
|
1999-01-19 21:24:22 +01:00
|
|
|
|
{
|
|
|
|
|
if (i->index_number == index)
|
|
|
|
|
return i->name;
|
|
|
|
|
if (i->name)
|
|
|
|
|
last_named = i;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (last_named)
|
|
|
|
|
sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
|
|
|
|
|
else
|
|
|
|
|
sprintf(buf, "insn %d", index);
|
|
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
|
}
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
static void
|
|
|
|
|
output_prologue ()
|
|
|
|
|
{
|
|
|
|
|
printf ("/* Generated automatically by the program `genoutput'\n\
|
2000-05-27 22:01:10 +02:00
|
|
|
|
from the machine description file `md'. */\n\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
printf ("#include \"config.h\"\n");
|
1998-04-02 00:44:48 +02:00
|
|
|
|
printf ("#include \"system.h\"\n");
|
2002-12-16 19:23:00 +01:00
|
|
|
|
printf ("#include \"coretypes.h\"\n");
|
|
|
|
|
printf ("#include \"tm.h\"\n");
|
c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* calls.c (expand_call): Remove unused variables funtree,
n_regs, and tmpmode.
* dbxout.c, except.c: Include <string.h>/<strings.h>.
* explow.c: (plus_constant_for_output_wide) Removed unused
variable all_constant.
* c-decl.c, genattr.c, genattrtab.c, getconfig.c, genemit.c
genextract.c, genflags.c, genopinit.c genoutput.c, genpeep.c,
genrecog.c, global.c, integrate.c , stupid.c : Include
<stdlib.h>.
* genextract.c: (walk_rtx) Remove unused variable link.
* genrecog.c: (concat) Remove unreferenced static function.
* prefix.c: Include <string.h>/<strings.h>, <stdlib.h>
* stmt.c: Include <stdlib.h>.
(expand_asm_operands): Remove unused variable val1.
(expand_return): Remove unused variable block.
(pushcase): Remove unused variables l and n.
(pushcaserange): Likewise.
* unroll.c (unroll_loop): Remove unused variable temp.
From-SVN: r17766
1998-02-07 23:55:54 +01:00
|
|
|
|
printf ("#include \"flags.h\"\n");
|
2000-01-27 21:40:24 +01:00
|
|
|
|
printf ("#include \"ggc.h\"\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
printf ("#include \"rtl.h\"\n");
|
2001-04-11 17:57:31 +02:00
|
|
|
|
printf ("#include \"expr.h\"\n");
|
expr.h: Split out optab- and libfunc-related code to...
* expr.h: Split out optab- and libfunc-related code to...
* optabs.h, libfuncs.h: ... these new headers.
* Makefile.in (CONFIG_H, EXPR_H): Take out insn-codes.h.
(OPTABS_H): New.
(various .o rules): Add $(OPTABS_H) and/or libfuncs.h to
dependencies.
* mkconfig.sh: Don't include insn-codes.h from config.h.
* reload.h: Use #ifdef GCC_INSN_CODES_H to decide whether
enum insn_code is available. Move reload_in_optab and
reload_out_optab array declarations to optabs.h.
* regmove.c (gen_add3_insn): Move to optabs.c, export from
there, prototype in expr.h.
* gencodes.c: Cleanup: zap global variables, don't use
printf where puts will do, don't bother defining MAX_INSN_CODE
which nothing uses, let CODE_FOR_nothing get its value implicitly.
* genemit.c, genopinit.c: Include optabs.h in generated file.
* genoutput.c: Include insn-codes.h in generated file.
* builtins.c, caller-save.c, combine.c, doloop.c, explow.c,
expmed.c, expr.c, function.c, ifcvt.c, loop.c, optabs.c, profile.c,
reload1.c, simplify-rtx.c, stmt.c, unroll.c, config/alpha/alpha.c,
config/arm/arm.c, config/c4x/c4x.c, config/clipper/clipper.c,
config/i386/i386.c, config/ia64/ia64.c, config/mn10300/mn10300.c,
config/pj/pj.c, config/sh/sh.c, config/sparc/sparc.c:
Include optabs.h.
* builtins.c, calls.c, dwarf2out.c, except.c, expr.c, function.c,
optabs.c, stmt.c, config/c4x/c4x.c, config/clipper/clipper.c,
config/m88k/m88k.c, config/sparc/sparc.c:
Include libfuncs.h.
* reload.c: Include expr.h and optabs.h before reload.h.
* config/alpha/alpha.c: Include tree.h before reload.h.
* config/pa/pa.c: Include expr.h, optabs.h, libfuncs.h,
and reload.h in that order.
* config/sparc/sparc.c: Include debug.h.
* recog.c: Include insn-codes.h.
cp:
* Make-lang.in (cp/except.o): Add libfuncs.h to dependencies.
* except.c: Include libfuncs.h.
java:
* Make-lang.in (java/decl.o): Update dependencies.
* decl.c: Include libfuncs.h, don't include toplev.h.
From-SVN: r44858
2001-08-13 17:56:51 +02:00
|
|
|
|
printf ("#include \"insn-codes.h\"\n");
|
1999-09-20 12:00:03 +02:00
|
|
|
|
printf ("#include \"tm_p.h\"\n");
|
1999-08-09 16:00:21 +02:00
|
|
|
|
printf ("#include \"function.h\"\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
printf ("#include \"regs.h\"\n");
|
|
|
|
|
printf ("#include \"hard-reg-set.h\"\n");
|
|
|
|
|
printf ("#include \"real.h\"\n");
|
|
|
|
|
printf ("#include \"insn-config.h\"\n\n");
|
|
|
|
|
printf ("#include \"conditions.h\"\n");
|
|
|
|
|
printf ("#include \"insn-attr.h\"\n\n");
|
|
|
|
|
printf ("#include \"recog.h\"\n\n");
|
1999-10-12 05:28:42 +02:00
|
|
|
|
printf ("#include \"toplev.h\"\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
printf ("#include \"output.h\"\n");
|
2002-12-16 19:23:00 +01:00
|
|
|
|
printf ("#include \"target.h\"\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
/* We need to define all predicates used. Keep a list of those we
|
|
|
|
|
have defined so far. There normally aren't very many predicates
|
|
|
|
|
used, so a linked list should be fast enough. */
|
aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
libiberty:
* aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
* configure.in: Replace all alloca logic with a simple use of
the above new macro.
* config.table: Kill *-*-beos* entry.
* config/mh-beos: Delete.
* configure, config.in: Regenerate.
* Makefile.in (ALLOCA, HFILES): Kill.
(REQUIRED_OFILES): Add alloca.o.
(alloca.o): Depend on libiberty.h.
(argv.o): Don't depend on alloca-conf.h.
* alloca-conf.h: Delete.
* alloca.c: Include libiberty.h. Kill all #ifdef emacs
blocks. Provide the C alloca unconditionally. Use PTR where
appropriate. Make i00afunc static.
* argv.c: Don't include alloca-conf.h.
include:
* libiberty.h: Prototype C_alloca; define alloca to either
__builtin_alloca or C_alloca as appropriate.
gcc:
* aclocal.m4 (AM_GNU_GETTEXT): Don't AC_REQUIRE
AC_FUNC_ALLOCA.
* configure, config.in: Regenerate.
* config.gcc: Remove references to deleted files.
* genattr.c, genattrtab.c, genextract.c, genoutput.c,
genrecog.c, rtl.c: Do not use alloca anywhere.
* Makefile.in, build-make, system.h, config/x-interix,
config/x-svr4, config/xm-interix.h, config/xm-openbsd.h,
config/alpha/xm-alpha.h, config/alpha/xm-vms.h,
config/arc/xm-arc.h, config/arm/xm-arm.h,
config/d30v/xm-d30v.h, config/dsp16xx/xm-dsp16xx.h,
config/h8300/xm-h8300.h, config/i370/x-oe,
config/i370/xm-linux.h, config/i386/x-aix, config/i386/x-beos,
config/i386/x-ncr3000, config/i386/x-sco5,
config/i386/xm-dgux.h, config/i860/x-sysv4,
config/i960/xm-i960.h, config/m32r/xm-m32r.h,
config/m68k/x-crds, config/m68k/x-dpx2, config/m68k/x-hp320,
config/m68k/x-hp320g, config/m69k/x-mot3300,
config/m68k/x-mot3300-gas, config/m68k/xm-amix.h,
config/m68k/xm-hp320.h, config/m68k/xm-m68kv.h,
config/m68k/xm-mot3300.h, config/m88k/x-dolph,
config/m88k/x-sysv4, config/m88k/x-tekXD88,
config/m88k/xm-m88k.h, config/mcore/xm-mcore.h,
config/mips/x-iris, config/mips/x-iris3,
config/mips/x-sni-svr4, config/mips/x-sysv,
config/mips/xm-iris6.h, config/mips/xm-mips.h,
config/mips/xm-nws3250v4.h, config/pa/x-hpux,
config/pa/x-pa-mpeix, config/pa/xm-pa.h,
config/pa/xm-pa64hpux.h, config/pa/xm-pahpux.h,
config/pa/xm-papro.h, config/romp/xm-romp.h,
config/rs6000/x-aix31, config/rs6000/x-aix41,
config/rs6000/x-beos, config/rs6000/x-lynx,
config/rs6000/x-mach, config/rs6000/x-rs6000,
config/rs6000/x-sysv4, config/rs6000/xm-rs6000.h,
config/rs6000/xm-sysv4.h, config/sh/xm-sh.h,
config/sparc/x-sysv4, config/sparc/xm-linux.h,
config/sparc/xm-pbd.h, config/sparc/xm-sparc.h,
config/vax/xm-vms.h: Eradicate all references to alloca and
related stuff.
* config/xm-alloca.h, config/clipper/x-clix,
config/i386/xm-sysv4.h, config/i860/x-fx2800,
config/i860/x-sysv3, config/m88k/x-sysv3,
config/sparc/xm-sol2.h, config/we32k/x-we32k: Delete
(contained only alloca related hacks).
* config/i386/xm-beos.h, config/rs6000/xm-beos.h: Just define
USE_C_ALLOCA.
From-SVN: r40259
2001-03-06 10:52:35 +01:00
|
|
|
|
struct predicate { const char *name; struct predicate *next; };
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
static void
|
1999-09-12 14:46:08 +02:00
|
|
|
|
output_predicate_decls ()
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
libiberty:
* aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
* configure.in: Replace all alloca logic with a simple use of
the above new macro.
* config.table: Kill *-*-beos* entry.
* config/mh-beos: Delete.
* configure, config.in: Regenerate.
* Makefile.in (ALLOCA, HFILES): Kill.
(REQUIRED_OFILES): Add alloca.o.
(alloca.o): Depend on libiberty.h.
(argv.o): Don't depend on alloca-conf.h.
* alloca-conf.h: Delete.
* alloca.c: Include libiberty.h. Kill all #ifdef emacs
blocks. Provide the C alloca unconditionally. Use PTR where
appropriate. Make i00afunc static.
* argv.c: Don't include alloca-conf.h.
include:
* libiberty.h: Prototype C_alloca; define alloca to either
__builtin_alloca or C_alloca as appropriate.
gcc:
* aclocal.m4 (AM_GNU_GETTEXT): Don't AC_REQUIRE
AC_FUNC_ALLOCA.
* configure, config.in: Regenerate.
* config.gcc: Remove references to deleted files.
* genattr.c, genattrtab.c, genextract.c, genoutput.c,
genrecog.c, rtl.c: Do not use alloca anywhere.
* Makefile.in, build-make, system.h, config/x-interix,
config/x-svr4, config/xm-interix.h, config/xm-openbsd.h,
config/alpha/xm-alpha.h, config/alpha/xm-vms.h,
config/arc/xm-arc.h, config/arm/xm-arm.h,
config/d30v/xm-d30v.h, config/dsp16xx/xm-dsp16xx.h,
config/h8300/xm-h8300.h, config/i370/x-oe,
config/i370/xm-linux.h, config/i386/x-aix, config/i386/x-beos,
config/i386/x-ncr3000, config/i386/x-sco5,
config/i386/xm-dgux.h, config/i860/x-sysv4,
config/i960/xm-i960.h, config/m32r/xm-m32r.h,
config/m68k/x-crds, config/m68k/x-dpx2, config/m68k/x-hp320,
config/m68k/x-hp320g, config/m69k/x-mot3300,
config/m68k/x-mot3300-gas, config/m68k/xm-amix.h,
config/m68k/xm-hp320.h, config/m68k/xm-m68kv.h,
config/m68k/xm-mot3300.h, config/m88k/x-dolph,
config/m88k/x-sysv4, config/m88k/x-tekXD88,
config/m88k/xm-m88k.h, config/mcore/xm-mcore.h,
config/mips/x-iris, config/mips/x-iris3,
config/mips/x-sni-svr4, config/mips/x-sysv,
config/mips/xm-iris6.h, config/mips/xm-mips.h,
config/mips/xm-nws3250v4.h, config/pa/x-hpux,
config/pa/x-pa-mpeix, config/pa/xm-pa.h,
config/pa/xm-pa64hpux.h, config/pa/xm-pahpux.h,
config/pa/xm-papro.h, config/romp/xm-romp.h,
config/rs6000/x-aix31, config/rs6000/x-aix41,
config/rs6000/x-beos, config/rs6000/x-lynx,
config/rs6000/x-mach, config/rs6000/x-rs6000,
config/rs6000/x-sysv4, config/rs6000/xm-rs6000.h,
config/rs6000/xm-sysv4.h, config/sh/xm-sh.h,
config/sparc/x-sysv4, config/sparc/xm-linux.h,
config/sparc/xm-pbd.h, config/sparc/xm-sparc.h,
config/vax/xm-vms.h: Eradicate all references to alloca and
related stuff.
* config/xm-alloca.h, config/clipper/x-clix,
config/i386/xm-sysv4.h, config/i860/x-fx2800,
config/i860/x-sysv3, config/m88k/x-sysv3,
config/sparc/xm-sol2.h, config/we32k/x-we32k: Delete
(contained only alloca related hacks).
* config/i386/xm-beos.h, config/rs6000/xm-beos.h: Just define
USE_C_ALLOCA.
From-SVN: r40259
2001-03-06 10:52:35 +01:00
|
|
|
|
struct predicate *predicates = 0;
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct operand_data *d;
|
aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
libiberty:
* aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
* configure.in: Replace all alloca logic with a simple use of
the above new macro.
* config.table: Kill *-*-beos* entry.
* config/mh-beos: Delete.
* configure, config.in: Regenerate.
* Makefile.in (ALLOCA, HFILES): Kill.
(REQUIRED_OFILES): Add alloca.o.
(alloca.o): Depend on libiberty.h.
(argv.o): Don't depend on alloca-conf.h.
* alloca-conf.h: Delete.
* alloca.c: Include libiberty.h. Kill all #ifdef emacs
blocks. Provide the C alloca unconditionally. Use PTR where
appropriate. Make i00afunc static.
* argv.c: Don't include alloca-conf.h.
include:
* libiberty.h: Prototype C_alloca; define alloca to either
__builtin_alloca or C_alloca as appropriate.
gcc:
* aclocal.m4 (AM_GNU_GETTEXT): Don't AC_REQUIRE
AC_FUNC_ALLOCA.
* configure, config.in: Regenerate.
* config.gcc: Remove references to deleted files.
* genattr.c, genattrtab.c, genextract.c, genoutput.c,
genrecog.c, rtl.c: Do not use alloca anywhere.
* Makefile.in, build-make, system.h, config/x-interix,
config/x-svr4, config/xm-interix.h, config/xm-openbsd.h,
config/alpha/xm-alpha.h, config/alpha/xm-vms.h,
config/arc/xm-arc.h, config/arm/xm-arm.h,
config/d30v/xm-d30v.h, config/dsp16xx/xm-dsp16xx.h,
config/h8300/xm-h8300.h, config/i370/x-oe,
config/i370/xm-linux.h, config/i386/x-aix, config/i386/x-beos,
config/i386/x-ncr3000, config/i386/x-sco5,
config/i386/xm-dgux.h, config/i860/x-sysv4,
config/i960/xm-i960.h, config/m32r/xm-m32r.h,
config/m68k/x-crds, config/m68k/x-dpx2, config/m68k/x-hp320,
config/m68k/x-hp320g, config/m69k/x-mot3300,
config/m68k/x-mot3300-gas, config/m68k/xm-amix.h,
config/m68k/xm-hp320.h, config/m68k/xm-m68kv.h,
config/m68k/xm-mot3300.h, config/m88k/x-dolph,
config/m88k/x-sysv4, config/m88k/x-tekXD88,
config/m88k/xm-m88k.h, config/mcore/xm-mcore.h,
config/mips/x-iris, config/mips/x-iris3,
config/mips/x-sni-svr4, config/mips/x-sysv,
config/mips/xm-iris6.h, config/mips/xm-mips.h,
config/mips/xm-nws3250v4.h, config/pa/x-hpux,
config/pa/x-pa-mpeix, config/pa/xm-pa.h,
config/pa/xm-pa64hpux.h, config/pa/xm-pahpux.h,
config/pa/xm-papro.h, config/romp/xm-romp.h,
config/rs6000/x-aix31, config/rs6000/x-aix41,
config/rs6000/x-beos, config/rs6000/x-lynx,
config/rs6000/x-mach, config/rs6000/x-rs6000,
config/rs6000/x-sysv4, config/rs6000/xm-rs6000.h,
config/rs6000/xm-sysv4.h, config/sh/xm-sh.h,
config/sparc/x-sysv4, config/sparc/xm-linux.h,
config/sparc/xm-pbd.h, config/sparc/xm-sparc.h,
config/vax/xm-vms.h: Eradicate all references to alloca and
related stuff.
* config/xm-alloca.h, config/clipper/x-clix,
config/i386/xm-sysv4.h, config/i860/x-fx2800,
config/i860/x-sysv3, config/m88k/x-sysv3,
config/sparc/xm-sol2.h, config/we32k/x-we32k: Delete
(contained only alloca related hacks).
* config/i386/xm-beos.h, config/rs6000/xm-beos.h: Just define
USE_C_ALLOCA.
From-SVN: r40259
2001-03-06 10:52:35 +01:00
|
|
|
|
struct predicate *p, *next;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
for (d = odata; d; d = d->next)
|
|
|
|
|
if (d->predicate && d->predicate[0])
|
|
|
|
|
{
|
|
|
|
|
for (p = predicates; p; p = p->next)
|
|
|
|
|
if (strcmp (p->name, d->predicate) == 0)
|
|
|
|
|
break;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (p == 0)
|
|
|
|
|
{
|
2000-01-17 16:17:38 +01:00
|
|
|
|
printf ("extern int %s PARAMS ((rtx, enum machine_mode));\n",
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->predicate);
|
aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
libiberty:
* aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
* configure.in: Replace all alloca logic with a simple use of
the above new macro.
* config.table: Kill *-*-beos* entry.
* config/mh-beos: Delete.
* configure, config.in: Regenerate.
* Makefile.in (ALLOCA, HFILES): Kill.
(REQUIRED_OFILES): Add alloca.o.
(alloca.o): Depend on libiberty.h.
(argv.o): Don't depend on alloca-conf.h.
* alloca-conf.h: Delete.
* alloca.c: Include libiberty.h. Kill all #ifdef emacs
blocks. Provide the C alloca unconditionally. Use PTR where
appropriate. Make i00afunc static.
* argv.c: Don't include alloca-conf.h.
include:
* libiberty.h: Prototype C_alloca; define alloca to either
__builtin_alloca or C_alloca as appropriate.
gcc:
* aclocal.m4 (AM_GNU_GETTEXT): Don't AC_REQUIRE
AC_FUNC_ALLOCA.
* configure, config.in: Regenerate.
* config.gcc: Remove references to deleted files.
* genattr.c, genattrtab.c, genextract.c, genoutput.c,
genrecog.c, rtl.c: Do not use alloca anywhere.
* Makefile.in, build-make, system.h, config/x-interix,
config/x-svr4, config/xm-interix.h, config/xm-openbsd.h,
config/alpha/xm-alpha.h, config/alpha/xm-vms.h,
config/arc/xm-arc.h, config/arm/xm-arm.h,
config/d30v/xm-d30v.h, config/dsp16xx/xm-dsp16xx.h,
config/h8300/xm-h8300.h, config/i370/x-oe,
config/i370/xm-linux.h, config/i386/x-aix, config/i386/x-beos,
config/i386/x-ncr3000, config/i386/x-sco5,
config/i386/xm-dgux.h, config/i860/x-sysv4,
config/i960/xm-i960.h, config/m32r/xm-m32r.h,
config/m68k/x-crds, config/m68k/x-dpx2, config/m68k/x-hp320,
config/m68k/x-hp320g, config/m69k/x-mot3300,
config/m68k/x-mot3300-gas, config/m68k/xm-amix.h,
config/m68k/xm-hp320.h, config/m68k/xm-m68kv.h,
config/m68k/xm-mot3300.h, config/m88k/x-dolph,
config/m88k/x-sysv4, config/m88k/x-tekXD88,
config/m88k/xm-m88k.h, config/mcore/xm-mcore.h,
config/mips/x-iris, config/mips/x-iris3,
config/mips/x-sni-svr4, config/mips/x-sysv,
config/mips/xm-iris6.h, config/mips/xm-mips.h,
config/mips/xm-nws3250v4.h, config/pa/x-hpux,
config/pa/x-pa-mpeix, config/pa/xm-pa.h,
config/pa/xm-pa64hpux.h, config/pa/xm-pahpux.h,
config/pa/xm-papro.h, config/romp/xm-romp.h,
config/rs6000/x-aix31, config/rs6000/x-aix41,
config/rs6000/x-beos, config/rs6000/x-lynx,
config/rs6000/x-mach, config/rs6000/x-rs6000,
config/rs6000/x-sysv4, config/rs6000/xm-rs6000.h,
config/rs6000/xm-sysv4.h, config/sh/xm-sh.h,
config/sparc/x-sysv4, config/sparc/xm-linux.h,
config/sparc/xm-pbd.h, config/sparc/xm-sparc.h,
config/vax/xm-vms.h: Eradicate all references to alloca and
related stuff.
* config/xm-alloca.h, config/clipper/x-clix,
config/i386/xm-sysv4.h, config/i860/x-fx2800,
config/i860/x-sysv3, config/m88k/x-sysv3,
config/sparc/xm-sol2.h, config/we32k/x-we32k: Delete
(contained only alloca related hacks).
* config/i386/xm-beos.h, config/rs6000/xm-beos.h: Just define
USE_C_ALLOCA.
From-SVN: r40259
2001-03-06 10:52:35 +01:00
|
|
|
|
p = (struct predicate *) xmalloc (sizeof (struct predicate));
|
1999-09-12 14:46:08 +02:00
|
|
|
|
p->name = d->predicate;
|
|
|
|
|
p->next = predicates;
|
|
|
|
|
predicates = p;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
printf ("\n\n");
|
aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
libiberty:
* aclocal.m4 (libiberty_AC_FUNC_C_ALLOCA): New.
* configure.in: Replace all alloca logic with a simple use of
the above new macro.
* config.table: Kill *-*-beos* entry.
* config/mh-beos: Delete.
* configure, config.in: Regenerate.
* Makefile.in (ALLOCA, HFILES): Kill.
(REQUIRED_OFILES): Add alloca.o.
(alloca.o): Depend on libiberty.h.
(argv.o): Don't depend on alloca-conf.h.
* alloca-conf.h: Delete.
* alloca.c: Include libiberty.h. Kill all #ifdef emacs
blocks. Provide the C alloca unconditionally. Use PTR where
appropriate. Make i00afunc static.
* argv.c: Don't include alloca-conf.h.
include:
* libiberty.h: Prototype C_alloca; define alloca to either
__builtin_alloca or C_alloca as appropriate.
gcc:
* aclocal.m4 (AM_GNU_GETTEXT): Don't AC_REQUIRE
AC_FUNC_ALLOCA.
* configure, config.in: Regenerate.
* config.gcc: Remove references to deleted files.
* genattr.c, genattrtab.c, genextract.c, genoutput.c,
genrecog.c, rtl.c: Do not use alloca anywhere.
* Makefile.in, build-make, system.h, config/x-interix,
config/x-svr4, config/xm-interix.h, config/xm-openbsd.h,
config/alpha/xm-alpha.h, config/alpha/xm-vms.h,
config/arc/xm-arc.h, config/arm/xm-arm.h,
config/d30v/xm-d30v.h, config/dsp16xx/xm-dsp16xx.h,
config/h8300/xm-h8300.h, config/i370/x-oe,
config/i370/xm-linux.h, config/i386/x-aix, config/i386/x-beos,
config/i386/x-ncr3000, config/i386/x-sco5,
config/i386/xm-dgux.h, config/i860/x-sysv4,
config/i960/xm-i960.h, config/m32r/xm-m32r.h,
config/m68k/x-crds, config/m68k/x-dpx2, config/m68k/x-hp320,
config/m68k/x-hp320g, config/m69k/x-mot3300,
config/m68k/x-mot3300-gas, config/m68k/xm-amix.h,
config/m68k/xm-hp320.h, config/m68k/xm-m68kv.h,
config/m68k/xm-mot3300.h, config/m88k/x-dolph,
config/m88k/x-sysv4, config/m88k/x-tekXD88,
config/m88k/xm-m88k.h, config/mcore/xm-mcore.h,
config/mips/x-iris, config/mips/x-iris3,
config/mips/x-sni-svr4, config/mips/x-sysv,
config/mips/xm-iris6.h, config/mips/xm-mips.h,
config/mips/xm-nws3250v4.h, config/pa/x-hpux,
config/pa/x-pa-mpeix, config/pa/xm-pa.h,
config/pa/xm-pa64hpux.h, config/pa/xm-pahpux.h,
config/pa/xm-papro.h, config/romp/xm-romp.h,
config/rs6000/x-aix31, config/rs6000/x-aix41,
config/rs6000/x-beos, config/rs6000/x-lynx,
config/rs6000/x-mach, config/rs6000/x-rs6000,
config/rs6000/x-sysv4, config/rs6000/xm-rs6000.h,
config/rs6000/xm-sysv4.h, config/sh/xm-sh.h,
config/sparc/x-sysv4, config/sparc/xm-linux.h,
config/sparc/xm-pbd.h, config/sparc/xm-sparc.h,
config/vax/xm-vms.h: Eradicate all references to alloca and
related stuff.
* config/xm-alloca.h, config/clipper/x-clix,
config/i386/xm-sysv4.h, config/i860/x-fx2800,
config/i860/x-sysv3, config/m88k/x-sysv3,
config/sparc/xm-sol2.h, config/we32k/x-we32k: Delete
(contained only alloca related hacks).
* config/i386/xm-beos.h, config/rs6000/xm-beos.h: Just define
USE_C_ALLOCA.
From-SVN: r40259
2001-03-06 10:52:35 +01:00
|
|
|
|
for (p = predicates; p; p = next)
|
|
|
|
|
{
|
|
|
|
|
next = p->next;
|
|
|
|
|
free (p);
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
static void
|
|
|
|
|
output_operand_data ()
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct operand_data *d;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
|
|
|
|
|
|
|
|
|
|
for (d = odata; d; d = d->next)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf (" {\n");
|
|
|
|
|
|
|
|
|
|
printf (" %s,\n",
|
|
|
|
|
d->predicate && d->predicate[0] ? d->predicate : "0");
|
|
|
|
|
|
1999-10-01 12:00:33 +02:00
|
|
|
|
printf (" \"%s\",\n", d->constraint ? d->constraint : "");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf (" %smode,\n", GET_MODE_NAME (d->mode));
|
|
|
|
|
|
1999-10-23 00:02:17 +02:00
|
|
|
|
printf (" %d,\n", d->strict_low);
|
|
|
|
|
|
|
|
|
|
printf (" %d\n", d->eliminable);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
printf(" },\n");
|
|
|
|
|
}
|
|
|
|
|
printf("};\n\n\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
output_insn_data ()
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *d;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
int name_offset = 0;
|
|
|
|
|
int next_name_offset;
|
|
|
|
|
const char * last_name = 0;
|
|
|
|
|
const char * next_name = 0;
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *n;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
|
|
|
|
|
if (n->name)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
next_name = n->name;
|
|
|
|
|
break;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf ("\nconst struct insn_data insn_data[] = \n{\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
for (d = idata; d; d = d->next)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf (" {\n");
|
|
|
|
|
|
|
|
|
|
if (d->name)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf (" \"%s\",\n", d->name);
|
|
|
|
|
name_offset = 0;
|
|
|
|
|
last_name = d->name;
|
|
|
|
|
next_name = 0;
|
|
|
|
|
for (n = d->next, next_name_offset = 1; n;
|
|
|
|
|
n = n->next, next_name_offset++)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (n->name)
|
|
|
|
|
{
|
|
|
|
|
next_name = n->name;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
else
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-12 14:46:08 +02:00
|
|
|
|
name_offset++;
|
|
|
|
|
if (next_name && (last_name == 0
|
|
|
|
|
|| name_offset > next_name_offset / 2))
|
|
|
|
|
printf (" \"%s-%d\",\n", next_name,
|
|
|
|
|
next_name_offset - name_offset);
|
|
|
|
|
else
|
|
|
|
|
printf (" \"%s+%d\",\n", last_name, name_offset);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
switch (d->output_format)
|
|
|
|
|
{
|
|
|
|
|
case INSN_OUTPUT_FORMAT_NONE:
|
|
|
|
|
printf (" 0,\n");
|
|
|
|
|
break;
|
|
|
|
|
case INSN_OUTPUT_FORMAT_SINGLE:
|
2000-09-10 16:01:56 +02:00
|
|
|
|
{
|
|
|
|
|
const char *p = d->template;
|
|
|
|
|
char prev = 0;
|
|
|
|
|
|
|
|
|
|
printf (" \"");
|
|
|
|
|
while (*p)
|
|
|
|
|
{
|
2002-03-11 23:39:35 +01:00
|
|
|
|
if (IS_VSPACE (*p) && prev != '\\')
|
|
|
|
|
{
|
|
|
|
|
/* Preserve two consecutive \n's or \r's, but treat \r\n
|
|
|
|
|
as a single newline. */
|
|
|
|
|
if (*p == '\n' && prev != '\r')
|
|
|
|
|
printf ("\\n\\\n");
|
|
|
|
|
}
|
2000-09-10 16:01:56 +02:00
|
|
|
|
else
|
|
|
|
|
putchar (*p);
|
|
|
|
|
prev = *p;
|
|
|
|
|
++p;
|
|
|
|
|
}
|
|
|
|
|
printf ("\",\n");
|
|
|
|
|
}
|
1999-09-14 06:19:34 +02:00
|
|
|
|
break;
|
|
|
|
|
case INSN_OUTPUT_FORMAT_MULTI:
|
|
|
|
|
case INSN_OUTPUT_FORMAT_FUNCTION:
|
1999-12-12 02:34:39 +01:00
|
|
|
|
printf (" (const PTR) output_%d,\n", d->code_number);
|
1999-09-14 06:19:34 +02:00
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
if (d->name && d->name[0] != '*')
|
2000-02-05 05:56:11 +01:00
|
|
|
|
printf (" (insn_gen_fn) gen_%s,\n", d->name);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
else
|
|
|
|
|
printf (" 0,\n");
|
|
|
|
|
|
|
|
|
|
printf (" &operand_data[%d],\n", d->operand_number);
|
|
|
|
|
printf (" %d,\n", d->n_operands);
|
|
|
|
|
printf (" %d,\n", d->n_dups);
|
1999-09-14 06:19:34 +02:00
|
|
|
|
printf (" %d,\n", d->n_alternatives);
|
|
|
|
|
printf (" %d\n", d->output_format);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
printf(" },\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf ("};\n\n\n");
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
static void
|
|
|
|
|
output_get_insn_name ()
|
|
|
|
|
{
|
|
|
|
|
printf ("const char *\n");
|
|
|
|
|
printf ("get_insn_name (code)\n");
|
|
|
|
|
printf (" int code;\n");
|
|
|
|
|
printf ("{\n");
|
2003-02-07 23:39:49 +01:00
|
|
|
|
printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
|
|
|
|
|
printf (" return \"NOOP_MOVE\";\n");
|
|
|
|
|
printf (" else\n");
|
|
|
|
|
printf (" return insn_data[code].name;\n");
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf ("}\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* Stores in max_opno the largest operand number present in `part', if
|
|
|
|
|
that is larger than the previous value of max_opno, and the rest of
|
|
|
|
|
the operand data into `d->operand[i]'.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
|
|
|
|
|
THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
|
|
|
|
|
|
|
|
|
|
static int max_opno;
|
|
|
|
|
static int num_dups;
|
|
|
|
|
|
|
|
|
|
static void
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, part, this_address_p, this_strict_low)
|
|
|
|
|
struct data *d;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
rtx part;
|
|
|
|
|
int this_address_p;
|
|
|
|
|
int this_strict_low;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int i, j;
|
|
|
|
|
const char *format_ptr;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
int opno;
|
|
|
|
|
|
|
|
|
|
if (part == 0)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
switch (GET_CODE (part))
|
|
|
|
|
{
|
|
|
|
|
case MATCH_OPERAND:
|
|
|
|
|
opno = XINT (part, 0);
|
|
|
|
|
if (opno > max_opno)
|
|
|
|
|
max_opno = opno;
|
|
|
|
|
if (max_opno >= MAX_MAX_OPERANDS)
|
1992-01-08 04:02:44 +01:00
|
|
|
|
{
|
2000-05-27 22:01:10 +02:00
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"maximum number of operands exceeded");
|
|
|
|
|
have_error = 1;
|
1992-01-08 04:02:44 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (d->operand[opno].seen)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"repeated operand number %d\n", opno);
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->operand[opno].seen = 1;
|
|
|
|
|
d->operand[opno].mode = GET_MODE (part);
|
|
|
|
|
d->operand[opno].strict_low = this_strict_low;
|
|
|
|
|
d->operand[opno].predicate = XSTR (part, 1);
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
|
|
|
|
|
d->operand[opno].n_alternatives
|
|
|
|
|
= n_occurrences (',', d->operand[opno].constraint) + 1;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->operand[opno].address_p = this_address_p;
|
1999-10-23 00:02:17 +02:00
|
|
|
|
d->operand[opno].eliminable = 1;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
case MATCH_SCRATCH:
|
|
|
|
|
opno = XINT (part, 0);
|
|
|
|
|
if (opno > max_opno)
|
|
|
|
|
max_opno = opno;
|
|
|
|
|
if (max_opno >= MAX_MAX_OPERANDS)
|
1992-01-08 04:02:44 +01:00
|
|
|
|
{
|
2000-05-27 22:01:10 +02:00
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"maximum number of operands exceeded");
|
|
|
|
|
have_error = 1;
|
1992-01-08 04:02:44 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (d->operand[opno].seen)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"repeated operand number %d\n", opno);
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->operand[opno].seen = 1;
|
|
|
|
|
d->operand[opno].mode = GET_MODE (part);
|
|
|
|
|
d->operand[opno].strict_low = 0;
|
|
|
|
|
d->operand[opno].predicate = "scratch_operand";
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
|
|
|
|
|
d->operand[opno].n_alternatives
|
|
|
|
|
= n_occurrences (',', d->operand[opno].constraint) + 1;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->operand[opno].address_p = 0;
|
1999-10-23 00:02:17 +02:00
|
|
|
|
d->operand[opno].eliminable = 0;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
case MATCH_OPERATOR:
|
|
|
|
|
case MATCH_PARALLEL:
|
|
|
|
|
opno = XINT (part, 0);
|
|
|
|
|
if (opno > max_opno)
|
|
|
|
|
max_opno = opno;
|
|
|
|
|
if (max_opno >= MAX_MAX_OPERANDS)
|
1992-01-08 04:02:44 +01:00
|
|
|
|
{
|
2000-05-27 22:01:10 +02:00
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"maximum number of operands exceeded");
|
|
|
|
|
have_error = 1;
|
1992-01-08 04:02:44 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (d->operand[opno].seen)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"repeated operand number %d\n", opno);
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
d->operand[opno].seen = 1;
|
|
|
|
|
d->operand[opno].mode = GET_MODE (part);
|
|
|
|
|
d->operand[opno].strict_low = 0;
|
|
|
|
|
d->operand[opno].predicate = XSTR (part, 1);
|
|
|
|
|
d->operand[opno].constraint = 0;
|
|
|
|
|
d->operand[opno].address_p = 0;
|
1999-10-23 00:02:17 +02:00
|
|
|
|
d->operand[opno].eliminable = 0;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
for (i = 0; i < XVECLEN (part, 2); i++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (part, 2, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
case MATCH_DUP:
|
|
|
|
|
case MATCH_OP_DUP:
|
1992-08-14 20:43:28 +02:00
|
|
|
|
case MATCH_PAR_DUP:
|
1991-11-05 00:01:28 +01:00
|
|
|
|
++num_dups;
|
2002-03-07 23:03:27 +01:00
|
|
|
|
break;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
case ADDRESS:
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XEXP (part, 0), 1, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
case STRICT_LOW_PART:
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XEXP (part, 0), 0, 1);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return;
|
c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* calls.c (expand_call): Remove unused variables funtree,
n_regs, and tmpmode.
* dbxout.c, except.c: Include <string.h>/<strings.h>.
* explow.c: (plus_constant_for_output_wide) Removed unused
variable all_constant.
* c-decl.c, genattr.c, genattrtab.c, getconfig.c, genemit.c
genextract.c, genflags.c, genopinit.c genoutput.c, genpeep.c,
genrecog.c, global.c, integrate.c , stupid.c : Include
<stdlib.h>.
* genextract.c: (walk_rtx) Remove unused variable link.
* genrecog.c: (concat) Remove unreferenced static function.
* prefix.c: Include <string.h>/<strings.h>, <stdlib.h>
* stmt.c: Include <stdlib.h>.
(expand_asm_operands): Remove unused variable val1.
(expand_return): Remove unused variable block.
(pushcase): Remove unused variables l and n.
(pushcaserange): Likewise.
* unroll.c (unroll_loop): Remove unused variable temp.
From-SVN: r17766
1998-02-07 23:55:54 +01:00
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
break;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
format_ptr = GET_RTX_FORMAT (GET_CODE (part));
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
|
|
|
|
|
switch (*format_ptr++)
|
|
|
|
|
{
|
|
|
|
|
case 'e':
|
c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* calls.c (expand_call): Remove unused variables funtree,
n_regs, and tmpmode.
* dbxout.c, except.c: Include <string.h>/<strings.h>.
* explow.c: (plus_constant_for_output_wide) Removed unused
variable all_constant.
* c-decl.c, genattr.c, genattrtab.c, getconfig.c, genemit.c
genextract.c, genflags.c, genopinit.c genoutput.c, genpeep.c,
genrecog.c, global.c, integrate.c , stupid.c : Include
<stdlib.h>.
* genextract.c: (walk_rtx) Remove unused variable link.
* genrecog.c: (concat) Remove unreferenced static function.
* prefix.c: Include <string.h>/<strings.h>, <stdlib.h>
* stmt.c: Include <stdlib.h>.
(expand_asm_operands): Remove unused variable val1.
(expand_return): Remove unused variable block.
(pushcase): Remove unused variables l and n.
(pushcaserange): Likewise.
* unroll.c (unroll_loop): Remove unused variable temp.
From-SVN: r17766
1998-02-07 23:55:54 +01:00
|
|
|
|
case 'u':
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XEXP (part, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
break;
|
|
|
|
|
case 'E':
|
|
|
|
|
if (XVEC (part, i) != NULL)
|
|
|
|
|
for (j = 0; j < XVECLEN (part, i); j++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (part, i, j), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
/* Compare two operands for content equality. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
compare_operands (d0, d1)
|
|
|
|
|
struct operand_data *d0, *d1;
|
|
|
|
|
{
|
1999-09-15 16:13:50 +02:00
|
|
|
|
const char *p0, *p1;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
p0 = d0->predicate;
|
|
|
|
|
if (!p0)
|
|
|
|
|
p0 = "";
|
|
|
|
|
p1 = d1->predicate;
|
|
|
|
|
if (!p1)
|
|
|
|
|
p1 = "";
|
|
|
|
|
if (strcmp (p0, p1) != 0)
|
|
|
|
|
return 0;
|
|
|
|
|
|
1999-10-01 12:00:33 +02:00
|
|
|
|
p0 = d0->constraint;
|
|
|
|
|
if (!p0)
|
|
|
|
|
p0 = "";
|
|
|
|
|
p1 = d1->constraint;
|
|
|
|
|
if (!p1)
|
|
|
|
|
p1 = "";
|
|
|
|
|
if (strcmp (p0, p1) != 0)
|
|
|
|
|
return 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
if (d0->mode != d1->mode)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
if (d0->strict_low != d1->strict_low)
|
|
|
|
|
return 0;
|
|
|
|
|
|
1999-10-23 00:02:17 +02:00
|
|
|
|
if (d0->eliminable != d1->eliminable)
|
|
|
|
|
return 0;
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Scan the list of operands we've already committed to output and either
|
|
|
|
|
find a subsequence that is the same, or allocate a new one at the end. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
place_operands (d)
|
|
|
|
|
struct data *d;
|
|
|
|
|
{
|
|
|
|
|
struct operand_data *od, *od2;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
if (d->n_operands == 0)
|
|
|
|
|
{
|
|
|
|
|
d->operand_number = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Brute force substring search. */
|
|
|
|
|
for (od = odata, i = 0; od; od = od->next, i = 0)
|
|
|
|
|
if (compare_operands (od, &d->operand[0]))
|
|
|
|
|
{
|
|
|
|
|
od2 = od->next;
|
|
|
|
|
i = 1;
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
|
|
|
|
if (i == d->n_operands)
|
|
|
|
|
goto full_match;
|
|
|
|
|
if (od2 == NULL)
|
|
|
|
|
goto partial_match;
|
|
|
|
|
if (! compare_operands (od2, &d->operand[i]))
|
|
|
|
|
break;
|
|
|
|
|
++i, od2 = od2->next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Either partial match at the end of the list, or no match. In either
|
|
|
|
|
case, we tack on what operands are remaining to the end of the list. */
|
|
|
|
|
partial_match:
|
|
|
|
|
d->operand_number = next_operand_number - i;
|
|
|
|
|
for (; i < d->n_operands; ++i)
|
|
|
|
|
{
|
|
|
|
|
od2 = &d->operand[i];
|
|
|
|
|
*odata_end = od2;
|
|
|
|
|
odata_end = &od2->next;
|
|
|
|
|
od2->index = next_operand_number++;
|
|
|
|
|
}
|
|
|
|
|
*odata_end = NULL;
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
full_match:
|
|
|
|
|
d->operand_number = od->index;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
/* Process an assembler template from a define_insn or a define_peephole.
|
|
|
|
|
It is either the assembler code template, a list of assembler code
|
|
|
|
|
templates, or C code to generate the assembler code template. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
process_template (d, template)
|
|
|
|
|
struct data *d;
|
rtl.h (rtunion_def): Constify member `rtstr'.
* rtl.h (rtunion_def): Constify member `rtstr'.
(emit_line_note_after, emit_line_note, emit_line_note_force,
emit_note, decode_asm_operands): Constify.
* cse.c (canon_hash): Likewise.
* dbxout.c (dbxout_block): Likewise.
* diagnostic.c (file_and_line_for_asm, v_error_for_asm,
v_warning_for_asm): Likewise.
* dwarfout.c (function_start_label): Likewise.
* emit-rtl.c (emit_line_note_after, emit_line_note, emit_note,
emit_line_note_force): Likewise.
* final.c (last_filename, asm_insn_count, final_scan_insn,
output_source_line): Likewise.
* function.h (struct emit_status): Likewise.
* gcse.c (hash_expr_1): Likewise.
* genattr.c (gen_attr, main): Likewise.
* genattrtab.c (struct function_unit, current_alternative_string,
write_attr_valueq, n_comma_elts, next_comma_elt, attr_eq,
attr_numeral, check_attr_test, check_attr_value,
convert_set_attr_alternative, convert_set_attr,
compute_alternative_mask, simplify_by_exploding, gen_attr,
gen_unit): Likewise.
* genflags.c (gen_insn): Likewise.
* gengenrtl.c (type_from_format): Likewise.
* genopinit.c (gen_insn): Likewise.
* genoutput.c (n_occurrences, process_template, process_template):
Likewise.
* ggc-page.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc-simple.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc.h (ggc_mark_string, ggc_mark, ggc_mark_if_gcable,
ggc_set_mark, ggc_get_size): Likewise.
* objc/objc-act.c (build_module_descriptor, finish_objc): Likewise.
* optabs.c (init_one_libfunc): Likewise.
* output.h (assemble_start_function): Likewise.
* recog.c (decode_asm_operands): Likewise.
* toplev.c (rest_of_compilation): Likewise.
* tree.h (emit_line_note_after, emit_line_note,
emit_line_note_force): Likewise.
* varasm.c (asm_output_bss, asm_output_aligned_bss,
asm_emit_uninitialised, assemble_start_function,
assemble_variable, const_hash, compare_constant_1,
find_pool_constant, mark_constant_pool, assemble_alias): Likewise.
* xcoffout.h (DBX_FINISH_SYMBOL): Likewise.
* alpha/alpha.md (call_vms, call_value_vms): Likewise.
* arm/aof.h (ASM_OUTPUT_ASCII): Likewise.
* arm/aout.h (ASM_OUTPUT_ASCII): Likewise.
* arm/arm-protos.h (output_ascii_pseudo_op, arm_dllexport_name_p,
arm_dllimport_name_p): Likewise.
* arm/arm.c (arm_encode_call_attribute, output_ascii_pseudo_op):
Likewise.
* arm/arm.h (ASM_OUTPUT_MI_THUNK): Likewise.
* arm/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/pe.c (arm_dllexport_name_p, arm_dllimport_name_p,
arm_mark_dllexport, arm_mark_dllimport,
arm_pe_encode_section_info): Likewise.
* arm/telf.h (ASM_OUTPUT_DEF_FROM_DECLS,
ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/thumb.c (thumb_function_prologue): Likewise.
* arm/thumb.h (ASM_OUTPUT_ASCII): Likewise.
* avr/avr.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* clipper/clix.h (ASM_OUTPUT_ASCII): Likewise.
* fx80/fx80.h (ASM_OUTPUT_ASCII): Likewise.
* i386/cygwin.h (ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/freebsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/i386-interix.h (ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII, ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/i386-protos.h (asm_output_function_prefix): Likewise.
* i386/i386.c (asm_output_function_prefix): Likewise.
* i386/i386elf.h (ASM_OUTPUT_ASCII): Likewise.
* i386/osfrose.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/ptx4-i.h (ASM_OUTPUT_ASCII): Likewise.
* i386/sco5.h (ASM_FINISH_DECLARE_OBJECT,
ASM_OUTPUT_LIMITED_STRING, ASM_OUTPUT_ASCII,
ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/sysv4.h (ASM_OUTPUT_ASCII): Likewise.
* i860/paragon.h (ASM_OUTPUT_ASCII): Likewise.
* i860/sysv3.h (ASM_OUTPUT_ASCII): Likewise.
* m32r/m32r.c (m32r_encode_section_info): Likewise.
* mcore-elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mcore/mcore.c (mcore_encode_section_info): Likewise.
* mips/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/elf64.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/iris6.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/mips.h (ASM_OUTPUT_IDENT): Likewise.
* mips/mips.md (movdi, movsi): Likewise.
* mips/netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* openbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* ptx4.h (ASM_FINISH_DECLARE_OBJECT, ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII): Likewise.
* rs6000/rs6000.c (rs6000_allocate_stack_space, output_epilog,
output_mi_thunk, output_toc): Likewise.
* rs6000/rs6000.md (movsi): Likewise.
* rs6000/sysv4.h (ASM_OUTPUT_INT, ASM_OUTPUT_SECTION_NAME): Likewise.
* tahoe/harris.h (ASM_OUTPUT_ASCII): Likewise.
* v850/v850.c (print_operand, print_operand_address,
v850_encode_data_area): Likewise.
ch:
* grant.c (globalize_decl): Constify a char*.
cp:
* decl2.c (finish_objects): Constify a char*.
* method.c (emit_thunk): Likewise.
From-SVN: r32388
2000-03-07 21:39:10 +01:00
|
|
|
|
const char *template;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
const char *cp;
|
|
|
|
|
int i;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
/* Templates starting with * contain straight code to be run. */
|
|
|
|
|
if (template[0] == '*')
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->template = 0;
|
|
|
|
|
d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-01-17 16:17:38 +01:00
|
|
|
|
printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->code_number);
|
|
|
|
|
puts ("\nstatic const char *");
|
|
|
|
|
printf ("output_%d (operands, insn)\n", d->code_number);
|
|
|
|
|
puts (" rtx *operands ATTRIBUTE_UNUSED;");
|
|
|
|
|
puts (" rtx insn ATTRIBUTE_UNUSED;");
|
|
|
|
|
puts ("{");
|
|
|
|
|
|
|
|
|
|
puts (template + 1);
|
|
|
|
|
puts ("}");
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
/* If the assembler code template starts with a @ it is a newline-separated
|
1999-09-14 06:19:34 +02:00
|
|
|
|
list of assembler code templates, one for each alternative. */
|
|
|
|
|
else if (template[0] == '@')
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->template = 0;
|
|
|
|
|
d->output_format = INSN_OUTPUT_FORMAT_MULTI;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
for (i = 0, cp = &template[1]; *cp; )
|
|
|
|
|
{
|
2002-03-11 23:39:35 +01:00
|
|
|
|
while (ISSPACE (*cp))
|
1991-11-05 00:01:28 +01:00
|
|
|
|
cp++;
|
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
printf (" \"");
|
2002-03-11 23:39:35 +01:00
|
|
|
|
while (!IS_VSPACE (*cp) && *cp != '\0')
|
1997-07-02 13:47:41 +02:00
|
|
|
|
{
|
|
|
|
|
putchar (*cp);
|
|
|
|
|
cp++;
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
printf ("\",\n");
|
|
|
|
|
i++;
|
|
|
|
|
}
|
2000-12-13 17:26:45 +01:00
|
|
|
|
if (i == 1)
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"'@' is redundant for output template with single alternative");
|
|
|
|
|
if (i != d->n_alternatives)
|
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
c-decl.c (duplicate_decls, [...]): Remove leading capital from diagnostics.
* c-decl.c (duplicate_decls, push_parm_decl): Remove leading
capital from diagnostics.
* c-lex.c (cb_file_change): Similarly.
* c-parse.in : Similarly.
* cfgrtl.c (verify_flow_info): Similarly.
* collect2.c: Similarly.
* cppfiles.c (find_include_file): Similarly.
* cppinit.c (cpp_handle_option): Similarly.
* cpplex.c (cpp_spell_token): Similarly.
* cppmain.c (do_preprocessing): Similarly.
* gcc.c (translate_options, process_command, do_spec1,
main, pfatal_execute): Similarly.
* genattr.c (main): Similarly.
* genattrtab.c (check_attr_test, operate_exp, simplify_test_exp,
write_test_expr, main): Similarly.
* gencodes.c (main): Similarly.
* genconfig.c (main): Similarly.
* genconstants.c (main): Similarly.
* genemit.c (main): Similarly.
* genextract.c (main): Similarly.
* genflags.c (main): Similarly.
* genopinit.c (main): Similarly.
* genoutput.c (process_template, main): Similarly.
* genpeep.c (main): Similarly.
* genrecog.c (main): Similarly.
* gensupport.c (is_predicable, identify_predicable_attribute,
alter_predicate_for_insn, init_md_reader_args, main): Similarly.
* ggc-page.c (alloc_anon): Similarly.
* mips-tfile.c (add_string, add_procedure, add_file, read_line,
parse_begin, parse_bend, parse_def, parse_end, parse_file,
parse_stabs_common, parse_stabs, write_varray, write_object,
read_seek, copy_object, main, error): Similarly.
* profile.c (compute_branch_probabilities): Similarly.
* reg-stack.c (check_asm_stack_operands): Similarly.
* reload.c (find_reloads): Similarly.
* reload1.c (spill_failure, failed_reload): Similarly.
* rtl-error.c (_fatal_insn_not_found): Similarly.
* toplev.c (read_integral_parameter, crash_signal,
decode_f_option, set_target_switch, parse_options_and_default_flags)
: Similarly.
* tradcif.y (parse_number, yylex): Similarly.
* tradcpp.c (main, fancy_abort): Similarly.
* tree.c (tree_check_failed): Similarly.
* varray.c (varray_check_failed): Similarly.
* xcoffout.c (xcoff_output_standard_types): Similarly.
cp:
* call.c (build_java_interface_fn_ref): Similarly.
* except.c (is_admissible_throw_operand): Similarly.
* init.c (build_java_class_ref): Similarly.
* xref.c (open_xref_file): Similarly.
objc:
* objc-act.c (get_object_ref, lookup_and_install_protocols,
build_objc_string_object, objc_declare_alias, build_ivar_chain,
finish_message_expr, build_protocol_expr, is_public,
start_class): Similarly.
testsuite:
* objc.dg/alias.m: Update.
* objc.dg/class-1.m: Update.
* objc.dg/const-str-1.m: Update.
* objc.dg/fwd-proto-1.m: Update.
* objc.dg/id-1.m: Update.
* objc.dg/super-class-1.m: Update.
From-SVN: r47518
2001-12-02 01:04:36 +01:00
|
|
|
|
"wrong number of alternatives in the output template");
|
2000-12-13 17:26:45 +01:00
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-14 06:19:34 +02:00
|
|
|
|
printf ("};\n");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->template = template;
|
|
|
|
|
d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Check insn D for consistency in number of constraint alternatives. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
validate_insn_alternatives (d)
|
|
|
|
|
struct data *d;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int n = 0, start;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
/* Make sure all the operands have the same number of alternatives
|
|
|
|
|
in their constraints. Let N be that number. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
for (start = 0; start < d->n_operands; start++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
if (d->operand[start].n_alternatives > 0)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
* defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
(EXTRA_ADDRESS_CONSTRAINT): Likewise.
(CONSTRAINT_LEN): Provide default definition.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P): Likewise.
(EXTRA_CONSTRAINT_STR): Likewise.
(REG_CLASS_FROM_CONSTRAINT): Define.
* genoutput.c (check_constraint_len, constraint_len): New functions.
(validate_insn_alternatives): Check CONSTRAINT_LEN for each
constraint / modifier.
(gen_insn): Call check_constraint_len.
* local-alloc.c (block_alloc): Update to use new macros / pass
second argument to EXTRA_{MEMORY,ADDRESS}_CONSTRAINT.
* ra-build.c (handle_asm_insn): Likewise.
* recog.c (asm_operand_ok, preprocess_constraints): Likewise.
(constrain_operands, peep2_find_free_register): Likewise.
* regclass.c (record_operand_costs, record_reg_classes): Likewise.
* regmove.c (find_matches): Likewise.
* reload.c (push_secondary_reload, find_reloads): Likewise.
(alternative_allows_memconst): Likewise.
* reload1.c (maybe_fix_stack_asms): Likewise.
(reload_cse_simplify_operands): Likewise.
* stmt.c (parse_output_constraint, parse_input_constraint): Likewise.
* doc/tm.texi (CONSTRAINT_LEN, REG_CLASS_FROM_CONSTRAINT): Document.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P, EXTRA_CONSTRAINT_STR): Likewise.
(EXTRA_MEMORY_CONSTRAINT, EXTRA_ADDRESS_CONSTRAINT): Add STR argument.
* config/s390/s390.h (EXTRA_MEMORY_CONSTRAINT): Likewise.
From-SVN: r61119
2003-01-09 18:28:49 +01:00
|
|
|
|
int len, i;
|
|
|
|
|
const char *p;
|
|
|
|
|
char c;
|
|
|
|
|
int which_alternative = 0;
|
|
|
|
|
int alternative_count_unsure = 0;
|
|
|
|
|
|
|
|
|
|
for (p = d->operand[start].constraint; (c = *p); p += len)
|
|
|
|
|
{
|
|
|
|
|
len = CONSTRAINT_LEN (c, p);
|
|
|
|
|
|
|
|
|
|
if (len < 1 || (len > 1 && strchr (",#*+=&%!0123456789", c)))
|
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"invalid length %d for char '%c' in alternative %d of operand %d",
|
|
|
|
|
len, c, which_alternative, start);
|
|
|
|
|
len = 1;
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (c == ',')
|
|
|
|
|
{
|
|
|
|
|
which_alternative++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 1; i < len; i++)
|
|
|
|
|
if (p[i] == '\0')
|
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"NUL in alternative %d of operand %d",
|
|
|
|
|
which_alternative, start);
|
|
|
|
|
alternative_count_unsure = 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
else if (strchr (",#*", p[i]))
|
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"'%c' in alternative %d of operand %d",
|
|
|
|
|
p[i], which_alternative, start);
|
|
|
|
|
alternative_count_unsure = 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (alternative_count_unsure)
|
|
|
|
|
have_error = 1;
|
|
|
|
|
else if (n == 0)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
n = d->operand[start].n_alternatives;
|
|
|
|
|
else if (n != d->operand[start].n_alternatives)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno,
|
|
|
|
|
"wrong number of alternatives in operand %d",
|
|
|
|
|
start);
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
/* Record the insn's overall number of alternatives. */
|
|
|
|
|
d->n_alternatives = n;
|
|
|
|
|
}
|
2000-11-28 22:31:47 +01:00
|
|
|
|
|
|
|
|
|
/* Verify that there are no gaps in operand numbers for INSNs. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
validate_insn_operands (d)
|
|
|
|
|
struct data *d;
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < d->n_operands; ++i)
|
|
|
|
|
if (d->operand[i].seen == 0)
|
|
|
|
|
{
|
|
|
|
|
message_with_line (d->lineno, "missing operand %d", i);
|
|
|
|
|
have_error = 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* Look at a define_insn just read. Assign its code number. Record
|
|
|
|
|
on idata the template and the number of arguments. If the insn has
|
|
|
|
|
a hairy output action, output a function for now. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
static void
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_insn (insn, lineno)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
rtx insn;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
int lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *d = (struct data *) xmalloc (sizeof (struct data));
|
|
|
|
|
int i;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-05-03 19:45:26 +02:00
|
|
|
|
d->code_number = next_code_number;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->index_number = next_index_number;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
d->lineno = lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
if (XSTR (insn, 0)[0])
|
|
|
|
|
d->name = XSTR (insn, 0);
|
|
|
|
|
else
|
|
|
|
|
d->name = 0;
|
|
|
|
|
|
|
|
|
|
/* Build up the list in the same order as the insns are seen
|
|
|
|
|
in the machine description. */
|
|
|
|
|
d->next = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
*idata_end = d;
|
|
|
|
|
idata_end = &d->next;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
max_opno = -1;
|
|
|
|
|
num_dups = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
memset (d->operand, 0, sizeof (d->operand));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < XVECLEN (insn, 1); i++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
d->n_operands = max_opno + 1;
|
|
|
|
|
d->n_dups = num_dups;
|
|
|
|
|
|
defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
* defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
(EXTRA_ADDRESS_CONSTRAINT): Likewise.
(CONSTRAINT_LEN): Provide default definition.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P): Likewise.
(EXTRA_CONSTRAINT_STR): Likewise.
(REG_CLASS_FROM_CONSTRAINT): Define.
* genoutput.c (check_constraint_len, constraint_len): New functions.
(validate_insn_alternatives): Check CONSTRAINT_LEN for each
constraint / modifier.
(gen_insn): Call check_constraint_len.
* local-alloc.c (block_alloc): Update to use new macros / pass
second argument to EXTRA_{MEMORY,ADDRESS}_CONSTRAINT.
* ra-build.c (handle_asm_insn): Likewise.
* recog.c (asm_operand_ok, preprocess_constraints): Likewise.
(constrain_operands, peep2_find_free_register): Likewise.
* regclass.c (record_operand_costs, record_reg_classes): Likewise.
* regmove.c (find_matches): Likewise.
* reload.c (push_secondary_reload, find_reloads): Likewise.
(alternative_allows_memconst): Likewise.
* reload1.c (maybe_fix_stack_asms): Likewise.
(reload_cse_simplify_operands): Likewise.
* stmt.c (parse_output_constraint, parse_input_constraint): Likewise.
* doc/tm.texi (CONSTRAINT_LEN, REG_CLASS_FROM_CONSTRAINT): Document.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P, EXTRA_CONSTRAINT_STR): Likewise.
(EXTRA_MEMORY_CONSTRAINT, EXTRA_ADDRESS_CONSTRAINT): Add STR argument.
* config/s390/s390.h (EXTRA_MEMORY_CONSTRAINT): Likewise.
From-SVN: r61119
2003-01-09 18:28:49 +01:00
|
|
|
|
check_constraint_len ();
|
2000-11-28 22:31:47 +01:00
|
|
|
|
validate_insn_operands (d);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
validate_insn_alternatives (d);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
place_operands (d);
|
2001-06-30 19:23:53 +02:00
|
|
|
|
process_template (d, XTMPL (insn, 3));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Look at a define_peephole just read. Assign its code number.
|
1999-09-12 14:46:08 +02:00
|
|
|
|
Record on idata the template and the number of arguments.
|
1991-11-05 00:01:28 +01:00
|
|
|
|
If the insn has a hairy output action, output it now. */
|
|
|
|
|
|
|
|
|
|
static void
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_peephole (peep, lineno)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
rtx peep;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
int lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *d = (struct data *) xmalloc (sizeof (struct data));
|
|
|
|
|
int i;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-05-03 19:45:26 +02:00
|
|
|
|
d->code_number = next_code_number;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->index_number = next_index_number;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
d->lineno = lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->name = 0;
|
|
|
|
|
|
|
|
|
|
/* Build up the list in the same order as the insns are seen
|
|
|
|
|
in the machine description. */
|
|
|
|
|
d->next = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
*idata_end = d;
|
|
|
|
|
idata_end = &d->next;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
max_opno = -1;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
num_dups = 0;
|
|
|
|
|
memset (d->operand, 0, sizeof (d->operand));
|
|
|
|
|
|
|
|
|
|
/* Get the number of operands by scanning all the patterns of the
|
|
|
|
|
peephole optimizer. But ignore all the rest of the information
|
|
|
|
|
thus obtained. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
for (i = 0; i < XVECLEN (peep, 0); i++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
d->n_operands = max_opno + 1;
|
|
|
|
|
d->n_dups = 0;
|
|
|
|
|
|
|
|
|
|
validate_insn_alternatives (d);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
place_operands (d);
|
2001-06-30 19:23:53 +02:00
|
|
|
|
process_template (d, XTMPL (peep, 2));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Process a define_expand just read. Assign its code number,
|
|
|
|
|
only for the purposes of `insn_gen_function'. */
|
|
|
|
|
|
|
|
|
|
static void
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_expand (insn, lineno)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
rtx insn;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
int lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *d = (struct data *) xmalloc (sizeof (struct data));
|
|
|
|
|
int i;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-05-03 19:45:26 +02:00
|
|
|
|
d->code_number = next_code_number;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->index_number = next_index_number;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
d->lineno = lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
if (XSTR (insn, 0)[0])
|
|
|
|
|
d->name = XSTR (insn, 0);
|
|
|
|
|
else
|
|
|
|
|
d->name = 0;
|
|
|
|
|
|
|
|
|
|
/* Build up the list in the same order as the insns are seen
|
|
|
|
|
in the machine description. */
|
|
|
|
|
d->next = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
*idata_end = d;
|
|
|
|
|
idata_end = &d->next;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
max_opno = -1;
|
|
|
|
|
num_dups = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
memset (d->operand, 0, sizeof (d->operand));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
/* Scan the operands to get the specified predicates and modes,
|
|
|
|
|
since expand_binop needs to know them. */
|
|
|
|
|
|
|
|
|
|
if (XVEC (insn, 1))
|
|
|
|
|
for (i = 0; i < XVECLEN (insn, 1); i++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
d->n_operands = max_opno + 1;
|
|
|
|
|
d->n_dups = num_dups;
|
|
|
|
|
d->template = 0;
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->output_format = INSN_OUTPUT_FORMAT_NONE;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
validate_insn_alternatives (d);
|
1999-09-12 14:46:08 +02:00
|
|
|
|
place_operands (d);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Process a define_split just read. Assign its code number,
|
|
|
|
|
only for reasons of consistency and to simplify genrecog. */
|
|
|
|
|
|
|
|
|
|
static void
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_split (split, lineno)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
rtx split;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
int lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
struct data *d = (struct data *) xmalloc (sizeof (struct data));
|
|
|
|
|
int i;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2000-05-03 19:45:26 +02:00
|
|
|
|
d->code_number = next_code_number;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->index_number = next_index_number;
|
2000-05-27 22:01:10 +02:00
|
|
|
|
d->lineno = lineno;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->name = 0;
|
|
|
|
|
|
|
|
|
|
/* Build up the list in the same order as the insns are seen
|
|
|
|
|
in the machine description. */
|
|
|
|
|
d->next = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
*idata_end = d;
|
|
|
|
|
idata_end = &d->next;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
max_opno = -1;
|
|
|
|
|
num_dups = 0;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
memset (d->operand, 0, sizeof (d->operand));
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
/* Get the number of operands by scanning all the patterns of the
|
|
|
|
|
split patterns. But ignore all the rest of the information thus
|
|
|
|
|
obtained. */
|
1991-11-05 00:01:28 +01:00
|
|
|
|
for (i = 0; i < XVECLEN (split, 0); i++)
|
1999-09-12 14:46:08 +02:00
|
|
|
|
scan_operands (d, XVECEXP (split, 0, i), 0, 0);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
d->n_operands = max_opno + 1;
|
|
|
|
|
d->n_dups = 0;
|
1992-06-26 13:06:07 +02:00
|
|
|
|
d->n_alternatives = 0;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
d->template = 0;
|
1999-09-14 06:19:34 +02:00
|
|
|
|
d->output_format = INSN_OUTPUT_FORMAT_NONE;
|
1999-09-12 14:46:08 +02:00
|
|
|
|
|
|
|
|
|
place_operands (d);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
2000-01-17 16:17:38 +01:00
|
|
|
|
extern int main PARAMS ((int, char **));
|
1999-09-15 16:13:50 +02:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
int
|
|
|
|
|
main (argc, argv)
|
|
|
|
|
int argc;
|
|
|
|
|
char **argv;
|
|
|
|
|
{
|
|
|
|
|
rtx desc;
|
|
|
|
|
|
2000-05-28 04:17:59 +02:00
|
|
|
|
progname = "genoutput";
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
if (argc <= 1)
|
c-decl.c (duplicate_decls, [...]): Remove leading capital from diagnostics.
* c-decl.c (duplicate_decls, push_parm_decl): Remove leading
capital from diagnostics.
* c-lex.c (cb_file_change): Similarly.
* c-parse.in : Similarly.
* cfgrtl.c (verify_flow_info): Similarly.
* collect2.c: Similarly.
* cppfiles.c (find_include_file): Similarly.
* cppinit.c (cpp_handle_option): Similarly.
* cpplex.c (cpp_spell_token): Similarly.
* cppmain.c (do_preprocessing): Similarly.
* gcc.c (translate_options, process_command, do_spec1,
main, pfatal_execute): Similarly.
* genattr.c (main): Similarly.
* genattrtab.c (check_attr_test, operate_exp, simplify_test_exp,
write_test_expr, main): Similarly.
* gencodes.c (main): Similarly.
* genconfig.c (main): Similarly.
* genconstants.c (main): Similarly.
* genemit.c (main): Similarly.
* genextract.c (main): Similarly.
* genflags.c (main): Similarly.
* genopinit.c (main): Similarly.
* genoutput.c (process_template, main): Similarly.
* genpeep.c (main): Similarly.
* genrecog.c (main): Similarly.
* gensupport.c (is_predicable, identify_predicable_attribute,
alter_predicate_for_insn, init_md_reader_args, main): Similarly.
* ggc-page.c (alloc_anon): Similarly.
* mips-tfile.c (add_string, add_procedure, add_file, read_line,
parse_begin, parse_bend, parse_def, parse_end, parse_file,
parse_stabs_common, parse_stabs, write_varray, write_object,
read_seek, copy_object, main, error): Similarly.
* profile.c (compute_branch_probabilities): Similarly.
* reg-stack.c (check_asm_stack_operands): Similarly.
* reload.c (find_reloads): Similarly.
* reload1.c (spill_failure, failed_reload): Similarly.
* rtl-error.c (_fatal_insn_not_found): Similarly.
* toplev.c (read_integral_parameter, crash_signal,
decode_f_option, set_target_switch, parse_options_and_default_flags)
: Similarly.
* tradcif.y (parse_number, yylex): Similarly.
* tradcpp.c (main, fancy_abort): Similarly.
* tree.c (tree_check_failed): Similarly.
* varray.c (varray_check_failed): Similarly.
* xcoffout.c (xcoff_output_standard_types): Similarly.
cp:
* call.c (build_java_interface_fn_ref): Similarly.
* except.c (is_admissible_throw_operand): Similarly.
* init.c (build_java_class_ref): Similarly.
* xref.c (open_xref_file): Similarly.
objc:
* objc-act.c (get_object_ref, lookup_and_install_protocols,
build_objc_string_object, objc_declare_alias, build_ivar_chain,
finish_message_expr, build_protocol_expr, is_public,
start_class): Similarly.
testsuite:
* objc.dg/alias.m: Update.
* objc.dg/class-1.m: Update.
* objc.dg/const-str-1.m: Update.
* objc.dg/fwd-proto-1.m: Update.
* objc.dg/id-1.m: Update.
* objc.dg/super-class-1.m: Update.
From-SVN: r47518
2001-12-02 01:04:36 +01:00
|
|
|
|
fatal ("no input file name");
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
2001-11-14 21:17:08 +01:00
|
|
|
|
if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
|
2000-05-03 19:45:26 +02:00
|
|
|
|
return (FATAL_EXIT_CODE);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
output_prologue ();
|
|
|
|
|
next_code_number = 0;
|
|
|
|
|
next_index_number = 0;
|
|
|
|
|
|
|
|
|
|
/* Read the machine description. */
|
|
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
2000-05-03 19:45:26 +02:00
|
|
|
|
int line_no;
|
|
|
|
|
|
|
|
|
|
desc = read_md_rtx (&line_no, &next_code_number);
|
|
|
|
|
if (desc == NULL)
|
1991-11-05 00:01:28 +01:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (desc) == DEFINE_INSN)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_insn (desc, line_no);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
if (GET_CODE (desc) == DEFINE_PEEPHOLE)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_peephole (desc, line_no);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
if (GET_CODE (desc) == DEFINE_EXPAND)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_expand (desc, line_no);
|
1999-08-31 22:37:09 +02:00
|
|
|
|
if (GET_CODE (desc) == DEFINE_SPLIT
|
|
|
|
|
|| GET_CODE (desc) == DEFINE_PEEPHOLE2)
|
2000-05-27 22:01:10 +02:00
|
|
|
|
gen_split (desc, line_no);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
next_index_number++;
|
|
|
|
|
}
|
|
|
|
|
|
1999-09-12 14:46:08 +02:00
|
|
|
|
printf("\n\n");
|
|
|
|
|
output_predicate_decls ();
|
|
|
|
|
output_operand_data ();
|
|
|
|
|
output_insn_data ();
|
|
|
|
|
output_get_insn_name ();
|
1991-11-05 00:01:28 +01:00
|
|
|
|
|
|
|
|
|
fflush (stdout);
|
1999-09-15 16:13:50 +02:00
|
|
|
|
return (ferror (stdout) != 0 || have_error
|
1992-12-28 00:30:25 +01:00
|
|
|
|
? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
|
1991-11-05 00:01:28 +01:00
|
|
|
|
}
|
|
|
|
|
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
/* Return the number of occurrences of character C in string S or
|
|
|
|
|
-1 if S is the null string. */
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
static int
|
|
|
|
|
n_occurrences (c, s)
|
1994-09-27 23:30:21 +01:00
|
|
|
|
int c;
|
rtl.h (rtunion_def): Constify member `rtstr'.
* rtl.h (rtunion_def): Constify member `rtstr'.
(emit_line_note_after, emit_line_note, emit_line_note_force,
emit_note, decode_asm_operands): Constify.
* cse.c (canon_hash): Likewise.
* dbxout.c (dbxout_block): Likewise.
* diagnostic.c (file_and_line_for_asm, v_error_for_asm,
v_warning_for_asm): Likewise.
* dwarfout.c (function_start_label): Likewise.
* emit-rtl.c (emit_line_note_after, emit_line_note, emit_note,
emit_line_note_force): Likewise.
* final.c (last_filename, asm_insn_count, final_scan_insn,
output_source_line): Likewise.
* function.h (struct emit_status): Likewise.
* gcse.c (hash_expr_1): Likewise.
* genattr.c (gen_attr, main): Likewise.
* genattrtab.c (struct function_unit, current_alternative_string,
write_attr_valueq, n_comma_elts, next_comma_elt, attr_eq,
attr_numeral, check_attr_test, check_attr_value,
convert_set_attr_alternative, convert_set_attr,
compute_alternative_mask, simplify_by_exploding, gen_attr,
gen_unit): Likewise.
* genflags.c (gen_insn): Likewise.
* gengenrtl.c (type_from_format): Likewise.
* genopinit.c (gen_insn): Likewise.
* genoutput.c (n_occurrences, process_template, process_template):
Likewise.
* ggc-page.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc-simple.c (ggc_set_mark, ggc_mark_if_gcable, ggc_get_size):
Likewise.
* ggc.h (ggc_mark_string, ggc_mark, ggc_mark_if_gcable,
ggc_set_mark, ggc_get_size): Likewise.
* objc/objc-act.c (build_module_descriptor, finish_objc): Likewise.
* optabs.c (init_one_libfunc): Likewise.
* output.h (assemble_start_function): Likewise.
* recog.c (decode_asm_operands): Likewise.
* toplev.c (rest_of_compilation): Likewise.
* tree.h (emit_line_note_after, emit_line_note,
emit_line_note_force): Likewise.
* varasm.c (asm_output_bss, asm_output_aligned_bss,
asm_emit_uninitialised, assemble_start_function,
assemble_variable, const_hash, compare_constant_1,
find_pool_constant, mark_constant_pool, assemble_alias): Likewise.
* xcoffout.h (DBX_FINISH_SYMBOL): Likewise.
* alpha/alpha.md (call_vms, call_value_vms): Likewise.
* arm/aof.h (ASM_OUTPUT_ASCII): Likewise.
* arm/aout.h (ASM_OUTPUT_ASCII): Likewise.
* arm/arm-protos.h (output_ascii_pseudo_op, arm_dllexport_name_p,
arm_dllimport_name_p): Likewise.
* arm/arm.c (arm_encode_call_attribute, output_ascii_pseudo_op):
Likewise.
* arm/arm.h (ASM_OUTPUT_MI_THUNK): Likewise.
* arm/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/pe.c (arm_dllexport_name_p, arm_dllimport_name_p,
arm_mark_dllexport, arm_mark_dllimport,
arm_pe_encode_section_info): Likewise.
* arm/telf.h (ASM_OUTPUT_DEF_FROM_DECLS,
ASM_FINISH_DECLARE_OBJECT): Likewise.
* arm/thumb.c (thumb_function_prologue): Likewise.
* arm/thumb.h (ASM_OUTPUT_ASCII): Likewise.
* avr/avr.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* clipper/clix.h (ASM_OUTPUT_ASCII): Likewise.
* fx80/fx80.h (ASM_OUTPUT_ASCII): Likewise.
* i386/cygwin.h (ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/freebsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/i386-interix.h (ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII, ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/i386-protos.h (asm_output_function_prefix): Likewise.
* i386/i386.c (asm_output_function_prefix): Likewise.
* i386/i386elf.h (ASM_OUTPUT_ASCII): Likewise.
* i386/osfrose.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* i386/ptx4-i.h (ASM_OUTPUT_ASCII): Likewise.
* i386/sco5.h (ASM_FINISH_DECLARE_OBJECT,
ASM_OUTPUT_LIMITED_STRING, ASM_OUTPUT_ASCII,
ASM_OUTPUT_SECTION_NAME): Likewise.
* i386/sysv4.h (ASM_OUTPUT_ASCII): Likewise.
* i860/paragon.h (ASM_OUTPUT_ASCII): Likewise.
* i860/sysv3.h (ASM_OUTPUT_ASCII): Likewise.
* m32r/m32r.c (m32r_encode_section_info): Likewise.
* mcore-elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mcore/mcore.c (mcore_encode_section_info): Likewise.
* mips/elf.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/elf64.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/iris6.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* mips/mips.h (ASM_OUTPUT_IDENT): Likewise.
* mips/mips.md (movdi, movsi): Likewise.
* mips/netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* netbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* openbsd.h (ASM_FINISH_DECLARE_OBJECT): Likewise.
* ptx4.h (ASM_FINISH_DECLARE_OBJECT, ASM_OUTPUT_LIMITED_STRING,
ASM_OUTPUT_ASCII): Likewise.
* rs6000/rs6000.c (rs6000_allocate_stack_space, output_epilog,
output_mi_thunk, output_toc): Likewise.
* rs6000/rs6000.md (movsi): Likewise.
* rs6000/sysv4.h (ASM_OUTPUT_INT, ASM_OUTPUT_SECTION_NAME): Likewise.
* tahoe/harris.h (ASM_OUTPUT_ASCII): Likewise.
* v850/v850.c (print_operand, print_operand_address,
v850_encode_data_area): Likewise.
ch:
* grant.c (globalize_decl): Constify a char*.
cp:
* decl2.c (finish_objects): Constify a char*.
* method.c (emit_thunk): Likewise.
From-SVN: r32388
2000-03-07 21:39:10 +01:00
|
|
|
|
const char *s;
|
1991-11-05 00:01:28 +01:00
|
|
|
|
{
|
|
|
|
|
int n = 0;
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
|
|
|
|
|
if (s == 0 || *s == '\0')
|
|
|
|
|
return -1;
|
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
while (*s)
|
|
|
|
|
n += (*s++ == c);
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
|
1991-11-05 00:01:28 +01:00
|
|
|
|
return n;
|
|
|
|
|
}
|
2000-02-16 15:44:19 +01:00
|
|
|
|
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
/* Remove whitespace in `s' by moving up characters until the end.
|
|
|
|
|
Return a new string. */
|
|
|
|
|
|
|
|
|
|
static const char *
|
2000-02-16 15:44:19 +01:00
|
|
|
|
strip_whitespace (s)
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
const char *s;
|
2000-02-16 15:44:19 +01:00
|
|
|
|
{
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
char *p, *q;
|
|
|
|
|
char ch;
|
|
|
|
|
|
|
|
|
|
if (s == 0)
|
|
|
|
|
return 0;
|
2000-02-16 15:44:19 +01:00
|
|
|
|
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
p = q = xmalloc (strlen (s) + 1);
|
2000-02-16 15:44:19 +01:00
|
|
|
|
while ((ch = *s++) != '\0')
|
|
|
|
|
if (! ISSPACE (ch))
|
|
|
|
|
*p++ = ch;
|
|
|
|
|
|
|
|
|
|
*p = '\0';
|
* Clean up usages of TREE_INT_CST_LOW.
* c-parse.in (RESTORE_WARN_FLAGS): Use tree_low_cst.
* c-parse.y, c-parse.c, objc/objc-parse.y, objc/objc-parse.c:
Regenerated.
* c-tree.h (min_precision): Move declaration to here.
* c-typeck.c (build_binary_op): Use host_integerp and tree_low_cst.
(build_unary_op, add_pending_init): Use bit_position.
(pending_init_member, process_init_element): Likewise.
(really_start_incremental_init, push_init_level, pop_init_level):
Don't make copies of nodes or modify them in place, use consistent
types when tracking positions, and use tree routines computations.
(set_init_index, output_init_element): Likewise.
(output_pending_init_elements, process_init_element): Likewise.
* dbxout.c (dbxout_type_fields): Use bit_position, host_integerp,
tree_low_cst and int_bit_position; also minor cleanup.
(dbxout_type_method_1, dbxout_range_type, dbxout_type): Likewise.
(print_cst_octal): Precision is unsigned.
(dbxout_symbol): Ensure DECL_INITIAL is in-range and use tree_low_cst.
* dwarf2out.c (ceiling): Input and output are unsigned HOST_WIDE_INT.
(simple_type_align_in_bits): Result is unsigned int.
Use tree_int_low_cst and host_integerp.
(simple_type_size_in_bits): Result is unsigned HOST_WIDE_INT.
(field_byte_offset): Result is HOST_WIDE_INT.
Change types of internal variables so alignments are unsigned int,
offsets are HOST_WIDE_INT and sizes are unsigned HOST_WIDE_INT.
Use host_integerp, tree_low_cst, and int_bit_position.
(add_bit_offset_attribute): Likewise.
(add_data_member_location_attribute): Use tree_cst_low.
(add_bound_info): Use host_integerp, integer_zerop, and integer_onep.
(add_bit_size_attribute): Use tree_low_cst.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
(sdbout_field_types, sdbout_one_type): Likewise; also use bit_position.
* ssa.c (rename_registers): Add missing cast of arg to bzero.
* tree.c (int_size_in_bytes): Check for too big to represent.
(bit_position, int_bit_position, host_integerp, tree_low_cst): New fns.
* tree.h (host_integerp, tree_low_cst, bit_position, int_bit_position):
New declarations.
(min_precision): Delete from here.
* varasm.c (decode_addr_const): Use host_integerp, bit_position,
and int_bit_position.
* objc/objc-act.c (encode_method_prototype): Sizes are HOST_WIDE_INT.
(encode_method_def): Likewise.
(build_ivar_list_initializer): Use int_bit_position.
(generate_shared_structures): Convert size.
(encode_type, encode_complete_bitfield): Use integer_zerop.
(encode_bitfield): Use tree_low_cst and int_bit_position.
* ch/typeck.c (min_precision): New function.
(build_chill_slice): Use host_integerp and tree_low_cst.
(expand_constant_to_buffer): Likewise and also int_bit_position.
LO is unsigned HOST_WIDE_INT
(build_chill_array_ref_1): Make `i' be HOST_WIDE_INT; use tree_low_cst.
(extract_constant_from_buffer): Sizes are now HOST_WIDE_INT.
Use host_integerp and tree_low_cst.
(build_chill_bin_type): Use host_integerp and tree_low_cst.
(layout_chill_range_type): Use tree_int_cst_sgn, compare_tree_int,
tree_low_cst, and min_precision.
(apply_chill_array_layout): Cleanups for types of variables
and use tree_int_cst_sgn, compare_tree_int, and tree_low_cst.
(apply_chill_field_layout): Likewise.
* cp/class.c (build_vbase_path): Use integer_zerop.
(build_vtable_entry): Use tree_low_cst.
(get_vfield_offset): Use bit_position.
(dfs_modify_vtables): New variable vindex_val; `i' is HOST_WIDE_INT.
Use tree_low_cst.
(check_bitfield_decl): Set DECL_SIZE using convert.
(build_base_field): Set DECL_SIZE and DECL_SIZE_UNIT using size_binop.
(layout_virtual_bases): DSIZE is unsigned HOST_WIDE_INT.
Use tree_low_cst.
(finish_struct_1): Use bit_position.
(dump_class_hierarchy): Use tree_low_cst.
* cp/cp-tree.h (min_precision): Add declaration.
* cp/decl.c (xref_tag, xref_basetypes): Use tree_low_cst.
* cp/error.c (dump_type_suffix): Use host_integerp and tree_low_cst.
(dump_expr): Use integer_zerop, host_integerp, and tree_low_cst.
* cp/expr.c (cplus_expand_constant): Use bit_position.
* cp/init.c (build_vec_init): Use host_integerp and tree_low_cst.
* cp/rtti.c (get_base_offset): Use bit_position.
* cp/typeck.c (build_binary_op): Use integer_zerop, compare_tree_int,
host_integerp, and tree_low_cst.
(pointer_int_sum): Use integer_zerop.
(build_component_addr): Use bit_position.
* java/class.c (make_field_value): Properly handle sizes.
(get_dispatch_vector): Use tree_low_cst and host_integerp.
(layout_class_method): Count using trees.
* java/decl.c (push_promoted_type): Set TYPE_{MIN,MAX}_VALUE with
copy_node.
* java/expr.c (java_array_data_offset): Use int_bit_position.
(build_newarray, build_anewarray): Use host_integerp and tree_low_cst.
(build_invokevirtual): Use tree_low_cst and do computations with trees.
From-SVN: r32607
2000-03-17 18:31:58 +01:00
|
|
|
|
return q;
|
2000-02-16 15:44:19 +01:00
|
|
|
|
}
|
defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
* defaults.h (EXTRA_MEMORY_CONSTRAINT): Add STR argument.
(EXTRA_ADDRESS_CONSTRAINT): Likewise.
(CONSTRAINT_LEN): Provide default definition.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P): Likewise.
(EXTRA_CONSTRAINT_STR): Likewise.
(REG_CLASS_FROM_CONSTRAINT): Define.
* genoutput.c (check_constraint_len, constraint_len): New functions.
(validate_insn_alternatives): Check CONSTRAINT_LEN for each
constraint / modifier.
(gen_insn): Call check_constraint_len.
* local-alloc.c (block_alloc): Update to use new macros / pass
second argument to EXTRA_{MEMORY,ADDRESS}_CONSTRAINT.
* ra-build.c (handle_asm_insn): Likewise.
* recog.c (asm_operand_ok, preprocess_constraints): Likewise.
(constrain_operands, peep2_find_free_register): Likewise.
* regclass.c (record_operand_costs, record_reg_classes): Likewise.
* regmove.c (find_matches): Likewise.
* reload.c (push_secondary_reload, find_reloads): Likewise.
(alternative_allows_memconst): Likewise.
* reload1.c (maybe_fix_stack_asms): Likewise.
(reload_cse_simplify_operands): Likewise.
* stmt.c (parse_output_constraint, parse_input_constraint): Likewise.
* doc/tm.texi (CONSTRAINT_LEN, REG_CLASS_FROM_CONSTRAINT): Document.
(CONST_OK_FOR_CONSTRAINT_P): Likewise.
(CONST_DOUBLE_OK_FOR_CONSTRAINT_P, EXTRA_CONSTRAINT_STR): Likewise.
(EXTRA_MEMORY_CONSTRAINT, EXTRA_ADDRESS_CONSTRAINT): Add STR argument.
* config/s390/s390.h (EXTRA_MEMORY_CONSTRAINT): Likewise.
From-SVN: r61119
2003-01-09 18:28:49 +01:00
|
|
|
|
|
|
|
|
|
/* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
|
|
|
|
|
tampered with. This isn't bullet-proof, but it should catch
|
|
|
|
|
most genuine mistakes. */
|
|
|
|
|
static void
|
|
|
|
|
check_constraint_len ()
|
|
|
|
|
{
|
|
|
|
|
const char *p;
|
|
|
|
|
int d;
|
|
|
|
|
|
|
|
|
|
for (p = ",#*+=&%!1234567890"; *p; p++)
|
|
|
|
|
for (d = -9; d < 9; d++)
|
|
|
|
|
if (constraint_len (p, d) != d)
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
constraint_len (p, genoutput_default_constraint_len)
|
|
|
|
|
const char *p;
|
|
|
|
|
int genoutput_default_constraint_len;
|
|
|
|
|
{
|
|
|
|
|
/* Check that we still match defaults.h . First we do a generation-time
|
|
|
|
|
check that fails if the value is not the expected one... */
|
|
|
|
|
if (DEFAULT_CONSTRAINT_LEN (*p, p) != 1)
|
|
|
|
|
abort ();
|
|
|
|
|
/* And now a comile-time check that should give a diagnostic if the
|
|
|
|
|
definition doesn't exactly match. */
|
|
|
|
|
#define DEFAULT_CONSTRAINT_LEN(C,STR) 1
|
|
|
|
|
/* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
|
|
|
|
|
being used. */
|
|
|
|
|
#undef DEFAULT_CONSTRAINT_LEN
|
|
|
|
|
#define DEFAULT_CONSTRAINT_LEN(C,STR) \
|
|
|
|
|
((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
|
|
|
|
|
return CONSTRAINT_LEN (*p, p);
|
|
|
|
|
/* And set it back. */
|
|
|
|
|
#undef DEFAULT_CONSTRAINT_LEN
|
|
|
|
|
#define DEFAULT_CONSTRAINT_LEN(C,STR) 1
|
|
|
|
|
}
|