1997-07-14 12:49:07 +02:00
|
|
|
|
/* Functions to support general ended bitmaps.
|
bitmap.c, [...]: Update copyright.
* bitmap.c, bitmap.h, builtin-attrs.def, cfglayout.h,
collect2.h, conflict.c, coretypes.h, coverage.h, errors.h,
gcc.h, gcov-dump.c, gen-protos.c, gencheck.c, gencodes.c,
genconstants.c, gengenrtl.c, genmodes.c, genpeep.c,
gensupport.h, graph.h, gthr-gnat.c, gthr-gnat.h, gthr-posix.c,
gthr-posix.h, hard-reg-set.h, hwint.h, integrate.h, libgcc2.c,
lists.c, machmode.def, mips-tdump.c, opts.h, params.c,
predict.def, predict.h, protoize.c, reload.h, resource.h,
rtl-error.c, sbitmap.c, sbitmap.h, sreal.c, tlink.c,
tree-dump.h, tree-inline.h, unwind-dw2-fde.c, unwind-dw2.c,
unwind-sjlj.c, value-prof.h: Update copyright.
From-SVN: r89097
2004-10-15 16:47:12 +02:00
|
|
|
|
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2003, 2004
|
2003-01-25 19:21:22 +01:00
|
|
|
|
Free Software Foundation, Inc.
|
1997-07-14 12:49:07 +02: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.
|
1997-07-14 12:49:07 +02: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.
|
1997-07-14 12:49:07 +02: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.
|
1997-07-14 12:49:07 +02: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. */
|
1997-07-14 12:49:07 +02: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"
|
2002-12-16 19:23:00 +01:00
|
|
|
|
#include "coretypes.h"
|
|
|
|
|
#include "tm.h"
|
1997-07-14 12:49:07 +02:00
|
|
|
|
#include "rtl.h"
|
|
|
|
|
#include "flags.h"
|
|
|
|
|
#include "obstack.h"
|
2002-06-04 09:11:05 +02:00
|
|
|
|
#include "ggc.h"
|
2000-05-20 00:27:28 +02:00
|
|
|
|
#include "bitmap.h"
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
1997-09-04 17:12:20 +02:00
|
|
|
|
/* Obstack to allocate bitmap elements from. */
|
|
|
|
|
static struct obstack bitmap_obstack;
|
|
|
|
|
static int bitmap_obstack_init = FALSE;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
#ifndef INLINE
|
|
|
|
|
#ifndef __GNUC__
|
|
|
|
|
#define INLINE
|
|
|
|
|
#else
|
|
|
|
|
#define INLINE __inline__
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Global data */
|
2001-08-01 19:57:27 +02:00
|
|
|
|
bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
|
|
|
|
|
static bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
|
gengtype.c (create_option): New function.
* gengtype.c (create_option): New function.
* gengtype.h: Prototype it.
* gengtype-yacc.y (stringseq): New rule.
(option): Use create_option. Add new bare ID production. Use
stringseq, not STRING directly.
* alias.c, bitmap.c, c-decl.c, cgraph.h, cpplib.h, cselib.h
* dwarf2out.c, emit-rtl.c, function.h, lists.c, tree.h
* varray.h, config/alpha/alpha.c, cp/name-lookup.c, cp/parser.c
* f/com.c, java/builtins.c, java/expr.c, java/jcf.h, java/parse.h:
Use new shorter form of GTY markers.
* doc/gty.texi: Rewrite.
From-SVN: r80091
2004-03-30 21:19:06 +02:00
|
|
|
|
static GTY((deletable)) bitmap_element *bitmap_ggc_free;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2003-06-15 15:43:32 +02:00
|
|
|
|
static void bitmap_elem_to_freelist (bitmap, bitmap_element *);
|
|
|
|
|
static void bitmap_element_free (bitmap, bitmap_element *);
|
|
|
|
|
static bitmap_element *bitmap_element_allocate (bitmap);
|
|
|
|
|
static int bitmap_element_zerop (bitmap_element *);
|
|
|
|
|
static void bitmap_element_link (bitmap, bitmap_element *);
|
|
|
|
|
static bitmap_element *bitmap_find_bit (bitmap, unsigned int);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2002-06-04 09:11:05 +02:00
|
|
|
|
/* Add ELEM to the appropriate freelist. */
|
|
|
|
|
static INLINE void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
|
2002-06-04 09:11:05 +02:00
|
|
|
|
{
|
|
|
|
|
if (head->using_obstack)
|
|
|
|
|
{
|
|
|
|
|
elt->next = bitmap_free;
|
|
|
|
|
bitmap_free = elt;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
elt->next = bitmap_ggc_free;
|
|
|
|
|
bitmap_ggc_free = elt;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2001-07-11 19:34:48 +02:00
|
|
|
|
/* Free a bitmap element. Since these are allocated off the
|
|
|
|
|
bitmap_obstack, "free" actually means "put onto the freelist". */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
static INLINE void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_element_free (bitmap head, bitmap_element *elt)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *next = elt->next;
|
|
|
|
|
bitmap_element *prev = elt->prev;
|
|
|
|
|
|
|
|
|
|
if (prev)
|
|
|
|
|
prev->next = next;
|
|
|
|
|
|
|
|
|
|
if (next)
|
|
|
|
|
next->prev = prev;
|
|
|
|
|
|
|
|
|
|
if (head->first == elt)
|
|
|
|
|
head->first = next;
|
|
|
|
|
|
|
|
|
|
/* Since the first thing we try is to insert before current,
|
|
|
|
|
make current the next entry in preference to the previous. */
|
|
|
|
|
if (head->current == elt)
|
2001-10-31 04:01:17 +01:00
|
|
|
|
{
|
|
|
|
|
head->current = next != 0 ? next : prev;
|
|
|
|
|
if (head->current)
|
|
|
|
|
head->indx = head->current->indx;
|
|
|
|
|
}
|
2002-06-04 09:11:05 +02:00
|
|
|
|
bitmap_elem_to_freelist (head, elt);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Allocate a bitmap element. The bits are cleared, but nothing else is. */
|
|
|
|
|
|
|
|
|
|
static INLINE bitmap_element *
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_element_allocate (bitmap head)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *element;
|
|
|
|
|
|
2002-06-04 09:11:05 +02:00
|
|
|
|
if (head->using_obstack)
|
1997-09-04 17:12:20 +02:00
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
if (bitmap_free != 0)
|
1997-09-04 17:12:20 +02:00
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
element = bitmap_free;
|
|
|
|
|
bitmap_free = element->next;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* We can't use gcc_obstack_init to initialize the obstack since
|
|
|
|
|
print-rtl.c now calls bitmap functions, and bitmap is linked
|
|
|
|
|
into the gen* functions. */
|
|
|
|
|
if (!bitmap_obstack_init)
|
|
|
|
|
{
|
|
|
|
|
bitmap_obstack_init = TRUE;
|
2003-04-06 23:44:09 +02:00
|
|
|
|
|
1997-09-04 17:12:20 +02:00
|
|
|
|
#if !defined(__GNUC__) || (__GNUC__ < 2)
|
|
|
|
|
#define __alignof__(type) 0
|
|
|
|
|
#endif
|
2003-04-06 23:44:09 +02:00
|
|
|
|
|
2002-06-04 09:11:05 +02:00
|
|
|
|
obstack_specify_allocation (&bitmap_obstack, OBSTACK_CHUNK_SIZE,
|
|
|
|
|
__alignof__ (bitmap_element),
|
2003-04-06 23:44:09 +02:00
|
|
|
|
obstack_chunk_alloc,
|
|
|
|
|
obstack_chunk_free);
|
2002-06-04 09:11:05 +02:00
|
|
|
|
}
|
2003-04-06 23:44:09 +02:00
|
|
|
|
|
2004-07-25 22:43:23 +02:00
|
|
|
|
element = XOBNEW (&bitmap_obstack, bitmap_element);
|
1997-09-04 17:12:20 +02:00
|
|
|
|
}
|
2002-06-04 09:11:05 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (bitmap_ggc_free != NULL)
|
|
|
|
|
{
|
|
|
|
|
element = bitmap_ggc_free;
|
|
|
|
|
bitmap_ggc_free = element->next;
|
|
|
|
|
}
|
|
|
|
|
else
|
2004-07-25 22:43:23 +02:00
|
|
|
|
element = GGC_NEW (bitmap_element);
|
1997-09-04 17:12:20 +02:00
|
|
|
|
}
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2001-07-11 19:34:48 +02:00
|
|
|
|
memset (element->bits, 0, sizeof (element->bits));
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
return element;
|
|
|
|
|
}
|
|
|
|
|
|
2001-07-06 23:24:04 +02:00
|
|
|
|
/* Release any memory allocated by bitmaps. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_release_memory (void)
|
2001-07-06 23:24:04 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_free = 0;
|
|
|
|
|
if (bitmap_obstack_init)
|
|
|
|
|
{
|
|
|
|
|
bitmap_obstack_init = FALSE;
|
|
|
|
|
obstack_free (&bitmap_obstack, NULL);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1997-07-14 12:49:07 +02:00
|
|
|
|
/* Return nonzero if all bits in an element are zero. */
|
|
|
|
|
|
|
|
|
|
static INLINE int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_element_zerop (bitmap_element *element)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
#if BITMAP_ELEMENT_WORDS == 2
|
|
|
|
|
return (element->bits[0] | element->bits[1]) == 0;
|
|
|
|
|
#else
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
|
|
|
|
if (element->bits[i] != 0)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Link the bitmap element into the current bitmap linked list. */
|
|
|
|
|
|
|
|
|
|
static INLINE void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_element_link (bitmap head, bitmap_element *element)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned int indx = element->indx;
|
|
|
|
|
bitmap_element *ptr;
|
|
|
|
|
|
|
|
|
|
/* If this is the first and only element, set it in. */
|
|
|
|
|
if (head->first == 0)
|
|
|
|
|
{
|
|
|
|
|
element->next = element->prev = 0;
|
|
|
|
|
head->first = element;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If this index is less than that of the current element, it goes someplace
|
|
|
|
|
before the current element. */
|
|
|
|
|
else if (indx < head->indx)
|
|
|
|
|
{
|
|
|
|
|
for (ptr = head->current;
|
|
|
|
|
ptr->prev != 0 && ptr->prev->indx > indx;
|
|
|
|
|
ptr = ptr->prev)
|
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
if (ptr->prev)
|
|
|
|
|
ptr->prev->next = element;
|
|
|
|
|
else
|
|
|
|
|
head->first = element;
|
|
|
|
|
|
|
|
|
|
element->prev = ptr->prev;
|
|
|
|
|
element->next = ptr;
|
|
|
|
|
ptr->prev = element;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Otherwise, it must go someplace after the current element. */
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (ptr = head->current;
|
|
|
|
|
ptr->next != 0 && ptr->next->indx < indx;
|
|
|
|
|
ptr = ptr->next)
|
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
if (ptr->next)
|
|
|
|
|
ptr->next->prev = element;
|
|
|
|
|
|
|
|
|
|
element->next = ptr->next;
|
|
|
|
|
element->prev = ptr;
|
|
|
|
|
ptr->next = element;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set up so this is the first element searched. */
|
|
|
|
|
head->current = element;
|
|
|
|
|
head->indx = indx;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Clear a bitmap by freeing the linked list. */
|
|
|
|
|
|
1997-12-20 12:31:54 +01:00
|
|
|
|
INLINE void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_clear (bitmap head)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *element, *next;
|
|
|
|
|
|
|
|
|
|
for (element = head->first; element != 0; element = next)
|
|
|
|
|
{
|
|
|
|
|
next = element->next;
|
2002-06-04 09:11:05 +02:00
|
|
|
|
bitmap_elem_to_freelist (head, element);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2002-05-26 17:01:11 +02:00
|
|
|
|
head->first = head->current = 0;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2001-07-11 19:34:48 +02:00
|
|
|
|
/* Copy a bitmap to another bitmap. */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_copy (bitmap to, bitmap from)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *from_ptr, *to_ptr = 0;
|
1998-02-14 02:13:58 +01:00
|
|
|
|
#if BITMAP_ELEMENT_WORDS != 2
|
1997-07-14 12:49:07 +02:00
|
|
|
|
int i;
|
1998-02-14 02:13:58 +01:00
|
|
|
|
#endif
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
bitmap_clear (to);
|
|
|
|
|
|
2003-06-29 15:53:12 +02:00
|
|
|
|
/* Copy elements in forward direction one at a time. */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
|
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
bitmap_element *to_elt = bitmap_element_allocate (to);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
to_elt->indx = from_ptr->indx;
|
|
|
|
|
|
|
|
|
|
#if BITMAP_ELEMENT_WORDS == 2
|
|
|
|
|
to_elt->bits[0] = from_ptr->bits[0];
|
|
|
|
|
to_elt->bits[1] = from_ptr->bits[1];
|
|
|
|
|
#else
|
|
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
|
|
|
|
to_elt->bits[i] = from_ptr->bits[i];
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Here we have a special case of bitmap_element_link, for the case
|
|
|
|
|
where we know the links are being entered in sequence. */
|
|
|
|
|
if (to_ptr == 0)
|
|
|
|
|
{
|
|
|
|
|
to->first = to->current = to_elt;
|
|
|
|
|
to->indx = from_ptr->indx;
|
|
|
|
|
to_elt->next = to_elt->prev = 0;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
to_elt->prev = to_ptr;
|
|
|
|
|
to_elt->next = 0;
|
|
|
|
|
to_ptr->next = to_elt;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
to_ptr = to_elt;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find a bitmap element that would hold a bitmap's bit.
|
|
|
|
|
Update the `current' field even if we can't find an element that
|
|
|
|
|
would hold the bitmap's bit to make eventual allocation
|
|
|
|
|
faster. */
|
|
|
|
|
|
|
|
|
|
static INLINE bitmap_element *
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_find_bit (bitmap head, unsigned int bit)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *element;
|
2003-01-25 19:21:22 +01:00
|
|
|
|
unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2002-05-21 16:46:01 +02:00
|
|
|
|
if (head->current == 0
|
|
|
|
|
|| head->indx == indx)
|
|
|
|
|
return head->current;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
if (head->indx > indx)
|
|
|
|
|
for (element = head->current;
|
|
|
|
|
element->prev != 0 && element->indx > indx;
|
|
|
|
|
element = element->prev)
|
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
else
|
|
|
|
|
for (element = head->current;
|
|
|
|
|
element->next != 0 && element->indx < indx;
|
|
|
|
|
element = element->next)
|
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
/* `element' is the nearest to the one we want. If it's not the one we
|
|
|
|
|
want, the one we want doesn't exist. */
|
|
|
|
|
head->current = element;
|
|
|
|
|
head->indx = element->indx;
|
|
|
|
|
if (element != 0 && element->indx != indx)
|
|
|
|
|
element = 0;
|
|
|
|
|
|
|
|
|
|
return element;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Clear a single bit in a bitmap. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_clear_bit (bitmap head, int bit)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr = bitmap_find_bit (head, bit);
|
|
|
|
|
|
|
|
|
|
if (ptr != 0)
|
|
|
|
|
{
|
2003-01-25 19:21:22 +01:00
|
|
|
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
|
|
|
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
|
|
|
|
ptr->bits[word_num] &= ~ (((BITMAP_WORD) 1) << bit_num);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2003-12-21 15:08:35 +01:00
|
|
|
|
/* If we cleared the entire word, free up the element. */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
if (bitmap_element_zerop (ptr))
|
|
|
|
|
bitmap_element_free (head, ptr);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set a single bit in a bitmap. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_set_bit (bitmap head, int bit)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr = bitmap_find_bit (head, bit);
|
2003-01-25 19:21:22 +01:00
|
|
|
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
|
|
|
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
|
|
|
|
BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
if (ptr == 0)
|
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
ptr = bitmap_element_allocate (head);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
|
|
|
|
ptr->bits[word_num] = bit_val;
|
|
|
|
|
bitmap_element_link (head, ptr);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
ptr->bits[word_num] |= bit_val;
|
|
|
|
|
}
|
2001-07-11 19:34:48 +02:00
|
|
|
|
|
1997-07-14 12:49:07 +02:00
|
|
|
|
/* Return whether a bit is set within a bitmap. */
|
|
|
|
|
|
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_bit_p (bitmap head, int bit)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr;
|
|
|
|
|
unsigned bit_num;
|
|
|
|
|
unsigned word_num;
|
|
|
|
|
|
|
|
|
|
ptr = bitmap_find_bit (head, bit);
|
|
|
|
|
if (ptr == 0)
|
|
|
|
|
return 0;
|
|
|
|
|
|
2003-01-25 19:21:22 +01:00
|
|
|
|
bit_num = bit % BITMAP_WORD_BITS;
|
|
|
|
|
word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
return (ptr->bits[word_num] >> bit_num) & 1;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2001-07-11 19:34:48 +02:00
|
|
|
|
/* Return the bit number of the first set bit in the bitmap, or -1
|
|
|
|
|
if the bitmap is empty. */
|
2001-07-06 23:24:04 +02:00
|
|
|
|
|
2002-05-26 17:01:11 +02:00
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_first_set_bit (bitmap a)
|
2001-07-06 23:24:04 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr = a->first;
|
2003-01-25 19:21:22 +01:00
|
|
|
|
BITMAP_WORD word;
|
2001-07-06 23:24:04 +02:00
|
|
|
|
unsigned word_num, bit_num;
|
|
|
|
|
|
|
|
|
|
if (ptr == NULL)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
#if BITMAP_ELEMENT_WORDS == 2
|
|
|
|
|
word_num = 0, word = ptr->bits[0];
|
|
|
|
|
if (word == 0)
|
|
|
|
|
word_num = 1, word = ptr->bits[1];
|
|
|
|
|
#else
|
|
|
|
|
for (word_num = 0; word_num < BITMAP_ELEMENT_WORDS; ++word_num)
|
|
|
|
|
if ((word = ptr->bits[word_num]) != 0)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
goto word_found;
|
alias.c (mems_in_disjoint_alias_sets_p, [...]): Use gcc_assert and gcc_unreachable instead of abort.
* alias.c (mems_in_disjoint_alias_sets_p, record_alias_subset,
record_set, rtx_equal_for_memref_p, init_alias_analysis): Use
gcc_assert and gcc_unreachable instead of abort.
* alloc-pool.c (abort, fancy_abort): Remove.
(create_alloc_pool, free_alloc_pool, pool_alloc, pool_free): Use
gcc_assert or gcc_unreachable.
* attribs.c (init_attributes, decl_attributes): Likewise.
* bb-reorder.c (FREE, find_traces_1_round, copy_bb,
mark_bb_for_unlikely_executed_section,
add_labels_and_missing_jumps, fix_crossing_conditional_branches,
fix_crossing_unconditional_branches): Likewise.
* bitmap.c (bitmap_first_set_bit, bitmap_last_set_bit,
bitmap_operation): Likewise.
* bt-load.c (insn_sets_btr_p, augment_live_range,
move_btr_def): Likewise.
* builtins.c (c_readstr, expand_builtin_longjmp, apply_args_size,
apply_result_size, expand_builtin_apply, expand_builtin_mathfn,
expand_builtin_mathfn_2, expand_builtin_mathfn_3,
builtin_memcpy_read_str, expand_movstr, expand_builtin_stpcpy,
expand_builtin_memcmp, expand_builtin_args_info,
std_gimplify_va_arg_expr, expand_builtin_unop,
expand_builtin_fputs, expand_builtin_profile_func,
expand_builtin_fork_or_exec, fold_builtin_bitop,
fold_builtin_classify, fold_builtin_fputs): Likewise.
From-SVN: r86797
2004-08-30 21:13:03 +02:00
|
|
|
|
gcc_unreachable ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
word_found:
|
2001-07-06 23:24:04 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Binary search for the first set bit. */
|
|
|
|
|
/* ??? It'd be nice to know if ffs or ffsl was available. */
|
|
|
|
|
|
|
|
|
|
bit_num = 0;
|
|
|
|
|
word = word & -word;
|
|
|
|
|
|
2003-01-25 19:21:22 +01:00
|
|
|
|
#if nBITMAP_WORD_BITS > 64
|
2001-07-06 23:24:04 +02:00
|
|
|
|
#error "Fill out the table."
|
|
|
|
|
#endif
|
2003-01-25 19:21:22 +01:00
|
|
|
|
#if nBITMAP_WORD_BITS > 32
|
2001-07-06 23:24:04 +02:00
|
|
|
|
if ((word & 0xffffffff) == 0)
|
|
|
|
|
word >>= 32, bit_num += 32;
|
|
|
|
|
#endif
|
|
|
|
|
if ((word & 0xffff) == 0)
|
|
|
|
|
word >>= 16, bit_num += 16;
|
|
|
|
|
if ((word & 0xff) == 0)
|
|
|
|
|
word >>= 8, bit_num += 8;
|
|
|
|
|
if (word & 0xf0)
|
|
|
|
|
bit_num += 4;
|
|
|
|
|
if (word & 0xcc)
|
|
|
|
|
bit_num += 2;
|
|
|
|
|
if (word & 0xaa)
|
|
|
|
|
bit_num += 1;
|
|
|
|
|
|
|
|
|
|
return (ptr->indx * BITMAP_ELEMENT_ALL_BITS
|
2003-01-25 19:21:22 +01:00
|
|
|
|
+ word_num * BITMAP_WORD_BITS
|
2001-07-06 23:24:04 +02:00
|
|
|
|
+ bit_num);
|
|
|
|
|
}
|
|
|
|
|
|
2001-07-11 19:34:48 +02:00
|
|
|
|
/* Return the bit number of the last set bit in the bitmap, or -1
|
|
|
|
|
if the bitmap is empty. */
|
|
|
|
|
|
2002-05-26 17:01:11 +02:00
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_last_set_bit (bitmap a)
|
2001-07-06 23:24:04 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr = a->first;
|
2003-01-25 19:21:22 +01:00
|
|
|
|
BITMAP_WORD word;
|
2001-07-06 23:24:04 +02:00
|
|
|
|
unsigned word_num, bit_num;
|
|
|
|
|
|
|
|
|
|
if (ptr == NULL)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
while (ptr->next != NULL)
|
|
|
|
|
ptr = ptr->next;
|
|
|
|
|
|
|
|
|
|
#if BITMAP_ELEMENT_WORDS == 2
|
|
|
|
|
word_num = 1, word = ptr->bits[1];
|
|
|
|
|
if (word == 0)
|
|
|
|
|
word_num = 0, word = ptr->bits[0];
|
|
|
|
|
#else
|
|
|
|
|
for (word_num = BITMAP_ELEMENT_WORDS; word_num-- > 0; )
|
|
|
|
|
if ((word = ptr->bits[word_num]) != 0)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
goto word_found;
|
alias.c (mems_in_disjoint_alias_sets_p, [...]): Use gcc_assert and gcc_unreachable instead of abort.
* alias.c (mems_in_disjoint_alias_sets_p, record_alias_subset,
record_set, rtx_equal_for_memref_p, init_alias_analysis): Use
gcc_assert and gcc_unreachable instead of abort.
* alloc-pool.c (abort, fancy_abort): Remove.
(create_alloc_pool, free_alloc_pool, pool_alloc, pool_free): Use
gcc_assert or gcc_unreachable.
* attribs.c (init_attributes, decl_attributes): Likewise.
* bb-reorder.c (FREE, find_traces_1_round, copy_bb,
mark_bb_for_unlikely_executed_section,
add_labels_and_missing_jumps, fix_crossing_conditional_branches,
fix_crossing_unconditional_branches): Likewise.
* bitmap.c (bitmap_first_set_bit, bitmap_last_set_bit,
bitmap_operation): Likewise.
* bt-load.c (insn_sets_btr_p, augment_live_range,
move_btr_def): Likewise.
* builtins.c (c_readstr, expand_builtin_longjmp, apply_args_size,
apply_result_size, expand_builtin_apply, expand_builtin_mathfn,
expand_builtin_mathfn_2, expand_builtin_mathfn_3,
builtin_memcpy_read_str, expand_movstr, expand_builtin_stpcpy,
expand_builtin_memcmp, expand_builtin_args_info,
std_gimplify_va_arg_expr, expand_builtin_unop,
expand_builtin_fputs, expand_builtin_profile_func,
expand_builtin_fork_or_exec, fold_builtin_bitop,
fold_builtin_classify, fold_builtin_fputs): Likewise.
From-SVN: r86797
2004-08-30 21:13:03 +02:00
|
|
|
|
gcc_unreachable ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
word_found:
|
2001-07-06 23:24:04 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Binary search for the last set bit. */
|
|
|
|
|
|
|
|
|
|
bit_num = 0;
|
2003-01-25 19:21:22 +01:00
|
|
|
|
#if nBITMAP_WORD_BITS > 64
|
2001-07-06 23:24:04 +02:00
|
|
|
|
#error "Fill out the table."
|
|
|
|
|
#endif
|
2003-01-25 19:21:22 +01:00
|
|
|
|
#if nBITMAP_WORD_BITS > 32
|
|
|
|
|
if (word & ~(BITMAP_WORD)0xffffffff)
|
2001-07-06 23:24:04 +02:00
|
|
|
|
word >>= 32, bit_num += 32;
|
|
|
|
|
#endif
|
|
|
|
|
if (word & 0xffff0000)
|
|
|
|
|
word >>= 16, bit_num += 16;
|
|
|
|
|
if (word & 0xff00)
|
|
|
|
|
word >>= 8, bit_num += 8;
|
|
|
|
|
if (word & 0xf0)
|
|
|
|
|
word >>= 4, bit_num += 4;
|
|
|
|
|
if (word & 0xc)
|
|
|
|
|
word >>= 2, bit_num += 2;
|
|
|
|
|
if (word & 0x2)
|
2001-07-11 19:34:48 +02:00
|
|
|
|
bit_num += 1;
|
2001-07-06 23:24:04 +02:00
|
|
|
|
|
|
|
|
|
return (ptr->indx * BITMAP_ELEMENT_ALL_BITS
|
2003-01-25 19:21:22 +01:00
|
|
|
|
+ word_num * BITMAP_WORD_BITS
|
2001-07-06 23:24:04 +02:00
|
|
|
|
+ bit_num);
|
|
|
|
|
}
|
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
/* Store in bitmap TO the result of combining bitmap FROM1 and FROM2 using
|
|
|
|
|
a specific bit manipulation. Return true if TO changes. */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_operation (bitmap to, bitmap from1, bitmap from2,
|
|
|
|
|
enum bitmap_bits operation)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
2000-02-19 02:27:00 +01:00
|
|
|
|
#define HIGHEST_INDEX (unsigned int) ~0
|
|
|
|
|
|
1997-07-14 12:49:07 +02:00
|
|
|
|
bitmap_element *from1_ptr = from1->first;
|
|
|
|
|
bitmap_element *from2_ptr = from2->first;
|
2000-02-19 02:27:00 +01:00
|
|
|
|
unsigned int indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
|
|
|
|
|
unsigned int indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
|
1999-10-04 20:52:39 +02:00
|
|
|
|
bitmap_element *to_ptr = to->first;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
bitmap_element *from1_tmp;
|
|
|
|
|
bitmap_element *from2_tmp;
|
1999-10-04 20:52:39 +02:00
|
|
|
|
bitmap_element *to_tmp;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
unsigned int indx;
|
1999-10-04 20:52:39 +02:00
|
|
|
|
int changed = 0;
|
|
|
|
|
|
|
|
|
|
#if BITMAP_ELEMENT_WORDS == 2
|
|
|
|
|
#define DOIT(OP) \
|
|
|
|
|
do { \
|
2003-01-25 19:21:22 +01:00
|
|
|
|
BITMAP_WORD t0, t1, f10, f11, f20, f21; \
|
1999-10-04 20:52:39 +02:00
|
|
|
|
f10 = from1_tmp->bits[0]; \
|
|
|
|
|
f20 = from2_tmp->bits[0]; \
|
|
|
|
|
t0 = f10 OP f20; \
|
|
|
|
|
changed |= (t0 != to_tmp->bits[0]); \
|
|
|
|
|
f11 = from1_tmp->bits[1]; \
|
|
|
|
|
f21 = from2_tmp->bits[1]; \
|
|
|
|
|
t1 = f11 OP f21; \
|
|
|
|
|
changed |= (t1 != to_tmp->bits[1]); \
|
|
|
|
|
to_tmp->bits[0] = t0; \
|
|
|
|
|
to_tmp->bits[1] = t1; \
|
|
|
|
|
} while (0)
|
|
|
|
|
#else
|
|
|
|
|
#define DOIT(OP) \
|
|
|
|
|
do { \
|
2003-01-25 19:21:22 +01:00
|
|
|
|
BITMAP_WORD t, f1, f2; \
|
1999-10-04 20:52:39 +02:00
|
|
|
|
int i; \
|
|
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; ++i) \
|
|
|
|
|
{ \
|
|
|
|
|
f1 = from1_tmp->bits[i]; \
|
|
|
|
|
f2 = from2_tmp->bits[i]; \
|
|
|
|
|
t = f1 OP f2; \
|
|
|
|
|
changed |= (t != to_tmp->bits[i]); \
|
|
|
|
|
to_tmp->bits[i] = t; \
|
|
|
|
|
} \
|
|
|
|
|
} while (0)
|
1998-02-14 02:13:58 +01:00
|
|
|
|
#endif
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
to->first = to->current = 0;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
while (from1_ptr != 0 || from2_ptr != 0)
|
|
|
|
|
{
|
|
|
|
|
/* Figure out whether we need to substitute zero elements for
|
|
|
|
|
missing links. */
|
|
|
|
|
if (indx1 == indx2)
|
|
|
|
|
{
|
|
|
|
|
indx = indx1;
|
|
|
|
|
from1_tmp = from1_ptr;
|
|
|
|
|
from2_tmp = from2_ptr;
|
|
|
|
|
from1_ptr = from1_ptr->next;
|
2000-02-19 02:27:00 +01:00
|
|
|
|
indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
from2_ptr = from2_ptr->next;
|
2000-02-19 02:27:00 +01:00
|
|
|
|
indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
else if (indx1 < indx2)
|
|
|
|
|
{
|
|
|
|
|
indx = indx1;
|
|
|
|
|
from1_tmp = from1_ptr;
|
2001-07-10 12:38:10 +02:00
|
|
|
|
from2_tmp = &bitmap_zero_bits;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
from1_ptr = from1_ptr->next;
|
2000-02-19 02:27:00 +01:00
|
|
|
|
indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
indx = indx2;
|
2001-07-10 12:38:10 +02:00
|
|
|
|
from1_tmp = &bitmap_zero_bits;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
from2_tmp = from2_ptr;
|
|
|
|
|
from2_ptr = from2_ptr->next;
|
2000-02-19 02:27:00 +01:00
|
|
|
|
indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
/* Find the appropriate element from TO. Begin by discarding
|
2001-08-01 19:57:27 +02:00
|
|
|
|
elements that we've skipped. */
|
1999-10-04 20:52:39 +02:00
|
|
|
|
while (to_ptr && to_ptr->indx < indx)
|
|
|
|
|
{
|
|
|
|
|
changed = 1;
|
|
|
|
|
to_tmp = to_ptr;
|
|
|
|
|
to_ptr = to_ptr->next;
|
2002-06-04 09:11:05 +02:00
|
|
|
|
bitmap_elem_to_freelist (to, to_tmp);
|
1999-10-04 20:52:39 +02:00
|
|
|
|
}
|
|
|
|
|
if (to_ptr && to_ptr->indx == indx)
|
|
|
|
|
{
|
|
|
|
|
to_tmp = to_ptr;
|
|
|
|
|
to_ptr = to_ptr->next;
|
|
|
|
|
}
|
|
|
|
|
else
|
2002-06-04 09:11:05 +02:00
|
|
|
|
to_tmp = bitmap_element_allocate (to);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
/* Do the operation, and if any bits are set, link it into the
|
|
|
|
|
linked list. */
|
|
|
|
|
switch (operation)
|
|
|
|
|
{
|
|
|
|
|
default:
|
alias.c (mems_in_disjoint_alias_sets_p, [...]): Use gcc_assert and gcc_unreachable instead of abort.
* alias.c (mems_in_disjoint_alias_sets_p, record_alias_subset,
record_set, rtx_equal_for_memref_p, init_alias_analysis): Use
gcc_assert and gcc_unreachable instead of abort.
* alloc-pool.c (abort, fancy_abort): Remove.
(create_alloc_pool, free_alloc_pool, pool_alloc, pool_free): Use
gcc_assert or gcc_unreachable.
* attribs.c (init_attributes, decl_attributes): Likewise.
* bb-reorder.c (FREE, find_traces_1_round, copy_bb,
mark_bb_for_unlikely_executed_section,
add_labels_and_missing_jumps, fix_crossing_conditional_branches,
fix_crossing_unconditional_branches): Likewise.
* bitmap.c (bitmap_first_set_bit, bitmap_last_set_bit,
bitmap_operation): Likewise.
* bt-load.c (insn_sets_btr_p, augment_live_range,
move_btr_def): Likewise.
* builtins.c (c_readstr, expand_builtin_longjmp, apply_args_size,
apply_result_size, expand_builtin_apply, expand_builtin_mathfn,
expand_builtin_mathfn_2, expand_builtin_mathfn_3,
builtin_memcpy_read_str, expand_movstr, expand_builtin_stpcpy,
expand_builtin_memcmp, expand_builtin_args_info,
std_gimplify_va_arg_expr, expand_builtin_unop,
expand_builtin_fputs, expand_builtin_profile_func,
expand_builtin_fork_or_exec, fold_builtin_bitop,
fold_builtin_classify, fold_builtin_fputs): Likewise.
From-SVN: r86797
2004-08-30 21:13:03 +02:00
|
|
|
|
gcc_unreachable ();
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
case BITMAP_AND:
|
1999-10-04 20:52:39 +02:00
|
|
|
|
DOIT (&);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BITMAP_AND_COMPL:
|
1999-10-04 20:52:39 +02:00
|
|
|
|
DOIT (&~);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BITMAP_IOR:
|
1999-10-04 20:52:39 +02:00
|
|
|
|
DOIT (|);
|
|
|
|
|
break;
|
2001-06-16 18:13:25 +02:00
|
|
|
|
case BITMAP_IOR_COMPL:
|
|
|
|
|
DOIT (|~);
|
|
|
|
|
break;
|
1999-10-04 20:52:39 +02:00
|
|
|
|
case BITMAP_XOR:
|
|
|
|
|
DOIT (^);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
if (! bitmap_element_zerop (to_tmp))
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
1999-10-04 20:52:39 +02:00
|
|
|
|
to_tmp->indx = indx;
|
|
|
|
|
bitmap_element_link (to, to_tmp);
|
2000-02-17 21:24:11 +01:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
bitmap_elem_to_freelist (to, to_tmp);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
/* If we have elements of TO left over, free the lot. */
|
|
|
|
|
if (to_ptr)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
1999-10-04 20:52:39 +02:00
|
|
|
|
changed = 1;
|
|
|
|
|
for (to_tmp = to_ptr; to_tmp->next ; to_tmp = to_tmp->next)
|
|
|
|
|
continue;
|
2002-06-04 09:11:05 +02:00
|
|
|
|
if (to->using_obstack)
|
|
|
|
|
{
|
|
|
|
|
to_tmp->next = bitmap_free;
|
|
|
|
|
bitmap_free = to_ptr;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
to_tmp->next = bitmap_ggc_free;
|
|
|
|
|
bitmap_ggc_free = to_ptr;
|
|
|
|
|
}
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
1999-10-04 20:52:39 +02:00
|
|
|
|
#undef DOIT
|
|
|
|
|
|
|
|
|
|
return changed;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return true if two bitmaps are identical. */
|
|
|
|
|
|
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_equal_p (bitmap a, bitmap b)
|
1999-10-04 20:52:39 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_head c;
|
|
|
|
|
int ret;
|
|
|
|
|
|
2003-06-15 15:43:32 +02:00
|
|
|
|
memset (&c, 0, sizeof (c));
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
ret = ! bitmap_xor (&c, a, b);
|
1999-10-04 20:52:39 +02:00
|
|
|
|
bitmap_clear (&c);
|
|
|
|
|
|
|
|
|
|
return ret;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Or into bitmap TO bitmap FROM1 and'ed with the complement of
|
2001-08-01 19:57:27 +02:00
|
|
|
|
bitmap FROM2. */
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
int
|
|
|
|
|
bitmap_ior_and_compl_into (bitmap to, bitmap from1, bitmap from2)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_head tmp;
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
int changed;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
tmp.first = tmp.current = 0;
|
2002-12-03 22:00:16 +01:00
|
|
|
|
tmp.using_obstack = 0;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
bitmap_and_compl (&tmp, from1, from2);
|
|
|
|
|
changed = bitmap_ior_into (to, &tmp);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
bitmap_clear (&tmp);
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
return changed;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
2001-07-06 23:24:04 +02:00
|
|
|
|
|
|
|
|
|
int
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_union_of_diff (bitmap dst, bitmap a, bitmap b, bitmap c)
|
2001-07-06 23:24:04 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_head tmp;
|
|
|
|
|
int changed;
|
|
|
|
|
|
|
|
|
|
tmp.first = tmp.current = 0;
|
2002-12-03 22:00:16 +01:00
|
|
|
|
tmp.using_obstack = 0;
|
2001-07-06 23:24:04 +02:00
|
|
|
|
|
bitmap.h (bitmap_empty_p): New.
* bitmap.h (bitmap_empty_p): New.
(bitmap_and, bitmap_and_into, bitmap_and_compl,
bitmap_and_compl_into, bitmap_ior, bitmap_ior_into,
bitmap_ior_compl, bitmap_xor, bitmap_xor_into): New bitmap
operation macros.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here.
* bitmap.c (bitmap_equal_p): Use bitmap_xor.
(bitmap_ior_and_compl): Rename to ...
(bitmap_ior_and_compl_into): ... here. Adjust. Return changed
flag.
(bitmap_union_of_diff): Use renamed bitmap functions.
* basic-block.h (AND_REG_SET, AND_COMPL_REG_SET, IOR_REG_SET,
XOR_REG_SET, IOR_AND_COMPL_REG_SET): Likewise.
* cfgrtl.c (safe_insert_insn_on_edge): Likewise.
* df.c (df_bb_rd_local_compute)
* flow.c (calculate_global_regs_live,
init_propagate_block_info): Likewise.
* ifcvt.c (find_if_case_1, find_if_case_2,
dead_or_predicable): Likewise.
* ra-build.c (union_web_part_roots, livethrough_conflicts_bb,
reset_conflicts, conflicts_between_webs): Likewise.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
* tree-int-ssa.c (insert_phi_nodes_for, rewrite_into_ssa): Likewise.
* tree-sra.c (decide_instantiations): Likewise.
* tree-ssa-alias.c (create_name_tags,
merge_pointed_to_info): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
* tree-ssa-loop-im.c (move_computations): Likewise.
* tree-ssa-operands.c (get_call_expr_operands): Likewise.
* tree-ssa-pre.c (fini_pre): Likewise.
* tree-ssa.c (verify_flow_sensitive_alias_info): Likewise.
* tree-ssanames.c (any_marked_for_rewrite_p): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
From-SVN: r89827
2004-10-29 10:41:10 +02:00
|
|
|
|
bitmap_and_compl (&tmp, b, c);
|
|
|
|
|
changed = bitmap_ior (dst, &tmp, a);
|
2001-07-06 23:24:04 +02:00
|
|
|
|
bitmap_clear (&tmp);
|
|
|
|
|
|
|
|
|
|
return changed;
|
|
|
|
|
}
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
/* Initialize a bitmap header. */
|
|
|
|
|
|
|
|
|
|
bitmap
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_initialize (bitmap head, int using_obstack)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
2002-06-04 09:11:05 +02:00
|
|
|
|
if (head == NULL && ! using_obstack)
|
2004-07-25 22:43:23 +02:00
|
|
|
|
head = GGC_NEW (struct bitmap_head_def);
|
2003-06-15 15:43:32 +02:00
|
|
|
|
|
1997-07-14 12:49:07 +02:00
|
|
|
|
head->first = head->current = 0;
|
2002-06-04 09:11:05 +02:00
|
|
|
|
head->using_obstack = using_obstack;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
return head;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Debugging function to print out the contents of a bitmap. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
debug_bitmap_file (FILE *file, bitmap head)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
bitmap_element *ptr;
|
|
|
|
|
|
2003-07-08 02:35:52 +02:00
|
|
|
|
fprintf (file, "\nfirst = " HOST_PTR_PRINTF
|
|
|
|
|
" current = " HOST_PTR_PRINTF " indx = %u\n",
|
|
|
|
|
(void *) head->first, (void *) head->current, head->indx);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
for (ptr = head->first; ptr; ptr = ptr->next)
|
|
|
|
|
{
|
2003-01-25 19:21:22 +01:00
|
|
|
|
unsigned int i, j, col = 26;
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
2003-07-08 02:35:52 +02:00
|
|
|
|
fprintf (file, "\t" HOST_PTR_PRINTF " next = " HOST_PTR_PRINTF
|
|
|
|
|
" prev = " HOST_PTR_PRINTF " indx = %u\n\t\tbits = {",
|
|
|
|
|
(void*) ptr, (void*) ptr->next, (void*) ptr->prev, ptr->indx);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
2003-01-25 19:21:22 +01:00
|
|
|
|
for (j = 0; j < BITMAP_WORD_BITS; j++)
|
1999-10-04 20:52:39 +02:00
|
|
|
|
if ((ptr->bits[i] >> j) & 1)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
|
|
|
|
if (col > 70)
|
|
|
|
|
{
|
|
|
|
|
fprintf (file, "\n\t\t\t");
|
|
|
|
|
col = 24;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
|
2003-01-25 19:21:22 +01:00
|
|
|
|
+ i * BITMAP_WORD_BITS + j));
|
1997-07-14 12:49:07 +02:00
|
|
|
|
col += 4;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf (file, " }\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
2001-07-11 19:34:48 +02:00
|
|
|
|
|
1997-07-14 12:49:07 +02:00
|
|
|
|
/* Function to be called from the debugger to print the contents
|
|
|
|
|
of a bitmap. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
debug_bitmap (bitmap head)
|
1997-07-14 12:49:07 +02:00
|
|
|
|
{
|
1999-09-20 13:52:22 +02:00
|
|
|
|
debug_bitmap_file (stdout, head);
|
1997-07-14 12:49:07 +02:00
|
|
|
|
}
|
2001-07-11 19:34:48 +02:00
|
|
|
|
|
1999-09-20 13:52:22 +02:00
|
|
|
|
/* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
|
1997-09-04 17:12:20 +02:00
|
|
|
|
it does not print anything but the bits. */
|
|
|
|
|
|
|
|
|
|
void
|
2003-06-15 15:43:32 +02:00
|
|
|
|
bitmap_print (FILE *file, bitmap head, const char *prefix, const char *suffix)
|
1997-09-04 17:12:20 +02:00
|
|
|
|
{
|
bitmap.c (bitmap_print): Qualify a char* with the `const' keyword.
* bitmap.c (bitmap_print): Qualify a char* with the `const' keyword.
* bitmap.h (bitmap_print): Likewise.
* c-decl.c (builtin_function, grokdeclarator, grokfield): Likewise.
* c-lang.c (build_objc_string): Likewise.
* c-lex.c (yyerror, extend_token_buffer): Likewise. Don't include
limits.h or ctype.h. Remove unused variable `p'.
* c-lex.h (yyerror): Qualify a char* with the `const' keyword.
* c-pragma.c (handle_pragma_token): Likewise.
* c-pragma.h (handle_pragma_token): Likewise.
* c-tree.h (build_objc_string, builtin_function, grokfield,
build_indirect_ref, lvalue_or_else, readonly_warning, error_init,
pedwarn_init): Likewise.
* c-typeck.c (convert_for_assignment, warn_for_assignment,
push_string, warning_init, incomplete_type_error,
build_indirect_ref, lvalue_or_else, readonly_warning,
build_c_cast, spelling, push_member_name, print_spelling,
error_init, pedwarn_init, start_init): Likewise.
* objc/objc-act.c (build_objc_string): Likewise.
* print-tree.c (print_node_brief, print_node): Likewise.
* tree.h (lvalue_or_else, print_node, print_node_brief): Likewise.
From-SVN: r25296
1999-02-18 21:38:48 +01:00
|
|
|
|
const char *comma = "";
|
1997-09-04 17:12:20 +02:00
|
|
|
|
int i;
|
bitmap.h (EXECUTE_IF_SET_IN_BITMAP, [...]): Changed to iterator style.
* bitmap.h (EXECUTE_IF_SET_IN_BITMAP, EXECUTE_IF_AND_COMPL_IN_BITMAP,
EXECUTE_IF_AND_IN_BITMAP): Changed to iterator style.
(bitmap_iterator): New type.
(bmp_iter_common_next_1, bmp_iter_single_next_1, bmp_iter_single_init,
bmp_iter_end_p, bmp_iter_single_next, bmp_iter_and_not_next_1,
bmp_iter_and_not_init, bmp_iter_and_not_next, bmp_iter_and_next_1,
bmp_iter_and_init, bmp_iter_and_next): New functions.
* basic-block.h (EXECUTE_IF_SET_IN_REG_SET,
EXECUTE_IF_AND_COMPL_IN_REG_SET, EXECUTE_IF_AND_IN_REG_SET): Changed to
use iterator-style EXECUTE_IF_IN_BITMAP macros.
* bitmap.c (bitmap_print): Ditto.
* bt-load.c (clear_btr_from_live_range, add_btr_to_live_range,
btr_def_live_range): Ditto.
* cfganal.c (compute_dominance_frontiers_1) Ditto.
* cgraphunit.c (convert_UIDs_in_bitmap, cgraph_characterize_statics):
Ditto.
* ddg.c (build_inter_loop_deps): Ditto.
* df.c (FOR_EACH_BB_IN_BITMAP, df_bb_reg_info_compute, df_refs_update):
Ditto.
* except.c (remove_eh_handler): Ditto.
* flow.c (reg_set_to_hard_reg_set): Ditto.
* gcse.c (clear_modify_mem_tables): Ditto.
* global.c (build_insn_chain): Ditto.
* ifcvt.c (dead_or_predicable): Ditto.
* loop-invariant.c (get_inv_cost, set_move_mark, move_invariant_reg):
Ditto.
* ra-build.c (livethrough_conflicts_bb, conflicts_between_webs): Ditto.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild, delete_useless_defs, actual_spill): Ditto.
* tree-cfg.c (allocate_ssa_names, tree_duplicate_sese_region,
tree_purge_all_dead_eh_edges): Ditto.
* tree-into-ssa.c (compute_global_livein, insert_phi_nodes,
insert_phi_nodes_for, debug_def_blocks_r, invalidate_name_tags,
rewrite_ssa_into_ssa): Ditto.
* tree-outof-ssa.c (find_replaceable_exprs): Ditto.
* tree-sra.c (scan_function, decide_instantiations, scalarize_parms):
Ditto.
* tree-ssa-alias.c (init_alias_info, compute_points_to_and_addr_escape,
compute_flow_sensitive_aliasing, maybe_create_global_var,
dump_points_to_info_for): Ditto.
* tree-ssa-dce.c (EXECUTE_IF_CONTROL_DEPENDENT): Ditto.
* tree-ssa-dse.c (dse_finalize_block): Ditto.
* tree-ssa-live.c (live_worklist, calculate_live_on_entry,
calculate_live_on_exit, build_tree_conflict_graph, dump_live_info):
Ditto.
* tree-ssa-loop-ivopts.c (find_induction_variables,
find_interesting_uses, add_old_ivs_candidates, alloc_use_cost_map,
determine_use_iv_costs, determine_set_costs, find_best_candidate,
set_cost_up_to, create_new_ivs, remove_unused_ivs, free_loop_data):
Ditto.
* tree-ssa-loop-manip.c (add_exit_phis_var, add_exit_phis): Ditto.
* tree-ssa-operands.c (get_asm_expr_operands, add_call_clobber_ops,
add_call_read_ops): Ditto.
* tree-ssa-pre.c (bitmap_print_value_set, insert_aux): Ditto.
From-SVN: r88145
2004-09-26 21:53:13 +02:00
|
|
|
|
bitmap_iterator bi;
|
1997-09-04 17:12:20 +02:00
|
|
|
|
|
|
|
|
|
fputs (prefix, file);
|
bitmap.h (EXECUTE_IF_SET_IN_BITMAP, [...]): Changed to iterator style.
* bitmap.h (EXECUTE_IF_SET_IN_BITMAP, EXECUTE_IF_AND_COMPL_IN_BITMAP,
EXECUTE_IF_AND_IN_BITMAP): Changed to iterator style.
(bitmap_iterator): New type.
(bmp_iter_common_next_1, bmp_iter_single_next_1, bmp_iter_single_init,
bmp_iter_end_p, bmp_iter_single_next, bmp_iter_and_not_next_1,
bmp_iter_and_not_init, bmp_iter_and_not_next, bmp_iter_and_next_1,
bmp_iter_and_init, bmp_iter_and_next): New functions.
* basic-block.h (EXECUTE_IF_SET_IN_REG_SET,
EXECUTE_IF_AND_COMPL_IN_REG_SET, EXECUTE_IF_AND_IN_REG_SET): Changed to
use iterator-style EXECUTE_IF_IN_BITMAP macros.
* bitmap.c (bitmap_print): Ditto.
* bt-load.c (clear_btr_from_live_range, add_btr_to_live_range,
btr_def_live_range): Ditto.
* cfganal.c (compute_dominance_frontiers_1) Ditto.
* cgraphunit.c (convert_UIDs_in_bitmap, cgraph_characterize_statics):
Ditto.
* ddg.c (build_inter_loop_deps): Ditto.
* df.c (FOR_EACH_BB_IN_BITMAP, df_bb_reg_info_compute, df_refs_update):
Ditto.
* except.c (remove_eh_handler): Ditto.
* flow.c (reg_set_to_hard_reg_set): Ditto.
* gcse.c (clear_modify_mem_tables): Ditto.
* global.c (build_insn_chain): Ditto.
* ifcvt.c (dead_or_predicable): Ditto.
* loop-invariant.c (get_inv_cost, set_move_mark, move_invariant_reg):
Ditto.
* ra-build.c (livethrough_conflicts_bb, conflicts_between_webs): Ditto.
* ra-rewrite.c (reloads_to_loads, rewrite_program2,
detect_web_parts_to_rebuild, delete_useless_defs, actual_spill): Ditto.
* tree-cfg.c (allocate_ssa_names, tree_duplicate_sese_region,
tree_purge_all_dead_eh_edges): Ditto.
* tree-into-ssa.c (compute_global_livein, insert_phi_nodes,
insert_phi_nodes_for, debug_def_blocks_r, invalidate_name_tags,
rewrite_ssa_into_ssa): Ditto.
* tree-outof-ssa.c (find_replaceable_exprs): Ditto.
* tree-sra.c (scan_function, decide_instantiations, scalarize_parms):
Ditto.
* tree-ssa-alias.c (init_alias_info, compute_points_to_and_addr_escape,
compute_flow_sensitive_aliasing, maybe_create_global_var,
dump_points_to_info_for): Ditto.
* tree-ssa-dce.c (EXECUTE_IF_CONTROL_DEPENDENT): Ditto.
* tree-ssa-dse.c (dse_finalize_block): Ditto.
* tree-ssa-live.c (live_worklist, calculate_live_on_entry,
calculate_live_on_exit, build_tree_conflict_graph, dump_live_info):
Ditto.
* tree-ssa-loop-ivopts.c (find_induction_variables,
find_interesting_uses, add_old_ivs_candidates, alloc_use_cost_map,
determine_use_iv_costs, determine_set_costs, find_best_candidate,
set_cost_up_to, create_new_ivs, remove_unused_ivs, free_loop_data):
Ditto.
* tree-ssa-loop-manip.c (add_exit_phis_var, add_exit_phis): Ditto.
* tree-ssa-operands.c (get_asm_expr_operands, add_call_clobber_ops,
add_call_read_ops): Ditto.
* tree-ssa-pre.c (bitmap_print_value_set, insert_aux): Ditto.
From-SVN: r88145
2004-09-26 21:53:13 +02:00
|
|
|
|
EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi)
|
|
|
|
|
{
|
|
|
|
|
fprintf (file, "%s%d", comma, i);
|
|
|
|
|
comma = ", ";
|
|
|
|
|
}
|
1997-09-04 17:12:20 +02:00
|
|
|
|
fputs (suffix, file);
|
|
|
|
|
}
|
2002-06-04 09:11:05 +02:00
|
|
|
|
|
|
|
|
|
#include "gt-bitmap.h"
|