mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-10 04:43:03 +00:00
fc51acddb4
* AUTHORS, ChangeLog-2012, Makefile.am, NEWS, PACKAGING, README, * README-alpha, README-hacking, THANKS, TODO, bootstrap.conf, * build-aux/darwin11.4.0.valgrind, build-aux/local.mk, * build-aux/update-b4-copyright, * build-aux/update-package-copyright-year, cfg.mk, configure.ac, * data/README, data/bison.m4, data/c++-skel.m4, data/c++.m4, * data/c-like.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/local.mk, data/location.cc, data/stack.hh, data/variant.hh, * 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/local.mk, djgpp/subpipe.c, djgpp/subpipe.h, * djgpp/testsuite.sed, doc/bison.texi, doc/local.mk, doc/refcard.tex, * etc/README, etc/bench.pl.in, etc/local.mk, * examples/calc++/calc++.test, examples/calc++/local.mk, * examples/extexi, examples/local.mk, examples/mfcalc/local.mk, * examples/mfcalc/mfcalc.test, examples/rpcalc/local.mk, * examples/rpcalc/rpcalc.test, examples/test, examples/variant.yy, * 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/local.mk, 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/flex.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/graphviz.h, src/ielr.c, src/ielr.h, src/lalr.c, src/lalr.h, * src/local.mk, 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.c, 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/bison.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/javapush.at, tests/local.at, * tests/local.mk, 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, tests/types.at: here.
93 lines
4.1 KiB
C
93 lines
4.1 KiB
C
/* A simple, memory-efficient bitset implementation.
|
|
|
|
Copyright (C) 2009-2014 Free Software Foundation, Inc.
|
|
|
|
This file is part of Bison, the GNU Compiler Compiler.
|
|
|
|
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/>. */
|
|
|
|
#ifndef SBITSET_H_
|
|
# define SBITSET_H_
|
|
|
|
typedef unsigned char *Sbitset;
|
|
typedef size_t Sbitset__Index;
|
|
# define SBITSET__INDEX__CONVERSION_SPEC "zu"
|
|
|
|
# define Sbitset__nbytes(NBITS) \
|
|
(((NBITS) + CHAR_BIT - 1) / CHAR_BIT)
|
|
# define Sbitset__byteAddress(SELF, INDEX) \
|
|
(((SELF) + (INDEX) / CHAR_BIT))
|
|
# define Sbitset__bit_mask(INDEX) \
|
|
(1 << (CHAR_BIT - 1 - (INDEX) % CHAR_BIT))
|
|
# define Sbitset__last_byte_mask(NBITS) \
|
|
(UCHAR_MAX << (CHAR_BIT - 1 - ((NBITS) - 1) % CHAR_BIT))
|
|
|
|
/* nbits must not be 0. */
|
|
Sbitset Sbitset__new (Sbitset__Index nbits);
|
|
Sbitset Sbitset__new_on_obstack (Sbitset__Index nbits,
|
|
struct obstack *obstackp);
|
|
void Sbitset__delete (Sbitset self);
|
|
|
|
# define Sbitset__test(SELF, INDEX) \
|
|
((*Sbitset__byteAddress ((SELF), (INDEX)) & Sbitset__bit_mask (INDEX)) != 0)
|
|
|
|
bool Sbitset__isEmpty (Sbitset self, Sbitset__Index nbits);
|
|
|
|
void Sbitset__fprint (Sbitset self, Sbitset__Index nbits, FILE *file);
|
|
|
|
# define Sbitset__set(SELF, INDEX) \
|
|
do { \
|
|
*Sbitset__byteAddress ((SELF), (INDEX)) = \
|
|
*Sbitset__byteAddress ((SELF), (INDEX)) | Sbitset__bit_mask (INDEX); \
|
|
} while (0)
|
|
|
|
# define Sbitset__reset(SELF, INDEX) \
|
|
do { \
|
|
*Sbitset__byteAddress ((SELF), (INDEX)) = \
|
|
*Sbitset__byteAddress ((SELF), (INDEX)) & ~Sbitset__bit_mask (INDEX); \
|
|
} while (0)
|
|
|
|
/* NBITS is the size of the bitset. More than NBITS bits might be reset. */
|
|
# define Sbitset__zero(SELF, NBITS) \
|
|
do { \
|
|
memset (SELF, 0, Sbitset__nbytes (NBITS)); \
|
|
} while (0)
|
|
|
|
/* NBITS is the size of the bitset. More than NBITS bits might be set. */
|
|
# define Sbitset__ones(SELF, NBITS) \
|
|
do { \
|
|
memset (SELF, UCHAR_MAX, Sbitset__nbytes (NBITS)); \
|
|
} while (0)
|
|
|
|
/* NBITS is the size of every bitset. More than NBITS bits might be set. */
|
|
# define Sbitset__or(SELF, OTHER1, OTHER2, NBITS) \
|
|
do { \
|
|
Sbitset ptr_self = (SELF); \
|
|
Sbitset ptr_other1 = (OTHER1); \
|
|
Sbitset ptr_other2 = (OTHER2); \
|
|
Sbitset end_self = ptr_self + Sbitset__nbytes (NBITS); \
|
|
for (; ptr_self < end_self; ++ptr_self, ++ptr_other1, ++ptr_other2) \
|
|
*ptr_self = *ptr_other1 | *ptr_other2; \
|
|
} while (0)
|
|
|
|
# define SBITSET__FOR_EACH(SELF, NBITS, ITER, INDEX) \
|
|
for ((ITER) = (SELF); (ITER) < (SELF) + Sbitset__nbytes (NBITS); ++(ITER)) \
|
|
if (*(ITER) != 0) \
|
|
for ((INDEX) = ((ITER)-(SELF))*CHAR_BIT; \
|
|
(INDEX) < (NBITS) && (SELF)+(INDEX)/CHAR_BIT < (ITER)+1; \
|
|
++(INDEX)) \
|
|
if (((*ITER) & Sbitset__bit_mask (INDEX)) != 0)
|
|
|
|
#endif /* !SBITSET_H_ */
|