Linux Audio

Check our new training course

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