1991-12-14 13:14:54 +01:00
|
|
|
|
/* Allocate registers for pseudo-registers that span basic blocks.
|
2000-02-26 14:55:09 +01:00
|
|
|
|
Copyright (C) 1987, 1988, 1991, 1994, 1996, 1997, 1998,
|
|
|
|
|
1999, 2000 Free Software Foundation, Inc.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
This file is part of GCC.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
|
|
|
|
the terms of the GNU General Public License as published by the Free
|
|
|
|
|
Software Foundation; either version 2, or (at your option) any later
|
|
|
|
|
version.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
|
|
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
|
for more details.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
Makefile.in, [...]: replace "GNU CC" with "GCC".
* Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c,
bitmap.h, builtin-types.def, builtins.c, builtins.def,
c-aux-info.c, c-common.c, c-common.def, c-common.h,
c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c,
c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in,
c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c,
caller-save.c, calls.c, collect2.c, collect2.h, combine.c,
conditions.h, config.gcc, configure.frag, configure.in,
conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c,
cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h,
dependence.c, df.c, df.h, diagnostic.c, diagnostic.h,
doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c,
dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c,
emit-rtl.c, errors.c, errors.h, except.c, except.h,
exgettext, explow.c, expmed.c, expr.c, expr.h, final.c,
fixproto, flags.h, flow.c, fold-const.c, fp-test.c,
function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp,
gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c,
gencheck.c, gencodes.c, genconfig.c, genemit.c,
genextract.c, genflags.c, gengenrtl.c, genmultilib,
genopinit.c, genoutput.c, genpeep.c, genrecog.c,
gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c,
ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c,
graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h,
gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h,
gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h,
hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h,
integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c,
libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h,
machmode.def, machmode.h, main.c, mbchar.c, mbchar.h,
mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk,
mkmap-symver.awk, optabs.c, output.h, params.c, params.def,
params.h, predict.c, predict.def, predict.h, prefix.c,
prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c,
read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c,
regclass.c, regmove.c, regrename.c, regs.h, reload.c,
reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c,
rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h,
sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c,
sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c,
ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c,
stringpool.c, system.h, timevar.c, timevar.def, timevar.h,
tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h,
tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h,
unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h,
unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c,
xcoffout.h: replace "GNU CC" with "GCC".
From-SVN: r45105
2001-08-22 16:35:51 +02:00
|
|
|
|
along with GCC; see the file COPYING. If not, write to the Free
|
|
|
|
|
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|
|
|
|
02111-1307, USA. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "config.h"
|
Major cutover to using system.h:
* Makefile.in (alias.o, bitmap.o, c-aux-info.o, c-common.o,
c-decl.o, c-iterate.o, c-lang.o, c-lex.o, c-pragma.o, c-typeck.o,
caller-save.o, calls.o, collect2.o, combine.o, cse.o, dbxout.o,
dwarf2out.o, dwarfout.o, emit-rtl.o, except.o, explow.o, expmed.o,
expr.o, final.o, flow.o, function.o, getpwd.o, global.o,
integrate.o, jump.o, local-alloc.o, loop.o, optabs.o, pexecute.o,
prefix.o, print-rtl.o, print-tree.o, profile.o, real.o, recog.o,
reg-stack.o, regclass.o, regmove.o, reload.o, reload1.o, reorg.o,
rtl.o, rtlanal.o, sdbout.o, stmt.o, stor-layout.o, stupid.o,
tlink.o, toplev.o, tree.o, unroll.o, varasm.o, xcoffout.o): Depend
on system.h.
* alias.c, bitmap.c, c-aux-info.c, c-common.c, c-decl.c,
c-iterate.c, c-lang.c, c-lex.c, c-pragma.c, c-typeck.c,
caller-save.c, calls.c, collect2.c, combine.c, cse.c, dbxout.c,
dwarf2out.c, dwarfout.c, emit-rtl.c, except.c, explow.c, expmed.c,
expr.c, final.c, flow.c, function.c, gcc.c, getpwd.c, global.c,
integrate.c, jump.c, local-alloc.c, loop.c, optabs.c, pexecute.c,
prefix.c, print-rtl.c, print-tree.c, profile.c, real.c, recog.c,
reg-stack.c, regclass.c, regmove.c, reload.c, reload1.c, reorg.c,
rtl.c, rtlanal.c, sched.c, sdbout.c, stmt.c, stor-layout.c,
stupid.c, tlink.c, toplev.c, tree.c, unroll.c, varasm.c,
xcoffout.c: Include system.h. Organize include ordering so
that stdarg/varargs comes before other system headers. Remove
spurious casts of functions assured of a prototype in system.h.
From-SVN: r18726
1998-03-20 15:58:42 +01:00
|
|
|
|
#include "system.h"
|
c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* c-common.c: Include <stdlib.h> and <string.h>/<strings.h>.
* calls.c (expand_call): Remove unused variables funtree,
n_regs, and tmpmode.
* dbxout.c, except.c: Include <string.h>/<strings.h>.
* explow.c: (plus_constant_for_output_wide) Removed unused
variable all_constant.
* c-decl.c, genattr.c, genattrtab.c, getconfig.c, genemit.c
genextract.c, genflags.c, genopinit.c genoutput.c, genpeep.c,
genrecog.c, global.c, integrate.c , stupid.c : Include
<stdlib.h>.
* genextract.c: (walk_rtx) Remove unused variable link.
* genrecog.c: (concat) Remove unreferenced static function.
* prefix.c: Include <string.h>/<strings.h>, <stdlib.h>
* stmt.c: Include <stdlib.h>.
(expand_asm_operands): Remove unused variable val1.
(expand_return): Remove unused variable block.
(pushcase): Remove unused variables l and n.
(pushcaserange): Likewise.
* unroll.c (unroll_loop): Remove unused variable temp.
From-SVN: r17766
1998-02-07 23:55:54 +01:00
|
|
|
|
|
1998-06-21 21:54:56 +02:00
|
|
|
|
#include "machmode.h"
|
|
|
|
|
#include "hard-reg-set.h"
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#include "rtl.h"
|
1999-09-20 12:00:03 +02:00
|
|
|
|
#include "tm_p.h"
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#include "flags.h"
|
|
|
|
|
#include "basic-block.h"
|
|
|
|
|
#include "regs.h"
|
1999-08-09 16:00:21 +02:00
|
|
|
|
#include "function.h"
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#include "insn-config.h"
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
#include "reload.h"
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#include "output.h"
|
1998-06-20 01:37:04 +02:00
|
|
|
|
#include "toplev.h"
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* This pass of the compiler performs global register allocation.
|
|
|
|
|
It assigns hard register numbers to all the pseudo registers
|
|
|
|
|
that were not handled in local_alloc. Assignments are recorded
|
|
|
|
|
in the vector reg_renumber, not by changing the rtl code.
|
|
|
|
|
(Such changes are made by final). The entry point is
|
|
|
|
|
the function global_alloc.
|
|
|
|
|
|
|
|
|
|
After allocation is complete, the reload pass is run as a subroutine
|
|
|
|
|
of this pass, so that when a pseudo reg loses its hard reg due to
|
|
|
|
|
spilling it is possible to make a second attempt to find a hard
|
|
|
|
|
reg for it. The reload pass is independent in other respects
|
|
|
|
|
and it is run even when stupid register allocation is in use.
|
|
|
|
|
|
1998-09-08 02:29:35 +02:00
|
|
|
|
1. Assign allocation-numbers (allocnos) to the pseudo-registers
|
|
|
|
|
still needing allocations and to the pseudo-registers currently
|
|
|
|
|
allocated by local-alloc which may be spilled by reload.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
Set up tables reg_allocno and allocno_reg to map
|
|
|
|
|
reg numbers to allocnos and vice versa.
|
|
|
|
|
max_allocno gets the number of allocnos in use.
|
|
|
|
|
|
|
|
|
|
2. Allocate a max_allocno by max_allocno conflict bit matrix and clear it.
|
|
|
|
|
Allocate a max_allocno by FIRST_PSEUDO_REGISTER conflict matrix
|
|
|
|
|
for conflicts between allocnos and explicit hard register use
|
|
|
|
|
(which includes use of pseudo-registers allocated by local_alloc).
|
|
|
|
|
|
1998-09-08 02:29:35 +02:00
|
|
|
|
3. For each basic block
|
1991-12-14 13:14:54 +01:00
|
|
|
|
walk forward through the block, recording which
|
1998-09-08 02:29:35 +02:00
|
|
|
|
pseudo-registers and which hardware registers are live.
|
|
|
|
|
Build the conflict matrix between the pseudo-registers
|
|
|
|
|
and another of pseudo-registers versus hardware registers.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
Also record the preferred hardware registers
|
1998-09-08 02:29:35 +02:00
|
|
|
|
for each pseudo-register.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
4. Sort a table of the allocnos into order of
|
|
|
|
|
desirability of the variables.
|
|
|
|
|
|
|
|
|
|
5. Allocate the variables in that order; each if possible into
|
|
|
|
|
a preferred register, else into another register. */
|
|
|
|
|
|
2001-08-13 01:40:53 +02:00
|
|
|
|
/* Number of pseudo-registers which are candidates for allocation. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
static int max_allocno;
|
|
|
|
|
|
|
|
|
|
/* Indexed by (pseudo) reg number, gives the allocno, or -1
|
1998-09-08 02:29:35 +02:00
|
|
|
|
for pseudo registers which are not to be allocated. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1998-09-16 02:31:22 +02:00
|
|
|
|
static int *reg_allocno;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
struct allocno
|
|
|
|
|
{
|
|
|
|
|
int reg;
|
|
|
|
|
/* Gives the number of consecutive hard registers needed by that
|
|
|
|
|
pseudo reg. */
|
|
|
|
|
int size;
|
|
|
|
|
|
|
|
|
|
/* Number of calls crossed by each allocno. */
|
|
|
|
|
int calls_crossed;
|
|
|
|
|
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
/* Number of refs to each allocno. */
|
1999-11-21 13:53:31 +01:00
|
|
|
|
int n_refs;
|
|
|
|
|
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
/* Frequency of uses of each allocno. */
|
|
|
|
|
int freq;
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
/* Guess at live length of each allocno.
|
|
|
|
|
This is actually the max of the live lengths of the regs. */
|
|
|
|
|
int live_length;
|
|
|
|
|
|
|
|
|
|
/* Set of hard regs conflicting with allocno N. */
|
|
|
|
|
|
|
|
|
|
HARD_REG_SET hard_reg_conflicts;
|
|
|
|
|
|
|
|
|
|
/* Set of hard regs preferred by allocno N.
|
|
|
|
|
This is used to make allocnos go into regs that are copied to or from them,
|
|
|
|
|
when possible, to reduce register shuffling. */
|
|
|
|
|
|
|
|
|
|
HARD_REG_SET hard_reg_preferences;
|
|
|
|
|
|
|
|
|
|
/* Similar, but just counts register preferences made in simple copy
|
|
|
|
|
operations, rather than arithmetic. These are given priority because
|
|
|
|
|
we can always eliminate an insn by using these, but using a register
|
|
|
|
|
in the above list won't always eliminate an insn. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
HARD_REG_SET hard_reg_copy_preferences;
|
|
|
|
|
|
|
|
|
|
/* Similar to hard_reg_preferences, but includes bits for subsequent
|
|
|
|
|
registers when an allocno is multi-word. The above variable is used for
|
|
|
|
|
allocation while this is used to build reg_someone_prefers, below. */
|
|
|
|
|
|
|
|
|
|
HARD_REG_SET hard_reg_full_preferences;
|
|
|
|
|
|
|
|
|
|
/* Set of hard registers that some later allocno has a preference for. */
|
|
|
|
|
|
|
|
|
|
HARD_REG_SET regs_someone_prefers;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static struct allocno *allocno;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* A vector of the integers from 0 to max_allocno-1,
|
|
|
|
|
sorted in the order of first-to-be-allocated first. */
|
|
|
|
|
|
|
|
|
|
static int *allocno_order;
|
|
|
|
|
|
|
|
|
|
/* Indexed by (pseudo) reg number, gives the number of another
|
1992-05-07 08:41:23 +02:00
|
|
|
|
lower-numbered pseudo reg which can share a hard reg with this pseudo
|
1991-12-14 13:14:54 +01:00
|
|
|
|
*even if the two pseudos would otherwise appear to conflict*. */
|
|
|
|
|
|
|
|
|
|
static int *reg_may_share;
|
|
|
|
|
|
1992-07-06 22:04:10 +02:00
|
|
|
|
/* Define the number of bits in each element of `conflicts' and what
|
|
|
|
|
type that element has. We use the largest integer format on the
|
|
|
|
|
host machine. */
|
|
|
|
|
|
|
|
|
|
#define INT_BITS HOST_BITS_PER_WIDE_INT
|
|
|
|
|
#define INT_TYPE HOST_WIDE_INT
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* max_allocno by max_allocno array of bits,
|
|
|
|
|
recording whether two allocno's conflict (can't go in the same
|
|
|
|
|
hardware register).
|
|
|
|
|
|
1999-11-05 09:31:48 +01:00
|
|
|
|
`conflicts' is symmetric after the call to mirror_conflicts. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1992-07-06 22:04:10 +02:00
|
|
|
|
static INT_TYPE *conflicts;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Number of ints require to hold max_allocno bits.
|
|
|
|
|
This is the length of a row in `conflicts'. */
|
|
|
|
|
|
|
|
|
|
static int allocno_row_words;
|
|
|
|
|
|
|
|
|
|
/* Two macros to test or store 1 in an element of `conflicts'. */
|
|
|
|
|
|
|
|
|
|
#define CONFLICTP(I, J) \
|
1999-11-05 09:31:48 +01:00
|
|
|
|
(conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \
|
|
|
|
|
& ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS)))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
#define SET_CONFLICT(I, J) \
|
1999-11-05 09:31:48 +01:00
|
|
|
|
(conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \
|
|
|
|
|
|= ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS)))
|
|
|
|
|
|
1999-11-06 00:07:21 +01:00
|
|
|
|
/* For any allocno set in ALLOCNO_SET, set ALLOCNO to that allocno,
|
|
|
|
|
and execute CODE. */
|
|
|
|
|
#define EXECUTE_IF_SET_IN_ALLOCNO_SET(ALLOCNO_SET, ALLOCNO, CODE) \
|
|
|
|
|
do { \
|
|
|
|
|
int i_; \
|
|
|
|
|
int allocno_; \
|
1999-11-21 13:53:31 +01:00
|
|
|
|
INT_TYPE *p_ = (ALLOCNO_SET); \
|
1999-11-06 00:07:21 +01:00
|
|
|
|
\
|
|
|
|
|
for (i_ = allocno_row_words - 1, allocno_ = 0; i_ >= 0; \
|
|
|
|
|
i_--, allocno_ += INT_BITS) \
|
|
|
|
|
{ \
|
|
|
|
|
unsigned INT_TYPE word_ = (unsigned INT_TYPE) *p_++; \
|
|
|
|
|
\
|
|
|
|
|
for ((ALLOCNO) = allocno_; word_; word_ >>= 1, (ALLOCNO)++) \
|
|
|
|
|
{ \
|
|
|
|
|
if (word_ & 1) \
|
1999-11-07 11:00:56 +01:00
|
|
|
|
{CODE;} \
|
1999-11-06 00:07:21 +01:00
|
|
|
|
} \
|
|
|
|
|
} \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
1999-11-09 00:17:51 +01:00
|
|
|
|
/* This doesn't work for non-GNU C due to the way CODE is macro expanded. */
|
|
|
|
|
#if 0
|
1999-11-06 00:07:21 +01:00
|
|
|
|
/* For any allocno that conflicts with IN_ALLOCNO, set OUT_ALLOCNO to
|
|
|
|
|
the conflicting allocno, and execute CODE. This macro assumes that
|
|
|
|
|
mirror_conflicts has been run. */
|
|
|
|
|
#define EXECUTE_IF_CONFLICT(IN_ALLOCNO, OUT_ALLOCNO, CODE)\
|
|
|
|
|
EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + (IN_ALLOCNO) * allocno_row_words,\
|
1999-11-07 11:00:56 +01:00
|
|
|
|
OUT_ALLOCNO, (CODE))
|
1999-11-09 00:17:51 +01:00
|
|
|
|
#endif
|
1999-11-06 00:07:21 +01:00
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Set of hard regs currently live (during scan of all insns). */
|
|
|
|
|
|
|
|
|
|
static HARD_REG_SET hard_regs_live;
|
|
|
|
|
|
|
|
|
|
/* Set of registers that global-alloc isn't supposed to use. */
|
|
|
|
|
|
|
|
|
|
static HARD_REG_SET no_global_alloc_regs;
|
|
|
|
|
|
|
|
|
|
/* Set of registers used so far. */
|
|
|
|
|
|
|
|
|
|
static HARD_REG_SET regs_used_so_far;
|
|
|
|
|
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
/* Number of refs to each hard reg, as used by local alloc.
|
1992-01-01 00:38:08 +01:00
|
|
|
|
It is zero for a reg that contains global pseudos or is explicitly used. */
|
|
|
|
|
|
|
|
|
|
static int local_reg_n_refs[FIRST_PSEUDO_REGISTER];
|
|
|
|
|
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
/* Frequency of uses of given hard reg. */
|
|
|
|
|
static int local_reg_freq[FIRST_PSEUDO_REGISTER];
|
|
|
|
|
|
1992-01-01 00:38:08 +01:00
|
|
|
|
/* Guess at live length of each hard reg, as used by local alloc.
|
|
|
|
|
This is actually the sum of the live lengths of the specific regs. */
|
|
|
|
|
|
|
|
|
|
static int local_reg_live_length[FIRST_PSEUDO_REGISTER];
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Test a bit in TABLE, a vector of HARD_REG_SETs,
|
|
|
|
|
for vector element I, and hard register number J. */
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
#define REGBITP(TABLE, I, J) TEST_HARD_REG_BIT (allocno[I].TABLE, J)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Set to 1 a bit in a vector of HARD_REG_SETs. Works like REGBITP. */
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
#define SET_REGBIT(TABLE, I, J) SET_HARD_REG_BIT (allocno[I].TABLE, J)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Bit mask for allocnos live at current point in the scan. */
|
|
|
|
|
|
1992-07-06 22:04:10 +02:00
|
|
|
|
static INT_TYPE *allocnos_live;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Test, set or clear bit number I in allocnos_live,
|
|
|
|
|
a bit vector indexed by allocno. */
|
|
|
|
|
|
1999-11-06 00:07:21 +01:00
|
|
|
|
#define ALLOCNO_LIVE_P(I) \
|
|
|
|
|
(allocnos_live[(unsigned)(I) / INT_BITS] \
|
|
|
|
|
& ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-06 00:07:21 +01:00
|
|
|
|
#define SET_ALLOCNO_LIVE(I) \
|
|
|
|
|
(allocnos_live[(unsigned)(I) / INT_BITS] \
|
|
|
|
|
|= ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-06 00:07:21 +01:00
|
|
|
|
#define CLEAR_ALLOCNO_LIVE(I) \
|
|
|
|
|
(allocnos_live[(unsigned)(I) / INT_BITS] \
|
|
|
|
|
&= ~((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* This is turned off because it doesn't work right for DImode.
|
|
|
|
|
(And it is only used for DImode, so the other cases are worthless.)
|
|
|
|
|
The problem is that it isn't true that there is NO possibility of conflict;
|
|
|
|
|
only that there is no conflict if the two pseudos get the exact same regs.
|
|
|
|
|
If they were allocated with a partial overlap, there would be a conflict.
|
|
|
|
|
We can't safely turn off the conflict unless we have another way to
|
|
|
|
|
prevent the partial overlap.
|
|
|
|
|
|
|
|
|
|
Idea: change hard_reg_conflicts so that instead of recording which
|
|
|
|
|
hard regs the allocno may not overlap, it records where the allocno
|
|
|
|
|
may not start. Change both where it is used and where it is updated.
|
|
|
|
|
Then there is a way to record that (reg:DI 108) may start at 10
|
|
|
|
|
but not at 9 or 11. There is still the question of how to record
|
|
|
|
|
this semi-conflict between two pseudos. */
|
|
|
|
|
#if 0
|
|
|
|
|
/* Reg pairs for which conflict after the current insn
|
|
|
|
|
is inhibited by a REG_NO_CONFLICT note.
|
|
|
|
|
If the table gets full, we ignore any other notes--that is conservative. */
|
|
|
|
|
#define NUM_NO_CONFLICT_PAIRS 4
|
|
|
|
|
/* Number of pairs in use in this insn. */
|
|
|
|
|
int n_no_conflict_pairs;
|
|
|
|
|
static struct { int allocno1, allocno2;}
|
|
|
|
|
no_conflict_pairs[NUM_NO_CONFLICT_PAIRS];
|
|
|
|
|
#endif /* 0 */
|
|
|
|
|
|
|
|
|
|
/* Record all regs that are set in any one insn.
|
|
|
|
|
Communication from mark_reg_{store,clobber} and global_conflicts. */
|
|
|
|
|
|
|
|
|
|
static rtx *regs_set;
|
|
|
|
|
static int n_regs_set;
|
|
|
|
|
|
1994-06-29 22:01:31 +02:00
|
|
|
|
/* All registers that can be eliminated. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
static HARD_REG_SET eliminable_regset;
|
|
|
|
|
|
2000-01-17 16:28:05 +01:00
|
|
|
|
static int allocno_compare PARAMS ((const PTR, const PTR));
|
|
|
|
|
static void global_conflicts PARAMS ((void));
|
|
|
|
|
static void mirror_conflicts PARAMS ((void));
|
|
|
|
|
static void expand_preferences PARAMS ((void));
|
|
|
|
|
static void prune_preferences PARAMS ((void));
|
|
|
|
|
static void find_reg PARAMS ((int, HARD_REG_SET, int, int, int));
|
|
|
|
|
static void record_one_conflict PARAMS ((int));
|
|
|
|
|
static void record_conflicts PARAMS ((int *, int));
|
|
|
|
|
static void mark_reg_store PARAMS ((rtx, rtx, void *));
|
|
|
|
|
static void mark_reg_clobber PARAMS ((rtx, rtx, void *));
|
|
|
|
|
static void mark_reg_conflicts PARAMS ((rtx));
|
|
|
|
|
static void mark_reg_death PARAMS ((rtx));
|
|
|
|
|
static void mark_reg_live_nc PARAMS ((int, enum machine_mode));
|
|
|
|
|
static void set_preference PARAMS ((rtx, rtx));
|
|
|
|
|
static void dump_conflicts PARAMS ((FILE *));
|
|
|
|
|
static void reg_becomes_live PARAMS ((rtx, rtx, void *));
|
|
|
|
|
static void reg_dies PARAMS ((int, enum machine_mode,
|
1999-12-15 15:57:29 +01:00
|
|
|
|
struct insn_chain *));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Perform allocation of pseudo-registers not allocated by local_alloc.
|
|
|
|
|
FILE is a file to output debugging information on,
|
1992-06-22 04:02:28 +02:00
|
|
|
|
or zero if such output is not desired.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1992-06-22 04:02:28 +02:00
|
|
|
|
Return value is nonzero if reload failed
|
|
|
|
|
and we must not do any more for this function. */
|
|
|
|
|
|
|
|
|
|
int
|
1991-12-14 13:14:54 +01:00
|
|
|
|
global_alloc (file)
|
|
|
|
|
FILE *file;
|
|
|
|
|
{
|
1997-10-31 15:08:40 +01:00
|
|
|
|
int retval;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#ifdef ELIMINABLE_REGS
|
builtins.c (expand_builtin_setjmp_receiver): Const-ify.
* builtins.c (expand_builtin_setjmp_receiver): Const-ify.
* c-common.c (fname_var_t, c_tree_code_type, c_tree_code_length):
Likewise.
* c-dump.c (dump_option_value_info): Likewise.
* c-format.c (format_length_info, format_char_info,
format_flag_spec, format_flag_pair, format_kind_info): Likewise.
* collect2.c (names): Likewise.
* cppdefault.h (default_include): Likewise.
* cppexp.c (suffix, vsuf_1, vsuf_2, vsuf_3): Likewise.
* flow.c (life_analysis): Likewise.
* gcc.c (dir_separator_str, modify_target, option_map,
target_option_translations, spec_list_1, extra_specs_1,
init_spec): Likewise.
* gcov.c (gcov_version_string): Likewise.
* genattr.c (write_units): Likewise.
* genattrtab.c (make_length_attrs, write_function_unit_info): Likewise.
* gengenrtl.c (rtx_definition, defs): Likewise.
* genrecog.c (pred_table): Likewise.
* global.c (global_alloc): Likewise.
* lcm.c (optimize_mode_switching): Likewise.
* local-alloc.c (find_free_reg): Likewise.
* params.h (param_info): Likewise.
* predict.c (predictor_info): Likewise.
* protoize.c (unexpansion_struct): Likewise.
* real.c (bmask): Likewise.
* recog.h (insn_operand_data, insn_data): Likewise.
* regclass.c (initial_fixed_regs, initial_call_used_regs): Likewise.
* stmt.c (expand_nl_goto_receiver): Likewise.
* toplev.c (da, debug_args, lang_opt, documented_lang_options,
target_switches, target_options): Likewise.
* tradcif.y (token, tokentab2, yylex): Likewise.
* tree.h (attribute_spec): Likewise.
* alpha.c (override_options, alpha_lookup_xfloating_lib_func):
Likewise.
* arc.c (arc_output_function_epilogue): Likewise.
* arm.c (processors, all_cores, all_architectures,
arm_override_options, isr_attribute_arg, isr_attribute_args,
arm_isr_value): Likewise.
* avr.c (mcu_type_s, reg_class_tab, order_regs_for_local_alloc):
Likewise.
* c4x.c (c4x_int_reglist): Likewise.
* d30v.c (override_options): Likewise.
* h8300.c (shift_insn): Likewise.
* i386.c (size_cost, i386_cost, i486_cost, pentium_cost,
pentiumpro_cost, k6_cost, athlon_cost, pentium4_cost, ix86_cost,
ix86_expand_sse_comi, ix86_expand_sse_compare, override_options,
builtin_description, bdesc_comi, bdesc_2arg, bdesc_1arg,
ix86_init_mmx_sse_builtins, ix86_expand_builtin): Likewise.
* i386.h (processor_costs, ix86_cost): Likewise.
* m68hc11.c (m68hc11_cost, m6811_cost, m6812_cost): Likewise.
* m68hc11.h (processor_costs, m68hc11_cost): Likewise.
* m68k.c (codes_68881, codes_FPA): Likewise.
* m88k.c (mode_from_align, max_from_align, all_from_align,
best_from_align, m_options): Likewise.
* m88k.h (ORDER_REGS_FOR_LOCAL_ALLOC): Likewise.
* mcore.c (mode_from_align): Likewise.
* mips/elf64.h (UNIQUE_SECTION): Likewise.
* mips/iris6gld.h (UNIQUE_SECTION): Likewise.
* mips.c (mips_sw_reg_names, mips_regno_to_class): Likewise.
* mips.h (mips_regno_to_class): Likewise.
* ns32k.c (scales): Likewise.
* pa.c (import_string, magic_milli): Likewise.
* rs6000.c (alt_reg_names, rs6000_override_options): Likewise.
* sparc.c (leaf_reg_remap, sparc_override_options,
reg_leaf_alloc_order, reg_nonleaf_alloc_order, reg_alloc_orders):
Likewise.
* sparc.h (sparc_cpu_select, leaf_reg_remap): Likewise.
cp:
* class.c (build_vtable_entry_ref): Const-ify.
* decl.c (predefined_identifier,
initialize_predefined_identifiers): Likewise.
* init.c (build_new_1): Likewise.
* lex.c (cplus_tree_code_type, cplus_tree_code_length, resword):
Likewise.
f:
* bad.c (_ffebad_message_, ffebad_messages_): Const-ify.
* bld.c (ffebld_arity_op_): Likewise.
* bld.h (ffebld_arity_op_): Likewise.
* com.c (ffecom_init_0): Likewise.
* intdoc.c (_ffeintrin_name_, _ffeintrin_gen_, _ffeintrin_spec_,
_ffeintrin_imp_, names, gens, imps, specs, cc_pair,
cc_descriptions, cc_summaries): Likewise.
* intrin.c (_ffeintrin_name_, _ffeintrin_gen_, _ffeintrin_spec_,
_ffeintrin_imp_, ffeintrin_names_, ffeintrin_gens_,
ffeintrin_imps_, ffeintrin_specs_): Likewise.
java:
* jcf-io.c (format_uint): Const-ify.
* lang.c (java_tree_code_type, java_tree_code_length): Likewise.
* lex.c (java_get_line_col): Likewise.
* parse.y (build_incdec): Likewise.
From-SVN: r46062
2001-10-07 18:51:11 +02:00
|
|
|
|
static const struct {const int from, to; } eliminables[] = ELIMINABLE_REGS;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#endif
|
1994-06-29 22:01:31 +02:00
|
|
|
|
int need_fp
|
|
|
|
|
= (! flag_omit_frame_pointer
|
|
|
|
|
#ifdef EXIT_IGNORE_STACK
|
|
|
|
|
|| (current_function_calls_alloca && EXIT_IGNORE_STACK)
|
|
|
|
|
#endif
|
|
|
|
|
|| FRAME_POINTER_REQUIRED);
|
|
|
|
|
|
2001-10-11 05:16:15 +02:00
|
|
|
|
size_t i;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
rtx x;
|
|
|
|
|
|
|
|
|
|
max_allocno = 0;
|
|
|
|
|
|
|
|
|
|
/* A machine may have certain hard registers that
|
|
|
|
|
are safe to use only within a basic block. */
|
|
|
|
|
|
|
|
|
|
CLEAR_HARD_REG_SET (no_global_alloc_regs);
|
|
|
|
|
|
|
|
|
|
/* Build the regset of all eliminable registers and show we can't use those
|
|
|
|
|
that we already know won't be eliminated. */
|
|
|
|
|
#ifdef ELIMINABLE_REGS
|
optabs.c (init_optabs): Initialize fixtab...
* optabs.c (init_optabs): Initialize fixtab, fixtrunctab, floattab,
and extendtab within their proper array boundaries.
* emit-rtl.c (init_emit_once): Pass `const_tiny_rtx' with bounds
for the entire array.
* config/arm/arm.c (arm_override_options): Use ARRAY_SIZE.
* config/alpha/alpha.c (alpha_lookup_xfloating_lib_func): Likewise.
* config/avr/avr.c (order_regs_for_local_alloc): Likewise.
* config/fr30/fr30.c (fr30_print_operand): Likewise.
* config/i386/dgux.c (output_options): Likewise.
* config/i386/dgux.h (ASM_FILE_START): Likewise.
* config/m88k/m88k.c (output_options): Likewise.
* config/m88k/m88k.h (ASM_FILE_START): Likewise.
* config/mcore/mcore.c (mcore_output_inline_const_forced,
layout_mcore_frame, handle_structs_in_regs): Likewise.
* config/mips/mips.c (output_block_move): Likewise.
* config/rs6000/rs6000.c (rs6000_override_options,
rs6000_file_start): Likewise.
* config/sparc/sparc.c (sparc_add_gc_roots): Likewise.
* fixinc/fixfixes.c (FIX_TABLE_CT): Likewise.
* fixinc/fixtests.c (TEST_TABLE_CT): Likewise.
* builtins.c (expand_builtin_setjmp): Likewise.
* expr.c (safe_from_p): Likewise.
* flow.c (life_analysis): Likewise.
* fold-const.c (size_int_type_wide): Likewise.
* gcc.c (translate_options, init_spec, set_spec, main): Likewise.
* genattrtab.c (make_length_attrs): Likewise.
* genopinit.c (gen_insn): Likewise.
* genrecog.c (NUM_KNOWN_PREDS, NUM_SPECIAL_MODE_PREDS): Likewise.
* global.c (global_alloc): Likewise.
* local-alloc.c (find_free_reg): Likewise.
* mips-tdump.c (print_symbol): Likewise.
* mips-tfile.c (parse_def, parse_input): Likewise.
* reload1.c (NUM_ELIMINABLE_REGS): Likewise.
* stmt.c (expand_nl_goto_receiver): Likewise.
* stor-layout.c (set_sizetype): Likewise.
* varasm.c (decode_reg_name): Likewise.
* toplev.c (decode_f_option, decode_W_option,
set_target_switch, print_switch_values): Likewise.
(NUM_ELEM): Remove macro.
(display_help, main): s/NUM_ELEM/ARRAY_SIZE/
From-SVN: r35949
2000-08-24 22:31:35 +02:00
|
|
|
|
for (i = 0; i < ARRAY_SIZE (eliminables); i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
SET_HARD_REG_BIT (eliminable_regset, eliminables[i].from);
|
|
|
|
|
|
|
|
|
|
if (! CAN_ELIMINATE (eliminables[i].from, eliminables[i].to)
|
1994-06-29 22:01:31 +02:00
|
|
|
|
|| (eliminables[i].to == STACK_POINTER_REGNUM && need_fp))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
SET_HARD_REG_BIT (no_global_alloc_regs, eliminables[i].from);
|
|
|
|
|
}
|
1993-09-24 21:45:44 +02:00
|
|
|
|
#if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
|
1994-06-29 22:01:31 +02:00
|
|
|
|
SET_HARD_REG_BIT (eliminable_regset, HARD_FRAME_POINTER_REGNUM);
|
|
|
|
|
if (need_fp)
|
1993-09-24 21:45:44 +02:00
|
|
|
|
SET_HARD_REG_BIT (no_global_alloc_regs, HARD_FRAME_POINTER_REGNUM);
|
|
|
|
|
#endif
|
1994-06-29 22:01:31 +02:00
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#else
|
|
|
|
|
SET_HARD_REG_BIT (eliminable_regset, FRAME_POINTER_REGNUM);
|
1994-06-29 22:01:31 +02:00
|
|
|
|
if (need_fp)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
SET_HARD_REG_BIT (no_global_alloc_regs, FRAME_POINTER_REGNUM);
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Track which registers have already been used. Start with registers
|
|
|
|
|
explicitly in the rtl, then registers allocated by local register
|
1992-01-20 19:46:58 +01:00
|
|
|
|
allocation. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
CLEAR_HARD_REG_SET (regs_used_so_far);
|
1992-01-20 19:46:58 +01:00
|
|
|
|
#ifdef LEAF_REGISTERS
|
|
|
|
|
/* If we are doing the leaf function optimization, and this is a leaf
|
|
|
|
|
function, it means that the registers that take work to save are those
|
|
|
|
|
that need a register window. So prefer the ones that can be used in
|
|
|
|
|
a leaf function. */
|
|
|
|
|
{
|
|
|
|
|
char *cheap_regs;
|
sibcall.c (skip_copy_to_return_value): Use OUTGOING_REGNO for comparison if regno's are equal.
* sibcall.c (skip_copy_to_return_value): Use OUTGOING_REGNO for
comparison if regno's are equal.
* calls.c (initialize_argument_informat): Add ecf_flags argument.
Use FUNCTION_INCOMING_ARG if available and ECF_SIBCALL.
(expand_call): Update caller.
Avoid making a sibling call if argument size of the callee is larger
than argument size of the caller.
Call hard_function_value with outgoing set if in sibcall pass.
Use FUNCTION_INCOMING_ARG if available and ECF_SIBCALL.
* final.c (permitted_reg_in_leaf_functions, only_leaf_regs_used):
Change LEAF_REGISTERS from an array initializer to actual array
identifier. Move static global variable into the function.
(leaf_function_p): Allow SIBLING_CALL_P calls even outside of
sequences for leaf functions.
* global.c (global_alloc): Likewise.
* tm.texi (LEAF_REGISTERS): Update documentation.
* config/sparc/sparc.h (CONDITIONAL_REGISTER_USAGE): Remove the ugly
TARGET_FLAT leaf disabling hack.
(LEAF_REGISTERS): Changed from an array initializer to actual array
identifier to avoid duplication and remove the above hack.
(FUNCTION_OK_FOR_SIBCALL): Define.
* config/sparc/sparc.md (sibcall): New attr type. Use it almost
always like call attribute.
(eligible_for_sibcall_delay): New attribute.
(sibcall): New delay type.
(sibcall, sibcall_value, sibcall_epilogue): New expands.
(sibcall_symbolic_sp32, sibcall_symbolic_sp64,
sibcall_value_symbolic_sp32, sibcall_value_symbolic_sp64): New insns.
* config/sparc/sparc.c (sparc_leaf_regs): New array.
(eligible_for_sibcall_delay, output_restore_regs, output_sibcall):
New functions.
(output_function_epilogue): Move part of the code into
output_restore_regs.
(ultra_code_from_mask, ultrasparc_sched_reorder): Handle
TYPE_SIBCALL.
* sparc-protos.h (output_sibcall, eligible_for_sibcall_delay): New
prototypes.
From-SVN: r32730
2000-03-24 22:48:01 +01:00
|
|
|
|
char *leaf_regs = LEAF_REGISTERS;
|
1992-01-20 19:46:58 +01:00
|
|
|
|
|
|
|
|
|
if (only_leaf_regs_used () && leaf_function_p ())
|
|
|
|
|
cheap_regs = leaf_regs;
|
|
|
|
|
else
|
|
|
|
|
cheap_regs = call_used_regs;
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
if (regs_ever_live[i] || cheap_regs[i])
|
|
|
|
|
SET_HARD_REG_BIT (regs_used_so_far, i);
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
/* We consider registers that do not have to be saved over calls as if
|
|
|
|
|
they were already used since there is no cost in using them. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
if (regs_ever_live[i] || call_used_regs[i])
|
|
|
|
|
SET_HARD_REG_BIT (regs_used_so_far, i);
|
1992-01-20 19:46:58 +01:00
|
|
|
|
#endif
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
if (reg_renumber[i] >= 0)
|
|
|
|
|
SET_HARD_REG_BIT (regs_used_so_far, reg_renumber[i]);
|
|
|
|
|
|
|
|
|
|
/* Establish mappings from register number to allocation number
|
|
|
|
|
and vice versa. In the process, count the allocnos. */
|
|
|
|
|
|
1999-11-02 00:19:44 +01:00
|
|
|
|
reg_allocno = (int *) xmalloc (max_regno * sizeof (int));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
reg_allocno[i] = -1;
|
|
|
|
|
|
|
|
|
|
/* Initialize the shared-hard-reg mapping
|
|
|
|
|
from the list of pairs that may share. */
|
1999-11-02 00:19:44 +01:00
|
|
|
|
reg_may_share = (int *) xcalloc (max_regno, sizeof (int));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (x = regs_may_share; x; x = XEXP (XEXP (x, 1), 1))
|
|
|
|
|
{
|
|
|
|
|
int r1 = REGNO (XEXP (x, 0));
|
|
|
|
|
int r2 = REGNO (XEXP (XEXP (x, 1), 0));
|
|
|
|
|
if (r1 > r2)
|
|
|
|
|
reg_may_share[r1] = r2;
|
|
|
|
|
else
|
|
|
|
|
reg_may_share[r2] = r1;
|
|
|
|
|
}
|
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Note that reg_live_length[i] < 0 indicates a "constant" reg
|
|
|
|
|
that we are supposed to refrain from putting in a hard reg.
|
|
|
|
|
-2 means do make an allocno but don't allocate it. */
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (REG_N_REFS (i) != 0 && REG_LIVE_LENGTH (i) != -1
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Don't allocate pseudos that cross calls,
|
|
|
|
|
if this function receives a nonlocal goto. */
|
|
|
|
|
&& (! current_function_has_nonlocal_label
|
1997-05-30 20:19:19 +02:00
|
|
|
|
|| REG_N_CALLS_CROSSED (i) == 0))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (reg_renumber[i] < 0 && reg_may_share[i] && reg_allocno[reg_may_share[i]] >= 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
reg_allocno[i] = reg_allocno[reg_may_share[i]];
|
|
|
|
|
else
|
|
|
|
|
reg_allocno[i] = max_allocno++;
|
1997-05-30 20:19:19 +02:00
|
|
|
|
if (REG_LIVE_LENGTH (i) == 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
reg_allocno[i] = -1;
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
allocno = (struct allocno *) xcalloc (max_allocno, sizeof (struct allocno));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
if (reg_allocno[i] >= 0)
|
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
int num = reg_allocno[i];
|
|
|
|
|
allocno[num].reg = i;
|
|
|
|
|
allocno[num].size = PSEUDO_REGNO_SIZE (i);
|
|
|
|
|
allocno[num].calls_crossed += REG_N_CALLS_CROSSED (i);
|
|
|
|
|
allocno[num].n_refs += REG_N_REFS (i);
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
allocno[num].freq += REG_FREQ (i);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (allocno[num].live_length < REG_LIVE_LENGTH (i))
|
|
|
|
|
allocno[num].live_length = REG_LIVE_LENGTH (i);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
1992-01-01 00:38:08 +01:00
|
|
|
|
/* Calculate amount of usage of each hard reg by pseudos
|
|
|
|
|
allocated by local-alloc. This is to see if we want to
|
|
|
|
|
override it. */
|
alias.c [...] (init_alias_analysis, [...]): Use memset () instead of bzero ().
* alias.c (init_alias_analysis), calls.c (expand_call,
emit_library_call_value_1), combine.c (init_reg_last_arrays),
cse.c (new_basic_block), dbxout.c (dbxout_type), diagnostic.c
(init_output_buffer, set_diagnostic_context), dwarf2out.c
(equate_decl_number_to_die, build_abbrev_table), emit-rtl.c
(init_emit_once), fold-const.c (mul_double, div_and_round_double),
function.c (assign_parms), gcse.c (compute_can_copy,
alloc_gcse_mem, alloc_reg_set_mem, record_one_set,
compute_hash_table, compute_set_hash_table,
compute_expr_hash_table), genattrtab.c (optimize_attrs), global.c
(global_alloc, global_conflicts), haifa-sched.c (compute_trg_info,
clear_units, schedule_block), integrate.c (initialize_for_inline,
expand_inline_function), jump.c (thread_jumps), local-alloc.c
(local_alloc), loop.c (combine_movables, count_loop_regs_set,
load_mems_and_recount_loop_regs_set), print-tree.c (debug_tree),
regclass.c (init_reg_sets, init_reg_sets_1, regclass,
record_reg_classes, allocate_reg_info), reload.c
(get_secondary_mem, remove_address_replacements, find_reloads),
reload1.c (reload, set_initial_label_offsets, finish_spills,
reload_as_needed, choose_reload_regs_init,
reload_cse_simplify_operands), reorg.c (dbr_schedule), sbitmap.c
(sbitmap_zero), simplify-rtx.c (simplify_plus_minus), ssa.c
(rename_registers), stmt.c (expand_end_case), unroll.c
(unroll_loop), varray.c (varray_grow), objc/objc-act.c: Use memset
() instead of bzero ().
ch:
* actions.c (check_missing_cases), typeck.c (build_chill_slice,
build_chill_cast): Use memset () instead of bzero ().
cp:
* class.c (duplicate_tag_error, build_vtbl_initializer), decl.c
(push_binding_level), error.c (cp_tree_printer), pt.c
(process_partial_specialization, tsubst_template_arg_vector),
search.c (lookup_member): Use memset () instead of bzero ().
java:
* expr.c (note_instructions), jcf-io.c (find_class), jcf-parse.c
(init_outgoing_cpool), lex.c (java_init_lex): Use memset ()
instead of bzero ().
From-SVN: r37303
2000-11-07 23:50:06 +01:00
|
|
|
|
memset ((char *) local_reg_live_length, 0, sizeof local_reg_live_length);
|
|
|
|
|
memset ((char *) local_reg_n_refs, 0, sizeof local_reg_n_refs);
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
memset ((char *) local_reg_freq, 0, sizeof local_reg_freq);
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++)
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (reg_renumber[i] >= 0)
|
1992-01-01 00:38:08 +01:00
|
|
|
|
{
|
1992-01-18 00:19:29 +01:00
|
|
|
|
int regno = reg_renumber[i];
|
|
|
|
|
int endregno = regno + HARD_REGNO_NREGS (regno, PSEUDO_REGNO_MODE (i));
|
|
|
|
|
int j;
|
|
|
|
|
|
|
|
|
|
for (j = regno; j < endregno; j++)
|
|
|
|
|
{
|
1997-05-30 20:19:19 +02:00
|
|
|
|
local_reg_n_refs[j] += REG_N_REFS (i);
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
local_reg_freq[j] += REG_FREQ (i);
|
1997-05-30 20:19:19 +02:00
|
|
|
|
local_reg_live_length[j] += REG_LIVE_LENGTH (i);
|
1992-01-18 00:19:29 +01:00
|
|
|
|
}
|
1992-01-01 00:38:08 +01:00
|
|
|
|
}
|
1992-01-18 00:19:29 +01:00
|
|
|
|
|
1992-01-01 00:38:08 +01:00
|
|
|
|
/* We can't override local-alloc for a reg used not just by local-alloc. */
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
if (regs_ever_live[i])
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
local_reg_n_refs[i] = 0, local_reg_freq[i] = 0;
|
1994-09-17 01:22:39 +02:00
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
allocno_row_words = (max_allocno + INT_BITS - 1) / INT_BITS;
|
|
|
|
|
|
1997-10-29 00:39:28 +01:00
|
|
|
|
/* We used to use alloca here, but the size of what it would try to
|
|
|
|
|
allocate would occasionally cause it to exceed the stack limit and
|
|
|
|
|
cause unpredictable core dumps. Some examples were > 2Mb in size. */
|
1999-09-04 01:22:50 +02:00
|
|
|
|
conflicts = (INT_TYPE *) xcalloc (max_allocno * allocno_row_words,
|
|
|
|
|
sizeof (INT_TYPE));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-02 00:19:44 +01:00
|
|
|
|
allocnos_live = (INT_TYPE *) xmalloc (allocno_row_words * sizeof (INT_TYPE));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* If there is work to be done (at least one reg to allocate),
|
|
|
|
|
perform global conflict analysis and allocate the regs. */
|
|
|
|
|
|
|
|
|
|
if (max_allocno > 0)
|
|
|
|
|
{
|
|
|
|
|
/* Scan all the insns and compute the conflicts among allocnos
|
|
|
|
|
and between allocnos and hard regs. */
|
|
|
|
|
|
|
|
|
|
global_conflicts ();
|
|
|
|
|
|
1999-11-05 09:31:48 +01:00
|
|
|
|
mirror_conflicts ();
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Eliminate conflicts between pseudos and eliminable registers. If
|
|
|
|
|
the register is not eliminated, the pseudo won't really be able to
|
|
|
|
|
live in the eliminable register, so the conflict doesn't matter.
|
|
|
|
|
If we do eliminate the register, the conflict will no longer exist.
|
1992-01-01 00:38:08 +01:00
|
|
|
|
So in either case, we can ignore the conflict. Likewise for
|
|
|
|
|
preferences. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = 0; i < (size_t) max_allocno; i++)
|
1992-01-01 00:38:08 +01:00
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_conflicts,
|
|
|
|
|
eliminable_regset);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_copy_preferences,
|
|
|
|
|
eliminable_regset);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_preferences,
|
1992-01-01 00:38:08 +01:00
|
|
|
|
eliminable_regset);
|
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Try to expand the preferences by merging them between allocnos. */
|
|
|
|
|
|
|
|
|
|
expand_preferences ();
|
|
|
|
|
|
|
|
|
|
/* Determine the order to allocate the remaining pseudo registers. */
|
|
|
|
|
|
1999-11-02 00:19:44 +01:00
|
|
|
|
allocno_order = (int *) xmalloc (max_allocno * sizeof (int));
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = 0; i < (size_t) max_allocno; i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
allocno_order[i] = i;
|
|
|
|
|
|
|
|
|
|
/* Default the size to 1, since allocno_compare uses it to divide by.
|
|
|
|
|
Also convert allocno_live_length of zero to -1. A length of zero
|
|
|
|
|
can occur when all the registers for that allocno have reg_live_length
|
|
|
|
|
equal to -2. In this case, we want to make an allocno, but not
|
|
|
|
|
allocate it. So avoid the divide-by-zero and set it to a low
|
|
|
|
|
priority. */
|
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = 0; i < (size_t) max_allocno; i++)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (allocno[i].size == 0)
|
|
|
|
|
allocno[i].size = 1;
|
|
|
|
|
if (allocno[i].live_length == 0)
|
|
|
|
|
allocno[i].live_length = -1;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
qsort (allocno_order, max_allocno, sizeof (int), allocno_compare);
|
|
|
|
|
|
|
|
|
|
prune_preferences ();
|
|
|
|
|
|
|
|
|
|
if (file)
|
|
|
|
|
dump_conflicts (file);
|
|
|
|
|
|
|
|
|
|
/* Try allocating them, one by one, in that order,
|
|
|
|
|
except for parameters marked with reg_live_length[regno] == -2. */
|
|
|
|
|
|
1998-10-14 11:02:55 +02:00
|
|
|
|
for (i = 0; i < (size_t) max_allocno; i++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_renumber[allocno[allocno_order[i]].reg] < 0
|
|
|
|
|
&& REG_LIVE_LENGTH (allocno[allocno_order[i]].reg) >= 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
/* If we have more than one register class,
|
|
|
|
|
first try allocating in the class that is cheapest
|
|
|
|
|
for this pseudo-reg. If that fails, try any reg. */
|
|
|
|
|
if (N_REG_CLASSES > 1)
|
|
|
|
|
{
|
1998-04-18 03:02:04 +02:00
|
|
|
|
find_reg (allocno_order[i], 0, 0, 0, 0);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_renumber[allocno[allocno_order[i]].reg] >= 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
continue;
|
|
|
|
|
}
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_alternate_class (allocno[allocno_order[i]].reg) != NO_REGS)
|
1998-04-18 03:02:04 +02:00
|
|
|
|
find_reg (allocno_order[i], 0, 1, 0, 0);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
1999-11-02 00:19:44 +01:00
|
|
|
|
|
|
|
|
|
free (allocno_order);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Do the reloads now while the allocno data still exist, so that we can
|
|
|
|
|
try to assign new hard regs to any pseudo regs that are spilled. */
|
|
|
|
|
|
1992-02-17 22:14:55 +01:00
|
|
|
|
#if 0 /* We need to eliminate regs even if there is no rtl code,
|
|
|
|
|
for the sake of debugging information. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
if (n_basic_blocks > 0)
|
1992-02-17 22:14:55 +01:00
|
|
|
|
#endif
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
1999-08-08 11:09:06 +02:00
|
|
|
|
build_insn_chain (get_insns ());
|
2000-08-21 15:42:29 +02:00
|
|
|
|
retval = reload (get_insns (), 1);
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
1997-10-31 15:08:40 +01:00
|
|
|
|
|
1999-11-02 00:19:44 +01:00
|
|
|
|
/* Clean up. */
|
|
|
|
|
free (reg_allocno);
|
|
|
|
|
free (reg_may_share);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
free (allocno);
|
1997-10-31 15:08:40 +01:00
|
|
|
|
free (conflicts);
|
1999-11-02 00:19:44 +01:00
|
|
|
|
free (allocnos_live);
|
|
|
|
|
|
1997-10-31 15:08:40 +01:00
|
|
|
|
return retval;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Sort predicate for ordering the allocnos.
|
|
|
|
|
Returns -1 (1) if *v1 should be allocated before (after) *v2. */
|
|
|
|
|
|
|
|
|
|
static int
|
1996-11-12 20:03:37 +01:00
|
|
|
|
allocno_compare (v1p, v2p)
|
gansidecl.h (__attribute__, [...]): Delete.
* gansidecl.h (__attribute__, ATTRIBUTE_UNUSED_LABEL,
ATTRIBUTE_UNUSED, ATTRIBUTE_NORETURN, ATTRIBUTE_PRINTF,
ATTRIBUTE_PRINTF_1, ATTRIBUTE_PRINTF_2, ATTRIBUTE_PRINTF_3,
ATTRIBUTE_PRINTF_4, ATTRIBUTE_PRINTF_5, GENERIC_PTR): Delete.
* c-decl.c (field_decl_cmp): Use PTR instead of GENERIC_PTR.
* cccp.c (pcfinclude): Likewise.
* global.c (allocno_compare): Likewise.
* haifa-sched.c (rank_for_schedule): Likewise.
* local-alloc.c (qty_sugg_compare_1, qty_compare_1): Likewise.
* reload1.c (hard_reg_use_compare, reload_reg_class_lower): Likewise.
* stupid.c (stupid_reg_compare): Likewise.
* tree.c (_obstack_allocated_p): Likewise.
* varray.h (varray_data_tag, VARRAY_GENERIC_PTR_INIT): Likewise.
From-SVN: r29208
1999-09-08 17:44:18 +02:00
|
|
|
|
const PTR v1p;
|
|
|
|
|
const PTR v2p;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
1999-10-26 20:13:38 +02:00
|
|
|
|
int v1 = *(const int *)v1p, v2 = *(const int *)v2p;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Note that the quotient will never be bigger than
|
|
|
|
|
the value of floor_log2 times the maximum number of
|
2001-07-30 22:03:37 +02:00
|
|
|
|
times a register can occur in one insn (surely less than 100)
|
|
|
|
|
weighted by the frequency (maximally REG_FREQ_MAX).
|
|
|
|
|
Multiplying this by 10000/REG_FREQ_MAX can't overflow. */
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int pri1
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
= (((double) (floor_log2 (allocno[v1].n_refs) * allocno[v1].freq)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
/ allocno[v1].live_length)
|
2001-07-30 22:03:37 +02:00
|
|
|
|
* (10000 / REG_FREQ_MAX) * allocno[v1].size);
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int pri2
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
= (((double) (floor_log2 (allocno[v2].n_refs) * allocno[v2].freq)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
/ allocno[v2].live_length)
|
2001-07-30 22:03:37 +02:00
|
|
|
|
* (10000 / REG_FREQ_MAX) * allocno[v2].size);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
if (pri2 - pri1)
|
|
|
|
|
return pri2 - pri1;
|
|
|
|
|
|
|
|
|
|
/* If regs are equally good, sort by allocno,
|
|
|
|
|
so that the results of qsort leave nothing to chance. */
|
1996-11-12 20:03:37 +01:00
|
|
|
|
return v1 - v2;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Scan the rtl code and record all conflicts and register preferences in the
|
|
|
|
|
conflict matrices and preference tables. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
global_conflicts ()
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int b, i;
|
|
|
|
|
rtx insn;
|
1998-12-12 23:12:02 +01:00
|
|
|
|
int *block_start_allocnos;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Make a vector that mark_reg_{store,clobber} will store in. */
|
1999-11-02 00:19:44 +01:00
|
|
|
|
regs_set = (rtx *) xmalloc (max_parallel * sizeof (rtx) * 2);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-02 00:19:44 +01:00
|
|
|
|
block_start_allocnos = (int *) xmalloc (max_allocno * sizeof (int));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
for (b = 0; b < n_basic_blocks; b++)
|
|
|
|
|
{
|
alias.c [...] (init_alias_analysis, [...]): Use memset () instead of bzero ().
* alias.c (init_alias_analysis), calls.c (expand_call,
emit_library_call_value_1), combine.c (init_reg_last_arrays),
cse.c (new_basic_block), dbxout.c (dbxout_type), diagnostic.c
(init_output_buffer, set_diagnostic_context), dwarf2out.c
(equate_decl_number_to_die, build_abbrev_table), emit-rtl.c
(init_emit_once), fold-const.c (mul_double, div_and_round_double),
function.c (assign_parms), gcse.c (compute_can_copy,
alloc_gcse_mem, alloc_reg_set_mem, record_one_set,
compute_hash_table, compute_set_hash_table,
compute_expr_hash_table), genattrtab.c (optimize_attrs), global.c
(global_alloc, global_conflicts), haifa-sched.c (compute_trg_info,
clear_units, schedule_block), integrate.c (initialize_for_inline,
expand_inline_function), jump.c (thread_jumps), local-alloc.c
(local_alloc), loop.c (combine_movables, count_loop_regs_set,
load_mems_and_recount_loop_regs_set), print-tree.c (debug_tree),
regclass.c (init_reg_sets, init_reg_sets_1, regclass,
record_reg_classes, allocate_reg_info), reload.c
(get_secondary_mem, remove_address_replacements, find_reloads),
reload1.c (reload, set_initial_label_offsets, finish_spills,
reload_as_needed, choose_reload_regs_init,
reload_cse_simplify_operands), reorg.c (dbr_schedule), sbitmap.c
(sbitmap_zero), simplify-rtx.c (simplify_plus_minus), ssa.c
(rename_registers), stmt.c (expand_end_case), unroll.c
(unroll_loop), varray.c (varray_grow), objc/objc-act.c: Use memset
() instead of bzero ().
ch:
* actions.c (check_missing_cases), typeck.c (build_chill_slice,
build_chill_cast): Use memset () instead of bzero ().
cp:
* class.c (duplicate_tag_error, build_vtbl_initializer), decl.c
(push_binding_level), error.c (cp_tree_printer), pt.c
(process_partial_specialization, tsubst_template_arg_vector),
search.c (lookup_member): Use memset () instead of bzero ().
java:
* expr.c (note_instructions), jcf-io.c (find_class), jcf-parse.c
(init_outgoing_cpool), lex.c (java_init_lex): Use memset ()
instead of bzero ().
From-SVN: r37303
2000-11-07 23:50:06 +01:00
|
|
|
|
memset ((char *) allocnos_live, 0, allocno_row_words * sizeof (INT_TYPE));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Initialize table of registers currently live
|
|
|
|
|
to the state at the beginning of this basic block.
|
1999-11-12 02:56:17 +01:00
|
|
|
|
This also marks the conflicts among hard registers
|
|
|
|
|
and any allocnos that are live.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
For pseudo-regs, there is only one bit for each one
|
|
|
|
|
no matter how many hard regs it occupies.
|
|
|
|
|
This is ok; we know the size from PSEUDO_REGNO_SIZE.
|
|
|
|
|
For explicit hard regs, we cannot know the size that way
|
|
|
|
|
since one hard reg can be used with various sizes.
|
|
|
|
|
Therefore, we must require that all the hard regs
|
|
|
|
|
implicitly live as part of a multi-word hard reg
|
|
|
|
|
are explicitly marked in basic_block_live_at_start. */
|
|
|
|
|
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
regset old = BASIC_BLOCK (b)->global_live_at_start;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
int ax = 0;
|
|
|
|
|
|
1997-06-05 12:24:03 +02:00
|
|
|
|
REG_SET_TO_HARD_REG_SET (hard_regs_live, old);
|
1997-07-16 20:31:36 +02:00
|
|
|
|
EXECUTE_IF_SET_IN_REG_SET (old, FIRST_PSEUDO_REGISTER, i,
|
1997-06-05 12:24:03 +02:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int a = reg_allocno[i];
|
1997-06-05 12:24:03 +02:00
|
|
|
|
if (a >= 0)
|
|
|
|
|
{
|
|
|
|
|
SET_ALLOCNO_LIVE (a);
|
|
|
|
|
block_start_allocnos[ax++] = a;
|
|
|
|
|
}
|
|
|
|
|
else if ((a = reg_renumber[i]) >= 0)
|
1997-07-16 20:31:36 +02:00
|
|
|
|
mark_reg_live_nc
|
|
|
|
|
(a, PSEUDO_REGNO_MODE (i));
|
1997-06-05 12:24:03 +02:00
|
|
|
|
});
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-12 02:56:17 +01:00
|
|
|
|
/* Record that each allocno now live conflicts with each hard reg
|
|
|
|
|
now live.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-12 02:56:17 +01:00
|
|
|
|
It is not necessary to mark any conflicts between pseudos as
|
|
|
|
|
this point, even for pseudos which are live at the start of
|
|
|
|
|
the basic block.
|
|
|
|
|
|
|
|
|
|
Given two pseudos X and Y and any point in the CFG P.
|
|
|
|
|
|
|
|
|
|
On any path to point P where X and Y are live one of the
|
|
|
|
|
following conditions must be true:
|
|
|
|
|
|
|
|
|
|
1. X is live at some instruction on the path that
|
|
|
|
|
evaluates Y.
|
|
|
|
|
|
|
|
|
|
2. Y is live at some instruction on the path that
|
|
|
|
|
evaluates X.
|
|
|
|
|
|
|
|
|
|
3. Either X or Y is not evaluted on the path to P
|
|
|
|
|
(ie it is used uninitialized) and thus the
|
|
|
|
|
conflict can be ignored.
|
|
|
|
|
|
|
|
|
|
In cases #1 and #2 the conflict will be recorded when we
|
|
|
|
|
scan the instruction that makes either X or Y become live. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
record_conflicts (block_start_allocnos, ax);
|
1998-03-28 01:12:41 +01:00
|
|
|
|
|
|
|
|
|
#ifdef STACK_REGS
|
1999-02-26 00:45:42 +01:00
|
|
|
|
{
|
|
|
|
|
/* Pseudos can't go in stack regs at the start of a basic block
|
1999-10-27 03:25:13 +02:00
|
|
|
|
that is reached by an abnormal edge. */
|
1999-02-26 00:45:42 +01:00
|
|
|
|
|
|
|
|
|
edge e;
|
|
|
|
|
for (e = BASIC_BLOCK (b)->pred; e ; e = e->pred_next)
|
|
|
|
|
if (e->flags & EDGE_ABNORMAL)
|
|
|
|
|
break;
|
|
|
|
|
if (e != NULL)
|
|
|
|
|
for (ax = FIRST_STACK_REG; ax <= LAST_STACK_REG; ax++)
|
|
|
|
|
record_one_conflict (ax);
|
|
|
|
|
}
|
1998-03-28 01:12:41 +01:00
|
|
|
|
#endif
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
basic-block.h (basic_block_head): Rename to x_basic_block_head.
* basic-block.h (basic_block_head): Rename to x_basic_block_head.
(basic_block_end): Rename to x_basic_block_end.
(BLOCK_HEAD, BLOCK_END): Update.
* caller-save.c: Change basic_block_head/end references to
BLOCK_HEAD/END.
* combine.c, flow.c, function.c, gcse.c, global.c: Likewise.
* graph.c, haifa-sched.c, local-alloc.c, regclass.c: Likewise.
* regmove.c, reload1.c, reorg.c, sched.c: Likewise.
From-SVN: r24622
1999-01-11 23:37:20 +01:00
|
|
|
|
insn = BLOCK_HEAD (b);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Scan the code of this basic block, noting which allocnos
|
|
|
|
|
and hard regs are born or die. When one is born,
|
|
|
|
|
record a conflict with all others currently live. */
|
|
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
RTX_CODE code = GET_CODE (insn);
|
|
|
|
|
rtx link;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Make regs_set an empty set. */
|
|
|
|
|
|
|
|
|
|
n_regs_set = 0;
|
|
|
|
|
|
|
|
|
|
if (code == INSN || code == CALL_INSN || code == JUMP_INSN)
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
#if 0
|
1994-03-25 20:14:10 +01:00
|
|
|
|
int i = 0;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (link = REG_NOTES (insn);
|
|
|
|
|
link && i < NUM_NO_CONFLICT_PAIRS;
|
|
|
|
|
link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_NO_CONFLICT)
|
|
|
|
|
{
|
|
|
|
|
no_conflict_pairs[i].allocno1
|
|
|
|
|
= reg_allocno[REGNO (SET_DEST (PATTERN (insn)))];
|
|
|
|
|
no_conflict_pairs[i].allocno2
|
|
|
|
|
= reg_allocno[REGNO (XEXP (link, 0))];
|
|
|
|
|
i++;
|
|
|
|
|
}
|
|
|
|
|
#endif /* 0 */
|
|
|
|
|
|
|
|
|
|
/* Mark any registers clobbered by INSN as live,
|
|
|
|
|
so they conflict with the inputs. */
|
|
|
|
|
|
1999-10-27 21:27:41 +02:00
|
|
|
|
note_stores (PATTERN (insn), mark_reg_clobber, NULL);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Mark any registers dead after INSN as dead now. */
|
|
|
|
|
|
|
|
|
|
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_DEAD)
|
|
|
|
|
mark_reg_death (XEXP (link, 0));
|
|
|
|
|
|
|
|
|
|
/* Mark any registers set in INSN as live,
|
|
|
|
|
and mark them as conflicting with all other live regs.
|
|
|
|
|
Clobbers are processed again, so they conflict with
|
|
|
|
|
the registers that are set. */
|
|
|
|
|
|
1999-10-27 21:27:41 +02:00
|
|
|
|
note_stores (PATTERN (insn), mark_reg_store, NULL);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
#ifdef AUTO_INC_DEC
|
|
|
|
|
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_INC)
|
1999-10-27 21:27:41 +02:00
|
|
|
|
mark_reg_store (XEXP (link, 0), NULL_RTX, NULL);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#endif
|
|
|
|
|
|
1992-03-22 04:36:46 +01:00
|
|
|
|
/* If INSN has multiple outputs, then any reg that dies here
|
|
|
|
|
and is used inside of an output
|
1998-12-13 00:03:54 +01:00
|
|
|
|
must conflict with the other outputs.
|
|
|
|
|
|
|
|
|
|
It is unsafe to use !single_set here since it will ignore an
|
|
|
|
|
unused output. Just because an output is unused does not mean
|
|
|
|
|
the compiler can assume the side effect will not occur.
|
|
|
|
|
Consider if REG appears in the address of an output and we
|
|
|
|
|
reload the output. If we allocate REG to the same hard
|
|
|
|
|
register as an unused output we could set the hard register
|
|
|
|
|
before the output reload insn. */
|
|
|
|
|
if (GET_CODE (PATTERN (insn)) == PARALLEL && multiple_sets (insn))
|
1992-03-22 04:36:46 +01:00
|
|
|
|
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_DEAD)
|
|
|
|
|
{
|
|
|
|
|
int used_in_output = 0;
|
|
|
|
|
int i;
|
|
|
|
|
rtx reg = XEXP (link, 0);
|
|
|
|
|
|
|
|
|
|
for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
rtx set = XVECEXP (PATTERN (insn), 0, i);
|
|
|
|
|
if (GET_CODE (set) == SET
|
|
|
|
|
&& GET_CODE (SET_DEST (set)) != REG
|
|
|
|
|
&& !rtx_equal_p (reg, SET_DEST (set))
|
|
|
|
|
&& reg_overlap_mentioned_p (reg, SET_DEST (set)))
|
|
|
|
|
used_in_output = 1;
|
|
|
|
|
}
|
|
|
|
|
if (used_in_output)
|
|
|
|
|
mark_reg_conflicts (reg);
|
|
|
|
|
}
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Mark any registers set in INSN and then never used. */
|
|
|
|
|
|
2000-12-05 20:12:20 +01:00
|
|
|
|
while (n_regs_set-- > 0)
|
|
|
|
|
{
|
|
|
|
|
rtx note = find_regno_note (insn, REG_UNUSED,
|
|
|
|
|
REGNO (regs_set[n_regs_set]));
|
|
|
|
|
if (note)
|
|
|
|
|
mark_reg_death (XEXP (note, 0));
|
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
basic-block.h (basic_block_head): Rename to x_basic_block_head.
* basic-block.h (basic_block_head): Rename to x_basic_block_head.
(basic_block_end): Rename to x_basic_block_end.
(BLOCK_HEAD, BLOCK_END): Update.
* caller-save.c: Change basic_block_head/end references to
BLOCK_HEAD/END.
* combine.c, flow.c, function.c, gcse.c, global.c: Likewise.
* graph.c, haifa-sched.c, local-alloc.c, regclass.c: Likewise.
* regmove.c, reload1.c, reorg.c, sched.c: Likewise.
From-SVN: r24622
1999-01-11 23:37:20 +01:00
|
|
|
|
if (insn == BLOCK_END (b))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
break;
|
|
|
|
|
insn = NEXT_INSN (insn);
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-11-02 00:19:44 +01:00
|
|
|
|
|
|
|
|
|
/* Clean up. */
|
|
|
|
|
free (block_start_allocnos);
|
|
|
|
|
free (regs_set);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
/* Expand the preference information by looking for cases where one allocno
|
|
|
|
|
dies in an insn that sets an allocno. If those two allocnos don't conflict,
|
|
|
|
|
merge any preferences between those allocnos. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
expand_preferences ()
|
|
|
|
|
{
|
|
|
|
|
rtx insn;
|
|
|
|
|
rtx link;
|
|
|
|
|
rtx set;
|
|
|
|
|
|
|
|
|
|
/* We only try to handle the most common cases here. Most of the cases
|
|
|
|
|
where this wins are reg-reg copies. */
|
|
|
|
|
|
|
|
|
|
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
|
2000-08-04 22:28:08 +02:00
|
|
|
|
if (INSN_P (insn)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
&& (set = single_set (insn)) != 0
|
|
|
|
|
&& GET_CODE (SET_DEST (set)) == REG
|
|
|
|
|
&& reg_allocno[REGNO (SET_DEST (set))] >= 0)
|
|
|
|
|
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_DEAD
|
|
|
|
|
&& GET_CODE (XEXP (link, 0)) == REG
|
|
|
|
|
&& reg_allocno[REGNO (XEXP (link, 0))] >= 0
|
|
|
|
|
&& ! CONFLICTP (reg_allocno[REGNO (SET_DEST (set))],
|
1999-11-05 09:31:48 +01:00
|
|
|
|
reg_allocno[REGNO (XEXP (link, 0))]))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
int a1 = reg_allocno[REGNO (SET_DEST (set))];
|
|
|
|
|
int a2 = reg_allocno[REGNO (XEXP (link, 0))];
|
|
|
|
|
|
|
|
|
|
if (XEXP (link, 0) == SET_SRC (set))
|
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (allocno[a1].hard_reg_copy_preferences,
|
|
|
|
|
allocno[a2].hard_reg_copy_preferences);
|
|
|
|
|
IOR_HARD_REG_SET (allocno[a2].hard_reg_copy_preferences,
|
|
|
|
|
allocno[a1].hard_reg_copy_preferences);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (allocno[a1].hard_reg_preferences,
|
|
|
|
|
allocno[a2].hard_reg_preferences);
|
|
|
|
|
IOR_HARD_REG_SET (allocno[a2].hard_reg_preferences,
|
|
|
|
|
allocno[a1].hard_reg_preferences);
|
|
|
|
|
IOR_HARD_REG_SET (allocno[a1].hard_reg_full_preferences,
|
|
|
|
|
allocno[a2].hard_reg_full_preferences);
|
|
|
|
|
IOR_HARD_REG_SET (allocno[a2].hard_reg_full_preferences,
|
|
|
|
|
allocno[a1].hard_reg_full_preferences);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Prune the preferences for global registers to exclude registers that cannot
|
|
|
|
|
be used.
|
|
|
|
|
|
|
|
|
|
Compute `regs_someone_prefers', which is a bitmask of the hard registers
|
|
|
|
|
that are preferred by conflicting registers of lower priority. If possible,
|
|
|
|
|
we will avoid using these registers. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
prune_preferences ()
|
|
|
|
|
{
|
1999-11-06 00:07:21 +01:00
|
|
|
|
int i;
|
1999-11-21 13:53:31 +01:00
|
|
|
|
int num;
|
1999-11-05 09:31:48 +01:00
|
|
|
|
int *allocno_to_order = (int *) xmalloc (max_allocno * sizeof (int));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Scan least most important to most important.
|
|
|
|
|
For each allocno, remove from preferences registers that cannot be used,
|
|
|
|
|
either because of conflicts or register type. Then compute all registers
|
1992-03-14 06:07:15 +01:00
|
|
|
|
preferred by each lower-priority register that conflicts. */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
for (i = max_allocno - 1; i >= 0; i--)
|
|
|
|
|
{
|
1999-11-05 09:31:48 +01:00
|
|
|
|
HARD_REG_SET temp;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
num = allocno_order[i];
|
|
|
|
|
allocno_to_order[num] = i;
|
|
|
|
|
COPY_HARD_REG_SET (temp, allocno[num].hard_reg_conflicts);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (allocno[num].calls_crossed == 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
IOR_HARD_REG_SET (temp, fixed_reg_set);
|
|
|
|
|
else
|
|
|
|
|
IOR_HARD_REG_SET (temp, call_used_reg_set);
|
|
|
|
|
|
|
|
|
|
IOR_COMPL_HARD_REG_SET
|
|
|
|
|
(temp,
|
1999-11-21 13:53:31 +01:00
|
|
|
|
reg_class_contents[(int) reg_preferred_class (allocno[num].reg)]);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_preferences, temp);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_copy_preferences, temp);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_full_preferences, temp);
|
1999-11-05 09:31:48 +01:00
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1999-11-05 09:31:48 +01:00
|
|
|
|
for (i = max_allocno - 1; i >= 0; i--)
|
|
|
|
|
{
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Merge in the preferences of lower-priority registers (they have
|
|
|
|
|
already been pruned). If we also prefer some of those registers,
|
|
|
|
|
don't exclude them unless we are of a smaller size (in which case
|
|
|
|
|
we want to give the lower-priority allocno the first chance for
|
|
|
|
|
these registers). */
|
1999-11-05 09:31:48 +01:00
|
|
|
|
HARD_REG_SET temp, temp2;
|
1999-11-06 00:07:21 +01:00
|
|
|
|
int allocno2;
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
num = allocno_order[i];
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
1999-08-13 00:53:28 +02:00
|
|
|
|
CLEAR_HARD_REG_SET (temp);
|
|
|
|
|
CLEAR_HARD_REG_SET (temp2);
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + num * allocno_row_words,
|
1999-11-09 00:17:51 +01:00
|
|
|
|
allocno2,
|
1999-11-05 09:31:48 +01:00
|
|
|
|
{
|
1999-11-06 00:07:21 +01:00
|
|
|
|
if (allocno_to_order[allocno2] > i)
|
1999-11-05 09:31:48 +01:00
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (allocno[allocno2].size <= allocno[num].size)
|
|
|
|
|
IOR_HARD_REG_SET (temp,
|
|
|
|
|
allocno[allocno2].hard_reg_full_preferences);
|
1999-11-06 00:07:21 +01:00
|
|
|
|
else
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (temp2,
|
|
|
|
|
allocno[allocno2].hard_reg_full_preferences);
|
1999-11-05 09:31:48 +01:00
|
|
|
|
}
|
1999-11-06 00:07:21 +01:00
|
|
|
|
});
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
AND_COMPL_HARD_REG_SET (temp, allocno[num].hard_reg_full_preferences);
|
1999-08-13 00:53:28 +02:00
|
|
|
|
IOR_HARD_REG_SET (temp, temp2);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
COPY_HARD_REG_SET (allocno[num].regs_someone_prefers, temp);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
1999-11-05 09:31:48 +01:00
|
|
|
|
free (allocno_to_order);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
/* Assign a hard register to allocno NUM; look for one that is the beginning
|
1991-12-14 13:14:54 +01:00
|
|
|
|
of a long enough stretch of hard regs none of which conflicts with ALLOCNO.
|
|
|
|
|
The registers marked in PREFREGS are tried first.
|
|
|
|
|
|
|
|
|
|
LOSERS, if non-zero, is a HARD_REG_SET indicating registers that cannot
|
|
|
|
|
be used for this allocation.
|
|
|
|
|
|
1992-07-06 22:04:10 +02:00
|
|
|
|
If ALT_REGS_P is zero, consider only the preferred class of ALLOCNO's reg.
|
|
|
|
|
Otherwise ignore that preferred class and use the alternate class.
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
If ACCEPT_CALL_CLOBBERED is nonzero, accept a call-clobbered hard reg that
|
|
|
|
|
will have to be saved and restored at calls.
|
|
|
|
|
|
1992-01-01 00:38:08 +01:00
|
|
|
|
RETRYING is nonzero if this is called from retry_global_alloc.
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
If we find one, record it in reg_renumber.
|
|
|
|
|
If not, do nothing. */
|
|
|
|
|
|
|
|
|
|
static void
|
1999-11-21 13:53:31 +01:00
|
|
|
|
find_reg (num, losers, alt_regs_p, accept_call_clobbered, retrying)
|
|
|
|
|
int num;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
HARD_REG_SET losers;
|
1992-07-06 22:04:10 +02:00
|
|
|
|
int alt_regs_p;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
int accept_call_clobbered;
|
1992-01-01 00:38:08 +01:00
|
|
|
|
int retrying;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int i, best_reg, pass;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
#ifdef HARD_REG_SET
|
|
|
|
|
register /* Declare it register if it's a scalar. */
|
|
|
|
|
#endif
|
1992-01-01 00:38:08 +01:00
|
|
|
|
HARD_REG_SET used, used1, used2;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
1992-07-06 22:04:10 +02:00
|
|
|
|
enum reg_class class = (alt_regs_p
|
1999-11-21 13:53:31 +01:00
|
|
|
|
? reg_alternate_class (allocno[num].reg)
|
|
|
|
|
: reg_preferred_class (allocno[num].reg));
|
|
|
|
|
enum machine_mode mode = PSEUDO_REGNO_MODE (allocno[num].reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
if (accept_call_clobbered)
|
|
|
|
|
COPY_HARD_REG_SET (used1, call_fixed_reg_set);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
else if (allocno[num].calls_crossed == 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
COPY_HARD_REG_SET (used1, fixed_reg_set);
|
|
|
|
|
else
|
|
|
|
|
COPY_HARD_REG_SET (used1, call_used_reg_set);
|
|
|
|
|
|
|
|
|
|
/* Some registers should not be allocated in global-alloc. */
|
|
|
|
|
IOR_HARD_REG_SET (used1, no_global_alloc_regs);
|
|
|
|
|
if (losers)
|
|
|
|
|
IOR_HARD_REG_SET (used1, losers);
|
|
|
|
|
|
|
|
|
|
IOR_COMPL_HARD_REG_SET (used1, reg_class_contents[(int) class]);
|
1992-01-01 00:38:08 +01:00
|
|
|
|
COPY_HARD_REG_SET (used2, used1);
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (used1, allocno[num].hard_reg_conflicts);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
2000-06-13 23:47:44 +02:00
|
|
|
|
#ifdef CLASS_CANNOT_CHANGE_MODE
|
|
|
|
|
if (REG_CHANGES_MODE (allocno[num].reg))
|
1994-08-07 14:52:03 +02:00
|
|
|
|
IOR_HARD_REG_SET (used1,
|
2000-06-13 23:47:44 +02:00
|
|
|
|
reg_class_contents[(int) CLASS_CANNOT_CHANGE_MODE]);
|
1994-08-07 14:52:03 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Try each hard reg to see if it fits. Do this in two passes.
|
1992-03-14 06:07:15 +01:00
|
|
|
|
In the first pass, skip registers that are preferred by some other pseudo
|
1991-12-14 13:14:54 +01:00
|
|
|
|
to give it a better chance of getting one of those registers. Only if
|
|
|
|
|
we can't get a register when excluding those do we take one of them.
|
|
|
|
|
However, we never allocate a register for the first time in pass 0. */
|
|
|
|
|
|
|
|
|
|
COPY_HARD_REG_SET (used, used1);
|
|
|
|
|
IOR_COMPL_HARD_REG_SET (used, regs_used_so_far);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (used, allocno[num].regs_someone_prefers);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
best_reg = -1;
|
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER, pass = 0;
|
|
|
|
|
pass <= 1 && i >= FIRST_PSEUDO_REGISTER;
|
|
|
|
|
pass++)
|
|
|
|
|
{
|
|
|
|
|
if (pass == 1)
|
|
|
|
|
COPY_HARD_REG_SET (used, used1);
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
{
|
|
|
|
|
#ifdef REG_ALLOC_ORDER
|
|
|
|
|
int regno = reg_alloc_order[i];
|
|
|
|
|
#else
|
|
|
|
|
int regno = i;
|
|
|
|
|
#endif
|
|
|
|
|
if (! TEST_HARD_REG_BIT (used, regno)
|
1998-09-30 20:09:47 +02:00
|
|
|
|
&& HARD_REGNO_MODE_OK (regno, mode)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
&& (allocno[num].calls_crossed == 0
|
1998-09-30 20:09:47 +02:00
|
|
|
|
|| accept_call_clobbered
|
|
|
|
|
|| ! HARD_REGNO_CALL_PART_CLOBBERED (regno, mode)))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int j;
|
|
|
|
|
int lim = regno + HARD_REGNO_NREGS (regno, mode);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = regno + 1;
|
|
|
|
|
(j < lim
|
|
|
|
|
&& ! TEST_HARD_REG_BIT (used, j));
|
|
|
|
|
j++);
|
|
|
|
|
if (j == lim)
|
|
|
|
|
{
|
|
|
|
|
best_reg = regno;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
#ifndef REG_ALLOC_ORDER
|
|
|
|
|
i = j; /* Skip starting points we know will lose */
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* See if there is a preferred register with the same class as the register
|
|
|
|
|
we allocated above. Making this restriction prevents register
|
|
|
|
|
preferencing from creating worse register allocation.
|
|
|
|
|
|
|
|
|
|
Remove from the preferred registers and conflicting registers. Note that
|
|
|
|
|
additional conflicts may have been added after `prune_preferences' was
|
|
|
|
|
called.
|
|
|
|
|
|
|
|
|
|
First do this for those register with copy preferences, then all
|
|
|
|
|
preferred registers. */
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_copy_preferences, used);
|
|
|
|
|
GO_IF_HARD_REG_SUBSET (allocno[num].hard_reg_copy_preferences,
|
1991-12-14 13:14:54 +01:00
|
|
|
|
reg_class_contents[(int) NO_REGS], no_copy_prefs);
|
|
|
|
|
|
|
|
|
|
if (best_reg >= 0)
|
|
|
|
|
{
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (TEST_HARD_REG_BIT (allocno[num].hard_reg_copy_preferences, i)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
&& HARD_REGNO_MODE_OK (i, mode)
|
|
|
|
|
&& (REGNO_REG_CLASS (i) == REGNO_REG_CLASS (best_reg)
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (i),
|
|
|
|
|
REGNO_REG_CLASS (best_reg))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (best_reg),
|
|
|
|
|
REGNO_REG_CLASS (i))))
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int j;
|
|
|
|
|
int lim = i + HARD_REGNO_NREGS (i, mode);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = i + 1;
|
|
|
|
|
(j < lim
|
|
|
|
|
&& ! TEST_HARD_REG_BIT (used, j)
|
|
|
|
|
&& (REGNO_REG_CLASS (j)
|
|
|
|
|
== REGNO_REG_CLASS (best_reg + (j - i))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (j),
|
|
|
|
|
REGNO_REG_CLASS (best_reg + (j - i)))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (best_reg + (j - i)),
|
|
|
|
|
REGNO_REG_CLASS (j))));
|
|
|
|
|
j++);
|
|
|
|
|
if (j == lim)
|
|
|
|
|
{
|
|
|
|
|
best_reg = i;
|
|
|
|
|
goto no_prefs;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
no_copy_prefs:
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_preferences, used);
|
|
|
|
|
GO_IF_HARD_REG_SUBSET (allocno[num].hard_reg_preferences,
|
1991-12-14 13:14:54 +01:00
|
|
|
|
reg_class_contents[(int) NO_REGS], no_prefs);
|
|
|
|
|
|
|
|
|
|
if (best_reg >= 0)
|
|
|
|
|
{
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (TEST_HARD_REG_BIT (allocno[num].hard_reg_preferences, i)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
&& HARD_REGNO_MODE_OK (i, mode)
|
|
|
|
|
&& (REGNO_REG_CLASS (i) == REGNO_REG_CLASS (best_reg)
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (i),
|
|
|
|
|
REGNO_REG_CLASS (best_reg))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (best_reg),
|
|
|
|
|
REGNO_REG_CLASS (i))))
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int j;
|
|
|
|
|
int lim = i + HARD_REGNO_NREGS (i, mode);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = i + 1;
|
|
|
|
|
(j < lim
|
|
|
|
|
&& ! TEST_HARD_REG_BIT (used, j)
|
|
|
|
|
&& (REGNO_REG_CLASS (j)
|
|
|
|
|
== REGNO_REG_CLASS (best_reg + (j - i))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (j),
|
|
|
|
|
REGNO_REG_CLASS (best_reg + (j - i)))
|
|
|
|
|
|| reg_class_subset_p (REGNO_REG_CLASS (best_reg + (j - i)),
|
|
|
|
|
REGNO_REG_CLASS (j))));
|
|
|
|
|
j++);
|
|
|
|
|
if (j == lim)
|
|
|
|
|
{
|
|
|
|
|
best_reg = i;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
no_prefs:
|
|
|
|
|
|
1993-01-20 00:24:27 +01:00
|
|
|
|
/* If we haven't succeeded yet, try with caller-saves.
|
|
|
|
|
We need not check to see if the current function has nonlocal
|
|
|
|
|
labels because we don't put any pseudos that are live over calls in
|
|
|
|
|
registers in that case. */
|
|
|
|
|
|
1992-01-01 00:38:08 +01:00
|
|
|
|
if (flag_caller_saves && best_reg < 0)
|
|
|
|
|
{
|
|
|
|
|
/* Did not find a register. If it would be profitable to
|
|
|
|
|
allocate a call-clobbered register and save and restore it
|
|
|
|
|
around calls, do that. */
|
|
|
|
|
if (! accept_call_clobbered
|
1999-11-21 13:53:31 +01:00
|
|
|
|
&& allocno[num].calls_crossed != 0
|
|
|
|
|
&& CALLER_SAVE_PROFITABLE (allocno[num].n_refs,
|
|
|
|
|
allocno[num].calls_crossed))
|
1992-01-01 00:38:08 +01:00
|
|
|
|
{
|
1996-01-01 03:32:57 +01:00
|
|
|
|
HARD_REG_SET new_losers;
|
|
|
|
|
if (! losers)
|
|
|
|
|
CLEAR_HARD_REG_SET (new_losers);
|
|
|
|
|
else
|
|
|
|
|
COPY_HARD_REG_SET (new_losers, losers);
|
|
|
|
|
|
|
|
|
|
IOR_HARD_REG_SET(new_losers, losing_caller_save_reg_set);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
find_reg (num, new_losers, alt_regs_p, 1, retrying);
|
|
|
|
|
if (reg_renumber[allocno[num].reg] >= 0)
|
1992-01-01 00:38:08 +01:00
|
|
|
|
{
|
|
|
|
|
caller_save_needed = 1;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If we haven't succeeded yet,
|
|
|
|
|
see if some hard reg that conflicts with us
|
|
|
|
|
was utilized poorly by local-alloc.
|
|
|
|
|
If so, kick out the regs that were put there by local-alloc
|
|
|
|
|
so we can use it instead. */
|
|
|
|
|
if (best_reg < 0 && !retrying
|
|
|
|
|
/* Let's not bother with multi-reg allocnos. */
|
1999-11-21 13:53:31 +01:00
|
|
|
|
&& allocno[num].size == 1)
|
1992-01-01 00:38:08 +01:00
|
|
|
|
{
|
|
|
|
|
/* Count from the end, to find the least-used ones first. */
|
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER - 1; i >= 0; i--)
|
1994-05-04 22:45:28 +02:00
|
|
|
|
{
|
|
|
|
|
#ifdef REG_ALLOC_ORDER
|
|
|
|
|
int regno = reg_alloc_order[i];
|
|
|
|
|
#else
|
|
|
|
|
int regno = i;
|
|
|
|
|
#endif
|
1992-01-18 00:19:29 +01:00
|
|
|
|
|
1994-05-04 22:45:28 +02:00
|
|
|
|
if (local_reg_n_refs[regno] != 0
|
|
|
|
|
/* Don't use a reg no good for this pseudo. */
|
|
|
|
|
&& ! TEST_HARD_REG_BIT (used2, regno)
|
1994-08-07 14:52:03 +02:00
|
|
|
|
&& HARD_REGNO_MODE_OK (regno, mode)
|
2000-06-13 23:47:44 +02:00
|
|
|
|
#ifdef CLASS_CANNOT_CHANGE_MODE
|
|
|
|
|
&& ! (REG_CHANGES_MODE (allocno[num].reg)
|
1994-08-07 14:52:03 +02:00
|
|
|
|
&& (TEST_HARD_REG_BIT
|
2000-06-13 23:47:44 +02:00
|
|
|
|
(reg_class_contents[(int) CLASS_CANNOT_CHANGE_MODE],
|
1994-08-07 14:52:03 +02:00
|
|
|
|
regno)))
|
|
|
|
|
#endif
|
|
|
|
|
)
|
1994-05-04 22:45:28 +02:00
|
|
|
|
{
|
1994-07-19 04:02:32 +02:00
|
|
|
|
/* We explicitly evaluate the divide results into temporary
|
|
|
|
|
variables so as to avoid excess precision problems that occur
|
2001-10-09 08:03:16 +02:00
|
|
|
|
on an i386-unknown-sysv4.2 (unixware) host. */
|
1994-07-19 04:02:32 +02:00
|
|
|
|
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
double tmp1 = ((double) local_reg_freq[regno]
|
1994-07-19 04:02:32 +02:00
|
|
|
|
/ local_reg_live_length[regno]);
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
double tmp2 = ((double) allocno[num].freq
|
1999-11-21 13:53:31 +01:00
|
|
|
|
/ allocno[num].live_length);
|
1994-07-19 04:02:32 +02:00
|
|
|
|
|
|
|
|
|
if (tmp1 < tmp2)
|
|
|
|
|
{
|
|
|
|
|
/* Hard reg REGNO was used less in total by local regs
|
|
|
|
|
than it would be used by this one allocno! */
|
|
|
|
|
int k;
|
|
|
|
|
for (k = 0; k < max_regno; k++)
|
|
|
|
|
if (reg_renumber[k] >= 0)
|
|
|
|
|
{
|
|
|
|
|
int r = reg_renumber[k];
|
|
|
|
|
int endregno
|
|
|
|
|
= r + HARD_REGNO_NREGS (r, PSEUDO_REGNO_MODE (k));
|
1992-01-18 00:19:29 +01:00
|
|
|
|
|
1994-07-19 04:02:32 +02:00
|
|
|
|
if (regno >= r && regno < endregno)
|
|
|
|
|
reg_renumber[k] = -1;
|
|
|
|
|
}
|
1994-05-04 22:45:28 +02:00
|
|
|
|
|
1994-07-19 04:02:32 +02:00
|
|
|
|
best_reg = regno;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1994-05-04 22:45:28 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
1992-01-01 00:38:08 +01:00
|
|
|
|
}
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Did we find a register? */
|
|
|
|
|
|
|
|
|
|
if (best_reg >= 0)
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int lim, j;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
HARD_REG_SET this_reg;
|
|
|
|
|
|
|
|
|
|
/* Yes. Record it as the hard register of this pseudo-reg. */
|
1999-11-21 13:53:31 +01:00
|
|
|
|
reg_renumber[allocno[num].reg] = best_reg;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Also of any pseudo-regs that share with it. */
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_may_share[allocno[num].reg])
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = FIRST_PSEUDO_REGISTER; j < max_regno; j++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_allocno[j] == num)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
reg_renumber[j] = best_reg;
|
|
|
|
|
|
|
|
|
|
/* Make a set of the hard regs being allocated. */
|
|
|
|
|
CLEAR_HARD_REG_SET (this_reg);
|
|
|
|
|
lim = best_reg + HARD_REGNO_NREGS (best_reg, mode);
|
|
|
|
|
for (j = best_reg; j < lim; j++)
|
|
|
|
|
{
|
|
|
|
|
SET_HARD_REG_BIT (this_reg, j);
|
|
|
|
|
SET_HARD_REG_BIT (regs_used_so_far, j);
|
1992-01-01 00:38:08 +01:00
|
|
|
|
/* This is no longer a reg used just by local regs. */
|
|
|
|
|
local_reg_n_refs[j] = 0;
|
regs.h (struct reg_info_def): Add freq field.
* regs.h (struct reg_info_def): Add freq field.
(REG_N_REFS): Update comment.
(REG_FREQ): New.
* regclass.c (scan_one_insn): Update REG_FREQ.
* flow.c (mark_set_1): Update REG_FREQ, make REG_N_SETS unweighted.
(attempt_auto_inc): Likewise.
(mark_used_reg): Likewise.
(try_pre_increment_1): Likewise.
* local-alloc.c (struct qty): Add freq field.
(alloc_qty): Set freq.
(update_equiv_regs): Set REG_FREQ.
(QTY_CMP_PRI): Use freq.
(combine_regs): Update qty->freq.
* global.c (struct allocno): Update comment for n_refs;
add freq field.
(local_reg_freq): New array.
(global_alloc): Update freq field;
allocate and initialize local_reg_freq.
(allocno_compare): Use freq field.
(find_reg): Likewise.
* reload1.c (count_pseudo): Use freq isntead of n_refs.
(count_spilled_pseudo): Likewise.
* tm.texi (GCOV_TYPE_SIZE): Document.
* basic-block.h (gcov_type): Define.
(struct edge_def): Use gcov_type for count field.
(struct basic_block_def): Likewise.
* defaults.h (GCOV_TYPE_SIZE): Define.
* final.c (end_final): Use GCOV_TYPE_SIZE.
* flow.c (dump_edge_info, dump_flow_info, dump_bb): Print count fields
using HOST_WIDEST_INT_PRINT_DEC.
* gcov-io.h (__fetch_gcov_type, __store_gcov_type, __read_gcov_type,
__write_gcov_type): New.
(store_long): Remove.
* gcov.c (gcov_type): Set default.
(struct adj_list): Use gcov_type for arc_count.
(bb_info): Use gcov_type for succ_count, pred_count and exec_count.
(create_program_flow_graph): Read arc_count properly.
(solve_program_flow_graph): 'total' is gcov_type.
(output_data): Line_counts is gcov_type, print it properly.
* libgcc2.c (struct bb): Counts is gcov_type.
(__bb_exit_func): Use __read_gcov_type and __write_gcov_type.
* profile.c (LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE): Set default.
(GCOV_TYPE_SIZE): Define.
(struct bb_info): succ_count and pred_count is gcov_type.
(compute_branch_probabilities): Use __read_gcov_type,
print read edges to the dump file.
(total): Is gcov_type.
(gen_edge_profiler): Use GCOV_TYPE_SIZE.
From-SVN: r43505
2001-06-22 19:18:23 +02:00
|
|
|
|
local_reg_freq[j] = 0;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
/* For each other pseudo-reg conflicting with this one,
|
|
|
|
|
mark it as conflicting with the hard regs this one occupies. */
|
1999-11-21 13:53:31 +01:00
|
|
|
|
lim = num;
|
1999-11-09 00:17:51 +01:00
|
|
|
|
EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + lim * allocno_row_words, j,
|
1999-11-06 00:07:21 +01:00
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (allocno[j].hard_reg_conflicts, this_reg);
|
1999-11-06 00:07:21 +01:00
|
|
|
|
});
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Called from `reload' to look for a hard reg to put pseudo reg REGNO in.
|
|
|
|
|
Perhaps it had previously seemed not worth a hard reg,
|
|
|
|
|
or perhaps its old hard reg has been commandeered for reloads.
|
|
|
|
|
FORBIDDEN_REGS indicates certain hard regs that may not be used, even if
|
|
|
|
|
they do not appear to be allocated.
|
|
|
|
|
If FORBIDDEN_REGS is zero, no regs are forbidden. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
retry_global_alloc (regno, forbidden_regs)
|
|
|
|
|
int regno;
|
|
|
|
|
HARD_REG_SET forbidden_regs;
|
|
|
|
|
{
|
2001-08-08 23:53:46 +02:00
|
|
|
|
int alloc_no = reg_allocno[regno];
|
|
|
|
|
if (alloc_no >= 0)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
/* If we have more than one register class,
|
|
|
|
|
first try allocating in the class that is cheapest
|
|
|
|
|
for this pseudo-reg. If that fails, try any reg. */
|
|
|
|
|
if (N_REG_CLASSES > 1)
|
2001-08-08 23:53:46 +02:00
|
|
|
|
find_reg (alloc_no, forbidden_regs, 0, 0, 1);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
if (reg_renumber[regno] < 0
|
1992-07-06 22:04:10 +02:00
|
|
|
|
&& reg_alternate_class (regno) != NO_REGS)
|
2001-08-08 23:53:46 +02:00
|
|
|
|
find_reg (alloc_no, forbidden_regs, 1, 0, 1);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* If we found a register, modify the RTL for the register to
|
|
|
|
|
show the hard register, and mark that register live. */
|
|
|
|
|
if (reg_renumber[regno] >= 0)
|
|
|
|
|
{
|
|
|
|
|
REGNO (regno_reg_rtx[regno]) = reg_renumber[regno];
|
|
|
|
|
mark_home_live (regno);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Record a conflict between register REGNO
|
|
|
|
|
and everything currently live.
|
|
|
|
|
REGNO must not be a pseudo reg that was allocated
|
|
|
|
|
by local_alloc; such numbers must be translated through
|
|
|
|
|
reg_renumber before calling here. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
record_one_conflict (regno)
|
|
|
|
|
int regno;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int j;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER)
|
|
|
|
|
/* When a hard register becomes live,
|
|
|
|
|
record conflicts with live pseudo regs. */
|
1999-11-06 00:07:21 +01:00
|
|
|
|
EXECUTE_IF_SET_IN_ALLOCNO_SET (allocnos_live, j,
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
SET_HARD_REG_BIT (allocno[j].hard_reg_conflicts, regno);
|
1999-11-06 00:07:21 +01:00
|
|
|
|
});
|
1991-12-14 13:14:54 +01:00
|
|
|
|
else
|
|
|
|
|
/* When a pseudo-register becomes live,
|
|
|
|
|
record conflicts first with hard regs,
|
|
|
|
|
then with other pseudo regs. */
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int ialloc = reg_allocno[regno];
|
|
|
|
|
int ialloc_prod = ialloc * allocno_row_words;
|
|
|
|
|
|
1999-11-21 13:53:31 +01:00
|
|
|
|
IOR_HARD_REG_SET (allocno[ialloc].hard_reg_conflicts, hard_regs_live);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = allocno_row_words - 1; j >= 0; j--)
|
|
|
|
|
{
|
|
|
|
|
#if 0
|
|
|
|
|
int k;
|
|
|
|
|
for (k = 0; k < n_no_conflict_pairs; k++)
|
|
|
|
|
if (! ((j == no_conflict_pairs[k].allocno1
|
|
|
|
|
&& ialloc == no_conflict_pairs[k].allocno2)
|
|
|
|
|
||
|
|
|
|
|
(j == no_conflict_pairs[k].allocno2
|
|
|
|
|
&& ialloc == no_conflict_pairs[k].allocno1)))
|
|
|
|
|
#endif /* 0 */
|
|
|
|
|
conflicts[ialloc_prod + j] |= allocnos_live[j];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Record all allocnos currently live as conflicting
|
1999-11-12 02:56:17 +01:00
|
|
|
|
with all hard regs currently live.
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
ALLOCNO_VEC is a vector of LEN allocnos, all allocnos that
|
|
|
|
|
are currently live. Their bits are also flagged in allocnos_live. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
record_conflicts (allocno_vec, len)
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int *allocno_vec;
|
|
|
|
|
int len;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int num;
|
|
|
|
|
int ialloc_prod;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
while (--len >= 0)
|
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
num = allocno_vec[len];
|
|
|
|
|
ialloc_prod = num * allocno_row_words;
|
|
|
|
|
IOR_HARD_REG_SET (allocno[num].hard_reg_conflicts, hard_regs_live);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
|
|
|
|
/* If CONFLICTP (i, j) is true, make sure CONFLICTP (j, i) is also true. */
|
|
|
|
|
static void
|
|
|
|
|
mirror_conflicts ()
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int i, j;
|
1999-11-05 09:31:48 +01:00
|
|
|
|
int rw = allocno_row_words;
|
|
|
|
|
int rwb = rw * INT_BITS;
|
|
|
|
|
INT_TYPE *p = conflicts;
|
|
|
|
|
INT_TYPE *q0 = conflicts, *q1, *q2;
|
|
|
|
|
unsigned INT_TYPE mask;
|
|
|
|
|
|
|
|
|
|
for (i = max_allocno - 1, mask = 1; i >= 0; i--, mask <<= 1)
|
|
|
|
|
{
|
|
|
|
|
if (! mask)
|
|
|
|
|
{
|
|
|
|
|
mask = 1;
|
|
|
|
|
q0++;
|
|
|
|
|
}
|
|
|
|
|
for (j = allocno_row_words - 1, q1 = q0; j >= 0; j--, q1 += rwb)
|
|
|
|
|
{
|
|
|
|
|
unsigned INT_TYPE word;
|
|
|
|
|
|
|
|
|
|
for (word = (unsigned INT_TYPE) *p++, q2 = q1; word;
|
|
|
|
|
word >>= 1, q2 += rw)
|
|
|
|
|
{
|
|
|
|
|
if (word & 1)
|
|
|
|
|
*q2 |= mask;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Handle the case where REG is set by the insn being scanned,
|
|
|
|
|
during the forward scan to accumulate conflicts.
|
|
|
|
|
Store a 1 in regs_live or allocnos_live for this register, record how many
|
|
|
|
|
consecutive hardware registers it actually needs,
|
|
|
|
|
and record a conflict with all other registers already live.
|
|
|
|
|
|
|
|
|
|
Note that even if REG does not remain alive after this insn,
|
|
|
|
|
we must mark it here as live, to ensure a conflict between
|
|
|
|
|
REG and any other regs set in this insn that really do live.
|
|
|
|
|
This is because those other regs could be considered after this.
|
|
|
|
|
|
|
|
|
|
REG might actually be something other than a register;
|
|
|
|
|
if so, we do nothing.
|
|
|
|
|
|
|
|
|
|
SETTER is 0 if this register was modified by an auto-increment (i.e.,
|
1998-10-06 22:38:40 +02:00
|
|
|
|
a REG_INC note was found for it). */
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
static void
|
1999-10-27 21:27:41 +02:00
|
|
|
|
mark_reg_store (reg, setter, data)
|
1998-10-06 22:38:40 +02:00
|
|
|
|
rtx reg, setter;
|
1999-10-27 21:27:41 +02:00
|
|
|
|
void *data ATTRIBUTE_UNUSED;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int regno;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) == SUBREG)
|
Use byte offsets in SUBREGs instead of words.
2001-04-03 Jakub Jelinek <jakub@redhat.com>
David S. Miller <davem@pierdol.cobaltmicro.com>
Andrew MacLeod <amacleod@redhat.com>
Use byte offsets in SUBREGs instead of words.
* alias.c (nonlocal_mentioned_p): Use subreg_regno function.
* caller-save.c (mark_set_regs): Change callers of subreg_hard_regno
to pass new argument.
(add_stored_regs): Use subreg_regno_offset function.
* calls.c (expand_call): For non-paradoxical SUBREG take endianess
into account.
(precompute_arguments): Use gen_lowpart_SUBREG.
* combine.c (try_combine): Replace explicit XEXP with SUBREG_REG.
(combine_simplify_rtx): Rework to use SUBREG_BYTE.
(simplify_set): Rework to use SUBREG_BYTE.
(expand_field_assignment): Use SUBREG_BYTE.
(make_extraction): Use SUBREG_BYTE.
(if_then_else_cond): Use SUBREG_BYTE.
(apply_distributive_law): Use SUBREG_BYTE and fixup subreg comments.
(gen_lowpart_for_combine): Compute full byte offset.
* cse.c (mention_regs): Use SUBREG_BYTE.
(remove_invalid_subreg_refs): Rework to use SUBREG_BYTE.
(canon_hash): Use SUBREG_BYTE.
(fold_rtx): Pass SUBREG_BYTE div UNITS_PER_WORD to operand_subword.
(gen_lowpart_if_possible): Formatting.
* dbxout.c (dbxout_symbol_location): Compute SUBREG hard regnos
correctly.
* dwarf2out.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* dwarfout.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(output_mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(output_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* emit-rtl.c (gen_rtx_SUBREG): New function, used to verify
certain invariants about SUBREGs the compiler creates.
(gen_lowpart_SUBREG): New function.
(subreg_hard_regno): New function to get the final register number.
(gen_lowpart_common): Use SUBREG_BYTE.
(gen_imagpart): Spacing nits.
(subreg_realpart_p): Use SUBREG_BYTE.
(gen_highpart): Use SUBREG_BYTE.
(subreg_lowpart_p): Always compute endian corrected goal offset,
even at the byte level, then compare against that.
(constant_subword): New function, pulled out all constant cases
from operand_subword and changed second argument name to offset.
(operand_subword): Detect non REG/SUBREG/CONCAT/MEM cases early
and call constant_subword to do the work. Return const0_rtx if
looking for a word outside of OP.
(operand_subword_force): Change second arg name to offset.
* expmed.c (store_bit_field): Use SUBREG_BYTE.
(store_split_bit_field): Use SUBREG_BYTE.
(extract_bit_field): Use SUBREG_BYTE.
(extract_split_bit_field): Use SUBREG_BYTE.
(expand_shift): Use SUBREG_BYTE.
* expr.c (store_expr, expand_expr): Use gen_lowpart_SUBREG.
* final.c (alter_subreg) Use subreg_hard_regno and SUBREG_BYTE.
* flow.c (set_noop_p): Use SUBREG_BYTE.
(mark_set_1): Remove ALTER_HARD_SUBREG. Use subreg_regno_offset instead.
* function.c (fixup_var_refs_1): Fixup explicit XEXP into a SUBREG_REG.
(fixup_memory_subreg): Use SUBREG_BYTE and remove byte endian
correction code.
(optimize_bit_field): Use SUBREG_BYTE.
(purge_addressof_1): Use SUBREG_BYTE.
(purge_single_hard_subreg_set): Use subreg_regno_offset function.
(assign_params): Mark arguments SUBREG_PROMOTED_VAR_P if they are
actually promoted by the caller and PROMOTE_FOR_CALLS_ONLY is true.
* gengenrtl.c (special_rtx): Add SUBREG.
* global.c (mark_reg_store): Use SUBREG_BYTE.
(set_preference): Rework to use subreg_regno_offset and SUBREG_BYTE.
* ifcvt (noce_emit_move_insn): Use SUBREG_BYTE.
* integrate.c (copy_rtx_and_substitute): Use SUBREG_BYTE and make sure
final byte offset is congruent to subreg's mode size.
(subst_constants): Use SUBREG_BYTE.
(mark_stores): Use subreg_regno_offset function.
* jump.c (rtx_renumbered_equal_p, true_regnum): Use subreg_regno_offset
function and SUBREG_BYTE.
* local-alloc.c (combine_regs): Use subreg_regno_offset function.
(reg_is_born): Use subreg_hard_regno.
* recog.c (valid_replace_rtx_1): Use SUBREG_BYTE and remove byte
endian correction code. Don't combine subregs unless resulting
offset aligns with type. Fix subreg constant extraction for DImode.
Simplify SUBREG of VOIDmode CONST_DOUBLE.
(general_operand): Remove dead mode_altering_drug code.
(indirect_operand): Use SUBREG_BYTE.
(constrain_operands): Use subreg_regno_offset function.
* reg-stack.c (get_true_reg): Use subreg_regno_offset function.
* regmove.c (regmove_optimize): Use SUBREG_BYTE.
(optimize_reg_copy_3): Use gen_lowpart_SUBREG.
* regs.h (REG_SIZE): Allow target to override.
(REGMODE_NATURAL_SIZE): New macro which target can override.
* reload.c (reload_inner_reg_of_subreg): subreg_regno should be used
on the entire subreg rtx.
(push_reload): Use SUBREG_BYTE in comments and code.
(find_dummy_reload): Use subreg_regno_offset. Only adjust offsets
for hard registers inside subregs.
(operands_match_p): Use subreg_regno_offset.
(find_reloads): Use SUBREG_BYTE and only advance offset for subregs
containing hard regs.
(find_reload_toplev): Use SUBREG_BYTE. Remove byte endian
corrections when fixing up MEM subregs.
(find_reloads_address_1): Use SUBREG_BYTE, subreg_regno, and
subreg_regno_offset where appropriate.
(find_reloads_subreg_address): Use SUBREG_BYTE. Remove
byte endian corrections when fixing up MEM subregs.
(subst_reloads): When combining two subregs, make sure final
offset is congruent to subreg's mode size.
(find_replacement): Use SUBREG_BYTE and subreg_regno_offset.
(refers_to_regno_for_reload_p): Use subreg_regno.
(reg_overlap_mentioned_for_reload_p): Use subreg_regno_offset.
* reload1.c (eliminate_regs) Use SUBREG_BYTE. Remove byte endian
correction code for memory subreg fixups.
(forget_old_reload_1): Use subreg_regno_offset.
(choose_reload_regs): Use subreg_regno.
(emit_input_reload_insns): Use SUBREG_BYTE.
(reload_combine_note_store): Use subreg_regno_offset.
(move2add_note_store): Use subreg_regno_offset.
* resource.c (update_live_status, mark_referenced_resources): Use
subreg_regno function.
(mark_set_resources): Use subreg_regno function.
* rtl.h (SUBREG_WORD): Rename to SUBREG_BYTE.
(subreg_regno_offset, subreg_regno): Define prototypes.
(subreg_hard_regno, constant_subword, gen_rtx_SUBREG): Newi functions.
(gen_lowpart_SUBREG): Add prototype.
* rtl.texi (subreg): Update to reflect new byte offset representation.
Add mentioning of the effect that BYTES_BIG_ENDIAN has on subregs now.
* rtlanal.c (refers_to_regno_p): Use subreg_regno.
(reg_overlap_mentioned_p): Use subreg_regno.
(replace_regs); Make sure final offset of combined subreg is
congruent to size of subreg's mode.
(subreg_regno_offset): New function.
(subreg_regno): New function.
* sched-vis.c (print_value): Change SUBREG_WORD to SUBREG_BYTE.
* sdbout.c (sdbout_symbol): Compute offset using alter_subreg.
* stmt.c (expand_anon_union_decl): Use gen_lowpart_SUBREG.
* tm.texi (ALTER_HARD_SUBREG): Remove, it is now dead.
(SUBREG_REGNO_OFFSET): Describe SUBREG_REGNO_OFFSET overrides.
* config/a29k/a29k.c (gpc_reg_operand): Use subreg_regno.
(a29k_get_reloaded_address): Use SUBREG_BYTE.
(print_operand): Use SUBREG_BYTE.
* config/alpha/alpha.c (print_operand_address): Use SUBREG_BYTE.
* config/arm/arm.c (arm_reload_in_hi): Use SUBREG_BYTE.
(arm_reload_out_hi): Use SUBREG_BYTE.
* config/d30v/d30v.c (d30v_split_double): Use subreg_regno_offset
instead of SUBREG_WORD.
(d30v_print_operand_memory_reference): Use subreg_regno_offset.
* config/dsp16xx/dsp16xx.md (extendqihi2, zero_extendqihi2): Fix
SUBREG creation to use byte offset.
* config/h8300/h8300.md (Unnamed HImode zero extraction and 16bit
inverted load insns): Fix explicit rtl subregs to use byte
offsets.
* config/i370/i370.md (cmpstrsi, movstrsi, mulsi3, divsi3,
udivsi3, umodsi3): Generate SUBREGs with byte offsets.
* config/i860/i860.c (single_insn_src_p): Use SUBREG_BYTE.
* config/i860/i860.md (mulsi3_big): Fixup explicit SUBREGs in rtl
to use byte offsets.
(unnamed fmlow.dd insn): Fixup SUBREGS to use byte offsets.
* config/i960/i960.md (extendhisi2): Generate SUBREGs with byte
offsets, also make sure it is congruent to SUBREG's mode size.
(extendqisi2, extendqihi2, zero_extendhisi2, zero_extendqisi2,
unnamed ldob insn): Generate SUBREGs with byte offset.
(zero_extendqihi2): SUBREG's are byte offsets.
* config/m68hc11/m68hc11.c (m68hc11_gen_lowpart): Use SUBREG_BYTE.
(m68hc11_gen_highpart): Use SUBREG_BYTE.
* config/m68k/m68k.md (zero_extendhisi2, zero_extendqihi2,
zero-extendqisi2): Generate SUBREGs with byte offset.
(umulsidi3, mulsidi3, subreghi1ashrdi_const32,
subregsi1ashrdi_const32, subreg1lshrdi_const32): Fixup explicit
subregs in rtl to use byte offsets.
* config/m88k/m88k.md (extendsidi2): fixup subregs to use byte offset.
* config/mips/mips.c (mips_move_1word): Use subreg_regno_offset.
(mips_move_2words): Use subreg_regno_offset.
(mips_secondary_reload_class): Use subreg_regno_offset.
* config/mips/mips.md (DImode plus, minus, move, and logical op
splits): Fixup explicit subregs in rtl to use byte offsets.
* config/mn10200/mn10200.c (print_operand): Use subreg_regno function.
* config/mn10300/mn10300.c (print_operand): Use subreg_regno function.
* config/ns32k/ns32k.md (udivmoddisi4): Fix explicit subregs in
rtl to use byte offsets.
* config/pa/pa.c (emit_move_sequence): Use SUBREG_BYTE.
* config/pa/pa.md (floatunssisf2, floatunssidf2, mulsi3): fix explicit
subregs to use byte offsets.
* config/pdp11/pdp11.md (zero_extendhisi2, modhi3, modhi3+1):
Fixup explicit subregs in rtl to use byte offsets.
* config/romp/romp.c (memory_offset_in_range_p): Use SUBREG_BYTE
and remove byte endian correction code.
* config/sh/sh.c (output_movedouble): Use subreg_regno.
(gen_ashift_hi): Use SUBREG_BYTE.
(regs_used): Use subreg_regno_offset.
(machine_dependent_reorg): Use subreg_regno_offset.
* config/sh/sh.h (INDEX_REGISTER_RTX_P): Use SUBREG_BYTE.
* config/sh/sh.md (DImode and DFmode move splits): Use subreg_regno.
(movdf_i4): Subregs are byte offsets now.
* config/sparc/sparc.c (ultra_find_type): Use SUBREG_BYTE.
* config/sparc/sparc.h (ALTER_HARD_SUBREG): Removed.
(REGMODE_NATURAL_SIZE): Override.
(REG_SIZE): For SUBREG check float mode on SUBREG_REG's mode.
* config/sparc/sparc.md (TFmode move splits): Generate SUBREGs
with byte offsets.
(zero_extendhisi2, zero_extendqidi2_insn, extendhisi2,
extendqihi2, sign_extendqihi2_insn, sign_extendqisi2_insn,
extendqidi2): Generate SUBREGs with byte offsets, also make sure
it is congruent to SUBREG's mode size.
(smulsi3_highpart_v8plus): Fix explicit subregs in rtl to use byte
offsets.
(cmp_siqi_trunc, cmp_siqi_trunc_set, cmp_diqi_trunc,
cmp_diqi_trunc_set, lshrdi3_v8plus+1, lshrdi3_v8plus+2,
lshrdi3_v8plus+3, lshrdi3_v8plus+4): Use proper
SUBREG_BYTE offset for non-paradoxical subregs in patterns.
* config/v850/v850.c (print_operand, output_move_double): Use
subreg_regno function.
Co-Authored-By: Andrew MacLeod <amacleod@redhat.com>
Co-Authored-By: David S. Miller <davem@pierdol.cobaltmicro.com>
From-SVN: r41058
2001-04-03 17:06:12 +02:00
|
|
|
|
reg = SUBREG_REG (reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) != REG)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
regs_set[n_regs_set++] = reg;
|
|
|
|
|
|
1998-10-06 22:38:40 +02:00
|
|
|
|
if (setter && GET_CODE (setter) != CLOBBER)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
set_preference (reg, SET_SRC (setter));
|
|
|
|
|
|
|
|
|
|
regno = REGNO (reg);
|
|
|
|
|
|
|
|
|
|
/* Either this is one of the max_allocno pseudo regs not allocated,
|
|
|
|
|
or it is or has a hardware reg. First handle the pseudo-regs. */
|
|
|
|
|
if (regno >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
{
|
|
|
|
|
if (reg_allocno[regno] >= 0)
|
|
|
|
|
{
|
|
|
|
|
SET_ALLOCNO_LIVE (reg_allocno[regno]);
|
|
|
|
|
record_one_conflict (regno);
|
|
|
|
|
}
|
|
|
|
|
}
|
1998-09-08 02:29:35 +02:00
|
|
|
|
|
|
|
|
|
if (reg_renumber[regno] >= 0)
|
Use byte offsets in SUBREGs instead of words.
2001-04-03 Jakub Jelinek <jakub@redhat.com>
David S. Miller <davem@pierdol.cobaltmicro.com>
Andrew MacLeod <amacleod@redhat.com>
Use byte offsets in SUBREGs instead of words.
* alias.c (nonlocal_mentioned_p): Use subreg_regno function.
* caller-save.c (mark_set_regs): Change callers of subreg_hard_regno
to pass new argument.
(add_stored_regs): Use subreg_regno_offset function.
* calls.c (expand_call): For non-paradoxical SUBREG take endianess
into account.
(precompute_arguments): Use gen_lowpart_SUBREG.
* combine.c (try_combine): Replace explicit XEXP with SUBREG_REG.
(combine_simplify_rtx): Rework to use SUBREG_BYTE.
(simplify_set): Rework to use SUBREG_BYTE.
(expand_field_assignment): Use SUBREG_BYTE.
(make_extraction): Use SUBREG_BYTE.
(if_then_else_cond): Use SUBREG_BYTE.
(apply_distributive_law): Use SUBREG_BYTE and fixup subreg comments.
(gen_lowpart_for_combine): Compute full byte offset.
* cse.c (mention_regs): Use SUBREG_BYTE.
(remove_invalid_subreg_refs): Rework to use SUBREG_BYTE.
(canon_hash): Use SUBREG_BYTE.
(fold_rtx): Pass SUBREG_BYTE div UNITS_PER_WORD to operand_subword.
(gen_lowpart_if_possible): Formatting.
* dbxout.c (dbxout_symbol_location): Compute SUBREG hard regnos
correctly.
* dwarf2out.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* dwarfout.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(output_mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(output_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* emit-rtl.c (gen_rtx_SUBREG): New function, used to verify
certain invariants about SUBREGs the compiler creates.
(gen_lowpart_SUBREG): New function.
(subreg_hard_regno): New function to get the final register number.
(gen_lowpart_common): Use SUBREG_BYTE.
(gen_imagpart): Spacing nits.
(subreg_realpart_p): Use SUBREG_BYTE.
(gen_highpart): Use SUBREG_BYTE.
(subreg_lowpart_p): Always compute endian corrected goal offset,
even at the byte level, then compare against that.
(constant_subword): New function, pulled out all constant cases
from operand_subword and changed second argument name to offset.
(operand_subword): Detect non REG/SUBREG/CONCAT/MEM cases early
and call constant_subword to do the work. Return const0_rtx if
looking for a word outside of OP.
(operand_subword_force): Change second arg name to offset.
* expmed.c (store_bit_field): Use SUBREG_BYTE.
(store_split_bit_field): Use SUBREG_BYTE.
(extract_bit_field): Use SUBREG_BYTE.
(extract_split_bit_field): Use SUBREG_BYTE.
(expand_shift): Use SUBREG_BYTE.
* expr.c (store_expr, expand_expr): Use gen_lowpart_SUBREG.
* final.c (alter_subreg) Use subreg_hard_regno and SUBREG_BYTE.
* flow.c (set_noop_p): Use SUBREG_BYTE.
(mark_set_1): Remove ALTER_HARD_SUBREG. Use subreg_regno_offset instead.
* function.c (fixup_var_refs_1): Fixup explicit XEXP into a SUBREG_REG.
(fixup_memory_subreg): Use SUBREG_BYTE and remove byte endian
correction code.
(optimize_bit_field): Use SUBREG_BYTE.
(purge_addressof_1): Use SUBREG_BYTE.
(purge_single_hard_subreg_set): Use subreg_regno_offset function.
(assign_params): Mark arguments SUBREG_PROMOTED_VAR_P if they are
actually promoted by the caller and PROMOTE_FOR_CALLS_ONLY is true.
* gengenrtl.c (special_rtx): Add SUBREG.
* global.c (mark_reg_store): Use SUBREG_BYTE.
(set_preference): Rework to use subreg_regno_offset and SUBREG_BYTE.
* ifcvt (noce_emit_move_insn): Use SUBREG_BYTE.
* integrate.c (copy_rtx_and_substitute): Use SUBREG_BYTE and make sure
final byte offset is congruent to subreg's mode size.
(subst_constants): Use SUBREG_BYTE.
(mark_stores): Use subreg_regno_offset function.
* jump.c (rtx_renumbered_equal_p, true_regnum): Use subreg_regno_offset
function and SUBREG_BYTE.
* local-alloc.c (combine_regs): Use subreg_regno_offset function.
(reg_is_born): Use subreg_hard_regno.
* recog.c (valid_replace_rtx_1): Use SUBREG_BYTE and remove byte
endian correction code. Don't combine subregs unless resulting
offset aligns with type. Fix subreg constant extraction for DImode.
Simplify SUBREG of VOIDmode CONST_DOUBLE.
(general_operand): Remove dead mode_altering_drug code.
(indirect_operand): Use SUBREG_BYTE.
(constrain_operands): Use subreg_regno_offset function.
* reg-stack.c (get_true_reg): Use subreg_regno_offset function.
* regmove.c (regmove_optimize): Use SUBREG_BYTE.
(optimize_reg_copy_3): Use gen_lowpart_SUBREG.
* regs.h (REG_SIZE): Allow target to override.
(REGMODE_NATURAL_SIZE): New macro which target can override.
* reload.c (reload_inner_reg_of_subreg): subreg_regno should be used
on the entire subreg rtx.
(push_reload): Use SUBREG_BYTE in comments and code.
(find_dummy_reload): Use subreg_regno_offset. Only adjust offsets
for hard registers inside subregs.
(operands_match_p): Use subreg_regno_offset.
(find_reloads): Use SUBREG_BYTE and only advance offset for subregs
containing hard regs.
(find_reload_toplev): Use SUBREG_BYTE. Remove byte endian
corrections when fixing up MEM subregs.
(find_reloads_address_1): Use SUBREG_BYTE, subreg_regno, and
subreg_regno_offset where appropriate.
(find_reloads_subreg_address): Use SUBREG_BYTE. Remove
byte endian corrections when fixing up MEM subregs.
(subst_reloads): When combining two subregs, make sure final
offset is congruent to subreg's mode size.
(find_replacement): Use SUBREG_BYTE and subreg_regno_offset.
(refers_to_regno_for_reload_p): Use subreg_regno.
(reg_overlap_mentioned_for_reload_p): Use subreg_regno_offset.
* reload1.c (eliminate_regs) Use SUBREG_BYTE. Remove byte endian
correction code for memory subreg fixups.
(forget_old_reload_1): Use subreg_regno_offset.
(choose_reload_regs): Use subreg_regno.
(emit_input_reload_insns): Use SUBREG_BYTE.
(reload_combine_note_store): Use subreg_regno_offset.
(move2add_note_store): Use subreg_regno_offset.
* resource.c (update_live_status, mark_referenced_resources): Use
subreg_regno function.
(mark_set_resources): Use subreg_regno function.
* rtl.h (SUBREG_WORD): Rename to SUBREG_BYTE.
(subreg_regno_offset, subreg_regno): Define prototypes.
(subreg_hard_regno, constant_subword, gen_rtx_SUBREG): Newi functions.
(gen_lowpart_SUBREG): Add prototype.
* rtl.texi (subreg): Update to reflect new byte offset representation.
Add mentioning of the effect that BYTES_BIG_ENDIAN has on subregs now.
* rtlanal.c (refers_to_regno_p): Use subreg_regno.
(reg_overlap_mentioned_p): Use subreg_regno.
(replace_regs); Make sure final offset of combined subreg is
congruent to size of subreg's mode.
(subreg_regno_offset): New function.
(subreg_regno): New function.
* sched-vis.c (print_value): Change SUBREG_WORD to SUBREG_BYTE.
* sdbout.c (sdbout_symbol): Compute offset using alter_subreg.
* stmt.c (expand_anon_union_decl): Use gen_lowpart_SUBREG.
* tm.texi (ALTER_HARD_SUBREG): Remove, it is now dead.
(SUBREG_REGNO_OFFSET): Describe SUBREG_REGNO_OFFSET overrides.
* config/a29k/a29k.c (gpc_reg_operand): Use subreg_regno.
(a29k_get_reloaded_address): Use SUBREG_BYTE.
(print_operand): Use SUBREG_BYTE.
* config/alpha/alpha.c (print_operand_address): Use SUBREG_BYTE.
* config/arm/arm.c (arm_reload_in_hi): Use SUBREG_BYTE.
(arm_reload_out_hi): Use SUBREG_BYTE.
* config/d30v/d30v.c (d30v_split_double): Use subreg_regno_offset
instead of SUBREG_WORD.
(d30v_print_operand_memory_reference): Use subreg_regno_offset.
* config/dsp16xx/dsp16xx.md (extendqihi2, zero_extendqihi2): Fix
SUBREG creation to use byte offset.
* config/h8300/h8300.md (Unnamed HImode zero extraction and 16bit
inverted load insns): Fix explicit rtl subregs to use byte
offsets.
* config/i370/i370.md (cmpstrsi, movstrsi, mulsi3, divsi3,
udivsi3, umodsi3): Generate SUBREGs with byte offsets.
* config/i860/i860.c (single_insn_src_p): Use SUBREG_BYTE.
* config/i860/i860.md (mulsi3_big): Fixup explicit SUBREGs in rtl
to use byte offsets.
(unnamed fmlow.dd insn): Fixup SUBREGS to use byte offsets.
* config/i960/i960.md (extendhisi2): Generate SUBREGs with byte
offsets, also make sure it is congruent to SUBREG's mode size.
(extendqisi2, extendqihi2, zero_extendhisi2, zero_extendqisi2,
unnamed ldob insn): Generate SUBREGs with byte offset.
(zero_extendqihi2): SUBREG's are byte offsets.
* config/m68hc11/m68hc11.c (m68hc11_gen_lowpart): Use SUBREG_BYTE.
(m68hc11_gen_highpart): Use SUBREG_BYTE.
* config/m68k/m68k.md (zero_extendhisi2, zero_extendqihi2,
zero-extendqisi2): Generate SUBREGs with byte offset.
(umulsidi3, mulsidi3, subreghi1ashrdi_const32,
subregsi1ashrdi_const32, subreg1lshrdi_const32): Fixup explicit
subregs in rtl to use byte offsets.
* config/m88k/m88k.md (extendsidi2): fixup subregs to use byte offset.
* config/mips/mips.c (mips_move_1word): Use subreg_regno_offset.
(mips_move_2words): Use subreg_regno_offset.
(mips_secondary_reload_class): Use subreg_regno_offset.
* config/mips/mips.md (DImode plus, minus, move, and logical op
splits): Fixup explicit subregs in rtl to use byte offsets.
* config/mn10200/mn10200.c (print_operand): Use subreg_regno function.
* config/mn10300/mn10300.c (print_operand): Use subreg_regno function.
* config/ns32k/ns32k.md (udivmoddisi4): Fix explicit subregs in
rtl to use byte offsets.
* config/pa/pa.c (emit_move_sequence): Use SUBREG_BYTE.
* config/pa/pa.md (floatunssisf2, floatunssidf2, mulsi3): fix explicit
subregs to use byte offsets.
* config/pdp11/pdp11.md (zero_extendhisi2, modhi3, modhi3+1):
Fixup explicit subregs in rtl to use byte offsets.
* config/romp/romp.c (memory_offset_in_range_p): Use SUBREG_BYTE
and remove byte endian correction code.
* config/sh/sh.c (output_movedouble): Use subreg_regno.
(gen_ashift_hi): Use SUBREG_BYTE.
(regs_used): Use subreg_regno_offset.
(machine_dependent_reorg): Use subreg_regno_offset.
* config/sh/sh.h (INDEX_REGISTER_RTX_P): Use SUBREG_BYTE.
* config/sh/sh.md (DImode and DFmode move splits): Use subreg_regno.
(movdf_i4): Subregs are byte offsets now.
* config/sparc/sparc.c (ultra_find_type): Use SUBREG_BYTE.
* config/sparc/sparc.h (ALTER_HARD_SUBREG): Removed.
(REGMODE_NATURAL_SIZE): Override.
(REG_SIZE): For SUBREG check float mode on SUBREG_REG's mode.
* config/sparc/sparc.md (TFmode move splits): Generate SUBREGs
with byte offsets.
(zero_extendhisi2, zero_extendqidi2_insn, extendhisi2,
extendqihi2, sign_extendqihi2_insn, sign_extendqisi2_insn,
extendqidi2): Generate SUBREGs with byte offsets, also make sure
it is congruent to SUBREG's mode size.
(smulsi3_highpart_v8plus): Fix explicit subregs in rtl to use byte
offsets.
(cmp_siqi_trunc, cmp_siqi_trunc_set, cmp_diqi_trunc,
cmp_diqi_trunc_set, lshrdi3_v8plus+1, lshrdi3_v8plus+2,
lshrdi3_v8plus+3, lshrdi3_v8plus+4): Use proper
SUBREG_BYTE offset for non-paradoxical subregs in patterns.
* config/v850/v850.c (print_operand, output_move_double): Use
subreg_regno function.
Co-Authored-By: Andrew MacLeod <amacleod@redhat.com>
Co-Authored-By: David S. Miller <davem@pierdol.cobaltmicro.com>
From-SVN: r41058
2001-04-03 17:06:12 +02:00
|
|
|
|
regno = reg_renumber[regno];
|
1998-09-08 02:29:35 +02:00
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Handle hardware regs (and pseudos allocated to hard regs). */
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno])
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
while (regno < last)
|
|
|
|
|
{
|
|
|
|
|
record_one_conflict (regno);
|
|
|
|
|
SET_HARD_REG_BIT (hard_regs_live, regno);
|
|
|
|
|
regno++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Like mark_reg_set except notice just CLOBBERs; ignore SETs. */
|
|
|
|
|
|
|
|
|
|
static void
|
1999-10-27 21:27:41 +02:00
|
|
|
|
mark_reg_clobber (reg, setter, data)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
rtx reg, setter;
|
1999-10-27 21:27:41 +02:00
|
|
|
|
void *data ATTRIBUTE_UNUSED;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
1998-10-06 22:38:40 +02:00
|
|
|
|
if (GET_CODE (setter) == CLOBBER)
|
1999-10-27 21:27:41 +02:00
|
|
|
|
mark_reg_store (reg, setter, data);
|
1992-03-22 04:36:46 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Record that REG has conflicts with all the regs currently live.
|
|
|
|
|
Do not mark REG itself as live. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
mark_reg_conflicts (reg)
|
|
|
|
|
rtx reg;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int regno;
|
1992-03-22 04:36:46 +01:00
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) == SUBREG)
|
|
|
|
|
reg = SUBREG_REG (reg);
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) != REG)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
regno = REGNO (reg);
|
|
|
|
|
|
|
|
|
|
/* Either this is one of the max_allocno pseudo regs not allocated,
|
|
|
|
|
or it is or has a hardware reg. First handle the pseudo-regs. */
|
|
|
|
|
if (regno >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
{
|
|
|
|
|
if (reg_allocno[regno] >= 0)
|
|
|
|
|
record_one_conflict (regno);
|
|
|
|
|
}
|
1998-09-08 02:29:35 +02:00
|
|
|
|
|
|
|
|
|
if (reg_renumber[regno] >= 0)
|
|
|
|
|
regno = reg_renumber[regno];
|
|
|
|
|
|
1992-03-22 04:36:46 +01:00
|
|
|
|
/* Handle hardware regs (and pseudos allocated to hard regs). */
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno])
|
1992-03-22 04:36:46 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg));
|
1992-03-22 04:36:46 +01:00
|
|
|
|
while (regno < last)
|
|
|
|
|
{
|
|
|
|
|
record_one_conflict (regno);
|
|
|
|
|
regno++;
|
|
|
|
|
}
|
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Mark REG as being dead (following the insn being scanned now).
|
|
|
|
|
Store a 0 in regs_live or allocnos_live for this register. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
mark_reg_death (reg)
|
|
|
|
|
rtx reg;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int regno = REGNO (reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
/* Either this is one of the max_allocno pseudo regs not allocated,
|
|
|
|
|
or it is a hardware reg. First handle the pseudo-regs. */
|
|
|
|
|
if (regno >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
{
|
|
|
|
|
if (reg_allocno[regno] >= 0)
|
|
|
|
|
CLEAR_ALLOCNO_LIVE (reg_allocno[regno]);
|
|
|
|
|
}
|
1998-09-08 02:29:35 +02:00
|
|
|
|
|
|
|
|
|
/* For pseudo reg, see if it has been assigned a hardware reg. */
|
|
|
|
|
if (reg_renumber[regno] >= 0)
|
|
|
|
|
regno = reg_renumber[regno];
|
|
|
|
|
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Handle hardware regs (and pseudos allocated to hard regs). */
|
1998-09-08 02:29:35 +02:00
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno])
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
/* Pseudo regs already assigned hardware regs are treated
|
|
|
|
|
almost the same as explicit hardware regs. */
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
while (regno < last)
|
|
|
|
|
{
|
|
|
|
|
CLEAR_HARD_REG_BIT (hard_regs_live, regno);
|
|
|
|
|
regno++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Mark hard reg REGNO as currently live, assuming machine mode MODE
|
|
|
|
|
for the value stored in it. MODE determines how many consecutive
|
|
|
|
|
registers are actually in use. Do not record conflicts;
|
|
|
|
|
it is assumed that the caller will do that. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
mark_reg_live_nc (regno, mode)
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int regno;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
enum machine_mode mode;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int last = regno + HARD_REGNO_NREGS (regno, mode);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
while (regno < last)
|
|
|
|
|
{
|
|
|
|
|
SET_HARD_REG_BIT (hard_regs_live, regno);
|
|
|
|
|
regno++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Try to set a preference for an allocno to a hard register.
|
|
|
|
|
We are passed DEST and SRC which are the operands of a SET. It is known
|
|
|
|
|
that SRC is a register. If SRC or the first operand of SRC is a register,
|
|
|
|
|
try to set a preference. If one of the two is a hard register and the other
|
|
|
|
|
is a pseudo-register, mark the preference.
|
|
|
|
|
|
1992-05-07 08:41:23 +02:00
|
|
|
|
Note that we are not as aggressive as local-alloc in trying to tie a
|
1991-12-14 13:14:54 +01:00
|
|
|
|
pseudo-register to a hard register. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
set_preference (dest, src)
|
|
|
|
|
rtx dest, src;
|
|
|
|
|
{
|
* Rework fields used to describe positions of bitfields and
modify sizes to be unsigned and use HOST_WIDE_INT.
* alias.c (reg_known_value_size): Now unsigned.
* c-typeck.c (build_unary_op, case ADDR_EXPR): Use byte_position.
(really_start_incremental_init): Use bitsize_zero_node.
(push_init_level, pop_init_level, output_init_element): Likewise.
Use bitsize_unit_node and bitsize_one_node.
(output_pending_init_elements, process_init_element): Likewise.
* combine.c (combine_max_regno, reg_sign_bit_copies): Now unsigned.
(make_extraction): Position and length HOST_WIDE_INT and unsigned
HOST_WIDE_INT, respectively.
(get_pos_from_mask): Passed in value is unsigned HOST_WIDE_INT.
(num_sign_bit_copies): Returns unsigned.
BITWIDTH now unsigned; rework arithmetic.
Remove recursive call from arg to MAX.
(combine_instructions, init_reg_last_arrays): NREGS now unsigned.
(setup_incoming_promotions, can_combine_p, try_combine, simplify_set):
REGNO now unsigned.
(set_nonzero_bit_and_sign_copies): NUM now unsigned.
(find_split_point, expand_compound_operation, make_extraction): LEN
now unsigned HOST_WIDE_INT, POS now HOST_WIDE_INT.
(make_field_assignment): Likewise.
(combine_simplify_rtx): Add cast.
(expand_compound_operation): MODEWIDTH now unsigned; rework arithmetic.
(force_to_mode): WIDTH now unsigned; add cast.
(if_then_else_cond): SIZE now unsigned.
(nonzero_bits): MODE_WIDTH, RESULT_WIDTH, and WIDTH now unsigned.
(extended_count): Now returns unsigned.
(simplify_shift_const): COUNT unsigned; arg is now INPUT_COUNT.
Add SIGNED_COUNT variable; MODE_WORDS and FIRST_COUNT now unsigned.
(simplify_comparison): MODE_WIDTH now unsigned.
(update_table_tick): REGNO and ENDREGNO now unsigned; new var R.
(mark_used_regs_combine): Likewise; rework arithmetic.
(record_value_for_reg): REGNO, ENDREGNO, and I now unsigned.
(record_dead_and_set_regs, reg_dead_at_p, distribute_notes): Likewise.
(record_promoted_value): REGNO now unsigned.
(get_last_value_validate): REGNO, ENDREGNO, and J now unsigned.
(get_last_value): REGNO now unsigned.
(use_crosses_set_p): REGNO and ENDREGNO now unsigned.
(reg_dead_regno, reg_dead_endregno): Now unsigned.
(remove_death): Arg REGNO now unsigned.
(move_deaths): REGNO, DEADREGNO, DEADEND, OUREND, and I now unsigned.
(reg_bitfield_target_p): REGNO, REGNO, ENDREGNO, and ENDTREGNO
now unsigned.
* convert.c (convert_to_integer): INPREC and OUTPREC now unsigned.
* cse.c (struct qty_table_elem): FIRST_REG and LAST_REG now unsigned.
(struct cse_reg_info): REGNO now unsigned.
(cached_regno): Now unsigned.
(REGNO_QTY_VALID_P): Add cast.
(make_new_qty, make_regs_eqv, delete_reg_eqiv): Regno args unsigned.
(remove_invalid_regs): Likewise.
(remove_invalid_subreg_refs): Likewise; arg WORD also unsigned
as are variables END and I.
(get_cse_reg_info, insert): Likewise.
(mention_regs, invalidate_for_call): REGNO, ENDREGNO, and I unsigned.
(canon_hash): Likewise.
(insert_regs, lookup_for_remove): REGNO now unsigned.
(invalidate): REGNO, ENDREGNO, TREGNO, and TENDREGNO now unsigned.
New variable RN.
* dbxout.c (dbxout_parms, dbxout_reg_parms): Don't check for REGNO < 0.
* dwarf2out.c (dwarf2ou_frame_debug_expr): Remove cast.
* emit-rtl.c (subreg_realpart_p): Add cast.
(operand_subword): Arg I is now unsigned as is var PARTWORDS.
(operand_subword_force): Arg I is now unsigned.
* except.c (eh_regs): Variable I is now unsigned.
* explow.c (hard_function_value): BYTES is unsigned HOST_WIDE_INT.
* expmed.c (store_fixed_bit_field): Position is HOST_WIDE_INT;
length is unsigned HOST_WIDE_INT; likewise for internal variables.
(store_split_bit_field, extract_fixed_bit_field): Likewise.
(extract_split_bit_field, store_bit_field, extract_bit_field):
Likewise.
* expr.c (store_constructor_fields, store_constructor, store_field):
Positions are HOST_WIDE_INT and lengths are unsigned HOST_WIDE_INT.
(expand_assignment, expand_expr, expand_expr_unaligned): Likewise.
(do_jump): Likewise.
(move_by_pieces, move_by_pieces_ninsns, clear_by_pieces):
MAX_SIZE is now unsigned.
(emit_group_load): BYTEPOS is HOST_WIDE_INT; BYTELEN is unsigned.
(emit_group_store): Likewise.
(emit_move_insn): I now unsigned.
(store_constructor): Use host_integerp, tree_low_cst, and
bitsize_unit_node.
(get_inner_reference): Return bitpos and bitsize as HOST_WIDE_INT.
Rework all calculations to use trees and new fields.
* expr.h (promoted_input_arg): Regno now unsigned.
(store_bit_field, extract_bit_field): Adjust types of pos and size.
(mark_seen_cases): Arg is HOST_WIDE_INT.
* flow.c (verify_wide_reg_1): REGNO now unsigned.
* fold-const.c (decode_field_reference): Size and pos HOST_WIDE_INT;
precisions and alignments are unsigned.
(optimize_bit_field_compare, fold_truthop): Likewise.
(int_const_binop): Adjust threshold for size_int_type_wide call.
(fold_convert): Likewise.
(size_int_type_wide): Make table larger and fix thinko that only
had half of table used.
(all_ones_mask_p, fold): Precisions are unsigned.
* function.c (put_reg_info_stack): REGNO is unsigned.
(instantiate_decl): Size is HOST_WIDE_INT.
(instantiate_virtual_regs): I is unsigned.
(assign_parms): REGNO, REGNOI, and REGNOR are unsigned.
(promoted_input_arg): REGNO is unsigned.
* function.h (struct function): x_max_parm_reg is now unsigned.
* gcse.c (max_gcse_regno): Now unsigned.
(struct null_pointer_info): min_reg and max_reg now unsigned.
(lookup_set, next_set): REGNO arg now unsigned.
(compute_hash_table): REGNO and I now unsigned.
(handle_avail_expr): regnum_for_replacing now unsigned.
(cprop_insn): REGNO now unsigned.
(delete_null_pointer_checks_1): BLOCK_REG now pointer to unsigned.
* ggc-common.c (ggc_mark_tree_children, case FIELD_DECL): New case.
* global.c (set_preference): SRC_REGNO, DEST_REGNO, and I now unsigned.
* hard-reg-set.h (reg_class_size): Now unsigned.
* integrate.c (mark_stores): LAST_REG and I now unsigned; new UREGNO.
* jump.c (mark_modified_reg): I now unsigned; add cast.
(rtx_equal_for_thread_p): Add cast.
* loop.c (max_reg_before_loop): Now unsigned.
(struct_movable): REGNO now unsigned.
(try_copy_prop): REGNO arg unsigned.
(regs_match_p): XN and YN now unsigned.
(consec_sets_invariant_p, maybe_eliminate_biv): REGNO now unsigned.
(strength_reduce): Likewise; NREGS also unsigned.
(first_increment_giv, last_increment_giv unsigned): Now unsigned.
* loop.h (struct iv_class): REGNO now unsigned.
(max_reg_before_loop, first_increment_giv, last_increment_giv):
Now unsigned.
* machmode.h (mode_size, mode_unit_size): Now unsigned.
(mode_for_size, smallest_mode_for_size): Pass size as unsigned.
* optabs.c (expand_binop): I and NWORDS now unsigned.
(expand_unop): I now unsigned.
* print-tree.c (print_node): Don't print DECL_FIELD_BITPOS, but do
print DECL_FIELD_OFFSET and DECL_FIELD_BIT_OFFSET.
* real.c (significand_size): Now returns unsigned.
* real.h (significand_size): Likewise.
* regclass.c (reg_class_size): Now unsigned.
(choose_hard_reg_mode): Both operands now unsigned.
(record_reg_classes): REGNO and NR now unsigned.
(reg_scan): NREGS now unsigned.
(reg_scan_update): old_max_regno now unsigned.
(reg_scan_mark_refs): Arg MIN_REGNO and var REGNO now unsigned.
* reload.c (find_valid_class): BEST_SIZE now unsigned.
(find_dummy_reload): REGNO, NWORDS, and I now unsigned.
(hard_reg_set_here_p): Args BEG_REGNO and END_REGNO now unsigned.
Likewise for variable R.
(refers_to_regno_for_reload_p): Args REGNO and END_REGNO now unsigned,
as are variables INNER_REGNO and INNER_ENDREGNO; add new variable R.
(find_equiv_reg): Add casts.
(regno_clobbered_p): Arg REGNO now unsigned.
* reload.h (struct reload): NREGS now unsigned.
(refers_to_regno_for_reload_p): Regno args are unsigned.
(regno_clobbered_p): Likewise.
* reload1.c (reg_max_ref_width, spill_stack_slot_width): Now unsigned.
(compute_use_by_pseudos): REGNO now unsigned.
(find_reg): I and J now unsigned, new variable K, and change loop
variables accordingly; THIS_NREGS now unsigned.
(alter_reg): INHERENT_SIZE and TOTAL_SIZE now unsigned.
(spill_hard_reg): REGNO arg now unsigned; add casts.
(forget_old_reloads_1): REGNO, NR, and I now unsigned.
(mark_reload_reg_in_use): Arg REGNO and vars NREGS and I now unsigned.
(clear_reload_reg_in_use): Arg REGNO and vars NREGS, START_REGNO,
END_REGNO, CONFLICT_START, and CONFLICT_END now unsigned.
(reload_reg_free_p, reload_reg_reaches_end_p): Arg REGNO now unsigned.
(choose_reload_regs): MAX_GROUP_SIZE now unsigned.
(emit_reload_insns): REGNO now unsigned.
(reload_cse_move2add): Add cast.
(move2add_note_store): REGNO and I now unsigned; new variable ENDREGNO
and rework loop.
* resource.c (mark_referenced_resources, mark_set_resources): New
variable R; REGNO and LAST_REGNO now unsigned.
(mark_target_live_regs): J and REGNO now unsigned.
* rtl.c (mode_size, mode_unit_size): Now unsigned.
* rtl.h (union rtunion_def): New field rtuint.
(XCUINT): New macro.
(ADDRESSOF_REGNO, REGNO, SUBREG_WORD): New XCUINT.
(operand_subword, operand_subword_force): Word number is unsigned.
(choose_hard_reg_mode): Operands are unsigned.
(refers_to-regno_p, dead_or_set_regno_p): Regno arg is unsigned.
(find_regno_note, find_regno_fusage, replace_regs): Likewise.
(regno_use_in, combine_instructions, remove_death): Likewise.
(reg_scan, reg_scan_update): Likewise.
(extended_count): Return is unsigned.
* rtlanal.c (refers_to_regno_p): Args REGNO and ENDREGNO and vars I,
INNER_REGNO, and INNER_ENDREGNO now unsigned; new variable X_REGNO.
(reg_overlap_mentioned_p): REGNO and ENDREGNO now unsigned.
(reg_set_last_first_regno, reg_set_last_last_regno): Now unsigned.
(reg_reg_last_1): FIRS and LAST now unsigned.
(dead_or_set_p): REGNO, LAST_REGNO, and I now unsigned.
(dead_or_set_regno_p): Arg TEST_REGNO and vars REGNO and ENDREGNO
now unsigned.
(find_regno_note, regno_use_in): Arg REGNO now unsigned.
(find_regno_fusage): Likewise; also var REGNOTE now unsigned.
(find_reg_fusage): Variables REGNO, END_REGNO, and I now unsigned.
(replace_regs): Arg NREGS now unsigned.
* sdbout.c (sdbout_parms, sdbout_reg_parms): Don't check REGNO < 0.
* simplify-rtx.c (simplify_unary_operation): WIDTH now unsigned.
(simplify_binary_operation): Likewise.
(cselib_invalidate_regno): Arg REGNO and variables ENDREGNO, I, and
THIS_LAST now unsigned.
(cselib_record_set): Add cast.
* ssa.c (ssa_max_reg_num): Now unsigned.
(rename_block): REGNO now unsigned.
* stmt.c (expand_return): Bit positions unsigned HOST_WIDE_INT;
sizes now unsigned.
(all_cases_count): Just return -1 not -2.
COUNT, MINVAL, and LASTVAL now HOST_WIDE_INT.
Rework tests to use trees whenever possible.
Use host_integerp and tree_low_cst.
(mark_seen_cases): COUNT arg now HOST_WIDE_INT;
Likewise variable NEXT_NODE_OFFSET; XLO now unsigned.
(check_for_full_enumeration_handing): BYTES_NEEDED, I to HOST_WIDE_INT.
* stor-layout.c (mode_for_size): SIZE arg now unsigned.
(smallest_mode_for_size): Likewise.
(layout_decl): Simplify handing of a specified DECL_SIZE_UNIT.
KNOWN_ALIGN is now an alignment, so simplify code.
Don't turn off DECL_BIT_FIELD if field is BLKmode, but not type.
(start_record_layout): Renamed from new_record_layout_info.
Update to new fields.
(debug_rli, normalize_rli, rli_size_unit_so_far, rli_size_so_far):
New functions.
(place_union_field): Renamed from layout_union_field.
Update to use new fields in rli.
(place_field): Renamed from layout_field.
Major rewrite to use new fields in rli; pass alignment to layout_decl.
(finalize_record_size): Rework to use new fields in rli and handle
union.
(compute_record_mode): Rework to simplify and to use new DECL fields.
(finalize_type_size): Make rounding more consistent.
(finish_union_layout): Deleted.
(layout_type, case VOID_TYPE): Don't set TYPE_SIZE_UNIT either.
(layout_type, case RECORD_TYPE): Call new function names.
(initialize_sizetypes): Set TYPE_IS_SIZETYPE.
(set_sizetype): Set TYPE_IS_SIZETYPE earlier.
(get_best_mode): UNIT is now unsigned; remove casts.
* tree.c (bit_position): Compute from new fields.
(byte_position, int_byte_position): New functions.
(print_type_hash_statistics): Cast to remove warning.
(build_range_type): Use host_integerp and tree_low_cst to try to hash.
(build_index_type): Likewise; make subtype of sizetype.
(build_index_2_type): Pass sizetype to build_range_type.
(build_common_tree_nodes): Use size_int and bitsize_int to
initialize nodes; add bitsize_{zero,one,unit}_node.
* tree.h (DECL_FIELD_CONTEXT): Use FIELD_DECL_CHECK.
(DECL_BIT_FIELD_TYPE, DECL_QUALIFIER, DECL_FCONTEXT): Likewise.
(DECL_PACKED, DECL_BIT_FIELD): Likewise.
(DECL_FIELD_BITPOS): Deleted.
(DECL_FIELD_OFFSET, DECL_FIELD_BIT_OFFSET): New fields.
(DECL_RESULT, DECL_SAVED_INSNS): Use FUNCTION_DECL_CHECK.
(DECL_FRAME_SIZE, DECL_FUNCTION_CODE, DECL_NO_STATIC_CHAIN): Likewise.
(DECL_INLINE, DECL_BUILT_IN_NONANSI, DECL_IS_MALLOC): Likewise.
(DECL_BUILT_IN_CLASS, DECL_STATIC_CONSTRUCTOR): Likewise.
(DECL_STATIC_DESTRUCTOR, DECL_NO_CHECK_MEMORY_USAGE): Likewise.
(DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT, DECL_NO_LIMIT_STACK) Likewise.
(DECL_ORIGINAL_TYPE, TYPE_DECL_SUPPRESS_DEBUG): Use TYPE_DECL_CHECK.
(DECL_ARG_TYPE_AS_WRITEN, DECL_ARG_TYPE): Use PARM_DECL_CHECK.
(DECL_INCOMING_RTL, DECL_TRANSPARENT_UNION): Likewise.
(DECL_ALIGN): Adjust to new field in union.
(DECL_OFFSET_ALIGN): New field.
(DECL_ERROR_ISSUED, DECL_TOO_LATE): Use LABEL_DECL_CHECK.
(DECL_IN_TEXT_SECTION): Use VAR_DECL_CHECK.
(union tree_decl): Add struct for both aligns.
(enum tree_index): Add TI_BITSIZE_{ZERO,ONE,UNIT}.
(bitsize_zero_node, bitsize_one_node, bitsize_unit_node): Added.
(struct record_layout_info): Rework fields to have offset
alignment and byte and bit position.
(start_record_layout, place_field): Renamed from old names.
(rli_size_so_far, rli_size_unit_so_far, normalize_rli): New decls.
(byte_position, int_byte_position): Likewise.
(get_inner_reference): Change types of position and length.
* unroll.c (unroll_loop): New variable R; use for some loops.
MAX_LOCAL_REGNUM and MAXREGNUM now unsigned.
(calculate_giv_inc): Arg REGNO now unsigned.
(copy_loop_body): REGNO and SRC_REGNO now unsigned.
* varasm.c (assemble_variable): Clean up handling of size using
host_integerp and tree_low_cst.
(decode_addr_const): Use byte, not bit, position.
(output_constructor): bitpos and offsets are HOST_WIDE_INT;
use tree_low_cst and int_bit_position.
* objc/objc-act.c (build_ivar_list_initializer): Use byte_position.
* ch/actions.c (check_missing_cases): BYTES_NEEDED is HOST_WIDE_INT.
* ch/typeck.c (expand_constant_to_buffer): Use int_byte_position.
(extract_constant_from_buffer): Likewise.
* cp/class.c (build_vbase_pointer_fields): layout_field now
place_field.
(get_vfield_offset): Use byte_position.
(set_rtti_entry): Set OFFSET to ssizetype zero.
(get_binfo_offset_as_int): Deleted.
(dfs_record_base_offsets): Use tree_low_cst.
(dfs_search_base_offsets): Likewise.
(layout_nonempty_base_or_field): Reflect changes in RLI format
and call byte_position.
(layout_empty_base): Convert offset to ssizetype.
(build_base_field): use rli_size_unit_so_far.
(dfs_propagate_binfo_offsets): Do computation in proper type.
(layout_virtual_bases): Pass ssizetype to propagate_binfo_offsets.
(layout_class_type): Reflect changes in RLI names and fields.
(finish_struct_1): Set DECL_FIELD_OFFSET.
* cp/dump.c (dequeue_and_dump): Call bit_position.
* cp/expr.c (cplus_expand_constant): Use byte_position.
* cp/rtti.c (expand_class_desc): Use bitsize_one_node.
* cp/typeck.c (build_component_addr): Use byte_position and don't
special case for zero offset.
* f/com.c (ffecom_tree_canonize_ptr_): Use bitsize_zero_node.
(ffecom_tree_canonize_ref_): Likewise.
* java/class.c (make_field_value): Use byte_position.
* java/expr.c (JAVA_ARRAY_LENGTH_OFFSET): Use byte_position.
(java_array_data_offset): Likewise.
* java/java-tree.h (MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC): Add case to
bzero call.
From-SVN: r32742
2000-03-25 19:34:13 +01:00
|
|
|
|
unsigned int src_regno, dest_regno;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
/* Amount to add to the hard regno for SRC, or subtract from that for DEST,
|
|
|
|
|
to compensate for subregs in SRC or DEST. */
|
|
|
|
|
int offset = 0;
|
* Rework fields used to describe positions of bitfields and
modify sizes to be unsigned and use HOST_WIDE_INT.
* alias.c (reg_known_value_size): Now unsigned.
* c-typeck.c (build_unary_op, case ADDR_EXPR): Use byte_position.
(really_start_incremental_init): Use bitsize_zero_node.
(push_init_level, pop_init_level, output_init_element): Likewise.
Use bitsize_unit_node and bitsize_one_node.
(output_pending_init_elements, process_init_element): Likewise.
* combine.c (combine_max_regno, reg_sign_bit_copies): Now unsigned.
(make_extraction): Position and length HOST_WIDE_INT and unsigned
HOST_WIDE_INT, respectively.
(get_pos_from_mask): Passed in value is unsigned HOST_WIDE_INT.
(num_sign_bit_copies): Returns unsigned.
BITWIDTH now unsigned; rework arithmetic.
Remove recursive call from arg to MAX.
(combine_instructions, init_reg_last_arrays): NREGS now unsigned.
(setup_incoming_promotions, can_combine_p, try_combine, simplify_set):
REGNO now unsigned.
(set_nonzero_bit_and_sign_copies): NUM now unsigned.
(find_split_point, expand_compound_operation, make_extraction): LEN
now unsigned HOST_WIDE_INT, POS now HOST_WIDE_INT.
(make_field_assignment): Likewise.
(combine_simplify_rtx): Add cast.
(expand_compound_operation): MODEWIDTH now unsigned; rework arithmetic.
(force_to_mode): WIDTH now unsigned; add cast.
(if_then_else_cond): SIZE now unsigned.
(nonzero_bits): MODE_WIDTH, RESULT_WIDTH, and WIDTH now unsigned.
(extended_count): Now returns unsigned.
(simplify_shift_const): COUNT unsigned; arg is now INPUT_COUNT.
Add SIGNED_COUNT variable; MODE_WORDS and FIRST_COUNT now unsigned.
(simplify_comparison): MODE_WIDTH now unsigned.
(update_table_tick): REGNO and ENDREGNO now unsigned; new var R.
(mark_used_regs_combine): Likewise; rework arithmetic.
(record_value_for_reg): REGNO, ENDREGNO, and I now unsigned.
(record_dead_and_set_regs, reg_dead_at_p, distribute_notes): Likewise.
(record_promoted_value): REGNO now unsigned.
(get_last_value_validate): REGNO, ENDREGNO, and J now unsigned.
(get_last_value): REGNO now unsigned.
(use_crosses_set_p): REGNO and ENDREGNO now unsigned.
(reg_dead_regno, reg_dead_endregno): Now unsigned.
(remove_death): Arg REGNO now unsigned.
(move_deaths): REGNO, DEADREGNO, DEADEND, OUREND, and I now unsigned.
(reg_bitfield_target_p): REGNO, REGNO, ENDREGNO, and ENDTREGNO
now unsigned.
* convert.c (convert_to_integer): INPREC and OUTPREC now unsigned.
* cse.c (struct qty_table_elem): FIRST_REG and LAST_REG now unsigned.
(struct cse_reg_info): REGNO now unsigned.
(cached_regno): Now unsigned.
(REGNO_QTY_VALID_P): Add cast.
(make_new_qty, make_regs_eqv, delete_reg_eqiv): Regno args unsigned.
(remove_invalid_regs): Likewise.
(remove_invalid_subreg_refs): Likewise; arg WORD also unsigned
as are variables END and I.
(get_cse_reg_info, insert): Likewise.
(mention_regs, invalidate_for_call): REGNO, ENDREGNO, and I unsigned.
(canon_hash): Likewise.
(insert_regs, lookup_for_remove): REGNO now unsigned.
(invalidate): REGNO, ENDREGNO, TREGNO, and TENDREGNO now unsigned.
New variable RN.
* dbxout.c (dbxout_parms, dbxout_reg_parms): Don't check for REGNO < 0.
* dwarf2out.c (dwarf2ou_frame_debug_expr): Remove cast.
* emit-rtl.c (subreg_realpart_p): Add cast.
(operand_subword): Arg I is now unsigned as is var PARTWORDS.
(operand_subword_force): Arg I is now unsigned.
* except.c (eh_regs): Variable I is now unsigned.
* explow.c (hard_function_value): BYTES is unsigned HOST_WIDE_INT.
* expmed.c (store_fixed_bit_field): Position is HOST_WIDE_INT;
length is unsigned HOST_WIDE_INT; likewise for internal variables.
(store_split_bit_field, extract_fixed_bit_field): Likewise.
(extract_split_bit_field, store_bit_field, extract_bit_field):
Likewise.
* expr.c (store_constructor_fields, store_constructor, store_field):
Positions are HOST_WIDE_INT and lengths are unsigned HOST_WIDE_INT.
(expand_assignment, expand_expr, expand_expr_unaligned): Likewise.
(do_jump): Likewise.
(move_by_pieces, move_by_pieces_ninsns, clear_by_pieces):
MAX_SIZE is now unsigned.
(emit_group_load): BYTEPOS is HOST_WIDE_INT; BYTELEN is unsigned.
(emit_group_store): Likewise.
(emit_move_insn): I now unsigned.
(store_constructor): Use host_integerp, tree_low_cst, and
bitsize_unit_node.
(get_inner_reference): Return bitpos and bitsize as HOST_WIDE_INT.
Rework all calculations to use trees and new fields.
* expr.h (promoted_input_arg): Regno now unsigned.
(store_bit_field, extract_bit_field): Adjust types of pos and size.
(mark_seen_cases): Arg is HOST_WIDE_INT.
* flow.c (verify_wide_reg_1): REGNO now unsigned.
* fold-const.c (decode_field_reference): Size and pos HOST_WIDE_INT;
precisions and alignments are unsigned.
(optimize_bit_field_compare, fold_truthop): Likewise.
(int_const_binop): Adjust threshold for size_int_type_wide call.
(fold_convert): Likewise.
(size_int_type_wide): Make table larger and fix thinko that only
had half of table used.
(all_ones_mask_p, fold): Precisions are unsigned.
* function.c (put_reg_info_stack): REGNO is unsigned.
(instantiate_decl): Size is HOST_WIDE_INT.
(instantiate_virtual_regs): I is unsigned.
(assign_parms): REGNO, REGNOI, and REGNOR are unsigned.
(promoted_input_arg): REGNO is unsigned.
* function.h (struct function): x_max_parm_reg is now unsigned.
* gcse.c (max_gcse_regno): Now unsigned.
(struct null_pointer_info): min_reg and max_reg now unsigned.
(lookup_set, next_set): REGNO arg now unsigned.
(compute_hash_table): REGNO and I now unsigned.
(handle_avail_expr): regnum_for_replacing now unsigned.
(cprop_insn): REGNO now unsigned.
(delete_null_pointer_checks_1): BLOCK_REG now pointer to unsigned.
* ggc-common.c (ggc_mark_tree_children, case FIELD_DECL): New case.
* global.c (set_preference): SRC_REGNO, DEST_REGNO, and I now unsigned.
* hard-reg-set.h (reg_class_size): Now unsigned.
* integrate.c (mark_stores): LAST_REG and I now unsigned; new UREGNO.
* jump.c (mark_modified_reg): I now unsigned; add cast.
(rtx_equal_for_thread_p): Add cast.
* loop.c (max_reg_before_loop): Now unsigned.
(struct_movable): REGNO now unsigned.
(try_copy_prop): REGNO arg unsigned.
(regs_match_p): XN and YN now unsigned.
(consec_sets_invariant_p, maybe_eliminate_biv): REGNO now unsigned.
(strength_reduce): Likewise; NREGS also unsigned.
(first_increment_giv, last_increment_giv unsigned): Now unsigned.
* loop.h (struct iv_class): REGNO now unsigned.
(max_reg_before_loop, first_increment_giv, last_increment_giv):
Now unsigned.
* machmode.h (mode_size, mode_unit_size): Now unsigned.
(mode_for_size, smallest_mode_for_size): Pass size as unsigned.
* optabs.c (expand_binop): I and NWORDS now unsigned.
(expand_unop): I now unsigned.
* print-tree.c (print_node): Don't print DECL_FIELD_BITPOS, but do
print DECL_FIELD_OFFSET and DECL_FIELD_BIT_OFFSET.
* real.c (significand_size): Now returns unsigned.
* real.h (significand_size): Likewise.
* regclass.c (reg_class_size): Now unsigned.
(choose_hard_reg_mode): Both operands now unsigned.
(record_reg_classes): REGNO and NR now unsigned.
(reg_scan): NREGS now unsigned.
(reg_scan_update): old_max_regno now unsigned.
(reg_scan_mark_refs): Arg MIN_REGNO and var REGNO now unsigned.
* reload.c (find_valid_class): BEST_SIZE now unsigned.
(find_dummy_reload): REGNO, NWORDS, and I now unsigned.
(hard_reg_set_here_p): Args BEG_REGNO and END_REGNO now unsigned.
Likewise for variable R.
(refers_to_regno_for_reload_p): Args REGNO and END_REGNO now unsigned,
as are variables INNER_REGNO and INNER_ENDREGNO; add new variable R.
(find_equiv_reg): Add casts.
(regno_clobbered_p): Arg REGNO now unsigned.
* reload.h (struct reload): NREGS now unsigned.
(refers_to_regno_for_reload_p): Regno args are unsigned.
(regno_clobbered_p): Likewise.
* reload1.c (reg_max_ref_width, spill_stack_slot_width): Now unsigned.
(compute_use_by_pseudos): REGNO now unsigned.
(find_reg): I and J now unsigned, new variable K, and change loop
variables accordingly; THIS_NREGS now unsigned.
(alter_reg): INHERENT_SIZE and TOTAL_SIZE now unsigned.
(spill_hard_reg): REGNO arg now unsigned; add casts.
(forget_old_reloads_1): REGNO, NR, and I now unsigned.
(mark_reload_reg_in_use): Arg REGNO and vars NREGS and I now unsigned.
(clear_reload_reg_in_use): Arg REGNO and vars NREGS, START_REGNO,
END_REGNO, CONFLICT_START, and CONFLICT_END now unsigned.
(reload_reg_free_p, reload_reg_reaches_end_p): Arg REGNO now unsigned.
(choose_reload_regs): MAX_GROUP_SIZE now unsigned.
(emit_reload_insns): REGNO now unsigned.
(reload_cse_move2add): Add cast.
(move2add_note_store): REGNO and I now unsigned; new variable ENDREGNO
and rework loop.
* resource.c (mark_referenced_resources, mark_set_resources): New
variable R; REGNO and LAST_REGNO now unsigned.
(mark_target_live_regs): J and REGNO now unsigned.
* rtl.c (mode_size, mode_unit_size): Now unsigned.
* rtl.h (union rtunion_def): New field rtuint.
(XCUINT): New macro.
(ADDRESSOF_REGNO, REGNO, SUBREG_WORD): New XCUINT.
(operand_subword, operand_subword_force): Word number is unsigned.
(choose_hard_reg_mode): Operands are unsigned.
(refers_to-regno_p, dead_or_set_regno_p): Regno arg is unsigned.
(find_regno_note, find_regno_fusage, replace_regs): Likewise.
(regno_use_in, combine_instructions, remove_death): Likewise.
(reg_scan, reg_scan_update): Likewise.
(extended_count): Return is unsigned.
* rtlanal.c (refers_to_regno_p): Args REGNO and ENDREGNO and vars I,
INNER_REGNO, and INNER_ENDREGNO now unsigned; new variable X_REGNO.
(reg_overlap_mentioned_p): REGNO and ENDREGNO now unsigned.
(reg_set_last_first_regno, reg_set_last_last_regno): Now unsigned.
(reg_reg_last_1): FIRS and LAST now unsigned.
(dead_or_set_p): REGNO, LAST_REGNO, and I now unsigned.
(dead_or_set_regno_p): Arg TEST_REGNO and vars REGNO and ENDREGNO
now unsigned.
(find_regno_note, regno_use_in): Arg REGNO now unsigned.
(find_regno_fusage): Likewise; also var REGNOTE now unsigned.
(find_reg_fusage): Variables REGNO, END_REGNO, and I now unsigned.
(replace_regs): Arg NREGS now unsigned.
* sdbout.c (sdbout_parms, sdbout_reg_parms): Don't check REGNO < 0.
* simplify-rtx.c (simplify_unary_operation): WIDTH now unsigned.
(simplify_binary_operation): Likewise.
(cselib_invalidate_regno): Arg REGNO and variables ENDREGNO, I, and
THIS_LAST now unsigned.
(cselib_record_set): Add cast.
* ssa.c (ssa_max_reg_num): Now unsigned.
(rename_block): REGNO now unsigned.
* stmt.c (expand_return): Bit positions unsigned HOST_WIDE_INT;
sizes now unsigned.
(all_cases_count): Just return -1 not -2.
COUNT, MINVAL, and LASTVAL now HOST_WIDE_INT.
Rework tests to use trees whenever possible.
Use host_integerp and tree_low_cst.
(mark_seen_cases): COUNT arg now HOST_WIDE_INT;
Likewise variable NEXT_NODE_OFFSET; XLO now unsigned.
(check_for_full_enumeration_handing): BYTES_NEEDED, I to HOST_WIDE_INT.
* stor-layout.c (mode_for_size): SIZE arg now unsigned.
(smallest_mode_for_size): Likewise.
(layout_decl): Simplify handing of a specified DECL_SIZE_UNIT.
KNOWN_ALIGN is now an alignment, so simplify code.
Don't turn off DECL_BIT_FIELD if field is BLKmode, but not type.
(start_record_layout): Renamed from new_record_layout_info.
Update to new fields.
(debug_rli, normalize_rli, rli_size_unit_so_far, rli_size_so_far):
New functions.
(place_union_field): Renamed from layout_union_field.
Update to use new fields in rli.
(place_field): Renamed from layout_field.
Major rewrite to use new fields in rli; pass alignment to layout_decl.
(finalize_record_size): Rework to use new fields in rli and handle
union.
(compute_record_mode): Rework to simplify and to use new DECL fields.
(finalize_type_size): Make rounding more consistent.
(finish_union_layout): Deleted.
(layout_type, case VOID_TYPE): Don't set TYPE_SIZE_UNIT either.
(layout_type, case RECORD_TYPE): Call new function names.
(initialize_sizetypes): Set TYPE_IS_SIZETYPE.
(set_sizetype): Set TYPE_IS_SIZETYPE earlier.
(get_best_mode): UNIT is now unsigned; remove casts.
* tree.c (bit_position): Compute from new fields.
(byte_position, int_byte_position): New functions.
(print_type_hash_statistics): Cast to remove warning.
(build_range_type): Use host_integerp and tree_low_cst to try to hash.
(build_index_type): Likewise; make subtype of sizetype.
(build_index_2_type): Pass sizetype to build_range_type.
(build_common_tree_nodes): Use size_int and bitsize_int to
initialize nodes; add bitsize_{zero,one,unit}_node.
* tree.h (DECL_FIELD_CONTEXT): Use FIELD_DECL_CHECK.
(DECL_BIT_FIELD_TYPE, DECL_QUALIFIER, DECL_FCONTEXT): Likewise.
(DECL_PACKED, DECL_BIT_FIELD): Likewise.
(DECL_FIELD_BITPOS): Deleted.
(DECL_FIELD_OFFSET, DECL_FIELD_BIT_OFFSET): New fields.
(DECL_RESULT, DECL_SAVED_INSNS): Use FUNCTION_DECL_CHECK.
(DECL_FRAME_SIZE, DECL_FUNCTION_CODE, DECL_NO_STATIC_CHAIN): Likewise.
(DECL_INLINE, DECL_BUILT_IN_NONANSI, DECL_IS_MALLOC): Likewise.
(DECL_BUILT_IN_CLASS, DECL_STATIC_CONSTRUCTOR): Likewise.
(DECL_STATIC_DESTRUCTOR, DECL_NO_CHECK_MEMORY_USAGE): Likewise.
(DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT, DECL_NO_LIMIT_STACK) Likewise.
(DECL_ORIGINAL_TYPE, TYPE_DECL_SUPPRESS_DEBUG): Use TYPE_DECL_CHECK.
(DECL_ARG_TYPE_AS_WRITEN, DECL_ARG_TYPE): Use PARM_DECL_CHECK.
(DECL_INCOMING_RTL, DECL_TRANSPARENT_UNION): Likewise.
(DECL_ALIGN): Adjust to new field in union.
(DECL_OFFSET_ALIGN): New field.
(DECL_ERROR_ISSUED, DECL_TOO_LATE): Use LABEL_DECL_CHECK.
(DECL_IN_TEXT_SECTION): Use VAR_DECL_CHECK.
(union tree_decl): Add struct for both aligns.
(enum tree_index): Add TI_BITSIZE_{ZERO,ONE,UNIT}.
(bitsize_zero_node, bitsize_one_node, bitsize_unit_node): Added.
(struct record_layout_info): Rework fields to have offset
alignment and byte and bit position.
(start_record_layout, place_field): Renamed from old names.
(rli_size_so_far, rli_size_unit_so_far, normalize_rli): New decls.
(byte_position, int_byte_position): Likewise.
(get_inner_reference): Change types of position and length.
* unroll.c (unroll_loop): New variable R; use for some loops.
MAX_LOCAL_REGNUM and MAXREGNUM now unsigned.
(calculate_giv_inc): Arg REGNO now unsigned.
(copy_loop_body): REGNO and SRC_REGNO now unsigned.
* varasm.c (assemble_variable): Clean up handling of size using
host_integerp and tree_low_cst.
(decode_addr_const): Use byte, not bit, position.
(output_constructor): bitpos and offsets are HOST_WIDE_INT;
use tree_low_cst and int_bit_position.
* objc/objc-act.c (build_ivar_list_initializer): Use byte_position.
* ch/actions.c (check_missing_cases): BYTES_NEEDED is HOST_WIDE_INT.
* ch/typeck.c (expand_constant_to_buffer): Use int_byte_position.
(extract_constant_from_buffer): Likewise.
* cp/class.c (build_vbase_pointer_fields): layout_field now
place_field.
(get_vfield_offset): Use byte_position.
(set_rtti_entry): Set OFFSET to ssizetype zero.
(get_binfo_offset_as_int): Deleted.
(dfs_record_base_offsets): Use tree_low_cst.
(dfs_search_base_offsets): Likewise.
(layout_nonempty_base_or_field): Reflect changes in RLI format
and call byte_position.
(layout_empty_base): Convert offset to ssizetype.
(build_base_field): use rli_size_unit_so_far.
(dfs_propagate_binfo_offsets): Do computation in proper type.
(layout_virtual_bases): Pass ssizetype to propagate_binfo_offsets.
(layout_class_type): Reflect changes in RLI names and fields.
(finish_struct_1): Set DECL_FIELD_OFFSET.
* cp/dump.c (dequeue_and_dump): Call bit_position.
* cp/expr.c (cplus_expand_constant): Use byte_position.
* cp/rtti.c (expand_class_desc): Use bitsize_one_node.
* cp/typeck.c (build_component_addr): Use byte_position and don't
special case for zero offset.
* f/com.c (ffecom_tree_canonize_ptr_): Use bitsize_zero_node.
(ffecom_tree_canonize_ref_): Likewise.
* java/class.c (make_field_value): Use byte_position.
* java/expr.c (JAVA_ARRAY_LENGTH_OFFSET): Use byte_position.
(java_array_data_offset): Likewise.
* java/java-tree.h (MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC): Add case to
bzero call.
From-SVN: r32742
2000-03-25 19:34:13 +01:00
|
|
|
|
unsigned int i;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
int copy = 1;
|
|
|
|
|
|
|
|
|
|
if (GET_RTX_FORMAT (GET_CODE (src))[0] == 'e')
|
|
|
|
|
src = XEXP (src, 0), copy = 0;
|
|
|
|
|
|
|
|
|
|
/* Get the reg number for both SRC and DEST.
|
|
|
|
|
If neither is a reg, give up. */
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (src) == REG)
|
|
|
|
|
src_regno = REGNO (src);
|
|
|
|
|
else if (GET_CODE (src) == SUBREG && GET_CODE (SUBREG_REG (src)) == REG)
|
|
|
|
|
{
|
|
|
|
|
src_regno = REGNO (SUBREG_REG (src));
|
Use byte offsets in SUBREGs instead of words.
2001-04-03 Jakub Jelinek <jakub@redhat.com>
David S. Miller <davem@pierdol.cobaltmicro.com>
Andrew MacLeod <amacleod@redhat.com>
Use byte offsets in SUBREGs instead of words.
* alias.c (nonlocal_mentioned_p): Use subreg_regno function.
* caller-save.c (mark_set_regs): Change callers of subreg_hard_regno
to pass new argument.
(add_stored_regs): Use subreg_regno_offset function.
* calls.c (expand_call): For non-paradoxical SUBREG take endianess
into account.
(precompute_arguments): Use gen_lowpart_SUBREG.
* combine.c (try_combine): Replace explicit XEXP with SUBREG_REG.
(combine_simplify_rtx): Rework to use SUBREG_BYTE.
(simplify_set): Rework to use SUBREG_BYTE.
(expand_field_assignment): Use SUBREG_BYTE.
(make_extraction): Use SUBREG_BYTE.
(if_then_else_cond): Use SUBREG_BYTE.
(apply_distributive_law): Use SUBREG_BYTE and fixup subreg comments.
(gen_lowpart_for_combine): Compute full byte offset.
* cse.c (mention_regs): Use SUBREG_BYTE.
(remove_invalid_subreg_refs): Rework to use SUBREG_BYTE.
(canon_hash): Use SUBREG_BYTE.
(fold_rtx): Pass SUBREG_BYTE div UNITS_PER_WORD to operand_subword.
(gen_lowpart_if_possible): Formatting.
* dbxout.c (dbxout_symbol_location): Compute SUBREG hard regnos
correctly.
* dwarf2out.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* dwarfout.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(output_mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(output_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* emit-rtl.c (gen_rtx_SUBREG): New function, used to verify
certain invariants about SUBREGs the compiler creates.
(gen_lowpart_SUBREG): New function.
(subreg_hard_regno): New function to get the final register number.
(gen_lowpart_common): Use SUBREG_BYTE.
(gen_imagpart): Spacing nits.
(subreg_realpart_p): Use SUBREG_BYTE.
(gen_highpart): Use SUBREG_BYTE.
(subreg_lowpart_p): Always compute endian corrected goal offset,
even at the byte level, then compare against that.
(constant_subword): New function, pulled out all constant cases
from operand_subword and changed second argument name to offset.
(operand_subword): Detect non REG/SUBREG/CONCAT/MEM cases early
and call constant_subword to do the work. Return const0_rtx if
looking for a word outside of OP.
(operand_subword_force): Change second arg name to offset.
* expmed.c (store_bit_field): Use SUBREG_BYTE.
(store_split_bit_field): Use SUBREG_BYTE.
(extract_bit_field): Use SUBREG_BYTE.
(extract_split_bit_field): Use SUBREG_BYTE.
(expand_shift): Use SUBREG_BYTE.
* expr.c (store_expr, expand_expr): Use gen_lowpart_SUBREG.
* final.c (alter_subreg) Use subreg_hard_regno and SUBREG_BYTE.
* flow.c (set_noop_p): Use SUBREG_BYTE.
(mark_set_1): Remove ALTER_HARD_SUBREG. Use subreg_regno_offset instead.
* function.c (fixup_var_refs_1): Fixup explicit XEXP into a SUBREG_REG.
(fixup_memory_subreg): Use SUBREG_BYTE and remove byte endian
correction code.
(optimize_bit_field): Use SUBREG_BYTE.
(purge_addressof_1): Use SUBREG_BYTE.
(purge_single_hard_subreg_set): Use subreg_regno_offset function.
(assign_params): Mark arguments SUBREG_PROMOTED_VAR_P if they are
actually promoted by the caller and PROMOTE_FOR_CALLS_ONLY is true.
* gengenrtl.c (special_rtx): Add SUBREG.
* global.c (mark_reg_store): Use SUBREG_BYTE.
(set_preference): Rework to use subreg_regno_offset and SUBREG_BYTE.
* ifcvt (noce_emit_move_insn): Use SUBREG_BYTE.
* integrate.c (copy_rtx_and_substitute): Use SUBREG_BYTE and make sure
final byte offset is congruent to subreg's mode size.
(subst_constants): Use SUBREG_BYTE.
(mark_stores): Use subreg_regno_offset function.
* jump.c (rtx_renumbered_equal_p, true_regnum): Use subreg_regno_offset
function and SUBREG_BYTE.
* local-alloc.c (combine_regs): Use subreg_regno_offset function.
(reg_is_born): Use subreg_hard_regno.
* recog.c (valid_replace_rtx_1): Use SUBREG_BYTE and remove byte
endian correction code. Don't combine subregs unless resulting
offset aligns with type. Fix subreg constant extraction for DImode.
Simplify SUBREG of VOIDmode CONST_DOUBLE.
(general_operand): Remove dead mode_altering_drug code.
(indirect_operand): Use SUBREG_BYTE.
(constrain_operands): Use subreg_regno_offset function.
* reg-stack.c (get_true_reg): Use subreg_regno_offset function.
* regmove.c (regmove_optimize): Use SUBREG_BYTE.
(optimize_reg_copy_3): Use gen_lowpart_SUBREG.
* regs.h (REG_SIZE): Allow target to override.
(REGMODE_NATURAL_SIZE): New macro which target can override.
* reload.c (reload_inner_reg_of_subreg): subreg_regno should be used
on the entire subreg rtx.
(push_reload): Use SUBREG_BYTE in comments and code.
(find_dummy_reload): Use subreg_regno_offset. Only adjust offsets
for hard registers inside subregs.
(operands_match_p): Use subreg_regno_offset.
(find_reloads): Use SUBREG_BYTE and only advance offset for subregs
containing hard regs.
(find_reload_toplev): Use SUBREG_BYTE. Remove byte endian
corrections when fixing up MEM subregs.
(find_reloads_address_1): Use SUBREG_BYTE, subreg_regno, and
subreg_regno_offset where appropriate.
(find_reloads_subreg_address): Use SUBREG_BYTE. Remove
byte endian corrections when fixing up MEM subregs.
(subst_reloads): When combining two subregs, make sure final
offset is congruent to subreg's mode size.
(find_replacement): Use SUBREG_BYTE and subreg_regno_offset.
(refers_to_regno_for_reload_p): Use subreg_regno.
(reg_overlap_mentioned_for_reload_p): Use subreg_regno_offset.
* reload1.c (eliminate_regs) Use SUBREG_BYTE. Remove byte endian
correction code for memory subreg fixups.
(forget_old_reload_1): Use subreg_regno_offset.
(choose_reload_regs): Use subreg_regno.
(emit_input_reload_insns): Use SUBREG_BYTE.
(reload_combine_note_store): Use subreg_regno_offset.
(move2add_note_store): Use subreg_regno_offset.
* resource.c (update_live_status, mark_referenced_resources): Use
subreg_regno function.
(mark_set_resources): Use subreg_regno function.
* rtl.h (SUBREG_WORD): Rename to SUBREG_BYTE.
(subreg_regno_offset, subreg_regno): Define prototypes.
(subreg_hard_regno, constant_subword, gen_rtx_SUBREG): Newi functions.
(gen_lowpart_SUBREG): Add prototype.
* rtl.texi (subreg): Update to reflect new byte offset representation.
Add mentioning of the effect that BYTES_BIG_ENDIAN has on subregs now.
* rtlanal.c (refers_to_regno_p): Use subreg_regno.
(reg_overlap_mentioned_p): Use subreg_regno.
(replace_regs); Make sure final offset of combined subreg is
congruent to size of subreg's mode.
(subreg_regno_offset): New function.
(subreg_regno): New function.
* sched-vis.c (print_value): Change SUBREG_WORD to SUBREG_BYTE.
* sdbout.c (sdbout_symbol): Compute offset using alter_subreg.
* stmt.c (expand_anon_union_decl): Use gen_lowpart_SUBREG.
* tm.texi (ALTER_HARD_SUBREG): Remove, it is now dead.
(SUBREG_REGNO_OFFSET): Describe SUBREG_REGNO_OFFSET overrides.
* config/a29k/a29k.c (gpc_reg_operand): Use subreg_regno.
(a29k_get_reloaded_address): Use SUBREG_BYTE.
(print_operand): Use SUBREG_BYTE.
* config/alpha/alpha.c (print_operand_address): Use SUBREG_BYTE.
* config/arm/arm.c (arm_reload_in_hi): Use SUBREG_BYTE.
(arm_reload_out_hi): Use SUBREG_BYTE.
* config/d30v/d30v.c (d30v_split_double): Use subreg_regno_offset
instead of SUBREG_WORD.
(d30v_print_operand_memory_reference): Use subreg_regno_offset.
* config/dsp16xx/dsp16xx.md (extendqihi2, zero_extendqihi2): Fix
SUBREG creation to use byte offset.
* config/h8300/h8300.md (Unnamed HImode zero extraction and 16bit
inverted load insns): Fix explicit rtl subregs to use byte
offsets.
* config/i370/i370.md (cmpstrsi, movstrsi, mulsi3, divsi3,
udivsi3, umodsi3): Generate SUBREGs with byte offsets.
* config/i860/i860.c (single_insn_src_p): Use SUBREG_BYTE.
* config/i860/i860.md (mulsi3_big): Fixup explicit SUBREGs in rtl
to use byte offsets.
(unnamed fmlow.dd insn): Fixup SUBREGS to use byte offsets.
* config/i960/i960.md (extendhisi2): Generate SUBREGs with byte
offsets, also make sure it is congruent to SUBREG's mode size.
(extendqisi2, extendqihi2, zero_extendhisi2, zero_extendqisi2,
unnamed ldob insn): Generate SUBREGs with byte offset.
(zero_extendqihi2): SUBREG's are byte offsets.
* config/m68hc11/m68hc11.c (m68hc11_gen_lowpart): Use SUBREG_BYTE.
(m68hc11_gen_highpart): Use SUBREG_BYTE.
* config/m68k/m68k.md (zero_extendhisi2, zero_extendqihi2,
zero-extendqisi2): Generate SUBREGs with byte offset.
(umulsidi3, mulsidi3, subreghi1ashrdi_const32,
subregsi1ashrdi_const32, subreg1lshrdi_const32): Fixup explicit
subregs in rtl to use byte offsets.
* config/m88k/m88k.md (extendsidi2): fixup subregs to use byte offset.
* config/mips/mips.c (mips_move_1word): Use subreg_regno_offset.
(mips_move_2words): Use subreg_regno_offset.
(mips_secondary_reload_class): Use subreg_regno_offset.
* config/mips/mips.md (DImode plus, minus, move, and logical op
splits): Fixup explicit subregs in rtl to use byte offsets.
* config/mn10200/mn10200.c (print_operand): Use subreg_regno function.
* config/mn10300/mn10300.c (print_operand): Use subreg_regno function.
* config/ns32k/ns32k.md (udivmoddisi4): Fix explicit subregs in
rtl to use byte offsets.
* config/pa/pa.c (emit_move_sequence): Use SUBREG_BYTE.
* config/pa/pa.md (floatunssisf2, floatunssidf2, mulsi3): fix explicit
subregs to use byte offsets.
* config/pdp11/pdp11.md (zero_extendhisi2, modhi3, modhi3+1):
Fixup explicit subregs in rtl to use byte offsets.
* config/romp/romp.c (memory_offset_in_range_p): Use SUBREG_BYTE
and remove byte endian correction code.
* config/sh/sh.c (output_movedouble): Use subreg_regno.
(gen_ashift_hi): Use SUBREG_BYTE.
(regs_used): Use subreg_regno_offset.
(machine_dependent_reorg): Use subreg_regno_offset.
* config/sh/sh.h (INDEX_REGISTER_RTX_P): Use SUBREG_BYTE.
* config/sh/sh.md (DImode and DFmode move splits): Use subreg_regno.
(movdf_i4): Subregs are byte offsets now.
* config/sparc/sparc.c (ultra_find_type): Use SUBREG_BYTE.
* config/sparc/sparc.h (ALTER_HARD_SUBREG): Removed.
(REGMODE_NATURAL_SIZE): Override.
(REG_SIZE): For SUBREG check float mode on SUBREG_REG's mode.
* config/sparc/sparc.md (TFmode move splits): Generate SUBREGs
with byte offsets.
(zero_extendhisi2, zero_extendqidi2_insn, extendhisi2,
extendqihi2, sign_extendqihi2_insn, sign_extendqisi2_insn,
extendqidi2): Generate SUBREGs with byte offsets, also make sure
it is congruent to SUBREG's mode size.
(smulsi3_highpart_v8plus): Fix explicit subregs in rtl to use byte
offsets.
(cmp_siqi_trunc, cmp_siqi_trunc_set, cmp_diqi_trunc,
cmp_diqi_trunc_set, lshrdi3_v8plus+1, lshrdi3_v8plus+2,
lshrdi3_v8plus+3, lshrdi3_v8plus+4): Use proper
SUBREG_BYTE offset for non-paradoxical subregs in patterns.
* config/v850/v850.c (print_operand, output_move_double): Use
subreg_regno function.
Co-Authored-By: Andrew MacLeod <amacleod@redhat.com>
Co-Authored-By: David S. Miller <davem@pierdol.cobaltmicro.com>
From-SVN: r41058
2001-04-03 17:06:12 +02:00
|
|
|
|
|
|
|
|
|
if (REGNO (SUBREG_REG (src)) < FIRST_PSEUDO_REGISTER)
|
|
|
|
|
offset += subreg_regno_offset (REGNO (SUBREG_REG (src)),
|
|
|
|
|
GET_MODE (SUBREG_REG (src)),
|
|
|
|
|
SUBREG_BYTE (src),
|
|
|
|
|
GET_MODE (src));
|
|
|
|
|
else
|
|
|
|
|
offset += (SUBREG_BYTE (src)
|
|
|
|
|
/ REGMODE_NATURAL_SIZE (GET_MODE (src)));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (dest) == REG)
|
|
|
|
|
dest_regno = REGNO (dest);
|
|
|
|
|
else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
|
|
|
|
|
{
|
|
|
|
|
dest_regno = REGNO (SUBREG_REG (dest));
|
Use byte offsets in SUBREGs instead of words.
2001-04-03 Jakub Jelinek <jakub@redhat.com>
David S. Miller <davem@pierdol.cobaltmicro.com>
Andrew MacLeod <amacleod@redhat.com>
Use byte offsets in SUBREGs instead of words.
* alias.c (nonlocal_mentioned_p): Use subreg_regno function.
* caller-save.c (mark_set_regs): Change callers of subreg_hard_regno
to pass new argument.
(add_stored_regs): Use subreg_regno_offset function.
* calls.c (expand_call): For non-paradoxical SUBREG take endianess
into account.
(precompute_arguments): Use gen_lowpart_SUBREG.
* combine.c (try_combine): Replace explicit XEXP with SUBREG_REG.
(combine_simplify_rtx): Rework to use SUBREG_BYTE.
(simplify_set): Rework to use SUBREG_BYTE.
(expand_field_assignment): Use SUBREG_BYTE.
(make_extraction): Use SUBREG_BYTE.
(if_then_else_cond): Use SUBREG_BYTE.
(apply_distributive_law): Use SUBREG_BYTE and fixup subreg comments.
(gen_lowpart_for_combine): Compute full byte offset.
* cse.c (mention_regs): Use SUBREG_BYTE.
(remove_invalid_subreg_refs): Rework to use SUBREG_BYTE.
(canon_hash): Use SUBREG_BYTE.
(fold_rtx): Pass SUBREG_BYTE div UNITS_PER_WORD to operand_subword.
(gen_lowpart_if_possible): Formatting.
* dbxout.c (dbxout_symbol_location): Compute SUBREG hard regnos
correctly.
* dwarf2out.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* dwarfout.c (is_pseudo_reg): Fixup explicit XEXP into SUBREG_REG
(output_mem_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
(output_loc_descriptor): Fixup explicit XEXP into SUBREG_REG
* emit-rtl.c (gen_rtx_SUBREG): New function, used to verify
certain invariants about SUBREGs the compiler creates.
(gen_lowpart_SUBREG): New function.
(subreg_hard_regno): New function to get the final register number.
(gen_lowpart_common): Use SUBREG_BYTE.
(gen_imagpart): Spacing nits.
(subreg_realpart_p): Use SUBREG_BYTE.
(gen_highpart): Use SUBREG_BYTE.
(subreg_lowpart_p): Always compute endian corrected goal offset,
even at the byte level, then compare against that.
(constant_subword): New function, pulled out all constant cases
from operand_subword and changed second argument name to offset.
(operand_subword): Detect non REG/SUBREG/CONCAT/MEM cases early
and call constant_subword to do the work. Return const0_rtx if
looking for a word outside of OP.
(operand_subword_force): Change second arg name to offset.
* expmed.c (store_bit_field): Use SUBREG_BYTE.
(store_split_bit_field): Use SUBREG_BYTE.
(extract_bit_field): Use SUBREG_BYTE.
(extract_split_bit_field): Use SUBREG_BYTE.
(expand_shift): Use SUBREG_BYTE.
* expr.c (store_expr, expand_expr): Use gen_lowpart_SUBREG.
* final.c (alter_subreg) Use subreg_hard_regno and SUBREG_BYTE.
* flow.c (set_noop_p): Use SUBREG_BYTE.
(mark_set_1): Remove ALTER_HARD_SUBREG. Use subreg_regno_offset instead.
* function.c (fixup_var_refs_1): Fixup explicit XEXP into a SUBREG_REG.
(fixup_memory_subreg): Use SUBREG_BYTE and remove byte endian
correction code.
(optimize_bit_field): Use SUBREG_BYTE.
(purge_addressof_1): Use SUBREG_BYTE.
(purge_single_hard_subreg_set): Use subreg_regno_offset function.
(assign_params): Mark arguments SUBREG_PROMOTED_VAR_P if they are
actually promoted by the caller and PROMOTE_FOR_CALLS_ONLY is true.
* gengenrtl.c (special_rtx): Add SUBREG.
* global.c (mark_reg_store): Use SUBREG_BYTE.
(set_preference): Rework to use subreg_regno_offset and SUBREG_BYTE.
* ifcvt (noce_emit_move_insn): Use SUBREG_BYTE.
* integrate.c (copy_rtx_and_substitute): Use SUBREG_BYTE and make sure
final byte offset is congruent to subreg's mode size.
(subst_constants): Use SUBREG_BYTE.
(mark_stores): Use subreg_regno_offset function.
* jump.c (rtx_renumbered_equal_p, true_regnum): Use subreg_regno_offset
function and SUBREG_BYTE.
* local-alloc.c (combine_regs): Use subreg_regno_offset function.
(reg_is_born): Use subreg_hard_regno.
* recog.c (valid_replace_rtx_1): Use SUBREG_BYTE and remove byte
endian correction code. Don't combine subregs unless resulting
offset aligns with type. Fix subreg constant extraction for DImode.
Simplify SUBREG of VOIDmode CONST_DOUBLE.
(general_operand): Remove dead mode_altering_drug code.
(indirect_operand): Use SUBREG_BYTE.
(constrain_operands): Use subreg_regno_offset function.
* reg-stack.c (get_true_reg): Use subreg_regno_offset function.
* regmove.c (regmove_optimize): Use SUBREG_BYTE.
(optimize_reg_copy_3): Use gen_lowpart_SUBREG.
* regs.h (REG_SIZE): Allow target to override.
(REGMODE_NATURAL_SIZE): New macro which target can override.
* reload.c (reload_inner_reg_of_subreg): subreg_regno should be used
on the entire subreg rtx.
(push_reload): Use SUBREG_BYTE in comments and code.
(find_dummy_reload): Use subreg_regno_offset. Only adjust offsets
for hard registers inside subregs.
(operands_match_p): Use subreg_regno_offset.
(find_reloads): Use SUBREG_BYTE and only advance offset for subregs
containing hard regs.
(find_reload_toplev): Use SUBREG_BYTE. Remove byte endian
corrections when fixing up MEM subregs.
(find_reloads_address_1): Use SUBREG_BYTE, subreg_regno, and
subreg_regno_offset where appropriate.
(find_reloads_subreg_address): Use SUBREG_BYTE. Remove
byte endian corrections when fixing up MEM subregs.
(subst_reloads): When combining two subregs, make sure final
offset is congruent to subreg's mode size.
(find_replacement): Use SUBREG_BYTE and subreg_regno_offset.
(refers_to_regno_for_reload_p): Use subreg_regno.
(reg_overlap_mentioned_for_reload_p): Use subreg_regno_offset.
* reload1.c (eliminate_regs) Use SUBREG_BYTE. Remove byte endian
correction code for memory subreg fixups.
(forget_old_reload_1): Use subreg_regno_offset.
(choose_reload_regs): Use subreg_regno.
(emit_input_reload_insns): Use SUBREG_BYTE.
(reload_combine_note_store): Use subreg_regno_offset.
(move2add_note_store): Use subreg_regno_offset.
* resource.c (update_live_status, mark_referenced_resources): Use
subreg_regno function.
(mark_set_resources): Use subreg_regno function.
* rtl.h (SUBREG_WORD): Rename to SUBREG_BYTE.
(subreg_regno_offset, subreg_regno): Define prototypes.
(subreg_hard_regno, constant_subword, gen_rtx_SUBREG): Newi functions.
(gen_lowpart_SUBREG): Add prototype.
* rtl.texi (subreg): Update to reflect new byte offset representation.
Add mentioning of the effect that BYTES_BIG_ENDIAN has on subregs now.
* rtlanal.c (refers_to_regno_p): Use subreg_regno.
(reg_overlap_mentioned_p): Use subreg_regno.
(replace_regs); Make sure final offset of combined subreg is
congruent to size of subreg's mode.
(subreg_regno_offset): New function.
(subreg_regno): New function.
* sched-vis.c (print_value): Change SUBREG_WORD to SUBREG_BYTE.
* sdbout.c (sdbout_symbol): Compute offset using alter_subreg.
* stmt.c (expand_anon_union_decl): Use gen_lowpart_SUBREG.
* tm.texi (ALTER_HARD_SUBREG): Remove, it is now dead.
(SUBREG_REGNO_OFFSET): Describe SUBREG_REGNO_OFFSET overrides.
* config/a29k/a29k.c (gpc_reg_operand): Use subreg_regno.
(a29k_get_reloaded_address): Use SUBREG_BYTE.
(print_operand): Use SUBREG_BYTE.
* config/alpha/alpha.c (print_operand_address): Use SUBREG_BYTE.
* config/arm/arm.c (arm_reload_in_hi): Use SUBREG_BYTE.
(arm_reload_out_hi): Use SUBREG_BYTE.
* config/d30v/d30v.c (d30v_split_double): Use subreg_regno_offset
instead of SUBREG_WORD.
(d30v_print_operand_memory_reference): Use subreg_regno_offset.
* config/dsp16xx/dsp16xx.md (extendqihi2, zero_extendqihi2): Fix
SUBREG creation to use byte offset.
* config/h8300/h8300.md (Unnamed HImode zero extraction and 16bit
inverted load insns): Fix explicit rtl subregs to use byte
offsets.
* config/i370/i370.md (cmpstrsi, movstrsi, mulsi3, divsi3,
udivsi3, umodsi3): Generate SUBREGs with byte offsets.
* config/i860/i860.c (single_insn_src_p): Use SUBREG_BYTE.
* config/i860/i860.md (mulsi3_big): Fixup explicit SUBREGs in rtl
to use byte offsets.
(unnamed fmlow.dd insn): Fixup SUBREGS to use byte offsets.
* config/i960/i960.md (extendhisi2): Generate SUBREGs with byte
offsets, also make sure it is congruent to SUBREG's mode size.
(extendqisi2, extendqihi2, zero_extendhisi2, zero_extendqisi2,
unnamed ldob insn): Generate SUBREGs with byte offset.
(zero_extendqihi2): SUBREG's are byte offsets.
* config/m68hc11/m68hc11.c (m68hc11_gen_lowpart): Use SUBREG_BYTE.
(m68hc11_gen_highpart): Use SUBREG_BYTE.
* config/m68k/m68k.md (zero_extendhisi2, zero_extendqihi2,
zero-extendqisi2): Generate SUBREGs with byte offset.
(umulsidi3, mulsidi3, subreghi1ashrdi_const32,
subregsi1ashrdi_const32, subreg1lshrdi_const32): Fixup explicit
subregs in rtl to use byte offsets.
* config/m88k/m88k.md (extendsidi2): fixup subregs to use byte offset.
* config/mips/mips.c (mips_move_1word): Use subreg_regno_offset.
(mips_move_2words): Use subreg_regno_offset.
(mips_secondary_reload_class): Use subreg_regno_offset.
* config/mips/mips.md (DImode plus, minus, move, and logical op
splits): Fixup explicit subregs in rtl to use byte offsets.
* config/mn10200/mn10200.c (print_operand): Use subreg_regno function.
* config/mn10300/mn10300.c (print_operand): Use subreg_regno function.
* config/ns32k/ns32k.md (udivmoddisi4): Fix explicit subregs in
rtl to use byte offsets.
* config/pa/pa.c (emit_move_sequence): Use SUBREG_BYTE.
* config/pa/pa.md (floatunssisf2, floatunssidf2, mulsi3): fix explicit
subregs to use byte offsets.
* config/pdp11/pdp11.md (zero_extendhisi2, modhi3, modhi3+1):
Fixup explicit subregs in rtl to use byte offsets.
* config/romp/romp.c (memory_offset_in_range_p): Use SUBREG_BYTE
and remove byte endian correction code.
* config/sh/sh.c (output_movedouble): Use subreg_regno.
(gen_ashift_hi): Use SUBREG_BYTE.
(regs_used): Use subreg_regno_offset.
(machine_dependent_reorg): Use subreg_regno_offset.
* config/sh/sh.h (INDEX_REGISTER_RTX_P): Use SUBREG_BYTE.
* config/sh/sh.md (DImode and DFmode move splits): Use subreg_regno.
(movdf_i4): Subregs are byte offsets now.
* config/sparc/sparc.c (ultra_find_type): Use SUBREG_BYTE.
* config/sparc/sparc.h (ALTER_HARD_SUBREG): Removed.
(REGMODE_NATURAL_SIZE): Override.
(REG_SIZE): For SUBREG check float mode on SUBREG_REG's mode.
* config/sparc/sparc.md (TFmode move splits): Generate SUBREGs
with byte offsets.
(zero_extendhisi2, zero_extendqidi2_insn, extendhisi2,
extendqihi2, sign_extendqihi2_insn, sign_extendqisi2_insn,
extendqidi2): Generate SUBREGs with byte offsets, also make sure
it is congruent to SUBREG's mode size.
(smulsi3_highpart_v8plus): Fix explicit subregs in rtl to use byte
offsets.
(cmp_siqi_trunc, cmp_siqi_trunc_set, cmp_diqi_trunc,
cmp_diqi_trunc_set, lshrdi3_v8plus+1, lshrdi3_v8plus+2,
lshrdi3_v8plus+3, lshrdi3_v8plus+4): Use proper
SUBREG_BYTE offset for non-paradoxical subregs in patterns.
* config/v850/v850.c (print_operand, output_move_double): Use
subreg_regno function.
Co-Authored-By: Andrew MacLeod <amacleod@redhat.com>
Co-Authored-By: David S. Miller <davem@pierdol.cobaltmicro.com>
From-SVN: r41058
2001-04-03 17:06:12 +02:00
|
|
|
|
|
|
|
|
|
if (REGNO (SUBREG_REG (dest)) < FIRST_PSEUDO_REGISTER)
|
|
|
|
|
offset -= subreg_regno_offset (REGNO (SUBREG_REG (dest)),
|
|
|
|
|
GET_MODE (SUBREG_REG (dest)),
|
|
|
|
|
SUBREG_BYTE (dest),
|
|
|
|
|
GET_MODE (dest));
|
|
|
|
|
else
|
|
|
|
|
offset -= (SUBREG_BYTE (dest)
|
|
|
|
|
/ REGMODE_NATURAL_SIZE (GET_MODE (dest)));
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* Convert either or both to hard reg numbers. */
|
|
|
|
|
|
|
|
|
|
if (reg_renumber[src_regno] >= 0)
|
|
|
|
|
src_regno = reg_renumber[src_regno];
|
|
|
|
|
|
|
|
|
|
if (reg_renumber[dest_regno] >= 0)
|
|
|
|
|
dest_regno = reg_renumber[dest_regno];
|
|
|
|
|
|
|
|
|
|
/* Now if one is a hard reg and the other is a global pseudo
|
|
|
|
|
then give the other a preference. */
|
|
|
|
|
|
|
|
|
|
if (dest_regno < FIRST_PSEUDO_REGISTER && src_regno >= FIRST_PSEUDO_REGISTER
|
|
|
|
|
&& reg_allocno[src_regno] >= 0)
|
|
|
|
|
{
|
|
|
|
|
dest_regno -= offset;
|
* Rework fields used to describe positions of bitfields and
modify sizes to be unsigned and use HOST_WIDE_INT.
* alias.c (reg_known_value_size): Now unsigned.
* c-typeck.c (build_unary_op, case ADDR_EXPR): Use byte_position.
(really_start_incremental_init): Use bitsize_zero_node.
(push_init_level, pop_init_level, output_init_element): Likewise.
Use bitsize_unit_node and bitsize_one_node.
(output_pending_init_elements, process_init_element): Likewise.
* combine.c (combine_max_regno, reg_sign_bit_copies): Now unsigned.
(make_extraction): Position and length HOST_WIDE_INT and unsigned
HOST_WIDE_INT, respectively.
(get_pos_from_mask): Passed in value is unsigned HOST_WIDE_INT.
(num_sign_bit_copies): Returns unsigned.
BITWIDTH now unsigned; rework arithmetic.
Remove recursive call from arg to MAX.
(combine_instructions, init_reg_last_arrays): NREGS now unsigned.
(setup_incoming_promotions, can_combine_p, try_combine, simplify_set):
REGNO now unsigned.
(set_nonzero_bit_and_sign_copies): NUM now unsigned.
(find_split_point, expand_compound_operation, make_extraction): LEN
now unsigned HOST_WIDE_INT, POS now HOST_WIDE_INT.
(make_field_assignment): Likewise.
(combine_simplify_rtx): Add cast.
(expand_compound_operation): MODEWIDTH now unsigned; rework arithmetic.
(force_to_mode): WIDTH now unsigned; add cast.
(if_then_else_cond): SIZE now unsigned.
(nonzero_bits): MODE_WIDTH, RESULT_WIDTH, and WIDTH now unsigned.
(extended_count): Now returns unsigned.
(simplify_shift_const): COUNT unsigned; arg is now INPUT_COUNT.
Add SIGNED_COUNT variable; MODE_WORDS and FIRST_COUNT now unsigned.
(simplify_comparison): MODE_WIDTH now unsigned.
(update_table_tick): REGNO and ENDREGNO now unsigned; new var R.
(mark_used_regs_combine): Likewise; rework arithmetic.
(record_value_for_reg): REGNO, ENDREGNO, and I now unsigned.
(record_dead_and_set_regs, reg_dead_at_p, distribute_notes): Likewise.
(record_promoted_value): REGNO now unsigned.
(get_last_value_validate): REGNO, ENDREGNO, and J now unsigned.
(get_last_value): REGNO now unsigned.
(use_crosses_set_p): REGNO and ENDREGNO now unsigned.
(reg_dead_regno, reg_dead_endregno): Now unsigned.
(remove_death): Arg REGNO now unsigned.
(move_deaths): REGNO, DEADREGNO, DEADEND, OUREND, and I now unsigned.
(reg_bitfield_target_p): REGNO, REGNO, ENDREGNO, and ENDTREGNO
now unsigned.
* convert.c (convert_to_integer): INPREC and OUTPREC now unsigned.
* cse.c (struct qty_table_elem): FIRST_REG and LAST_REG now unsigned.
(struct cse_reg_info): REGNO now unsigned.
(cached_regno): Now unsigned.
(REGNO_QTY_VALID_P): Add cast.
(make_new_qty, make_regs_eqv, delete_reg_eqiv): Regno args unsigned.
(remove_invalid_regs): Likewise.
(remove_invalid_subreg_refs): Likewise; arg WORD also unsigned
as are variables END and I.
(get_cse_reg_info, insert): Likewise.
(mention_regs, invalidate_for_call): REGNO, ENDREGNO, and I unsigned.
(canon_hash): Likewise.
(insert_regs, lookup_for_remove): REGNO now unsigned.
(invalidate): REGNO, ENDREGNO, TREGNO, and TENDREGNO now unsigned.
New variable RN.
* dbxout.c (dbxout_parms, dbxout_reg_parms): Don't check for REGNO < 0.
* dwarf2out.c (dwarf2ou_frame_debug_expr): Remove cast.
* emit-rtl.c (subreg_realpart_p): Add cast.
(operand_subword): Arg I is now unsigned as is var PARTWORDS.
(operand_subword_force): Arg I is now unsigned.
* except.c (eh_regs): Variable I is now unsigned.
* explow.c (hard_function_value): BYTES is unsigned HOST_WIDE_INT.
* expmed.c (store_fixed_bit_field): Position is HOST_WIDE_INT;
length is unsigned HOST_WIDE_INT; likewise for internal variables.
(store_split_bit_field, extract_fixed_bit_field): Likewise.
(extract_split_bit_field, store_bit_field, extract_bit_field):
Likewise.
* expr.c (store_constructor_fields, store_constructor, store_field):
Positions are HOST_WIDE_INT and lengths are unsigned HOST_WIDE_INT.
(expand_assignment, expand_expr, expand_expr_unaligned): Likewise.
(do_jump): Likewise.
(move_by_pieces, move_by_pieces_ninsns, clear_by_pieces):
MAX_SIZE is now unsigned.
(emit_group_load): BYTEPOS is HOST_WIDE_INT; BYTELEN is unsigned.
(emit_group_store): Likewise.
(emit_move_insn): I now unsigned.
(store_constructor): Use host_integerp, tree_low_cst, and
bitsize_unit_node.
(get_inner_reference): Return bitpos and bitsize as HOST_WIDE_INT.
Rework all calculations to use trees and new fields.
* expr.h (promoted_input_arg): Regno now unsigned.
(store_bit_field, extract_bit_field): Adjust types of pos and size.
(mark_seen_cases): Arg is HOST_WIDE_INT.
* flow.c (verify_wide_reg_1): REGNO now unsigned.
* fold-const.c (decode_field_reference): Size and pos HOST_WIDE_INT;
precisions and alignments are unsigned.
(optimize_bit_field_compare, fold_truthop): Likewise.
(int_const_binop): Adjust threshold for size_int_type_wide call.
(fold_convert): Likewise.
(size_int_type_wide): Make table larger and fix thinko that only
had half of table used.
(all_ones_mask_p, fold): Precisions are unsigned.
* function.c (put_reg_info_stack): REGNO is unsigned.
(instantiate_decl): Size is HOST_WIDE_INT.
(instantiate_virtual_regs): I is unsigned.
(assign_parms): REGNO, REGNOI, and REGNOR are unsigned.
(promoted_input_arg): REGNO is unsigned.
* function.h (struct function): x_max_parm_reg is now unsigned.
* gcse.c (max_gcse_regno): Now unsigned.
(struct null_pointer_info): min_reg and max_reg now unsigned.
(lookup_set, next_set): REGNO arg now unsigned.
(compute_hash_table): REGNO and I now unsigned.
(handle_avail_expr): regnum_for_replacing now unsigned.
(cprop_insn): REGNO now unsigned.
(delete_null_pointer_checks_1): BLOCK_REG now pointer to unsigned.
* ggc-common.c (ggc_mark_tree_children, case FIELD_DECL): New case.
* global.c (set_preference): SRC_REGNO, DEST_REGNO, and I now unsigned.
* hard-reg-set.h (reg_class_size): Now unsigned.
* integrate.c (mark_stores): LAST_REG and I now unsigned; new UREGNO.
* jump.c (mark_modified_reg): I now unsigned; add cast.
(rtx_equal_for_thread_p): Add cast.
* loop.c (max_reg_before_loop): Now unsigned.
(struct_movable): REGNO now unsigned.
(try_copy_prop): REGNO arg unsigned.
(regs_match_p): XN and YN now unsigned.
(consec_sets_invariant_p, maybe_eliminate_biv): REGNO now unsigned.
(strength_reduce): Likewise; NREGS also unsigned.
(first_increment_giv, last_increment_giv unsigned): Now unsigned.
* loop.h (struct iv_class): REGNO now unsigned.
(max_reg_before_loop, first_increment_giv, last_increment_giv):
Now unsigned.
* machmode.h (mode_size, mode_unit_size): Now unsigned.
(mode_for_size, smallest_mode_for_size): Pass size as unsigned.
* optabs.c (expand_binop): I and NWORDS now unsigned.
(expand_unop): I now unsigned.
* print-tree.c (print_node): Don't print DECL_FIELD_BITPOS, but do
print DECL_FIELD_OFFSET and DECL_FIELD_BIT_OFFSET.
* real.c (significand_size): Now returns unsigned.
* real.h (significand_size): Likewise.
* regclass.c (reg_class_size): Now unsigned.
(choose_hard_reg_mode): Both operands now unsigned.
(record_reg_classes): REGNO and NR now unsigned.
(reg_scan): NREGS now unsigned.
(reg_scan_update): old_max_regno now unsigned.
(reg_scan_mark_refs): Arg MIN_REGNO and var REGNO now unsigned.
* reload.c (find_valid_class): BEST_SIZE now unsigned.
(find_dummy_reload): REGNO, NWORDS, and I now unsigned.
(hard_reg_set_here_p): Args BEG_REGNO and END_REGNO now unsigned.
Likewise for variable R.
(refers_to_regno_for_reload_p): Args REGNO and END_REGNO now unsigned,
as are variables INNER_REGNO and INNER_ENDREGNO; add new variable R.
(find_equiv_reg): Add casts.
(regno_clobbered_p): Arg REGNO now unsigned.
* reload.h (struct reload): NREGS now unsigned.
(refers_to_regno_for_reload_p): Regno args are unsigned.
(regno_clobbered_p): Likewise.
* reload1.c (reg_max_ref_width, spill_stack_slot_width): Now unsigned.
(compute_use_by_pseudos): REGNO now unsigned.
(find_reg): I and J now unsigned, new variable K, and change loop
variables accordingly; THIS_NREGS now unsigned.
(alter_reg): INHERENT_SIZE and TOTAL_SIZE now unsigned.
(spill_hard_reg): REGNO arg now unsigned; add casts.
(forget_old_reloads_1): REGNO, NR, and I now unsigned.
(mark_reload_reg_in_use): Arg REGNO and vars NREGS and I now unsigned.
(clear_reload_reg_in_use): Arg REGNO and vars NREGS, START_REGNO,
END_REGNO, CONFLICT_START, and CONFLICT_END now unsigned.
(reload_reg_free_p, reload_reg_reaches_end_p): Arg REGNO now unsigned.
(choose_reload_regs): MAX_GROUP_SIZE now unsigned.
(emit_reload_insns): REGNO now unsigned.
(reload_cse_move2add): Add cast.
(move2add_note_store): REGNO and I now unsigned; new variable ENDREGNO
and rework loop.
* resource.c (mark_referenced_resources, mark_set_resources): New
variable R; REGNO and LAST_REGNO now unsigned.
(mark_target_live_regs): J and REGNO now unsigned.
* rtl.c (mode_size, mode_unit_size): Now unsigned.
* rtl.h (union rtunion_def): New field rtuint.
(XCUINT): New macro.
(ADDRESSOF_REGNO, REGNO, SUBREG_WORD): New XCUINT.
(operand_subword, operand_subword_force): Word number is unsigned.
(choose_hard_reg_mode): Operands are unsigned.
(refers_to-regno_p, dead_or_set_regno_p): Regno arg is unsigned.
(find_regno_note, find_regno_fusage, replace_regs): Likewise.
(regno_use_in, combine_instructions, remove_death): Likewise.
(reg_scan, reg_scan_update): Likewise.
(extended_count): Return is unsigned.
* rtlanal.c (refers_to_regno_p): Args REGNO and ENDREGNO and vars I,
INNER_REGNO, and INNER_ENDREGNO now unsigned; new variable X_REGNO.
(reg_overlap_mentioned_p): REGNO and ENDREGNO now unsigned.
(reg_set_last_first_regno, reg_set_last_last_regno): Now unsigned.
(reg_reg_last_1): FIRS and LAST now unsigned.
(dead_or_set_p): REGNO, LAST_REGNO, and I now unsigned.
(dead_or_set_regno_p): Arg TEST_REGNO and vars REGNO and ENDREGNO
now unsigned.
(find_regno_note, regno_use_in): Arg REGNO now unsigned.
(find_regno_fusage): Likewise; also var REGNOTE now unsigned.
(find_reg_fusage): Variables REGNO, END_REGNO, and I now unsigned.
(replace_regs): Arg NREGS now unsigned.
* sdbout.c (sdbout_parms, sdbout_reg_parms): Don't check REGNO < 0.
* simplify-rtx.c (simplify_unary_operation): WIDTH now unsigned.
(simplify_binary_operation): Likewise.
(cselib_invalidate_regno): Arg REGNO and variables ENDREGNO, I, and
THIS_LAST now unsigned.
(cselib_record_set): Add cast.
* ssa.c (ssa_max_reg_num): Now unsigned.
(rename_block): REGNO now unsigned.
* stmt.c (expand_return): Bit positions unsigned HOST_WIDE_INT;
sizes now unsigned.
(all_cases_count): Just return -1 not -2.
COUNT, MINVAL, and LASTVAL now HOST_WIDE_INT.
Rework tests to use trees whenever possible.
Use host_integerp and tree_low_cst.
(mark_seen_cases): COUNT arg now HOST_WIDE_INT;
Likewise variable NEXT_NODE_OFFSET; XLO now unsigned.
(check_for_full_enumeration_handing): BYTES_NEEDED, I to HOST_WIDE_INT.
* stor-layout.c (mode_for_size): SIZE arg now unsigned.
(smallest_mode_for_size): Likewise.
(layout_decl): Simplify handing of a specified DECL_SIZE_UNIT.
KNOWN_ALIGN is now an alignment, so simplify code.
Don't turn off DECL_BIT_FIELD if field is BLKmode, but not type.
(start_record_layout): Renamed from new_record_layout_info.
Update to new fields.
(debug_rli, normalize_rli, rli_size_unit_so_far, rli_size_so_far):
New functions.
(place_union_field): Renamed from layout_union_field.
Update to use new fields in rli.
(place_field): Renamed from layout_field.
Major rewrite to use new fields in rli; pass alignment to layout_decl.
(finalize_record_size): Rework to use new fields in rli and handle
union.
(compute_record_mode): Rework to simplify and to use new DECL fields.
(finalize_type_size): Make rounding more consistent.
(finish_union_layout): Deleted.
(layout_type, case VOID_TYPE): Don't set TYPE_SIZE_UNIT either.
(layout_type, case RECORD_TYPE): Call new function names.
(initialize_sizetypes): Set TYPE_IS_SIZETYPE.
(set_sizetype): Set TYPE_IS_SIZETYPE earlier.
(get_best_mode): UNIT is now unsigned; remove casts.
* tree.c (bit_position): Compute from new fields.
(byte_position, int_byte_position): New functions.
(print_type_hash_statistics): Cast to remove warning.
(build_range_type): Use host_integerp and tree_low_cst to try to hash.
(build_index_type): Likewise; make subtype of sizetype.
(build_index_2_type): Pass sizetype to build_range_type.
(build_common_tree_nodes): Use size_int and bitsize_int to
initialize nodes; add bitsize_{zero,one,unit}_node.
* tree.h (DECL_FIELD_CONTEXT): Use FIELD_DECL_CHECK.
(DECL_BIT_FIELD_TYPE, DECL_QUALIFIER, DECL_FCONTEXT): Likewise.
(DECL_PACKED, DECL_BIT_FIELD): Likewise.
(DECL_FIELD_BITPOS): Deleted.
(DECL_FIELD_OFFSET, DECL_FIELD_BIT_OFFSET): New fields.
(DECL_RESULT, DECL_SAVED_INSNS): Use FUNCTION_DECL_CHECK.
(DECL_FRAME_SIZE, DECL_FUNCTION_CODE, DECL_NO_STATIC_CHAIN): Likewise.
(DECL_INLINE, DECL_BUILT_IN_NONANSI, DECL_IS_MALLOC): Likewise.
(DECL_BUILT_IN_CLASS, DECL_STATIC_CONSTRUCTOR): Likewise.
(DECL_STATIC_DESTRUCTOR, DECL_NO_CHECK_MEMORY_USAGE): Likewise.
(DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT, DECL_NO_LIMIT_STACK) Likewise.
(DECL_ORIGINAL_TYPE, TYPE_DECL_SUPPRESS_DEBUG): Use TYPE_DECL_CHECK.
(DECL_ARG_TYPE_AS_WRITEN, DECL_ARG_TYPE): Use PARM_DECL_CHECK.
(DECL_INCOMING_RTL, DECL_TRANSPARENT_UNION): Likewise.
(DECL_ALIGN): Adjust to new field in union.
(DECL_OFFSET_ALIGN): New field.
(DECL_ERROR_ISSUED, DECL_TOO_LATE): Use LABEL_DECL_CHECK.
(DECL_IN_TEXT_SECTION): Use VAR_DECL_CHECK.
(union tree_decl): Add struct for both aligns.
(enum tree_index): Add TI_BITSIZE_{ZERO,ONE,UNIT}.
(bitsize_zero_node, bitsize_one_node, bitsize_unit_node): Added.
(struct record_layout_info): Rework fields to have offset
alignment and byte and bit position.
(start_record_layout, place_field): Renamed from old names.
(rli_size_so_far, rli_size_unit_so_far, normalize_rli): New decls.
(byte_position, int_byte_position): Likewise.
(get_inner_reference): Change types of position and length.
* unroll.c (unroll_loop): New variable R; use for some loops.
MAX_LOCAL_REGNUM and MAXREGNUM now unsigned.
(calculate_giv_inc): Arg REGNO now unsigned.
(copy_loop_body): REGNO and SRC_REGNO now unsigned.
* varasm.c (assemble_variable): Clean up handling of size using
host_integerp and tree_low_cst.
(decode_addr_const): Use byte, not bit, position.
(output_constructor): bitpos and offsets are HOST_WIDE_INT;
use tree_low_cst and int_bit_position.
* objc/objc-act.c (build_ivar_list_initializer): Use byte_position.
* ch/actions.c (check_missing_cases): BYTES_NEEDED is HOST_WIDE_INT.
* ch/typeck.c (expand_constant_to_buffer): Use int_byte_position.
(extract_constant_from_buffer): Likewise.
* cp/class.c (build_vbase_pointer_fields): layout_field now
place_field.
(get_vfield_offset): Use byte_position.
(set_rtti_entry): Set OFFSET to ssizetype zero.
(get_binfo_offset_as_int): Deleted.
(dfs_record_base_offsets): Use tree_low_cst.
(dfs_search_base_offsets): Likewise.
(layout_nonempty_base_or_field): Reflect changes in RLI format
and call byte_position.
(layout_empty_base): Convert offset to ssizetype.
(build_base_field): use rli_size_unit_so_far.
(dfs_propagate_binfo_offsets): Do computation in proper type.
(layout_virtual_bases): Pass ssizetype to propagate_binfo_offsets.
(layout_class_type): Reflect changes in RLI names and fields.
(finish_struct_1): Set DECL_FIELD_OFFSET.
* cp/dump.c (dequeue_and_dump): Call bit_position.
* cp/expr.c (cplus_expand_constant): Use byte_position.
* cp/rtti.c (expand_class_desc): Use bitsize_one_node.
* cp/typeck.c (build_component_addr): Use byte_position and don't
special case for zero offset.
* f/com.c (ffecom_tree_canonize_ptr_): Use bitsize_zero_node.
(ffecom_tree_canonize_ref_): Likewise.
* java/class.c (make_field_value): Use byte_position.
* java/expr.c (JAVA_ARRAY_LENGTH_OFFSET): Use byte_position.
(java_array_data_offset): Likewise.
* java/java-tree.h (MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC): Add case to
bzero call.
From-SVN: r32742
2000-03-25 19:34:13 +01:00
|
|
|
|
if (dest_regno < FIRST_PSEUDO_REGISTER)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
if (copy)
|
|
|
|
|
SET_REGBIT (hard_reg_copy_preferences,
|
|
|
|
|
reg_allocno[src_regno], dest_regno);
|
|
|
|
|
|
|
|
|
|
SET_REGBIT (hard_reg_preferences,
|
|
|
|
|
reg_allocno[src_regno], dest_regno);
|
|
|
|
|
for (i = dest_regno;
|
|
|
|
|
i < dest_regno + HARD_REGNO_NREGS (dest_regno, GET_MODE (dest));
|
|
|
|
|
i++)
|
|
|
|
|
SET_REGBIT (hard_reg_full_preferences, reg_allocno[src_regno], i);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (src_regno < FIRST_PSEUDO_REGISTER && dest_regno >= FIRST_PSEUDO_REGISTER
|
|
|
|
|
&& reg_allocno[dest_regno] >= 0)
|
|
|
|
|
{
|
|
|
|
|
src_regno += offset;
|
* Rework fields used to describe positions of bitfields and
modify sizes to be unsigned and use HOST_WIDE_INT.
* alias.c (reg_known_value_size): Now unsigned.
* c-typeck.c (build_unary_op, case ADDR_EXPR): Use byte_position.
(really_start_incremental_init): Use bitsize_zero_node.
(push_init_level, pop_init_level, output_init_element): Likewise.
Use bitsize_unit_node and bitsize_one_node.
(output_pending_init_elements, process_init_element): Likewise.
* combine.c (combine_max_regno, reg_sign_bit_copies): Now unsigned.
(make_extraction): Position and length HOST_WIDE_INT and unsigned
HOST_WIDE_INT, respectively.
(get_pos_from_mask): Passed in value is unsigned HOST_WIDE_INT.
(num_sign_bit_copies): Returns unsigned.
BITWIDTH now unsigned; rework arithmetic.
Remove recursive call from arg to MAX.
(combine_instructions, init_reg_last_arrays): NREGS now unsigned.
(setup_incoming_promotions, can_combine_p, try_combine, simplify_set):
REGNO now unsigned.
(set_nonzero_bit_and_sign_copies): NUM now unsigned.
(find_split_point, expand_compound_operation, make_extraction): LEN
now unsigned HOST_WIDE_INT, POS now HOST_WIDE_INT.
(make_field_assignment): Likewise.
(combine_simplify_rtx): Add cast.
(expand_compound_operation): MODEWIDTH now unsigned; rework arithmetic.
(force_to_mode): WIDTH now unsigned; add cast.
(if_then_else_cond): SIZE now unsigned.
(nonzero_bits): MODE_WIDTH, RESULT_WIDTH, and WIDTH now unsigned.
(extended_count): Now returns unsigned.
(simplify_shift_const): COUNT unsigned; arg is now INPUT_COUNT.
Add SIGNED_COUNT variable; MODE_WORDS and FIRST_COUNT now unsigned.
(simplify_comparison): MODE_WIDTH now unsigned.
(update_table_tick): REGNO and ENDREGNO now unsigned; new var R.
(mark_used_regs_combine): Likewise; rework arithmetic.
(record_value_for_reg): REGNO, ENDREGNO, and I now unsigned.
(record_dead_and_set_regs, reg_dead_at_p, distribute_notes): Likewise.
(record_promoted_value): REGNO now unsigned.
(get_last_value_validate): REGNO, ENDREGNO, and J now unsigned.
(get_last_value): REGNO now unsigned.
(use_crosses_set_p): REGNO and ENDREGNO now unsigned.
(reg_dead_regno, reg_dead_endregno): Now unsigned.
(remove_death): Arg REGNO now unsigned.
(move_deaths): REGNO, DEADREGNO, DEADEND, OUREND, and I now unsigned.
(reg_bitfield_target_p): REGNO, REGNO, ENDREGNO, and ENDTREGNO
now unsigned.
* convert.c (convert_to_integer): INPREC and OUTPREC now unsigned.
* cse.c (struct qty_table_elem): FIRST_REG and LAST_REG now unsigned.
(struct cse_reg_info): REGNO now unsigned.
(cached_regno): Now unsigned.
(REGNO_QTY_VALID_P): Add cast.
(make_new_qty, make_regs_eqv, delete_reg_eqiv): Regno args unsigned.
(remove_invalid_regs): Likewise.
(remove_invalid_subreg_refs): Likewise; arg WORD also unsigned
as are variables END and I.
(get_cse_reg_info, insert): Likewise.
(mention_regs, invalidate_for_call): REGNO, ENDREGNO, and I unsigned.
(canon_hash): Likewise.
(insert_regs, lookup_for_remove): REGNO now unsigned.
(invalidate): REGNO, ENDREGNO, TREGNO, and TENDREGNO now unsigned.
New variable RN.
* dbxout.c (dbxout_parms, dbxout_reg_parms): Don't check for REGNO < 0.
* dwarf2out.c (dwarf2ou_frame_debug_expr): Remove cast.
* emit-rtl.c (subreg_realpart_p): Add cast.
(operand_subword): Arg I is now unsigned as is var PARTWORDS.
(operand_subword_force): Arg I is now unsigned.
* except.c (eh_regs): Variable I is now unsigned.
* explow.c (hard_function_value): BYTES is unsigned HOST_WIDE_INT.
* expmed.c (store_fixed_bit_field): Position is HOST_WIDE_INT;
length is unsigned HOST_WIDE_INT; likewise for internal variables.
(store_split_bit_field, extract_fixed_bit_field): Likewise.
(extract_split_bit_field, store_bit_field, extract_bit_field):
Likewise.
* expr.c (store_constructor_fields, store_constructor, store_field):
Positions are HOST_WIDE_INT and lengths are unsigned HOST_WIDE_INT.
(expand_assignment, expand_expr, expand_expr_unaligned): Likewise.
(do_jump): Likewise.
(move_by_pieces, move_by_pieces_ninsns, clear_by_pieces):
MAX_SIZE is now unsigned.
(emit_group_load): BYTEPOS is HOST_WIDE_INT; BYTELEN is unsigned.
(emit_group_store): Likewise.
(emit_move_insn): I now unsigned.
(store_constructor): Use host_integerp, tree_low_cst, and
bitsize_unit_node.
(get_inner_reference): Return bitpos and bitsize as HOST_WIDE_INT.
Rework all calculations to use trees and new fields.
* expr.h (promoted_input_arg): Regno now unsigned.
(store_bit_field, extract_bit_field): Adjust types of pos and size.
(mark_seen_cases): Arg is HOST_WIDE_INT.
* flow.c (verify_wide_reg_1): REGNO now unsigned.
* fold-const.c (decode_field_reference): Size and pos HOST_WIDE_INT;
precisions and alignments are unsigned.
(optimize_bit_field_compare, fold_truthop): Likewise.
(int_const_binop): Adjust threshold for size_int_type_wide call.
(fold_convert): Likewise.
(size_int_type_wide): Make table larger and fix thinko that only
had half of table used.
(all_ones_mask_p, fold): Precisions are unsigned.
* function.c (put_reg_info_stack): REGNO is unsigned.
(instantiate_decl): Size is HOST_WIDE_INT.
(instantiate_virtual_regs): I is unsigned.
(assign_parms): REGNO, REGNOI, and REGNOR are unsigned.
(promoted_input_arg): REGNO is unsigned.
* function.h (struct function): x_max_parm_reg is now unsigned.
* gcse.c (max_gcse_regno): Now unsigned.
(struct null_pointer_info): min_reg and max_reg now unsigned.
(lookup_set, next_set): REGNO arg now unsigned.
(compute_hash_table): REGNO and I now unsigned.
(handle_avail_expr): regnum_for_replacing now unsigned.
(cprop_insn): REGNO now unsigned.
(delete_null_pointer_checks_1): BLOCK_REG now pointer to unsigned.
* ggc-common.c (ggc_mark_tree_children, case FIELD_DECL): New case.
* global.c (set_preference): SRC_REGNO, DEST_REGNO, and I now unsigned.
* hard-reg-set.h (reg_class_size): Now unsigned.
* integrate.c (mark_stores): LAST_REG and I now unsigned; new UREGNO.
* jump.c (mark_modified_reg): I now unsigned; add cast.
(rtx_equal_for_thread_p): Add cast.
* loop.c (max_reg_before_loop): Now unsigned.
(struct_movable): REGNO now unsigned.
(try_copy_prop): REGNO arg unsigned.
(regs_match_p): XN and YN now unsigned.
(consec_sets_invariant_p, maybe_eliminate_biv): REGNO now unsigned.
(strength_reduce): Likewise; NREGS also unsigned.
(first_increment_giv, last_increment_giv unsigned): Now unsigned.
* loop.h (struct iv_class): REGNO now unsigned.
(max_reg_before_loop, first_increment_giv, last_increment_giv):
Now unsigned.
* machmode.h (mode_size, mode_unit_size): Now unsigned.
(mode_for_size, smallest_mode_for_size): Pass size as unsigned.
* optabs.c (expand_binop): I and NWORDS now unsigned.
(expand_unop): I now unsigned.
* print-tree.c (print_node): Don't print DECL_FIELD_BITPOS, but do
print DECL_FIELD_OFFSET and DECL_FIELD_BIT_OFFSET.
* real.c (significand_size): Now returns unsigned.
* real.h (significand_size): Likewise.
* regclass.c (reg_class_size): Now unsigned.
(choose_hard_reg_mode): Both operands now unsigned.
(record_reg_classes): REGNO and NR now unsigned.
(reg_scan): NREGS now unsigned.
(reg_scan_update): old_max_regno now unsigned.
(reg_scan_mark_refs): Arg MIN_REGNO and var REGNO now unsigned.
* reload.c (find_valid_class): BEST_SIZE now unsigned.
(find_dummy_reload): REGNO, NWORDS, and I now unsigned.
(hard_reg_set_here_p): Args BEG_REGNO and END_REGNO now unsigned.
Likewise for variable R.
(refers_to_regno_for_reload_p): Args REGNO and END_REGNO now unsigned,
as are variables INNER_REGNO and INNER_ENDREGNO; add new variable R.
(find_equiv_reg): Add casts.
(regno_clobbered_p): Arg REGNO now unsigned.
* reload.h (struct reload): NREGS now unsigned.
(refers_to_regno_for_reload_p): Regno args are unsigned.
(regno_clobbered_p): Likewise.
* reload1.c (reg_max_ref_width, spill_stack_slot_width): Now unsigned.
(compute_use_by_pseudos): REGNO now unsigned.
(find_reg): I and J now unsigned, new variable K, and change loop
variables accordingly; THIS_NREGS now unsigned.
(alter_reg): INHERENT_SIZE and TOTAL_SIZE now unsigned.
(spill_hard_reg): REGNO arg now unsigned; add casts.
(forget_old_reloads_1): REGNO, NR, and I now unsigned.
(mark_reload_reg_in_use): Arg REGNO and vars NREGS and I now unsigned.
(clear_reload_reg_in_use): Arg REGNO and vars NREGS, START_REGNO,
END_REGNO, CONFLICT_START, and CONFLICT_END now unsigned.
(reload_reg_free_p, reload_reg_reaches_end_p): Arg REGNO now unsigned.
(choose_reload_regs): MAX_GROUP_SIZE now unsigned.
(emit_reload_insns): REGNO now unsigned.
(reload_cse_move2add): Add cast.
(move2add_note_store): REGNO and I now unsigned; new variable ENDREGNO
and rework loop.
* resource.c (mark_referenced_resources, mark_set_resources): New
variable R; REGNO and LAST_REGNO now unsigned.
(mark_target_live_regs): J and REGNO now unsigned.
* rtl.c (mode_size, mode_unit_size): Now unsigned.
* rtl.h (union rtunion_def): New field rtuint.
(XCUINT): New macro.
(ADDRESSOF_REGNO, REGNO, SUBREG_WORD): New XCUINT.
(operand_subword, operand_subword_force): Word number is unsigned.
(choose_hard_reg_mode): Operands are unsigned.
(refers_to-regno_p, dead_or_set_regno_p): Regno arg is unsigned.
(find_regno_note, find_regno_fusage, replace_regs): Likewise.
(regno_use_in, combine_instructions, remove_death): Likewise.
(reg_scan, reg_scan_update): Likewise.
(extended_count): Return is unsigned.
* rtlanal.c (refers_to_regno_p): Args REGNO and ENDREGNO and vars I,
INNER_REGNO, and INNER_ENDREGNO now unsigned; new variable X_REGNO.
(reg_overlap_mentioned_p): REGNO and ENDREGNO now unsigned.
(reg_set_last_first_regno, reg_set_last_last_regno): Now unsigned.
(reg_reg_last_1): FIRS and LAST now unsigned.
(dead_or_set_p): REGNO, LAST_REGNO, and I now unsigned.
(dead_or_set_regno_p): Arg TEST_REGNO and vars REGNO and ENDREGNO
now unsigned.
(find_regno_note, regno_use_in): Arg REGNO now unsigned.
(find_regno_fusage): Likewise; also var REGNOTE now unsigned.
(find_reg_fusage): Variables REGNO, END_REGNO, and I now unsigned.
(replace_regs): Arg NREGS now unsigned.
* sdbout.c (sdbout_parms, sdbout_reg_parms): Don't check REGNO < 0.
* simplify-rtx.c (simplify_unary_operation): WIDTH now unsigned.
(simplify_binary_operation): Likewise.
(cselib_invalidate_regno): Arg REGNO and variables ENDREGNO, I, and
THIS_LAST now unsigned.
(cselib_record_set): Add cast.
* ssa.c (ssa_max_reg_num): Now unsigned.
(rename_block): REGNO now unsigned.
* stmt.c (expand_return): Bit positions unsigned HOST_WIDE_INT;
sizes now unsigned.
(all_cases_count): Just return -1 not -2.
COUNT, MINVAL, and LASTVAL now HOST_WIDE_INT.
Rework tests to use trees whenever possible.
Use host_integerp and tree_low_cst.
(mark_seen_cases): COUNT arg now HOST_WIDE_INT;
Likewise variable NEXT_NODE_OFFSET; XLO now unsigned.
(check_for_full_enumeration_handing): BYTES_NEEDED, I to HOST_WIDE_INT.
* stor-layout.c (mode_for_size): SIZE arg now unsigned.
(smallest_mode_for_size): Likewise.
(layout_decl): Simplify handing of a specified DECL_SIZE_UNIT.
KNOWN_ALIGN is now an alignment, so simplify code.
Don't turn off DECL_BIT_FIELD if field is BLKmode, but not type.
(start_record_layout): Renamed from new_record_layout_info.
Update to new fields.
(debug_rli, normalize_rli, rli_size_unit_so_far, rli_size_so_far):
New functions.
(place_union_field): Renamed from layout_union_field.
Update to use new fields in rli.
(place_field): Renamed from layout_field.
Major rewrite to use new fields in rli; pass alignment to layout_decl.
(finalize_record_size): Rework to use new fields in rli and handle
union.
(compute_record_mode): Rework to simplify and to use new DECL fields.
(finalize_type_size): Make rounding more consistent.
(finish_union_layout): Deleted.
(layout_type, case VOID_TYPE): Don't set TYPE_SIZE_UNIT either.
(layout_type, case RECORD_TYPE): Call new function names.
(initialize_sizetypes): Set TYPE_IS_SIZETYPE.
(set_sizetype): Set TYPE_IS_SIZETYPE earlier.
(get_best_mode): UNIT is now unsigned; remove casts.
* tree.c (bit_position): Compute from new fields.
(byte_position, int_byte_position): New functions.
(print_type_hash_statistics): Cast to remove warning.
(build_range_type): Use host_integerp and tree_low_cst to try to hash.
(build_index_type): Likewise; make subtype of sizetype.
(build_index_2_type): Pass sizetype to build_range_type.
(build_common_tree_nodes): Use size_int and bitsize_int to
initialize nodes; add bitsize_{zero,one,unit}_node.
* tree.h (DECL_FIELD_CONTEXT): Use FIELD_DECL_CHECK.
(DECL_BIT_FIELD_TYPE, DECL_QUALIFIER, DECL_FCONTEXT): Likewise.
(DECL_PACKED, DECL_BIT_FIELD): Likewise.
(DECL_FIELD_BITPOS): Deleted.
(DECL_FIELD_OFFSET, DECL_FIELD_BIT_OFFSET): New fields.
(DECL_RESULT, DECL_SAVED_INSNS): Use FUNCTION_DECL_CHECK.
(DECL_FRAME_SIZE, DECL_FUNCTION_CODE, DECL_NO_STATIC_CHAIN): Likewise.
(DECL_INLINE, DECL_BUILT_IN_NONANSI, DECL_IS_MALLOC): Likewise.
(DECL_BUILT_IN_CLASS, DECL_STATIC_CONSTRUCTOR): Likewise.
(DECL_STATIC_DESTRUCTOR, DECL_NO_CHECK_MEMORY_USAGE): Likewise.
(DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT, DECL_NO_LIMIT_STACK) Likewise.
(DECL_ORIGINAL_TYPE, TYPE_DECL_SUPPRESS_DEBUG): Use TYPE_DECL_CHECK.
(DECL_ARG_TYPE_AS_WRITEN, DECL_ARG_TYPE): Use PARM_DECL_CHECK.
(DECL_INCOMING_RTL, DECL_TRANSPARENT_UNION): Likewise.
(DECL_ALIGN): Adjust to new field in union.
(DECL_OFFSET_ALIGN): New field.
(DECL_ERROR_ISSUED, DECL_TOO_LATE): Use LABEL_DECL_CHECK.
(DECL_IN_TEXT_SECTION): Use VAR_DECL_CHECK.
(union tree_decl): Add struct for both aligns.
(enum tree_index): Add TI_BITSIZE_{ZERO,ONE,UNIT}.
(bitsize_zero_node, bitsize_one_node, bitsize_unit_node): Added.
(struct record_layout_info): Rework fields to have offset
alignment and byte and bit position.
(start_record_layout, place_field): Renamed from old names.
(rli_size_so_far, rli_size_unit_so_far, normalize_rli): New decls.
(byte_position, int_byte_position): Likewise.
(get_inner_reference): Change types of position and length.
* unroll.c (unroll_loop): New variable R; use for some loops.
MAX_LOCAL_REGNUM and MAXREGNUM now unsigned.
(calculate_giv_inc): Arg REGNO now unsigned.
(copy_loop_body): REGNO and SRC_REGNO now unsigned.
* varasm.c (assemble_variable): Clean up handling of size using
host_integerp and tree_low_cst.
(decode_addr_const): Use byte, not bit, position.
(output_constructor): bitpos and offsets are HOST_WIDE_INT;
use tree_low_cst and int_bit_position.
* objc/objc-act.c (build_ivar_list_initializer): Use byte_position.
* ch/actions.c (check_missing_cases): BYTES_NEEDED is HOST_WIDE_INT.
* ch/typeck.c (expand_constant_to_buffer): Use int_byte_position.
(extract_constant_from_buffer): Likewise.
* cp/class.c (build_vbase_pointer_fields): layout_field now
place_field.
(get_vfield_offset): Use byte_position.
(set_rtti_entry): Set OFFSET to ssizetype zero.
(get_binfo_offset_as_int): Deleted.
(dfs_record_base_offsets): Use tree_low_cst.
(dfs_search_base_offsets): Likewise.
(layout_nonempty_base_or_field): Reflect changes in RLI format
and call byte_position.
(layout_empty_base): Convert offset to ssizetype.
(build_base_field): use rli_size_unit_so_far.
(dfs_propagate_binfo_offsets): Do computation in proper type.
(layout_virtual_bases): Pass ssizetype to propagate_binfo_offsets.
(layout_class_type): Reflect changes in RLI names and fields.
(finish_struct_1): Set DECL_FIELD_OFFSET.
* cp/dump.c (dequeue_and_dump): Call bit_position.
* cp/expr.c (cplus_expand_constant): Use byte_position.
* cp/rtti.c (expand_class_desc): Use bitsize_one_node.
* cp/typeck.c (build_component_addr): Use byte_position and don't
special case for zero offset.
* f/com.c (ffecom_tree_canonize_ptr_): Use bitsize_zero_node.
(ffecom_tree_canonize_ref_): Likewise.
* java/class.c (make_field_value): Use byte_position.
* java/expr.c (JAVA_ARRAY_LENGTH_OFFSET): Use byte_position.
(java_array_data_offset): Likewise.
* java/java-tree.h (MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC): Add case to
bzero call.
From-SVN: r32742
2000-03-25 19:34:13 +01:00
|
|
|
|
if (src_regno < FIRST_PSEUDO_REGISTER)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
{
|
|
|
|
|
if (copy)
|
|
|
|
|
SET_REGBIT (hard_reg_copy_preferences,
|
|
|
|
|
reg_allocno[dest_regno], src_regno);
|
|
|
|
|
|
|
|
|
|
SET_REGBIT (hard_reg_preferences,
|
|
|
|
|
reg_allocno[dest_regno], src_regno);
|
|
|
|
|
for (i = src_regno;
|
|
|
|
|
i < src_regno + HARD_REGNO_NREGS (src_regno, GET_MODE (src));
|
|
|
|
|
i++)
|
|
|
|
|
SET_REGBIT (hard_reg_full_preferences, reg_allocno[dest_regno], i);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Indicate that hard register number FROM was eliminated and replaced with
|
|
|
|
|
an offset from hard register number TO. The status of hard registers live
|
|
|
|
|
at the start of a basic block is updated by replacing a use of FROM with
|
|
|
|
|
a use of TO. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
mark_elimination (from, to)
|
|
|
|
|
int from, to;
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < n_basic_blocks; i++)
|
1999-02-26 00:45:42 +01:00
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
regset r = BASIC_BLOCK (i)->global_live_at_start;
|
1999-02-26 00:45:42 +01:00
|
|
|
|
if (REGNO_REG_SET_P (r, from))
|
|
|
|
|
{
|
|
|
|
|
CLEAR_REGNO_REG_SET (r, from);
|
|
|
|
|
SET_REGNO_REG_SET (r, to);
|
|
|
|
|
}
|
|
|
|
|
}
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
/* Used for communication between the following functions. Holds the
|
|
|
|
|
current life information. */
|
|
|
|
|
static regset live_relevant_regs;
|
|
|
|
|
|
1999-12-15 15:57:29 +01:00
|
|
|
|
/* Record in live_relevant_regs and REGS_SET that register REG became live.
|
|
|
|
|
This is called via note_stores. */
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
static void
|
1999-12-15 15:57:29 +01:00
|
|
|
|
reg_becomes_live (reg, setter, regs_set)
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
rtx reg;
|
|
|
|
|
rtx setter ATTRIBUTE_UNUSED;
|
1999-12-15 15:57:29 +01:00
|
|
|
|
void *regs_set;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
|
|
|
|
int regno;
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) == SUBREG)
|
|
|
|
|
reg = SUBREG_REG (reg);
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) != REG)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
regno = REGNO (reg);
|
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER)
|
|
|
|
|
{
|
|
|
|
|
int nregs = HARD_REGNO_NREGS (regno, GET_MODE (reg));
|
|
|
|
|
while (nregs-- > 0)
|
1999-12-15 15:57:29 +01:00
|
|
|
|
{
|
|
|
|
|
SET_REGNO_REG_SET (live_relevant_regs, regno);
|
|
|
|
|
if (! fixed_regs[regno])
|
|
|
|
|
SET_REGNO_REG_SET ((regset) regs_set, regno);
|
|
|
|
|
regno++;
|
|
|
|
|
}
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
|
|
|
|
else if (reg_renumber[regno] >= 0)
|
1999-12-15 15:57:29 +01:00
|
|
|
|
{
|
|
|
|
|
SET_REGNO_REG_SET (live_relevant_regs, regno);
|
|
|
|
|
SET_REGNO_REG_SET ((regset) regs_set, regno);
|
|
|
|
|
}
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Record in live_relevant_regs that register REGNO died. */
|
|
|
|
|
static void
|
1999-12-15 15:57:29 +01:00
|
|
|
|
reg_dies (regno, mode, chain)
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
int regno;
|
|
|
|
|
enum machine_mode mode;
|
1999-12-15 15:57:29 +01:00
|
|
|
|
struct insn_chain *chain;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
|
|
|
|
if (regno < FIRST_PSEUDO_REGISTER)
|
|
|
|
|
{
|
|
|
|
|
int nregs = HARD_REGNO_NREGS (regno, mode);
|
|
|
|
|
while (nregs-- > 0)
|
1999-12-15 15:57:29 +01:00
|
|
|
|
{
|
|
|
|
|
CLEAR_REGNO_REG_SET (live_relevant_regs, regno);
|
|
|
|
|
if (! fixed_regs[regno])
|
1999-12-20 13:13:01 +01:00
|
|
|
|
SET_REGNO_REG_SET (&chain->dead_or_set, regno);
|
1999-12-15 15:57:29 +01:00
|
|
|
|
regno++;
|
|
|
|
|
}
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
1999-12-15 15:57:29 +01:00
|
|
|
|
{
|
|
|
|
|
CLEAR_REGNO_REG_SET (live_relevant_regs, regno);
|
|
|
|
|
if (reg_renumber[regno] >= 0)
|
1999-12-20 13:13:01 +01:00
|
|
|
|
SET_REGNO_REG_SET (&chain->dead_or_set, regno);
|
1999-12-15 15:57:29 +01:00
|
|
|
|
}
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Walk the insns of the current function and build reload_insn_chain,
|
|
|
|
|
and record register life information. */
|
2000-01-19 10:42:11 +01:00
|
|
|
|
void
|
1999-08-08 11:09:06 +02:00
|
|
|
|
build_insn_chain (first)
|
|
|
|
|
rtx first;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
|
|
|
|
struct insn_chain **p = &reload_insn_chain;
|
|
|
|
|
struct insn_chain *prev = 0;
|
1999-08-08 11:09:06 +02:00
|
|
|
|
int b = 0;
|
2000-03-05 23:35:27 +01:00
|
|
|
|
regset_head live_relevant_regs_head;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
2000-03-05 23:35:27 +01:00
|
|
|
|
live_relevant_regs = INITIALIZE_REG_SET (live_relevant_regs_head);
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
for (; first; first = NEXT_INSN (first))
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
1999-08-08 11:09:06 +02:00
|
|
|
|
struct insn_chain *c;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
if (first == BLOCK_HEAD (b))
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
1999-08-08 11:09:06 +02:00
|
|
|
|
int i;
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
CLEAR_REG_SET (live_relevant_regs);
|
1999-11-05 09:31:48 +01:00
|
|
|
|
|
|
|
|
|
EXECUTE_IF_SET_IN_BITMAP
|
|
|
|
|
(BASIC_BLOCK (b)->global_live_at_start, 0, i,
|
|
|
|
|
{
|
|
|
|
|
if (i < FIRST_PSEUDO_REGISTER
|
|
|
|
|
? ! TEST_HARD_REG_BIT (eliminable_regset, i)
|
|
|
|
|
: reg_renumber[i] >= 0)
|
|
|
|
|
SET_REGNO_REG_SET (live_relevant_regs, i);
|
|
|
|
|
});
|
|
|
|
|
}
|
1999-08-08 11:09:06 +02:00
|
|
|
|
|
|
|
|
|
if (GET_CODE (first) != NOTE && GET_CODE (first) != BARRIER)
|
1999-08-07 19:05:46 +02:00
|
|
|
|
{
|
1999-08-08 11:09:06 +02:00
|
|
|
|
c = new_insn_chain ();
|
|
|
|
|
c->prev = prev;
|
|
|
|
|
prev = c;
|
|
|
|
|
*p = c;
|
|
|
|
|
p = &c->next;
|
|
|
|
|
c->insn = first;
|
|
|
|
|
c->block = b;
|
|
|
|
|
|
2000-08-04 22:28:08 +02:00
|
|
|
|
if (INSN_P (first))
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
{
|
1999-08-08 11:09:06 +02:00
|
|
|
|
rtx link;
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
/* Mark the death of everything that dies in this instruction. */
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
for (link = REG_NOTES (first); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_DEAD
|
|
|
|
|
&& GET_CODE (XEXP (link, 0)) == REG)
|
1999-12-15 15:57:29 +01:00
|
|
|
|
reg_dies (REGNO (XEXP (link, 0)), GET_MODE (XEXP (link, 0)),
|
|
|
|
|
c);
|
|
|
|
|
|
1999-12-20 13:13:01 +01:00
|
|
|
|
COPY_REG_SET (&c->live_throughout, live_relevant_regs);
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
/* Mark everything born in this instruction as live. */
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
|
1999-12-15 15:57:29 +01:00
|
|
|
|
note_stores (PATTERN (first), reg_becomes_live,
|
1999-12-20 13:13:01 +01:00
|
|
|
|
&c->dead_or_set);
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
}
|
1999-12-15 15:57:29 +01:00
|
|
|
|
else
|
1999-12-20 13:13:01 +01:00
|
|
|
|
COPY_REG_SET (&c->live_throughout, live_relevant_regs);
|
1999-08-08 11:09:06 +02:00
|
|
|
|
|
2000-08-04 22:28:08 +02:00
|
|
|
|
if (INSN_P (first))
|
1999-08-08 11:09:06 +02:00
|
|
|
|
{
|
|
|
|
|
rtx link;
|
|
|
|
|
|
|
|
|
|
/* Mark anything that is set in this insn and then unused as dying. */
|
|
|
|
|
|
|
|
|
|
for (link = REG_NOTES (first); link; link = XEXP (link, 1))
|
|
|
|
|
if (REG_NOTE_KIND (link) == REG_UNUSED
|
|
|
|
|
&& GET_CODE (XEXP (link, 0)) == REG)
|
1999-12-15 15:57:29 +01:00
|
|
|
|
reg_dies (REGNO (XEXP (link, 0)), GET_MODE (XEXP (link, 0)),
|
|
|
|
|
c);
|
1999-08-08 11:09:06 +02:00
|
|
|
|
}
|
1998-10-09 15:28:55 +02:00
|
|
|
|
}
|
1999-08-07 19:05:46 +02:00
|
|
|
|
|
1999-08-08 11:09:06 +02:00
|
|
|
|
if (first == BLOCK_END (b))
|
|
|
|
|
b++;
|
|
|
|
|
|
|
|
|
|
/* Stop after we pass the end of the last basic block. Verify that
|
|
|
|
|
no real insns are after the end of the last basic block.
|
|
|
|
|
|
|
|
|
|
We may want to reorganize the loop somewhat since this test should
|
2001-06-07 22:17:28 +02:00
|
|
|
|
always be the right exit test. Allow an ADDR_VEC or ADDR_DIF_VEC if
|
|
|
|
|
the previous real insn is a JUMP_INSN. */
|
1999-08-08 11:09:06 +02:00
|
|
|
|
if (b == n_basic_blocks)
|
|
|
|
|
{
|
|
|
|
|
for (first = NEXT_INSN (first) ; first; first = NEXT_INSN (first))
|
2001-06-07 22:17:28 +02:00
|
|
|
|
if (INSN_P (first)
|
|
|
|
|
&& GET_CODE (PATTERN (first)) != USE
|
|
|
|
|
&& ! ((GET_CODE (PATTERN (first)) == ADDR_VEC
|
|
|
|
|
|| GET_CODE (PATTERN (first)) == ADDR_DIFF_VEC)
|
|
|
|
|
&& prev_real_insn (first) != 0
|
|
|
|
|
&& GET_CODE (prev_real_insn (first)) == JUMP_INSN))
|
1999-08-08 11:09:06 +02:00
|
|
|
|
abort ();
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
Makefile.in (stupid.o): Update dependencies.
* Makefile.in (stupid.o): Update dependencies.
(global.o): Likewise.
* global.c: Include reload.h
(reg_becomes_live): New function.
(reg_dies): New function.
(build_insn_chain): New function.
(global_alloc): Call build_insn_chain before calling reload.
* reload.h (struct needs): New structure definition.
(struct insn_chain): Likewise.
(reload_insn_chain): Declare variable.
(new_insn_chain): Declare function.
* reload1.c (reload_startobj): New variable.
(reload_insn_chain): New variable.
(unused_insn_chains): New variable.
(new_insn_chain): New function.
(init_reload): Initialize reload_startobj, not reload_firstobj.
(reload): Initialize reload_firstobj.
Before returning, free everything on the reload_obstack.
* stupid.c: Include insn-config.h, reload.h and basic-block.h.
(reg_where_dead_chain, reg_where_born_exact, reg_where_born_clobber,
current_chain): New variables.
(reg_where_born): Delete variable.
(REG_WHERE_BORN): New macro.
(find_clobbered_regs): New function.
(stupid_life_analysis): Don't allocate/free reg_where_born.
Allocate and free reg_where_born_exact, reg_where_born_clobber,
reg_where_dead_chain.
Use REG_WHERE_BORN instead of reg_where_born.
While processing the insns, build the reload_insn_chain with
information about register lifetimes.
(stupid_reg_compare): Use REG_WHERE_BORN instead of reg_where_born.
(stupid_mark_refs): Replace arg INSN with arg CHAIN. All callers
changed.
Compute and information about birth and death of pseudo registers in
reg_where_dead_chain, reg_where_born_exact and reg_where_born_clobber.
Delete code to set elements of reg_where_born.
From-SVN: r22862
1998-10-06 02:39:23 +02:00
|
|
|
|
FREE_REG_SET (live_relevant_regs);
|
|
|
|
|
*p = 0;
|
|
|
|
|
}
|
|
|
|
|
|
1999-08-04 09:50:08 +02:00
|
|
|
|
/* Print debugging trace information if -dg switch is given,
|
1991-12-14 13:14:54 +01:00
|
|
|
|
showing the information on which the allocation decisions are based. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
dump_conflicts (file)
|
|
|
|
|
FILE *file;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int i;
|
|
|
|
|
int has_preferences;
|
|
|
|
|
int nregs;
|
1998-09-08 02:29:35 +02:00
|
|
|
|
nregs = 0;
|
|
|
|
|
for (i = 0; i < max_allocno; i++)
|
|
|
|
|
{
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_renumber[allocno[allocno_order[i]].reg] >= 0)
|
1998-09-08 02:29:35 +02:00
|
|
|
|
continue;
|
|
|
|
|
nregs++;
|
|
|
|
|
}
|
|
|
|
|
fprintf (file, ";; %d regs to allocate:", nregs);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (i = 0; i < max_allocno; i++)
|
|
|
|
|
{
|
|
|
|
|
int j;
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (reg_renumber[allocno[allocno_order[i]].reg] >= 0)
|
1998-09-08 02:29:35 +02:00
|
|
|
|
continue;
|
1999-11-21 13:53:31 +01:00
|
|
|
|
fprintf (file, " %d", allocno[allocno_order[i]].reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = 0; j < max_regno; j++)
|
|
|
|
|
if (reg_allocno[j] == allocno_order[i]
|
1999-11-21 13:53:31 +01:00
|
|
|
|
&& j != allocno[allocno_order[i]].reg)
|
1991-12-14 13:14:54 +01:00
|
|
|
|
fprintf (file, "+%d", j);
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (allocno[allocno_order[i]].size != 1)
|
|
|
|
|
fprintf (file, " (%d)", allocno[allocno_order[i]].size);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
}
|
|
|
|
|
fprintf (file, "\n");
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < max_allocno; i++)
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int j;
|
1999-11-21 13:53:31 +01:00
|
|
|
|
fprintf (file, ";; %d conflicts:", allocno[i].reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = 0; j < max_allocno; j++)
|
1999-11-05 09:31:48 +01:00
|
|
|
|
if (CONFLICTP (j, i))
|
1999-11-21 13:53:31 +01:00
|
|
|
|
fprintf (file, " %d", allocno[j].reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (TEST_HARD_REG_BIT (allocno[i].hard_reg_conflicts, j))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
fprintf (file, " %d", j);
|
|
|
|
|
fprintf (file, "\n");
|
|
|
|
|
|
|
|
|
|
has_preferences = 0;
|
|
|
|
|
for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (TEST_HARD_REG_BIT (allocno[i].hard_reg_preferences, j))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
has_preferences = 1;
|
|
|
|
|
|
|
|
|
|
if (! has_preferences)
|
|
|
|
|
continue;
|
1999-11-21 13:53:31 +01:00
|
|
|
|
fprintf (file, ";; %d preferences:", allocno[i].reg);
|
1991-12-14 13:14:54 +01:00
|
|
|
|
for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
|
1999-11-21 13:53:31 +01:00
|
|
|
|
if (TEST_HARD_REG_BIT (allocno[i].hard_reg_preferences, j))
|
1991-12-14 13:14:54 +01:00
|
|
|
|
fprintf (file, " %d", j);
|
|
|
|
|
fprintf (file, "\n");
|
|
|
|
|
}
|
|
|
|
|
fprintf (file, "\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
dump_global_regs (file)
|
|
|
|
|
FILE *file;
|
|
|
|
|
{
|
2001-10-11 05:16:15 +02:00
|
|
|
|
int i, j;
|
1991-12-14 13:14:54 +01:00
|
|
|
|
|
|
|
|
|
fprintf (file, ";; Register dispositions:\n");
|
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER, j = 0; i < max_regno; i++)
|
|
|
|
|
if (reg_renumber[i] >= 0)
|
|
|
|
|
{
|
|
|
|
|
fprintf (file, "%d in %d ", i, reg_renumber[i]);
|
|
|
|
|
if (++j % 6 == 0)
|
|
|
|
|
fprintf (file, "\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf (file, "\n\n;; Hard regs used: ");
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
if (regs_ever_live[i])
|
|
|
|
|
fprintf (file, " %d", i);
|
|
|
|
|
fprintf (file, "\n\n");
|
|
|
|
|
}
|