1f08c3bdfSopenharmony_ci// SPDX-License-Identifier: GPL-2.0-or-later 2f08c3bdfSopenharmony_ci/* 3f08c3bdfSopenharmony_ci * Copyright (c) 2019 Cyril Hrubis <chrubis@suse.cz> 4f08c3bdfSopenharmony_ci */ 5f08c3bdfSopenharmony_ci 6f08c3bdfSopenharmony_ci/* 7f08c3bdfSopenharmony_ci * We are testing mbind() MPOL_MF_MOVE and MPOL_MF_MOVE_ALL. 8f08c3bdfSopenharmony_ci * 9f08c3bdfSopenharmony_ci * If one of these flags is passed along with the policy kernel attempts to 10f08c3bdfSopenharmony_ci * move already faulted pages to match the requested policy. 11f08c3bdfSopenharmony_ci */ 12f08c3bdfSopenharmony_ci 13f08c3bdfSopenharmony_ci#include <errno.h> 14f08c3bdfSopenharmony_ci#include "config.h" 15f08c3bdfSopenharmony_ci#ifdef HAVE_NUMA_H 16f08c3bdfSopenharmony_ci# include <numa.h> 17f08c3bdfSopenharmony_ci# include <numaif.h> 18f08c3bdfSopenharmony_ci# include "mbind.h" 19f08c3bdfSopenharmony_ci#endif 20f08c3bdfSopenharmony_ci#include "tst_test.h" 21f08c3bdfSopenharmony_ci#include "tst_numa.h" 22f08c3bdfSopenharmony_ci 23f08c3bdfSopenharmony_ci#ifdef HAVE_NUMA_V2 24f08c3bdfSopenharmony_ci 25f08c3bdfSopenharmony_cistatic size_t page_size; 26f08c3bdfSopenharmony_cistatic struct tst_nodemap *nodes; 27f08c3bdfSopenharmony_ci 28f08c3bdfSopenharmony_cistatic void setup(void) 29f08c3bdfSopenharmony_ci{ 30f08c3bdfSopenharmony_ci page_size = getpagesize(); 31f08c3bdfSopenharmony_ci 32f08c3bdfSopenharmony_ci nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * page_size / 1024); 33f08c3bdfSopenharmony_ci if (nodes->cnt <= 1) 34f08c3bdfSopenharmony_ci tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 35f08c3bdfSopenharmony_ci} 36f08c3bdfSopenharmony_ci 37f08c3bdfSopenharmony_cistatic void cleanup(void) 38f08c3bdfSopenharmony_ci{ 39f08c3bdfSopenharmony_ci tst_nodemap_free(nodes); 40f08c3bdfSopenharmony_ci} 41f08c3bdfSopenharmony_ci 42f08c3bdfSopenharmony_cistatic void verify_policy(int mode, unsigned flag) 43f08c3bdfSopenharmony_ci{ 44f08c3bdfSopenharmony_ci struct bitmask *bm = numa_allocate_nodemask(); 45f08c3bdfSopenharmony_ci unsigned int i; 46f08c3bdfSopenharmony_ci void *ptr; 47f08c3bdfSopenharmony_ci unsigned long size = page_size; 48f08c3bdfSopenharmony_ci unsigned int node = 0; 49f08c3bdfSopenharmony_ci 50f08c3bdfSopenharmony_ci ptr = tst_numa_map(NULL, size); 51f08c3bdfSopenharmony_ci tst_nodemap_reset_counters(nodes); 52f08c3bdfSopenharmony_ci tst_numa_fault(ptr, size); 53f08c3bdfSopenharmony_ci tst_nodemap_count_pages(nodes, ptr, size); 54f08c3bdfSopenharmony_ci tst_nodemap_print_counters(nodes); 55f08c3bdfSopenharmony_ci 56f08c3bdfSopenharmony_ci for (i = 0; i < nodes->cnt; i++) { 57f08c3bdfSopenharmony_ci if (!nodes->counters[i]) { 58f08c3bdfSopenharmony_ci node = nodes->map[i]; 59f08c3bdfSopenharmony_ci tst_res(TINFO, "Attempting to move to node %i", node); 60f08c3bdfSopenharmony_ci numa_bitmask_setbit(bm, node); 61f08c3bdfSopenharmony_ci break; 62f08c3bdfSopenharmony_ci } 63f08c3bdfSopenharmony_ci } 64f08c3bdfSopenharmony_ci 65f08c3bdfSopenharmony_ci TEST(mbind(ptr, size, mode, bm->maskp, bm->size + 1, flag)); 66f08c3bdfSopenharmony_ci 67f08c3bdfSopenharmony_ci if (TST_RET) { 68f08c3bdfSopenharmony_ci tst_res(TFAIL | TTERRNO, 69f08c3bdfSopenharmony_ci "mbind(%s, %s) node %u", 70f08c3bdfSopenharmony_ci tst_mempolicy_mode_name(mode), mbind_flag_name(flag), node); 71f08c3bdfSopenharmony_ci goto exit; 72f08c3bdfSopenharmony_ci } else { 73f08c3bdfSopenharmony_ci tst_res(TPASS, "mbind(%s, %s) node %u succeded", 74f08c3bdfSopenharmony_ci tst_mempolicy_mode_name(mode), mbind_flag_name(flag), node); 75f08c3bdfSopenharmony_ci } 76f08c3bdfSopenharmony_ci 77f08c3bdfSopenharmony_ci tst_nodemap_reset_counters(nodes); 78f08c3bdfSopenharmony_ci tst_nodemap_count_pages(nodes, ptr, size); 79f08c3bdfSopenharmony_ci 80f08c3bdfSopenharmony_ci for (i = 0; i < nodes->cnt; i++) { 81f08c3bdfSopenharmony_ci if (nodes->map[i] == node) { 82f08c3bdfSopenharmony_ci if (nodes->counters[i] == 1) { 83f08c3bdfSopenharmony_ci tst_res(TPASS, "Node %u allocated %u", node, 1); 84f08c3bdfSopenharmony_ci } else { 85f08c3bdfSopenharmony_ci tst_res(TFAIL, "Node %u allocated %u, expected %u", 86f08c3bdfSopenharmony_ci node, nodes->counters[i], 0); 87f08c3bdfSopenharmony_ci } 88f08c3bdfSopenharmony_ci continue; 89f08c3bdfSopenharmony_ci } 90f08c3bdfSopenharmony_ci 91f08c3bdfSopenharmony_ci if (nodes->counters[i]) { 92f08c3bdfSopenharmony_ci tst_res(TFAIL, "Node %u allocated %u, expected 0", 93f08c3bdfSopenharmony_ci i, nodes->counters[i]); 94f08c3bdfSopenharmony_ci } 95f08c3bdfSopenharmony_ci } 96f08c3bdfSopenharmony_ci 97f08c3bdfSopenharmony_ciexit: 98f08c3bdfSopenharmony_ci tst_numa_unmap(ptr, size); 99f08c3bdfSopenharmony_ci numa_free_nodemask(bm); 100f08c3bdfSopenharmony_ci} 101f08c3bdfSopenharmony_ci 102f08c3bdfSopenharmony_cistatic const int modes[] = { 103f08c3bdfSopenharmony_ci MPOL_PREFERRED, 104f08c3bdfSopenharmony_ci MPOL_BIND, 105f08c3bdfSopenharmony_ci MPOL_INTERLEAVE, 106f08c3bdfSopenharmony_ci}; 107f08c3bdfSopenharmony_ci 108f08c3bdfSopenharmony_cistatic void verify_mbind(unsigned int n) 109f08c3bdfSopenharmony_ci{ 110f08c3bdfSopenharmony_ci verify_policy(modes[n], MPOL_MF_MOVE); 111f08c3bdfSopenharmony_ci verify_policy(modes[n], MPOL_MF_MOVE_ALL); 112f08c3bdfSopenharmony_ci} 113f08c3bdfSopenharmony_ci 114f08c3bdfSopenharmony_cistatic struct tst_test test = { 115f08c3bdfSopenharmony_ci .setup = setup, 116f08c3bdfSopenharmony_ci .cleanup = cleanup, 117f08c3bdfSopenharmony_ci .test = verify_mbind, 118f08c3bdfSopenharmony_ci .tcnt = ARRAY_SIZE(modes), 119f08c3bdfSopenharmony_ci .needs_root = 1, 120f08c3bdfSopenharmony_ci}; 121f08c3bdfSopenharmony_ci 122f08c3bdfSopenharmony_ci#else 123f08c3bdfSopenharmony_ci 124f08c3bdfSopenharmony_ciTST_TEST_TCONF(NUMA_ERROR_MSG); 125f08c3bdfSopenharmony_ci 126f08c3bdfSopenharmony_ci#endif /* HAVE_NUMA_H */ 127