-
Notifications
You must be signed in to change notification settings - Fork 0
/
builtin-migrate.c
152 lines (136 loc) · 4.34 KB
/
builtin-migrate.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
/*
Copyright (C) 2013
Baptiste Lepers <baptiste.lepers@gmail.com>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
version 2, as published by the Free Software Foundation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "parse.h"
#include "numa.h"
#include <linux/mempolicy.h>
#include "builtin-migrate.h"
static int pid;
struct page {
int *accesses;
void *addr;
};
struct pages_array {
void **pages;
int *nodes;
int *status;
int count, max_count;
} pages_array;
static rbtree migrate_tree;
void migrate_init() {
if(geteuid() != 0)
die("Please use --migrate as root\n");
migrate_tree = rbtree_create();
}
#define CLUSTER 512
void migrate_parse(struct s* s) {
if(!s->ibs_dc_phys)
return;
void *addr = (void*)((s->ibs_dc_linear / PAGE_SIZE / CLUSTER ) * (PAGE_SIZE * CLUSTER));
struct page* v = rbtree_lookup(migrate_tree, addr, pointer_cmp);
if(!v) {
v = calloc(1, sizeof(*v));
v->addr = addr;
v->accesses = calloc(1, sizeof(*v->accesses)*max_node);
rbtree_insert(migrate_tree, addr, v, pointer_cmp);
}
v->accesses[cpu_to_node(s->cpu)]++;
pid = get_pid(s);
}
static int page_to_most_accessing_die(struct page *p) {
int max = p->accesses[0], die = 0, i;
for(i = 1; i < max_node; i++) {
if(p->accesses[i] > max) {
max = p->accesses[i];
die = i;
}
}
return die;
}
static void insert_page(struct page* value, int node) {
if(!pages_array.max_count) {
pages_array.count = 0;
pages_array.max_count = 512;
pages_array.pages = malloc(sizeof(*pages_array.pages)*pages_array.max_count);
pages_array.nodes = malloc(sizeof(*pages_array.nodes)*pages_array.max_count);
}
if(pages_array.count == pages_array.max_count) {
pages_array.max_count *= 2;
pages_array.pages = realloc(pages_array.pages, sizeof(*pages_array.pages)*pages_array.max_count);
pages_array.nodes = realloc(pages_array.nodes, sizeof(*pages_array.nodes)*pages_array.max_count);
}
pages_array.pages[pages_array.count] = value->addr;
pages_array.nodes[pages_array.count] = node;
pages_array.count++;
}
static int fill_page_to_migrate(void *key, void *value) {
int i, node = page_to_most_accessing_die(value);
struct page *v = value;
v->addr += PAGE_SIZE*CLUSTER/2;
for(i = 0; i < CLUSTER; i++) {
insert_page(v, node);
v->addr -= PAGE_SIZE;
}
return 0;
}
static char *move_pages_to_error_code(int code) {
switch(code) {
case E2BIG:
return "E2BIG";
case EACCES:
return "EACCESS";
case EFAULT:
return "EFAULT";
case ENODEV:
return "ENODEV";
case ENOENT:
return "ENOENT";
case EPERM:
return "EPERM";
case ESRCH:
return "ESRCH";
default:
return "-";
}
}
static char *status_to_error(int st) {
switch(st) {
case -EACCES:
return "EACCES pages used by multiples processes";
case -EBUSY:
return "EBUSY page (IO or reference inside kernel)";
case -EFAULT:
return "EFAULT";
case -EIO:
return "EIO";
case -EINVAL:
return "EINVAL?";
case -ENOENT:
return "ENOENT";
case -ENOMEM:
return "ENOMEM NO MEMORY";
default:
return "-";
}
}
void migrate_show() {
rbtree_print(migrate_tree, fill_page_to_migrate);
pages_array.status = malloc(sizeof(*pages_array.status)*pages_array.count);
int ret = numa_move_pages(pid, pages_array.count, pages_array.pages, pages_array.nodes, pages_array.status, MPOL_MF_MOVE_ALL);
printf("#%d pages migrated (result = %d %s)\n", pages_array.count, ret, move_pages_to_error_code(ret));
int i;
for(i = 0; i < pages_array.count; i++) {
printf("#%lx %d %d %s\n", (long unsigned)pages_array.pages[i], pages_array.nodes[i], pages_array.status[i], status_to_error(pages_array.status[i]));
}
}