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

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