Loading...
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 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 | // SPDX-License-Identifier: GPL-2.0-or-later #include "alloc_helpers_api.h" /* * A simple test that tries to allocate a memory region above a specified, * aligned address: * * + * | +-----------+ | * | | rgn | | * +----------+-----------+---------+ * ^ * | * Aligned min_addr * * Expect to allocate a cleared region at the minimal memory address. */ static int alloc_from_simple_generic_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t size = SZ_16; phys_addr_t min_addr; PREFIX_PUSH(); setup_memblock(); min_addr = memblock_end_of_DRAM() - SMP_CACHE_BYTES; allocated_ptr = memblock_alloc_from(size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_MEM_EQ(allocated_ptr, 0, size); ASSERT_EQ(rgn->size, size); ASSERT_EQ(rgn->base, min_addr); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region above a certain address. * The minimal address here is not aligned: * * + + * | + +---------+ | * | | | rgn | | * +------+------+---------+------------+ * ^ ^------. * | | * min_addr Aligned address * boundary * * Expect to allocate a cleared region at the closest aligned memory address. */ static int alloc_from_misaligned_generic_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t size = SZ_32; phys_addr_t min_addr; PREFIX_PUSH(); setup_memblock(); /* A misaligned address */ min_addr = memblock_end_of_DRAM() - (SMP_CACHE_BYTES * 2 - 1); allocated_ptr = memblock_alloc_from(size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_MEM_EQ(allocated_ptr, 0, size); ASSERT_EQ(rgn->size, size); ASSERT_EQ(rgn->base, memblock_end_of_DRAM() - SMP_CACHE_BYTES); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region above an address that is too * close to the end of the memory: * * + + * | +--------+---+ | * | | rgn + | | * +-----------+--------+---+------+ * ^ ^ * | | * | min_addr * | * Aligned address * boundary * * Expect to prioritize granting memory over satisfying the minimal address * requirement. */ static int alloc_from_top_down_high_addr_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t size = SZ_32; phys_addr_t min_addr; PREFIX_PUSH(); setup_memblock(); /* The address is too close to the end of the memory */ min_addr = memblock_end_of_DRAM() - SZ_16; allocated_ptr = memblock_alloc_from(size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->size, size); ASSERT_EQ(rgn->base, memblock_end_of_DRAM() - SMP_CACHE_BYTES); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region when there is no space * available above the minimal address above a certain address: * * + * | +---------+-------------| * | | rgn | | * +--------+---------+-------------+ * ^ * | * min_addr * * Expect to prioritize granting memory over satisfying the minimal address * requirement and to allocate next to the previously reserved region. The * regions get merged into one. */ static int alloc_from_top_down_no_space_above_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t r1_size = SZ_64; phys_addr_t r2_size = SZ_2; phys_addr_t total_size = r1_size + r2_size; phys_addr_t min_addr; PREFIX_PUSH(); setup_memblock(); min_addr = memblock_end_of_DRAM() - SMP_CACHE_BYTES * 2; /* No space above this address */ memblock_reserve(min_addr, r2_size); allocated_ptr = memblock_alloc_from(r1_size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->base, min_addr - r1_size); ASSERT_EQ(rgn->size, total_size); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, total_size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region with a minimal address below * the start address of the available memory. As the allocation is top-down, * first reserve a region that will force allocation near the start. * Expect successful allocation and merge of both regions. */ static int alloc_from_top_down_min_addr_cap_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t r1_size = SZ_64; phys_addr_t min_addr; phys_addr_t start_addr; PREFIX_PUSH(); setup_memblock(); start_addr = (phys_addr_t)memblock_start_of_DRAM(); min_addr = start_addr - SMP_CACHE_BYTES * 3; memblock_reserve(start_addr + r1_size, MEM_SIZE - r1_size); allocated_ptr = memblock_alloc_from(r1_size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->base, start_addr); ASSERT_EQ(rgn->size, MEM_SIZE); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, MEM_SIZE); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region above an address that is too * close to the end of the memory: * * + * |-----------+ + | * | rgn | | | * +-----------+--------------+-----+ * ^ ^ * | | * Aligned address min_addr * boundary * * Expect to prioritize granting memory over satisfying the minimal address * requirement. Allocation happens at beginning of the available memory. */ static int alloc_from_bottom_up_high_addr_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t size = SZ_32; phys_addr_t min_addr; PREFIX_PUSH(); setup_memblock(); /* The address is too close to the end of the memory */ min_addr = memblock_end_of_DRAM() - SZ_8; allocated_ptr = memblock_alloc_from(size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->size, size); ASSERT_EQ(rgn->base, memblock_start_of_DRAM()); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region when there is no space * available above the minimal address above a certain address: * * + * |-----------+ +-------------------| * | rgn | | | * +-----------+----+-------------------+ * ^ * | * min_addr * * Expect to prioritize granting memory over satisfying the minimal address * requirement and to allocate at the beginning of the available memory. */ static int alloc_from_bottom_up_no_space_above_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t r1_size = SZ_64; phys_addr_t min_addr; phys_addr_t r2_size; PREFIX_PUSH(); setup_memblock(); min_addr = memblock_start_of_DRAM() + SZ_128; r2_size = memblock_end_of_DRAM() - min_addr; /* No space above this address */ memblock_reserve(min_addr - SMP_CACHE_BYTES, r2_size); allocated_ptr = memblock_alloc_from(r1_size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->base, memblock_start_of_DRAM()); ASSERT_EQ(rgn->size, r1_size); ASSERT_EQ(memblock.reserved.cnt, 2); ASSERT_EQ(memblock.reserved.total_size, r1_size + r2_size); test_pass_pop(); return 0; } /* * A test that tries to allocate a memory region with a minimal address below * the start address of the available memory. Expect to allocate a region * at the beginning of the available memory. */ static int alloc_from_bottom_up_min_addr_cap_check(void) { struct memblock_region *rgn = &memblock.reserved.regions[0]; void *allocated_ptr = NULL; phys_addr_t r1_size = SZ_64; phys_addr_t min_addr; phys_addr_t start_addr; PREFIX_PUSH(); setup_memblock(); start_addr = (phys_addr_t)memblock_start_of_DRAM(); min_addr = start_addr - SMP_CACHE_BYTES * 3; allocated_ptr = memblock_alloc_from(r1_size, SMP_CACHE_BYTES, min_addr); ASSERT_NE(allocated_ptr, NULL); ASSERT_EQ(rgn->base, start_addr); ASSERT_EQ(rgn->size, r1_size); ASSERT_EQ(memblock.reserved.cnt, 1); ASSERT_EQ(memblock.reserved.total_size, r1_size); test_pass_pop(); return 0; } /* Test case wrappers */ static int alloc_from_simple_check(void) { test_print("\tRunning %s...\n", __func__); run_top_down(alloc_from_simple_generic_check); run_bottom_up(alloc_from_simple_generic_check); return 0; } static int alloc_from_misaligned_check(void) { test_print("\tRunning %s...\n", __func__); run_top_down(alloc_from_misaligned_generic_check); run_bottom_up(alloc_from_misaligned_generic_check); return 0; } static int alloc_from_high_addr_check(void) { test_print("\tRunning %s...\n", __func__); memblock_set_bottom_up(false); alloc_from_top_down_high_addr_check(); memblock_set_bottom_up(true); alloc_from_bottom_up_high_addr_check(); return 0; } static int alloc_from_no_space_above_check(void) { test_print("\tRunning %s...\n", __func__); memblock_set_bottom_up(false); alloc_from_top_down_no_space_above_check(); memblock_set_bottom_up(true); alloc_from_bottom_up_no_space_above_check(); return 0; } static int alloc_from_min_addr_cap_check(void) { test_print("\tRunning %s...\n", __func__); memblock_set_bottom_up(false); alloc_from_top_down_min_addr_cap_check(); memblock_set_bottom_up(true); alloc_from_bottom_up_min_addr_cap_check(); return 0; } int memblock_alloc_helpers_checks(void) { const char *func_testing = "memblock_alloc_from"; prefix_reset(); prefix_push(func_testing); test_print("Running %s tests...\n", func_testing); reset_memblock_attributes(); dummy_physical_memory_init(); alloc_from_simple_check(); alloc_from_misaligned_check(); alloc_from_high_addr_check(); alloc_from_no_space_above_check(); alloc_from_min_addr_cap_check(); dummy_physical_memory_cleanup(); prefix_pop(); return 0; } |