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
|
#pragma once
#include "StdLib.h"
#include "Types.h"
#include "kmalloc.h"
#include "Assertions.h"
namespace AK {
class Bitmap {
public:
// NOTE: A wrapping Bitmap won't try to free the wrapped data.
static Bitmap wrap(byte* data, unsigned size)
{
return Bitmap(data, size);
}
static Bitmap create(unsigned size, bool default_value = 0)
{
return Bitmap(size, default_value);
}
~Bitmap()
{
if (m_owned)
kfree(m_data);
m_data = nullptr;
}
unsigned size() const { return m_size; }
bool get(unsigned index) const
{
ASSERT(index < m_size);
return 0 != (m_data[index / 8] & (1u << (index % 8)));
}
void set(unsigned index, bool value) const
{
ASSERT(index < m_size);
if (value)
m_data[index / 8] |= static_cast<byte>((1u << (index % 8)));
else
m_data[index / 8] &= static_cast<byte>(~(1u << (index % 8)));
}
byte* data() { return m_data; }
const byte* data() const { return m_data; }
private:
explicit Bitmap(unsigned size, bool default_value)
: m_size(size)
, m_owned(true)
{
ASSERT(m_size != 0);
size_t size_to_allocate = ceilDiv(size, 8u);
m_data = reinterpret_cast<byte*>(kmalloc(size_to_allocate));
memset(m_data, default_value ? 0xff : 0x00, size_to_allocate);
}
Bitmap(byte* data, unsigned size)
: m_data(data)
, m_size(size)
, m_owned(false)
{
}
byte* m_data { nullptr };
unsigned m_size { 0 };
bool m_owned { false };
};
}
using AK::Bitmap;
|
