cpumap.c 3.4 KB
Newer Older
1 2 3 4 5 6
#include "util.h"
#include "../perf.h"
#include "cpumap.h"
#include <assert.h>
#include <stdio.h>

7
static struct cpu_map *cpu_map__default_new(void)
8
{
9 10
	struct cpu_map *cpus;
	int nr_cpus;
11 12

	nr_cpus = sysconf(_SC_NPROCESSORS_ONLN);
13 14 15 16 17 18 19 20
	if (nr_cpus < 0)
		return NULL;

	cpus = malloc(sizeof(*cpus) + nr_cpus * sizeof(int));
	if (cpus != NULL) {
		int i;
		for (i = 0; i < nr_cpus; ++i)
			cpus->map[i] = i;
21

22 23
		cpus->nr = nr_cpus;
	}
24

25
	return cpus;
26 27
}

28
static struct cpu_map *cpu_map__trim_new(int nr_cpus, int *tmp_cpus)
29
{
30 31 32 33 34 35 36 37 38 39 40 41 42 43
	size_t payload_size = nr_cpus * sizeof(int);
	struct cpu_map *cpus = malloc(sizeof(*cpus) + payload_size);

	if (cpus != NULL) {
		cpus->nr = nr_cpus;
		memcpy(cpus->map, tmp_cpus, payload_size);
	}

	return cpus;
}

static struct cpu_map *cpu_map__read_all_cpu_map(void)
{
	struct cpu_map *cpus = NULL;
44 45
	FILE *onlnf;
	int nr_cpus = 0;
46 47
	int *tmp_cpus = NULL, *tmp;
	int max_entries = 0;
48 49 50 51 52
	int n, cpu, prev;
	char sep;

	onlnf = fopen("/sys/devices/system/cpu/online", "r");
	if (!onlnf)
53
		return cpu_map__default_new();
54 55 56 57 58 59 60 61

	sep = 0;
	prev = -1;
	for (;;) {
		n = fscanf(onlnf, "%u%c", &cpu, &sep);
		if (n <= 0)
			break;
		if (prev >= 0) {
62 63 64 65 66 67 68 69 70 71
			int new_max = nr_cpus + cpu - prev - 1;

			if (new_max >= max_entries) {
				max_entries = new_max + MAX_NR_CPUS / 2;
				tmp = realloc(tmp_cpus, max_entries * sizeof(int));
				if (tmp == NULL)
					goto out_free_tmp;
				tmp_cpus = tmp;
			}

72
			while (++prev < cpu)
73 74 75 76 77 78 79 80
				tmp_cpus[nr_cpus++] = prev;
		}
		if (nr_cpus == max_entries) {
			max_entries += MAX_NR_CPUS;
			tmp = realloc(tmp_cpus, max_entries * sizeof(int));
			if (tmp == NULL)
				goto out_free_tmp;
			tmp_cpus = tmp;
81
		}
82 83

		tmp_cpus[nr_cpus++] = cpu;
84 85 86 87 88 89 90 91
		if (n == 2 && sep == '-')
			prev = cpu;
		else
			prev = -1;
		if (n == 1 || sep == '\n')
			break;
	}

92 93 94 95 96 97 98 99
	if (nr_cpus > 0)
		cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
	else
		cpus = cpu_map__default_new();
out_free_tmp:
	free(tmp_cpus);
	fclose(onlnf);
	return cpus;
100
}
101

102
struct cpu_map *cpu_map__new(const char *cpu_list)
103
{
104
	struct cpu_map *cpus = NULL;
105 106 107
	unsigned long start_cpu, end_cpu = 0;
	char *p = NULL;
	int i, nr_cpus = 0;
108 109
	int *tmp_cpus = NULL, *tmp;
	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 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140

	while (isdigit(*cpu_list)) {
		p = NULL;
		start_cpu = strtoul(cpu_list, &p, 0);
		if (start_cpu >= INT_MAX
		    || (*p != '\0' && *p != ',' && *p != '-'))
			goto invalid;

		if (*p == '-') {
			cpu_list = ++p;
			p = NULL;
			end_cpu = strtoul(cpu_list, &p, 0);

			if (end_cpu >= INT_MAX || (*p != '\0' && *p != ','))
				goto invalid;

			if (end_cpu < start_cpu)
				goto invalid;
		} else {
			end_cpu = start_cpu;
		}

		for (; start_cpu <= end_cpu; start_cpu++) {
			/* check for duplicates */
			for (i = 0; i < nr_cpus; i++)
141
				if (tmp_cpus[i] == (int)start_cpu)
142 143
					goto invalid;

144 145 146 147 148 149 150 151
			if (nr_cpus == max_entries) {
				max_entries += MAX_NR_CPUS;
				tmp = realloc(tmp_cpus, max_entries * sizeof(int));
				if (tmp == NULL)
					goto invalid;
				tmp_cpus = tmp;
			}
			tmp_cpus[nr_cpus++] = (int)start_cpu;
152 153 154 155 156 157 158
		}
		if (*p)
			++p;

		cpu_list = p;
	}

159 160 161 162
	if (nr_cpus > 0)
		cpus = cpu_map__trim_new(nr_cpus, tmp_cpus);
	else
		cpus = cpu_map__default_new();
163
invalid:
164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
	free(tmp_cpus);
out:
	return cpus;
}

struct cpu_map *cpu_map__dummy_new(void)
{
	struct cpu_map *cpus = malloc(sizeof(*cpus) + sizeof(int));

	if (cpus != NULL) {
		cpus->nr = 1;
		cpus->map[0] = -1;
	}

	return cpus;
179
}