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
|
// Support for building memory maps suitable for int 15 e820 calls.
//
// Copyright (C) 2008,2009 Kevin O'Connor <kevin@koconnor.net>
//
// This file may be distributed under the terms of the GNU LGPLv3 license.
#include "config.h" // BUILD_MAX_E820
#include "memmap.h" // struct e820entry
#include "output.h" // dprintf
#include "string.h" // memmove
/****************************************************************
* e820 memory map
****************************************************************/
// Info on e820 map location and size.
struct e820entry e820_list[BUILD_MAX_E820] VARFSEG;
int e820_count VARFSEG;
// Remove an entry from the e820_list.
static void
remove_e820(int i)
{
e820_count--;
memmove(&e820_list[i], &e820_list[i+1]
, sizeof(e820_list[0]) * (e820_count - i));
}
// Insert an entry in the e820_list at the given position.
static void
insert_e820(int i, u64 start, u64 size, u32 type)
{
if (e820_count >= BUILD_MAX_E820) {
warn_noalloc();
return;
}
memmove(&e820_list[i+1], &e820_list[i]
, sizeof(e820_list[0]) * (e820_count - i));
e820_count++;
struct e820entry *e = &e820_list[i];
e->start = start;
e->size = size;
e->type = type;
}
static const char *
e820_type_name(u32 type)
{
switch (type) {
case E820_RAM: return "RAM";
case E820_RESERVED: return "RESERVED";
case E820_ACPI: return "ACPI";
case E820_NVS: return "NVS";
case E820_UNUSABLE: return "UNUSABLE";
case E820_HOLE: return "HOLE";
default: return "UNKNOWN";
}
}
// Show the current e820_list.
static void
dump_map(void)
{
dprintf(1, "e820 map has %d items:\n", e820_count);
int i;
for (i=0; i<e820_count; i++) {
struct e820entry *e = &e820_list[i];
u64 e_end = e->start + e->size;
dprintf(1, " %d: %016llx - %016llx = %d %s\n", i
, e->start, e_end, e->type, e820_type_name(e->type));
}
}
// Add a new entry to the list. This scans for overlaps and keeps the
// list sorted.
void
add_e820(u64 start, u64 size, u32 type)
{
dprintf(8, "Add to e820 map: %08x %08x %d\n", (u32)start, (u32)size, type);
if (! size)
// Huh? Nothing to do.
return;
// Find position of new item (splitting existing item if needed).
u64 end = start + size;
int i;
for (i=0; i<e820_count; i++) {
struct e820entry *e = &e820_list[i];
u64 e_end = e->start + e->size;
if (start > e_end)
continue;
// Found position - check if an existing item needs to be split.
if (start > e->start) {
if (type == e->type) {
// Same type - merge them.
size += start - e->start;
start = e->start;
} else {
// Split existing item.
e->size = start - e->start;
i++;
if (e_end > end)
insert_e820(i, end, e_end - end, e->type);
}
}
break;
}
// Remove/adjust existing items that are overlapping.
while (i<e820_count) {
struct e820entry *e = &e820_list[i];
if (end < e->start)
// No overlap - done.
break;
u64 e_end = e->start + e->size;
if (end >= e_end) {
// Existing item completely overlapped - remove it.
remove_e820(i);
continue;
}
// Not completely overlapped - adjust its start.
e->start = end;
e->size = e_end - end;
if (type == e->type) {
// Same type - merge them.
size += e->size;
remove_e820(i);
}
break;
}
// Insert new item.
if (type != E820_HOLE)
insert_e820(i, start, size, type);
//dump_map();
}
// Report on final memory locations.
void
memmap_prepboot(void)
{
dump_map();
}
|
