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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
use memory::bucket::Bucket;
use memory::bucket::BUCKET_PAGES;
use memory::page::Page;
use memory::pool::Pool;
use std::ptr::null_mut;
use std::usize::MAX;
pub struct Heap {
map: usize,
pools: [*mut Pool; BUCKET_PAGES],
}
impl Heap {
pub fn create() -> Heap {
Heap {
map: MAX,
pools: [null_mut(); BUCKET_PAGES],
}
}
pub fn allocate_page(&mut self) -> *mut Page {
if self.map == 0 {
panic!("Not more than one heap supported currently.");
}
let index = Bucket::find_least_position(self.map) - 1;
if self.pools[index] == null_mut() {
self.pools[index] = Pool::create(self);
}
unsafe { (*self.pools[index]).allocate_page() }
}
pub fn get_allocation_position(&self, pool: *mut Pool) -> usize {
for i in 0..BUCKET_PAGES {
if pool == self.pools[i] {
return i;
}
}
panic!(
"The pool pointer {:X} is not from my pools array!",
pool as usize
)
}
pub fn get_allocation_bit(&self, pool: *mut Pool) -> usize {
1 << (BUCKET_PAGES - 1 - self.get_allocation_position(pool))
}
pub fn mark_as_full(&mut self, pool: *mut Pool) {
let bit = self.get_allocation_bit(pool);
self.map = self.map & !bit;
}
pub fn mark_as_free(&mut self, pool: *mut Pool) {
let bit = self.get_allocation_bit(pool);
self.map = self.map | bit;
}
pub fn deallocate(&mut self, pool: *mut Pool) {
let position = self.get_allocation_position(pool);
self.pools[position] = null_mut();
unsafe {
(*pool).deallocate();
}
}
pub fn empty(&self) {
if self.map != MAX {
panic! {"Heap map: {:X}", self.map};
}
for i in 0..BUCKET_PAGES {
if self.pools[i] != null_mut() {
unsafe {
(*self.pools[i]).deallocate();
}
}
}
}
}