This repository has been archived by the owner on Jan 18, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bitmap.h
83 lines (68 loc) · 2.3 KB
/
bitmap.h
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
/*
* Copyright (c) 2019 Andri Yngvason
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#pragma once
#include <stdint.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdbool.h>
#define UDIV_UP(a, b) (((a) + (b) - 1) / (b))
struct bitmap {
size_t n_elem;
uint64_t data[0];
};
static inline struct bitmap *bitmap_alloc(size_t bitlen)
{
size_t n_elem = UDIV_UP(bitlen, 64);
struct bitmap *self = calloc(1, sizeof(*self) + n_elem * sizeof(*self->data));
if (!self)
return NULL;
self->n_elem = n_elem;
return self;
}
static inline void bitmap_clear_all(struct bitmap *self)
{
for (size_t i = 0; i < self->n_elem; ++i)
self->data[i] = 0;
}
static inline int bitmap_is_empty(const struct bitmap *self)
{
for (size_t i = 0; i < self->n_elem; ++i)
if (self->data[i])
return 0;
return 1;
}
static inline int bitmap_is_set(const struct bitmap *self, int index)
{
return !!(self->data[index / 64] & (1ULL << (index % 64)));
}
static inline void bitmap_clear(struct bitmap* self, int index)
{
self->data[index / 64] &= ~(1ULL << (index % 64));
}
static inline void bitmap_set_cond(struct bitmap* self, int index, bool cond)
{
self->data[index / 64] |= ((uint64_t)cond) << (index % 64);
}
static inline void bitmap_set(struct bitmap* self, int index)
{
bitmap_set_cond(self, index, true);
}