summaryrefslogtreecommitdiffstats
path: root/usr.sbin/nsd/bitset.c
blob: f1f850e4db6f7562676e995ec0d6c9870cdaf55a (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/*
 * bitset.h -- Dynamic bitset.
 *
 * Copyright (c) 2001-2020, NLnet Labs. All rights reserved.
 *
 * See LICENSE for the license.
 *
 */
#include "config.h"
#include "bitset.h"

#include <assert.h>
#include <limits.h>
#include <string.h>

size_t nsd_bitset_size(size_t bits)
{
	if(bits == 0)
		bits++;

	return (bits / CHAR_BIT) + ((bits % CHAR_BIT) != 0) + sizeof(size_t);
}

void nsd_bitset_zero(struct nsd_bitset *bset)
{
	size_t sz;

	assert(bset != NULL);

	sz = nsd_bitset_size(bset->size) - sizeof(bset->size);
	assert(sz > 0);
	memset(bset->bits, 0, sz);
}

void nsd_bitset_init(struct nsd_bitset *bset, size_t bits)
{
	assert(bset != NULL);
	if (bits == 0)
		bits++;

	bset->size = bits;
	nsd_bitset_zero(bset);
}

int nsd_bitset_isset(struct nsd_bitset *bset, size_t bit)
{
	assert(bset != NULL);
	if(bit >= bset->size)
		return 0;

	return (bset->bits[ (bit / CHAR_BIT) ] & (1 << (bit % CHAR_BIT))) != 0;
}

void nsd_bitset_set(struct nsd_bitset *bset, size_t bit)
{
	assert(bset != NULL);
	assert(bset->size > bit);
	bset->bits[ (bit / CHAR_BIT) ] |= (1 << (bit % CHAR_BIT));
}

void nsd_bitset_unset(struct nsd_bitset *bset, size_t bit)
{
	assert(bset != NULL);
	assert(bset->size > bit);
	bset->bits[ (bit / CHAR_BIT) ] &= ~(1 << (bit % CHAR_BIT));
}

void nsd_bitset_or(
	struct nsd_bitset *destset,
	struct nsd_bitset *srcset1,
	struct nsd_bitset *srcset2)
{
	size_t i, n, size, bytes;
	unsigned char bits;
	unsigned int mask;

	assert(destset != NULL);
	assert(srcset1 != NULL);
	assert(srcset2 != NULL);

	size = destset->size;
	bytes = (size / CHAR_BIT) + ((size % CHAR_BIT) != 0);

	for(i = 0; i < bytes; i++) {
		bits = 0;

		n = (srcset1->size / CHAR_BIT);
		if (n > i) {
			bits |= srcset1->bits[i];
		} else {
			n += ((srcset1->size % CHAR_BIT) != 0);
			mask = (1 << ((srcset1->size % CHAR_BIT) + 1)) - 1;
			if (n > i) {
				bits |= (srcset1->bits[i] & mask);
			}
		}
		n = (srcset2->size / CHAR_BIT);
		if (n > i) {
			bits |= srcset2->bits[i];
		} else {
			n += ((srcset2->size % CHAR_BIT) != 0);
			mask = (1 << ((srcset2->size % CHAR_BIT) + 1)) - 1;
			if (n > i) {
				bits |= (srcset2->bits[i] & mask);
			}
		}
		destset->bits[i] = bits;
	}
}