2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2014,2018, by the GROMACS development team, led by
5 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
6 * and including many others, as listed in the AUTHORS file in the
7 * top-level source directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
35 /*! \libinternal \file
37 * Declares gmx_bitmask_t and associated functions
39 * \author Roland Schulz <roland@utk.edu>
41 * \ingroup module_utility
44 #ifndef GMX_MDLIB_BITMASK_H
45 #define GMX_MDLIB_BITMASK_H
47 #include "config.h" /* for GMX_MAX_OPENMP_THREADS */
53 #include "gromacs/utility/basedefinitions.h"
55 /*! \brief Size of bitmask. Has to be 32 or multiple of 64. */
57 #define BITMASK_SIZE GMX_OPENMP_MAX_THREADS
60 #if BITMASK_SIZE != 32 && BITMASK_SIZE%64 != 0
61 #error BITMASK_SIZE has to be 32 or a multiple of 64.
64 #if BITMASK_SIZE <= 64 || defined DOXYGEN
65 #if BITMASK_SIZE == 32
66 typedef uint32_t gmx_bitmask_t;
68 typedef uint64_t gmx_bitmask_t; /**< bitmask type */
71 /*! \brief Initialize all bits to 0 */
72 inline static void bitmask_clear(gmx_bitmask_t* m)
77 /*! \brief Set bit at position b to 1. */
78 inline static void bitmask_set_bit(gmx_bitmask_t* m, int b)
80 *m |= gmx_bitmask_t(1) << b;
83 /*! \brief Initialize all bits: bit b to 1, others to 0 */
84 inline static void bitmask_init_bit(gmx_bitmask_t* m, int b)
86 *m = gmx_bitmask_t(1) << b;
89 /*! \brief Initialize all bits: all bits below b to 1, others to 0 */
90 inline static void bitmask_init_low_bits(gmx_bitmask_t* m, int b)
92 *m = (gmx_bitmask_t(1) << b) - 1;
95 /*! \brief Test if bit b is set */
96 inline static bool bitmask_is_set(gmx_bitmask_t m, int b)
98 return (m & (gmx_bitmask_t(1) << b)) != 0;
101 /*! \brief Test if both bitmasks have no common bits enabled */
102 inline static bool bitmask_is_disjoint(gmx_bitmask_t a, gmx_bitmask_t b)
104 return (a & b) == 0u;
107 /*! \brief Test if both bitmasks are equal */
108 inline static bool bitmask_is_equal(gmx_bitmask_t a, gmx_bitmask_t b)
113 /*! \brief Test if bitmask has no enabled bits */
114 inline static bool bitmask_is_zero(gmx_bitmask_t m)
119 /*! \brief Set all bits enabled in either mask and write into a */
120 inline static void bitmask_union(gmx_bitmask_t* a, gmx_bitmask_t b)
125 #define BITMASK_ALEN (BITMASK_SIZE/64)
126 using gmx_bitmask_t = std::array<uint64_t, BITMASK_ALEN>;
128 inline static void bitmask_clear(gmx_bitmask_t* m)
133 inline static void bitmask_set_bit(gmx_bitmask_t* m, int b)
135 (*m)[b/64] |= (static_cast<uint64_t>(1) << (b%64));
138 inline static void bitmask_init_bit(gmx_bitmask_t* m, int b)
141 (*m)[b/64] = (static_cast<uint64_t>(1) << (b%64));
144 inline static void bitmask_init_low_bits(gmx_bitmask_t* m, int b)
146 memset(m->data(), 255, b/64*8);
147 (*m)[b/64] = (static_cast<uint64_t>(1) << (b%64)) - 1;
148 memset(&(m->data())[b/64+1], 0, (BITMASK_ALEN-b/64-1)*8);
151 inline static bool bitmask_is_set(gmx_bitmask_t m, int b)
153 return (m[b/64] & (static_cast<uint64_t>(1) << (b%64))) != 0;
156 inline static bool bitmask_is_disjoint(gmx_bitmask_t a, gmx_bitmask_t b)
160 for (i = 0; i < BITMASK_ALEN; i++)
162 r = r && ((a[i] & b[i]) == 0u);
167 inline static bool bitmask_is_equal(gmx_bitmask_t a, gmx_bitmask_t b)
171 for (i = 0; i < BITMASK_ALEN; i++)
173 r = r && (a[i] == b[i]);
178 inline static bool bitmask_is_zero(gmx_bitmask_t m)
182 for (i = 0; i < BITMASK_ALEN; i++)
184 r = r && (m[i] == 0u);
189 inline static void bitmask_union(gmx_bitmask_t* a, gmx_bitmask_t b)
192 for (i = 0; i < BITMASK_ALEN; i++)