X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flibpspp%2Fbit-vector.h;h=53db166998249fddca017e7ead3ce62015a6f4db;hb=142f8f8814423f76523825f8df060e2fa9d2a2b6;hp=84a0ee266f089331329dcce3e758647a9b03dcc8;hpb=480a0746507ce73d26f528b56dc3ed80195096e0;p=pspp diff --git a/src/libpspp/bit-vector.h b/src/libpspp/bit-vector.h index 84a0ee266f..53db166998 100644 --- a/src/libpspp/bit-vector.h +++ b/src/libpspp/bit-vector.h @@ -1,41 +1,66 @@ -/* PSPP - computes sample statistics. - Copyright (C) 1997-9, 2000 Free Software Foundation, Inc. +/* PSPP - a program for statistical analysis. + Copyright (C) 1997-9, 2000, 2019 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 2 of the - License, or (at your option) any later version. + 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. + 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, write to the Free Software - Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA - 02110-1301, USA. */ + along with this program. If not, see . */ -#if !bitvector_h -#define bitvector_h 1 +#ifndef BITVECTOR_H +#define BITVECTOR_H 1 #include +#include +#include -/* Sets bit Y starting at address X. */ -#define SET_BIT(X, Y) \ - (((unsigned char *) X)[(Y) / CHAR_BIT] |= 1 << ((Y) % CHAR_BIT)) +enum { BITS_PER_ULONG = CHAR_BIT * sizeof (unsigned long int) }; -/* Clears bit Y starting at address X. */ -#define CLEAR_BIT(X, Y) \ - (((unsigned char *) X)[(Y) / CHAR_BIT] &= ~(1 << ((Y) % CHAR_BIT))) +unsigned long int *bitvector_allocate(size_t n); +size_t bitvector_count (const unsigned long int *, size_t); -/* Sets bit Y starting at address X to Z, which is zero/nonzero */ -#define SET_BIT_TO(X, Y, Z) \ - ((Z) ? SET_BIT(X, Y) : CLEAR_BIT(X, Y)) +static unsigned long int +bitvector_mask (size_t idx) +{ + return 1UL << (idx % BITS_PER_ULONG); +} -/* Nonzero if bit Y starting at address X is set. */ -#define TEST_BIT(X, Y) \ - (((unsigned char *) X)[(Y) / CHAR_BIT] & (1 << ((Y) % CHAR_BIT))) +static const unsigned long int * +bitvector_unit (const unsigned long int *vec, size_t idx) +{ + return &vec[idx / BITS_PER_ULONG]; +} + +static unsigned long int * +bitvector_unit_rw (unsigned long int *vec, size_t idx) +{ + return &vec[idx / BITS_PER_ULONG]; +} + +static inline void +bitvector_set1 (unsigned long int *vec, size_t idx) +{ + *bitvector_unit_rw (vec, idx) |= bitvector_mask (idx); +} + +static inline void +bitvector_set0 (unsigned long int *vec, size_t idx) +{ + *bitvector_unit_rw (vec, idx) &= ~bitvector_mask (idx); +} + +static inline bool +bitvector_is_set (const unsigned long int *vec, size_t idx) +{ + return (*bitvector_unit (vec, idx) & bitvector_mask (idx)) != 0; +} /* Returns 2**X, 0 <= X < 32. */ #define BIT_INDEX(X) (1ul << (X))