| // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later |
| /* |
| * Copyright 2013-2018 IBM Corp. |
| */ |
| |
| #include <config.h> |
| |
| #define BITS_PER_LONG (sizeof(long) * 8) |
| |
| #include "dummy-cpu.h" |
| |
| #include <stdlib.h> |
| |
| static void *__malloc(size_t size, const char *location __attribute__((unused))) |
| { |
| return malloc(size); |
| } |
| |
| static void *__realloc(void *ptr, size_t size, const char *location __attribute__((unused))) |
| { |
| return realloc(ptr, size); |
| } |
| |
| static void *__zalloc(size_t size, const char *location __attribute__((unused))) |
| { |
| return calloc(size, 1); |
| } |
| |
| static inline void __free(void *p, const char *location __attribute__((unused))) |
| { |
| return free(p); |
| } |
| |
| #include <skiboot.h> |
| |
| /* We need mem_region to accept __location__ */ |
| #define is_rodata(p) true |
| #include "../mem_region.c" |
| |
| /* But we need device tree to make copies of names. */ |
| #undef is_rodata |
| #define is_rodata(p) false |
| |
| #include "../device.c" |
| #include <assert.h> |
| #include <stdio.h> |
| |
| enum proc_chip_quirks proc_chip_quirks; |
| |
| void lock_caller(struct lock *l, const char *caller) |
| { |
| (void)caller; |
| l->lock_val++; |
| } |
| |
| void unlock(struct lock *l) |
| { |
| l->lock_val--; |
| } |
| |
| bool lock_held_by_me(struct lock *l) |
| { |
| return l->lock_val; |
| } |
| |
| #define TEST_HEAP_ORDER 16 |
| #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))) |
| { |
| } |
| |
| int main(void) |
| { |
| uint64_t i; |
| struct mem_region *r; |
| const char *last; |
| |
| /* Use malloc for the heap, so valgrind can find issues. */ |
| skiboot_heap.start = 0; |
| skiboot_heap.len = TEST_HEAP_SIZE; |
| skiboot_os_reserve.start = 0; |
| skiboot_os_reserve.len = 0; |
| |
| dt_root = dt_new_root(""); |
| dt_add_property_cells(dt_root, "#address-cells", 2); |
| dt_add_property_cells(dt_root, "#size-cells", 2); |
| |
| add_mem_node(0, 0x100000000ULL); |
| add_mem_node(0x100000000ULL, 0x100000000ULL); |
| |
| mem_region_init(); |
| |
| mem_region_release_unused(); |
| |
| assert(mem_check(&skiboot_heap)); |
| |
| /* Now we expect it to be split. */ |
| i = 0; |
| list_for_each(®ions, r, list) { |
| assert(mem_check(r)); |
| i++; |
| if (r == &skiboot_os_reserve) |
| continue; |
| if (r == &skiboot_code_and_text) |
| continue; |
| if (r == &skiboot_heap) |
| continue; |
| if (r == &skiboot_after_heap) |
| continue; |
| if (r == &skiboot_cpu_stacks) |
| continue; |
| |
| /* the memory nodes should all be available to the OS now */ |
| assert(r->type == REGION_OS); |
| } |
| assert(i == 9); |
| |
| last = NULL; |
| list_for_each(®ions, r, list) { |
| if (last != r->name && |
| strncmp(r->name, NODE_REGION_PREFIX, |
| strlen(NODE_REGION_PREFIX)) == 0) { |
| /* It's safe to cast away the const as |
| * this never happens at runtime, |
| * only in test and only for valgrind |
| */ |
| free((void*)r->name); |
| last = r->name; |
| } |
| } |
| |
| dt_free(dt_root); |
| return 0; |
| } |