mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
See http://www.gnu.org/prep/maintain/maintain.html#Copyright-Notices * HACKING, Makefile.am, NEWS, PACKAGING, README, README-alpha: * TODO, bootstrap, bootstrap.conf: * build-aux/update-b4-copyright, cfg.mk, configure.ac: * data/README, data/bison.m4, data/c++-skel.m4, data/c++.m4: * data/c-skel.m4, data/c.m4, data/glr.c, data/glr.cc: * data/java-skel.m4, data/java.m4, data/lalr1.cc: * data/lalr1.java, data/location.cc: * data/xslt/bison.xsl: * data/xslt/xml2dot.xsl, data/xslt/xml2text.xsl: * data/xslt/xml2xhtml.xsl, data/yacc.c, djgpp/Makefile.maint: * djgpp/README.in, djgpp/config.bat, djgpp/config.sed: * djgpp/config.site, djgpp/config_h.sed, djgpp/djunpack.bat: * djgpp/subpipe.c, djgpp/subpipe.h: * djgpp/testsuite.sed, doc/bison.texinfo: * doc/refcard.tex, etc/README, etc/bench.pl.in: * examples/calc++/Makefile.am, examples/extexi: * lib/abitset.c, lib/abitset.h: * lib/bbitset.h, lib/bitset.c, lib/bitset.h: * lib/bitset_stats.c, lib/bitset_stats.h, lib/bitsetv-print.c: * lib/bitsetv-print.h, lib/bitsetv.c, lib/bitsetv.h: * lib/ebitset.c, lib/ebitset.h, lib/get-errno.c: * lib/get-errno.h, lib/lbitset.c, lib/lbitset.h: * lib/libiberty.h, lib/main.c, lib/timevar.c: * lib/timevar.def, lib/timevar.h, lib/vbitset.c: * lib/vbitset.h, lib/yyerror.c, m4/bison-i18n.m4: * m4/c-working.m4, m4/cxx.m4, m4/subpipe.m4, m4/timevar.m4: * src/AnnotationList.c, src/AnnotationList.h: * src/InadequacyList.c, src/InadequacyList.h, src/LR0.c: * src/LR0.h, src/Sbitset.c, src/Sbitset.h, src/assoc.c: * src/assoc.h, src/closure.c, src/closure.h, src/complain.c: * src/complain.h, src/conflicts.c, src/conflicts.h: * src/derives.c, src/derives.h, src/files.c, src/files.h: * src/flex-scanner.h, src/getargs.c, src/getargs.h: * src/gram.c, src/gram.h, src/graphviz.c, src/ielr.c: * src/ielr.h, src/lalr.c, src/lalr.h: * src/location.c, src/location.h, src/main.c: * src/muscle-tab.c, src/muscle-tab.h, src/named-ref.c: * src/named-ref.h, src/nullable.c, src/nullable.h: * src/output.c, src/output.h, src/parse-gram.y: * src/print-xml.c, src/print-xml.h, src/print.c, src/print.h: * src/print_graph.c, src/print_graph.h, src/reader.c: * src/reader.h, src/reduce.c, src/reduce.h, src/relation.c: * src/relation.h, src/scan-code.h, src/scan-code.l: * src/scan-gram.h, src/scan-gram.l, src/scan-skel.h: * src/scan-skel.l, src/state.c, src/state.h, src/symlist.c: * src/symlist.h, src/symtab.c, src/symtab.h, src/system.h: * src/tables.c, src/tables.h, src/uniqstr.c, src/uniqstr.h: * tests/actions.at, tests/atlocal.in, tests/c++.at: * tests/calc.at, tests/conflicts.at, tests/cxx-type.at: * tests/existing.at, tests/glr-regression.at: * tests/headers.at, tests/input.at, tests/java.at: * tests/local.at, tests/named-refs.at: * tests/output.at, tests/push.at, tests/reduce.at: * tests/regression.at, tests/sets.at, tests/skeletons.at: * tests/synclines.at, tests/testsuite.at, tests/torture.at: * data/Makefile.am, data/location.cc, doc/Makefile.am, src/Makefile.am: * tests/Makefile.am, lib/Makefile.am, examples/Makefile.am: * etc/Makefile.am: Don't use date ranges in copyright notices. Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
170 lines
3.9 KiB
C
170 lines
3.9 KiB
C
/* Bitset vectors.
|
|
|
|
Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009, 2010 Free Software
|
|
Foundation, Inc.
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#include <config.h>
|
|
|
|
#include "bitsetv.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
/* Create a vector of N_VECS bitsets, each of N_BITS, and of
|
|
type TYPE. */
|
|
bitset *
|
|
bitsetv_alloc (bitset_bindex n_vecs, bitset_bindex n_bits,
|
|
enum bitset_type type)
|
|
{
|
|
size_t vector_bytes;
|
|
size_t bytes;
|
|
bitset *bsetv;
|
|
bitset_bindex i;
|
|
|
|
/* Determine number of bytes for each set. */
|
|
bytes = bitset_bytes (type, n_bits);
|
|
|
|
/* If size calculation overflows, memory is exhausted. */
|
|
if (BITSET_SIZE_MAX / (sizeof (bitset) + bytes) <= n_vecs)
|
|
xalloc_die ();
|
|
|
|
/* Allocate vector table at head of bitset array. */
|
|
vector_bytes = (n_vecs + 1) * sizeof (bitset) + bytes - 1;
|
|
vector_bytes -= vector_bytes % bytes;
|
|
bsetv = xcalloc (1, vector_bytes + bytes * n_vecs);
|
|
|
|
for (i = 0; i < n_vecs; i++)
|
|
{
|
|
bsetv[i] = (bitset) (void *) ((char *) bsetv + vector_bytes + i * bytes);
|
|
|
|
bitset_init (bsetv[i], n_bits, type);
|
|
}
|
|
|
|
/* Null terminate table. */
|
|
bsetv[i] = 0;
|
|
return bsetv;
|
|
}
|
|
|
|
|
|
/* Create a vector of N_VECS bitsets, each of N_BITS, and with
|
|
attribute hints specified by ATTR. */
|
|
bitset *
|
|
bitsetv_create (bitset_bindex n_vecs, bitset_bindex n_bits, unsigned int attr)
|
|
{
|
|
enum bitset_type type;
|
|
|
|
type = bitset_type_choose (n_bits, attr);
|
|
return bitsetv_alloc (n_vecs, n_bits, type);
|
|
}
|
|
|
|
|
|
/* Free bitset vector BSETV. */
|
|
void
|
|
bitsetv_free (bitsetv bsetv)
|
|
{
|
|
bitset_bindex i;
|
|
|
|
for (i = 0; bsetv[i]; i++)
|
|
BITSET_FREE_ (bsetv[i]);
|
|
free (bsetv);
|
|
}
|
|
|
|
|
|
/* Zero a vector of bitsets. */
|
|
void
|
|
bitsetv_zero (bitsetv bsetv)
|
|
{
|
|
bitset_bindex i;
|
|
|
|
for (i = 0; bsetv[i]; i++)
|
|
bitset_zero (bsetv[i]);
|
|
}
|
|
|
|
|
|
/* Set a vector of bitsets to ones. */
|
|
void
|
|
bitsetv_ones (bitsetv bsetv)
|
|
{
|
|
bitset_bindex i;
|
|
|
|
for (i = 0; bsetv[i]; i++)
|
|
bitset_ones (bsetv[i]);
|
|
}
|
|
|
|
|
|
/* Given a vector BSETV of N bitsets of size N, modify its contents to
|
|
be the transitive closure of what was given. */
|
|
void
|
|
bitsetv_transitive_closure (bitsetv bsetv)
|
|
{
|
|
bitset_bindex i;
|
|
bitset_bindex j;
|
|
|
|
for (i = 0; bsetv[i]; i++)
|
|
for (j = 0; bsetv[j]; j++)
|
|
if (bitset_test (bsetv[j], i))
|
|
bitset_or (bsetv[j], bsetv[j], bsetv[i]);
|
|
}
|
|
|
|
|
|
/* Given a vector BSETV of N bitsets of size N, modify its contents to
|
|
be the reflexive transitive closure of what was given. This is
|
|
the same as transitive closure but with all bits on the diagonal
|
|
of the bit matrix set. */
|
|
void
|
|
bitsetv_reflexive_transitive_closure (bitsetv bsetv)
|
|
{
|
|
bitset_bindex i;
|
|
|
|
bitsetv_transitive_closure (bsetv);
|
|
for (i = 0; bsetv[i]; i++)
|
|
bitset_set (bsetv[i], i);
|
|
}
|
|
|
|
|
|
/* Dump the contents of a bitset vector BSETV with N_VECS elements to
|
|
FILE. */
|
|
void
|
|
bitsetv_dump (FILE *file, char const *title, char const *subtitle,
|
|
bitsetv bsetv)
|
|
{
|
|
bitset_windex i;
|
|
|
|
fprintf (file, "%s\n", title);
|
|
for (i = 0; bsetv[i]; i++)
|
|
{
|
|
fprintf (file, "%s %lu\n", subtitle, (unsigned long int) i);
|
|
bitset_dump (file, bsetv[i]);
|
|
}
|
|
|
|
fprintf (file, "\n");
|
|
}
|
|
|
|
|
|
void
|
|
debug_bitsetv (bitsetv bsetv)
|
|
{
|
|
bitset_windex i;
|
|
|
|
for (i = 0; bsetv[i]; i++)
|
|
{
|
|
fprintf (stderr, "%lu: ", (unsigned long int) i);
|
|
debug_bitset (bsetv[i]);
|
|
}
|
|
|
|
fprintf (stderr, "\n");
|
|
}
|