mirror of
git://sourceware.org/git/lvm2.git
synced 2024-12-22 17:35:59 +03:00
d1b28647ed
and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
47 lines
1.1 KiB
C
47 lines
1.1 KiB
C
/*
|
|
* Copyright (C) 2001 Sistina Software (UK) Limited.
|
|
*
|
|
* This file is released under the GPL.
|
|
*/
|
|
|
|
#ifndef _LVM_BITSET_H
|
|
#define _LVM_BITSET_H
|
|
|
|
#include "lvm-types.h"
|
|
#include "pool.h"
|
|
|
|
#include <limits.h>
|
|
#include <string.h>
|
|
|
|
|
|
typedef uint32_t *bitset_t;
|
|
|
|
bitset_t bitset_create(struct pool *mem, unsigned num_bits);
|
|
|
|
void bit_union(bitset_t out, bitset_t in1, bitset_t in2);
|
|
int bit_get_first(bitset_t bs);
|
|
int bit_get_next(bitset_t bs, int last_bit);
|
|
|
|
|
|
#define BITS_PER_INT (sizeof(int) * CHAR_BIT)
|
|
|
|
#define bit(bs, i) \
|
|
(bs[(i / BITS_PER_INT) + 1] & (0x1 << (i & (BITS_PER_INT - 1))))
|
|
|
|
#define bit_set(bs, i) \
|
|
(bs[(i / BITS_PER_INT) + 1] |= (0x1 << (i & (BITS_PER_INT - 1))))
|
|
|
|
#define bit_clear(bs, i) \
|
|
(bs[(i / BITS_PER_INT) + 1] &= ~(0x1 << (i & (BITS_PER_INT - 1))))
|
|
|
|
#define bit_set_all(bs) \
|
|
memset(bs + 1, -1, ((*bs / BITS_PER_INT) + 1) * sizeof(int))
|
|
|
|
#define bit_clear_all(bs) \
|
|
memset(bs + 1, 0, ((*bs / BITS_PER_INT) + 1) * sizeof(int))
|
|
|
|
#define bit_copy(bs1, bs2) \
|
|
memcpy(bs1 + 1, bs2 + 1, ((*bs1 / BITS_PER_INT) + 1) * sizeof(int))
|
|
|
|
#endif
|