Lines Matching defs:map
23 struct perf_cpu_map *map;
25 map = perf_cpu_map__empty_new(cpus->nr);
26 if (map) {
32 * and we need to use (int) -1 to initialize map[i],
36 map->map[i] = -1;
38 map->map[i] = (int) cpus->cpu[i];
42 return map;
47 struct perf_cpu_map *map;
52 map = perf_cpu_map__empty_new(nr);
53 if (map) {
57 map->map[i++] = cpu;
59 return map;
71 size_t cpu_map__fprintf(struct perf_cpu_map *map, FILE *fp)
76 cpu_map__snprint(map, buf, sizeof(buf));
90 cpus->map[i] = -1;
114 int cpu_map__get_socket(struct perf_cpu_map *map, int idx, void *data __maybe_unused)
118 if (idx > map->nr)
121 cpu = map->map[idx];
132 int (*f)(struct perf_cpu_map *map, int cpu, void *data),
147 if (s1 == c->map[s2])
151 c->map[c->nr] = s1;
156 qsort(c->map, c->nr, sizeof(int), cmp_ids);
170 int cpu_map__get_die(struct perf_cpu_map *map, int idx, void *data)
174 if (idx > map->nr)
177 cpu = map->map[idx];
184 s = cpu_map__get_socket(map, idx, data);
214 int cpu_map__get_core(struct perf_cpu_map *map, int idx, void *data)
218 if (idx > map->nr)
221 cpu = map->map[idx];
226 s_die = cpu_map__get_die(map, idx, data);
243 int cpu_map__get_node(struct perf_cpu_map *map, int idx, void *data __maybe_unused)
245 if (idx < 0 || idx >= map->nr)
248 return cpu_map__get_node_id(map->map[idx]);
453 /* walk tree and setup map */
485 return cpus->map[idx];
488 size_t cpu_map__snprint(struct perf_cpu_map *map, char *buf, size_t size)
496 for (i = 0; i < map->nr + 1; i++) {
497 bool last = i == map->nr;
499 cpu = last ? INT_MAX : map->map[i];
506 map->map[i]);
508 } else if (((i - start) != (cpu - map->map[start])) || last) {
514 map->map[start]);
518 map->map[start], map->map[end]);
540 size_t cpu_map__snprint_mask(struct perf_cpu_map *map, char *buf, size_t size)
545 int last_cpu = cpu_map__cpu(map, map->nr - 1);
556 for (i = 0; i < map->nr; i++) {
557 cpu = cpu_map__cpu(map, i);