1f08c3bdfSopenharmony_ci// SPDX-License-Identifier: GPL-2.0-or-later 2f08c3bdfSopenharmony_ci/* 3f08c3bdfSopenharmony_ci * Copyright (c) 2018 Cyril Hrubis <chrubis@suse.cz> 4f08c3bdfSopenharmony_ci */ 5f08c3bdfSopenharmony_ci 6f08c3bdfSopenharmony_ci/* 7f08c3bdfSopenharmony_ci * We are testing set_mempolicy() with MPOL_BIND and MPOL_PREFERRED. 8f08c3bdfSopenharmony_ci * 9f08c3bdfSopenharmony_ci * For each node with memory we set its bit in nodemask with set_mempolicy() 10f08c3bdfSopenharmony_ci * and verify that memory has been allocated accordingly. 11f08c3bdfSopenharmony_ci */ 12f08c3bdfSopenharmony_ci 13f08c3bdfSopenharmony_ci#include <errno.h> 14f08c3bdfSopenharmony_ci#include "config.h" 15f08c3bdfSopenharmony_ci#ifdef HAVE_NUMA_V2 16f08c3bdfSopenharmony_ci# include <numa.h> 17f08c3bdfSopenharmony_ci# include <numaif.h> 18f08c3bdfSopenharmony_ci#endif 19f08c3bdfSopenharmony_ci#include "tst_test.h" 20f08c3bdfSopenharmony_ci#include "tst_numa.h" 21f08c3bdfSopenharmony_ci 22f08c3bdfSopenharmony_ci#ifdef HAVE_NUMA_V2 23f08c3bdfSopenharmony_ci 24f08c3bdfSopenharmony_ci#include "set_mempolicy.h" 25f08c3bdfSopenharmony_ci 26f08c3bdfSopenharmony_cistatic size_t page_size; 27f08c3bdfSopenharmony_cistatic struct tst_nodemap *nodes; 28f08c3bdfSopenharmony_ci 29f08c3bdfSopenharmony_ci#define PAGES_ALLOCATED 16u 30f08c3bdfSopenharmony_ci 31f08c3bdfSopenharmony_cistatic void setup(void) 32f08c3bdfSopenharmony_ci{ 33f08c3bdfSopenharmony_ci page_size = getpagesize(); 34f08c3bdfSopenharmony_ci 35f08c3bdfSopenharmony_ci nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * PAGES_ALLOCATED * page_size / 1024); 36f08c3bdfSopenharmony_ci if (nodes->cnt <= 1) 37f08c3bdfSopenharmony_ci tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 38f08c3bdfSopenharmony_ci 39f08c3bdfSopenharmony_ci /* 40f08c3bdfSopenharmony_ci * In most cases, set_mempolicy01 finish quickly, but when the platform 41f08c3bdfSopenharmony_ci * has multiple NUMA nodes, the test matrix combination grows exponentially 42f08c3bdfSopenharmony_ci * and bring about test time to increase extremely fast. 43f08c3bdfSopenharmony_ci * 44f08c3bdfSopenharmony_ci * Here reset the maximum runtime according to the NUMA nodes. 45f08c3bdfSopenharmony_ci */ 46f08c3bdfSopenharmony_ci tst_set_max_runtime(test.max_runtime * (1 << nodes->cnt/16)); 47f08c3bdfSopenharmony_ci} 48f08c3bdfSopenharmony_ci 49f08c3bdfSopenharmony_cistatic void cleanup(void) 50f08c3bdfSopenharmony_ci{ 51f08c3bdfSopenharmony_ci tst_nodemap_free(nodes); 52f08c3bdfSopenharmony_ci} 53f08c3bdfSopenharmony_ci 54f08c3bdfSopenharmony_cistatic void verify_mempolicy(unsigned int node, int mode) 55f08c3bdfSopenharmony_ci{ 56f08c3bdfSopenharmony_ci struct bitmask *bm = numa_allocate_nodemask(); 57f08c3bdfSopenharmony_ci unsigned int i; 58f08c3bdfSopenharmony_ci 59f08c3bdfSopenharmony_ci numa_bitmask_setbit(bm, node); 60f08c3bdfSopenharmony_ci 61f08c3bdfSopenharmony_ci TEST(set_mempolicy(mode, bm->maskp, bm->size+1)); 62f08c3bdfSopenharmony_ci 63f08c3bdfSopenharmony_ci if (TST_RET) { 64f08c3bdfSopenharmony_ci tst_res(TFAIL | TTERRNO, 65f08c3bdfSopenharmony_ci "set_mempolicy(%s) node %u", 66f08c3bdfSopenharmony_ci tst_mempolicy_mode_name(mode), node); 67f08c3bdfSopenharmony_ci return; 68f08c3bdfSopenharmony_ci } 69f08c3bdfSopenharmony_ci 70f08c3bdfSopenharmony_ci tst_res(TPASS, "set_mempolicy(%s) node %u", 71f08c3bdfSopenharmony_ci tst_mempolicy_mode_name(mode), node); 72f08c3bdfSopenharmony_ci 73f08c3bdfSopenharmony_ci numa_free_nodemask(bm); 74f08c3bdfSopenharmony_ci 75f08c3bdfSopenharmony_ci const char *prefix = "child: "; 76f08c3bdfSopenharmony_ci 77f08c3bdfSopenharmony_ci if (SAFE_FORK()) { 78f08c3bdfSopenharmony_ci prefix = "parent: "; 79f08c3bdfSopenharmony_ci tst_reap_children(); 80f08c3bdfSopenharmony_ci } 81f08c3bdfSopenharmony_ci 82f08c3bdfSopenharmony_ci tst_nodemap_reset_counters(nodes); 83f08c3bdfSopenharmony_ci alloc_fault_count(nodes, NULL, PAGES_ALLOCATED * page_size); 84f08c3bdfSopenharmony_ci tst_nodemap_print_counters(nodes); 85f08c3bdfSopenharmony_ci 86f08c3bdfSopenharmony_ci for (i = 0; i < nodes->cnt; i++) { 87f08c3bdfSopenharmony_ci if (nodes->map[i] == node) { 88f08c3bdfSopenharmony_ci if (nodes->counters[i] == PAGES_ALLOCATED) { 89f08c3bdfSopenharmony_ci tst_res(TPASS, "%sNode %u allocated %u", 90f08c3bdfSopenharmony_ci prefix, node, PAGES_ALLOCATED); 91f08c3bdfSopenharmony_ci } else { 92f08c3bdfSopenharmony_ci tst_res(TFAIL, "%sNode %u allocated %u, expected %u", 93f08c3bdfSopenharmony_ci prefix, node, nodes->counters[i], 94f08c3bdfSopenharmony_ci PAGES_ALLOCATED); 95f08c3bdfSopenharmony_ci } 96f08c3bdfSopenharmony_ci continue; 97f08c3bdfSopenharmony_ci } 98f08c3bdfSopenharmony_ci 99f08c3bdfSopenharmony_ci if (nodes->counters[i]) { 100f08c3bdfSopenharmony_ci tst_res(TFAIL, "%sNode %u allocated %u, expected 0", 101f08c3bdfSopenharmony_ci prefix, i, nodes->counters[i]); 102f08c3bdfSopenharmony_ci } 103f08c3bdfSopenharmony_ci } 104f08c3bdfSopenharmony_ci} 105f08c3bdfSopenharmony_ci 106f08c3bdfSopenharmony_cistatic void verify_set_mempolicy(unsigned int n) 107f08c3bdfSopenharmony_ci{ 108f08c3bdfSopenharmony_ci unsigned int i; 109f08c3bdfSopenharmony_ci int mode = n ? MPOL_PREFERRED : MPOL_BIND; 110f08c3bdfSopenharmony_ci 111f08c3bdfSopenharmony_ci for (i = 0; i < nodes->cnt; i++) 112f08c3bdfSopenharmony_ci verify_mempolicy(nodes->map[i], mode); 113f08c3bdfSopenharmony_ci} 114f08c3bdfSopenharmony_ci 115f08c3bdfSopenharmony_cistatic struct tst_test test = { 116f08c3bdfSopenharmony_ci .setup = setup, 117f08c3bdfSopenharmony_ci .cleanup = cleanup, 118f08c3bdfSopenharmony_ci .test = verify_set_mempolicy, 119f08c3bdfSopenharmony_ci .tcnt = 2, 120f08c3bdfSopenharmony_ci .forks_child = 1, 121f08c3bdfSopenharmony_ci .needs_checkpoints = 1, 122f08c3bdfSopenharmony_ci .max_runtime = 600, 123f08c3bdfSopenharmony_ci}; 124f08c3bdfSopenharmony_ci 125f08c3bdfSopenharmony_ci#else 126f08c3bdfSopenharmony_ci 127f08c3bdfSopenharmony_ciTST_TEST_TCONF(NUMA_ERROR_MSG); 128f08c3bdfSopenharmony_ci 129f08c3bdfSopenharmony_ci#endif /* HAVE_NUMA_V2 */ 130