1 // SPDX-License-Identifier: GPL-2.0 1
2 /*
3 * numa.c
4 *
5 * numa: Simulate NUMA-sensitive workload and
6 */
7
8 #include <inttypes.h>
9
10 #include <subcmd/parse-options.h>
11 #include "../util/cloexec.h"
12
13 #include "bench.h"
14
15 #include <errno.h>
16 #include <sched.h>
17 #include <stdio.h>
18 #include <assert.h>
19 #include <debug.h>
20 #include <malloc.h>
21 #include <signal.h>
22 #include <stdlib.h>
23 #include <string.h>
24 #include <unistd.h>
25 #include <sys/mman.h>
26 #include <sys/time.h>
27 #include <sys/resource.h>
28 #include <sys/wait.h>
29 #include <sys/prctl.h>
30 #include <sys/types.h>
31 #include <linux/kernel.h>
32 #include <linux/time64.h>
33 #include <linux/numa.h>
34 #include <linux/zalloc.h>
35
36 #include "../util/header.h"
37 #include "../util/mutex.h"
38 #include <numa.h>
39 #include <numaif.h>
40
41 #ifndef RUSAGE_THREAD
42 # define RUSAGE_THREAD 1
43 #endif
44
45 /*
46 * Regular printout to the terminal, suppresse
47 */
48 #define tprintf(x...) do { if (g && g->p.show_
49
50 /*
51 * Debug printf:
52 */
53 #undef dprintf
54 #define dprintf(x...) do { if (g && g->p.show_
55
56 struct thread_data {
57 int curr_cpu;
58 cpu_set_t *bind_cpumask;
59 int bind_node;
60 u8 *process_data;
61 int process_nr;
62 int thread_nr;
63 int task_nr;
64 unsigned int loops_done;
65 u64 val;
66 u64 runtime_ns;
67 u64 system_time_ns
68 u64 user_time_ns;
69 double speed_gbs;
70 struct mutex *process_lock;
71 };
72
73 /* Parameters set by options: */
74
75 struct params {
76 /* Startup synchronization: */
77 bool serialize_star
78
79 /* Task hierarchy: */
80 int nr_proc;
81 int nr_threads;
82
83 /* Working set sizes: */
84 const char *mb_global_str
85 const char *mb_proc_str;
86 const char *mb_proc_locke
87 const char *mb_thread_str
88
89 double mb_global;
90 double mb_proc;
91 double mb_proc_locked
92 double mb_thread;
93
94 /* Access patterns to the working set:
95 bool data_reads;
96 bool data_writes;
97 bool data_backwards
98 bool data_zero_mems
99 bool data_rand_walk
100 u32 nr_loops;
101 u32 nr_secs;
102 u32 sleep_usecs;
103
104 /* Working set initialization: */
105 bool init_zero;
106 bool init_random;
107 bool init_cpu0;
108
109 /* Misc options: */
110 int show_details;
111 int run_all;
112 int thp;
113
114 long bytes_global;
115 long bytes_process;
116 long bytes_process_
117 long bytes_thread;
118
119 int nr_tasks;
120
121 bool show_convergen
122 bool measure_conver
123
124 int perturb_secs;
125 int nr_cpus;
126 int nr_nodes;
127
128 /* Affinity options -C and -N: */
129 char *cpu_list_str;
130 char *node_list_str
131 };
132
133
134 /* Global, read-writable area, accessible to a
135
136 struct global_info {
137 u8 *data;
138
139 struct mutex startup_mutex;
140 struct cond startup_cond;
141 int nr_tasks_start
142
143 struct mutex start_work_mut
144 struct cond start_work_con
145 int nr_tasks_worki
146 bool start_work;
147
148 struct mutex stop_work_mute
149 u64 bytes_done;
150
151 struct thread_data *threads;
152
153 /* Convergence latency measurement: */
154 bool all_converged;
155 bool stop_work;
156
157 int print_once;
158
159 struct params p;
160 };
161
162 static struct global_info *g = NULL;
163
164 static int parse_cpus_opt(const struct option
165 static int parse_nodes_opt(const struct option
166
167 struct params p0;
168
169 static const struct option options[] = {
170 OPT_INTEGER('p', "nr_proc" , &p0.
171 OPT_INTEGER('t', "nr_threads" , &p0.
172
173 OPT_STRING('G', "mb_global" , &p0.
174 OPT_STRING('P', "mb_proc" , &p0.
175 OPT_STRING('L', "mb_proc_locked", &p0.
176 OPT_STRING('T', "mb_thread" , &p0.
177
178 OPT_UINTEGER('l', "nr_loops" , &p0.
179 OPT_UINTEGER('s', "nr_secs" , &p0.
180 OPT_UINTEGER('u', "usleep" , &p0.
181
182 OPT_BOOLEAN('R', "data_reads" , &p0.
183 OPT_BOOLEAN('W', "data_writes" , &p0.
184 OPT_BOOLEAN('B', "data_backwards", &p0
185 OPT_BOOLEAN('Z', "data_zero_memset", &
186 OPT_BOOLEAN('r', "data_rand_walk", &p0
187
188
189 OPT_BOOLEAN('z', "init_zero" , &p0.
190 OPT_BOOLEAN('I', "init_random" , &p0.
191 OPT_BOOLEAN('', "init_cpu0" , &p0.i
192 OPT_INTEGER('x', "perturb_secs", &p0.p
193
194 OPT_INCR ('d', "show_details" , &p0.
195 OPT_INCR ('a', "all" , &p0.
196 OPT_INTEGER('H', "thp" , &p0.
197 OPT_BOOLEAN('c', "show_convergence", &
198 "convergence is reached wh
199 OPT_BOOLEAN('m', "measure_convergence"
200 OPT_BOOLEAN('q', "quiet" , &qui
201 "quiet mode (do not show a
202 OPT_BOOLEAN('S', "serialize-startup",
203
204 /* Special option string parsing callb
205 OPT_CALLBACK('C', "cpus", NULL, "cpu[,
206 "bind the first N task
207 parse_cpus_opt),
208 OPT_CALLBACK('M', "memnodes", NULL, "n
209 "bind the first N task
210 parse_nodes_opt),
211 OPT_END()
212 };
213
214 static const char * const bench_numa_usage[] =
215 "perf bench numa <options>",
216 NULL
217 };
218
219 static const char * const numa_usage[] = {
220 "perf bench numa mem [<options>]",
221 NULL
222 };
223
224 /*
225 * To get number of numa nodes present.
226 */
227 static int nr_numa_nodes(void)
228 {
229 int i, nr_nodes = 0;
230
231 for (i = 0; i < g->p.nr_nodes; i++) {
232 if (numa_bitmask_isbitset(numa
233 nr_nodes++;
234 }
235
236 return nr_nodes;
237 }
238
239 /*
240 * To check if given numa node is present.
241 */
242 static int is_node_present(int node)
243 {
244 return numa_bitmask_isbitset(numa_node
245 }
246
247 /*
248 * To check given numa node has cpus.
249 */
250 static bool node_has_cpus(int node)
251 {
252 struct bitmask *cpumask = numa_allocat
253 bool ret = false; /* fall back to nocp
254 int cpu;
255
256 BUG_ON(!cpumask);
257 if (!numa_node_to_cpus(node, cpumask))
258 for (cpu = 0; cpu < (int)cpuma
259 if (numa_bitmask_isbit
260 ret = true;
261 break;
262 }
263 }
264 }
265 numa_free_cpumask(cpumask);
266
267 return ret;
268 }
269
270 static cpu_set_t *bind_to_cpu(int target_cpu)
271 {
272 int nrcpus = numa_num_possible_cpus();
273 cpu_set_t *orig_mask, *mask;
274 size_t size;
275
276 orig_mask = CPU_ALLOC(nrcpus);
277 BUG_ON(!orig_mask);
278 size = CPU_ALLOC_SIZE(nrcpus);
279 CPU_ZERO_S(size, orig_mask);
280
281 if (sched_getaffinity(0, size, orig_ma
282 goto err_out;
283
284 mask = CPU_ALLOC(nrcpus);
285 if (!mask)
286 goto err_out;
287
288 CPU_ZERO_S(size, mask);
289
290 if (target_cpu == -1) {
291 int cpu;
292
293 for (cpu = 0; cpu < g->p.nr_cp
294 CPU_SET_S(cpu, size, m
295 } else {
296 if (target_cpu < 0 || target_c
297 goto err;
298
299 CPU_SET_S(target_cpu, size, ma
300 }
301
302 if (sched_setaffinity(0, size, mask))
303 goto err;
304
305 return orig_mask;
306
307 err:
308 CPU_FREE(mask);
309 err_out:
310 CPU_FREE(orig_mask);
311
312 /* BUG_ON due to failure in allocation
313 BUG_ON(-1);
314 return NULL;
315 }
316
317 static cpu_set_t *bind_to_node(int target_node
318 {
319 int nrcpus = numa_num_possible_cpus();
320 size_t size;
321 cpu_set_t *orig_mask, *mask;
322 int cpu;
323
324 orig_mask = CPU_ALLOC(nrcpus);
325 BUG_ON(!orig_mask);
326 size = CPU_ALLOC_SIZE(nrcpus);
327 CPU_ZERO_S(size, orig_mask);
328
329 if (sched_getaffinity(0, size, orig_ma
330 goto err_out;
331
332 mask = CPU_ALLOC(nrcpus);
333 if (!mask)
334 goto err_out;
335
336 CPU_ZERO_S(size, mask);
337
338 if (target_node == NUMA_NO_NODE) {
339 for (cpu = 0; cpu < g->p.nr_cp
340 CPU_SET_S(cpu, size, m
341 } else {
342 struct bitmask *cpumask = numa
343
344 if (!cpumask)
345 goto err;
346
347 if (!numa_node_to_cpus(target_
348 for (cpu = 0; cpu < (i
349 if (numa_bitma
350 CPU_SE
351 }
352 }
353 numa_free_cpumask(cpumask);
354 }
355
356 if (sched_setaffinity(0, size, mask))
357 goto err;
358
359 return orig_mask;
360
361 err:
362 CPU_FREE(mask);
363 err_out:
364 CPU_FREE(orig_mask);
365
366 /* BUG_ON due to failure in allocation
367 BUG_ON(-1);
368 return NULL;
369 }
370
371 static void bind_to_cpumask(cpu_set_t *mask)
372 {
373 int ret;
374 size_t size = CPU_ALLOC_SIZE(numa_num_
375
376 ret = sched_setaffinity(0, size, mask)
377 if (ret) {
378 CPU_FREE(mask);
379 BUG_ON(ret);
380 }
381 }
382
383 static void mempol_restore(void)
384 {
385 int ret;
386
387 ret = set_mempolicy(MPOL_DEFAULT, NULL
388
389 BUG_ON(ret);
390 }
391
392 static void bind_to_memnode(int node)
393 {
394 struct bitmask *node_mask;
395 int ret;
396
397 if (node == NUMA_NO_NODE)
398 return;
399
400 node_mask = numa_allocate_nodemask();
401 BUG_ON(!node_mask);
402
403 numa_bitmask_clearall(node_mask);
404 numa_bitmask_setbit(node_mask, node);
405
406 ret = set_mempolicy(MPOL_BIND, node_ma
407 dprintf("binding to node %d, mask: %01
408
409 numa_bitmask_free(node_mask);
410 BUG_ON(ret);
411 }
412
413 #define HPSIZE (2*1024*1024)
414
415 #define set_taskname(fmt...)
416 do {
417 char name[20];
418
419 snprintf(name, 20, fmt);
420 prctl(PR_SET_NAME, name);
421 } while (0)
422
423 static u8 *alloc_data(ssize_t bytes0, int map_
424 int init_zero, int init_
425 {
426 cpu_set_t *orig_mask = NULL;
427 ssize_t bytes;
428 u8 *buf;
429 int ret;
430
431 if (!bytes0)
432 return NULL;
433
434 /* Allocate and initialize all memory
435 if (init_cpu0) {
436 int node = numa_node_of_cpu(0)
437
438 orig_mask = bind_to_node(node)
439 bind_to_memnode(node);
440 }
441
442 bytes = bytes0 + HPSIZE;
443
444 buf = (void *)mmap(0, bytes, PROT_READ
445 BUG_ON(buf == (void *)-1);
446
447 if (map_flags == MAP_PRIVATE) {
448 if (thp > 0) {
449 ret = madvise(buf, byt
450 if (ret && !g->print_o
451 g->print_once
452 printf("WARNIN
453 }
454 }
455 if (thp < 0) {
456 ret = madvise(buf, byt
457 if (ret && !g->print_o
458 g->print_once
459 printf("WARNIN
460 }
461 }
462 }
463
464 if (init_zero) {
465 bzero(buf, bytes);
466 } else {
467 /* Initialize random contents,
468 if (init_random) {
469 u64 *wbuf = (void *)bu
470 long off = rand();
471 long i;
472
473 for (i = 0; i < bytes/
474 wbuf[i] = i +
475 }
476 }
477
478 /* Align to 2MB boundary: */
479 buf = (void *)(((unsigned long)buf + H
480
481 /* Restore affinity: */
482 if (init_cpu0) {
483 bind_to_cpumask(orig_mask);
484 CPU_FREE(orig_mask);
485 mempol_restore();
486 }
487
488 return buf;
489 }
490
491 static void free_data(void *data, ssize_t byte
492 {
493 int ret;
494
495 if (!data)
496 return;
497
498 ret = munmap(data, bytes);
499 BUG_ON(ret);
500 }
501
502 /*
503 * Create a shared memory buffer that can be s
504 */
505 static void * zalloc_shared_data(ssize_t bytes
506 {
507 return alloc_data(bytes, MAP_SHARED, 1
508 }
509
510 /*
511 * Create a shared memory buffer that can be s
512 */
513 static void * setup_shared_data(ssize_t bytes)
514 {
515 return alloc_data(bytes, MAP_SHARED, 0
516 }
517
518 /*
519 * Allocate process-local memory - this will e
520 * threads of this process, or only be accesse
521 */
522 static void * setup_private_data(ssize_t bytes
523 {
524 return alloc_data(bytes, MAP_PRIVATE,
525 }
526
527 static int parse_cpu_list(const char *arg)
528 {
529 p0.cpu_list_str = strdup(arg);
530
531 dprintf("got CPU list: {%s}\n", p0.cpu
532
533 return 0;
534 }
535
536 static int parse_setup_cpu_list(void)
537 {
538 struct thread_data *td;
539 char *str0, *str;
540 int t;
541
542 if (!g->p.cpu_list_str)
543 return 0;
544
545 dprintf("g->p.nr_tasks: %d\n", g->p.nr
546
547 str0 = str = strdup(g->p.cpu_list_str)
548 t = 0;
549
550 BUG_ON(!str);
551
552 tprintf("# binding tasks to CPUs:\n");
553 tprintf("# ");
554
555 while (true) {
556 int bind_cpu, bind_cpu_0, bind
557 char *tok, *tok_end, *tok_step
558 int bind_len;
559 int step;
560 int mul;
561
562 tok = strsep(&str, ",");
563 if (!tok)
564 break;
565
566 tok_end = strstr(tok, "-");
567
568 dprintf("\ntoken: {%s}, end: {
569 if (!tok_end) {
570 /* Single CPU specifie
571 bind_cpu_0 = bind_cpu_
572 } else {
573 /* CPU range specified
574 bind_cpu_0 = atol(tok)
575 bind_cpu_1 = atol(tok_
576 }
577
578 step = 1;
579 tok_step = strstr(tok, "#");
580 if (tok_step) {
581 step = atol(tok_step +
582 BUG_ON(step <= 0 || st
583 }
584
585 /*
586 * Mask length.
587 * Eg: "--cpus 8_4-16#4" means
588 * where the _4 means the next
589 */
590 bind_len = 1;
591 tok_len = strstr(tok, "_");
592 if (tok_len) {
593 bind_len = atol(tok_le
594 BUG_ON(bind_len <= 0 |
595 }
596
597 /* Multiplicator shortcut, "0x
598 mul = 1;
599 tok_mul = strstr(tok, "x");
600 if (tok_mul) {
601 mul = atol(tok_mul + 1
602 BUG_ON(mul <= 0);
603 }
604
605 dprintf("CPUs: %d_%d-%d#%dx%d\
606
607 if (bind_cpu_0 >= g->p.nr_cpus
608 printf("\nTest not app
609 return -1;
610 }
611
612 if (is_cpu_online(bind_cpu_0)
613 printf("\nTest not app
614 return -1;
615 }
616
617 BUG_ON(bind_cpu_0 < 0 || bind_
618 BUG_ON(bind_cpu_0 > bind_cpu_1
619
620 for (bind_cpu = bind_cpu_0; bi
621 size_t size = CPU_ALLO
622 int i;
623
624 for (i = 0; i < mul; i
625 int cpu;
626
627 if (t >= g->p.
628 printf
629 goto o
630 }
631 td = g->thread
632
633 if (t)
634 tprint
635 if (bind_len >
636 tprint
637 } else {
638 tprint
639 }
640
641 td->bind_cpuma
642 BUG_ON(!td->bi
643 CPU_ZERO_S(siz
644 for (cpu = bin
645 if (cp
646
647
648 }
649 CPU_SE
650 }
651 t++;
652 }
653 }
654 }
655 out:
656
657 tprintf("\n");
658
659 if (t < g->p.nr_tasks)
660 printf("# NOTE: %d tasks bound
661
662 free(str0);
663 return 0;
664 }
665
666 static int parse_cpus_opt(const struct option
667 const char *arg, int
668 {
669 if (!arg)
670 return -1;
671
672 return parse_cpu_list(arg);
673 }
674
675 static int parse_node_list(const char *arg)
676 {
677 p0.node_list_str = strdup(arg);
678
679 dprintf("got NODE list: {%s}\n", p0.no
680
681 return 0;
682 }
683
684 static int parse_setup_node_list(void)
685 {
686 struct thread_data *td;
687 char *str0, *str;
688 int t;
689
690 if (!g->p.node_list_str)
691 return 0;
692
693 dprintf("g->p.nr_tasks: %d\n", g->p.nr
694
695 str0 = str = strdup(g->p.node_list_str
696 t = 0;
697
698 BUG_ON(!str);
699
700 tprintf("# binding tasks to NODEs:\n")
701 tprintf("# ");
702
703 while (true) {
704 int bind_node, bind_node_0, bi
705 char *tok, *tok_end, *tok_step
706 int step;
707 int mul;
708
709 tok = strsep(&str, ",");
710 if (!tok)
711 break;
712
713 tok_end = strstr(tok, "-");
714
715 dprintf("\ntoken: {%s}, end: {
716 if (!tok_end) {
717 /* Single NODE specifi
718 bind_node_0 = bind_nod
719 } else {
720 /* NODE range specifie
721 bind_node_0 = atol(tok
722 bind_node_1 = atol(tok
723 }
724
725 step = 1;
726 tok_step = strstr(tok, "#");
727 if (tok_step) {
728 step = atol(tok_step +
729 BUG_ON(step <= 0 || st
730 }
731
732 /* Multiplicator shortcut, "0x
733 mul = 1;
734 tok_mul = strstr(tok, "x");
735 if (tok_mul) {
736 mul = atol(tok_mul + 1
737 BUG_ON(mul <= 0);
738 }
739
740 dprintf("NODEs: %d-%d #%d\n",
741
742 if (bind_node_0 >= g->p.nr_nod
743 printf("\nTest not app
744 return -1;
745 }
746
747 BUG_ON(bind_node_0 < 0 || bind
748 BUG_ON(bind_node_0 > bind_node
749
750 for (bind_node = bind_node_0;
751 int i;
752
753 for (i = 0; i < mul; i
754 if (t >= g->p.
755 printf
756 goto o
757 }
758 td = g->thread
759
760 if (!t)
761 tprint
762 else
763 tprint
764
765 td->bind_node
766 t++;
767 }
768 }
769 }
770 out:
771
772 tprintf("\n");
773
774 if (t < g->p.nr_tasks)
775 printf("# NOTE: %d tasks mem-b
776
777 free(str0);
778 return 0;
779 }
780
781 static int parse_nodes_opt(const struct option
782 const char *arg, int
783 {
784 if (!arg)
785 return -1;
786
787 return parse_node_list(arg);
788 }
789
790 static inline uint32_t lfsr_32(uint32_t lfsr)
791 {
792 const uint32_t taps = BIT(1) | BIT(5)
793 return (lfsr>>1) ^ ((0x0u - (lfsr & 0x
794 }
795
796 /*
797 * Make sure there's real data dependency to R
798 * accesses are enabled), so the compiler, the
799 * kernel (KSM, zero page, etc.) cannot optimi
800 * accesses:
801 */
802 static inline u64 access_data(u64 *data, u64 v
803 {
804 if (g->p.data_reads)
805 val += *data;
806 if (g->p.data_writes)
807 *data = val + 1;
808 return val;
809 }
810
811 /*
812 * The worker process does two types of work,
813 * loop and a backwards going loop.
814 *
815 * We do this so that on multiprocessor system
816 * a 'train' of processing, with highly synchr
817 * skewing the whole benchmark.
818 */
819 static u64 do_work(u8 *__data, long bytes, int
820 {
821 long words = bytes/sizeof(u64);
822 u64 *data = (void *)__data;
823 long chunk_0, chunk_1;
824 u64 *d0, *d, *d1;
825 long off;
826 long i;
827
828 BUG_ON(!data && words);
829 BUG_ON(data && !words);
830
831 if (!data)
832 return val;
833
834 /* Very simple memset() work variant:
835 if (g->p.data_zero_memset && !g->p.dat
836 bzero(data, bytes);
837 return val;
838 }
839
840 /* Spread out by PID/TID nr and by loo
841 chunk_0 = words/nr_max;
842 chunk_1 = words/g->p.nr_loops;
843 off = nr*chunk_0 + loop*chunk_1;
844
845 while (off >= words)
846 off -= words;
847
848 if (g->p.data_rand_walk) {
849 u32 lfsr = nr + loop + val;
850 long j;
851
852 for (i = 0; i < words/1024; i+
853 long start, end;
854
855 lfsr = lfsr_32(lfsr);
856
857 start = lfsr % words;
858 end = min(start + 1024
859
860 if (g->p.data_zero_mem
861 bzero(data + s
862 } else {
863 for (j = start
864 val =
865 }
866 }
867 } else if (!g->p.data_backwards || (nr
868 /* Process data forwards: */
869
870 d0 = data + off;
871 d = data + off + 1;
872 d1 = data + words;
873
874 for (;;) {
875 if (unlikely(d >= d1))
876 d = data;
877 if (unlikely(d == d0))
878 break;
879
880 val = access_data(d, v
881
882 d++;
883 }
884 } else {
885 /* Process data backwards: */
886
887 d0 = data + off;
888 d = data + off - 1;
889 d1 = data + words;
890
891 for (;;) {
892 if (unlikely(d < data)
893 d = data + wor
894 if (unlikely(d == d0))
895 break;
896
897 val = access_data(d, v
898
899 d--;
900 }
901 }
902
903 return val;
904 }
905
906 static void update_curr_cpu(int task_nr, unsig
907 {
908 unsigned int cpu;
909
910 cpu = sched_getcpu();
911
912 g->threads[task_nr].curr_cpu = cpu;
913 prctl(0, bytes_worked);
914 }
915
916 /*
917 * Count the number of nodes a process's threa
918 * are spread out on.
919 *
920 * A count of 1 means that the process is comp
921 * to a single node. A count of g->p.nr_nodes
922 * spread out on the whole system.
923 */
924 static int count_process_nodes(int process_nr)
925 {
926 char *node_present;
927 int nodes;
928 int n, t;
929
930 node_present = (char *)malloc(g->p.nr_
931 BUG_ON(!node_present);
932 for (nodes = 0; nodes < g->p.nr_nodes;
933 node_present[nodes] = 0;
934
935 for (t = 0; t < g->p.nr_threads; t++)
936 struct thread_data *td;
937 int task_nr;
938 int node;
939
940 task_nr = process_nr*g->p.nr_t
941 td = g->threads + task_nr;
942
943 node = numa_node_of_cpu(td->cu
944 if (node < 0) /* curr_cpu was
945 free(node_present);
946 return 0;
947 }
948
949 node_present[node] = 1;
950 }
951
952 nodes = 0;
953
954 for (n = 0; n < g->p.nr_nodes; n++)
955 nodes += node_present[n];
956
957 free(node_present);
958 return nodes;
959 }
960
961 /*
962 * Count the number of distinct process-thread
963 *
964 * A count of 1 means that the node contains o
965 * process. If all nodes on the system contain
966 * process then we are well-converged.
967 */
968 static int count_node_processes(int node)
969 {
970 int processes = 0;
971 int t, p;
972
973 for (p = 0; p < g->p.nr_proc; p++) {
974 for (t = 0; t < g->p.nr_thread
975 struct thread_data *td
976 int task_nr;
977 int n;
978
979 task_nr = p*g->p.nr_th
980 td = g->threads + task
981
982 n = numa_node_of_cpu(t
983 if (n == node) {
984 processes++;
985 break;
986 }
987 }
988 }
989
990 return processes;
991 }
992
993 static void calc_convergence_compression(int *
994 {
995 unsigned int nodes_min, nodes_max;
996 int p;
997
998 nodes_min = -1;
999 nodes_max = 0;
1000
1001 for (p = 0; p < g->p.nr_proc; p++) {
1002 unsigned int nodes = count_pr
1003
1004 if (!nodes) {
1005 *strong = 0;
1006 return;
1007 }
1008
1009 nodes_min = min(nodes, nodes_
1010 nodes_max = max(nodes, nodes_
1011 }
1012
1013 /* Strong convergence: all threads co
1014 if (nodes_min == 1 && nodes_max == 1)
1015 *strong = 1;
1016 } else {
1017 *strong = 0;
1018 tprintf(" {%d-%d}", nodes_min
1019 }
1020 }
1021
1022 static void calc_convergence(double runtime_n
1023 {
1024 unsigned int loops_done_min, loops_do
1025 int process_groups;
1026 int *nodes;
1027 int distance;
1028 int nr_min;
1029 int nr_max;
1030 int strong;
1031 int sum;
1032 int nr;
1033 int node;
1034 int cpu;
1035 int t;
1036
1037 if (!g->p.show_convergence && !g->p.m
1038 return;
1039
1040 nodes = (int *)malloc(g->p.nr_nodes *
1041 BUG_ON(!nodes);
1042 for (node = 0; node < g->p.nr_nodes;
1043 nodes[node] = 0;
1044
1045 loops_done_min = -1;
1046 loops_done_max = 0;
1047
1048 for (t = 0; t < g->p.nr_tasks; t++) {
1049 struct thread_data *td = g->t
1050 unsigned int loops_done;
1051
1052 cpu = td->curr_cpu;
1053
1054 /* Not all threads have writt
1055 if (cpu < 0)
1056 continue;
1057
1058 node = numa_node_of_cpu(cpu);
1059
1060 nodes[node]++;
1061
1062 loops_done = td->loops_done;
1063 loops_done_min = min(loops_do
1064 loops_done_max = max(loops_do
1065 }
1066
1067 nr_max = 0;
1068 nr_min = g->p.nr_tasks;
1069 sum = 0;
1070
1071 for (node = 0; node < g->p.nr_nodes;
1072 if (!is_node_present(node))
1073 continue;
1074 nr = nodes[node];
1075 nr_min = min(nr, nr_min);
1076 nr_max = max(nr, nr_max);
1077 sum += nr;
1078 }
1079 BUG_ON(nr_min > nr_max);
1080
1081 BUG_ON(sum > g->p.nr_tasks);
1082
1083 if (0 && (sum < g->p.nr_tasks)) {
1084 free(nodes);
1085 return;
1086 }
1087
1088 /*
1089 * Count the number of distinct proce
1090 * on nodes - when we are converged t
1091 * to g->p.nr_proc:
1092 */
1093 process_groups = 0;
1094
1095 for (node = 0; node < g->p.nr_nodes;
1096 int processes;
1097
1098 if (!is_node_present(node))
1099 continue;
1100 processes = count_node_proces
1101 nr = nodes[node];
1102 tprintf(" %2d/%-2d", nr, proc
1103
1104 process_groups += processes;
1105 }
1106
1107 distance = nr_max - nr_min;
1108
1109 tprintf(" [%2d/%-2d]", distance, proc
1110
1111 tprintf(" l:%3d-%-3d (%3d)",
1112 loops_done_min, loops_done_ma
1113
1114 if (loops_done_min && loops_done_max)
1115 double skew = 1.0 - (double)l
1116
1117 tprintf(" [%4.1f%%]", skew *
1118 }
1119
1120 calc_convergence_compression(&strong)
1121
1122 if (strong && process_groups == g->p.
1123 if (!*convergence) {
1124 *convergence = runtim
1125 tprintf(" (%6.1fs con
1126 if (g->p.measure_conv
1127 g->all_conver
1128 g->stop_work
1129 }
1130 }
1131 } else {
1132 if (*convergence) {
1133 tprintf(" (%6.1fs de-
1134 *convergence = 0;
1135 }
1136 tprintf("\n");
1137 }
1138
1139 free(nodes);
1140 }
1141
1142 static void show_summary(double runtime_ns_ma
1143 {
1144 tprintf("\r # %5.1f%% [%.1f mins]",
1145 (double)(l+1)/g->p.nr_loops*1
1146
1147 calc_convergence(runtime_ns_max, conv
1148
1149 if (g->p.show_details >= 0)
1150 fflush(stdout);
1151 }
1152
1153 static void *worker_thread(void *__tdata)
1154 {
1155 struct thread_data *td = __tdata;
1156 struct timeval start0, start, stop, d
1157 int process_nr = td->process_nr;
1158 int thread_nr = td->thread_nr;
1159 unsigned long last_perturbance;
1160 int task_nr = td->task_nr;
1161 int details = g->p.show_details;
1162 int first_task, last_task;
1163 double convergence = 0;
1164 u64 val = td->val;
1165 double runtime_ns_max;
1166 u8 *global_data;
1167 u8 *process_data;
1168 u8 *thread_data;
1169 u64 bytes_done, secs;
1170 long work_done;
1171 u32 l;
1172 struct rusage rusage;
1173
1174 bind_to_cpumask(td->bind_cpumask);
1175 bind_to_memnode(td->bind_node);
1176
1177 set_taskname("thread %d/%d", process_
1178
1179 global_data = g->data;
1180 process_data = td->process_data;
1181 thread_data = setup_private_data(g->p
1182
1183 bytes_done = 0;
1184
1185 last_task = 0;
1186 if (process_nr == g->p.nr_proc-1 && t
1187 last_task = 1;
1188
1189 first_task = 0;
1190 if (process_nr == 0 && thread_nr == 0
1191 first_task = 1;
1192
1193 if (details >= 2) {
1194 printf("# thread %2d / %2d g
1195 process_nr, thread_nr
1196 }
1197
1198 if (g->p.serialize_startup) {
1199 mutex_lock(&g->startup_mutex)
1200 g->nr_tasks_started++;
1201 /* The last thread wakes the
1202 if (g->nr_tasks_started == g-
1203 cond_signal(&g->start
1204
1205 mutex_unlock(&g->startup_mute
1206
1207 /* Here we will wait for the
1208 mutex_lock(&g->start_work_mut
1209 g->start_work = false;
1210 g->nr_tasks_working++;
1211 while (!g->start_work)
1212 cond_wait(&g->start_w
1213
1214 mutex_unlock(&g->start_work_m
1215 }
1216
1217 gettimeofday(&start0, NULL);
1218
1219 start = stop = start0;
1220 last_perturbance = start.tv_sec;
1221
1222 for (l = 0; l < g->p.nr_loops; l++) {
1223 start = stop;
1224
1225 if (g->stop_work)
1226 break;
1227
1228 val += do_work(global_data,
1229 val += do_work(process_data,
1230 val += do_work(thread_data,
1231
1232 if (g->p.sleep_usecs) {
1233 mutex_lock(td->proces
1234 usleep(g->p.sleep_use
1235 mutex_unlock(td->proc
1236 }
1237 /*
1238 * Amount of work to be done
1239 */
1240 if (g->p.bytes_process_locked
1241 mutex_lock(td->proces
1242 val += do_work(proces
1243 mutex_unlock(td->proc
1244 }
1245
1246 work_done = g->p.bytes_global
1247 g->p.bytes_proces
1248
1249 update_curr_cpu(task_nr, work
1250 bytes_done += work_done;
1251
1252 if (details < 0 && !g->p.pert
1253 continue;
1254
1255 td->loops_done = l;
1256
1257 gettimeofday(&stop, NULL);
1258
1259 /* Check whether our max runt
1260 if (g->p.nr_secs) {
1261 timersub(&stop, &star
1262 if ((u32)diff.tv_sec
1263 g->stop_work
1264 break;
1265 }
1266 }
1267
1268 /* Update the summary at most
1269 if (start.tv_sec == stop.tv_s
1270 continue;
1271
1272 /*
1273 * Perturb the first task's e
1274 * by migrating to CPU#0:
1275 */
1276 if (first_task && g->p.pertur
1277 cpu_set_t *orig_mask;
1278 int target_cpu;
1279 int this_cpu;
1280
1281 last_perturbance = st
1282
1283 /*
1284 * Depending on where
1285 * the other half of
1286 * real disturbance:
1287 */
1288 this_cpu = g->threads
1289 if (this_cpu < g->p.n
1290 target_cpu =
1291 else
1292 target_cpu =
1293
1294 orig_mask = bind_to_c
1295
1296 /* Here we are runnin
1297 if (details >= 1)
1298 printf(" (inj
1299
1300 bind_to_cpumask(orig_
1301 CPU_FREE(orig_mask);
1302 }
1303
1304 if (details >= 3) {
1305 timersub(&stop, &star
1306 runtime_ns_max = diff
1307 runtime_ns_max += dif
1308
1309 if (details >= 0) {
1310 printf(" #%2d
1311 proce
1312 }
1313 fflush(stdout);
1314 }
1315 if (!last_task)
1316 continue;
1317
1318 timersub(&stop, &start0, &dif
1319 runtime_ns_max = diff.tv_sec
1320 runtime_ns_max += diff.tv_use
1321
1322 show_summary(runtime_ns_max,
1323 }
1324
1325 gettimeofday(&stop, NULL);
1326 timersub(&stop, &start0, &diff);
1327 td->runtime_ns = diff.tv_sec * NSEC_P
1328 td->runtime_ns += diff.tv_usec * NSEC
1329 secs = td->runtime_ns / NSEC_PER_SEC;
1330 td->speed_gbs = secs ? bytes_done / s
1331
1332 getrusage(RUSAGE_THREAD, &rusage);
1333 td->system_time_ns = rusage.ru_stime.
1334 td->system_time_ns += rusage.ru_stime
1335 td->user_time_ns = rusage.ru_utime.tv
1336 td->user_time_ns += rusage.ru_utime.t
1337
1338 free_data(thread_data, g->p.bytes_thr
1339
1340 mutex_lock(&g->stop_work_mutex);
1341 g->bytes_done += bytes_done;
1342 mutex_unlock(&g->stop_work_mutex);
1343
1344 return NULL;
1345 }
1346
1347 /*
1348 * A worker process starts a couple of thread
1349 */
1350 static void worker_process(int process_nr)
1351 {
1352 struct mutex process_lock;
1353 struct thread_data *td;
1354 pthread_t *pthreads;
1355 u8 *process_data;
1356 int task_nr;
1357 int ret;
1358 int t;
1359
1360 mutex_init(&process_lock);
1361 set_taskname("process %d", process_nr
1362
1363 /*
1364 * Pick up the memory policy and the
1365 * so that we initialize memory accor
1366 */
1367 task_nr = process_nr*g->p.nr_threads;
1368 td = g->threads + task_nr;
1369
1370 bind_to_memnode(td->bind_node);
1371 bind_to_cpumask(td->bind_cpumask);
1372
1373 pthreads = zalloc(g->p.nr_threads * s
1374 process_data = setup_private_data(g->
1375
1376 if (g->p.show_details >= 3) {
1377 printf(" # process %2d global
1378 process_nr, g->data,
1379 }
1380
1381 for (t = 0; t < g->p.nr_threads; t++)
1382 task_nr = process_nr*g->p.nr_
1383 td = g->threads + task_nr;
1384
1385 td->process_data = process_da
1386 td->process_nr = process_nr
1387 td->thread_nr = t;
1388 td->task_nr = task_nr;
1389 td->val = rand();
1390 td->curr_cpu = -1;
1391 td->process_lock = &process_l
1392
1393 ret = pthread_create(pthreads
1394 BUG_ON(ret);
1395 }
1396
1397 for (t = 0; t < g->p.nr_threads; t++)
1398 ret = pthread_join(pthreads[t
1399 BUG_ON(ret);
1400 }
1401
1402 free_data(process_data, g->p.bytes_pr
1403 free(pthreads);
1404 }
1405
1406 static void print_summary(void)
1407 {
1408 if (g->p.show_details < 0)
1409 return;
1410
1411 printf("\n ###\n");
1412 printf(" # %d %s will execute (on %d
1413 g->p.nr_tasks, g->p.nr_tasks
1414 printf(" # %5dx %5ldMB global s
1415 g->p.nr_loops, g->p.b
1416 printf(" # %5dx %5ldMB process s
1417 g->p.nr_loops, g->p.b
1418 printf(" # %5dx %5ldMB thread l
1419 g->p.nr_loops, g->p.b
1420
1421 printf(" ###\n");
1422
1423 printf("\n ###\n"); fflush(stdout);
1424 }
1425
1426 static void init_thread_data(void)
1427 {
1428 ssize_t size = sizeof(*g->threads)*g-
1429 int t;
1430
1431 g->threads = zalloc_shared_data(size)
1432
1433 for (t = 0; t < g->p.nr_tasks; t++) {
1434 struct thread_data *td = g->t
1435 size_t cpuset_size = CPU_ALLO
1436 int cpu;
1437
1438 /* Allow all nodes by default
1439 td->bind_node = NUMA_NO_NODE;
1440
1441 /* Allow all CPUs by default:
1442 td->bind_cpumask = CPU_ALLOC(
1443 BUG_ON(!td->bind_cpumask);
1444 CPU_ZERO_S(cpuset_size, td->b
1445 for (cpu = 0; cpu < g->p.nr_c
1446 CPU_SET_S(cpu, cpuset
1447 }
1448 }
1449
1450 static void deinit_thread_data(void)
1451 {
1452 ssize_t size = sizeof(*g->threads)*g-
1453 int t;
1454
1455 /* Free the bind_cpumask allocated fo
1456 for (t = 0; t < g->p.nr_tasks; t++) {
1457 struct thread_data *td = g->t
1458 CPU_FREE(td->bind_cpumask);
1459 }
1460
1461 free_data(g->threads, size);
1462 }
1463
1464 static int init(void)
1465 {
1466 g = (void *)alloc_data(sizeof(*g), MA
1467
1468 /* Copy over options: */
1469 g->p = p0;
1470
1471 g->p.nr_cpus = numa_num_configured_cp
1472
1473 g->p.nr_nodes = numa_max_node() + 1;
1474
1475 /* char array in count_process_nodes(
1476 BUG_ON(g->p.nr_nodes < 0);
1477
1478 if (quiet && !g->p.show_details)
1479 g->p.show_details = -1;
1480
1481 /* Some memory should be specified: *
1482 if (!g->p.mb_global_str && !g->p.mb_p
1483 return -1;
1484
1485 if (g->p.mb_global_str) {
1486 g->p.mb_global = atof(g->p.mb
1487 BUG_ON(g->p.mb_global < 0);
1488 }
1489
1490 if (g->p.mb_proc_str) {
1491 g->p.mb_proc = atof(g->p.mb_p
1492 BUG_ON(g->p.mb_proc < 0);
1493 }
1494
1495 if (g->p.mb_proc_locked_str) {
1496 g->p.mb_proc_locked = atof(g-
1497 BUG_ON(g->p.mb_proc_locked <
1498 BUG_ON(g->p.mb_proc_locked >
1499 }
1500
1501 if (g->p.mb_thread_str) {
1502 g->p.mb_thread = atof(g->p.mb
1503 BUG_ON(g->p.mb_thread < 0);
1504 }
1505
1506 BUG_ON(g->p.nr_threads <= 0);
1507 BUG_ON(g->p.nr_proc <= 0);
1508
1509 g->p.nr_tasks = g->p.nr_proc*g->p.nr_
1510
1511 g->p.bytes_global = g->
1512 g->p.bytes_process = g->
1513 g->p.bytes_process_locked = g->
1514 g->p.bytes_thread = g->
1515
1516 g->data = setup_shared_data(g->p.byte
1517
1518 /* Startup serialization: */
1519 mutex_init_pshared(&g->start_work_mut
1520 cond_init_pshared(&g->start_work_cond
1521 mutex_init_pshared(&g->startup_mutex)
1522 cond_init_pshared(&g->startup_cond);
1523 mutex_init_pshared(&g->stop_work_mute
1524
1525 init_thread_data();
1526
1527 tprintf("#\n");
1528 if (parse_setup_cpu_list() || parse_s
1529 return -1;
1530 tprintf("#\n");
1531
1532 print_summary();
1533
1534 return 0;
1535 }
1536
1537 static void deinit(void)
1538 {
1539 free_data(g->data, g->p.bytes_global)
1540 g->data = NULL;
1541
1542 deinit_thread_data();
1543
1544 free_data(g, sizeof(*g));
1545 g = NULL;
1546 }
1547
1548 /*
1549 * Print a short or long result, depending on
1550 */
1551 static void print_res(const char *name, doubl
1552 const char *txt_unit, c
1553 {
1554 if (!name)
1555 name = "main,";
1556
1557 if (!quiet)
1558 printf(" %-30s %15.3f, %-15s
1559 else
1560 printf(" %14.3f %s\n", val, t
1561 }
1562
1563 static int __bench_numa(const char *name)
1564 {
1565 struct timeval start, stop, diff;
1566 u64 runtime_ns_min, runtime_ns_sum;
1567 pid_t *pids, pid, wpid;
1568 double delta_runtime;
1569 double runtime_avg;
1570 double runtime_sec_max;
1571 double runtime_sec_min;
1572 int wait_stat;
1573 double bytes;
1574 int i, t, p;
1575
1576 if (init())
1577 return -1;
1578
1579 pids = zalloc(g->p.nr_proc * sizeof(*
1580 pid = -1;
1581
1582 if (g->p.serialize_startup) {
1583 tprintf(" #\n");
1584 tprintf(" # Startup synchroni
1585 }
1586
1587 gettimeofday(&start, NULL);
1588
1589 for (i = 0; i < g->p.nr_proc; i++) {
1590 pid = fork();
1591 dprintf(" # process %2d: PID
1592
1593 BUG_ON(pid < 0);
1594 if (!pid) {
1595 /* Child process: */
1596 worker_process(i);
1597
1598 exit(0);
1599 }
1600 pids[i] = pid;
1601
1602 }
1603
1604 if (g->p.serialize_startup) {
1605 bool threads_ready = false;
1606 double startup_sec;
1607
1608 /*
1609 * Wait for all the threads t
1610 * signal this process.
1611 */
1612 mutex_lock(&g->startup_mutex)
1613 while (g->nr_tasks_started !=
1614 cond_wait(&g->startup
1615
1616 mutex_unlock(&g->startup_mute
1617
1618 /* Wait for all threads to be
1619 while (!threads_ready) {
1620 mutex_lock(&g->start_
1621 threads_ready = (g->n
1622 mutex_unlock(&g->star
1623 if (!threads_ready)
1624 usleep(1);
1625 }
1626
1627 gettimeofday(&stop, NULL);
1628
1629 timersub(&stop, &start, &diff
1630
1631 startup_sec = diff.tv_sec * N
1632 startup_sec += diff.tv_usec *
1633 startup_sec /= NSEC_PER_SEC;
1634
1635 tprintf(" threads initialized
1636 tprintf(" #\n");
1637
1638 start = stop;
1639 /* Start all threads running.
1640 mutex_lock(&g->start_work_mut
1641 g->start_work = true;
1642 mutex_unlock(&g->start_work_m
1643 cond_broadcast(&g->start_work
1644 } else {
1645 gettimeofday(&start, NULL);
1646 }
1647
1648 /* Parent process: */
1649
1650
1651 for (i = 0; i < g->p.nr_proc; i++) {
1652 wpid = waitpid(pids[i], &wait
1653 BUG_ON(wpid < 0);
1654 BUG_ON(!WIFEXITED(wait_stat))
1655
1656 }
1657
1658 runtime_ns_sum = 0;
1659 runtime_ns_min = -1LL;
1660
1661 for (t = 0; t < g->p.nr_tasks; t++) {
1662 u64 thread_runtime_ns = g->th
1663
1664 runtime_ns_sum += thread_runt
1665 runtime_ns_min = min(thread_r
1666 }
1667
1668 gettimeofday(&stop, NULL);
1669 timersub(&stop, &start, &diff);
1670
1671 BUG_ON(bench_format != BENCH_FORMAT_D
1672
1673 tprintf("\n ###\n");
1674 tprintf("\n");
1675
1676 runtime_sec_max = diff.tv_sec * NSEC_
1677 runtime_sec_max += diff.tv_usec * NSE
1678 runtime_sec_max /= NSEC_PER_SEC;
1679
1680 runtime_sec_min = runtime_ns_min / NS
1681
1682 bytes = g->bytes_done;
1683 runtime_avg = (double)runtime_ns_sum
1684
1685 if (g->p.measure_convergence) {
1686 print_res(name, runtime_sec_m
1687 "secs,", "NUMA-conver
1688 }
1689
1690 print_res(name, runtime_sec_max,
1691 "secs,", "runtime-max/thread"
1692
1693 print_res(name, runtime_sec_min,
1694 "secs,", "runtime-min/thread"
1695
1696 print_res(name, runtime_avg,
1697 "secs,", "runtime-avg/thread"
1698
1699 delta_runtime = (runtime_sec_max - ru
1700 print_res(name, delta_runtime / runti
1701 "%,", "spread-runtime/thread"
1702
1703 print_res(name, bytes / g->p.nr_tasks
1704 "GB,", "data/thread",
1705
1706 print_res(name, bytes / 1e9,
1707 "GB,", "data-total",
1708
1709 print_res(name, runtime_sec_max * NSE
1710 "nsecs,", "runtime/byte/threa
1711
1712 print_res(name, bytes / g->p.nr_tasks
1713 "GB/sec,", "thread-speed",
1714
1715 print_res(name, bytes / runtime_sec_m
1716 "GB/sec,", "total-speed",
1717
1718 if (g->p.show_details >= 2) {
1719 char tname[14 + 2 * 11 + 1];
1720 struct thread_data *td;
1721 for (p = 0; p < g->p.nr_proc;
1722 for (t = 0; t < g->p.
1723 memset(tname,
1724 td = g->threa
1725 snprintf(tnam
1726 print_res(tna
1727 "GB/s
1728 print_res(tna
1729 "secs
1730 print_res(tna
1731 "secs
1732 }
1733 }
1734 }
1735
1736 free(pids);
1737
1738 deinit();
1739
1740 return 0;
1741 }
1742
1743 #define MAX_ARGS 50
1744
1745 static int command_size(const char **argv)
1746 {
1747 int size = 0;
1748
1749 while (*argv) {
1750 size++;
1751 argv++;
1752 }
1753
1754 BUG_ON(size >= MAX_ARGS);
1755
1756 return size;
1757 }
1758
1759 static void init_params(struct params *p, con
1760 {
1761 int i;
1762
1763 printf("\n # Running %s \"perf bench
1764
1765 for (i = 0; i < argc; i++)
1766 printf(" %s", argv[i]);
1767
1768 printf("\"\n");
1769
1770 memset(p, 0, sizeof(*p));
1771
1772 /* Initialize nonzero defaults: */
1773
1774 p->serialize_startup = 1;
1775 p->data_reads = tru
1776 p->data_writes = tru
1777 p->data_backwards = tru
1778 p->data_rand_walk = tru
1779 p->nr_loops = -1;
1780 p->init_random = tru
1781 p->mb_global_str = "1"
1782 p->nr_proc = 1;
1783 p->nr_threads = 1;
1784 p->nr_secs = 5;
1785 p->run_all = arg
1786 }
1787
1788 static int run_bench_numa(const char *name, c
1789 {
1790 int argc = command_size(argv);
1791
1792 init_params(&p0, name, argc, argv);
1793 argc = parse_options(argc, argv, opti
1794 if (argc)
1795 goto err;
1796
1797 if (__bench_numa(name))
1798 goto err;
1799
1800 return 0;
1801
1802 err:
1803 return -1;
1804 }
1805
1806 #define OPT_BW_RAM "-s", "20",
1807 #define OPT_BW_RAM_NOTHP OPT_BW_RAM,
1808
1809 #define OPT_CONV "-s", "100",
1810 #define OPT_CONV_NOTHP OPT_CONV,
1811
1812 #define OPT_BW "-s", "20",
1813 #define OPT_BW_NOTHP OPT_BW,
1814
1815 /*
1816 * The built-in test-suite executed by "perf
1817 *
1818 * (A minimum of 4 nodes and 16 GB of RAM is
1819 */
1820 static const char *tests[][MAX_ARGS] = {
1821 /* Basic single-stream NUMA bandwidth meas
1822 { "RAM-bw-local,", "mem", "-p", "1",
1823 "-C" , "", "-M",
1824 { "RAM-bw-local-NOTHP,",
1825 "mem", "-p", "1",
1826 "-C" , "", "-M",
1827 { "RAM-bw-remote,", "mem", "-p", "1",
1828 "-C" , "", "-M",
1829
1830 /* 2-stream NUMA bandwidth measurements: *
1831 { "RAM-bw-local-2x,", "mem", "-p", "2",
1832 "-C", "0,2", "-M",
1833 { "RAM-bw-remote-2x,", "mem", "-p", "2",
1834 "-C", "0,2", "-M",
1835
1836 /* Cross-stream NUMA bandwidth measurement
1837 { "RAM-bw-cross,", "mem", "-p", "2",
1838 "-C", "0,8", "-M",
1839
1840 /* Convergence latency measurements: */
1841 { " 1x3-convergence,", "mem", "-p", "1",
1842 { " 1x4-convergence,", "mem", "-p", "1",
1843 { " 1x6-convergence,", "mem", "-p", "1",
1844 { " 2x3-convergence,", "mem", "-p", "2",
1845 { " 3x3-convergence,", "mem", "-p", "3",
1846 { " 4x4-convergence,", "mem", "-p", "4",
1847 { " 4x4-convergence-NOTHP,",
1848 "mem", "-p", "4",
1849 { " 4x6-convergence,", "mem", "-p", "4",
1850 { " 4x8-convergence,", "mem", "-p", "4",
1851 { " 8x4-convergence,", "mem", "-p", "8",
1852 { " 8x4-convergence-NOTHP,",
1853 "mem", "-p", "8",
1854 { " 3x1-convergence,", "mem", "-p", "3",
1855 { " 4x1-convergence,", "mem", "-p", "4",
1856 { " 8x1-convergence,", "mem", "-p", "8",
1857 { "16x1-convergence,", "mem", "-p", "16",
1858 { "32x1-convergence,", "mem", "-p", "32",
1859
1860 /* Various NUMA process/thread layout band
1861 { " 2x1-bw-process,", "mem", "-p", "2",
1862 { " 3x1-bw-process,", "mem", "-p", "3",
1863 { " 4x1-bw-process,", "mem", "-p", "4",
1864 { " 8x1-bw-process,", "mem", "-p", "8",
1865 { " 8x1-bw-process-NOTHP,",
1866 "mem", "-p", "8",
1867 { "16x1-bw-process,", "mem", "-p", "16",
1868
1869 { " 1x4-bw-thread,", "mem", "-p", "1",
1870 { " 1x8-bw-thread,", "mem", "-p", "1",
1871 { "1x16-bw-thread,", "mem", "-p", "1",
1872 { "1x32-bw-thread,", "mem", "-p", "1",
1873
1874 { " 2x3-bw-process,", "mem", "-p", "2",
1875 { " 4x4-bw-process,", "mem", "-p", "4",
1876 { " 4x6-bw-process,", "mem", "-p", "4",
1877 { " 4x8-bw-process,", "mem", "-p", "4",
1878 { " 4x8-bw-process-NOTHP,",
1879 "mem", "-p", "4",
1880 { " 3x3-bw-process,", "mem", "-p", "3",
1881 { " 5x5-bw-process,", "mem", "-p", "5",
1882
1883 { "2x16-bw-process,", "mem", "-p", "2",
1884 { "1x32-bw-process,", "mem", "-p", "1",
1885
1886 { "numa02-bw,", "mem", "-p", "1",
1887 { "numa02-bw-NOTHP,", "mem", "-p", "1",
1888 { "numa01-bw-thread,", "mem", "-p", "2",
1889 { "numa01-bw-thread-NOTHP,",
1890 "mem", "-p", "2",
1891 };
1892
1893 static int bench_all(void)
1894 {
1895 int nr = ARRAY_SIZE(tests);
1896 int ret;
1897 int i;
1898
1899 ret = system("echo ' #'; echo ' # Run
1900 BUG_ON(ret < 0);
1901
1902 for (i = 0; i < nr; i++) {
1903 run_bench_numa(tests[i][0], t
1904 }
1905
1906 printf("\n");
1907
1908 return 0;
1909 }
1910
1911 int bench_numa(int argc, const char **argv)
1912 {
1913 init_params(&p0, "main,", argc, argv)
1914 argc = parse_options(argc, argv, opti
1915 if (argc)
1916 goto err;
1917
1918 if (p0.run_all)
1919 return bench_all();
1920
1921 if (__bench_numa(NULL))
1922 goto err;
1923
1924 return 0;
1925
1926 err:
1927 usage_with_options(numa_usage, option
1928 return -1;
1929 }
1930
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.