blob: 628417363ecdfcbf34aa554f8b9f55daa0c9ea4d (
plain)
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
|
/*
* bubbl
* Copyright (C) 2025 Raghuram Subramani <raghus2247@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <mm/physical_mm.h>
#include <stdbool.h>
#include <stdint.h>
namespace PhysicalMM
{
/* Marks the block as 'used' */
void
set_used(const uint32_t bit, uint32_t *total_free_blocks, uint32_t *memory_map)
{
uint32_t memory_map_index = bit / BITMAP_ENTRY_SIZE;
uint32_t bitmask = 1 << (bit % BITMAP_ENTRY_SIZE);
(*total_free_blocks)--;
memory_map[memory_map_index] |= bitmask;
}
/* Marks the block as 'unused' */
void
set_usable(const uint32_t bit,
uint32_t *total_free_blocks,
uint32_t *memory_map)
{
uint32_t memory_map_index = bit / BITMAP_ENTRY_SIZE;
uint32_t bitmask = 1 << (bit % BITMAP_ENTRY_SIZE);
(*total_free_blocks)++;
memory_map[memory_map_index] &= ~bitmask;
}
/* Returns:
* True if the bit is set (block is in use)
* False if the bit is unset (block isn't in use)
*/
bool
test_bit(const uint32_t bit, uint32_t *memory_map)
{
uint32_t memory_map_index = bit / BITMAP_ENTRY_SIZE;
uint32_t bitmask = 1 << (bit % BITMAP_ENTRY_SIZE);
return memory_map[memory_map_index] & bitmask;
}
}
|
