1 // SPDX-License-Identifier: GPL-2.0
5 * numa: Simulate NUMA-sensitive workload and measure their NUMA performance
9 /* For the CLR_() macros */
12 #include <subcmd/parse-options.h>
13 #include "../util/cloexec.h"
28 #include <sys/resource.h>
30 #include <sys/prctl.h>
31 #include <sys/types.h>
32 #include <linux/kernel.h>
33 #include <linux/time64.h>
34 #include <linux/numa.h>
35 #include <linux/zalloc.h>
41 # define RUSAGE_THREAD 1
45 * Regular printout to the terminal, suppressed if -q is specified:
47 #define tprintf(x...) do { if (g && g->p.show_details >= 0) printf(x); } while (0)
53 #define dprintf(x...) do { if (g && g->p.show_details >= 1) printf(x); } while (0)
57 cpu_set_t bind_cpumask;
63 unsigned int loops_done;
69 pthread_mutex_t *process_lock;
72 /* Parameters set by options: */
75 /* Startup synchronization: */
76 bool serialize_startup;
82 /* Working set sizes: */
83 const char *mb_global_str;
84 const char *mb_proc_str;
85 const char *mb_proc_locked_str;
86 const char *mb_thread_str;
90 double mb_proc_locked;
93 /* Access patterns to the working set: */
97 bool data_zero_memset;
103 /* Working set initialization: */
115 long bytes_process_locked;
121 bool show_convergence;
122 bool measure_convergence;
128 /* Affinity options -C and -N: */
134 /* Global, read-writable area, accessible to all processes and threads: */
139 pthread_mutex_t startup_mutex;
140 pthread_cond_t startup_cond;
141 int nr_tasks_started;
143 pthread_mutex_t start_work_mutex;
144 pthread_cond_t start_work_cond;
145 int nr_tasks_working;
148 pthread_mutex_t stop_work_mutex;
151 struct thread_data *threads;
153 /* Convergence latency measurement: */
162 static struct global_info *g = NULL;
164 static int parse_cpus_opt(const struct option *opt, const char *arg, int unset);
165 static int parse_nodes_opt(const struct option *opt, const char *arg, int unset);
169 static const struct option options[] = {
170 OPT_INTEGER('p', "nr_proc" , &p0.nr_proc, "number of processes"),
171 OPT_INTEGER('t', "nr_threads" , &p0.nr_threads, "number of threads per process"),
173 OPT_STRING('G', "mb_global" , &p0.mb_global_str, "MB", "global memory (MBs)"),
174 OPT_STRING('P', "mb_proc" , &p0.mb_proc_str, "MB", "process memory (MBs)"),
175 OPT_STRING('L', "mb_proc_locked", &p0.mb_proc_locked_str,"MB", "process serialized/locked memory access (MBs), <= process_memory"),
176 OPT_STRING('T', "mb_thread" , &p0.mb_thread_str, "MB", "thread memory (MBs)"),
178 OPT_UINTEGER('l', "nr_loops" , &p0.nr_loops, "max number of loops to run (default: unlimited)"),
179 OPT_UINTEGER('s', "nr_secs" , &p0.nr_secs, "max number of seconds to run (default: 5 secs)"),
180 OPT_UINTEGER('u', "usleep" , &p0.sleep_usecs, "usecs to sleep per loop iteration"),
182 OPT_BOOLEAN('R', "data_reads" , &p0.data_reads, "access the data via reads (can be mixed with -W)"),
183 OPT_BOOLEAN('W', "data_writes" , &p0.data_writes, "access the data via writes (can be mixed with -R)"),
184 OPT_BOOLEAN('B', "data_backwards", &p0.data_backwards, "access the data backwards as well"),
185 OPT_BOOLEAN('Z', "data_zero_memset", &p0.data_zero_memset,"access the data via glibc bzero only"),
186 OPT_BOOLEAN('r', "data_rand_walk", &p0.data_rand_walk, "access the data with random (32bit LFSR) walk"),
189 OPT_BOOLEAN('z', "init_zero" , &p0.init_zero, "bzero the initial allocations"),
190 OPT_BOOLEAN('I', "init_random" , &p0.init_random, "randomize the contents of the initial allocations"),
191 OPT_BOOLEAN('0', "init_cpu0" , &p0.init_cpu0, "do the initial allocations on CPU#0"),
192 OPT_INTEGER('x', "perturb_secs", &p0.perturb_secs, "perturb thread 0/0 every X secs, to test convergence stability"),
194 OPT_INCR ('d', "show_details" , &p0.show_details, "Show details"),
195 OPT_INCR ('a', "all" , &p0.run_all, "Run all tests in the suite"),
196 OPT_INTEGER('H', "thp" , &p0.thp, "MADV_NOHUGEPAGE < 0 < MADV_HUGEPAGE"),
197 OPT_BOOLEAN('c', "show_convergence", &p0.show_convergence, "show convergence details, "
198 "convergence is reached when each process (all its threads) is running on a single NUMA node."),
199 OPT_BOOLEAN('m', "measure_convergence", &p0.measure_convergence, "measure convergence latency"),
200 OPT_BOOLEAN('q', "quiet" , &p0.show_quiet, "quiet mode"),
201 OPT_BOOLEAN('S', "serialize-startup", &p0.serialize_startup,"serialize thread startup"),
203 /* Special option string parsing callbacks: */
204 OPT_CALLBACK('C', "cpus", NULL, "cpu[,cpu2,...cpuN]",
205 "bind the first N tasks to these specific cpus (the rest is unbound)",
207 OPT_CALLBACK('M', "memnodes", NULL, "node[,node2,...nodeN]",
208 "bind the first N tasks to these specific memory nodes (the rest is unbound)",
213 static const char * const bench_numa_usage[] = {
214 "perf bench numa <options>",
218 static const char * const numa_usage[] = {
219 "perf bench numa mem [<options>]",
224 * To get number of numa nodes present.
226 static int nr_numa_nodes(void)
230 for (i = 0; i < g->p.nr_nodes; i++) {
231 if (numa_bitmask_isbitset(numa_nodes_ptr, i))
239 * To check if given numa node is present.
241 static int is_node_present(int node)
243 return numa_bitmask_isbitset(numa_nodes_ptr, node);
247 * To check given numa node has cpus.
249 static bool node_has_cpus(int node)
251 struct bitmask *cpumask = numa_allocate_cpumask();
252 bool ret = false; /* fall back to nocpus */
256 if (!numa_node_to_cpus(node, cpumask)) {
257 for (cpu = 0; cpu < (int)cpumask->size; cpu++) {
258 if (numa_bitmask_isbitset(cpumask, cpu)) {
264 numa_free_cpumask(cpumask);
269 static cpu_set_t bind_to_cpu(int target_cpu)
271 cpu_set_t orig_mask, mask;
274 ret = sched_getaffinity(0, sizeof(orig_mask), &orig_mask);
279 if (target_cpu == -1) {
282 for (cpu = 0; cpu < g->p.nr_cpus; cpu++)
285 BUG_ON(target_cpu < 0 || target_cpu >= g->p.nr_cpus);
286 CPU_SET(target_cpu, &mask);
289 ret = sched_setaffinity(0, sizeof(mask), &mask);
295 static cpu_set_t bind_to_node(int target_node)
297 cpu_set_t orig_mask, mask;
301 ret = sched_getaffinity(0, sizeof(orig_mask), &orig_mask);
306 if (target_node == NUMA_NO_NODE) {
307 for (cpu = 0; cpu < g->p.nr_cpus; cpu++)
310 struct bitmask *cpumask = numa_allocate_cpumask();
313 if (!numa_node_to_cpus(target_node, cpumask)) {
314 for (cpu = 0; cpu < (int)cpumask->size; cpu++) {
315 if (numa_bitmask_isbitset(cpumask, cpu))
319 numa_free_cpumask(cpumask);
322 ret = sched_setaffinity(0, sizeof(mask), &mask);
328 static void bind_to_cpumask(cpu_set_t mask)
332 ret = sched_setaffinity(0, sizeof(mask), &mask);
336 static void mempol_restore(void)
340 ret = set_mempolicy(MPOL_DEFAULT, NULL, g->p.nr_nodes-1);
345 static void bind_to_memnode(int node)
347 struct bitmask *node_mask;
350 if (node == NUMA_NO_NODE)
353 node_mask = numa_allocate_nodemask();
356 numa_bitmask_clearall(node_mask);
357 numa_bitmask_setbit(node_mask, node);
359 ret = set_mempolicy(MPOL_BIND, node_mask->maskp, node_mask->size + 1);
360 dprintf("binding to node %d, mask: %016lx => %d\n", node, *node_mask->maskp, ret);
362 numa_bitmask_free(node_mask);
366 #define HPSIZE (2*1024*1024)
368 #define set_taskname(fmt...) \
372 snprintf(name, 20, fmt); \
373 prctl(PR_SET_NAME, name); \
376 static u8 *alloc_data(ssize_t bytes0, int map_flags,
377 int init_zero, int init_cpu0, int thp, int init_random)
387 /* Allocate and initialize all memory on CPU#0: */
389 int node = numa_node_of_cpu(0);
391 orig_mask = bind_to_node(node);
392 bind_to_memnode(node);
395 bytes = bytes0 + HPSIZE;
397 buf = (void *)mmap(0, bytes, PROT_READ|PROT_WRITE, MAP_ANON|map_flags, -1, 0);
398 BUG_ON(buf == (void *)-1);
400 if (map_flags == MAP_PRIVATE) {
402 ret = madvise(buf, bytes, MADV_HUGEPAGE);
403 if (ret && !g->print_once) {
405 printf("WARNING: Could not enable THP - do: 'echo madvise > /sys/kernel/mm/transparent_hugepage/enabled'\n");
409 ret = madvise(buf, bytes, MADV_NOHUGEPAGE);
410 if (ret && !g->print_once) {
412 printf("WARNING: Could not disable THP: run a CONFIG_TRANSPARENT_HUGEPAGE kernel?\n");
420 /* Initialize random contents, different in each word: */
422 u64 *wbuf = (void *)buf;
426 for (i = 0; i < bytes/8; i++)
431 /* Align to 2MB boundary: */
432 buf = (void *)(((unsigned long)buf + HPSIZE-1) & ~(HPSIZE-1));
434 /* Restore affinity: */
436 bind_to_cpumask(orig_mask);
443 static void free_data(void *data, ssize_t bytes)
450 ret = munmap(data, bytes);
455 * Create a shared memory buffer that can be shared between processes, zeroed:
457 static void * zalloc_shared_data(ssize_t bytes)
459 return alloc_data(bytes, MAP_SHARED, 1, g->p.init_cpu0, g->p.thp, g->p.init_random);
463 * Create a shared memory buffer that can be shared between processes:
465 static void * setup_shared_data(ssize_t bytes)
467 return alloc_data(bytes, MAP_SHARED, 0, g->p.init_cpu0, g->p.thp, g->p.init_random);
471 * Allocate process-local memory - this will either be shared between
472 * threads of this process, or only be accessed by this thread:
474 static void * setup_private_data(ssize_t bytes)
476 return alloc_data(bytes, MAP_PRIVATE, 0, g->p.init_cpu0, g->p.thp, g->p.init_random);
480 * Return a process-shared (global) mutex:
482 static void init_global_mutex(pthread_mutex_t *mutex)
484 pthread_mutexattr_t attr;
486 pthread_mutexattr_init(&attr);
487 pthread_mutexattr_setpshared(&attr, PTHREAD_PROCESS_SHARED);
488 pthread_mutex_init(mutex, &attr);
492 * Return a process-shared (global) condition variable:
494 static void init_global_cond(pthread_cond_t *cond)
496 pthread_condattr_t attr;
498 pthread_condattr_init(&attr);
499 pthread_condattr_setpshared(&attr, PTHREAD_PROCESS_SHARED);
500 pthread_cond_init(cond, &attr);
503 static int parse_cpu_list(const char *arg)
505 p0.cpu_list_str = strdup(arg);
507 dprintf("got CPU list: {%s}\n", p0.cpu_list_str);
512 static int parse_setup_cpu_list(void)
514 struct thread_data *td;
518 if (!g->p.cpu_list_str)
521 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
523 str0 = str = strdup(g->p.cpu_list_str);
528 tprintf("# binding tasks to CPUs:\n");
532 int bind_cpu, bind_cpu_0, bind_cpu_1;
533 char *tok, *tok_end, *tok_step, *tok_len, *tok_mul;
538 tok = strsep(&str, ",");
542 tok_end = strstr(tok, "-");
544 dprintf("\ntoken: {%s}, end: {%s}\n", tok, tok_end);
546 /* Single CPU specified: */
547 bind_cpu_0 = bind_cpu_1 = atol(tok);
549 /* CPU range specified (for example: "5-11"): */
550 bind_cpu_0 = atol(tok);
551 bind_cpu_1 = atol(tok_end + 1);
555 tok_step = strstr(tok, "#");
557 step = atol(tok_step + 1);
558 BUG_ON(step <= 0 || step >= g->p.nr_cpus);
563 * Eg: "--cpus 8_4-16#4" means: '--cpus 8_4,12_4,16_4',
564 * where the _4 means the next 4 CPUs are allowed.
567 tok_len = strstr(tok, "_");
569 bind_len = atol(tok_len + 1);
570 BUG_ON(bind_len <= 0 || bind_len > g->p.nr_cpus);
573 /* Multiplicator shortcut, "0x8" is a shortcut for: "0,0,0,0,0,0,0,0" */
575 tok_mul = strstr(tok, "x");
577 mul = atol(tok_mul + 1);
581 dprintf("CPUs: %d_%d-%d#%dx%d\n", bind_cpu_0, bind_len, bind_cpu_1, step, mul);
583 if (bind_cpu_0 >= g->p.nr_cpus || bind_cpu_1 >= g->p.nr_cpus) {
584 printf("\nTest not applicable, system has only %d CPUs.\n", g->p.nr_cpus);
588 BUG_ON(bind_cpu_0 < 0 || bind_cpu_1 < 0);
589 BUG_ON(bind_cpu_0 > bind_cpu_1);
591 for (bind_cpu = bind_cpu_0; bind_cpu <= bind_cpu_1; bind_cpu += step) {
594 for (i = 0; i < mul; i++) {
597 if (t >= g->p.nr_tasks) {
598 printf("\n# NOTE: ignoring bind CPUs starting at CPU#%d\n #", bind_cpu);
606 tprintf("%2d/%d", bind_cpu, bind_len);
608 tprintf("%2d", bind_cpu);
611 CPU_ZERO(&td->bind_cpumask);
612 for (cpu = bind_cpu; cpu < bind_cpu+bind_len; cpu++) {
613 BUG_ON(cpu < 0 || cpu >= g->p.nr_cpus);
614 CPU_SET(cpu, &td->bind_cpumask);
624 if (t < g->p.nr_tasks)
625 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
631 static int parse_cpus_opt(const struct option *opt __maybe_unused,
632 const char *arg, int unset __maybe_unused)
637 return parse_cpu_list(arg);
640 static int parse_node_list(const char *arg)
642 p0.node_list_str = strdup(arg);
644 dprintf("got NODE list: {%s}\n", p0.node_list_str);
649 static int parse_setup_node_list(void)
651 struct thread_data *td;
655 if (!g->p.node_list_str)
658 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
660 str0 = str = strdup(g->p.node_list_str);
665 tprintf("# binding tasks to NODEs:\n");
669 int bind_node, bind_node_0, bind_node_1;
670 char *tok, *tok_end, *tok_step, *tok_mul;
674 tok = strsep(&str, ",");
678 tok_end = strstr(tok, "-");
680 dprintf("\ntoken: {%s}, end: {%s}\n", tok, tok_end);
682 /* Single NODE specified: */
683 bind_node_0 = bind_node_1 = atol(tok);
685 /* NODE range specified (for example: "5-11"): */
686 bind_node_0 = atol(tok);
687 bind_node_1 = atol(tok_end + 1);
691 tok_step = strstr(tok, "#");
693 step = atol(tok_step + 1);
694 BUG_ON(step <= 0 || step >= g->p.nr_nodes);
697 /* Multiplicator shortcut, "0x8" is a shortcut for: "0,0,0,0,0,0,0,0" */
699 tok_mul = strstr(tok, "x");
701 mul = atol(tok_mul + 1);
705 dprintf("NODEs: %d-%d #%d\n", bind_node_0, bind_node_1, step);
707 if (bind_node_0 >= g->p.nr_nodes || bind_node_1 >= g->p.nr_nodes) {
708 printf("\nTest not applicable, system has only %d nodes.\n", g->p.nr_nodes);
712 BUG_ON(bind_node_0 < 0 || bind_node_1 < 0);
713 BUG_ON(bind_node_0 > bind_node_1);
715 for (bind_node = bind_node_0; bind_node <= bind_node_1; bind_node += step) {
718 for (i = 0; i < mul; i++) {
719 if (t >= g->p.nr_tasks || !node_has_cpus(bind_node)) {
720 printf("\n# NOTE: ignoring bind NODEs starting at NODE#%d\n", bind_node);
726 tprintf(" %2d", bind_node);
728 tprintf(",%2d", bind_node);
730 td->bind_node = bind_node;
739 if (t < g->p.nr_tasks)
740 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
746 static int parse_nodes_opt(const struct option *opt __maybe_unused,
747 const char *arg, int unset __maybe_unused)
752 return parse_node_list(arg);
755 #define BIT(x) (1ul << x)
757 static inline uint32_t lfsr_32(uint32_t lfsr)
759 const uint32_t taps = BIT(1) | BIT(5) | BIT(6) | BIT(31);
760 return (lfsr>>1) ^ ((0x0u - (lfsr & 0x1u)) & taps);
764 * Make sure there's real data dependency to RAM (when read
765 * accesses are enabled), so the compiler, the CPU and the
766 * kernel (KSM, zero page, etc.) cannot optimize away RAM
769 static inline u64 access_data(u64 *data, u64 val)
773 if (g->p.data_writes)
779 * The worker process does two types of work, a forwards going
780 * loop and a backwards going loop.
782 * We do this so that on multiprocessor systems we do not create
783 * a 'train' of processing, with highly synchronized processes,
784 * skewing the whole benchmark.
786 static u64 do_work(u8 *__data, long bytes, int nr, int nr_max, int loop, u64 val)
788 long words = bytes/sizeof(u64);
789 u64 *data = (void *)__data;
790 long chunk_0, chunk_1;
795 BUG_ON(!data && words);
796 BUG_ON(data && !words);
801 /* Very simple memset() work variant: */
802 if (g->p.data_zero_memset && !g->p.data_rand_walk) {
807 /* Spread out by PID/TID nr and by loop nr: */
808 chunk_0 = words/nr_max;
809 chunk_1 = words/g->p.nr_loops;
810 off = nr*chunk_0 + loop*chunk_1;
815 if (g->p.data_rand_walk) {
816 u32 lfsr = nr + loop + val;
819 for (i = 0; i < words/1024; i++) {
822 lfsr = lfsr_32(lfsr);
824 start = lfsr % words;
825 end = min(start + 1024, words-1);
827 if (g->p.data_zero_memset) {
828 bzero(data + start, (end-start) * sizeof(u64));
830 for (j = start; j < end; j++)
831 val = access_data(data + j, val);
834 } else if (!g->p.data_backwards || (nr + loop) & 1) {
835 /* Process data forwards: */
842 if (unlikely(d >= d1))
844 if (unlikely(d == d0))
847 val = access_data(d, val);
852 /* Process data backwards: */
859 if (unlikely(d < data))
861 if (unlikely(d == d0))
864 val = access_data(d, val);
873 static void update_curr_cpu(int task_nr, unsigned long bytes_worked)
877 cpu = sched_getcpu();
879 g->threads[task_nr].curr_cpu = cpu;
880 prctl(0, bytes_worked);
884 * Count the number of nodes a process's threads
887 * A count of 1 means that the process is compressed
888 * to a single node. A count of g->p.nr_nodes means it's
889 * spread out on the whole system.
891 static int count_process_nodes(int process_nr)
897 node_present = (char *)malloc(g->p.nr_nodes * sizeof(char));
898 BUG_ON(!node_present);
899 for (nodes = 0; nodes < g->p.nr_nodes; nodes++)
900 node_present[nodes] = 0;
902 for (t = 0; t < g->p.nr_threads; t++) {
903 struct thread_data *td;
907 task_nr = process_nr*g->p.nr_threads + t;
908 td = g->threads + task_nr;
910 node = numa_node_of_cpu(td->curr_cpu);
911 if (node < 0) /* curr_cpu was likely still -1 */ {
916 node_present[node] = 1;
921 for (n = 0; n < g->p.nr_nodes; n++)
922 nodes += node_present[n];
929 * Count the number of distinct process-threads a node contains.
931 * A count of 1 means that the node contains only a single
932 * process. If all nodes on the system contain at most one
933 * process then we are well-converged.
935 static int count_node_processes(int node)
940 for (p = 0; p < g->p.nr_proc; p++) {
941 for (t = 0; t < g->p.nr_threads; t++) {
942 struct thread_data *td;
946 task_nr = p*g->p.nr_threads + t;
947 td = g->threads + task_nr;
949 n = numa_node_of_cpu(td->curr_cpu);
960 static void calc_convergence_compression(int *strong)
962 unsigned int nodes_min, nodes_max;
968 for (p = 0; p < g->p.nr_proc; p++) {
969 unsigned int nodes = count_process_nodes(p);
976 nodes_min = min(nodes, nodes_min);
977 nodes_max = max(nodes, nodes_max);
980 /* Strong convergence: all threads compress on a single node: */
981 if (nodes_min == 1 && nodes_max == 1) {
985 tprintf(" {%d-%d}", nodes_min, nodes_max);
989 static void calc_convergence(double runtime_ns_max, double *convergence)
991 unsigned int loops_done_min, loops_done_max;
1004 if (!g->p.show_convergence && !g->p.measure_convergence)
1007 nodes = (int *)malloc(g->p.nr_nodes * sizeof(int));
1009 for (node = 0; node < g->p.nr_nodes; node++)
1012 loops_done_min = -1;
1015 for (t = 0; t < g->p.nr_tasks; t++) {
1016 struct thread_data *td = g->threads + t;
1017 unsigned int loops_done;
1021 /* Not all threads have written it yet: */
1025 node = numa_node_of_cpu(cpu);
1029 loops_done = td->loops_done;
1030 loops_done_min = min(loops_done, loops_done_min);
1031 loops_done_max = max(loops_done, loops_done_max);
1035 nr_min = g->p.nr_tasks;
1038 for (node = 0; node < g->p.nr_nodes; node++) {
1039 if (!is_node_present(node))
1042 nr_min = min(nr, nr_min);
1043 nr_max = max(nr, nr_max);
1046 BUG_ON(nr_min > nr_max);
1048 BUG_ON(sum > g->p.nr_tasks);
1050 if (0 && (sum < g->p.nr_tasks)) {
1056 * Count the number of distinct process groups present
1057 * on nodes - when we are converged this will decrease
1062 for (node = 0; node < g->p.nr_nodes; node++) {
1065 if (!is_node_present(node))
1067 processes = count_node_processes(node);
1069 tprintf(" %2d/%-2d", nr, processes);
1071 process_groups += processes;
1074 distance = nr_max - nr_min;
1076 tprintf(" [%2d/%-2d]", distance, process_groups);
1078 tprintf(" l:%3d-%-3d (%3d)",
1079 loops_done_min, loops_done_max, loops_done_max-loops_done_min);
1081 if (loops_done_min && loops_done_max) {
1082 double skew = 1.0 - (double)loops_done_min/loops_done_max;
1084 tprintf(" [%4.1f%%]", skew * 100.0);
1087 calc_convergence_compression(&strong);
1089 if (strong && process_groups == g->p.nr_proc) {
1090 if (!*convergence) {
1091 *convergence = runtime_ns_max;
1092 tprintf(" (%6.1fs converged)\n", *convergence / NSEC_PER_SEC);
1093 if (g->p.measure_convergence) {
1094 g->all_converged = true;
1095 g->stop_work = true;
1100 tprintf(" (%6.1fs de-converged)", runtime_ns_max / NSEC_PER_SEC);
1109 static void show_summary(double runtime_ns_max, int l, double *convergence)
1111 tprintf("\r # %5.1f%% [%.1f mins]",
1112 (double)(l+1)/g->p.nr_loops*100.0, runtime_ns_max / NSEC_PER_SEC / 60.0);
1114 calc_convergence(runtime_ns_max, convergence);
1116 if (g->p.show_details >= 0)
1120 static void *worker_thread(void *__tdata)
1122 struct thread_data *td = __tdata;
1123 struct timeval start0, start, stop, diff;
1124 int process_nr = td->process_nr;
1125 int thread_nr = td->thread_nr;
1126 unsigned long last_perturbance;
1127 int task_nr = td->task_nr;
1128 int details = g->p.show_details;
1129 int first_task, last_task;
1130 double convergence = 0;
1132 double runtime_ns_max;
1136 u64 bytes_done, secs;
1139 struct rusage rusage;
1141 bind_to_cpumask(td->bind_cpumask);
1142 bind_to_memnode(td->bind_node);
1144 set_taskname("thread %d/%d", process_nr, thread_nr);
1146 global_data = g->data;
1147 process_data = td->process_data;
1148 thread_data = setup_private_data(g->p.bytes_thread);
1153 if (process_nr == g->p.nr_proc-1 && thread_nr == g->p.nr_threads-1)
1157 if (process_nr == 0 && thread_nr == 0)
1161 printf("# thread %2d / %2d global mem: %p, process mem: %p, thread mem: %p\n",
1162 process_nr, thread_nr, global_data, process_data, thread_data);
1165 if (g->p.serialize_startup) {
1166 pthread_mutex_lock(&g->startup_mutex);
1167 g->nr_tasks_started++;
1168 /* The last thread wakes the main process. */
1169 if (g->nr_tasks_started == g->p.nr_tasks)
1170 pthread_cond_signal(&g->startup_cond);
1172 pthread_mutex_unlock(&g->startup_mutex);
1174 /* Here we will wait for the main process to start us all at once: */
1175 pthread_mutex_lock(&g->start_work_mutex);
1176 g->start_work = false;
1177 g->nr_tasks_working++;
1178 while (!g->start_work)
1179 pthread_cond_wait(&g->start_work_cond, &g->start_work_mutex);
1181 pthread_mutex_unlock(&g->start_work_mutex);
1184 gettimeofday(&start0, NULL);
1186 start = stop = start0;
1187 last_perturbance = start.tv_sec;
1189 for (l = 0; l < g->p.nr_loops; l++) {
1195 val += do_work(global_data, g->p.bytes_global, process_nr, g->p.nr_proc, l, val);
1196 val += do_work(process_data, g->p.bytes_process, thread_nr, g->p.nr_threads, l, val);
1197 val += do_work(thread_data, g->p.bytes_thread, 0, 1, l, val);
1199 if (g->p.sleep_usecs) {
1200 pthread_mutex_lock(td->process_lock);
1201 usleep(g->p.sleep_usecs);
1202 pthread_mutex_unlock(td->process_lock);
1205 * Amount of work to be done under a process-global lock:
1207 if (g->p.bytes_process_locked) {
1208 pthread_mutex_lock(td->process_lock);
1209 val += do_work(process_data, g->p.bytes_process_locked, thread_nr, g->p.nr_threads, l, val);
1210 pthread_mutex_unlock(td->process_lock);
1213 work_done = g->p.bytes_global + g->p.bytes_process +
1214 g->p.bytes_process_locked + g->p.bytes_thread;
1216 update_curr_cpu(task_nr, work_done);
1217 bytes_done += work_done;
1219 if (details < 0 && !g->p.perturb_secs && !g->p.measure_convergence && !g->p.nr_secs)
1224 gettimeofday(&stop, NULL);
1226 /* Check whether our max runtime timed out: */
1228 timersub(&stop, &start0, &diff);
1229 if ((u32)diff.tv_sec >= g->p.nr_secs) {
1230 g->stop_work = true;
1235 /* Update the summary at most once per second: */
1236 if (start.tv_sec == stop.tv_sec)
1240 * Perturb the first task's equilibrium every g->p.perturb_secs seconds,
1241 * by migrating to CPU#0:
1243 if (first_task && g->p.perturb_secs && (int)(stop.tv_sec - last_perturbance) >= g->p.perturb_secs) {
1244 cpu_set_t orig_mask;
1248 last_perturbance = stop.tv_sec;
1251 * Depending on where we are running, move into
1252 * the other half of the system, to create some
1255 this_cpu = g->threads[task_nr].curr_cpu;
1256 if (this_cpu < g->p.nr_cpus/2)
1257 target_cpu = g->p.nr_cpus-1;
1261 orig_mask = bind_to_cpu(target_cpu);
1263 /* Here we are running on the target CPU already */
1265 printf(" (injecting perturbalance, moved to CPU#%d)\n", target_cpu);
1267 bind_to_cpumask(orig_mask);
1271 timersub(&stop, &start, &diff);
1272 runtime_ns_max = diff.tv_sec * NSEC_PER_SEC;
1273 runtime_ns_max += diff.tv_usec * NSEC_PER_USEC;
1276 printf(" #%2d / %2d: %14.2lf nsecs/op [val: %016"PRIx64"]\n",
1277 process_nr, thread_nr, runtime_ns_max / bytes_done, val);
1284 timersub(&stop, &start0, &diff);
1285 runtime_ns_max = diff.tv_sec * NSEC_PER_SEC;
1286 runtime_ns_max += diff.tv_usec * NSEC_PER_USEC;
1288 show_summary(runtime_ns_max, l, &convergence);
1291 gettimeofday(&stop, NULL);
1292 timersub(&stop, &start0, &diff);
1293 td->runtime_ns = diff.tv_sec * NSEC_PER_SEC;
1294 td->runtime_ns += diff.tv_usec * NSEC_PER_USEC;
1295 secs = td->runtime_ns / NSEC_PER_SEC;
1296 td->speed_gbs = secs ? bytes_done / secs / 1e9 : 0;
1298 getrusage(RUSAGE_THREAD, &rusage);
1299 td->system_time_ns = rusage.ru_stime.tv_sec * NSEC_PER_SEC;
1300 td->system_time_ns += rusage.ru_stime.tv_usec * NSEC_PER_USEC;
1301 td->user_time_ns = rusage.ru_utime.tv_sec * NSEC_PER_SEC;
1302 td->user_time_ns += rusage.ru_utime.tv_usec * NSEC_PER_USEC;
1304 free_data(thread_data, g->p.bytes_thread);
1306 pthread_mutex_lock(&g->stop_work_mutex);
1307 g->bytes_done += bytes_done;
1308 pthread_mutex_unlock(&g->stop_work_mutex);
1314 * A worker process starts a couple of threads:
1316 static void worker_process(int process_nr)
1318 pthread_mutex_t process_lock;
1319 struct thread_data *td;
1320 pthread_t *pthreads;
1326 pthread_mutex_init(&process_lock, NULL);
1327 set_taskname("process %d", process_nr);
1330 * Pick up the memory policy and the CPU binding of our first thread,
1331 * so that we initialize memory accordingly:
1333 task_nr = process_nr*g->p.nr_threads;
1334 td = g->threads + task_nr;
1336 bind_to_memnode(td->bind_node);
1337 bind_to_cpumask(td->bind_cpumask);
1339 pthreads = zalloc(g->p.nr_threads * sizeof(pthread_t));
1340 process_data = setup_private_data(g->p.bytes_process);
1342 if (g->p.show_details >= 3) {
1343 printf(" # process %2d global mem: %p, process mem: %p\n",
1344 process_nr, g->data, process_data);
1347 for (t = 0; t < g->p.nr_threads; t++) {
1348 task_nr = process_nr*g->p.nr_threads + t;
1349 td = g->threads + task_nr;
1351 td->process_data = process_data;
1352 td->process_nr = process_nr;
1354 td->task_nr = task_nr;
1357 td->process_lock = &process_lock;
1359 ret = pthread_create(pthreads + t, NULL, worker_thread, td);
1363 for (t = 0; t < g->p.nr_threads; t++) {
1364 ret = pthread_join(pthreads[t], NULL);
1368 free_data(process_data, g->p.bytes_process);
1372 static void print_summary(void)
1374 if (g->p.show_details < 0)
1378 printf(" # %d %s will execute (on %d nodes, %d CPUs):\n",
1379 g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", nr_numa_nodes(), g->p.nr_cpus);
1380 printf(" # %5dx %5ldMB global shared mem operations\n",
1381 g->p.nr_loops, g->p.bytes_global/1024/1024);
1382 printf(" # %5dx %5ldMB process shared mem operations\n",
1383 g->p.nr_loops, g->p.bytes_process/1024/1024);
1384 printf(" # %5dx %5ldMB thread local mem operations\n",
1385 g->p.nr_loops, g->p.bytes_thread/1024/1024);
1389 printf("\n ###\n"); fflush(stdout);
1392 static void init_thread_data(void)
1394 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1397 g->threads = zalloc_shared_data(size);
1399 for (t = 0; t < g->p.nr_tasks; t++) {
1400 struct thread_data *td = g->threads + t;
1403 /* Allow all nodes by default: */
1404 td->bind_node = NUMA_NO_NODE;
1406 /* Allow all CPUs by default: */
1407 CPU_ZERO(&td->bind_cpumask);
1408 for (cpu = 0; cpu < g->p.nr_cpus; cpu++)
1409 CPU_SET(cpu, &td->bind_cpumask);
1413 static void deinit_thread_data(void)
1415 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1417 free_data(g->threads, size);
1420 static int init(void)
1422 g = (void *)alloc_data(sizeof(*g), MAP_SHARED, 1, 0, 0 /* THP */, 0);
1424 /* Copy over options: */
1427 g->p.nr_cpus = numa_num_configured_cpus();
1429 g->p.nr_nodes = numa_max_node() + 1;
1431 /* char array in count_process_nodes(): */
1432 BUG_ON(g->p.nr_nodes < 0);
1434 if (g->p.show_quiet && !g->p.show_details)
1435 g->p.show_details = -1;
1437 /* Some memory should be specified: */
1438 if (!g->p.mb_global_str && !g->p.mb_proc_str && !g->p.mb_thread_str)
1441 if (g->p.mb_global_str) {
1442 g->p.mb_global = atof(g->p.mb_global_str);
1443 BUG_ON(g->p.mb_global < 0);
1446 if (g->p.mb_proc_str) {
1447 g->p.mb_proc = atof(g->p.mb_proc_str);
1448 BUG_ON(g->p.mb_proc < 0);
1451 if (g->p.mb_proc_locked_str) {
1452 g->p.mb_proc_locked = atof(g->p.mb_proc_locked_str);
1453 BUG_ON(g->p.mb_proc_locked < 0);
1454 BUG_ON(g->p.mb_proc_locked > g->p.mb_proc);
1457 if (g->p.mb_thread_str) {
1458 g->p.mb_thread = atof(g->p.mb_thread_str);
1459 BUG_ON(g->p.mb_thread < 0);
1462 BUG_ON(g->p.nr_threads <= 0);
1463 BUG_ON(g->p.nr_proc <= 0);
1465 g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads;
1467 g->p.bytes_global = g->p.mb_global *1024L*1024L;
1468 g->p.bytes_process = g->p.mb_proc *1024L*1024L;
1469 g->p.bytes_process_locked = g->p.mb_proc_locked *1024L*1024L;
1470 g->p.bytes_thread = g->p.mb_thread *1024L*1024L;
1472 g->data = setup_shared_data(g->p.bytes_global);
1474 /* Startup serialization: */
1475 init_global_mutex(&g->start_work_mutex);
1476 init_global_cond(&g->start_work_cond);
1477 init_global_mutex(&g->startup_mutex);
1478 init_global_cond(&g->startup_cond);
1479 init_global_mutex(&g->stop_work_mutex);
1484 if (parse_setup_cpu_list() || parse_setup_node_list())
1493 static void deinit(void)
1495 free_data(g->data, g->p.bytes_global);
1498 deinit_thread_data();
1500 free_data(g, sizeof(*g));
1505 * Print a short or long result, depending on the verbosity setting:
1507 static void print_res(const char *name, double val,
1508 const char *txt_unit, const char *txt_short, const char *txt_long)
1513 if (!g->p.show_quiet)
1514 printf(" %-30s %15.3f, %-15s %s\n", name, val, txt_unit, txt_short);
1516 printf(" %14.3f %s\n", val, txt_long);
1519 static int __bench_numa(const char *name)
1521 struct timeval start, stop, diff;
1522 u64 runtime_ns_min, runtime_ns_sum;
1523 pid_t *pids, pid, wpid;
1524 double delta_runtime;
1526 double runtime_sec_max;
1527 double runtime_sec_min;
1535 pids = zalloc(g->p.nr_proc * sizeof(*pids));
1538 if (g->p.serialize_startup) {
1540 tprintf(" # Startup synchronization: ..."); fflush(stdout);
1543 gettimeofday(&start, NULL);
1545 for (i = 0; i < g->p.nr_proc; i++) {
1547 dprintf(" # process %2d: PID %d\n", i, pid);
1551 /* Child process: */
1560 if (g->p.serialize_startup) {
1561 bool threads_ready = false;
1565 * Wait for all the threads to start up. The last thread will
1566 * signal this process.
1568 pthread_mutex_lock(&g->startup_mutex);
1569 while (g->nr_tasks_started != g->p.nr_tasks)
1570 pthread_cond_wait(&g->startup_cond, &g->startup_mutex);
1572 pthread_mutex_unlock(&g->startup_mutex);
1574 /* Wait for all threads to be at the start_work_cond. */
1575 while (!threads_ready) {
1576 pthread_mutex_lock(&g->start_work_mutex);
1577 threads_ready = (g->nr_tasks_working == g->p.nr_tasks);
1578 pthread_mutex_unlock(&g->start_work_mutex);
1583 gettimeofday(&stop, NULL);
1585 timersub(&stop, &start, &diff);
1587 startup_sec = diff.tv_sec * NSEC_PER_SEC;
1588 startup_sec += diff.tv_usec * NSEC_PER_USEC;
1589 startup_sec /= NSEC_PER_SEC;
1591 tprintf(" threads initialized in %.6f seconds.\n", startup_sec);
1595 /* Start all threads running. */
1596 pthread_mutex_lock(&g->start_work_mutex);
1597 g->start_work = true;
1598 pthread_mutex_unlock(&g->start_work_mutex);
1599 pthread_cond_broadcast(&g->start_work_cond);
1601 gettimeofday(&start, NULL);
1604 /* Parent process: */
1607 for (i = 0; i < g->p.nr_proc; i++) {
1608 wpid = waitpid(pids[i], &wait_stat, 0);
1610 BUG_ON(!WIFEXITED(wait_stat));
1615 runtime_ns_min = -1LL;
1617 for (t = 0; t < g->p.nr_tasks; t++) {
1618 u64 thread_runtime_ns = g->threads[t].runtime_ns;
1620 runtime_ns_sum += thread_runtime_ns;
1621 runtime_ns_min = min(thread_runtime_ns, runtime_ns_min);
1624 gettimeofday(&stop, NULL);
1625 timersub(&stop, &start, &diff);
1627 BUG_ON(bench_format != BENCH_FORMAT_DEFAULT);
1629 tprintf("\n ###\n");
1632 runtime_sec_max = diff.tv_sec * NSEC_PER_SEC;
1633 runtime_sec_max += diff.tv_usec * NSEC_PER_USEC;
1634 runtime_sec_max /= NSEC_PER_SEC;
1636 runtime_sec_min = runtime_ns_min / NSEC_PER_SEC;
1638 bytes = g->bytes_done;
1639 runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / NSEC_PER_SEC;
1641 if (g->p.measure_convergence) {
1642 print_res(name, runtime_sec_max,
1643 "secs,", "NUMA-convergence-latency", "secs latency to NUMA-converge");
1646 print_res(name, runtime_sec_max,
1647 "secs,", "runtime-max/thread", "secs slowest (max) thread-runtime");
1649 print_res(name, runtime_sec_min,
1650 "secs,", "runtime-min/thread", "secs fastest (min) thread-runtime");
1652 print_res(name, runtime_avg,
1653 "secs,", "runtime-avg/thread", "secs average thread-runtime");
1655 delta_runtime = (runtime_sec_max - runtime_sec_min)/2.0;
1656 print_res(name, delta_runtime / runtime_sec_max * 100.0,
1657 "%,", "spread-runtime/thread", "% difference between max/avg runtime");
1659 print_res(name, bytes / g->p.nr_tasks / 1e9,
1660 "GB,", "data/thread", "GB data processed, per thread");
1662 print_res(name, bytes / 1e9,
1663 "GB,", "data-total", "GB data processed, total");
1665 print_res(name, runtime_sec_max * NSEC_PER_SEC / (bytes / g->p.nr_tasks),
1666 "nsecs,", "runtime/byte/thread","nsecs/byte/thread runtime");
1668 print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max,
1669 "GB/sec,", "thread-speed", "GB/sec/thread speed");
1671 print_res(name, bytes / runtime_sec_max / 1e9,
1672 "GB/sec,", "total-speed", "GB/sec total speed");
1674 if (g->p.show_details >= 2) {
1675 char tname[14 + 2 * 10 + 1];
1676 struct thread_data *td;
1677 for (p = 0; p < g->p.nr_proc; p++) {
1678 for (t = 0; t < g->p.nr_threads; t++) {
1679 memset(tname, 0, sizeof(tname));
1680 td = g->threads + p*g->p.nr_threads + t;
1681 snprintf(tname, sizeof(tname), "process%d:thread%d", p, t);
1682 print_res(tname, td->speed_gbs,
1683 "GB/sec", "thread-speed", "GB/sec/thread speed");
1684 print_res(tname, td->system_time_ns / NSEC_PER_SEC,
1685 "secs", "thread-system-time", "system CPU time/thread");
1686 print_res(tname, td->user_time_ns / NSEC_PER_SEC,
1687 "secs", "thread-user-time", "user CPU time/thread");
1701 static int command_size(const char **argv)
1710 BUG_ON(size >= MAX_ARGS);
1715 static void init_params(struct params *p, const char *name, int argc, const char **argv)
1719 printf("\n # Running %s \"perf bench numa", name);
1721 for (i = 0; i < argc; i++)
1722 printf(" %s", argv[i]);
1726 memset(p, 0, sizeof(*p));
1728 /* Initialize nonzero defaults: */
1730 p->serialize_startup = 1;
1731 p->data_reads = true;
1732 p->data_writes = true;
1733 p->data_backwards = true;
1734 p->data_rand_walk = true;
1736 p->init_random = true;
1737 p->mb_global_str = "1";
1741 p->run_all = argc == 1;
1744 static int run_bench_numa(const char *name, const char **argv)
1746 int argc = command_size(argv);
1748 init_params(&p0, name, argc, argv);
1749 argc = parse_options(argc, argv, options, bench_numa_usage, 0);
1753 if (__bench_numa(name))
1762 #define OPT_BW_RAM "-s", "20", "-zZq", "--thp", " 1", "--no-data_rand_walk"
1763 #define OPT_BW_RAM_NOTHP OPT_BW_RAM, "--thp", "-1"
1765 #define OPT_CONV "-s", "100", "-zZ0qcm", "--thp", " 1"
1766 #define OPT_CONV_NOTHP OPT_CONV, "--thp", "-1"
1768 #define OPT_BW "-s", "20", "-zZ0q", "--thp", " 1"
1769 #define OPT_BW_NOTHP OPT_BW, "--thp", "-1"
1772 * The built-in test-suite executed by "perf bench numa -a".
1774 * (A minimum of 4 nodes and 16 GB of RAM is recommended.)
1776 static const char *tests[][MAX_ARGS] = {
1777 /* Basic single-stream NUMA bandwidth measurements: */
1778 { "RAM-bw-local,", "mem", "-p", "1", "-t", "1", "-P", "1024",
1779 "-C" , "0", "-M", "0", OPT_BW_RAM },
1780 { "RAM-bw-local-NOTHP,",
1781 "mem", "-p", "1", "-t", "1", "-P", "1024",
1782 "-C" , "0", "-M", "0", OPT_BW_RAM_NOTHP },
1783 { "RAM-bw-remote,", "mem", "-p", "1", "-t", "1", "-P", "1024",
1784 "-C" , "0", "-M", "1", OPT_BW_RAM },
1786 /* 2-stream NUMA bandwidth measurements: */
1787 { "RAM-bw-local-2x,", "mem", "-p", "2", "-t", "1", "-P", "1024",
1788 "-C", "0,2", "-M", "0x2", OPT_BW_RAM },
1789 { "RAM-bw-remote-2x,", "mem", "-p", "2", "-t", "1", "-P", "1024",
1790 "-C", "0,2", "-M", "1x2", OPT_BW_RAM },
1792 /* Cross-stream NUMA bandwidth measurement: */
1793 { "RAM-bw-cross,", "mem", "-p", "2", "-t", "1", "-P", "1024",
1794 "-C", "0,8", "-M", "1,0", OPT_BW_RAM },
1796 /* Convergence latency measurements: */
1797 { " 1x3-convergence,", "mem", "-p", "1", "-t", "3", "-P", "512", OPT_CONV },
1798 { " 1x4-convergence,", "mem", "-p", "1", "-t", "4", "-P", "512", OPT_CONV },
1799 { " 1x6-convergence,", "mem", "-p", "1", "-t", "6", "-P", "1020", OPT_CONV },
1800 { " 2x3-convergence,", "mem", "-p", "2", "-t", "3", "-P", "1020", OPT_CONV },
1801 { " 3x3-convergence,", "mem", "-p", "3", "-t", "3", "-P", "1020", OPT_CONV },
1802 { " 4x4-convergence,", "mem", "-p", "4", "-t", "4", "-P", "512", OPT_CONV },
1803 { " 4x4-convergence-NOTHP,",
1804 "mem", "-p", "4", "-t", "4", "-P", "512", OPT_CONV_NOTHP },
1805 { " 4x6-convergence,", "mem", "-p", "4", "-t", "6", "-P", "1020", OPT_CONV },
1806 { " 4x8-convergence,", "mem", "-p", "4", "-t", "8", "-P", "512", OPT_CONV },
1807 { " 8x4-convergence,", "mem", "-p", "8", "-t", "4", "-P", "512", OPT_CONV },
1808 { " 8x4-convergence-NOTHP,",
1809 "mem", "-p", "8", "-t", "4", "-P", "512", OPT_CONV_NOTHP },
1810 { " 3x1-convergence,", "mem", "-p", "3", "-t", "1", "-P", "512", OPT_CONV },
1811 { " 4x1-convergence,", "mem", "-p", "4", "-t", "1", "-P", "512", OPT_CONV },
1812 { " 8x1-convergence,", "mem", "-p", "8", "-t", "1", "-P", "512", OPT_CONV },
1813 { "16x1-convergence,", "mem", "-p", "16", "-t", "1", "-P", "256", OPT_CONV },
1814 { "32x1-convergence,", "mem", "-p", "32", "-t", "1", "-P", "128", OPT_CONV },
1816 /* Various NUMA process/thread layout bandwidth measurements: */
1817 { " 2x1-bw-process,", "mem", "-p", "2", "-t", "1", "-P", "1024", OPT_BW },
1818 { " 3x1-bw-process,", "mem", "-p", "3", "-t", "1", "-P", "1024", OPT_BW },
1819 { " 4x1-bw-process,", "mem", "-p", "4", "-t", "1", "-P", "1024", OPT_BW },
1820 { " 8x1-bw-process,", "mem", "-p", "8", "-t", "1", "-P", " 512", OPT_BW },
1821 { " 8x1-bw-process-NOTHP,",
1822 "mem", "-p", "8", "-t", "1", "-P", " 512", OPT_BW_NOTHP },
1823 { "16x1-bw-process,", "mem", "-p", "16", "-t", "1", "-P", "256", OPT_BW },
1825 { " 1x4-bw-thread,", "mem", "-p", "1", "-t", "4", "-T", "256", OPT_BW },
1826 { " 1x8-bw-thread,", "mem", "-p", "1", "-t", "8", "-T", "256", OPT_BW },
1827 { "1x16-bw-thread,", "mem", "-p", "1", "-t", "16", "-T", "128", OPT_BW },
1828 { "1x32-bw-thread,", "mem", "-p", "1", "-t", "32", "-T", "64", OPT_BW },
1830 { " 2x3-bw-process,", "mem", "-p", "2", "-t", "3", "-P", "512", OPT_BW },
1831 { " 4x4-bw-process,", "mem", "-p", "4", "-t", "4", "-P", "512", OPT_BW },
1832 { " 4x6-bw-process,", "mem", "-p", "4", "-t", "6", "-P", "512", OPT_BW },
1833 { " 4x8-bw-process,", "mem", "-p", "4", "-t", "8", "-P", "512", OPT_BW },
1834 { " 4x8-bw-process-NOTHP,",
1835 "mem", "-p", "4", "-t", "8", "-P", "512", OPT_BW_NOTHP },
1836 { " 3x3-bw-process,", "mem", "-p", "3", "-t", "3", "-P", "512", OPT_BW },
1837 { " 5x5-bw-process,", "mem", "-p", "5", "-t", "5", "-P", "512", OPT_BW },
1839 { "2x16-bw-process,", "mem", "-p", "2", "-t", "16", "-P", "512", OPT_BW },
1840 { "1x32-bw-process,", "mem", "-p", "1", "-t", "32", "-P", "2048", OPT_BW },
1842 { "numa02-bw,", "mem", "-p", "1", "-t", "32", "-T", "32", OPT_BW },
1843 { "numa02-bw-NOTHP,", "mem", "-p", "1", "-t", "32", "-T", "32", OPT_BW_NOTHP },
1844 { "numa01-bw-thread,", "mem", "-p", "2", "-t", "16", "-T", "192", OPT_BW },
1845 { "numa01-bw-thread-NOTHP,",
1846 "mem", "-p", "2", "-t", "16", "-T", "192", OPT_BW_NOTHP },
1849 static int bench_all(void)
1851 int nr = ARRAY_SIZE(tests);
1855 ret = system("echo ' #'; echo ' # Running test on: '$(uname -a); echo ' #'");
1858 for (i = 0; i < nr; i++) {
1859 run_bench_numa(tests[i][0], tests[i] + 1);
1867 int bench_numa(int argc, const char **argv)
1869 init_params(&p0, "main,", argc, argv);
1870 argc = parse_options(argc, argv, options, bench_numa_usage, 0);
1877 if (__bench_numa(NULL))
1883 usage_with_options(numa_usage, options);