1 /* $NetBSD: bitset.h,v 1.1.1.1 2008/12/22 00:18:36 haad Exp $ */ 2 3 /* 4 * Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved. 5 * Copyright (C) 2004-2007 Red Hat, Inc. All rights reserved. 6 * 7 * This file is part of the device-mapper userspace tools. 8 * 9 * This copyrighted material is made available to anyone wishing to use, 10 * modify, copy, or redistribute it subject to the terms and conditions 11 * of the GNU Lesser General Public License v.2.1. 12 * 13 * You should have received a copy of the GNU Lesser General Public License 14 * along with this program; if not, write to the Free Software Foundation, 15 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 16 */ 17 18 #ifndef _DM_BITSET_H 19 #define _DM_BITSET_H 20 21 #include "pool.h" 22 23 #include <limits.h> 24 25 typedef uint32_t *bitset_t; 26 27 bitset_t bitset_create(struct pool *mem, unsigned num_bits); 28 void bitset_destroy(bitset_t bs); 29 30 void bit_union(bitset_t out, bitset_t in1, bitset_t in2); 31 int bit_get_first(bitset_t bs); 32 int bit_get_next(bitset_t bs, int last_bit); 33 34 #define BITS_PER_INT (sizeof(int) * CHAR_BIT) 35 36 #define bit(bs, i) \ 37 (bs[(i / BITS_PER_INT) + 1] & (0x1 << (i & (BITS_PER_INT - 1)))) 38 39 #define bit_set(bs, i) \ 40 (bs[(i / BITS_PER_INT) + 1] |= (0x1 << (i & (BITS_PER_INT - 1)))) 41 42 #define bit_clear(bs, i) \ 43 (bs[(i / BITS_PER_INT) + 1] &= ~(0x1 << (i & (BITS_PER_INT - 1)))) 44 45 #define bit_set_all(bs) \ 46 memset(bs + 1, -1, ((*bs / BITS_PER_INT) + 1) * sizeof(int)) 47 48 #define bit_clear_all(bs) \ 49 memset(bs + 1, 0, ((*bs / BITS_PER_INT) + 1) * sizeof(int)) 50 51 #define bit_copy(bs1, bs2) \ 52 memcpy(bs1 + 1, bs2 + 1, ((*bs1 / BITS_PER_INT) + 1) * sizeof(int)) 53 54 #endif 55