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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
/* Copyright 2015 IBM Corp.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
* implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <config.h>
#define BITS_PER_LONG (sizeof(long) * 8)
#include "dummy-cpu.h"
#include <stdlib.h>
static void *real_malloc(size_t size)
{
return malloc(size);
}
static void real_free(void *p)
{
return free(p);
}
#undef malloc
#undef free
#undef realloc
#include <skiboot.h>
#include <mem_region-malloc.h>
/* We need mem_region to accept __location__ */
#define is_rodata(p) true
#include "../mem_region.c"
#include "../malloc.c"
/* But we need device tree to make copies of names. */
#undef is_rodata
#define is_rodata(p) false
#include "../../libc/string/strdup.c"
#include "../device.c"
#include <assert.h>
#include <stdio.h>
void lock_caller(struct lock *l, const char *caller)
{
(void)caller;
assert(!l->lock_val);
l->lock_val++;
}
void unlock(struct lock *l)
{
assert(l->lock_val);
l->lock_val--;
}
bool lock_held_by_me(struct lock *l)
{
return l->lock_val;
}
#define TEST_HEAP_ORDER 14
#define TEST_HEAP_SIZE (1ULL << TEST_HEAP_ORDER)
static void add_mem_node(uint64_t start, uint64_t len)
{
struct dt_node *mem;
u64 reg[2];
char *name;
name = (char*)malloc(sizeof("memory@") + STR_MAX_CHARS(reg[0]));
assert(name);
/* reg contains start and length */
reg[0] = cpu_to_be64(start);
reg[1] = cpu_to_be64(len);
sprintf(name, "memory@%llx", (long long)start);
mem = dt_new(dt_root, name);
dt_add_property_string(mem, "device_type", "memory");
dt_add_property(mem, "reg", reg, sizeof(reg));
free(name);
}
void add_chip_dev_associativity(struct dt_node *dev __attribute__((unused)))
{
}
struct test_region {
uint64_t start;
uint64_t end;
};
static struct test {
struct test_region regions[3];
bool reserved;
} tests[] = {
/* empty region set */
{ { { 0 } }, false },
/* single exact match */
{ { { 0x1000, 0x2000 }, }, true },
/* overlap downwards */
{ { { 0x0fff, 0x2000 }, }, true },
/* overlap upwards */
{ { { 0x1000, 0x2001 }, }, true },
/* missing first byte */
{ { { 0x1001, 0x2000 }, }, false },
/* missing last byte */
{ { { 0x1000, 0x1fff }, }, false },
/* two regions, full coverage, split before start of range */
{ { { 0x0500, 0x1000 }, { 0x1000, 0x2500 } }, true },
/* two regions, full coverage, split after start of range */
{ { { 0x0500, 0x1001 }, { 0x1001, 0x2500 } }, true },
/* two regions, full coverage, split at middle of range */
{ { { 0x0500, 0x1500 }, { 0x1500, 0x2500 } }, true },
/* two regions, full coverage, split before end of range */
{ { { 0x0500, 0x1fff }, { 0x1fff, 0x2500 } }, true },
/* two regions, full coverage, split after end of range */
{ { { 0x0500, 0x2000 }, { 0x2000, 0x2500 } }, true },
/* two regions, missing byte in middle of range */
{ { { 0x0500, 0x14ff }, { 0x1500, 0x2500 } }, false },
/* two regions, missing byte after start of range */
{ { { 0x0500, 0x1000 }, { 0x1001, 0x2500 } }, false },
/* two regions, missing byte before end of range */
{ { { 0x0500, 0x1fff }, { 0x2000, 0x2500 } }, false },
};
static void run_test(struct test *test)
{
struct test_region *r;
bool reserved;
list_head_init(®ions);
mem_region_init();
/* create our reservations */
for (r = test->regions; r->start; r++)
mem_reserve_fw("r", r->start, r->end - r->start);
reserved = mem_range_is_reserved(0x1000, 0x1000);
if (reserved != test->reserved) {
struct mem_region *r;
fprintf(stderr, "test failed; got %s, expected %s\n",
reserved ? "reserved" : "unreserved",
test->reserved ? "reserved" : "unreserved");
fprintf(stderr, "reserved regions:\n");
list_for_each(®ions, r, list) {
fprintf(stderr, "\t: %08"PRIx64"[%08"PRIx64"] %s\n",
r->start, r->len, r->name);
}
exit(EXIT_FAILURE);
}
}
int main(void)
{
unsigned int i;
void *buf;
/* Use malloc for the heap, so valgrind can find issues. */
skiboot_heap.start = (long)real_malloc(TEST_HEAP_SIZE);
skiboot_heap.len = TEST_HEAP_SIZE;
/* shift the OS reserve area out of the way of our playground */
skiboot_os_reserve.start = 0x100000;
skiboot_os_reserve.len = 0x1000;
dt_root = dt_new_root("");
dt_add_property_cells(dt_root, "#address-cells", 2);
dt_add_property_cells(dt_root, "#size-cells", 2);
buf = real_malloc(1024*1024);
add_mem_node((unsigned long)buf, 1024*1024);
for (i = 0; i < ARRAY_SIZE(tests); i++)
run_test(&tests[i]);
dt_free(dt_root);
real_free(buf);
real_free((void *)(long)skiboot_heap.start);
return 0;
}
|
