summaryrefslogtreecommitdiff
path: root/lib/bitsetv.c
diff options
context:
space:
mode:
authorAkim Demaille <akim.demaille@gmail.com>2018-11-25 18:55:32 +0100
committerAkim Demaille <akim.demaille@gmail.com>2018-11-25 19:43:57 +0100
commitb9ca447bb912cad2fd7aeeda3784aff42f13a336 (patch)
tree9de8cef75a7779b740ec90db13be5b516345597d /lib/bitsetv.c
parent7c0d555aa341d7d5b8ab2fa8a94ee580636cc1c2 (diff)
downloadgnulib-b9ca447bb912cad2fd7aeeda3784aff42f13a336.tar.gz
bitsetv: new module
* lib/bitsetv.c, lib/bitsetv.h, modules/bitsetv: New.
Diffstat (limited to 'lib/bitsetv.c')
-rw-r--r--lib/bitsetv.c196
1 files changed, 196 insertions, 0 deletions
diff --git a/lib/bitsetv.c b/lib/bitsetv.c
new file mode 100644
index 0000000000..2a7ad3a013
--- /dev/null
+++ b/lib/bitsetv.c
@@ -0,0 +1,196 @@
+/* Bitset vectors.
+
+ Copyright (C) 2001-2002, 2004-2006, 2009-2015, 2018 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)
+{
+ /* Determine number of bytes for each set. */
+ size_t 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. */
+ size_t vector_bytes = (n_vecs + 1) * sizeof (bitset) + bytes - 1;
+ vector_bytes -= vector_bytes % bytes;
+ bitset *bsetv = xcalloc (1, vector_bytes + bytes * n_vecs);
+
+ bitset_bindex i = 0;
+ 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 attr)
+{
+ enum bitset_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)
+{
+ for (bitset_bindex i = 0; bsetv[i]; i++)
+ BITSET_FREE_ (bsetv[i]);
+ free (bsetv);
+}
+
+
+/* Zero a vector of bitsets. */
+void
+bitsetv_zero (bitsetv bsetv)
+{
+ for (bitset_bindex i = 0; bsetv[i]; i++)
+ bitset_zero (bsetv[i]);
+}
+
+
+/* Set a vector of bitsets to ones. */
+void
+bitsetv_ones (bitsetv bsetv)
+{
+ for (bitset_bindex 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)
+{
+ for (bitset_bindex i = 0; bsetv[i]; i++)
+ for (bitset_bindex 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)
+{
+ bitsetv_transitive_closure (bsetv);
+ for (bitset_bindex 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)
+{
+ fprintf (file, "%s\n", title);
+ for (bitset_windex i = 0; bsetv[i]; i++)
+ {
+ fprintf (file, "%s %lu\n", subtitle, (unsigned long) i);
+ bitset_dump (file, bsetv[i]);
+ }
+
+ fprintf (file, "\n");
+}
+
+
+void
+debug_bitsetv (bitsetv bsetv)
+{
+ for (bitset_windex i = 0; bsetv[i]; i++)
+ {
+ fprintf (stderr, "%lu: ", (unsigned long) i);
+ debug_bitset (bsetv[i]);
+ }
+
+ fprintf (stderr, "\n");
+}
+
+
+/*--------------------------------------------------------.
+| Display the MATRIX array of SIZE bitsets of size SIZE. |
+`--------------------------------------------------------*/
+
+void
+bitsetv_matrix_dump (FILE *out, const char *title, bitsetv bset)
+{
+ bitset_bindex hsize = bitset_size (bset[0]);
+
+ /* Title. */
+ fprintf (out, "%s BEGIN\n", title);
+
+ /* Column numbers. */
+ fputs (" ", out);
+ for (bitset_bindex i = 0; i < hsize; ++i)
+ putc (i / 10 ? '0' + i / 10 : ' ', out);
+ putc ('\n', out);
+ fputs (" ", out);
+ for (bitset_bindex i = 0; i < hsize; ++i)
+ fprintf (out, "%d", (int) (i % 10));
+ putc ('\n', out);
+
+ /* Bar. */
+ fputs (" .", out);
+ for (bitset_bindex i = 0; i < hsize; ++i)
+ putc ('-', out);
+ fputs (".\n", out);
+
+ /* Contents. */
+ for (bitset_bindex i = 0; bset[i]; ++i)
+ {
+ fprintf (out, "%2lu|", (unsigned long) i);
+ for (bitset_bindex j = 0; j < hsize; ++j)
+ fputs (bitset_test (bset[i], j) ? "1" : " ", out);
+ fputs ("|\n", out);
+ }
+
+ /* Bar. */
+ fputs (" `", out);
+ for (bitset_bindex i = 0; i < hsize; ++i)
+ putc ('-', out);
+ fputs ("'\n", out);
+
+ /* End title. */
+ fprintf (out, "%s END\n\n", title);
+}