Linux Audio

Check our new training course

Yocto / OpenEmbedded training

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