1
0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
lvm2/libdm/datastruct/bitset.c

98 lines
2.0 KiB
C
Raw Normal View History

/*
* Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
* Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
*
* This file is part of the device-mapper userspace tools.
*
* This copyrighted material is made available to anyone wishing to use,
* modify, copy, or redistribute it subject to the terms and conditions
* of the GNU Lesser General Public License v.2.1.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "dmlib.h"
/* FIXME: calculate this. */
#define INT_SHIFT 5
2005-10-17 02:57:20 +04:00
dm_bitset_t dm_bitset_create(struct dm_pool *mem, unsigned num_bits)
{
2005-10-17 02:57:20 +04:00
unsigned n = (num_bits / DM_BITS_PER_INT) + 2;
size_t size = sizeof(int) * n;
2005-10-17 02:57:20 +04:00
dm_bitset_t bs;
if (mem)
2005-10-17 02:57:20 +04:00
bs = dm_pool_zalloc(mem, size);
else
2005-10-17 02:57:20 +04:00
bs = dm_malloc(size);
if (!bs)
return NULL;
*bs = num_bits;
if (!mem)
2005-10-17 02:57:20 +04:00
dm_bit_clear_all(bs);
return bs;
}
2005-10-17 02:57:20 +04:00
void dm_bitset_destroy(dm_bitset_t bs)
{
2005-10-17 02:57:20 +04:00
dm_free(bs);
}
2005-10-17 02:57:20 +04:00
void dm_bit_union(dm_bitset_t out, dm_bitset_t in1, dm_bitset_t in2)
{
int i;
2005-10-17 02:57:20 +04:00
for (i = (in1[0] / DM_BITS_PER_INT) + 1; i; i--)
out[i] = in1[i] | in2[i];
}
/*
* FIXME: slow
*/
static inline int _test_word(uint32_t test, int bit)
{
while (bit < (int) DM_BITS_PER_INT) {
if (test & (0x1 << bit))
return bit;
bit++;
}
return -1;
}
2005-10-17 02:57:20 +04:00
int dm_bit_get_next(dm_bitset_t bs, int last_bit)
{
int bit, word;
uint32_t test;
last_bit++; /* otherwise we'll return the same bit again */
/*
* bs[0] holds number of bits
*/
while (last_bit < (int) bs[0]) {
word = last_bit >> INT_SHIFT;
test = bs[word + 1];
2005-10-17 02:57:20 +04:00
bit = last_bit & (DM_BITS_PER_INT - 1);
if ((bit = _test_word(test, bit)) >= 0)
2005-10-17 02:57:20 +04:00
return (word * DM_BITS_PER_INT) + bit;
2005-10-17 02:57:20 +04:00
last_bit = last_bit - (last_bit & (DM_BITS_PER_INT - 1)) +
DM_BITS_PER_INT;
}
return -1;
}
2005-10-17 02:57:20 +04:00
int dm_bit_get_first(dm_bitset_t bs)
{
2005-10-17 02:57:20 +04:00
return dm_bit_get_next(bs, -1);
}