1 // SPDX-License-Identifier: GPL-2.0 2 #include <linux/compiler.h> 3 #include <linux/kernel.h> 4 #include "tests.h" 5 #include "map.h" 6 #include "maps.h" 7 #include "dso.h" 8 #include "debug.h" 9 10 struct map_def { 11 const char *name; 12 u64 start; 13 u64 end; 14 }; 15 16 static int check_maps(struct map_def *merged, unsigned int size, struct maps *maps) 17 { 18 struct map_rb_node *rb_node; 19 unsigned int i = 0; 20 21 maps__for_each_entry(maps, rb_node) { 22 struct map *map = rb_node->map; 23 24 if (i > 0) 25 TEST_ASSERT_VAL("less maps expected", (map && i < size) || (!map && i == size)); 26 27 TEST_ASSERT_VAL("wrong map start", map__start(map) == merged[i].start); 28 TEST_ASSERT_VAL("wrong map end", map__end(map) == merged[i].end); 29 TEST_ASSERT_VAL("wrong map name", !strcmp(map__dso(map)->name, merged[i].name)); 30 TEST_ASSERT_VAL("wrong map refcnt", refcount_read(&map->refcnt) == 1); 31 32 i++; 33 } 34 35 return TEST_OK; 36 } 37 38 static int test__maps__merge_in(struct test_suite *t __maybe_unused, int subtest __maybe_unused) 39 { 40 unsigned int i; 41 struct map_def bpf_progs[] = { 42 { "bpf_prog_1", 200, 300 }, 43 { "bpf_prog_2", 500, 600 }, 44 { "bpf_prog_3", 800, 900 }, 45 }; 46 struct map_def merged12[] = { 47 { "kcore1", 100, 200 }, 48 { "bpf_prog_1", 200, 300 }, 49 { "kcore1", 300, 500 }, 50 { "bpf_prog_2", 500, 600 }, 51 { "kcore1", 600, 800 }, 52 { "bpf_prog_3", 800, 900 }, 53 { "kcore1", 900, 1000 }, 54 }; 55 struct map_def merged3[] = { 56 { "kcore1", 100, 200 }, 57 { "bpf_prog_1", 200, 300 }, 58 { "kcore1", 300, 500 }, 59 { "bpf_prog_2", 500, 600 }, 60 { "kcore1", 600, 800 }, 61 { "bpf_prog_3", 800, 900 }, 62 { "kcore1", 900, 1000 }, 63 { "kcore3", 1000, 1100 }, 64 }; 65 struct map *map_kcore1, *map_kcore2, *map_kcore3; 66 int ret; 67 struct maps *maps = maps__new(NULL); 68 69 TEST_ASSERT_VAL("failed to create maps", maps); 70 71 for (i = 0; i < ARRAY_SIZE(bpf_progs); i++) { 72 struct map *map; 73 74 map = dso__new_map(bpf_progs[i].name); 75 TEST_ASSERT_VAL("failed to create map", map); 76 77 map->start = bpf_progs[i].start; 78 map->end = bpf_progs[i].end; 79 TEST_ASSERT_VAL("failed to insert map", maps__insert(maps, map) == 0); 80 map__put(map); 81 } 82 83 map_kcore1 = dso__new_map("kcore1"); 84 TEST_ASSERT_VAL("failed to create map", map_kcore1); 85 86 map_kcore2 = dso__new_map("kcore2"); 87 TEST_ASSERT_VAL("failed to create map", map_kcore2); 88 89 map_kcore3 = dso__new_map("kcore3"); 90 TEST_ASSERT_VAL("failed to create map", map_kcore3); 91 92 /* kcore1 map overlaps over all bpf maps */ 93 map_kcore1->start = 100; 94 map_kcore1->end = 1000; 95 96 /* kcore2 map hides behind bpf_prog_2 */ 97 map_kcore2->start = 550; 98 map_kcore2->end = 570; 99 100 /* kcore3 map hides behind bpf_prog_3, kcore1 and adds new map */ 101 map_kcore3->start = 880; 102 map_kcore3->end = 1100; 103 104 ret = maps__merge_in(maps, map_kcore1); 105 TEST_ASSERT_VAL("failed to merge map", !ret); 106 107 ret = check_maps(merged12, ARRAY_SIZE(merged12), maps); 108 TEST_ASSERT_VAL("merge check failed", !ret); 109 110 ret = maps__merge_in(maps, map_kcore2); 111 TEST_ASSERT_VAL("failed to merge map", !ret); 112 113 ret = check_maps(merged12, ARRAY_SIZE(merged12), maps); 114 TEST_ASSERT_VAL("merge check failed", !ret); 115 116 ret = maps__merge_in(maps, map_kcore3); 117 TEST_ASSERT_VAL("failed to merge map", !ret); 118 119 ret = check_maps(merged3, ARRAY_SIZE(merged3), maps); 120 TEST_ASSERT_VAL("merge check failed", !ret); 121 122 maps__delete(maps); 123 return TEST_OK; 124 } 125 126 DEFINE_SUITE("maps__merge_in", maps__merge_in); 127