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