1
0
mirror of https://github.com/rkd77/elinks.git synced 2024-11-04 08:17:17 -05:00
elinks/src/util/bitfield.h
Jonas Fonseca acf2ec806b Remove empty lines in start of header files
A left over from the CVS Id removal. Also, for a few files, normalize the
order in which things are declared in headers.
2005-11-15 11:33:27 +01:00

147 lines
3.4 KiB
C

#ifndef EL__UTIL_BITFIELD_H
#define EL__UTIL_BITFIELD_H
#include <string.h>
#include "util/memory.h"
/* Bitfield operations: */
struct bitfield {
unsigned int bitsize; /* Number of bits in the bitfield. */
unsigned char bits[1]; /* Strawberry bitfields forever. */
};
#define foreach_bitfield_set(bit, bitfield) \
for ((bit) = 0; (bit) < (bitfield)->bitsize; (bit)++) \
if (test_bitfield_bit(bitfield, bit))
#define foreachback_bitfield_set(bit, bitfield) \
for ((bit) = (bitfield)->bitsize; (bit) > 0;) \
if (test_bitfield_bit(bitfield, --bit))
#define foreach_bitfield_cleared(bit, bitfield) \
for ((bit) = 0; (bit) < (bitfield)->bitsize; (bit)++) \
if (!test_bitfield_bit(bitfield, bit))
/* By shifting when getting the bit offset it is ensured that only one bit is
* set in the resulting value. Idea from libbt by Kevin Smathers. */
#define get_bitfield_bit_offset(bit) ((size_t) (0x80 >> ((bit) % 8)))
#define get_bitfield_byte_offset(bit) ((size_t) ((bit) / 8))
/* +7 to round up to nearest byte. */
#define get_bitfield_byte_size(bits) ((size_t) (((bits) + 7) / 8))
/* Allocate a bitfield containing @bits number of bits. */
static inline struct bitfield *
init_bitfield(size_t bits)
{
size_t size = get_bitfield_byte_size(bits);
struct bitfield *bitfield;
bitfield = mem_calloc(1, offsetof(struct bitfield, bits) + size);
if (bitfield) bitfield->bitsize = bits;
return bitfield;
}
/* Update @bitfield with the @size bytes from the @bits string in @bits. */
static inline void
copy_bitfield(struct bitfield *bitfield,
const unsigned char *bits, unsigned int bytesize)
{
/* Only for exact size? */
if (bytesize <= get_bitfield_byte_size(bitfield->bitsize))
memcpy(bitfield->bits, bits, bytesize);
}
/* Test whether @bit is set in the bitfield. */
static inline int
test_bitfield_bit(struct bitfield *bitfield, unsigned int bit)
{
size_t byte_offset, bit_offset;
if (bit >= bitfield->bitsize)
return 0;
byte_offset = get_bitfield_byte_offset(bit);
bit_offset = get_bitfield_bit_offset(bit);
return !!(bitfield->bits[byte_offset] & bit_offset);
}
/* Set @bit in the bitfield. */
static inline void
set_bitfield_bit(struct bitfield *bitfield, unsigned int bit)
{
size_t byte_offset, bit_offset;
if (bit >= bitfield->bitsize)
return;
byte_offset = get_bitfield_byte_offset(bit);
bit_offset = get_bitfield_bit_offset(bit);
bitfield->bits[byte_offset] |= bit_offset;
}
/* Unset @bit in the bitfield. */
static inline void
clear_bitfield_bit(struct bitfield *bitfield, unsigned int bit)
{
size_t byte_offset, bit_offset;
if (bit >= bitfield->bitsize)
return;
byte_offset = get_bitfield_byte_offset(bit);
bit_offset = get_bitfield_bit_offset(bit);
bitfield->bits[byte_offset] &= ~bit_offset;
}
static inline unsigned int
get_bitfield_set_count(struct bitfield *bitfield)
{
unsigned int bit, count = 0;
foreach_bitfield_set (bit, bitfield)
count++;
return count;
}
static inline unsigned int
get_bitfield_cleared_count(struct bitfield *bitfield)
{
unsigned int bit, count = 0;
foreach_bitfield_cleared (bit, bitfield)
count++;
return count;
}
static inline unsigned int
bitfield_is_set(struct bitfield *bitfield)
{
unsigned int bit;
foreach_bitfield_cleared (bit, bitfield)
return 0;
return 1;
}
static inline unsigned int
bitfield_is_cleared(struct bitfield *bitfield)
{
unsigned int bit;
foreach_bitfield_set (bit, bitfield)
return 0;
return 1;
}
#endif