1 // SPDX-License-Identifier: GPL-2.0
14 #include <api/fs/fs.h>
16 #include "thread_map.h"
21 /* Skip "." and ".." directories */
22 static int filter(const struct dirent *dir)
24 if (dir->d_name[0] == '.')
30 static void thread_map__reset(struct thread_map *map, int start, int nr)
32 size_t size = (nr - start) * sizeof(map->map[0]);
34 memset(&map->map[start], 0, size);
37 static struct thread_map *thread_map__realloc(struct thread_map *map, int nr)
39 size_t size = sizeof(*map) + sizeof(map->map[0]) * nr;
40 int start = map ? map->nr : 0;
42 map = realloc(map, size);
44 * We only realloc to add more items, let's reset new items.
47 thread_map__reset(map, start, nr);
52 #define thread_map__alloc(__nr) thread_map__realloc(NULL, __nr)
54 struct thread_map *thread_map__new_by_pid(pid_t pid)
56 struct thread_map *threads;
59 struct dirent **namelist = NULL;
62 sprintf(name, "/proc/%d/task", pid);
63 items = scandir(name, &namelist, filter, NULL);
67 threads = thread_map__alloc(items);
68 if (threads != NULL) {
69 for (i = 0; i < items; i++)
70 thread_map__set_pid(threads, i, atoi(namelist[i]->d_name));
72 refcount_set(&threads->refcnt, 1);
75 for (i=0; i<items; i++)
82 struct thread_map *thread_map__new_by_tid(pid_t tid)
84 struct thread_map *threads = thread_map__alloc(1);
86 if (threads != NULL) {
87 thread_map__set_pid(threads, 0, tid);
89 refcount_set(&threads->refcnt, 1);
95 static struct thread_map *__thread_map__new_all_cpus(uid_t uid)
98 int max_threads = 32, items, i;
99 char path[NAME_MAX + 1 + 6];
100 struct dirent *dirent, **namelist = NULL;
101 struct thread_map *threads = thread_map__alloc(max_threads);
106 proc = opendir("/proc");
108 goto out_free_threads;
111 refcount_set(&threads->refcnt, 1);
113 while ((dirent = readdir(proc)) != NULL) {
116 pid_t pid = strtol(dirent->d_name, &end, 10);
118 if (*end) /* only interested in proper numerical dirents */
121 snprintf(path, sizeof(path), "/proc/%s", dirent->d_name);
123 if (uid != UINT_MAX) {
126 if (stat(path, &st) != 0 || st.st_uid != uid)
130 snprintf(path, sizeof(path), "/proc/%d/task", pid);
131 items = scandir(path, &namelist, filter, NULL);
133 goto out_free_closedir;
135 while (threads->nr + items >= max_threads) {
141 struct thread_map *tmp;
143 tmp = thread_map__realloc(threads, max_threads);
145 goto out_free_namelist;
150 for (i = 0; i < items; i++) {
151 thread_map__set_pid(threads, threads->nr + i,
152 atoi(namelist[i]->d_name));
155 for (i = 0; i < items; i++)
159 threads->nr += items;
172 for (i = 0; i < items; i++)
181 struct thread_map *thread_map__new_all_cpus(void)
183 return __thread_map__new_all_cpus(UINT_MAX);
186 struct thread_map *thread_map__new_by_uid(uid_t uid)
188 return __thread_map__new_all_cpus(uid);
191 struct thread_map *thread_map__new(pid_t pid, pid_t tid, uid_t uid)
194 return thread_map__new_by_pid(pid);
196 if (tid == -1 && uid != UINT_MAX)
197 return thread_map__new_by_uid(uid);
199 return thread_map__new_by_tid(tid);
202 static struct thread_map *thread_map__new_by_pid_str(const char *pid_str)
204 struct thread_map *threads = NULL, *nt;
206 int items, total_tasks = 0;
207 struct dirent **namelist = NULL;
209 pid_t pid, prev_pid = INT_MAX;
211 struct str_node *pos;
212 struct strlist_config slist_config = { .dont_dupstr = true, };
213 struct strlist *slist = strlist__new(pid_str, &slist_config);
218 strlist__for_each_entry(pos, slist) {
219 pid = strtol(pos->s, &end_ptr, 10);
221 if (pid == INT_MIN || pid == INT_MAX ||
222 (*end_ptr != '\0' && *end_ptr != ','))
223 goto out_free_threads;
228 sprintf(name, "/proc/%d/task", pid);
229 items = scandir(name, &namelist, filter, NULL);
231 goto out_free_threads;
233 total_tasks += items;
234 nt = thread_map__realloc(threads, total_tasks);
236 goto out_free_namelist;
240 for (i = 0; i < items; i++) {
241 thread_map__set_pid(threads, j++, atoi(namelist[i]->d_name));
244 threads->nr = total_tasks;
249 strlist__delete(slist);
251 refcount_set(&threads->refcnt, 1);
255 for (i = 0; i < items; i++)
264 struct thread_map *thread_map__new_dummy(void)
266 struct thread_map *threads = thread_map__alloc(1);
268 if (threads != NULL) {
269 thread_map__set_pid(threads, 0, -1);
271 refcount_set(&threads->refcnt, 1);
276 struct thread_map *thread_map__new_by_tid_str(const char *tid_str)
278 struct thread_map *threads = NULL, *nt;
280 pid_t tid, prev_tid = INT_MAX;
282 struct str_node *pos;
283 struct strlist_config slist_config = { .dont_dupstr = true, };
284 struct strlist *slist;
286 /* perf-stat expects threads to be generated even if tid not given */
288 return thread_map__new_dummy();
290 slist = strlist__new(tid_str, &slist_config);
294 strlist__for_each_entry(pos, slist) {
295 tid = strtol(pos->s, &end_ptr, 10);
297 if (tid == INT_MIN || tid == INT_MAX ||
298 (*end_ptr != '\0' && *end_ptr != ','))
299 goto out_free_threads;
305 nt = thread_map__realloc(threads, ntasks);
308 goto out_free_threads;
311 thread_map__set_pid(threads, ntasks - 1, tid);
312 threads->nr = ntasks;
316 refcount_set(&threads->refcnt, 1);
321 strlist__delete(slist);
325 struct thread_map *thread_map__new_str(const char *pid, const char *tid,
326 uid_t uid, bool per_thread)
329 return thread_map__new_by_pid_str(pid);
331 if (!tid && uid != UINT_MAX)
332 return thread_map__new_by_uid(uid);
335 return thread_map__new_all_cpus();
337 return thread_map__new_by_tid_str(tid);
340 static void thread_map__delete(struct thread_map *threads)
345 WARN_ONCE(refcount_read(&threads->refcnt) != 0,
346 "thread map refcnt unbalanced\n");
347 for (i = 0; i < threads->nr; i++)
348 free(thread_map__comm(threads, i));
353 struct thread_map *thread_map__get(struct thread_map *map)
356 refcount_inc(&map->refcnt);
360 void thread_map__put(struct thread_map *map)
362 if (map && refcount_dec_and_test(&map->refcnt))
363 thread_map__delete(map);
366 size_t thread_map__fprintf(struct thread_map *threads, FILE *fp)
369 size_t printed = fprintf(fp, "%d thread%s: ",
370 threads->nr, threads->nr > 1 ? "s" : "");
371 for (i = 0; i < threads->nr; ++i)
372 printed += fprintf(fp, "%s%d", i ? ", " : "", thread_map__pid(threads, i));
374 return printed + fprintf(fp, "\n");
377 static int get_comm(char **comm, pid_t pid)
383 if (asprintf(&path, "%s/%d/comm", procfs__mountpoint(), pid) == -1)
386 err = filename__read_str(path, comm, &size);
389 * We're reading 16 bytes, while filename__read_str
390 * allocates data per BUFSIZ bytes, so we can safely
391 * mark the end of the string.
401 static void comm_init(struct thread_map *map, int i)
403 pid_t pid = thread_map__pid(map, i);
406 /* dummy pid comm initialization */
408 map->map[i].comm = strdup("dummy");
413 * The comm name is like extra bonus ;-),
414 * so just warn if we fail for any reason.
416 if (get_comm(&comm, pid))
417 pr_warning("Couldn't resolve comm name for pid %d\n", pid);
419 map->map[i].comm = comm;
422 void thread_map__read_comms(struct thread_map *threads)
426 for (i = 0; i < threads->nr; ++i)
427 comm_init(threads, i);
430 static void thread_map__copy_event(struct thread_map *threads,
431 struct thread_map_event *event)
435 threads->nr = (int) event->nr;
437 for (i = 0; i < event->nr; i++) {
438 thread_map__set_pid(threads, i, (pid_t) event->entries[i].pid);
439 threads->map[i].comm = strndup(event->entries[i].comm, 16);
442 refcount_set(&threads->refcnt, 1);
445 struct thread_map *thread_map__new_event(struct thread_map_event *event)
447 struct thread_map *threads;
449 threads = thread_map__alloc(event->nr);
451 thread_map__copy_event(threads, event);
456 bool thread_map__has(struct thread_map *threads, pid_t pid)
460 for (i = 0; i < threads->nr; ++i) {
461 if (threads->map[i].pid == pid)
468 int thread_map__remove(struct thread_map *threads, int idx)
475 if (idx >= threads->nr)
479 * Free the 'idx' item and shift the rest up.
481 free(threads->map[idx].comm);
483 for (i = idx; i < threads->nr - 1; i++)
484 threads->map[i] = threads->map[i + 1];