Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
This patch adds the migspeed test program.
It tests the speed of migrating pages from one node to another. Diffed against numactl-1.0.2 Signed-off-by: Christoph Lameter <clameter@sgi.com>
- Loading branch information
1 parent
ad77dd3
commit d004857
Showing
3 changed files
with
227 additions
and
7 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| .\" t | ||
| .\" Copyright 2005-2007 Christoph Lameter, Silicon Graphics, Inc. | ||
| .\" | ||
| .\" based on Andi Kleen's numactl manpage | ||
| .\" | ||
| .TH MIGSPEED 8 "April 2005" "SGI" "Linux Administrator's Manual" | ||
| .SH NAME | ||
| migspeed \- Test the speed of page migration | ||
| .SH SYNOPSIS | ||
| .B migspeed | ||
| -p pages from-nodes to-nodes | ||
| .SH DESCRIPTION | ||
| .B migspeed | ||
| attempts to move a sample of pages from the indicated node to the target node | ||
| and measures the time it takes to perform the move. | ||
|
|
||
| .B -p pages | ||
|
|
||
| The default sample is 1000 pages. Override that with another number. | ||
|
|
||
| .SH NOTES | ||
| Requires an NUMA policy aware kernel with support for page migration | ||
| (Linux 2.6.16 and later). | ||
|
|
||
| .SH COPYRIGHT | ||
| Copyright 2007 Christoph Lameter, Silicon Graphics, Inc. | ||
| migratepages is under the GNU General Public License, v.2 | ||
|
|
||
| .SH SEE ALSO | ||
| .I numactl(8) | ||
|
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,185 @@ | ||
| /* | ||
| * Migration test program | ||
| * | ||
| * (C) 2007 Silicon Graphics, Inc. Christoph Lameter <clameter@sgi.com> | ||
| * | ||
| */ | ||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
| #include "numa.h" | ||
| #include <numaif.h> | ||
| #include <time.h> | ||
| #include <errno.h> | ||
| #include <malloc.h> | ||
| #include <unistd.h> | ||
| #include "util.h" | ||
|
|
||
| char *memory; | ||
|
|
||
| unsigned long pages = 1000; | ||
|
|
||
| unsigned long pagesize; | ||
|
|
||
| const char *optstr = "hvp:"; | ||
|
|
||
| char *cmd; | ||
|
|
||
| int verbose; | ||
| struct timespec start,end; | ||
|
|
||
| void usage(void) | ||
| { | ||
| printf("usage %s [-p pages] [-h] [-v] from-nodes to-nodes\n", cmd); | ||
| printf(" from and to nodes may specified in form N or N-N\n"); | ||
| printf(" -p pages number of pages to try (defaults to %ld)\n", | ||
| pages); | ||
| printf(" -v verbose\n"); | ||
| printf(" -h usage\n"); | ||
| exit(1); | ||
| } | ||
|
|
||
| int numa_exit_on_error = 1; | ||
|
|
||
| void displaymap(void) | ||
| { | ||
| FILE *f = fopen("/proc/self/numa_maps","r"); | ||
|
|
||
| if (!f) { | ||
| printf("/proc/self/numa_maps not accessible.\n"); | ||
| exit(1); | ||
| } | ||
|
|
||
| while (!feof(f)) | ||
| { | ||
| char buffer[2000]; | ||
|
|
||
| if (!fgets(buffer, sizeof(buffer), f)) | ||
| break; | ||
| if (!strstr(buffer, "bind")) | ||
| continue ; | ||
| printf(buffer); | ||
|
|
||
| } | ||
| fclose(f); | ||
| } | ||
|
|
||
| int main(int argc, char *argv[]) | ||
| { | ||
| char *p; | ||
| int option; | ||
| int error = 0; | ||
| struct timespec result; | ||
| unsigned long bytes; | ||
| double duration, mbytes; | ||
| nodemask_t from; | ||
| nodemask_t to; | ||
|
|
||
| pagesize = getpagesize(); | ||
|
|
||
| /* Command line processing */ | ||
| opterr = 1; | ||
| cmd = argv[0]; | ||
|
|
||
| while ((option = getopt(argc, argv, optstr)) != EOF) | ||
| switch (option) { | ||
| case 'h' : | ||
| case '?' : | ||
| error = 1; | ||
| break; | ||
| case 'v' : | ||
| verbose++; | ||
| break; | ||
| case 'p' : | ||
| pages = strtoul(optarg, &p, 0); | ||
| if (p == optarg || *p) | ||
| usage(); | ||
| break; | ||
| } | ||
|
|
||
| if (!argv[optind]) | ||
| usage(); | ||
|
|
||
| if (verbose > 1) | ||
| printf("numa_max_node = %d NUMA_NUM_NODES=%d\n", | ||
| numa_max_node(), NUMA_NUM_NODES); | ||
|
|
||
| from = nodemask(argv[optind]); | ||
| if (errno) { | ||
| perror("from mask"); | ||
| exit(1); | ||
| } | ||
|
|
||
| if (verbose) | ||
| printmask("From", &from); | ||
|
|
||
| if (!argv[optind+1]) | ||
| usage(); | ||
|
|
||
| to = nodemask(argv[optind+1]); | ||
| if (errno) { | ||
| perror("to mask"); | ||
| exit(1); | ||
| } | ||
|
|
||
| if (verbose) | ||
| printmask("To", &to); | ||
|
|
||
| bytes = pages * pagesize; | ||
|
|
||
| if (verbose) | ||
| printf("Allocating %lu pages of %lu bytes of memory\n", | ||
| pages, pagesize); | ||
|
|
||
| memory = memalign(pagesize, bytes); | ||
|
|
||
| if (!memory) { | ||
| printf("Out of Memory\n"); | ||
| exit(2); | ||
| } | ||
|
|
||
| if (mbind(memory, bytes, MPOL_BIND, (unsigned long *)&from, | ||
| NUMA_NUM_NODES+1, 0) < 0) | ||
| numa_error("mbind"); | ||
|
|
||
| if (verbose) | ||
| printf("Dirtying memory....\n"); | ||
|
|
||
| for (p = memory; p <= memory + bytes; p += pagesize) | ||
| *p = 1; | ||
|
|
||
| if (verbose) | ||
| printf("Starting test\n"); | ||
|
|
||
| displaymap(); | ||
| clock_gettime(CLOCK_REALTIME, &start); | ||
|
|
||
| if (mbind(memory, bytes, MPOL_BIND, (unsigned long *)&to, | ||
| NUMA_NUM_NODES+1, MPOL_MF_MOVE)<0) | ||
| numa_error("memory move"); | ||
|
|
||
| clock_gettime(CLOCK_REALTIME, &end); | ||
| displaymap(); | ||
|
|
||
| result.tv_sec = end.tv_sec - start.tv_sec; | ||
| result.tv_nsec = end.tv_nsec - start.tv_nsec; | ||
|
|
||
| if (result.tv_nsec < 0) { | ||
| result.tv_sec--; | ||
| result.tv_nsec += 1000000000; | ||
| } | ||
|
|
||
| if (result.tv_nsec >= 1000000000) { | ||
| result.tv_sec++; | ||
| result.tv_nsec -= 1000000000; | ||
| } | ||
|
|
||
| duration = result.tv_sec + result.tv_nsec / 1000000000.0; | ||
| mbytes = bytes / (1024*1024.0); | ||
|
|
||
| printf("%1.1f Mbyte migrated in %1.2f secs. %3.1f Mbytes/second\n", | ||
| mbytes, | ||
| duration, | ||
| mbytes / duration); | ||
| return 0; | ||
| } | ||
|
|