Loading...
1#include "util.h"
2#include <api/fs/fs.h>
3#include "../perf.h"
4#include "cpumap.h"
5#include <assert.h>
6#include <stdio.h>
7#include <stdlib.h>
8#include <linux/bitmap.h>
9#include "asm/bug.h"
10
11static int max_cpu_num;
12static int max_node_num;
13static int *cpunode_map;
14
15static struct cpu_map *cpu_map__default_new(void)
16{
17 struct cpu_map *cpus;
18 int nr_cpus;
19
20 nr_cpus = sysconf(_SC_NPROCESSORS_ONLN);
21 if (nr_cpus < 0)
22 return NULL;
23
24 cpus = malloc(sizeof(*cpus) + nr_cpus * sizeof(int));
25 if (cpus != NULL) {
26 int i;
27 for (i = 0; i < nr_cpus; ++i)
28 cpus->map[i] = i;
29
30 cpus->nr = nr_cpus;
31 atomic_set(&cpus->refcnt, 1);
32 }
33
34 return cpus;
35}
36
37static struct cpu_map *cpu_map__trim_new(int nr_cpus, int *tmp_cpus)
38{
39 size_t payload_size = nr_cpus * sizeof(int);
40 struct cpu_map *cpus = malloc(sizeof(*cpus) + payload_size);
41
42 if (cpus != NULL) {
43 cpus->nr = nr_cpus;
44 memcpy(cpus->map, tmp_cpus, payload_size);
45 atomic_set(&cpus->refcnt, 1);
46 }
47
48 return cpus;
49}
50
51struct cpu_map *cpu_map__read(FILE *file)
52{
53 struct cpu_map *cpus = NULL;
54 int nr_cpus = 0;
55 int *tmp_cpus = NULL, *tmp;
56 int max_entries = 0;
57 int n, cpu, prev;
58 char sep;
59
60 sep = 0;
61 prev = -1;
62 for (;;) {
63 n = fscanf(file, "%u%c", &cpu, &sep);
64 if (n <= 0)
65 break;
66 if (prev >= 0) {
67 int new_max = nr_cpus + cpu - prev - 1;
68
69 if (new_max >= max_entries) {
70 max_entries = new_max + MAX_NR_CPUS / 2;
71 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
72 if (tmp == NULL)
73 goto out_free_tmp;
74 tmp_cpus = tmp;
75 }
76
77 while (++prev < cpu)
78 tmp_cpus[nr_cpus++] = prev;
79 }
80 if (nr_cpus == max_entries) {
81 max_entries += MAX_NR_CPUS;
82 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
83 if (tmp == NULL)
84 goto out_free_tmp;
85 tmp_cpus = tmp;
86 }
87
88 tmp_cpus[nr_cpus++] = cpu;
89 if (n == 2 && sep == '-')
90 prev = cpu;
91 else
92 prev = -1;
93 if (n == 1 || sep == '\n')
94 break;
95 }
96
97 if (nr_cpus > 0)
98 cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
99 else
100 cpus = cpu_map__default_new();
101out_free_tmp:
102 free(tmp_cpus);
103 return cpus;
104}
105
106static struct cpu_map *cpu_map__read_all_cpu_map(void)
107{
108 struct cpu_map *cpus = NULL;
109 FILE *onlnf;
110
111 onlnf = fopen("/sys/devices/system/cpu/online", "r");
112 if (!onlnf)
113 return cpu_map__default_new();
114
115 cpus = cpu_map__read(onlnf);
116 fclose(onlnf);
117 return cpus;
118}
119
120struct cpu_map *cpu_map__new(const char *cpu_list)
121{
122 struct cpu_map *cpus = NULL;
123 unsigned long start_cpu, end_cpu = 0;
124 char *p = NULL;
125 int i, nr_cpus = 0;
126 int *tmp_cpus = NULL, *tmp;
127 int max_entries = 0;
128
129 if (!cpu_list)
130 return cpu_map__read_all_cpu_map();
131
132 if (!isdigit(*cpu_list))
133 goto out;
134
135 while (isdigit(*cpu_list)) {
136 p = NULL;
137 start_cpu = strtoul(cpu_list, &p, 0);
138 if (start_cpu >= INT_MAX
139 || (*p != '\0' && *p != ',' && *p != '-'))
140 goto invalid;
141
142 if (*p == '-') {
143 cpu_list = ++p;
144 p = NULL;
145 end_cpu = strtoul(cpu_list, &p, 0);
146
147 if (end_cpu >= INT_MAX || (*p != '\0' && *p != ','))
148 goto invalid;
149
150 if (end_cpu < start_cpu)
151 goto invalid;
152 } else {
153 end_cpu = start_cpu;
154 }
155
156 for (; start_cpu <= end_cpu; start_cpu++) {
157 /* check for duplicates */
158 for (i = 0; i < nr_cpus; i++)
159 if (tmp_cpus[i] == (int)start_cpu)
160 goto invalid;
161
162 if (nr_cpus == max_entries) {
163 max_entries += MAX_NR_CPUS;
164 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
165 if (tmp == NULL)
166 goto invalid;
167 tmp_cpus = tmp;
168 }
169 tmp_cpus[nr_cpus++] = (int)start_cpu;
170 }
171 if (*p)
172 ++p;
173
174 cpu_list = p;
175 }
176
177 if (nr_cpus > 0)
178 cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
179 else
180 cpus = cpu_map__default_new();
181invalid:
182 free(tmp_cpus);
183out:
184 return cpus;
185}
186
187static struct cpu_map *cpu_map__from_entries(struct cpu_map_entries *cpus)
188{
189 struct cpu_map *map;
190
191 map = cpu_map__empty_new(cpus->nr);
192 if (map) {
193 unsigned i;
194
195 for (i = 0; i < cpus->nr; i++) {
196 /*
197 * Special treatment for -1, which is not real cpu number,
198 * and we need to use (int) -1 to initialize map[i],
199 * otherwise it would become 65535.
200 */
201 if (cpus->cpu[i] == (u16) -1)
202 map->map[i] = -1;
203 else
204 map->map[i] = (int) cpus->cpu[i];
205 }
206 }
207
208 return map;
209}
210
211static struct cpu_map *cpu_map__from_mask(struct cpu_map_mask *mask)
212{
213 struct cpu_map *map;
214 int nr, nbits = mask->nr * mask->long_size * BITS_PER_BYTE;
215
216 nr = bitmap_weight(mask->mask, nbits);
217
218 map = cpu_map__empty_new(nr);
219 if (map) {
220 int cpu, i = 0;
221
222 for_each_set_bit(cpu, mask->mask, nbits)
223 map->map[i++] = cpu;
224 }
225 return map;
226
227}
228
229struct cpu_map *cpu_map__new_data(struct cpu_map_data *data)
230{
231 if (data->type == PERF_CPU_MAP__CPUS)
232 return cpu_map__from_entries((struct cpu_map_entries *)data->data);
233 else
234 return cpu_map__from_mask((struct cpu_map_mask *)data->data);
235}
236
237size_t cpu_map__fprintf(struct cpu_map *map, FILE *fp)
238{
239 int i;
240 size_t printed = fprintf(fp, "%d cpu%s: ",
241 map->nr, map->nr > 1 ? "s" : "");
242 for (i = 0; i < map->nr; ++i)
243 printed += fprintf(fp, "%s%d", i ? ", " : "", map->map[i]);
244
245 return printed + fprintf(fp, "\n");
246}
247
248struct cpu_map *cpu_map__dummy_new(void)
249{
250 struct cpu_map *cpus = malloc(sizeof(*cpus) + sizeof(int));
251
252 if (cpus != NULL) {
253 cpus->nr = 1;
254 cpus->map[0] = -1;
255 atomic_set(&cpus->refcnt, 1);
256 }
257
258 return cpus;
259}
260
261struct cpu_map *cpu_map__empty_new(int nr)
262{
263 struct cpu_map *cpus = malloc(sizeof(*cpus) + sizeof(int) * nr);
264
265 if (cpus != NULL) {
266 int i;
267
268 cpus->nr = nr;
269 for (i = 0; i < nr; i++)
270 cpus->map[i] = -1;
271
272 atomic_set(&cpus->refcnt, 1);
273 }
274
275 return cpus;
276}
277
278static void cpu_map__delete(struct cpu_map *map)
279{
280 if (map) {
281 WARN_ONCE(atomic_read(&map->refcnt) != 0,
282 "cpu_map refcnt unbalanced\n");
283 free(map);
284 }
285}
286
287struct cpu_map *cpu_map__get(struct cpu_map *map)
288{
289 if (map)
290 atomic_inc(&map->refcnt);
291 return map;
292}
293
294void cpu_map__put(struct cpu_map *map)
295{
296 if (map && atomic_dec_and_test(&map->refcnt))
297 cpu_map__delete(map);
298}
299
300static int cpu__get_topology_int(int cpu, const char *name, int *value)
301{
302 char path[PATH_MAX];
303
304 snprintf(path, PATH_MAX,
305 "devices/system/cpu/cpu%d/topology/%s", cpu, name);
306
307 return sysfs__read_int(path, value);
308}
309
310int cpu_map__get_socket_id(int cpu)
311{
312 int value, ret = cpu__get_topology_int(cpu, "physical_package_id", &value);
313 return ret ?: value;
314}
315
316int cpu_map__get_socket(struct cpu_map *map, int idx, void *data __maybe_unused)
317{
318 int cpu;
319
320 if (idx > map->nr)
321 return -1;
322
323 cpu = map->map[idx];
324
325 return cpu_map__get_socket_id(cpu);
326}
327
328static int cmp_ids(const void *a, const void *b)
329{
330 return *(int *)a - *(int *)b;
331}
332
333int cpu_map__build_map(struct cpu_map *cpus, struct cpu_map **res,
334 int (*f)(struct cpu_map *map, int cpu, void *data),
335 void *data)
336{
337 struct cpu_map *c;
338 int nr = cpus->nr;
339 int cpu, s1, s2;
340
341 /* allocate as much as possible */
342 c = calloc(1, sizeof(*c) + nr * sizeof(int));
343 if (!c)
344 return -1;
345
346 for (cpu = 0; cpu < nr; cpu++) {
347 s1 = f(cpus, cpu, data);
348 for (s2 = 0; s2 < c->nr; s2++) {
349 if (s1 == c->map[s2])
350 break;
351 }
352 if (s2 == c->nr) {
353 c->map[c->nr] = s1;
354 c->nr++;
355 }
356 }
357 /* ensure we process id in increasing order */
358 qsort(c->map, c->nr, sizeof(int), cmp_ids);
359
360 atomic_set(&c->refcnt, 1);
361 *res = c;
362 return 0;
363}
364
365int cpu_map__get_core_id(int cpu)
366{
367 int value, ret = cpu__get_topology_int(cpu, "core_id", &value);
368 return ret ?: value;
369}
370
371int cpu_map__get_core(struct cpu_map *map, int idx, void *data)
372{
373 int cpu, s;
374
375 if (idx > map->nr)
376 return -1;
377
378 cpu = map->map[idx];
379
380 cpu = cpu_map__get_core_id(cpu);
381
382 s = cpu_map__get_socket(map, idx, data);
383 if (s == -1)
384 return -1;
385
386 /*
387 * encode socket in upper 16 bits
388 * core_id is relative to socket, and
389 * we need a global id. So we combine
390 * socket+ core id
391 */
392 return (s << 16) | (cpu & 0xffff);
393}
394
395int cpu_map__build_socket_map(struct cpu_map *cpus, struct cpu_map **sockp)
396{
397 return cpu_map__build_map(cpus, sockp, cpu_map__get_socket, NULL);
398}
399
400int cpu_map__build_core_map(struct cpu_map *cpus, struct cpu_map **corep)
401{
402 return cpu_map__build_map(cpus, corep, cpu_map__get_core, NULL);
403}
404
405/* setup simple routines to easily access node numbers given a cpu number */
406static int get_max_num(char *path, int *max)
407{
408 size_t num;
409 char *buf;
410 int err = 0;
411
412 if (filename__read_str(path, &buf, &num))
413 return -1;
414
415 buf[num] = '\0';
416
417 /* start on the right, to find highest node num */
418 while (--num) {
419 if ((buf[num] == ',') || (buf[num] == '-')) {
420 num++;
421 break;
422 }
423 }
424 if (sscanf(&buf[num], "%d", max) < 1) {
425 err = -1;
426 goto out;
427 }
428
429 /* convert from 0-based to 1-based */
430 (*max)++;
431
432out:
433 free(buf);
434 return err;
435}
436
437/* Determine highest possible cpu in the system for sparse allocation */
438static void set_max_cpu_num(void)
439{
440 const char *mnt;
441 char path[PATH_MAX];
442 int ret = -1;
443
444 /* set up default */
445 max_cpu_num = 4096;
446
447 mnt = sysfs__mountpoint();
448 if (!mnt)
449 goto out;
450
451 /* get the highest possible cpu number for a sparse allocation */
452 ret = snprintf(path, PATH_MAX, "%s/devices/system/cpu/possible", mnt);
453 if (ret == PATH_MAX) {
454 pr_err("sysfs path crossed PATH_MAX(%d) size\n", PATH_MAX);
455 goto out;
456 }
457
458 ret = get_max_num(path, &max_cpu_num);
459
460out:
461 if (ret)
462 pr_err("Failed to read max cpus, using default of %d\n", max_cpu_num);
463}
464
465/* Determine highest possible node in the system for sparse allocation */
466static void set_max_node_num(void)
467{
468 const char *mnt;
469 char path[PATH_MAX];
470 int ret = -1;
471
472 /* set up default */
473 max_node_num = 8;
474
475 mnt = sysfs__mountpoint();
476 if (!mnt)
477 goto out;
478
479 /* get the highest possible cpu number for a sparse allocation */
480 ret = snprintf(path, PATH_MAX, "%s/devices/system/node/possible", mnt);
481 if (ret == PATH_MAX) {
482 pr_err("sysfs path crossed PATH_MAX(%d) size\n", PATH_MAX);
483 goto out;
484 }
485
486 ret = get_max_num(path, &max_node_num);
487
488out:
489 if (ret)
490 pr_err("Failed to read max nodes, using default of %d\n", max_node_num);
491}
492
493int cpu__max_node(void)
494{
495 if (unlikely(!max_node_num))
496 set_max_node_num();
497
498 return max_node_num;
499}
500
501int cpu__max_cpu(void)
502{
503 if (unlikely(!max_cpu_num))
504 set_max_cpu_num();
505
506 return max_cpu_num;
507}
508
509int cpu__get_node(int cpu)
510{
511 if (unlikely(cpunode_map == NULL)) {
512 pr_debug("cpu_map not initialized\n");
513 return -1;
514 }
515
516 return cpunode_map[cpu];
517}
518
519static int init_cpunode_map(void)
520{
521 int i;
522
523 set_max_cpu_num();
524 set_max_node_num();
525
526 cpunode_map = calloc(max_cpu_num, sizeof(int));
527 if (!cpunode_map) {
528 pr_err("%s: calloc failed\n", __func__);
529 return -1;
530 }
531
532 for (i = 0; i < max_cpu_num; i++)
533 cpunode_map[i] = -1;
534
535 return 0;
536}
537
538int cpu__setup_cpunode_map(void)
539{
540 struct dirent *dent1, *dent2;
541 DIR *dir1, *dir2;
542 unsigned int cpu, mem;
543 char buf[PATH_MAX];
544 char path[PATH_MAX];
545 const char *mnt;
546 int n;
547
548 /* initialize globals */
549 if (init_cpunode_map())
550 return -1;
551
552 mnt = sysfs__mountpoint();
553 if (!mnt)
554 return 0;
555
556 n = snprintf(path, PATH_MAX, "%s/devices/system/node", mnt);
557 if (n == PATH_MAX) {
558 pr_err("sysfs path crossed PATH_MAX(%d) size\n", PATH_MAX);
559 return -1;
560 }
561
562 dir1 = opendir(path);
563 if (!dir1)
564 return 0;
565
566 /* walk tree and setup map */
567 while ((dent1 = readdir(dir1)) != NULL) {
568 if (dent1->d_type != DT_DIR || sscanf(dent1->d_name, "node%u", &mem) < 1)
569 continue;
570
571 n = snprintf(buf, PATH_MAX, "%s/%s", path, dent1->d_name);
572 if (n == PATH_MAX) {
573 pr_err("sysfs path crossed PATH_MAX(%d) size\n", PATH_MAX);
574 continue;
575 }
576
577 dir2 = opendir(buf);
578 if (!dir2)
579 continue;
580 while ((dent2 = readdir(dir2)) != NULL) {
581 if (dent2->d_type != DT_LNK || sscanf(dent2->d_name, "cpu%u", &cpu) < 1)
582 continue;
583 cpunode_map[cpu] = mem;
584 }
585 closedir(dir2);
586 }
587 closedir(dir1);
588 return 0;
589}
1#include "util.h"
2#include "../perf.h"
3#include "cpumap.h"
4#include <assert.h>
5#include <stdio.h>
6
7static struct cpu_map *cpu_map__default_new(void)
8{
9 struct cpu_map *cpus;
10 int nr_cpus;
11
12 nr_cpus = sysconf(_SC_NPROCESSORS_ONLN);
13 if (nr_cpus < 0)
14 return NULL;
15
16 cpus = malloc(sizeof(*cpus) + nr_cpus * sizeof(int));
17 if (cpus != NULL) {
18 int i;
19 for (i = 0; i < nr_cpus; ++i)
20 cpus->map[i] = i;
21
22 cpus->nr = nr_cpus;
23 }
24
25 return cpus;
26}
27
28static struct cpu_map *cpu_map__trim_new(int nr_cpus, int *tmp_cpus)
29{
30 size_t payload_size = nr_cpus * sizeof(int);
31 struct cpu_map *cpus = malloc(sizeof(*cpus) + payload_size);
32
33 if (cpus != NULL) {
34 cpus->nr = nr_cpus;
35 memcpy(cpus->map, tmp_cpus, payload_size);
36 }
37
38 return cpus;
39}
40
41static struct cpu_map *cpu_map__read_all_cpu_map(void)
42{
43 struct cpu_map *cpus = NULL;
44 FILE *onlnf;
45 int nr_cpus = 0;
46 int *tmp_cpus = NULL, *tmp;
47 int max_entries = 0;
48 int n, cpu, prev;
49 char sep;
50
51 onlnf = fopen("/sys/devices/system/cpu/online", "r");
52 if (!onlnf)
53 return cpu_map__default_new();
54
55 sep = 0;
56 prev = -1;
57 for (;;) {
58 n = fscanf(onlnf, "%u%c", &cpu, &sep);
59 if (n <= 0)
60 break;
61 if (prev >= 0) {
62 int new_max = nr_cpus + cpu - prev - 1;
63
64 if (new_max >= max_entries) {
65 max_entries = new_max + MAX_NR_CPUS / 2;
66 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
67 if (tmp == NULL)
68 goto out_free_tmp;
69 tmp_cpus = tmp;
70 }
71
72 while (++prev < cpu)
73 tmp_cpus[nr_cpus++] = prev;
74 }
75 if (nr_cpus == max_entries) {
76 max_entries += MAX_NR_CPUS;
77 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
78 if (tmp == NULL)
79 goto out_free_tmp;
80 tmp_cpus = tmp;
81 }
82
83 tmp_cpus[nr_cpus++] = cpu;
84 if (n == 2 && sep == '-')
85 prev = cpu;
86 else
87 prev = -1;
88 if (n == 1 || sep == '\n')
89 break;
90 }
91
92 if (nr_cpus > 0)
93 cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
94 else
95 cpus = cpu_map__default_new();
96out_free_tmp:
97 free(tmp_cpus);
98 fclose(onlnf);
99 return cpus;
100}
101
102struct cpu_map *cpu_map__new(const char *cpu_list)
103{
104 struct cpu_map *cpus = NULL;
105 unsigned long start_cpu, end_cpu = 0;
106 char *p = NULL;
107 int i, nr_cpus = 0;
108 int *tmp_cpus = NULL, *tmp;
109 int max_entries = 0;
110
111 if (!cpu_list)
112 return cpu_map__read_all_cpu_map();
113
114 if (!isdigit(*cpu_list))
115 goto out;
116
117 while (isdigit(*cpu_list)) {
118 p = NULL;
119 start_cpu = strtoul(cpu_list, &p, 0);
120 if (start_cpu >= INT_MAX
121 || (*p != '\0' && *p != ',' && *p != '-'))
122 goto invalid;
123
124 if (*p == '-') {
125 cpu_list = ++p;
126 p = NULL;
127 end_cpu = strtoul(cpu_list, &p, 0);
128
129 if (end_cpu >= INT_MAX || (*p != '\0' && *p != ','))
130 goto invalid;
131
132 if (end_cpu < start_cpu)
133 goto invalid;
134 } else {
135 end_cpu = start_cpu;
136 }
137
138 for (; start_cpu <= end_cpu; start_cpu++) {
139 /* check for duplicates */
140 for (i = 0; i < nr_cpus; i++)
141 if (tmp_cpus[i] == (int)start_cpu)
142 goto invalid;
143
144 if (nr_cpus == max_entries) {
145 max_entries += MAX_NR_CPUS;
146 tmp = realloc(tmp_cpus, max_entries * sizeof(int));
147 if (tmp == NULL)
148 goto invalid;
149 tmp_cpus = tmp;
150 }
151 tmp_cpus[nr_cpus++] = (int)start_cpu;
152 }
153 if (*p)
154 ++p;
155
156 cpu_list = p;
157 }
158
159 if (nr_cpus > 0)
160 cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
161 else
162 cpus = cpu_map__default_new();
163invalid:
164 free(tmp_cpus);
165out:
166 return cpus;
167}
168
169struct cpu_map *cpu_map__dummy_new(void)
170{
171 struct cpu_map *cpus = malloc(sizeof(*cpus) + sizeof(int));
172
173 if (cpus != NULL) {
174 cpus->nr = 1;
175 cpus->map[0] = -1;
176 }
177
178 return cpus;
179}
180
181void cpu_map__delete(struct cpu_map *map)
182{
183 free(map);
184}