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