144760f8e0
Patch series "Remove the type-unclear target id concept".
DAMON asks each monitoring target ('struct damon_target') to have one
'unsigned long' integer called 'id', which should be unique among the
targets of same monitoring context. Meaning of it is, however, totally up
to the monitoring primitives that registered to the monitoring context.
For example, the virtual address spaces monitoring primitives treats the
id as a 'struct pid' pointer.
This makes the code flexible but ugly, not well-documented, and
type-unsafe[1]. Also, identification of each target can be done via its
index. For the reason, this patchset removes the concept and uses clear
type definition.
[1] https://lore.kernel.org/linux-mm/20211013154535.4aaeaaf9d0182922e405dd1e@linux-foundation.org/
This patch (of 4):
Target id is a 'unsigned long' data, which can be interpreted differently
by each monitoring primitives. For example, it means 'struct pid *' for
the virtual address spaces monitoring, while it means nothing but an
integer to be displayed to debugfs interface users for the physical
address space monitoring. It's flexible but makes code ugly and
type-unsafe[1].
To be prepared for eventual removal of the concept, this commit removes a
use case of the concept in 'init_regions' debugfs file handling. In
detail, this commit replaces use of the id with the index of each target
in the context's targets list.
[1] https://lore.kernel.org/linux-mm/20211013154535.4aaeaaf9d0182922e405dd1e@linux-foundation.org/
Link: https://lkml.kernel.org/r/20211230100723.2238-1-sj@kernel.org
Link: https://lkml.kernel.org/r/20211230100723.2238-2-sj@kernel.org
Signed-off-by: SeongJae Park <sj@kernel.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
181 lines
4.9 KiB
C
181 lines
4.9 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* DAMON Debugfs Interface Unit Tests
|
|
*
|
|
* Author: SeongJae Park <sjpark@amazon.de>
|
|
*/
|
|
|
|
#ifdef CONFIG_DAMON_DBGFS_KUNIT_TEST
|
|
|
|
#ifndef _DAMON_DBGFS_TEST_H
|
|
#define _DAMON_DBGFS_TEST_H
|
|
|
|
#include <kunit/test.h>
|
|
|
|
static void damon_dbgfs_test_str_to_target_ids(struct kunit *test)
|
|
{
|
|
char *question;
|
|
unsigned long *answers;
|
|
unsigned long expected[] = {12, 35, 46};
|
|
ssize_t nr_integers = 0, i;
|
|
|
|
question = "123";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)1, nr_integers);
|
|
KUNIT_EXPECT_EQ(test, 123ul, answers[0]);
|
|
kfree(answers);
|
|
|
|
question = "123abc";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)1, nr_integers);
|
|
KUNIT_EXPECT_EQ(test, 123ul, answers[0]);
|
|
kfree(answers);
|
|
|
|
question = "a123";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)0, nr_integers);
|
|
kfree(answers);
|
|
|
|
question = "12 35";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)2, nr_integers);
|
|
for (i = 0; i < nr_integers; i++)
|
|
KUNIT_EXPECT_EQ(test, expected[i], answers[i]);
|
|
kfree(answers);
|
|
|
|
question = "12 35 46";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)3, nr_integers);
|
|
for (i = 0; i < nr_integers; i++)
|
|
KUNIT_EXPECT_EQ(test, expected[i], answers[i]);
|
|
kfree(answers);
|
|
|
|
question = "12 35 abc 46";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)2, nr_integers);
|
|
for (i = 0; i < 2; i++)
|
|
KUNIT_EXPECT_EQ(test, expected[i], answers[i]);
|
|
kfree(answers);
|
|
|
|
question = "";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)0, nr_integers);
|
|
kfree(answers);
|
|
|
|
question = "\n";
|
|
answers = str_to_target_ids(question, strlen(question),
|
|
&nr_integers);
|
|
KUNIT_EXPECT_EQ(test, (ssize_t)0, nr_integers);
|
|
kfree(answers);
|
|
}
|
|
|
|
static void damon_dbgfs_test_set_targets(struct kunit *test)
|
|
{
|
|
struct damon_ctx *ctx = dbgfs_new_ctx();
|
|
unsigned long ids[] = {1, 2, 3};
|
|
char buf[64];
|
|
|
|
/* Make DAMON consider target id as plain number */
|
|
ctx->primitive.target_valid = NULL;
|
|
ctx->primitive.cleanup = NULL;
|
|
|
|
damon_set_targets(ctx, ids, 3);
|
|
sprint_target_ids(ctx, buf, 64);
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "1 2 3\n");
|
|
|
|
damon_set_targets(ctx, NULL, 0);
|
|
sprint_target_ids(ctx, buf, 64);
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "\n");
|
|
|
|
damon_set_targets(ctx, (unsigned long []){1, 2}, 2);
|
|
sprint_target_ids(ctx, buf, 64);
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "1 2\n");
|
|
|
|
damon_set_targets(ctx, (unsigned long []){2}, 1);
|
|
sprint_target_ids(ctx, buf, 64);
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "2\n");
|
|
|
|
damon_set_targets(ctx, NULL, 0);
|
|
sprint_target_ids(ctx, buf, 64);
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "\n");
|
|
|
|
dbgfs_destroy_ctx(ctx);
|
|
}
|
|
|
|
static void damon_dbgfs_test_set_init_regions(struct kunit *test)
|
|
{
|
|
struct damon_ctx *ctx = damon_new_ctx();
|
|
unsigned long ids[] = {1, 2, 3};
|
|
/* Each line represents one region in ``<target idx> <start> <end>`` */
|
|
char * const valid_inputs[] = {"1 10 20\n 1 20 30\n1 35 45",
|
|
"1 10 20\n",
|
|
"1 10 20\n0 39 59\n0 70 134\n 1 20 25\n",
|
|
""};
|
|
/* Reading the file again will show sorted, clean output */
|
|
char * const valid_expects[] = {"1 10 20\n1 20 30\n1 35 45\n",
|
|
"1 10 20\n",
|
|
"0 39 59\n0 70 134\n1 10 20\n1 20 25\n",
|
|
""};
|
|
char * const invalid_inputs[] = {"3 10 20\n", /* target not exists */
|
|
"1 10 20\n 1 14 26\n", /* regions overlap */
|
|
"0 10 20\n1 30 40\n 0 5 8"}; /* not sorted by address */
|
|
char *input, *expect;
|
|
int i, rc;
|
|
char buf[256];
|
|
|
|
damon_set_targets(ctx, ids, 3);
|
|
|
|
/* Put valid inputs and check the results */
|
|
for (i = 0; i < ARRAY_SIZE(valid_inputs); i++) {
|
|
input = valid_inputs[i];
|
|
expect = valid_expects[i];
|
|
|
|
rc = set_init_regions(ctx, input, strnlen(input, 256));
|
|
KUNIT_EXPECT_EQ(test, rc, 0);
|
|
|
|
memset(buf, 0, 256);
|
|
sprint_init_regions(ctx, buf, 256);
|
|
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, expect);
|
|
}
|
|
/* Put invalid inputs and check the return error code */
|
|
for (i = 0; i < ARRAY_SIZE(invalid_inputs); i++) {
|
|
input = invalid_inputs[i];
|
|
pr_info("input: %s\n", input);
|
|
rc = set_init_regions(ctx, input, strnlen(input, 256));
|
|
KUNIT_EXPECT_EQ(test, rc, -EINVAL);
|
|
|
|
memset(buf, 0, 256);
|
|
sprint_init_regions(ctx, buf, 256);
|
|
|
|
KUNIT_EXPECT_STREQ(test, (char *)buf, "");
|
|
}
|
|
|
|
damon_set_targets(ctx, NULL, 0);
|
|
damon_destroy_ctx(ctx);
|
|
}
|
|
|
|
static struct kunit_case damon_test_cases[] = {
|
|
KUNIT_CASE(damon_dbgfs_test_str_to_target_ids),
|
|
KUNIT_CASE(damon_dbgfs_test_set_targets),
|
|
KUNIT_CASE(damon_dbgfs_test_set_init_regions),
|
|
{},
|
|
};
|
|
|
|
static struct kunit_suite damon_test_suite = {
|
|
.name = "damon-dbgfs",
|
|
.test_cases = damon_test_cases,
|
|
};
|
|
kunit_test_suite(damon_test_suite);
|
|
|
|
#endif /* _DAMON_TEST_H */
|
|
|
|
#endif /* CONFIG_DAMON_KUNIT_TEST */
|