1 // SPDX-License-Identifier: GPL-2.0 2 #include "cpumap.h" 3 #include "debug.h" 4 #include "env.h" 5 #include "util/header.h" 6 #include <linux/ctype.h> 7 #include <linux/zalloc.h> 8 #include "cgroup.h" 9 #include <errno.h> 10 #include <sys/utsname.h> 11 #include <stdlib.h> 12 #include <string.h> 13 14 struct perf_env perf_env; 15 16 #ifdef HAVE_LIBBPF_SUPPORT 17 #include "bpf-event.h" 18 #include <bpf/libbpf.h> 19 20 void perf_env__insert_bpf_prog_info(struct perf_env *env, 21 struct bpf_prog_info_node *info_node) 22 { 23 __u32 prog_id = info_node->info_linear->info.id; 24 struct bpf_prog_info_node *node; 25 struct rb_node *parent = NULL; 26 struct rb_node **p; 27 28 down_write(&env->bpf_progs.lock); 29 p = &env->bpf_progs.infos.rb_node; 30 31 while (*p != NULL) { 32 parent = *p; 33 node = rb_entry(parent, struct bpf_prog_info_node, rb_node); 34 if (prog_id < node->info_linear->info.id) { 35 p = &(*p)->rb_left; 36 } else if (prog_id > node->info_linear->info.id) { 37 p = &(*p)->rb_right; 38 } else { 39 pr_debug("duplicated bpf prog info %u\n", prog_id); 40 goto out; 41 } 42 } 43 44 rb_link_node(&info_node->rb_node, parent, p); 45 rb_insert_color(&info_node->rb_node, &env->bpf_progs.infos); 46 env->bpf_progs.infos_cnt++; 47 out: 48 up_write(&env->bpf_progs.lock); 49 } 50 51 struct bpf_prog_info_node *perf_env__find_bpf_prog_info(struct perf_env *env, 52 __u32 prog_id) 53 { 54 struct bpf_prog_info_node *node = NULL; 55 struct rb_node *n; 56 57 down_read(&env->bpf_progs.lock); 58 n = env->bpf_progs.infos.rb_node; 59 60 while (n) { 61 node = rb_entry(n, struct bpf_prog_info_node, rb_node); 62 if (prog_id < node->info_linear->info.id) 63 n = n->rb_left; 64 else if (prog_id > node->info_linear->info.id) 65 n = n->rb_right; 66 else 67 goto out; 68 } 69 node = NULL; 70 71 out: 72 up_read(&env->bpf_progs.lock); 73 return node; 74 } 75 76 void perf_env__insert_btf(struct perf_env *env, struct btf_node *btf_node) 77 { 78 struct rb_node *parent = NULL; 79 __u32 btf_id = btf_node->id; 80 struct btf_node *node; 81 struct rb_node **p; 82 83 down_write(&env->bpf_progs.lock); 84 p = &env->bpf_progs.btfs.rb_node; 85 86 while (*p != NULL) { 87 parent = *p; 88 node = rb_entry(parent, struct btf_node, rb_node); 89 if (btf_id < node->id) { 90 p = &(*p)->rb_left; 91 } else if (btf_id > node->id) { 92 p = &(*p)->rb_right; 93 } else { 94 pr_debug("duplicated btf %u\n", btf_id); 95 goto out; 96 } 97 } 98 99 rb_link_node(&btf_node->rb_node, parent, p); 100 rb_insert_color(&btf_node->rb_node, &env->bpf_progs.btfs); 101 env->bpf_progs.btfs_cnt++; 102 out: 103 up_write(&env->bpf_progs.lock); 104 } 105 106 struct btf_node *perf_env__find_btf(struct perf_env *env, __u32 btf_id) 107 { 108 struct btf_node *node = NULL; 109 struct rb_node *n; 110 111 down_read(&env->bpf_progs.lock); 112 n = env->bpf_progs.btfs.rb_node; 113 114 while (n) { 115 node = rb_entry(n, struct btf_node, rb_node); 116 if (btf_id < node->id) 117 n = n->rb_left; 118 else if (btf_id > node->id) 119 n = n->rb_right; 120 else 121 goto out; 122 } 123 node = NULL; 124 125 out: 126 up_read(&env->bpf_progs.lock); 127 return node; 128 } 129 130 /* purge data in bpf_progs.infos tree */ 131 static void perf_env__purge_bpf(struct perf_env *env) 132 { 133 struct rb_root *root; 134 struct rb_node *next; 135 136 down_write(&env->bpf_progs.lock); 137 138 root = &env->bpf_progs.infos; 139 next = rb_first(root); 140 141 while (next) { 142 struct bpf_prog_info_node *node; 143 144 node = rb_entry(next, struct bpf_prog_info_node, rb_node); 145 next = rb_next(&node->rb_node); 146 rb_erase(&node->rb_node, root); 147 free(node); 148 } 149 150 env->bpf_progs.infos_cnt = 0; 151 152 root = &env->bpf_progs.btfs; 153 next = rb_first(root); 154 155 while (next) { 156 struct btf_node *node; 157 158 node = rb_entry(next, struct btf_node, rb_node); 159 next = rb_next(&node->rb_node); 160 rb_erase(&node->rb_node, root); 161 free(node); 162 } 163 164 env->bpf_progs.btfs_cnt = 0; 165 166 up_write(&env->bpf_progs.lock); 167 } 168 #else // HAVE_LIBBPF_SUPPORT 169 static void perf_env__purge_bpf(struct perf_env *env __maybe_unused) 170 { 171 } 172 #endif // HAVE_LIBBPF_SUPPORT 173 174 void perf_env__exit(struct perf_env *env) 175 { 176 int i; 177 178 perf_env__purge_bpf(env); 179 perf_env__purge_cgroups(env); 180 zfree(&env->hostname); 181 zfree(&env->os_release); 182 zfree(&env->version); 183 zfree(&env->arch); 184 zfree(&env->cpu_desc); 185 zfree(&env->cpuid); 186 zfree(&env->cmdline); 187 zfree(&env->cmdline_argv); 188 zfree(&env->sibling_cores); 189 zfree(&env->sibling_threads); 190 zfree(&env->pmu_mappings); 191 zfree(&env->cpu); 192 zfree(&env->numa_map); 193 194 for (i = 0; i < env->nr_numa_nodes; i++) 195 perf_cpu_map__put(env->numa_nodes[i].map); 196 zfree(&env->numa_nodes); 197 198 for (i = 0; i < env->caches_cnt; i++) 199 cpu_cache_level__free(&env->caches[i]); 200 zfree(&env->caches); 201 202 for (i = 0; i < env->nr_memory_nodes; i++) 203 zfree(&env->memory_nodes[i].set); 204 zfree(&env->memory_nodes); 205 206 for (i = 0; i < env->nr_hybrid_nodes; i++) { 207 zfree(&env->hybrid_nodes[i].pmu_name); 208 zfree(&env->hybrid_nodes[i].cpus); 209 } 210 zfree(&env->hybrid_nodes); 211 212 for (i = 0; i < env->nr_hybrid_cpc_nodes; i++) { 213 zfree(&env->hybrid_cpc_nodes[i].cpu_pmu_caps); 214 zfree(&env->hybrid_cpc_nodes[i].pmu_name); 215 } 216 zfree(&env->hybrid_cpc_nodes); 217 } 218 219 void perf_env__init(struct perf_env *env __maybe_unused) 220 { 221 #ifdef HAVE_LIBBPF_SUPPORT 222 env->bpf_progs.infos = RB_ROOT; 223 env->bpf_progs.btfs = RB_ROOT; 224 init_rwsem(&env->bpf_progs.lock); 225 #endif 226 } 227 228 int perf_env__set_cmdline(struct perf_env *env, int argc, const char *argv[]) 229 { 230 int i; 231 232 /* do not include NULL termination */ 233 env->cmdline_argv = calloc(argc, sizeof(char *)); 234 if (env->cmdline_argv == NULL) 235 goto out_enomem; 236 237 /* 238 * Must copy argv contents because it gets moved around during option 239 * parsing: 240 */ 241 for (i = 0; i < argc ; i++) { 242 env->cmdline_argv[i] = argv[i]; 243 if (env->cmdline_argv[i] == NULL) 244 goto out_free; 245 } 246 247 env->nr_cmdline = argc; 248 249 return 0; 250 out_free: 251 zfree(&env->cmdline_argv); 252 out_enomem: 253 return -ENOMEM; 254 } 255 256 int perf_env__read_cpu_topology_map(struct perf_env *env) 257 { 258 int cpu, nr_cpus; 259 260 if (env->cpu != NULL) 261 return 0; 262 263 if (env->nr_cpus_avail == 0) 264 env->nr_cpus_avail = cpu__max_present_cpu(); 265 266 nr_cpus = env->nr_cpus_avail; 267 if (nr_cpus == -1) 268 return -EINVAL; 269 270 env->cpu = calloc(nr_cpus, sizeof(env->cpu[0])); 271 if (env->cpu == NULL) 272 return -ENOMEM; 273 274 for (cpu = 0; cpu < nr_cpus; ++cpu) { 275 env->cpu[cpu].core_id = cpu_map__get_core_id(cpu); 276 env->cpu[cpu].socket_id = cpu_map__get_socket_id(cpu); 277 env->cpu[cpu].die_id = cpu_map__get_die_id(cpu); 278 } 279 280 env->nr_cpus_avail = nr_cpus; 281 return 0; 282 } 283 284 int perf_env__read_cpuid(struct perf_env *env) 285 { 286 char cpuid[128]; 287 int err = get_cpuid(cpuid, sizeof(cpuid)); 288 289 if (err) 290 return err; 291 292 free(env->cpuid); 293 env->cpuid = strdup(cpuid); 294 if (env->cpuid == NULL) 295 return ENOMEM; 296 return 0; 297 } 298 299 static int perf_env__read_arch(struct perf_env *env) 300 { 301 struct utsname uts; 302 303 if (env->arch) 304 return 0; 305 306 if (!uname(&uts)) 307 env->arch = strdup(uts.machine); 308 309 return env->arch ? 0 : -ENOMEM; 310 } 311 312 static int perf_env__read_nr_cpus_avail(struct perf_env *env) 313 { 314 if (env->nr_cpus_avail == 0) 315 env->nr_cpus_avail = cpu__max_present_cpu(); 316 317 return env->nr_cpus_avail ? 0 : -ENOENT; 318 } 319 320 const char *perf_env__raw_arch(struct perf_env *env) 321 { 322 return env && !perf_env__read_arch(env) ? env->arch : "unknown"; 323 } 324 325 int perf_env__nr_cpus_avail(struct perf_env *env) 326 { 327 return env && !perf_env__read_nr_cpus_avail(env) ? env->nr_cpus_avail : 0; 328 } 329 330 void cpu_cache_level__free(struct cpu_cache_level *cache) 331 { 332 zfree(&cache->type); 333 zfree(&cache->map); 334 zfree(&cache->size); 335 } 336 337 /* 338 * Return architecture name in a normalized form. 339 * The conversion logic comes from the Makefile. 340 */ 341 static const char *normalize_arch(char *arch) 342 { 343 if (!strcmp(arch, "x86_64")) 344 return "x86"; 345 if (arch[0] == 'i' && arch[2] == '8' && arch[3] == '6') 346 return "x86"; 347 if (!strcmp(arch, "sun4u") || !strncmp(arch, "sparc", 5)) 348 return "sparc"; 349 if (!strcmp(arch, "aarch64") || !strcmp(arch, "arm64")) 350 return "arm64"; 351 if (!strncmp(arch, "arm", 3) || !strcmp(arch, "sa110")) 352 return "arm"; 353 if (!strncmp(arch, "s390", 4)) 354 return "s390"; 355 if (!strncmp(arch, "parisc", 6)) 356 return "parisc"; 357 if (!strncmp(arch, "powerpc", 7) || !strncmp(arch, "ppc", 3)) 358 return "powerpc"; 359 if (!strncmp(arch, "mips", 4)) 360 return "mips"; 361 if (!strncmp(arch, "sh", 2) && isdigit(arch[2])) 362 return "sh"; 363 364 return arch; 365 } 366 367 const char *perf_env__arch(struct perf_env *env) 368 { 369 char *arch_name; 370 371 if (!env || !env->arch) { /* Assume local operation */ 372 static struct utsname uts = { .machine[0] = '\0', }; 373 if (uts.machine[0] == '\0' && uname(&uts) < 0) 374 return NULL; 375 arch_name = uts.machine; 376 } else 377 arch_name = env->arch; 378 379 return normalize_arch(arch_name); 380 } 381 382 383 int perf_env__numa_node(struct perf_env *env, int cpu) 384 { 385 if (!env->nr_numa_map) { 386 struct numa_node *nn; 387 int i, nr = 0; 388 389 for (i = 0; i < env->nr_numa_nodes; i++) { 390 nn = &env->numa_nodes[i]; 391 nr = max(nr, perf_cpu_map__max(nn->map)); 392 } 393 394 nr++; 395 396 /* 397 * We initialize the numa_map array to prepare 398 * it for missing cpus, which return node -1 399 */ 400 env->numa_map = malloc(nr * sizeof(int)); 401 if (!env->numa_map) 402 return -1; 403 404 for (i = 0; i < nr; i++) 405 env->numa_map[i] = -1; 406 407 env->nr_numa_map = nr; 408 409 for (i = 0; i < env->nr_numa_nodes; i++) { 410 int tmp, j; 411 412 nn = &env->numa_nodes[i]; 413 perf_cpu_map__for_each_cpu(j, tmp, nn->map) 414 env->numa_map[j] = i; 415 } 416 } 417 418 return cpu >= 0 && cpu < env->nr_numa_map ? env->numa_map[cpu] : -1; 419 } 420