1992-11-13 02:55:58 +01:00
|
|
|
|
/* This file contains the definitions and documentation for the
|
convert.c, [...]: Replace overly specific references to "GNU C" and "GNU C Compiler" with...
* convert.c, dwarf2out.c, dwarfout.c, emit-rtl.c, function.c,
lists.c, print-rtl.c, print-tree.c, read-rtl.c, rtl-error.c,
stmt.c, toplev.c, integrate.h, loop.h, machmode.h, rtl.h,
ssa.h, tree.def: Replace overly specific references to "GNU C"
and "GNU C Compiler" with references to "GCC".
From-SVN: r68004
2003-06-16 13:30:25 +02:00
|
|
|
|
tree codes used in GCC.
|
2004-01-16 08:20:38 +01:00
|
|
|
|
Copyright (C) 1987, 1988, 1993, 1995, 1997, 1998, 2000, 2001, 2004
|
2001-06-04 15:21:38 +02:00
|
|
|
|
Free Software Foundation, Inc.
|
1992-11-13 02:55:58 +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.
|
1992-11-13 02:55:58 +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.
|
1992-11-13 02:55:58 +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.
|
1992-11-13 02:55:58 +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. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* The third argument can be:
|
1997-12-12 10:00:19 +01:00
|
|
|
|
'x' for an exceptional code (fits no category).
|
|
|
|
|
't' for a type object code.
|
|
|
|
|
'c' for codes for constants.
|
|
|
|
|
'd' for codes for declarations (also serving as variable refs).
|
|
|
|
|
'r' for codes for references to storage.
|
|
|
|
|
'<' for codes for comparison expressions.
|
|
|
|
|
'1' for codes for unary arithmetic expressions.
|
|
|
|
|
'2' for codes for binary arithmetic expressions.
|
2003-05-13 18:56:00 +02:00
|
|
|
|
's' for codes for "statement" expressions, which have side-effects,
|
|
|
|
|
but usually no interesting value.
|
1997-12-12 10:00:19 +01:00
|
|
|
|
'e' for codes for other kinds of expressions. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
/* For `r', `e', `<', `1', `2', and `s' nodes, which use struct
|
|
|
|
|
tree_exp, the 4th element is the number of argument slots to
|
|
|
|
|
allocate. This determines the size of the tree node object.
|
|
|
|
|
Other nodes use different structures, and the size is determined
|
|
|
|
|
by the tree_union member structure; the 4th element should be
|
|
|
|
|
zero. Languages that define language-specific 'x' or 'c' codes
|
|
|
|
|
must define the tree_size langhook to say how big they are. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Any erroneous construct is parsed into a node of this type.
|
|
|
|
|
This type of node is accepted without complaint in all contexts
|
|
|
|
|
by later parsing activities, to avoid multiple error messages
|
|
|
|
|
for one error.
|
|
|
|
|
No fields in these nodes are used except the TREE_CODE. */
|
1997-12-12 10:00:19 +01:00
|
|
|
|
DEFTREECODE (ERROR_MARK, "error_mark", 'x', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Used to represent a name (such as, in the DECL_NAME of a decl node).
|
|
|
|
|
Internally it looks like a STRING_CST node.
|
|
|
|
|
There is only one IDENTIFIER_NODE ever made for any particular name.
|
|
|
|
|
Use `get_identifier' to get it (or create it, the first time). */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (IDENTIFIER_NODE, "identifier_node", 'x', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Has the TREE_VALUE and TREE_PURPOSE fields. */
|
|
|
|
|
/* These nodes are made into lists by chaining through the
|
|
|
|
|
TREE_CHAIN field. The elements of the list live in the
|
|
|
|
|
TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
|
|
|
|
|
used as well to get the effect of Lisp association lists. */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (TREE_LIST, "tree_list", 'x', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* These nodes contain an array of tree nodes. */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (TREE_VEC, "tree_vec", 'x', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* A symbol binding block. These are arranged in a tree,
|
|
|
|
|
where the BLOCK_SUBBLOCKS field contains a chain of subblocks
|
|
|
|
|
chained through the BLOCK_CHAIN field.
|
|
|
|
|
BLOCK_SUPERCONTEXT points to the parent block.
|
|
|
|
|
For a block which represents the outermost scope of a function, it
|
|
|
|
|
points to the FUNCTION_DECL node.
|
|
|
|
|
BLOCK_VARS points to a chain of decl nodes.
|
|
|
|
|
BLOCK_TYPE_TAGS points to a chain of types which have their own names.
|
|
|
|
|
BLOCK_CHAIN points to the next BLOCK at the same level.
|
|
|
|
|
BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
|
|
|
|
|
this block is an instance of, or else is NULL to indicate that this
|
|
|
|
|
block is not an instance of anything else. When non-NULL, the value
|
|
|
|
|
could either point to another BLOCK node or it could point to a
|
|
|
|
|
FUNCTION_DECL node (e.g. in the case of a block representing the
|
|
|
|
|
outermost scope of a particular inlining of a function).
|
2002-09-27 14:48:07 +02:00
|
|
|
|
BLOCK_ABSTRACT is nonzero if the block represents an abstract
|
1992-11-13 02:55:58 +01:00
|
|
|
|
instance of a block (i.e. one which is nested within an abstract
|
2000-02-28 10:51:42 +01:00
|
|
|
|
instance of an inline function).
|
2002-09-27 14:48:07 +02:00
|
|
|
|
TREE_ASM_WRITTEN is nonzero if the block was actually referenced
|
2000-02-28 10:51:42 +01:00
|
|
|
|
in the generated assembly. */
|
2004-05-14 04:33:00 +02:00
|
|
|
|
DEFTREECODE (BLOCK, "block", 'x', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Each data type is represented by a tree node whose code is one of
|
|
|
|
|
the following: */
|
|
|
|
|
/* Each node that represents a data type has a component TYPE_SIZE
|
|
|
|
|
containing a tree that is an expression for the size in bits.
|
|
|
|
|
The TYPE_MODE contains the machine mode for values of this type.
|
|
|
|
|
The TYPE_POINTER_TO field contains a type for a pointer to this type,
|
|
|
|
|
or zero if no such has been created yet.
|
|
|
|
|
The TYPE_NEXT_VARIANT field is used to chain together types
|
|
|
|
|
that are variants made by type modifiers such as "const" and "volatile".
|
|
|
|
|
The TYPE_MAIN_VARIANT field, in any member of such a chain,
|
|
|
|
|
points to the start of the chain.
|
|
|
|
|
The TYPE_NONCOPIED_PARTS field is a list specifying which parts
|
|
|
|
|
of an object of this type should *not* be copied by assignment.
|
1999-05-17 09:21:14 +02:00
|
|
|
|
The TREE_VALUE of each is a FIELD_DECL that should not be
|
|
|
|
|
copied. The TREE_PURPOSE is an initial value for that field when
|
|
|
|
|
an object of this type is initialized via an INIT_EXPR. It may
|
|
|
|
|
be NULL if no special value is required. Even the things in this
|
|
|
|
|
list are copied if the right-hand side of an assignment is known
|
|
|
|
|
to be a complete object (rather than being, perhaps, a subobject
|
|
|
|
|
of some other object.) The determination of what constitutes a
|
|
|
|
|
complete object is done by fixed_type_p.
|
1992-11-13 02:55:58 +01:00
|
|
|
|
The TYPE_NAME field contains info on the name used in the program
|
|
|
|
|
for this type (for GDB symbol table output). It is either a
|
|
|
|
|
TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
|
|
|
|
|
in the case of structs, unions or enums that are known with a tag,
|
|
|
|
|
or zero for types that have no special name.
|
|
|
|
|
The TYPE_CONTEXT for any sort of type which could have a name or
|
|
|
|
|
which could have named members (e.g. tagged types in C/C++) will
|
|
|
|
|
point to the node which represents the scope of the given type, or
|
|
|
|
|
will be NULL_TREE if the type has "file scope". For most types, this
|
|
|
|
|
will point to a BLOCK node or a FUNCTION_DECL node, but it could also
|
|
|
|
|
point to a FUNCTION_TYPE node (for types whose scope is limited to the
|
|
|
|
|
formal parameter list of some function type specification) or it
|
1993-04-13 12:34:08 +02:00
|
|
|
|
could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node
|
|
|
|
|
(for C++ "member" types).
|
1992-11-13 02:55:58 +01:00
|
|
|
|
For non-tagged-types, TYPE_CONTEXT need not be set to anything in
|
|
|
|
|
particular, since any type which is of some type category (e.g.
|
|
|
|
|
an array type or a function type) which cannot either have a name
|
1993-04-13 12:34:08 +02:00
|
|
|
|
itself or have named members doesn't really have a "scope" per se.
|
|
|
|
|
The TREE_CHAIN field is used as a forward-references to names for
|
|
|
|
|
ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes;
|
|
|
|
|
see below. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (VOID_TYPE, "void_type", 't', 0) /* The void type in C */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1993-03-03 07:46:43 +01:00
|
|
|
|
/* Integer types in all languages, including char in C.
|
|
|
|
|
Also used for sub-ranges of other discrete types.
|
|
|
|
|
Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
and TYPE_PRECISION (number of bits used by this type).
|
|
|
|
|
In the case of a subrange type in Pascal, the TREE_TYPE
|
1993-03-03 07:46:43 +01:00
|
|
|
|
of this will point at the supertype (another INTEGER_TYPE,
|
|
|
|
|
or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_TYPE).
|
1992-11-13 02:55:58 +01:00
|
|
|
|
Otherwise, the TREE_TYPE is zero. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (INTEGER_TYPE, "integer_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* C's float and double. Different floating types are distinguished
|
|
|
|
|
by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (REAL_TYPE, "real_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Complex number types. The TREE_TYPE field is the data type
|
|
|
|
|
of the real and imaginary parts. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (COMPLEX_TYPE, "complex_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2000-06-24 21:26:42 +02:00
|
|
|
|
/* Vector types. The TREE_TYPE field is the data type of the vector
|
tree-cfg.c (gimplify_val): Move from tree-complex.c.
2004-07-22 Paolo Bonzini <bonzini@gnu.org>
* tree-cfg.c (gimplify_val): Move from tree-complex.c.
(gimplify_build1): Move from tree-complex.c do_unop.
(gimplify_build2): Move from tree-complex.c do_binop.
(gimplify_build3): New.
* tree-complex.c (gimplify_val, do_unop, do_binop): Remove.
Adjust throughout to call the functions above.
* tree-flow.h: Declare the functions above.
* tree-nested.c (gimplify_val): Rename to...
(tsi_gimplify_val): ... this.
* Makefile.in (tree_complex.o): Update dependencies.
(stor-layout.o): Depend on regs.h.
* c-common.c (handle_vector_size_attribute): Update for
vector types without corresponding vector modes.
* expr.c (expand_expr): Treat VECTOR_CST's like CONSTRUCTORS if
a corresponding vector mode is not available.
* print-tree.c (print_node): Print nunits for vector types
* regclass.c (have_regs_of_mode): New.
(init_reg_sets_1): Initialize it and use it instead
of allocatable_regs_of_mode.
* regs.h (have_regs_of_mode): Declare it.
* stor-layout.c (layout_type): Pick a mode for vector types.
* tree-complex.c (build_word_mode_vector_type, tree_vec_extract,
build_replicated_const, do_unop, do_binop, do_plus_minus,
do_negate, expand_vector_piecewise, expand_vector_parallel,
expand_vector_addition, expand_vector_operations_1,
expand_vector_operations, tree_lower_operations,
pass_lower_vector_ssa, pass_pre_expand): New.
(expand_complex_operations, pass_lower_complex): Remove.
* tree-optimize.c (init_tree_optimization_passes): Adjust
pass ordering for changes in tree-complex.c.
* tree-pass.h: Declare new passes.
* tree.c (finish_vector_type): Remove.
(make_vector_type): New.
(build_vector_type_for_mode, build_vector_type): Rewritten.
* tree.def (VECTOR_TYPE): Document where the number of
subparts is stored.
* tree.h (TYPE_VECTOR_SUBPARTS): Use TYPE_PRECISION field.
(make_vector): Remove declaration.
From-SVN: r85039
2004-07-22 10:20:40 +02:00
|
|
|
|
elements. The TYPE_PRECISION field is the number of subparts of
|
|
|
|
|
the vector. */
|
2000-06-24 21:26:42 +02:00
|
|
|
|
DEFTREECODE (VECTOR_TYPE, "vector_type", 't', 0)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* C enums. The type node looks just like an INTEGER_TYPE node.
|
|
|
|
|
The symbols for the values of the enum type are defined by
|
|
|
|
|
CONST_DECL nodes, but the type does not point to them;
|
1993-02-12 22:03:32 +01:00
|
|
|
|
however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE
|
1992-11-13 02:55:58 +01:00
|
|
|
|
is a name and the TREE_VALUE is the value (an INTEGER_CST node). */
|
|
|
|
|
/* A forward reference `enum foo' when no enum named foo is defined yet
|
|
|
|
|
has zero (a null pointer) in its TYPE_SIZE. The tag name is in
|
|
|
|
|
the TYPE_NAME field. If the type is later defined, the normal
|
|
|
|
|
fields are filled in.
|
1993-04-13 12:34:08 +02:00
|
|
|
|
RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are
|
|
|
|
|
treated similarly. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Pascal's boolean type (true or false are the only values);
|
|
|
|
|
no special fields needed. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (BOOLEAN_TYPE, "boolean_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* CHAR in Pascal; not used in C.
|
|
|
|
|
No special fields needed. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (CHAR_TYPE, "char_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* All pointer-to-x types have code POINTER_TYPE.
|
|
|
|
|
The TREE_TYPE points to the node for the type pointed to. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (POINTER_TYPE, "pointer_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* An offset is a pointer relative to an object.
|
|
|
|
|
The TREE_TYPE field is the type of the object at the offset.
|
|
|
|
|
The TYPE_OFFSET_BASETYPE points to the node for the type of object
|
|
|
|
|
that the offset is relative to. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (OFFSET_TYPE, "offset_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* A reference is like a pointer except that it is coerced
|
|
|
|
|
automatically to the value it points to. Used in C++. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (REFERENCE_TYPE, "reference_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* METHOD_TYPE is the type of a function which takes an extra first
|
|
|
|
|
argument for "self", which is not present in the declared argument list.
|
|
|
|
|
The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
|
|
|
|
|
is the type of "self". TYPE_ARG_TYPES is the real argument list, which
|
|
|
|
|
includes the hidden argument for "self". */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (METHOD_TYPE, "method_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Used for Pascal; details not determined right now. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FILE_TYPE, "file_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Types of arrays. Special fields:
|
|
|
|
|
TREE_TYPE Type of an array element.
|
|
|
|
|
TYPE_DOMAIN Type to index by.
|
|
|
|
|
Its range of values specifies the array length.
|
|
|
|
|
The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
|
1994-02-16 04:52:30 +01:00
|
|
|
|
and holds the type to coerce a value of that array type to in C.
|
|
|
|
|
TYPE_STRING_FLAG indicates a string (in contrast to an array of chars)
|
2002-09-29 15:16:44 +02:00
|
|
|
|
in languages (such as Chill) that make a distinction. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Array types in C or Pascal */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ARRAY_TYPE, "array_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Types of sets for Pascal. Special fields are the same as
|
1994-11-16 05:19:55 +01:00
|
|
|
|
in an array type. The target type is always a boolean type.
|
|
|
|
|
Used for both bitstrings and powersets in Chill;
|
2002-09-29 15:16:44 +02:00
|
|
|
|
TYPE_STRING_FLAG indicates a bitstring. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (SET_TYPE, "set_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Struct in C, or record in Pascal. */
|
|
|
|
|
/* Special fields:
|
1996-11-09 02:32:56 +01:00
|
|
|
|
TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct,
|
|
|
|
|
and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables,
|
|
|
|
|
types and enumerators.
|
1992-11-13 02:55:58 +01:00
|
|
|
|
A few may need to be added for Pascal. */
|
|
|
|
|
/* See the comment above, before ENUMERAL_TYPE, for how
|
|
|
|
|
forward references to struct tags are handled in C. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (RECORD_TYPE, "record_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Union in C. Like a struct, except that the offsets of the fields
|
|
|
|
|
will all be zero. */
|
|
|
|
|
/* See the comment above, before ENUMERAL_TYPE, for how
|
|
|
|
|
forward references to union tags are handled in C. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (UNION_TYPE, "union_type", 't', 0) /* C union type */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1993-04-13 12:34:08 +02:00
|
|
|
|
/* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER
|
|
|
|
|
in each FIELD_DECL determine what the union contains. The first
|
|
|
|
|
field whose DECL_QUALIFIER expression is true is deemed to occupy
|
|
|
|
|
the union. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", 't', 0)
|
1993-04-13 12:34:08 +02:00
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Type of functions. Special fields:
|
|
|
|
|
TREE_TYPE type of value returned.
|
|
|
|
|
TYPE_ARG_TYPES list of types of arguments expected.
|
|
|
|
|
this list is made of TREE_LIST nodes.
|
|
|
|
|
Types of "Procedures" in languages where they are different from functions
|
|
|
|
|
have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FUNCTION_TYPE, "function_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* This is a language-specific kind of type.
|
|
|
|
|
Its meaning is defined by the language front end.
|
|
|
|
|
layout_type does not know how to lay this out,
|
|
|
|
|
so the front-end must do so manually. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (LANG_TYPE, "lang_type", 't', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Expressions */
|
|
|
|
|
|
|
|
|
|
/* First, the constants. */
|
|
|
|
|
|
|
|
|
|
/* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
|
|
|
|
|
32 bits each, giving us a 64 bit constant capability.
|
|
|
|
|
Note: constants of type char in Pascal are INTEGER_CST,
|
|
|
|
|
and so are pointer constants such as nil in Pascal or NULL in C.
|
|
|
|
|
`(int *) 1' in C also results in an INTEGER_CST. */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (INTEGER_CST, "integer_cst", 'c', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
/* Contents are in TREE_REAL_CST field. */
|
|
|
|
|
DEFTREECODE (REAL_CST, "real_cst", 'c', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Contents are in TREE_REALPART and TREE_IMAGPART fields,
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
whose contents are other constant nodes. */
|
|
|
|
|
DEFTREECODE (COMPLEX_CST, "complex_cst", 'c', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2002-02-19 03:53:41 +01:00
|
|
|
|
/* Contents are in TREE_VECTOR_CST_ELTS field. */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (VECTOR_CST, "vector_cst", 'c', 0)
|
2002-02-19 03:53:41 +01:00
|
|
|
|
|
2004-02-05 22:56:38 +01:00
|
|
|
|
/* Contents are TREE_STRING_LENGTH and TREE_STRING_POINTER fields. */
|
tree.c (tree_size): For all 'c' and 'x' nodes...
* tree.c (tree_size): For all 'c' and 'x' nodes, look directly
at the sizes of the relevant structures, rather than relying
on TREE_CODE_LENGTH. Call lang_hooks.tree_size to get the
sizes of any such we don't know about. Use
lang_hooks.identifier_size for IDENTIFIER_NODE.
(initializer_zerop): Use CONSTRUCTOR_ELTS.
* tree.def: Update commentary. Make fourth element of
the definition for all 'c' and 'x' nodes zero.
* langhooks.h: New hook, tree_size / LANG_HOOKS_TREE_SIZE.
* langhooks-def.h: Update to match.
* langhooks.c: New default, lhd_tree_size.
* c-common.def (SRCLOC): Kill.
* c-pretty-print.c (pp_c_postfix_expression [case SRCLOC]):
Remove entirely - was already #if-ed out.
ada:
* ada-tree.def: Make fourth element for GNAT_LOOP_ID zero.
* misc.c (gnat_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
cp:
* cp-tree.def: Make fourth element for all 'c' and 'x' nodes zero.
* cp-lang.c (cp_tree_size): New function.
(LANG_HOOKS_TREE_SIZE): Override.
* cp-tree.h (SOURCE_LOCUS, SRCLOC_FILE, SRCLOC_LINE, struct
tree_srcloc, TS_CP_COMMON, TS_CP_SRCLOC): Kill.
(union lang_tree_node): Remove common and srcloc members.
(build_srcloc_here): Don't prototype.
* decl.c (cp_tree_node_structure): Kill SRCLOC case.
* pt.c (pending_templates): Correct comment.
* tree.c (build_srcloc, build_srcloc_here): Kill.
From-SVN: r65323
2003-04-07 08:03:17 +02:00
|
|
|
|
DEFTREECODE (STRING_CST, "string_cst", 'c', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2003-07-11 10:33:21 +02:00
|
|
|
|
/* Declarations. All references to names are represented as ..._DECL
|
|
|
|
|
nodes. The decls in one binding context are chained through the
|
|
|
|
|
TREE_CHAIN field. Each DECL has a DECL_NAME field which contains
|
|
|
|
|
an IDENTIFIER_NODE. (Some decls, most often labels, may have zero
|
|
|
|
|
as the DECL_NAME). DECL_CONTEXT points to the node representing
|
|
|
|
|
the context in which this declaration has its scope. For
|
|
|
|
|
FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
|
|
|
|
|
QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
|
|
|
|
|
PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
|
|
|
|
|
points to either the FUNCTION_DECL for the containing function, the
|
|
|
|
|
RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or
|
|
|
|
|
a TRANSLATION_UNIT_DECL if the given decl has "file scope".
|
1992-11-13 02:55:58 +01:00
|
|
|
|
DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
|
|
|
|
|
..._DECL node of which this decl is an (inlined or template expanded)
|
|
|
|
|
instance.
|
|
|
|
|
The TREE_TYPE field holds the data type of the object, when relevant.
|
|
|
|
|
LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field
|
|
|
|
|
contents are the type whose name is being declared.
|
|
|
|
|
The DECL_ALIGN, DECL_SIZE,
|
|
|
|
|
and DECL_MODE fields exist in decl nodes just as in type nodes.
|
|
|
|
|
They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
|
|
|
|
|
|
2003-07-11 10:33:21 +02:00
|
|
|
|
DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for
|
|
|
|
|
the location. DECL_VOFFSET holds an expression for a variable
|
|
|
|
|
offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer).
|
1992-11-13 02:55:58 +01:00
|
|
|
|
These fields are relevant only in FIELD_DECLs and PARM_DECLs.
|
|
|
|
|
|
|
|
|
|
DECL_INITIAL holds the value to initialize a variable to,
|
|
|
|
|
or the value of a constant. For a function, it holds the body
|
|
|
|
|
(a node of type BLOCK representing the function's binding contour
|
|
|
|
|
and whose body contains the function's statements.) For a LABEL_DECL
|
|
|
|
|
in C, it is a flag, nonzero if the label's definition has been seen.
|
|
|
|
|
|
|
|
|
|
PARM_DECLs use a special field:
|
|
|
|
|
DECL_ARG_TYPE is the type in which the argument is actually
|
|
|
|
|
passed, which may be different from its type within the function.
|
|
|
|
|
|
|
|
|
|
FUNCTION_DECLs use four special fields:
|
|
|
|
|
DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
|
|
|
|
|
DECL_RESULT holds a RESULT_DECL node for the value of a function,
|
|
|
|
|
or it is 0 for a function that returns no value.
|
|
|
|
|
(C functions returning void have zero here.)
|
1998-08-24 21:46:49 +02:00
|
|
|
|
The TREE_TYPE field is the type in which the result is actually
|
|
|
|
|
returned. This is usually the same as the return type of the
|
|
|
|
|
FUNCTION_DECL, but it may be a wider integer type because of
|
|
|
|
|
promotion.
|
1992-11-13 02:55:58 +01:00
|
|
|
|
DECL_FUNCTION_CODE is a code number that is nonzero for
|
|
|
|
|
built-in functions. Its value is an enum built_in_function
|
|
|
|
|
that says which built-in function it is.
|
|
|
|
|
|
2003-09-22 07:09:32 +02:00
|
|
|
|
DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
|
1992-11-13 02:55:58 +01:00
|
|
|
|
holds a line number. In some cases these can be the location of
|
|
|
|
|
a reference, if no definition has been seen.
|
|
|
|
|
|
2002-09-27 14:48:07 +02:00
|
|
|
|
DECL_ABSTRACT is nonzero if the decl represents an abstract instance
|
1992-11-13 02:55:58 +01:00
|
|
|
|
of a decl (i.e. one which is nested within an abstract instance of a
|
|
|
|
|
inline function. */
|
|
|
|
|
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FUNCTION_DECL, "function_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (LABEL_DECL, "label_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (CONST_DECL, "const_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (TYPE_DECL, "type_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (VAR_DECL, "var_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (PARM_DECL, "parm_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (RESULT_DECL, "result_decl", 'd', 0)
|
|
|
|
|
DEFTREECODE (FIELD_DECL, "field_decl", 'd', 0)
|
1998-05-05 03:27:06 +02:00
|
|
|
|
|
|
|
|
|
/* A namespace declaration. Namespaces appear in DECL_CONTEXT of other
|
|
|
|
|
_DECLs, providing a hierarchy of names. */
|
|
|
|
|
DEFTREECODE (NAMESPACE_DECL, "namespace_decl", 'd', 0)
|
2003-07-11 10:33:21 +02:00
|
|
|
|
|
|
|
|
|
/* A translation unit. This is not technically a declaration, since it
|
|
|
|
|
can't be looked up, but it's close enough. */
|
|
|
|
|
DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl", 'd', 0)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* References to storage. */
|
|
|
|
|
|
|
|
|
|
/* Value is structure or union component.
|
alias.c (adjust_offset_for_component_ref): Use component_ref_field_offset.
* alias.c (adjust_offset_for_component_ref): Use
component_ref_field_offset.
* c-decl.c (build_array_declarator): Add news args for ARRAY_REF.
* c-gimplify.c (gimplify_expr_stmt): Use alloc_stmt_list.
(gimplify_decl_stmt): Call gimplify_type_sizes for type.
For decl, call gimplify_one_sizepos and use statement list.
(gimplify_compound_literal_expr): New arg PRE_P.
Add statement to PRE_P list and return DECL.
(c_gimplify_expr, case COMPOUND_LITERAL_EXPR): Add arg to
gimplify_compound_literal_expr.
* c-tree.h (getdecls): Deleted.
* c-typeck.c (build_component_ref): Add operand for COMPONENT_REF.
(build_array_ref): Add two operands for ARRAY_REF.
(build_unary_op): Set TREE_INVARIANT and TREE_CONSTANT for
COMPOUND_LITERAL_EXPR.
* coverage.c (tree_coverage_counter_ref): Add new operands
for ARRAY_REF.
* emit-rtl.c (component_ref_for_mem_expr): Add new operand
for COMPONENT_REF.
(set_mem_attributes_minus_bitpos): Use array_ref_low_bound
and array_ref_element_size.
(widen_memory_access):Use component_ref_field_offset.
* explow.c (update_nonlocal_goto_save_area): Add two operands
for ARRAY_REF.
* expr.c (array_ref_element_size, array_ref_low_bound): New functions.
(component_ref_field_offset): Likewise.
(get_inner_reference): Use them.
(expand_expr_real_1, case ARRAY_REF): Use array_ref_low_bound.
* fold-const.c (fold, case EQ_EXPR): Properly handle DECL_SIZE.
(fold_read_from_constant_string): Use array_ref_low_bound.
Verify that result is a character type.
(build_fold_indirect_ref): Add two operands for ARRAY_REF.
* function.c (expand_function_start): Likewise.
* gimple-low.c (expand_var_p): Delete duplicated line.
* gimplify.c: Add static decls for local functions.
(cgraph.h): Now included.
(create_tmp_var): Remove check for ARRAY_TYPE.
(copy_if_shared_r): Look at bounds and sizes of types.
(build_and_jump): Return alloc_stmt_list instead of build_empty_stmt.
(gimplify_exit_expr, shortcut_cond_expr): Likewise.
(gimplify_save_expr, gimple_push_cleanup): Likewise.
(gimplify_init_constructor): Likewise.
WANT_VALUE now bool.
If empty list with no result wanted, return GS_UNHANDLED.
Add additional operands for ARRAY_REF and COMPONENT_REF.
(canonicalize_component_ref): Convert to &array[L].
(gimplify_array_ref_to_plus): Use array_ref_element_size and
array_ref_lower_bound.
(build_addr_expr_with_type, build_addr_expr): New functions.
(gimplify_compound_lval): WANT_LVALUE now bool.
Major rework to allow handle_component_p and initialize and
gimplify new operands for ARRAY_REF, ARRAY_RANGE_REF, and
COMPONENT_REF.
(gimplify_array_ref): Deleted.
(gimplify_self_mod_expr): WANT_VALUE now bool.
(gimplify_modify_expr): Gimplify to_p and from_p later.
Factor out code into gimplify_modify_expr_rhs and call twice.
Move variable-size code earlier and handle PLACEHOLDER_EXPR.
(gimplify_modify_expr_rhs, gimplify_variable_sized_compare): New fns.
(gimplify_addr_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr, case ARRAY_REF): Delete special case.
Instead handle like COMPONENT_REF; also do ARRAY_RANGE_REF,
IMAGPART, and REALPART the same way.
(gimplify_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr): Call gimplify_variable_sized_compare if applicable.
Call alloc_stmt_list instead of build_empty_stmt.
Deal with _REF that's volatile.
(gimplify_type_sizes, gimplify_one_sizepos): New functions.
(unshare_body, unvisit_body): New functions.
(gimplify_body): Call them.
* stmt.c (expand_stack_alloc): Don't expand TYPE_MAX_VALUE.
* stor-layout.c (get_pending_sizes): Don't change SAVE_EXPR_CONTEXT.
* tree-alias-common.c (get_alias_var): Also skip ARRAY_RANGE_REF.
* tree-cfg.c (tree_node_can_be_shared): Treat ARRAY_RANGE_REF
like ARRAY_REF.
(verify_expr, case ADDR_EXPR): Use handled_component_p.
* tree-dfa.c (get_virtual_var): Likewise.
* tree-dump.c (dequeue_and_dump, case COMPONENT_REF, ARRAY_REF):
New cases to dump new operands; likewise for ARRAY_RANGE_REF.
* tree-eh.c (tree_could_trap, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-gimple.c (is_gimple_addr_expr_arg): Add ARRAY_RANGE_REF
and INDIRECT_REF.
(get_base_address): Use handled_component_p.
* tree-gimple.h (gimplify_type_sizes, gimplify_one_sizepos): New.
* tree-line.c (walk_tree): Walk more things for types and decls.
* tree-mudflap.c (mf_build_check_statement_for): Add new operands
for ARRAY_REF and COMPONENT_REF.
(mx_xform_derefs_1): Clean up usage of decl sizes.
* tree-nested.c (build_addr): Use handled_component_p.
(walk_stmts, case CATCH_EXPR): Add missing "break".
(get_static_chain, get_frame_field): Add new operand for COMPONENT_REF.
(finalize_nesting_tree_1): Likewise.
(convert_nonlocal_reference, case ARRAY_RANGE_REF): Like ARRAY_REF
and process additional operands.
(convert_local_reference): Likewise.
* tree-outof-ssa.c (discover_nonconstant_array_refs_r): Treat
ARRAY_RANGE_REF similarly to ARRAY_REF.
* tree-pretty-print.c (dump_generic_node, case QUAL_UNION_TYPE): Handle
like RECORD_TYPE.
(dump_generic_node, case COMPONENT_REF): Print offset operand.
(dump_generic_node, case ARRAY_RANGE_REF): Treat like ARRAY_REF
and print lower bound and element size for both.
(op_prio, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-sra.c (csc_build_component_ref): Add new operand.
(scalarize_call_expr): Use get_base_address.
* tree-ssa-ccp.c (widen_bitfield): Clean up size handling.
(maybe_fold_offset_to_array_ref): Rework to handle input having an
ARRAY_REF, refine handling of lower bound, and add new operands
for ARRAY_REF.
(maybe_fold_to_component_ref): Add new operand for COMPONENT_REF.
(maybe_fold_stmt_indirect): Only fold *&B to B if types match.
(maybe_fold_stmt_addition): Only handle constant lower bound.
* tree-ssa-operands.c (get_expr_operands): Minor rearrangements.
Treat ARRAY_REF and ARRAY_RANGE_REF the same; look at extra operands.
Look at new offset operand of COMPONENT_REF.
* tree-ssa.c (set_is_used): Use handled_component_p.
* tree.c (substitute_in_expr, case COMPONENT_REF): Add new operand.
(stabilize_reference, case COMPONENT_REF): Likewise.
(stabilize_reference, case ARRAY_RANGE_REF, ARRAY_REF): Similarly.
(recompute_tree_invariant_for_addr_expr): Completely rework to
be more precise. Also set TREE_SIDE_EFFECTS.
(build1_stat, case ARRAY_EXPR): Don't handle TREE_SIDE_EFFECTS here.
(build2_stat, build3_stat, build4_stat): For references,
propagate TREE_THIS_VOLATILE.
(get_unwidened): Add new operand for COMPONENT_REF.
(get_narrower): Likewise; use host_integerp for DECL_SIZE.
* tree.def (COMPONENT_REF): Add new operand.
(ARRAY_REF, ARRAY_RANGE_REF): Add two new operands.
* tree.h (array_ref_element_size, array_ref_low_bound): New decls.
(component_ref_field_offset): Likewise.
* config/alpha/alpha.c (alpha_va_start): Add new op for COMPONENT_REF.
(alpha_gimplify_va_arg): Likewise.
* config/i386/i386.c (ix86_va_start, ix86_gimplify_va_arg): Likewise.
* config/i860/i860.c (i860_va_start, i860_va_arg): Likewise.
* config/iq2000/iq2000.c (iq2000_va_arg): Likewise.
* config/mips/mips.c (mips_va_start, mips_va_arg): Likewise.
* config/rs6000/rs6000.c (rs6000_va_start, rs6000_gimplify_va_arg):
Likewise.
* config/s390/s390.c (s390_va_start, s390_gimplify_va_arg): Likewise.
* config/sh/sh.c (sh_va_start, sh_va_arg): Likewise.
* config/stormy16/stormy16.c (xstormy1_expand_builin_va_start):
Likewise.
(xstormy16_expand_builtin_va_arg): Likewise.
* config/xtensa/xtensa.c (xtensa_va_start, xtensa_va_arg): Likewise.
* cp/call.c (build_vfield_ref): Add new operand for COMPONENT_REF.
(build_new_method_call): Likewise.
* cp/decl.c (local_variable_p_walkfn): Don't walk into types.
* cp/decl2.c (grok_array_decl): Add new operands for ARRAY_REF.
(build_anon_union_vars): Add new operand for COMPONENT_REF.
* cp/init.c (buld_new): Add new operand for ARRAY_REF.
* cp/method.c (do_build_copy_constructor): New op for COMPONENT_REF.
(do_build_assign_ref): Likewise.
* cp/parser.c (cp_parser_direct_new_declarator): Add new operands
for ARRAY_REF.
(cp_parser_direct_declarator): Likewise.
* cp/pt.c (tsubst): Likewise.
(tsubst_copy, tsubst_copy_and_build): Likewise; also add new operand
for COMPONENT_REF.
* cp/semantics.c (finish_non_static_data_member): Add new operand
for COMPONENT_REF.
* cp/typeck.c (build_class_member_access_expr): Likewise.
(build_class_member_access_expr, finish_class_member_access_expr):
Likewise.
(build_ptrmemfunc_access_expr): Likewise.
(build_array_ref): Add new operands for ARRAY_REF.
* cp/typeck2.c (split_nonconstant_init_1): Likewise; COMPONENT_REF too.
* cp/tree.c (count_trees_r, no_linkage_helper): Don't walk in types.
* fortran/f95-lang.c (LANG_HOOKS_GIMPLE_BEFORE_INLINING): Deleted.
* fortran/trans-array.c (gfc_conv_descriptor_data): Add operand
for COMPONENT_REF.
(gfc_conv_descriptor_offset, gfc_conv_descriptor_dtype): Likewise.
(gfc_conv_descriptor_dimension, gfc_conv_descriptor_stride): Likewise.
(gfc_conv_descriptor_lbound, gfc_conv_descriptor_ubound): Likewise.
* fortran/trans-common.c (create_common): Likewise.
* fortran/trans-expr.c (gfc_conv_component_ref): Likewise.
* fortran/trans-io.c (set_parameter_value): Likewise.
(set_parameter_ref, set_string, set_flag, io_result): Likewise.
(transfer_expr): Likewise.
* fortran/trans-decl.c (gfc_trans_auto_character_variable):
Set up to get DECL_SIZE and DECL_SIZE_UNIT gimplified.
(gfc_simplify_function): New function.
(gfc_generate_function-code): Properly handle nested functions.
* fortran/trans.c (gfc_build_array_ref): Add two new operands
for ARRAY_REF.
* java/class.c (build_class_ref): Add new operand for COMPONENT_REF.
(build_static_field_ref): Likewise and add new operands for ARRAY_REF.
* java/constants.c (build_ref_from_constant_pool): Likewise.
* java/expr.c (build_java_array_length_access): Likewise.
(build_get_class, build_field_ref, build_known_method_ref): Likewise.
(invoke_build_dtable, build_invokevirtual): Likewise.
(build_invokeinterface, java_expand_expr): Likewise.
(emit_init_test_initialization): Likewise.
* java/java-gimplify.c (java_gimplify_new_array_init): Likewise.
* java/parse.y (make_qualifed_name, build_array_ref): Likewise.
* objc/ojbc-act.c (generate_static_references): Add additional
operands to ARRAY_REF.
(generate_strings, build_method_prototype_list_template): Likewise.
(generate_protocol_list): Likewise.
From-SVN: r83474
2004-06-22 05:07:05 +02:00
|
|
|
|
Operand 0 is the structure or union (an expression).
|
|
|
|
|
Operand 1 is the field (a node of type FIELD_DECL).
|
|
|
|
|
Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured
|
|
|
|
|
in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */
|
|
|
|
|
DEFTREECODE (COMPONENT_REF, "component_ref", 'r', 3)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Reference to a group of bits within an object. Similar to COMPONENT_REF
|
|
|
|
|
except the position is given explicitly rather than via a FIELD_DECL.
|
|
|
|
|
Operand 0 is the structure or union expression;
|
|
|
|
|
operand 1 is a tree giving the number of bits being referenced;
|
|
|
|
|
operand 2 is a tree giving the position of the first referenced bit.
|
|
|
|
|
The field can be either a signed or unsigned field;
|
2004-04-01 15:41:37 +02:00
|
|
|
|
BIT_FIELD_REF_UNSIGNED says which. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", 'r', 3)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (INDIRECT_REF, "indirect_ref", 'r', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2001-06-04 15:21:38 +02:00
|
|
|
|
/* Array indexing.
|
alias.c (adjust_offset_for_component_ref): Use component_ref_field_offset.
* alias.c (adjust_offset_for_component_ref): Use
component_ref_field_offset.
* c-decl.c (build_array_declarator): Add news args for ARRAY_REF.
* c-gimplify.c (gimplify_expr_stmt): Use alloc_stmt_list.
(gimplify_decl_stmt): Call gimplify_type_sizes for type.
For decl, call gimplify_one_sizepos and use statement list.
(gimplify_compound_literal_expr): New arg PRE_P.
Add statement to PRE_P list and return DECL.
(c_gimplify_expr, case COMPOUND_LITERAL_EXPR): Add arg to
gimplify_compound_literal_expr.
* c-tree.h (getdecls): Deleted.
* c-typeck.c (build_component_ref): Add operand for COMPONENT_REF.
(build_array_ref): Add two operands for ARRAY_REF.
(build_unary_op): Set TREE_INVARIANT and TREE_CONSTANT for
COMPOUND_LITERAL_EXPR.
* coverage.c (tree_coverage_counter_ref): Add new operands
for ARRAY_REF.
* emit-rtl.c (component_ref_for_mem_expr): Add new operand
for COMPONENT_REF.
(set_mem_attributes_minus_bitpos): Use array_ref_low_bound
and array_ref_element_size.
(widen_memory_access):Use component_ref_field_offset.
* explow.c (update_nonlocal_goto_save_area): Add two operands
for ARRAY_REF.
* expr.c (array_ref_element_size, array_ref_low_bound): New functions.
(component_ref_field_offset): Likewise.
(get_inner_reference): Use them.
(expand_expr_real_1, case ARRAY_REF): Use array_ref_low_bound.
* fold-const.c (fold, case EQ_EXPR): Properly handle DECL_SIZE.
(fold_read_from_constant_string): Use array_ref_low_bound.
Verify that result is a character type.
(build_fold_indirect_ref): Add two operands for ARRAY_REF.
* function.c (expand_function_start): Likewise.
* gimple-low.c (expand_var_p): Delete duplicated line.
* gimplify.c: Add static decls for local functions.
(cgraph.h): Now included.
(create_tmp_var): Remove check for ARRAY_TYPE.
(copy_if_shared_r): Look at bounds and sizes of types.
(build_and_jump): Return alloc_stmt_list instead of build_empty_stmt.
(gimplify_exit_expr, shortcut_cond_expr): Likewise.
(gimplify_save_expr, gimple_push_cleanup): Likewise.
(gimplify_init_constructor): Likewise.
WANT_VALUE now bool.
If empty list with no result wanted, return GS_UNHANDLED.
Add additional operands for ARRAY_REF and COMPONENT_REF.
(canonicalize_component_ref): Convert to &array[L].
(gimplify_array_ref_to_plus): Use array_ref_element_size and
array_ref_lower_bound.
(build_addr_expr_with_type, build_addr_expr): New functions.
(gimplify_compound_lval): WANT_LVALUE now bool.
Major rework to allow handle_component_p and initialize and
gimplify new operands for ARRAY_REF, ARRAY_RANGE_REF, and
COMPONENT_REF.
(gimplify_array_ref): Deleted.
(gimplify_self_mod_expr): WANT_VALUE now bool.
(gimplify_modify_expr): Gimplify to_p and from_p later.
Factor out code into gimplify_modify_expr_rhs and call twice.
Move variable-size code earlier and handle PLACEHOLDER_EXPR.
(gimplify_modify_expr_rhs, gimplify_variable_sized_compare): New fns.
(gimplify_addr_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr, case ARRAY_REF): Delete special case.
Instead handle like COMPONENT_REF; also do ARRAY_RANGE_REF,
IMAGPART, and REALPART the same way.
(gimplify_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr): Call gimplify_variable_sized_compare if applicable.
Call alloc_stmt_list instead of build_empty_stmt.
Deal with _REF that's volatile.
(gimplify_type_sizes, gimplify_one_sizepos): New functions.
(unshare_body, unvisit_body): New functions.
(gimplify_body): Call them.
* stmt.c (expand_stack_alloc): Don't expand TYPE_MAX_VALUE.
* stor-layout.c (get_pending_sizes): Don't change SAVE_EXPR_CONTEXT.
* tree-alias-common.c (get_alias_var): Also skip ARRAY_RANGE_REF.
* tree-cfg.c (tree_node_can_be_shared): Treat ARRAY_RANGE_REF
like ARRAY_REF.
(verify_expr, case ADDR_EXPR): Use handled_component_p.
* tree-dfa.c (get_virtual_var): Likewise.
* tree-dump.c (dequeue_and_dump, case COMPONENT_REF, ARRAY_REF):
New cases to dump new operands; likewise for ARRAY_RANGE_REF.
* tree-eh.c (tree_could_trap, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-gimple.c (is_gimple_addr_expr_arg): Add ARRAY_RANGE_REF
and INDIRECT_REF.
(get_base_address): Use handled_component_p.
* tree-gimple.h (gimplify_type_sizes, gimplify_one_sizepos): New.
* tree-line.c (walk_tree): Walk more things for types and decls.
* tree-mudflap.c (mf_build_check_statement_for): Add new operands
for ARRAY_REF and COMPONENT_REF.
(mx_xform_derefs_1): Clean up usage of decl sizes.
* tree-nested.c (build_addr): Use handled_component_p.
(walk_stmts, case CATCH_EXPR): Add missing "break".
(get_static_chain, get_frame_field): Add new operand for COMPONENT_REF.
(finalize_nesting_tree_1): Likewise.
(convert_nonlocal_reference, case ARRAY_RANGE_REF): Like ARRAY_REF
and process additional operands.
(convert_local_reference): Likewise.
* tree-outof-ssa.c (discover_nonconstant_array_refs_r): Treat
ARRAY_RANGE_REF similarly to ARRAY_REF.
* tree-pretty-print.c (dump_generic_node, case QUAL_UNION_TYPE): Handle
like RECORD_TYPE.
(dump_generic_node, case COMPONENT_REF): Print offset operand.
(dump_generic_node, case ARRAY_RANGE_REF): Treat like ARRAY_REF
and print lower bound and element size for both.
(op_prio, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-sra.c (csc_build_component_ref): Add new operand.
(scalarize_call_expr): Use get_base_address.
* tree-ssa-ccp.c (widen_bitfield): Clean up size handling.
(maybe_fold_offset_to_array_ref): Rework to handle input having an
ARRAY_REF, refine handling of lower bound, and add new operands
for ARRAY_REF.
(maybe_fold_to_component_ref): Add new operand for COMPONENT_REF.
(maybe_fold_stmt_indirect): Only fold *&B to B if types match.
(maybe_fold_stmt_addition): Only handle constant lower bound.
* tree-ssa-operands.c (get_expr_operands): Minor rearrangements.
Treat ARRAY_REF and ARRAY_RANGE_REF the same; look at extra operands.
Look at new offset operand of COMPONENT_REF.
* tree-ssa.c (set_is_used): Use handled_component_p.
* tree.c (substitute_in_expr, case COMPONENT_REF): Add new operand.
(stabilize_reference, case COMPONENT_REF): Likewise.
(stabilize_reference, case ARRAY_RANGE_REF, ARRAY_REF): Similarly.
(recompute_tree_invariant_for_addr_expr): Completely rework to
be more precise. Also set TREE_SIDE_EFFECTS.
(build1_stat, case ARRAY_EXPR): Don't handle TREE_SIDE_EFFECTS here.
(build2_stat, build3_stat, build4_stat): For references,
propagate TREE_THIS_VOLATILE.
(get_unwidened): Add new operand for COMPONENT_REF.
(get_narrower): Likewise; use host_integerp for DECL_SIZE.
* tree.def (COMPONENT_REF): Add new operand.
(ARRAY_REF, ARRAY_RANGE_REF): Add two new operands.
* tree.h (array_ref_element_size, array_ref_low_bound): New decls.
(component_ref_field_offset): Likewise.
* config/alpha/alpha.c (alpha_va_start): Add new op for COMPONENT_REF.
(alpha_gimplify_va_arg): Likewise.
* config/i386/i386.c (ix86_va_start, ix86_gimplify_va_arg): Likewise.
* config/i860/i860.c (i860_va_start, i860_va_arg): Likewise.
* config/iq2000/iq2000.c (iq2000_va_arg): Likewise.
* config/mips/mips.c (mips_va_start, mips_va_arg): Likewise.
* config/rs6000/rs6000.c (rs6000_va_start, rs6000_gimplify_va_arg):
Likewise.
* config/s390/s390.c (s390_va_start, s390_gimplify_va_arg): Likewise.
* config/sh/sh.c (sh_va_start, sh_va_arg): Likewise.
* config/stormy16/stormy16.c (xstormy1_expand_builin_va_start):
Likewise.
(xstormy16_expand_builtin_va_arg): Likewise.
* config/xtensa/xtensa.c (xtensa_va_start, xtensa_va_arg): Likewise.
* cp/call.c (build_vfield_ref): Add new operand for COMPONENT_REF.
(build_new_method_call): Likewise.
* cp/decl.c (local_variable_p_walkfn): Don't walk into types.
* cp/decl2.c (grok_array_decl): Add new operands for ARRAY_REF.
(build_anon_union_vars): Add new operand for COMPONENT_REF.
* cp/init.c (buld_new): Add new operand for ARRAY_REF.
* cp/method.c (do_build_copy_constructor): New op for COMPONENT_REF.
(do_build_assign_ref): Likewise.
* cp/parser.c (cp_parser_direct_new_declarator): Add new operands
for ARRAY_REF.
(cp_parser_direct_declarator): Likewise.
* cp/pt.c (tsubst): Likewise.
(tsubst_copy, tsubst_copy_and_build): Likewise; also add new operand
for COMPONENT_REF.
* cp/semantics.c (finish_non_static_data_member): Add new operand
for COMPONENT_REF.
* cp/typeck.c (build_class_member_access_expr): Likewise.
(build_class_member_access_expr, finish_class_member_access_expr):
Likewise.
(build_ptrmemfunc_access_expr): Likewise.
(build_array_ref): Add new operands for ARRAY_REF.
* cp/typeck2.c (split_nonconstant_init_1): Likewise; COMPONENT_REF too.
* cp/tree.c (count_trees_r, no_linkage_helper): Don't walk in types.
* fortran/f95-lang.c (LANG_HOOKS_GIMPLE_BEFORE_INLINING): Deleted.
* fortran/trans-array.c (gfc_conv_descriptor_data): Add operand
for COMPONENT_REF.
(gfc_conv_descriptor_offset, gfc_conv_descriptor_dtype): Likewise.
(gfc_conv_descriptor_dimension, gfc_conv_descriptor_stride): Likewise.
(gfc_conv_descriptor_lbound, gfc_conv_descriptor_ubound): Likewise.
* fortran/trans-common.c (create_common): Likewise.
* fortran/trans-expr.c (gfc_conv_component_ref): Likewise.
* fortran/trans-io.c (set_parameter_value): Likewise.
(set_parameter_ref, set_string, set_flag, io_result): Likewise.
(transfer_expr): Likewise.
* fortran/trans-decl.c (gfc_trans_auto_character_variable):
Set up to get DECL_SIZE and DECL_SIZE_UNIT gimplified.
(gfc_simplify_function): New function.
(gfc_generate_function-code): Properly handle nested functions.
* fortran/trans.c (gfc_build_array_ref): Add two new operands
for ARRAY_REF.
* java/class.c (build_class_ref): Add new operand for COMPONENT_REF.
(build_static_field_ref): Likewise and add new operands for ARRAY_REF.
* java/constants.c (build_ref_from_constant_pool): Likewise.
* java/expr.c (build_java_array_length_access): Likewise.
(build_get_class, build_field_ref, build_known_method_ref): Likewise.
(invoke_build_dtable, build_invokevirtual): Likewise.
(build_invokeinterface, java_expand_expr): Likewise.
(emit_init_test_initialization): Likewise.
* java/java-gimplify.c (java_gimplify_new_array_init): Likewise.
* java/parse.y (make_qualifed_name, build_array_ref): Likewise.
* objc/ojbc-act.c (generate_static_references): Add additional
operands to ARRAY_REF.
(generate_strings, build_method_prototype_list_template): Likewise.
(generate_protocol_list): Likewise.
From-SVN: r83474
2004-06-22 05:07:05 +02:00
|
|
|
|
Operand 0 is the array; operand 1 is a (single) array index.
|
|
|
|
|
Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
|
|
|
|
|
Operand 3, if present, is the element size, measured in units of
|
|
|
|
|
the alignment of the element type. */
|
|
|
|
|
DEFTREECODE (ARRAY_REF, "array_ref", 'r', 4)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2001-06-05 12:27:44 +02:00
|
|
|
|
/* Likewise, except that the result is a range ("slice") of the array. The
|
|
|
|
|
starting index of the resulting array is taken from operand 1 and the size
|
|
|
|
|
of the range is taken from the type of the expression. */
|
alias.c (adjust_offset_for_component_ref): Use component_ref_field_offset.
* alias.c (adjust_offset_for_component_ref): Use
component_ref_field_offset.
* c-decl.c (build_array_declarator): Add news args for ARRAY_REF.
* c-gimplify.c (gimplify_expr_stmt): Use alloc_stmt_list.
(gimplify_decl_stmt): Call gimplify_type_sizes for type.
For decl, call gimplify_one_sizepos and use statement list.
(gimplify_compound_literal_expr): New arg PRE_P.
Add statement to PRE_P list and return DECL.
(c_gimplify_expr, case COMPOUND_LITERAL_EXPR): Add arg to
gimplify_compound_literal_expr.
* c-tree.h (getdecls): Deleted.
* c-typeck.c (build_component_ref): Add operand for COMPONENT_REF.
(build_array_ref): Add two operands for ARRAY_REF.
(build_unary_op): Set TREE_INVARIANT and TREE_CONSTANT for
COMPOUND_LITERAL_EXPR.
* coverage.c (tree_coverage_counter_ref): Add new operands
for ARRAY_REF.
* emit-rtl.c (component_ref_for_mem_expr): Add new operand
for COMPONENT_REF.
(set_mem_attributes_minus_bitpos): Use array_ref_low_bound
and array_ref_element_size.
(widen_memory_access):Use component_ref_field_offset.
* explow.c (update_nonlocal_goto_save_area): Add two operands
for ARRAY_REF.
* expr.c (array_ref_element_size, array_ref_low_bound): New functions.
(component_ref_field_offset): Likewise.
(get_inner_reference): Use them.
(expand_expr_real_1, case ARRAY_REF): Use array_ref_low_bound.
* fold-const.c (fold, case EQ_EXPR): Properly handle DECL_SIZE.
(fold_read_from_constant_string): Use array_ref_low_bound.
Verify that result is a character type.
(build_fold_indirect_ref): Add two operands for ARRAY_REF.
* function.c (expand_function_start): Likewise.
* gimple-low.c (expand_var_p): Delete duplicated line.
* gimplify.c: Add static decls for local functions.
(cgraph.h): Now included.
(create_tmp_var): Remove check for ARRAY_TYPE.
(copy_if_shared_r): Look at bounds and sizes of types.
(build_and_jump): Return alloc_stmt_list instead of build_empty_stmt.
(gimplify_exit_expr, shortcut_cond_expr): Likewise.
(gimplify_save_expr, gimple_push_cleanup): Likewise.
(gimplify_init_constructor): Likewise.
WANT_VALUE now bool.
If empty list with no result wanted, return GS_UNHANDLED.
Add additional operands for ARRAY_REF and COMPONENT_REF.
(canonicalize_component_ref): Convert to &array[L].
(gimplify_array_ref_to_plus): Use array_ref_element_size and
array_ref_lower_bound.
(build_addr_expr_with_type, build_addr_expr): New functions.
(gimplify_compound_lval): WANT_LVALUE now bool.
Major rework to allow handle_component_p and initialize and
gimplify new operands for ARRAY_REF, ARRAY_RANGE_REF, and
COMPONENT_REF.
(gimplify_array_ref): Deleted.
(gimplify_self_mod_expr): WANT_VALUE now bool.
(gimplify_modify_expr): Gimplify to_p and from_p later.
Factor out code into gimplify_modify_expr_rhs and call twice.
Move variable-size code earlier and handle PLACEHOLDER_EXPR.
(gimplify_modify_expr_rhs, gimplify_variable_sized_compare): New fns.
(gimplify_addr_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr, case ARRAY_REF): Delete special case.
Instead handle like COMPONENT_REF; also do ARRAY_RANGE_REF,
IMAGPART, and REALPART the same way.
(gimplify_expr, case VIEW_CONVERT_EXPR): New case.
(gimplify_expr): Call gimplify_variable_sized_compare if applicable.
Call alloc_stmt_list instead of build_empty_stmt.
Deal with _REF that's volatile.
(gimplify_type_sizes, gimplify_one_sizepos): New functions.
(unshare_body, unvisit_body): New functions.
(gimplify_body): Call them.
* stmt.c (expand_stack_alloc): Don't expand TYPE_MAX_VALUE.
* stor-layout.c (get_pending_sizes): Don't change SAVE_EXPR_CONTEXT.
* tree-alias-common.c (get_alias_var): Also skip ARRAY_RANGE_REF.
* tree-cfg.c (tree_node_can_be_shared): Treat ARRAY_RANGE_REF
like ARRAY_REF.
(verify_expr, case ADDR_EXPR): Use handled_component_p.
* tree-dfa.c (get_virtual_var): Likewise.
* tree-dump.c (dequeue_and_dump, case COMPONENT_REF, ARRAY_REF):
New cases to dump new operands; likewise for ARRAY_RANGE_REF.
* tree-eh.c (tree_could_trap, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-gimple.c (is_gimple_addr_expr_arg): Add ARRAY_RANGE_REF
and INDIRECT_REF.
(get_base_address): Use handled_component_p.
* tree-gimple.h (gimplify_type_sizes, gimplify_one_sizepos): New.
* tree-line.c (walk_tree): Walk more things for types and decls.
* tree-mudflap.c (mf_build_check_statement_for): Add new operands
for ARRAY_REF and COMPONENT_REF.
(mx_xform_derefs_1): Clean up usage of decl sizes.
* tree-nested.c (build_addr): Use handled_component_p.
(walk_stmts, case CATCH_EXPR): Add missing "break".
(get_static_chain, get_frame_field): Add new operand for COMPONENT_REF.
(finalize_nesting_tree_1): Likewise.
(convert_nonlocal_reference, case ARRAY_RANGE_REF): Like ARRAY_REF
and process additional operands.
(convert_local_reference): Likewise.
* tree-outof-ssa.c (discover_nonconstant_array_refs_r): Treat
ARRAY_RANGE_REF similarly to ARRAY_REF.
* tree-pretty-print.c (dump_generic_node, case QUAL_UNION_TYPE): Handle
like RECORD_TYPE.
(dump_generic_node, case COMPONENT_REF): Print offset operand.
(dump_generic_node, case ARRAY_RANGE_REF): Treat like ARRAY_REF
and print lower bound and element size for both.
(op_prio, case ARRAY_RANGE_REF): Like ARRAY_REF.
* tree-sra.c (csc_build_component_ref): Add new operand.
(scalarize_call_expr): Use get_base_address.
* tree-ssa-ccp.c (widen_bitfield): Clean up size handling.
(maybe_fold_offset_to_array_ref): Rework to handle input having an
ARRAY_REF, refine handling of lower bound, and add new operands
for ARRAY_REF.
(maybe_fold_to_component_ref): Add new operand for COMPONENT_REF.
(maybe_fold_stmt_indirect): Only fold *&B to B if types match.
(maybe_fold_stmt_addition): Only handle constant lower bound.
* tree-ssa-operands.c (get_expr_operands): Minor rearrangements.
Treat ARRAY_REF and ARRAY_RANGE_REF the same; look at extra operands.
Look at new offset operand of COMPONENT_REF.
* tree-ssa.c (set_is_used): Use handled_component_p.
* tree.c (substitute_in_expr, case COMPONENT_REF): Add new operand.
(stabilize_reference, case COMPONENT_REF): Likewise.
(stabilize_reference, case ARRAY_RANGE_REF, ARRAY_REF): Similarly.
(recompute_tree_invariant_for_addr_expr): Completely rework to
be more precise. Also set TREE_SIDE_EFFECTS.
(build1_stat, case ARRAY_EXPR): Don't handle TREE_SIDE_EFFECTS here.
(build2_stat, build3_stat, build4_stat): For references,
propagate TREE_THIS_VOLATILE.
(get_unwidened): Add new operand for COMPONENT_REF.
(get_narrower): Likewise; use host_integerp for DECL_SIZE.
* tree.def (COMPONENT_REF): Add new operand.
(ARRAY_REF, ARRAY_RANGE_REF): Add two new operands.
* tree.h (array_ref_element_size, array_ref_low_bound): New decls.
(component_ref_field_offset): Likewise.
* config/alpha/alpha.c (alpha_va_start): Add new op for COMPONENT_REF.
(alpha_gimplify_va_arg): Likewise.
* config/i386/i386.c (ix86_va_start, ix86_gimplify_va_arg): Likewise.
* config/i860/i860.c (i860_va_start, i860_va_arg): Likewise.
* config/iq2000/iq2000.c (iq2000_va_arg): Likewise.
* config/mips/mips.c (mips_va_start, mips_va_arg): Likewise.
* config/rs6000/rs6000.c (rs6000_va_start, rs6000_gimplify_va_arg):
Likewise.
* config/s390/s390.c (s390_va_start, s390_gimplify_va_arg): Likewise.
* config/sh/sh.c (sh_va_start, sh_va_arg): Likewise.
* config/stormy16/stormy16.c (xstormy1_expand_builin_va_start):
Likewise.
(xstormy16_expand_builtin_va_arg): Likewise.
* config/xtensa/xtensa.c (xtensa_va_start, xtensa_va_arg): Likewise.
* cp/call.c (build_vfield_ref): Add new operand for COMPONENT_REF.
(build_new_method_call): Likewise.
* cp/decl.c (local_variable_p_walkfn): Don't walk into types.
* cp/decl2.c (grok_array_decl): Add new operands for ARRAY_REF.
(build_anon_union_vars): Add new operand for COMPONENT_REF.
* cp/init.c (buld_new): Add new operand for ARRAY_REF.
* cp/method.c (do_build_copy_constructor): New op for COMPONENT_REF.
(do_build_assign_ref): Likewise.
* cp/parser.c (cp_parser_direct_new_declarator): Add new operands
for ARRAY_REF.
(cp_parser_direct_declarator): Likewise.
* cp/pt.c (tsubst): Likewise.
(tsubst_copy, tsubst_copy_and_build): Likewise; also add new operand
for COMPONENT_REF.
* cp/semantics.c (finish_non_static_data_member): Add new operand
for COMPONENT_REF.
* cp/typeck.c (build_class_member_access_expr): Likewise.
(build_class_member_access_expr, finish_class_member_access_expr):
Likewise.
(build_ptrmemfunc_access_expr): Likewise.
(build_array_ref): Add new operands for ARRAY_REF.
* cp/typeck2.c (split_nonconstant_init_1): Likewise; COMPONENT_REF too.
* cp/tree.c (count_trees_r, no_linkage_helper): Don't walk in types.
* fortran/f95-lang.c (LANG_HOOKS_GIMPLE_BEFORE_INLINING): Deleted.
* fortran/trans-array.c (gfc_conv_descriptor_data): Add operand
for COMPONENT_REF.
(gfc_conv_descriptor_offset, gfc_conv_descriptor_dtype): Likewise.
(gfc_conv_descriptor_dimension, gfc_conv_descriptor_stride): Likewise.
(gfc_conv_descriptor_lbound, gfc_conv_descriptor_ubound): Likewise.
* fortran/trans-common.c (create_common): Likewise.
* fortran/trans-expr.c (gfc_conv_component_ref): Likewise.
* fortran/trans-io.c (set_parameter_value): Likewise.
(set_parameter_ref, set_string, set_flag, io_result): Likewise.
(transfer_expr): Likewise.
* fortran/trans-decl.c (gfc_trans_auto_character_variable):
Set up to get DECL_SIZE and DECL_SIZE_UNIT gimplified.
(gfc_simplify_function): New function.
(gfc_generate_function-code): Properly handle nested functions.
* fortran/trans.c (gfc_build_array_ref): Add two new operands
for ARRAY_REF.
* java/class.c (build_class_ref): Add new operand for COMPONENT_REF.
(build_static_field_ref): Likewise and add new operands for ARRAY_REF.
* java/constants.c (build_ref_from_constant_pool): Likewise.
* java/expr.c (build_java_array_length_access): Likewise.
(build_get_class, build_field_ref, build_known_method_ref): Likewise.
(invoke_build_dtable, build_invokevirtual): Likewise.
(build_invokeinterface, java_expand_expr): Likewise.
(emit_init_test_initialization): Likewise.
* java/java-gimplify.c (java_gimplify_new_array_init): Likewise.
* java/parse.y (make_qualifed_name, build_array_ref): Likewise.
* objc/ojbc-act.c (generate_static_references): Add additional
operands to ARRAY_REF.
(generate_strings, build_method_prototype_list_template): Likewise.
(generate_protocol_list): Likewise.
From-SVN: r83474
2004-06-22 05:07:05 +02:00
|
|
|
|
DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", 'r', 4)
|
2001-06-04 15:21:38 +02:00
|
|
|
|
|
2004-06-23 02:26:04 +02:00
|
|
|
|
/* Used to represent lookup of runtime type dependent data. Often this is
|
|
|
|
|
a reference to a vtable, but it needn't be. Operands are:
|
|
|
|
|
OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use.
|
|
|
|
|
OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is
|
|
|
|
|
being performed. Through this the optimizers may be able to statically
|
|
|
|
|
determine the dynamic type of the object.
|
|
|
|
|
OBJ_TYPE_REF_TOKEN: Something front-end specific used to resolve the
|
|
|
|
|
reference to something simpler, usually to the address of a DECL.
|
|
|
|
|
Never touched by the middle-end. Good choices would be either an
|
|
|
|
|
identifier or a vtable index. */
|
|
|
|
|
DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", 'e', 3)
|
2001-10-11 20:48:42 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
/* The exception object from the runtime. */
|
|
|
|
|
DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", 'e', 0)
|
|
|
|
|
|
|
|
|
|
/* The filter object from the runtime. */
|
|
|
|
|
DEFTREECODE (FILTER_EXPR, "filter_expr", 'e', 0)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Constructor: return an aggregate value made from specified components.
|
|
|
|
|
In C, this is used only for structure and array initializers.
|
1996-01-20 02:40:09 +01:00
|
|
|
|
Also used for SET_TYPE in Chill (and potentially Pascal).
|
2003-04-28 22:02:28 +02:00
|
|
|
|
The operand is a list of component values made out of a chain of
|
|
|
|
|
TREE_LIST nodes.
|
1996-01-20 02:40:09 +01:00
|
|
|
|
|
|
|
|
|
For ARRAY_TYPE:
|
|
|
|
|
The TREE_PURPOSE of each node is the corresponding index.
|
|
|
|
|
If the TREE_PURPOSE is a RANGE_EXPR, it is a short-hand for many nodes,
|
|
|
|
|
one for each index in the range. (If the corresponding TREE_VALUE
|
|
|
|
|
has side-effects, they are evaluated once for each element. Wrap the
|
|
|
|
|
value in a SAVE_EXPR if you want to evaluate side effects only once.)
|
|
|
|
|
|
|
|
|
|
For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE:
|
|
|
|
|
The TREE_PURPOSE of each node is a FIELD_DECL.
|
|
|
|
|
|
|
|
|
|
For SET_TYPE:
|
|
|
|
|
The TREE_VALUE specifies a value (index) in the set that is true.
|
|
|
|
|
If TREE_PURPOSE is non-NULL, it specifies the lower limit of a
|
|
|
|
|
range of true values. Elements not listed are false (not in the set). */
|
2003-04-28 22:02:28 +02:00
|
|
|
|
DEFTREECODE (CONSTRUCTOR, "constructor", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1995-12-24 13:35:16 +01:00
|
|
|
|
/* The expression types are mostly straightforward, with the fourth argument
|
|
|
|
|
of DEFTREECODE saying how many operands there are.
|
|
|
|
|
Unless otherwise specified, the operands are expressions and the
|
|
|
|
|
types of all the operands and the expression must all be the same. */
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Contains two expressions to compute, one followed by the other.
|
1995-12-24 13:35:16 +01:00
|
|
|
|
the first value is ignored. The second one's value is used. The
|
|
|
|
|
type of the first expression need not agree with the other types. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (COMPOUND_EXPR, "compound_expr", 'e', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Assignment expression. Operand 0 is the what to set; 1, the new value. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (MODIFY_EXPR, "modify_expr", 'e', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Initialization expression. Operand 0 is the variable to initialize;
|
|
|
|
|
Operand 1 is the initializer. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (INIT_EXPR, "init_expr", 'e', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* For TARGET_EXPR, operand 0 is the target of an initialization,
|
2004-06-18 00:35:55 +02:00
|
|
|
|
operand 1 is the initializer for the target, which may be void
|
2004-06-18 04:59:16 +02:00
|
|
|
|
if simply expanding it initializes the target.
|
2004-06-18 00:35:55 +02:00
|
|
|
|
operand 2 is the cleanup for this node, if any.
|
|
|
|
|
operand 3 is the saved initializer after this node has been
|
|
|
|
|
expanded once; this is so we can re-expand the tree later. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (TARGET_EXPR, "target_expr", 'e', 4)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Conditional expression ( ... ? ... : ... in C).
|
|
|
|
|
Operand 0 is the condition.
|
|
|
|
|
Operand 1 is the then-value.
|
1995-12-24 13:35:16 +01:00
|
|
|
|
Operand 2 is the else-value.
|
2001-02-18 07:53:19 +01:00
|
|
|
|
Operand 0 may be of any type.
|
|
|
|
|
Operand 1 must have the same type as the entire expression, unless
|
|
|
|
|
it unconditionally throws an exception, in which case it should
|
|
|
|
|
have VOID_TYPE. The same constraints apply to operand 2. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (COND_EXPR, "cond_expr", 'e', 3)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Declare local variables, including making RTL and allocating space.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables.
|
|
|
|
|
BIND_EXPR_BODY is the body, the expression to be computed using
|
1992-11-13 02:55:58 +01:00
|
|
|
|
the variables. The value of operand 1 becomes that of the BIND_EXPR.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings
|
1992-11-13 02:55:58 +01:00
|
|
|
|
for debugging purposes. If this BIND_EXPR is actually expanded,
|
|
|
|
|
that sets the TREE_USED flag in the BLOCK.
|
|
|
|
|
|
|
|
|
|
The BIND_EXPR is not responsible for informing parsers
|
|
|
|
|
about these variables. If the body is coming from the input file,
|
|
|
|
|
then the code that creates the BIND_EXPR is also responsible for
|
|
|
|
|
informing the parser of the variables.
|
|
|
|
|
|
|
|
|
|
If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
|
|
|
|
|
This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
|
|
|
|
|
If the BIND_EXPR should be output for debugging but will not be expanded,
|
|
|
|
|
set the TREE_USED flag by hand.
|
|
|
|
|
|
|
|
|
|
In order for the BIND_EXPR to be known at all, the code that creates it
|
|
|
|
|
must also install it as a subblock in the tree of BLOCK
|
|
|
|
|
nodes for the function. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (BIND_EXPR, "bind_expr", 'e', 3)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
/* A labeled block. Operand 0 is the label that will be generated to
|
|
|
|
|
mark the end of the block.
|
|
|
|
|
Operand 1 is the labeled block body. */
|
|
|
|
|
DEFTREECODE (LABELED_BLOCK_EXPR, "labeled_block_expr", 'e', 2)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Function call. Operand 0 is the function.
|
|
|
|
|
Operand 1 is the argument list, a list of expressions
|
2004-05-13 08:41:07 +02:00
|
|
|
|
made out of a chain of TREE_LIST nodes.
|
|
|
|
|
Operand 2 is the static chain argument, or NULL. */
|
|
|
|
|
DEFTREECODE (CALL_EXPR, "call_expr", 'e', 3)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Specify a value to compute along with its corresponding cleanup.
|
except.c (expand_eh_region_start, [...]): Remove.
* except.c (expand_eh_region_start, expand_eh_region_end,
expand_eh_handler, expand_eh_region_end_cleanup,
expand_start_all_catch, expand_start_catch, expand_end_catch,
expand_end_all_catch, expand_eh_region_end_allowed,
expand_eh_region_end_must_not_throw, expand_eh_region_end_throw,
expand_eh_region_end_fixup): Remove.
* stmt.c (struct nesting): Remove stack_level, innermost_stack_block,
cleanups, outer_cleanups, label_chain, exception_region.
(struct goto_fixup): Remove stack_level, cleanup_list_list.
(struct label_chain): Remove.
(struct stmt_status): Remove x_stack_block_stack.
(stack_block_stack, expand_goto_internal, expand_fixup, expand_fixups,
fixup_gotos, save_stack_pointer, expand_decl_cleanup,
expand_decl_cleanup_eh, expand_cleanups, start_cleanup_deferral,
end_cleanup_deferral, last_cleanup_this_contour,
containing_blocks_have_cleanups_or_stack_level,
any_pending_cleanups): Remove.
(expand_null_return_1): Take no arguments.
(expand_label, expand_naked_return, expand_return,
expand_start_bindings_and_block, expand_end_bindings, expand_decl,
expand_anon_union_decl, expand_start_case, pushcase, pushcase_range,
expand_end_case_type): Don't use any of them.
* calls.c (expand_call): Likewise.
* dojump.c (do_jump): Likewise.
* function.c (expand_function_end): Likewise.
* expr.c (store_expr, expand_expr_real_1): Likewise.
(safe_from_p): Don't handle WITH_CLEANUP_EXPR, CLEANUP_POINT_EXPR.
(expand_expr_real_1): Don't handle WITH_CLEANUP_EXPR,
CLEANUP_POINT_EXPR, TARGET_EXPR, TRY_CATCH_EXPR, CATCH_EXPR,
EH_FILTER_EXPR, TRY_FINALLY_EXPR, GOTO_SUBROUTINE_EXPR.
* fold-const.c (fold_checksum_tree): Use first_rtl_op.
* gengtype.c (adjust_field_tree_exp): Remove rtl op handling.
* gimplify.c (gimplify_cleanup_point_expr): Renumber operands
for WITH_CLEANUP_EXPR.
(gimple_push_cleanup): Likewise.
* integrate.c (copy_decl_for_inlining): Don't DECL_TOO_LATE.
* print-tree.c (print_node): Likewise.
* tree-pretty-print.c (dump_generic_node): Remove GOTO_SUBROUTINE_EXPR.
* tree.c (first_rtl_op): Always just TREE_CODE_LENGTH.
(has_cleanups): Remove GOTO_SUBROUTINE_EXPR.
* tree.def (WITH_CLEANUP_EXPR): Remove op1 and op2.
(GOTO_SUBROUTINE_EXPR): Remove.
* tree.h (WITH_CLEANUP_EXPR_RTL): Remove.
(DECL_TOO_LATE): Remove.
* except.h, tree.h: Update decls.
ada/
* trans.c (gnat_to_gnu <N_Handled_Sequence_Of_Statements>): Update
commentary.
cp/
* cp-tree.h (expand_eh_spec_block): Remove.
java/
* expr.c (case_identity, get_primitive_array_vtable,
java_expand_expr, emit_init_test_initialization): Remove.
* java-tree.h (java_expand_expr): Remove.
* lang.c (LANG_HOOKS_EXPAND_EXPR): Remove.
From-SVN: r84275
2004-07-08 09:46:07 +02:00
|
|
|
|
Operand 0 is the cleanup expression.
|
|
|
|
|
The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR,
|
|
|
|
|
which must exist. This differs from TRY_CATCH_EXPR in that operand 1
|
|
|
|
|
is always evaluated when cleanups are run. */
|
|
|
|
|
DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", 'e', 1)
|
1994-05-13 02:19:57 +02:00
|
|
|
|
|
|
|
|
|
/* Specify a cleanup point.
|
1995-03-03 04:45:02 +01:00
|
|
|
|
Operand 0 is an expression that may have cleanups. If it does, those
|
|
|
|
|
cleanups are executed after the expression is expanded.
|
|
|
|
|
|
|
|
|
|
Note that if the expression is a reference to storage, it is forced out
|
|
|
|
|
of memory before the cleanups are run. This is necessary to handle
|
|
|
|
|
cases where the cleanups modify the storage referenced; in the
|
|
|
|
|
expression 't.i', if 't' is a struct with an integer member 'i' and a
|
|
|
|
|
cleanup which modifies 'i', the value of the expression depends on
|
|
|
|
|
whether the cleanup is run before or after 't.i' is evaluated. When
|
|
|
|
|
expand_expr is run on 't.i', it returns a MEM. This is not good enough;
|
|
|
|
|
the value of 't.i' must be forced out of memory.
|
|
|
|
|
|
|
|
|
|
As a consequence, the operand of a CLEANUP_POINT_EXPR must not have
|
|
|
|
|
BLKmode, because it will not be forced out of memory. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1993-10-04 02:45:02 +01:00
|
|
|
|
/* The following two codes are used in languages that have types where
|
1999-10-28 13:39:31 +02:00
|
|
|
|
some field in an object of the type contains a value that is used in
|
|
|
|
|
the computation of another field's offset or size and/or the size of
|
|
|
|
|
the type. The positions and/or sizes of fields can vary from object
|
2003-12-05 11:36:22 +01:00
|
|
|
|
to object of the same type or even for one and the same object within
|
|
|
|
|
its scope.
|
1999-10-28 13:39:31 +02:00
|
|
|
|
|
|
|
|
|
Record types with discriminants in Ada or schema types in Pascal are
|
|
|
|
|
examples of such types. This mechanism is also used to create "fat
|
|
|
|
|
pointers" for unconstrained array types in Ada; the fat pointer is a
|
|
|
|
|
structure one of whose fields is a pointer to the actual array type
|
|
|
|
|
and the other field is a pointer to a template, which is a structure
|
|
|
|
|
containing the bounds of the array. The bounds in the type pointed
|
|
|
|
|
to by the first field in the fat pointer refer to the values in the
|
|
|
|
|
template.
|
|
|
|
|
|
|
|
|
|
When you wish to construct such a type you need "self-references"
|
|
|
|
|
that allow you to reference the object having this type from the
|
|
|
|
|
TYPE node, i.e. without having a variable instantiating this type.
|
|
|
|
|
|
|
|
|
|
Such a "self-references" is done using a PLACEHOLDER_EXPR. This is
|
|
|
|
|
a node that will later be replaced with the object being referenced.
|
|
|
|
|
Its type is that of the object and selects which object to use from
|
|
|
|
|
a chain of references (see below). No other slots are used in the
|
|
|
|
|
PLACEHOLDER_EXPR.
|
|
|
|
|
|
|
|
|
|
For example, if your type FOO is a RECORD_TYPE with a field BAR,
|
|
|
|
|
and you need the value of <variable>.BAR to calculate TYPE_SIZE
|
|
|
|
|
(FOO), just substitute <variable> above with a PLACEHOLDER_EXPR
|
2003-12-05 11:36:22 +01:00
|
|
|
|
whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with
|
|
|
|
|
the PLACEHOLDER_EXPR as the first operand (which has the correct
|
|
|
|
|
type). Later, when the size is needed in the program, the back-end
|
|
|
|
|
will find this PLACEHOLDER_EXPR and generate code to calculate the
|
|
|
|
|
actual size at run-time. In the following, we describe how this
|
|
|
|
|
calculation is done.
|
|
|
|
|
|
alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* emit-rtl.c (component_ref_for_mem_expr): Likewise.
(set_mem_attributes_minus_bitpos): Call SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* explow.c (expr_size): Likewise.
* expr.h (placeholder_list, find_placeholder): Deleted.
* expr.c (store_constructor): Likewise.
(get_inner_reference): Likewise. Also don't call find_placeholder.
(placeholder_list, find_placeholder): Deleted.
(is_aligning_offset): Don't handle WITH_RECORD_EXPR, PLACEHOLDER_EXPR.
(expand_expr_real, cases PLACEHOLDER_EXPR, WITH_RECORD_EXPR): Likewise.
(highest_pow2_factor, case WITH_RECORD_EXPR): Remove.
* dojump.c (do_jump, case WITH_RECORD_EXPR): Likewise.
* dwarf2out.c (loc_descriptor_from_tree, case WITH_RECORD_EXPR):
Likewise.
* fold-const.c (invert_truthvalue, case WITH_RECORD_EXPR): Likewise.
(extract_muldiv, case WITH_RECORD_EXPR): Likewise.
* tree.c (expr_align, case WITH_RECORD_EXPR): Likewise.
(contains_placeholder_p): Don't handle WITH_RECORD_EXPR.
Clean up by using first_rtl_op.
(substitute_in_expr): Use SUBSTITUTE_IN_EXPR for recursive call.
(substitute_placeholder_in_expr): New function.
* tree.def (WITH_RECORD_EXPR): Deleted.
* tree.h (SUBSTITUTE_IN_EXPR, SUBSTITUTE_PLACEHOLDER_IN_EXPR): New.
(substitute_placeholder_in_expr): New.
* ada/decl.c (gnat_to_gnu_entity): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* ada/trans.c (tree_transform, emit_index_check): Likewise.
* ada/utils.c (build_template): Likewise.
(max_size, convert): Remove handling of WITH_RECORD_EXPR.
(maybe_unconstrained_array, unchecked_convert): Likewise.
* ada/utils2.c (gnat_truthvalue_conversion, build_binary_op): Likewise.
(build_unary_op): Likewise.
(compare_arrays, build_allocator): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
(fill_vms_descriptor): Likewise.
(build_call_alloc_dealloc): Likewise.
ALIGN is unsigned.
* ada/gigi.h (build_call_alloc_dealloc): Alignment is unsigned.
From-SVN: r79789
2004-03-21 19:09:20 +01:00
|
|
|
|
When we wish to evaluate a size or offset, we check whether it contains a
|
|
|
|
|
PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr
|
|
|
|
|
passing both that tree and an expression within which the object may be
|
|
|
|
|
found. The latter expression is the object itself in the simple case of
|
|
|
|
|
an Ada record with discriminant, but it can be the array in the case of an
|
|
|
|
|
unconstrained array.
|
1999-10-28 13:39:31 +02:00
|
|
|
|
|
|
|
|
|
In the latter case, we need the fat pointer, because the bounds of
|
|
|
|
|
the array can only be accessed from it. However, we rely here on the
|
|
|
|
|
fact that the expression for the array contains the dereference of
|
alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* emit-rtl.c (component_ref_for_mem_expr): Likewise.
(set_mem_attributes_minus_bitpos): Call SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* explow.c (expr_size): Likewise.
* expr.h (placeholder_list, find_placeholder): Deleted.
* expr.c (store_constructor): Likewise.
(get_inner_reference): Likewise. Also don't call find_placeholder.
(placeholder_list, find_placeholder): Deleted.
(is_aligning_offset): Don't handle WITH_RECORD_EXPR, PLACEHOLDER_EXPR.
(expand_expr_real, cases PLACEHOLDER_EXPR, WITH_RECORD_EXPR): Likewise.
(highest_pow2_factor, case WITH_RECORD_EXPR): Remove.
* dojump.c (do_jump, case WITH_RECORD_EXPR): Likewise.
* dwarf2out.c (loc_descriptor_from_tree, case WITH_RECORD_EXPR):
Likewise.
* fold-const.c (invert_truthvalue, case WITH_RECORD_EXPR): Likewise.
(extract_muldiv, case WITH_RECORD_EXPR): Likewise.
* tree.c (expr_align, case WITH_RECORD_EXPR): Likewise.
(contains_placeholder_p): Don't handle WITH_RECORD_EXPR.
Clean up by using first_rtl_op.
(substitute_in_expr): Use SUBSTITUTE_IN_EXPR for recursive call.
(substitute_placeholder_in_expr): New function.
* tree.def (WITH_RECORD_EXPR): Deleted.
* tree.h (SUBSTITUTE_IN_EXPR, SUBSTITUTE_PLACEHOLDER_IN_EXPR): New.
(substitute_placeholder_in_expr): New.
* ada/decl.c (gnat_to_gnu_entity): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* ada/trans.c (tree_transform, emit_index_check): Likewise.
* ada/utils.c (build_template): Likewise.
(max_size, convert): Remove handling of WITH_RECORD_EXPR.
(maybe_unconstrained_array, unchecked_convert): Likewise.
* ada/utils2.c (gnat_truthvalue_conversion, build_binary_op): Likewise.
(build_unary_op): Likewise.
(compare_arrays, build_allocator): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
(fill_vms_descriptor): Likewise.
(build_call_alloc_dealloc): Likewise.
ALIGN is unsigned.
* ada/gigi.h (build_call_alloc_dealloc): Alignment is unsigned.
From-SVN: r79789
2004-03-21 19:09:20 +01:00
|
|
|
|
the fat pointer that obtained the array pointer. */
|
1993-10-04 02:45:02 +01:00
|
|
|
|
|
2004-03-25 18:04:45 +01:00
|
|
|
|
/* Denotes a record to later be substituted before evaluating this expression.
|
alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* alias.c (get_alias_set): Remove handling of PLACEHOLDER_EXPR.
* emit-rtl.c (component_ref_for_mem_expr): Likewise.
(set_mem_attributes_minus_bitpos): Call SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* explow.c (expr_size): Likewise.
* expr.h (placeholder_list, find_placeholder): Deleted.
* expr.c (store_constructor): Likewise.
(get_inner_reference): Likewise. Also don't call find_placeholder.
(placeholder_list, find_placeholder): Deleted.
(is_aligning_offset): Don't handle WITH_RECORD_EXPR, PLACEHOLDER_EXPR.
(expand_expr_real, cases PLACEHOLDER_EXPR, WITH_RECORD_EXPR): Likewise.
(highest_pow2_factor, case WITH_RECORD_EXPR): Remove.
* dojump.c (do_jump, case WITH_RECORD_EXPR): Likewise.
* dwarf2out.c (loc_descriptor_from_tree, case WITH_RECORD_EXPR):
Likewise.
* fold-const.c (invert_truthvalue, case WITH_RECORD_EXPR): Likewise.
(extract_muldiv, case WITH_RECORD_EXPR): Likewise.
* tree.c (expr_align, case WITH_RECORD_EXPR): Likewise.
(contains_placeholder_p): Don't handle WITH_RECORD_EXPR.
Clean up by using first_rtl_op.
(substitute_in_expr): Use SUBSTITUTE_IN_EXPR for recursive call.
(substitute_placeholder_in_expr): New function.
* tree.def (WITH_RECORD_EXPR): Deleted.
* tree.h (SUBSTITUTE_IN_EXPR, SUBSTITUTE_PLACEHOLDER_IN_EXPR): New.
(substitute_placeholder_in_expr): New.
* ada/decl.c (gnat_to_gnu_entity): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
* ada/trans.c (tree_transform, emit_index_check): Likewise.
* ada/utils.c (build_template): Likewise.
(max_size, convert): Remove handling of WITH_RECORD_EXPR.
(maybe_unconstrained_array, unchecked_convert): Likewise.
* ada/utils2.c (gnat_truthvalue_conversion, build_binary_op): Likewise.
(build_unary_op): Likewise.
(compare_arrays, build_allocator): Use SUBSTITUTE_PLACEHOLDER_IN_EXPR.
(fill_vms_descriptor): Likewise.
(build_call_alloc_dealloc): Likewise.
ALIGN is unsigned.
* ada/gigi.h (build_call_alloc_dealloc): Alignment is unsigned.
From-SVN: r79789
2004-03-21 19:09:20 +01:00
|
|
|
|
The type of this expression is used to find the record to replace it. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", 'x', 0)
|
1993-10-04 02:45:02 +01:00
|
|
|
|
|
1995-12-24 13:35:16 +01:00
|
|
|
|
/* Simple arithmetic. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (PLUS_EXPR, "plus_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (MINUS_EXPR, "minus_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (MULT_EXPR, "mult_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Division for integer result that rounds the quotient toward zero. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Division for integer result that rounds the quotient toward infinity. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Division for integer result that rounds toward minus infinity. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Division for integer result that rounds toward nearest integer. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Four kinds of remainder that go with the four kinds of division. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1995-12-24 13:35:16 +01:00
|
|
|
|
/* Division for real result. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (RDIV_EXPR, "rdiv_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Division which is not supposed to need rounding.
|
|
|
|
|
Used for pointer subtraction in C. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Conversion of real to fixed point: four ways to round,
|
|
|
|
|
like the four ways to divide.
|
|
|
|
|
CONVERT_EXPR can also be used to convert a real to an integer,
|
|
|
|
|
and that is what is used in languages that do not have ways of
|
|
|
|
|
specifying which of these is wanted. Maybe these are not needed. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", '1', 1)
|
|
|
|
|
DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", '1', 1)
|
|
|
|
|
DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", '1', 1)
|
|
|
|
|
DEFTREECODE (FIX_ROUND_EXPR, "fix_round_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Conversion of an integer to a real. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (FLOAT_EXPR, "float_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1995-12-24 13:35:16 +01:00
|
|
|
|
/* Unary negation. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (NEGATE_EXPR, "negate_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (MIN_EXPR, "min_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (MAX_EXPR, "max_expr", '2', 2)
|
2001-03-19 19:53:04 +01:00
|
|
|
|
|
|
|
|
|
/* Represents the absolute value of the operand.
|
|
|
|
|
|
|
|
|
|
An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The
|
|
|
|
|
operand of the ABS_EXPR must have the same type. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ABS_EXPR, "abs_expr", '1', 1)
|
2001-03-19 19:53:04 +01:00
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Shift operations for shift and rotate.
|
2000-04-10 18:18:21 +02:00
|
|
|
|
Shift means logical shift if done on an
|
|
|
|
|
unsigned type, arithmetic shift if done on a signed type.
|
1992-11-13 02:55:58 +01:00
|
|
|
|
The second operand is the number of bits to
|
2001-07-19 20:33:30 +02:00
|
|
|
|
shift by; it need not be the same type as the first operand and result.
|
|
|
|
|
Note that the result is undefined if the second operand is larger
|
|
|
|
|
than the first operand's type size. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (LSHIFT_EXPR, "lshift_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (RSHIFT_EXPR, "rshift_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (LROTATE_EXPR, "lrotate_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (RROTATE_EXPR, "rrotate_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Bitwise operations. Operands have same mode as result. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", '2', 2)
|
|
|
|
|
DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2001-01-02 19:15:18 +01:00
|
|
|
|
/* ANDIF and ORIF allow the second operand not to be computed if the
|
|
|
|
|
value of the expression is determined from the first operand. AND,
|
|
|
|
|
OR, and XOR always compute the second operand whether its value is
|
|
|
|
|
needed or not (for side effects). The operand may have
|
|
|
|
|
BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be
|
|
|
|
|
either zero or one. For example, a TRUTH_NOT_EXPR will never have
|
2002-05-25 22:18:41 +02:00
|
|
|
|
an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be
|
2001-01-02 19:15:18 +01:00
|
|
|
|
used to compare the VAR_DECL to zero, thereby obtaining a node with
|
|
|
|
|
value zero or one. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Relational operators.
|
|
|
|
|
`EQ_EXPR' and `NE_EXPR' are allowed for any types.
|
|
|
|
|
The others are allowed only for integer (or pointer or enumeral)
|
|
|
|
|
or real types.
|
|
|
|
|
In all cases the operands will have the same type,
|
|
|
|
|
and the value is always the type used by the language for booleans. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (LT_EXPR, "lt_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (LE_EXPR, "le_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (GT_EXPR, "gt_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (GE_EXPR, "ge_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (EQ_EXPR, "eq_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (NE_EXPR, "ne_expr", '<', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2000-01-24 21:10:04 +01:00
|
|
|
|
/* Additional relational operators for floating point unordered. */
|
|
|
|
|
DEFTREECODE (UNORDERED_EXPR, "unordered_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (ORDERED_EXPR, "ordered_expr", '<', 2)
|
|
|
|
|
|
2002-09-29 15:16:44 +02:00
|
|
|
|
/* These are equivalent to unordered or ... */
|
2000-01-24 21:10:04 +01:00
|
|
|
|
DEFTREECODE (UNLT_EXPR, "unlt_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (UNLE_EXPR, "unle_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (UNGT_EXPR, "ungt_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (UNGE_EXPR, "unge_expr", '<', 2)
|
|
|
|
|
DEFTREECODE (UNEQ_EXPR, "uneq_expr", '<', 2)
|
|
|
|
|
|
re PR rtl-optimization/15649 (ICE with __builtin_isgreater and -ffast-math)
gcc/ChangeLog:
2004-05-27 Paolo Bonzini <bonzini@gnu.org>
Roger Sayle <roger@eyesopen.com>
PR rtl-optimization/15649
Add LTGT_EXPR and improve pretty-printing of unordered
comparisons.
* c-common.c (c_common_truthvalue_conversion):
Handle LTGT_EXPR.
* c-typeck.c (build_binary_op): Likewise.
* dojump.c (do_jump): Likewise.
* expr.c (expand_expr_real_1, do_store_flag): Likewise.
* predict.c (tree_predict_by_opcode): Likewise.
* real.c (real_compare): Likewise.
* tree-cfg.c (verify_expr): Likewise.
* tree-inline.c (estimate_num_insns_1): Likewise.
* tree-pretty-print.c (dump_generic_node): Likewise.
Handle ORDERED_EXPR, UNORDERED_EXPR.
(op_symbol): Print unordered comparisons differently
than ordered ones.
* tree.def (LTGT_EXPR): New '<' tree code.
* doc/c-tree.texi (Expressions): Document floating-point
comparison nodes.
Fold comparisons between floating point values.
* fold-const.c (enum comparison_code): New, from
#define'd constants. Define compcodes for unordered
comparisons and for invalid transformations.
(invert_tree_comparison): Add "honor_nans" parameter.
(fold_truthop): Revamp to work on floating-point types too.
(comparison_to_compcode): Support unordered comparisons.
Use new enum comparison_code.
(compcode_to_comparison): Likewise.
(combine_compcodes): New function.
(invert_truthvalue): Let invert_tree_comparison decide
whether it is valid to fold the comparison. Fold ORDERED
and UNORDERED even if flag_unsafe_math_optimizations is off,
and the remaining even if flag_unsafe_math_optimizations
is off but we are under -fno-trapping-math.
(fold_relational_const): Integer modes do not honor NaNs.
gcc/testsuite/ChangeLog:
2004-05-27 Paolo Bonzini <bonzini@gnu.org>
* gcc.c-torture/compare-fp-1.c, gcc.c-torture/compare-fp-2.c,
gcc.c-torture/compare-fp-3.c, gcc.c-torture/compare-fp-4.c,
gcc.c-torture/compare-fp-3.x, gcc.c-torture/compare-fp-4.x,
gcc.c-torture/pr15649-1.c: New.
Co-Authored-By: Roger Sayle <roger@eyesopen.com>
From-SVN: r82365
2004-05-28 18:37:08 +02:00
|
|
|
|
/* This is the reverse of uneq_expr. */
|
|
|
|
|
DEFTREECODE (LTGT_EXPR, "ltgt_expr", '<', 2)
|
|
|
|
|
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (RANGE_EXPR, "range_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Represents a conversion of type of a value.
|
|
|
|
|
All conversions, including implicit ones, must be
|
1995-12-24 13:35:16 +01:00
|
|
|
|
represented by CONVERT_EXPR or NOP_EXPR nodes. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (CONVERT_EXPR, "convert_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Represents a conversion expected to require no code to be generated. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (NOP_EXPR, "nop_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Value is same as argument, but guaranteed not an lvalue. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2001-11-19 21:38:07 +01:00
|
|
|
|
/* Represents viewing something of one type as being of a second type.
|
|
|
|
|
This corresponds to an "Unchecked Conversion" in Ada and roughly to
|
|
|
|
|
the idiom *(type2 *)&X in C. The only operand is the value to be
|
|
|
|
|
viewed as being of another type. It is undefined if the type of the
|
2001-11-22 00:32:03 +01:00
|
|
|
|
input and of the expression have different sizes.
|
|
|
|
|
|
|
|
|
|
This code may also be used within the LHS of a MODIFY_EXPR, in which
|
|
|
|
|
case no actual data motion may occur. TREE_ADDRESSABLE will be set in
|
|
|
|
|
this case and GCC must abort if it could not do the operation without
|
|
|
|
|
generating insns. */
|
2004-07-24 03:35:04 +02:00
|
|
|
|
DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", 'r', 1)
|
2001-11-19 21:38:07 +01:00
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Represents something we computed once and will use multiple times.
|
2004-07-03 02:15:50 +02:00
|
|
|
|
First operand is that expression. After it is evaluated once, it
|
|
|
|
|
will be replaced by the temporary variable that holds the value. */
|
|
|
|
|
DEFTREECODE (SAVE_EXPR, "save_expr", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1996-05-17 22:13:01 +02:00
|
|
|
|
/* For a UNSAVE_EXPR, operand 0 is the value to unsave. By unsave, we
|
tree.def (RTL_EXPR): Remove.
* tree.def (RTL_EXPR): Remove.
* c-typeck.c (lvalue_p): Don't handle it.
* expr.c (safe_from_p): Likewise.
(expand_expr_real_1): Likewise.
* fold-const.c (non_lvalue, operand_equal_p, fold): Likewise.
(fold_checksum_tree, tree_expr_nonnegative_p): Likewise.
* gengtype.c (adjust_field_tree_exp): Likewise.
* stmt.c (warn_if_unused_value): Likewise.
* tree-gimple.c (recalculate_side_effects): Likewise.
* tree-pretty-print.c (dump_generic_node): Likewise.
* tree.c (make_node_stat, first_rtl_op, unsave_expr_1): Likewise.
(unsafe_for_reeval, stabilize_reference, build1_stat): Likewise.
* tree.h (RTL_EXPR_SEQUENCE, RTL_EXPR_RTL, RTL_EXPR_ALT_RTL): Remove.
* stmt.c (struct stmt_status): Remove x_last_expr_type,
x_last_expr_value, x_last_expr_alt_rtl, x_expr_stmts_for_value.
(last_expr_type, last_expr_value, last_expr_alt_rtl): Remove.
(expand_expr_stmt): Merge with expand_expr_stmt_value. Remove
all the bits that tracked last_expr.
(expand_end_bindings): Don't track last_expr.
(expand_start_stmt_expr, expand_end_stmt_expr): Remove.
(clear_last_expr): Remove.
(expand_asm): Don't call it.
(expand_asm_operands, expand_end_cond): Likewise.
(expand_naked_return, expand_null_return_1): Likewise.
* c-typeck.c (c_begin_compound_stmt): Likewise.
* cfgexpand.c (expand_block): Use expand_expr_stmt.
* expr.c (expand_expr_real_1): Likewise.
* tree.h: Update prototypes.
* function.h (struct sequence_stack): Remove sequence_rtl_expr.
(struct emit_status): Remove sequence_rtl_expr.
(struct function): Remove x_rtl_expr_chain.
(seq_rtl_expr, rtl_expr_chain): Remove.
* function.c (struct temp_slot): Remove rtl_expr.
(assign_stack_temp_for_type): Don't set it.
(free_temp_slots, pop_temp_slots): Don't check it.
(free_after_compilation): Don't clear x_rtl_expr_chain.
(fixup_var_refs): Don't search it.
(preserve_rtl_expr_result, free_temps_for_rtl_expr): Remove.
* emit-rtl.c (start_sequence): Don't use sequence_rtl_expr
or seq_rtl_expr.
(push_topmost_sequence): Likewise.
(end_sequence, init_emit): Likewise.
(start_sequence_for_rtl_expr): Remove.
* expmed.c (make_tree): Build a VAR_DECL instead of an RTL_EXPR.
* rtl.h (preserve_rtl_expr_result): Remove.
ada/
* trans.c (gnat_stabilize_reference): Don't handle RTL_EXPR.
* utils.c (max_size): Likewise.
cp/
* class.c (fixed_type_or_null): Don't handle RTL_EXPR.
* method.c (synthesize_method): Don't clear_last_expr.
* name-lookup.c (maybe_push_cleanup_level): Likewise.
From-SVN: r84009
2004-07-02 03:15:43 +02:00
|
|
|
|
mean that all _EXPRs such as TARGET_EXPRs, SAVE_EXPRs, CALL_EXPRs,
|
|
|
|
|
that are protected from being evaluated more than once should be
|
|
|
|
|
reset so that a new expand_expr call of this expr will cause those
|
|
|
|
|
to be re-evaluated. This is useful when we want to reuse a tree in
|
|
|
|
|
different places, but where we must re-expand. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (UNSAVE_EXPR, "unsave_expr", 'e', 1)
|
1996-05-17 22:13:01 +02:00
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* & in C. Value is the address at which the operand's value resides.
|
|
|
|
|
Operand may have any mode. Result mode is Pmode. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ADDR_EXPR, "addr_expr", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Operand is a function constant; result is a function variable value
|
2001-09-21 18:58:22 +02:00
|
|
|
|
of type EPmode. Used only for languages that need static chains. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (ENTRY_VALUE_EXPR, "entry_value_expr", 'e', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
2001-09-21 18:58:22 +02:00
|
|
|
|
/* Operand0 is a function constant; result is part N of a function
|
|
|
|
|
descriptor of type ptr_mode. */
|
|
|
|
|
DEFTREECODE (FDESC_EXPR, "fdesc_expr", 'e', 2)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* Given two real or integer operands of the same type,
|
|
|
|
|
returns a complex value of the corresponding complex type. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (COMPLEX_EXPR, "complex_expr", '2', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1995-12-24 13:35:16 +01:00
|
|
|
|
/* Complex conjugate of operand. Used only on complex types. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (CONJ_EXPR, "conj_expr", '1', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Used only on an operand of complex type, these return
|
|
|
|
|
a value of the corresponding component type. */
|
2004-06-29 00:26:24 +02:00
|
|
|
|
DEFTREECODE (REALPART_EXPR, "realpart_expr", 'r', 1)
|
|
|
|
|
DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", 'r', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Nodes for ++ and -- in C.
|
|
|
|
|
The second arg is how much to increment or decrement by.
|
|
|
|
|
For a pointer, it would be the size of the object pointed to. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", 'e', 2)
|
|
|
|
|
DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", 'e', 2)
|
1997-04-23 22:04:25 +02:00
|
|
|
|
|
builtins.c (expand_builtin_saveregs): Remove static, remove exp and ignore arguments, bail if no EXPAND_BUILTIN_SAVEREGS.
* builtins.c (expand_builtin_saveregs): Remove static, remove exp
and ignore arguments, bail if no EXPAND_BUILTIN_SAVEREGS.
(expand_builtin_next_arg): Accept ARGLIST not EXP.
(stabilize_va_list): New function.
(std_expand_builtin_va_start): New function.
(expand_builtin_va_start): New function.
(get_varargs_alias_set): New function.
(std_expand_builtin_va_arg): New function.
(expand_builtin_va_arg): New function.
(expand_builtin_va_end): New function.
(expand_builtin_va_copy): New function.
(expand_builtin): Call them.
* c-common.c (c_common_nodes_and_builtins): Build __builtin_va_list,
__builtin_{varargs_start,stdarg_start,end,copy}.
(build_va_arg): New function.
* c-common.h (CTI_PTR_TYPE, ptr_type_node): Delete.
(build_va_arg): Declare.
* c-decl.c (ptr_type_node, va_list_type_node): New.
* c-parse.gperf (__builtin_va_arg): New.
* c-parse.in (VA_ARG): New token.
(unary_expr): Recognize it.
* expr.c (expand_expr): Expand VA_ARG_EXPR.
* expr.h (std_expand_builtin_va_start): Declare.
(std_expand_builtin_va_arg): Declare.
(expand_builtin_va_arg): Declare.
(get_varargs_alias_set): Declare.
* tree.def (VA_ARG_EXPR): New.
* tree.h (BUILT_IN_VARARGS_START): New.
(BUILT_IN_STDARG_START, BUILT_IN_VA_END): New.
(ptr_type_node, va_list_type_node): Declare.
* tm.texi (EXPAND_BUILTIN_SAVEREGS): Kill unused ARGLIST argument.
* m32r.h (EXPAND_BUILTIN_SAVEREGS): Likewise.
* m88k.h, m88k.c: Likewise.
* mn10300.h, mn10300.c: Likewise.
* pa.h, pa.c: Likewise.
* rs6000.h, rs6000.c: Likewise.
* sh.h, sh.c: Likewise.
* sparc.h, sparc.c: Likewise.
* emit-rtl.c (operand_subword): Copy alias set.
(change_address): Likewise.
From-SVN: r28243
1999-07-26 03:21:03 +02:00
|
|
|
|
/* Used to implement `va_arg'. */
|
|
|
|
|
DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", 'e', 1)
|
|
|
|
|
|
1997-12-07 01:31:01 +01:00
|
|
|
|
/* Evaluate operand 1. If and only if an exception is thrown during
|
1997-04-23 22:04:25 +02:00
|
|
|
|
the evaluation of operand 1, evaluate operand 2.
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
This differs from TRY_FINALLY_EXPR in that operand 2 is not evaluated
|
|
|
|
|
on a normal or jump exit, only on an exception. */
|
2004-06-23 02:26:04 +02:00
|
|
|
|
DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", 's', 2)
|
1997-04-23 22:04:25 +02:00
|
|
|
|
|
1999-02-19 12:19:28 +01:00
|
|
|
|
/* Evaluate the first operand.
|
2002-05-25 22:18:41 +02:00
|
|
|
|
The second operand is a cleanup expression which is evaluated
|
2003-05-13 18:56:00 +02:00
|
|
|
|
on any exit (normal, exception, or jump out) from this expression. */
|
2004-06-23 02:26:04 +02:00
|
|
|
|
DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", 's', 2)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* These types of expressions have no useful value,
|
|
|
|
|
and always have side effects. */
|
|
|
|
|
|
c-common.c (c_safe_from_p, [...]): Deleted.
2004-06-26 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* c-common.c (c_safe_from_p, c_walk_subtrees): Deleted.
* c-common.def (DECL_STMT): Remove.
* c-common.h (DECL_STMT_DECL): Deleted.
(COMPOUNT_LITERAL_EXPR_DECL): Use DECL_EXPR_DECL.
(c_safe_from_p, c_walk_subtrees): Deleted.
* c-decl.c, c-parse.in, c-pretty-print.c: DECL_STMT now DECL_EXPR.
* c-dump.c (c_dump_tree, case DECL_STMT): Deleted.
* c-gimplify.c (gimplify_decl_stmt): Deleted.
(gimplify_compound_literal_expr): Use DECL_EXPR_DECL
and gimplify_and_add.
(c_gimplify_expr, case DECL_EXPR): New case.
(c_gimplify_expr, case DECL_STMT): Deleted.
* c-lang.c (LANG_HOOKS_SAFE_FROM_P): Likewise.
(LANG_HOOKS_TREE_INLINING_WALK_SUBTREES): Likewise.
* expr.c (safe_from_p, case 's'): New case.
* gimplify.c (gimplify_decl_expr): New function.
(gimplify_expr, case DECL_EXPR): New case.
* tree-inline.c (walk_tree): Walk into all fields of a type and
decl only if they are in a DECL_EXPR.
(mark_local_for_remap_r): Minor code cleanup.
* tree-outof-ssa.c (discover_nonconstant_array_refs_r): Add else.
* tree.c (has_cleanups, case DECL_EXPR): New case.
* tree.def (DECL_EXPR): New code.
* tree.h (DECL_EXPR_DECL): New macro.
* objc/objc-lang.c (LANG_HOOKS_SAFE_FROM_P): Deleted.
From-SVN: r83721
2004-06-26 23:11:23 +02:00
|
|
|
|
/* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */
|
|
|
|
|
DEFTREECODE (DECL_EXPR, "decl_expr", 's', 1)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/* A label definition, encapsulated as a statement.
|
|
|
|
|
Operand 0 is the LABEL_DECL node for the label that appears here.
|
|
|
|
|
The type should be void and the value should be ignored. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (LABEL_EXPR, "label_expr", 's', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1998-10-06 00:36:16 +02:00
|
|
|
|
/* GOTO. Operand 0 is a LABEL_DECL node or an expression.
|
1992-11-13 02:55:58 +01:00
|
|
|
|
The type should be void and the value should be ignored. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (GOTO_EXPR, "goto_expr", 's', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* RETURN. Evaluates operand 0, then returns from the current function.
|
|
|
|
|
Presumably that operand is an assignment that stores into the
|
|
|
|
|
RESULT_DECL that hold the value to be returned.
|
|
|
|
|
The operand may be null.
|
|
|
|
|
The type should be void and the value should be ignored. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (RETURN_EXPR, "return_expr", 's', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* Exit the inner most loop conditionally. Operand 0 is the condition.
|
|
|
|
|
The type should be void and the value should be ignored. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (EXIT_EXPR, "exit_expr", 's', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
|
|
|
|
/* A loop. Operand 0 is the body of the loop.
|
|
|
|
|
It must contain an EXIT_EXPR or is an infinite loop.
|
|
|
|
|
The type should be void and the value should be ignored. */
|
1997-12-12 07:49:29 +01:00
|
|
|
|
DEFTREECODE (LOOP_EXPR, "loop_expr", 's', 1)
|
1992-11-13 02:55:58 +01:00
|
|
|
|
|
1998-08-21 21:32:18 +02:00
|
|
|
|
/* Exit a labeled block, possibly returning a value. Operand 0 is a
|
|
|
|
|
LABELED_BLOCK_EXPR to exit. Operand 1 is the value to return. It
|
|
|
|
|
may be left null. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
DEFTREECODE (EXIT_BLOCK_EXPR, "exit_block_expr", 's', 2)
|
1998-09-22 19:48:10 +02:00
|
|
|
|
|
|
|
|
|
/* Switch expression.
|
2001-03-28 13:04:51 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
TREE_TYPE is the original type of the condition, before any
|
|
|
|
|
language required type conversions. It may be NULL, in which case
|
|
|
|
|
the original type and final types are assumed to be the same.
|
|
|
|
|
|
|
|
|
|
Operand 0 is the expression used to perform the branch,
|
|
|
|
|
Operand 1 is the body of the switch, which probably contains
|
|
|
|
|
CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2
|
|
|
|
|
must not be NULL.
|
|
|
|
|
Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs
|
|
|
|
|
of all the cases. */
|
|
|
|
|
DEFTREECODE (SWITCH_EXPR, "switch_expr", 's', 3)
|
|
|
|
|
|
|
|
|
|
/* Used to represent a case label. The operands are CASE_LOW and
|
|
|
|
|
CASE_HIGH, respectively. If CASE_LOW is NULL_TREE, the label is a
|
|
|
|
|
'default' label. If CASE_HIGH is NULL_TREE, the label is a normal case
|
|
|
|
|
label. CASE_LABEL is the corresponding LABEL_DECL. */
|
|
|
|
|
DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", 's', 3)
|
|
|
|
|
|
|
|
|
|
/* RESX. Resume execution after an exception. Operand 0 is a
|
|
|
|
|
number indicating the exception region that is being left. */
|
|
|
|
|
DEFTREECODE (RESX_EXPR, "resx_expr", 's', 1)
|
|
|
|
|
|
|
|
|
|
/* Used to represent an inline assembly statement. ASM_STRING returns a
|
|
|
|
|
STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS,
|
|
|
|
|
ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers
|
|
|
|
|
for the statement. */
|
|
|
|
|
DEFTREECODE (ASM_EXPR, "asm_expr", 's', 4)
|
|
|
|
|
|
|
|
|
|
/* Variable references for SSA analysis. New SSA names are created every
|
|
|
|
|
time a variable is assigned a new value. The SSA builder uses SSA_NAME
|
|
|
|
|
nodes to implement SSA versioning. */
|
|
|
|
|
DEFTREECODE (SSA_NAME, "ssa_name", 'x', 0)
|
|
|
|
|
|
|
|
|
|
/* SSA PHI operator. PHI_RESULT is the new SSA_NAME node created by
|
|
|
|
|
the PHI node. PHI_ARG_LENGTH is the number of arguments.
|
|
|
|
|
PHI_ARG_ELT returns the Ith tuple <ssa_name, edge> from the
|
|
|
|
|
argument list. Each tuple contains the incoming reaching
|
|
|
|
|
definition (SSA_NAME node) and the edge via which that definition
|
|
|
|
|
is coming through. */
|
|
|
|
|
DEFTREECODE (PHI_NODE, "phi_node", 'x', 0)
|
|
|
|
|
|
|
|
|
|
/* Used to represent a typed exception handler. CATCH_TYPES is the type (or
|
|
|
|
|
list of types) handled, and CATCH_BODY is the code for the handler. */
|
|
|
|
|
DEFTREECODE (CATCH_EXPR, "catch_expr", 's', 2)
|
|
|
|
|
|
|
|
|
|
/* Used to represent an exception specification. EH_FILTER_TYPES is a list
|
|
|
|
|
of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on
|
|
|
|
|
failure. EH_FILTER_MUST_NOT_THROW controls which range type to use when
|
|
|
|
|
expanding. */
|
|
|
|
|
DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", 's', 2)
|
|
|
|
|
|
2004-06-30 17:37:42 +02:00
|
|
|
|
/* Node used for describing a property that is known at compile
|
|
|
|
|
time. */
|
|
|
|
|
DEFTREECODE (SCEV_KNOWN, "scev_known", 'e', 0)
|
|
|
|
|
|
|
|
|
|
/* Node used for describing a property that is not known at compile
|
|
|
|
|
time. */
|
|
|
|
|
DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", 'e', 0)
|
|
|
|
|
|
|
|
|
|
/* Polynomial chains of recurrences.
|
|
|
|
|
Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */
|
|
|
|
|
DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", 'e', 3)
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
/* Used to chain children of container statements together.
|
|
|
|
|
Use the interface in tree-iterator.h to access this node. */
|
|
|
|
|
DEFTREECODE (STATEMENT_LIST, "statement_list", 'x', 0)
|
2001-03-28 13:04:51 +02:00
|
|
|
|
|
2004-06-23 22:12:44 +02:00
|
|
|
|
/* Value handles. Artificial nodes to represent expressions in
|
|
|
|
|
partial redundancy elimination (tree-ssa-pre.c). These nodes are
|
|
|
|
|
used for expression canonicalization. If two expressions compute
|
|
|
|
|
the same value, they will be assigned the same value handle. */
|
|
|
|
|
DEFTREECODE (VALUE_HANDLE, "value_handle", 'x', 0)
|
|
|
|
|
|
c-tree.h (TYPE_ACTUAL_ARG_TYPES): Use TYPE_LANG_SLOT_1.
* c-tree.h (TYPE_ACTUAL_ARG_TYPES): Use TYPE_LANG_SLOT_1.
* dwarf2out.c (add_data_member_location_attribute): Check for
TREE_BINFO.
* tree.c (tree_node_kinds): Add "binfos".
(binfo_lang_slots): New.
(make_node_stat): Add TREE_BINFO.
(make_tree_binfo_stat): New.
(tree_node_structure): Add TREE_BINFO.
* tree.def (TREE_BINFO): New.
* tree.h (REC_OR_UNION_CHECK): Rename to ...
(RECORD_OR_UNION_CHECK): ... here.
(NOT_RECORD_OR_UNION_CHECK): New.
(TRE_VIA_VIRTUAL): Allow TREE_LIST or TREE_BINFO.
(TYPE_FIELDS, TYPE_METHODS, TYPE_VFIELD): Adjust for
RECORD_OR_UNION_CHECK.
(TYPE_BINFO): Use RECORD_OR_UNION_CHECK.
(TYPE_LANG_SLOT_1): New.
(BINFO_TYPE, BINFO_OFFSET, BINFO_VTABLE, BINFO_VIRTUALS,
BINFO_BASETYPES, TYPE_BINFO_BASETYPES, BINFO_VPTR_FIELD,
BINFO_BASEACCESSES, BINFO_INHERITANCE_CHAIN): Adjust.
(BINFO_ELTS): Remove.
(BINFO_LANG_SLOT): New.
(struct tree_binfo): New.
(binfo_lang_slots): Declare.
(enum tree_node_structure_enum): Add TS_BINFO.
(union tree_node): Add binfo.
(make_tree_binfo_stat): Declare.
(make_tree_binfo): New.
(enum tree_node_kind): Add binfo_kind.
* cp/call.c (enforce_access): Expect TREE_BINFO.
* cp/class.c (binfo_ctor_vtable): Check TREE_BINFO.
* cp/cp-tree.h (RECORD_OR_UNION_TYPE_CHECK): Remove.
(BINFO_SUBVTT_INDEX, BINFO_VPTR_INDEX, BINFO_PRIMARY_BASE_OF):
Adjust.
(BINFO_LANG_ELTS): Remove.
(BINFO_LANG_SLOTS): New.
(TYPE_RAISES_EXCEPTIONS, ENUM_TEMPLATE_INFO): Use TYPE_LANG_SLOT_1.
(CLASSTYPE_TEMPLATE_INFO): Adjust.
* cp/pt.c (tsubst): Split TREE_BINFO case from TREE_VEC case.
* cp/search.c (lookup_member): Check TREE_BINFO.
* cp/semantics.c (perform_or_defer_access_check): Likewise.
(check_accessibility_of_qualified_id): Check
deferred_access_no_check.
* cp/tree.c (make_binfo): Use make_tree_binfo.
* java/class.c (make_class): Use make_tree_binfo.
(set_super_info, add_interface_do): Likewise.
* java/java-tree.h (CLASS_HAS_SUPER_FLAG): Expect a BINFO.
* objc/objc-act.c (start_class, objc_declare_protocols,
start_protocols): Use TYPE_LANG_SLOT_1.
* objc/objc-act.h (CLASS_BINFO_ELTS, PROTOCOL_BINFO_ELTS): Rename
to ...
(CLASS_LANG_SLOT_ELTS, PROTOCOL_LANG_SLOT_ELTS): ... here.
(CLASS_IVARS, CLASS_RAW_IVARS, CLASS_STATIC_TEMPLATE,
CLASS_CATEGORY_LIST, CLASS_PROTOCOL_LIST, CLASS_OWN_IVARS,
PROTOCOL_LIST, PROTOCOL_FORWARD_DECL): Use TYPE_LANG_SLOT_1.
From-SVN: r84110
2004-07-05 11:35:44 +02:00
|
|
|
|
/* Base class information. Holds information about a class as a
|
|
|
|
|
baseclass of itself or another class. */
|
|
|
|
|
DEFTREECODE (TREE_BINFO, "tree_binfo", 'x', 0)
|
|
|
|
|
|
2004-07-16 23:13:08 +02:00
|
|
|
|
/* Records the size for an expression of variable size type. This is
|
|
|
|
|
for use in contexts in which we are accessing the entire object,
|
|
|
|
|
such as for a function call, or block copy.
|
|
|
|
|
Operand 0 is the real expression.
|
|
|
|
|
Operand 1 is the size of the type in the expression. */
|
|
|
|
|
DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", 'e', 2)
|
|
|
|
|
|
1992-11-13 02:55:58 +01:00
|
|
|
|
/*
|
|
|
|
|
Local variables:
|
|
|
|
|
mode:c
|
|
|
|
|
End:
|
|
|
|
|
*/
|