1 // SPDX-License-Identifier: GPL-2.0 2 #include <linux/compiler.h> 3 #include <linux/bitmap.h> 4 #include <linux/zalloc.h> 5 #include <perf/cpumap.h> 6 #include "cpumap.h" 7 #include "debug.h" 8 #include "mem2node.h" 9 #include "tests.h" 10 11 static struct node { 12 int node; 13 const char *map; 14 } test_nodes[] = { 15 { .node = 0, .map = "0" }, 16 { .node = 1, .map = "1-2" }, 17 { .node = 3, .map = "5-7,9" }, 18 }; 19 20 #define T TEST_ASSERT_VAL 21 22 static unsigned long *get_bitmap(const char *str, int nbits) 23 { 24 struct perf_cpu_map *map = perf_cpu_map__new(str); 25 unsigned long *bm = NULL; 26 int i; 27 28 bm = bitmap_alloc(nbits); 29 30 if (map && bm) { 31 for (i = 0; i < map->nr; i++) { 32 set_bit(map->map[i], bm); 33 } 34 } 35 36 if (map) 37 perf_cpu_map__put(map); 38 else 39 free(bm); 40 41 return bm && map ? bm : NULL; 42 } 43 44 int test__mem2node(struct test *t __maybe_unused, int subtest __maybe_unused) 45 { 46 struct mem2node map; 47 struct memory_node nodes[3]; 48 struct perf_env env = { 49 .memory_nodes = (struct memory_node *) &nodes[0], 50 .nr_memory_nodes = ARRAY_SIZE(nodes), 51 .memory_bsize = 0x100, 52 }; 53 unsigned int i; 54 55 for (i = 0; i < ARRAY_SIZE(nodes); i++) { 56 nodes[i].node = test_nodes[i].node; 57 nodes[i].size = 10; 58 59 T("failed: alloc bitmap", 60 (nodes[i].set = get_bitmap(test_nodes[i].map, 10))); 61 } 62 63 T("failed: mem2node__init", !mem2node__init(&map, &env)); 64 T("failed: mem2node__node", 0 == mem2node__node(&map, 0x50)); 65 T("failed: mem2node__node", 1 == mem2node__node(&map, 0x100)); 66 T("failed: mem2node__node", 1 == mem2node__node(&map, 0x250)); 67 T("failed: mem2node__node", 3 == mem2node__node(&map, 0x500)); 68 T("failed: mem2node__node", 3 == mem2node__node(&map, 0x650)); 69 T("failed: mem2node__node", -1 == mem2node__node(&map, 0x450)); 70 T("failed: mem2node__node", -1 == mem2node__node(&map, 0x1050)); 71 72 for (i = 0; i < ARRAY_SIZE(nodes); i++) 73 zfree(&nodes[i].set); 74 75 mem2node__exit(&map); 76 return 0; 77 } 78