Loading...
1#include <dirent.h>
2#include <limits.h>
3#include <stdbool.h>
4#include <stdlib.h>
5#include <stdio.h>
6#include <sys/types.h>
7#include <sys/stat.h>
8#include <unistd.h>
9#include "strlist.h"
10#include <string.h>
11#include "thread_map.h"
12
13/* Skip "." and ".." directories */
14static int filter(const struct dirent *dir)
15{
16 if (dir->d_name[0] == '.')
17 return 0;
18 else
19 return 1;
20}
21
22struct thread_map *thread_map__new_by_pid(pid_t pid)
23{
24 struct thread_map *threads;
25 char name[256];
26 int items;
27 struct dirent **namelist = NULL;
28 int i;
29
30 sprintf(name, "/proc/%d/task", pid);
31 items = scandir(name, &namelist, filter, NULL);
32 if (items <= 0)
33 return NULL;
34
35 threads = malloc(sizeof(*threads) + sizeof(pid_t) * items);
36 if (threads != NULL) {
37 for (i = 0; i < items; i++)
38 threads->map[i] = atoi(namelist[i]->d_name);
39 threads->nr = items;
40 }
41
42 for (i=0; i<items; i++)
43 free(namelist[i]);
44 free(namelist);
45
46 return threads;
47}
48
49struct thread_map *thread_map__new_by_tid(pid_t tid)
50{
51 struct thread_map *threads = malloc(sizeof(*threads) + sizeof(pid_t));
52
53 if (threads != NULL) {
54 threads->map[0] = tid;
55 threads->nr = 1;
56 }
57
58 return threads;
59}
60
61struct thread_map *thread_map__new_by_uid(uid_t uid)
62{
63 DIR *proc;
64 int max_threads = 32, items, i;
65 char path[256];
66 struct dirent dirent, *next, **namelist = NULL;
67 struct thread_map *threads = malloc(sizeof(*threads) +
68 max_threads * sizeof(pid_t));
69 if (threads == NULL)
70 goto out;
71
72 proc = opendir("/proc");
73 if (proc == NULL)
74 goto out_free_threads;
75
76 threads->nr = 0;
77
78 while (!readdir_r(proc, &dirent, &next) && next) {
79 char *end;
80 bool grow = false;
81 struct stat st;
82 pid_t pid = strtol(dirent.d_name, &end, 10);
83
84 if (*end) /* only interested in proper numerical dirents */
85 continue;
86
87 snprintf(path, sizeof(path), "/proc/%s", dirent.d_name);
88
89 if (stat(path, &st) != 0)
90 continue;
91
92 if (st.st_uid != uid)
93 continue;
94
95 snprintf(path, sizeof(path), "/proc/%d/task", pid);
96 items = scandir(path, &namelist, filter, NULL);
97 if (items <= 0)
98 goto out_free_closedir;
99
100 while (threads->nr + items >= max_threads) {
101 max_threads *= 2;
102 grow = true;
103 }
104
105 if (grow) {
106 struct thread_map *tmp;
107
108 tmp = realloc(threads, (sizeof(*threads) +
109 max_threads * sizeof(pid_t)));
110 if (tmp == NULL)
111 goto out_free_namelist;
112
113 threads = tmp;
114 }
115
116 for (i = 0; i < items; i++)
117 threads->map[threads->nr + i] = atoi(namelist[i]->d_name);
118
119 for (i = 0; i < items; i++)
120 free(namelist[i]);
121 free(namelist);
122
123 threads->nr += items;
124 }
125
126out_closedir:
127 closedir(proc);
128out:
129 return threads;
130
131out_free_threads:
132 free(threads);
133 return NULL;
134
135out_free_namelist:
136 for (i = 0; i < items; i++)
137 free(namelist[i]);
138 free(namelist);
139
140out_free_closedir:
141 free(threads);
142 threads = NULL;
143 goto out_closedir;
144}
145
146struct thread_map *thread_map__new(pid_t pid, pid_t tid, uid_t uid)
147{
148 if (pid != -1)
149 return thread_map__new_by_pid(pid);
150
151 if (tid == -1 && uid != UINT_MAX)
152 return thread_map__new_by_uid(uid);
153
154 return thread_map__new_by_tid(tid);
155}
156
157static struct thread_map *thread_map__new_by_pid_str(const char *pid_str)
158{
159 struct thread_map *threads = NULL, *nt;
160 char name[256];
161 int items, total_tasks = 0;
162 struct dirent **namelist = NULL;
163 int i, j = 0;
164 pid_t pid, prev_pid = INT_MAX;
165 char *end_ptr;
166 struct str_node *pos;
167 struct strlist *slist = strlist__new(false, pid_str);
168
169 if (!slist)
170 return NULL;
171
172 strlist__for_each(pos, slist) {
173 pid = strtol(pos->s, &end_ptr, 10);
174
175 if (pid == INT_MIN || pid == INT_MAX ||
176 (*end_ptr != '\0' && *end_ptr != ','))
177 goto out_free_threads;
178
179 if (pid == prev_pid)
180 continue;
181
182 sprintf(name, "/proc/%d/task", pid);
183 items = scandir(name, &namelist, filter, NULL);
184 if (items <= 0)
185 goto out_free_threads;
186
187 total_tasks += items;
188 nt = realloc(threads, (sizeof(*threads) +
189 sizeof(pid_t) * total_tasks));
190 if (nt == NULL)
191 goto out_free_namelist;
192
193 threads = nt;
194
195 for (i = 0; i < items; i++) {
196 threads->map[j++] = atoi(namelist[i]->d_name);
197 free(namelist[i]);
198 }
199 threads->nr = total_tasks;
200 free(namelist);
201 }
202
203out:
204 strlist__delete(slist);
205 return threads;
206
207out_free_namelist:
208 for (i = 0; i < items; i++)
209 free(namelist[i]);
210 free(namelist);
211
212out_free_threads:
213 free(threads);
214 threads = NULL;
215 goto out;
216}
217
218static struct thread_map *thread_map__new_by_tid_str(const char *tid_str)
219{
220 struct thread_map *threads = NULL, *nt;
221 int ntasks = 0;
222 pid_t tid, prev_tid = INT_MAX;
223 char *end_ptr;
224 struct str_node *pos;
225 struct strlist *slist;
226
227 /* perf-stat expects threads to be generated even if tid not given */
228 if (!tid_str) {
229 threads = malloc(sizeof(*threads) + sizeof(pid_t));
230 if (threads != NULL) {
231 threads->map[0] = -1;
232 threads->nr = 1;
233 }
234 return threads;
235 }
236
237 slist = strlist__new(false, tid_str);
238 if (!slist)
239 return NULL;
240
241 strlist__for_each(pos, slist) {
242 tid = strtol(pos->s, &end_ptr, 10);
243
244 if (tid == INT_MIN || tid == INT_MAX ||
245 (*end_ptr != '\0' && *end_ptr != ','))
246 goto out_free_threads;
247
248 if (tid == prev_tid)
249 continue;
250
251 ntasks++;
252 nt = realloc(threads, sizeof(*threads) + sizeof(pid_t) * ntasks);
253
254 if (nt == NULL)
255 goto out_free_threads;
256
257 threads = nt;
258 threads->map[ntasks - 1] = tid;
259 threads->nr = ntasks;
260 }
261out:
262 return threads;
263
264out_free_threads:
265 free(threads);
266 threads = NULL;
267 goto out;
268}
269
270struct thread_map *thread_map__new_str(const char *pid, const char *tid,
271 uid_t uid)
272{
273 if (pid)
274 return thread_map__new_by_pid_str(pid);
275
276 if (!tid && uid != UINT_MAX)
277 return thread_map__new_by_uid(uid);
278
279 return thread_map__new_by_tid_str(tid);
280}
281
282void thread_map__delete(struct thread_map *threads)
283{
284 free(threads);
285}
286
287size_t thread_map__fprintf(struct thread_map *threads, FILE *fp)
288{
289 int i;
290 size_t printed = fprintf(fp, "%d thread%s: ",
291 threads->nr, threads->nr > 1 ? "s" : "");
292 for (i = 0; i < threads->nr; ++i)
293 printed += fprintf(fp, "%s%d", i ? ", " : "", threads->map[i]);
294
295 return printed + fprintf(fp, "\n");
296}
1// SPDX-License-Identifier: GPL-2.0
2#include <dirent.h>
3#include <errno.h>
4#include <limits.h>
5#include <stdbool.h>
6#include <stdlib.h>
7#include <stdio.h>
8#include <sys/types.h>
9#include <sys/stat.h>
10#include <unistd.h>
11#include "string2.h"
12#include "strlist.h"
13#include <string.h>
14#include <api/fs/fs.h>
15#include <linux/string.h>
16#include <linux/zalloc.h>
17#include "asm/bug.h"
18#include "thread_map.h"
19#include "debug.h"
20#include "event.h"
21#include <internal/threadmap.h>
22
23/* Skip "." and ".." directories */
24static int filter(const struct dirent *dir)
25{
26 if (dir->d_name[0] == '.')
27 return 0;
28 else
29 return 1;
30}
31
32#define thread_map__alloc(__nr) perf_thread_map__realloc(NULL, __nr)
33
34struct perf_thread_map *thread_map__new_by_pid(pid_t pid)
35{
36 struct perf_thread_map *threads;
37 char name[256];
38 int items;
39 struct dirent **namelist = NULL;
40 int i;
41
42 sprintf(name, "/proc/%d/task", pid);
43 items = scandir(name, &namelist, filter, NULL);
44 if (items <= 0)
45 return NULL;
46
47 threads = thread_map__alloc(items);
48 if (threads != NULL) {
49 for (i = 0; i < items; i++)
50 perf_thread_map__set_pid(threads, i, atoi(namelist[i]->d_name));
51 threads->nr = items;
52 refcount_set(&threads->refcnt, 1);
53 }
54
55 for (i=0; i<items; i++)
56 zfree(&namelist[i]);
57 free(namelist);
58
59 return threads;
60}
61
62struct perf_thread_map *thread_map__new_by_tid(pid_t tid)
63{
64 struct perf_thread_map *threads = thread_map__alloc(1);
65
66 if (threads != NULL) {
67 perf_thread_map__set_pid(threads, 0, tid);
68 threads->nr = 1;
69 refcount_set(&threads->refcnt, 1);
70 }
71
72 return threads;
73}
74
75static struct perf_thread_map *__thread_map__new_all_cpus(uid_t uid)
76{
77 DIR *proc;
78 int max_threads = 32, items, i;
79 char path[NAME_MAX + 1 + 6];
80 struct dirent *dirent, **namelist = NULL;
81 struct perf_thread_map *threads = thread_map__alloc(max_threads);
82
83 if (threads == NULL)
84 goto out;
85
86 proc = opendir("/proc");
87 if (proc == NULL)
88 goto out_free_threads;
89
90 threads->nr = 0;
91 refcount_set(&threads->refcnt, 1);
92
93 while ((dirent = readdir(proc)) != NULL) {
94 char *end;
95 bool grow = false;
96 pid_t pid = strtol(dirent->d_name, &end, 10);
97
98 if (*end) /* only interested in proper numerical dirents */
99 continue;
100
101 snprintf(path, sizeof(path), "/proc/%s", dirent->d_name);
102
103 if (uid != UINT_MAX) {
104 struct stat st;
105
106 if (stat(path, &st) != 0 || st.st_uid != uid)
107 continue;
108 }
109
110 snprintf(path, sizeof(path), "/proc/%d/task", pid);
111 items = scandir(path, &namelist, filter, NULL);
112 if (items <= 0) {
113 pr_debug("scandir for %d returned empty, skipping\n", pid);
114 continue;
115 }
116 while (threads->nr + items >= max_threads) {
117 max_threads *= 2;
118 grow = true;
119 }
120
121 if (grow) {
122 struct perf_thread_map *tmp;
123
124 tmp = perf_thread_map__realloc(threads, max_threads);
125 if (tmp == NULL)
126 goto out_free_namelist;
127
128 threads = tmp;
129 }
130
131 for (i = 0; i < items; i++) {
132 perf_thread_map__set_pid(threads, threads->nr + i,
133 atoi(namelist[i]->d_name));
134 }
135
136 for (i = 0; i < items; i++)
137 zfree(&namelist[i]);
138 free(namelist);
139
140 threads->nr += items;
141 }
142
143out_closedir:
144 closedir(proc);
145out:
146 return threads;
147
148out_free_threads:
149 free(threads);
150 return NULL;
151
152out_free_namelist:
153 for (i = 0; i < items; i++)
154 zfree(&namelist[i]);
155 free(namelist);
156 zfree(&threads);
157 goto out_closedir;
158}
159
160struct perf_thread_map *thread_map__new_all_cpus(void)
161{
162 return __thread_map__new_all_cpus(UINT_MAX);
163}
164
165struct perf_thread_map *thread_map__new_by_uid(uid_t uid)
166{
167 return __thread_map__new_all_cpus(uid);
168}
169
170struct perf_thread_map *thread_map__new(pid_t pid, pid_t tid, uid_t uid)
171{
172 if (pid != -1)
173 return thread_map__new_by_pid(pid);
174
175 if (tid == -1 && uid != UINT_MAX)
176 return thread_map__new_by_uid(uid);
177
178 return thread_map__new_by_tid(tid);
179}
180
181static struct perf_thread_map *thread_map__new_by_pid_str(const char *pid_str)
182{
183 struct perf_thread_map *threads = NULL, *nt;
184 char name[256];
185 int items, total_tasks = 0;
186 struct dirent **namelist = NULL;
187 int i, j = 0;
188 pid_t pid, prev_pid = INT_MAX;
189 char *end_ptr;
190 struct str_node *pos;
191 struct strlist_config slist_config = { .dont_dupstr = true, };
192 struct strlist *slist = strlist__new(pid_str, &slist_config);
193
194 if (!slist)
195 return NULL;
196
197 strlist__for_each_entry(pos, slist) {
198 pid = strtol(pos->s, &end_ptr, 10);
199
200 if (pid == INT_MIN || pid == INT_MAX ||
201 (*end_ptr != '\0' && *end_ptr != ','))
202 goto out_free_threads;
203
204 if (pid == prev_pid)
205 continue;
206
207 sprintf(name, "/proc/%d/task", pid);
208 items = scandir(name, &namelist, filter, NULL);
209 if (items <= 0)
210 goto out_free_threads;
211
212 total_tasks += items;
213 nt = perf_thread_map__realloc(threads, total_tasks);
214 if (nt == NULL)
215 goto out_free_namelist;
216
217 threads = nt;
218
219 for (i = 0; i < items; i++) {
220 perf_thread_map__set_pid(threads, j++, atoi(namelist[i]->d_name));
221 zfree(&namelist[i]);
222 }
223 threads->nr = total_tasks;
224 free(namelist);
225 }
226
227out:
228 strlist__delete(slist);
229 if (threads)
230 refcount_set(&threads->refcnt, 1);
231 return threads;
232
233out_free_namelist:
234 for (i = 0; i < items; i++)
235 zfree(&namelist[i]);
236 free(namelist);
237
238out_free_threads:
239 zfree(&threads);
240 goto out;
241}
242
243struct perf_thread_map *thread_map__new_by_tid_str(const char *tid_str)
244{
245 struct perf_thread_map *threads = NULL, *nt;
246 int ntasks = 0;
247 pid_t tid, prev_tid = INT_MAX;
248 char *end_ptr;
249 struct str_node *pos;
250 struct strlist_config slist_config = { .dont_dupstr = true, };
251 struct strlist *slist;
252
253 /* perf-stat expects threads to be generated even if tid not given */
254 if (!tid_str)
255 return perf_thread_map__new_dummy();
256
257 slist = strlist__new(tid_str, &slist_config);
258 if (!slist)
259 return NULL;
260
261 strlist__for_each_entry(pos, slist) {
262 tid = strtol(pos->s, &end_ptr, 10);
263
264 if (tid == INT_MIN || tid == INT_MAX ||
265 (*end_ptr != '\0' && *end_ptr != ','))
266 goto out_free_threads;
267
268 if (tid == prev_tid)
269 continue;
270
271 ntasks++;
272 nt = perf_thread_map__realloc(threads, ntasks);
273
274 if (nt == NULL)
275 goto out_free_threads;
276
277 threads = nt;
278 perf_thread_map__set_pid(threads, ntasks - 1, tid);
279 threads->nr = ntasks;
280 }
281out:
282 strlist__delete(slist);
283 if (threads)
284 refcount_set(&threads->refcnt, 1);
285 return threads;
286
287out_free_threads:
288 zfree(&threads);
289 goto out;
290}
291
292struct perf_thread_map *thread_map__new_str(const char *pid, const char *tid,
293 uid_t uid, bool all_threads)
294{
295 if (pid)
296 return thread_map__new_by_pid_str(pid);
297
298 if (!tid && uid != UINT_MAX)
299 return thread_map__new_by_uid(uid);
300
301 if (all_threads)
302 return thread_map__new_all_cpus();
303
304 return thread_map__new_by_tid_str(tid);
305}
306
307size_t thread_map__fprintf(struct perf_thread_map *threads, FILE *fp)
308{
309 int i;
310 size_t printed = fprintf(fp, "%d thread%s: ",
311 threads->nr, threads->nr > 1 ? "s" : "");
312 for (i = 0; i < threads->nr; ++i)
313 printed += fprintf(fp, "%s%d", i ? ", " : "", perf_thread_map__pid(threads, i));
314
315 return printed + fprintf(fp, "\n");
316}
317
318static int get_comm(char **comm, pid_t pid)
319{
320 char *path;
321 size_t size;
322 int err;
323
324 if (asprintf(&path, "%s/%d/comm", procfs__mountpoint(), pid) == -1)
325 return -ENOMEM;
326
327 err = filename__read_str(path, comm, &size);
328 if (!err) {
329 /*
330 * We're reading 16 bytes, while filename__read_str
331 * allocates data per BUFSIZ bytes, so we can safely
332 * mark the end of the string.
333 */
334 (*comm)[size] = 0;
335 strim(*comm);
336 }
337
338 free(path);
339 return err;
340}
341
342static void comm_init(struct perf_thread_map *map, int i)
343{
344 pid_t pid = perf_thread_map__pid(map, i);
345 char *comm = NULL;
346
347 /* dummy pid comm initialization */
348 if (pid == -1) {
349 map->map[i].comm = strdup("dummy");
350 return;
351 }
352
353 /*
354 * The comm name is like extra bonus ;-),
355 * so just warn if we fail for any reason.
356 */
357 if (get_comm(&comm, pid))
358 pr_warning("Couldn't resolve comm name for pid %d\n", pid);
359
360 map->map[i].comm = comm;
361}
362
363void thread_map__read_comms(struct perf_thread_map *threads)
364{
365 int i;
366
367 for (i = 0; i < threads->nr; ++i)
368 comm_init(threads, i);
369}
370
371static void thread_map__copy_event(struct perf_thread_map *threads,
372 struct perf_record_thread_map *event)
373{
374 unsigned i;
375
376 threads->nr = (int) event->nr;
377
378 for (i = 0; i < event->nr; i++) {
379 perf_thread_map__set_pid(threads, i, (pid_t) event->entries[i].pid);
380 threads->map[i].comm = strndup(event->entries[i].comm, 16);
381 }
382
383 refcount_set(&threads->refcnt, 1);
384}
385
386struct perf_thread_map *thread_map__new_event(struct perf_record_thread_map *event)
387{
388 struct perf_thread_map *threads;
389
390 threads = thread_map__alloc(event->nr);
391 if (threads)
392 thread_map__copy_event(threads, event);
393
394 return threads;
395}
396
397bool thread_map__has(struct perf_thread_map *threads, pid_t pid)
398{
399 int i;
400
401 for (i = 0; i < threads->nr; ++i) {
402 if (threads->map[i].pid == pid)
403 return true;
404 }
405
406 return false;
407}
408
409int thread_map__remove(struct perf_thread_map *threads, int idx)
410{
411 int i;
412
413 if (threads->nr < 1)
414 return -EINVAL;
415
416 if (idx >= threads->nr)
417 return -EINVAL;
418
419 /*
420 * Free the 'idx' item and shift the rest up.
421 */
422 zfree(&threads->map[idx].comm);
423
424 for (i = idx; i < threads->nr - 1; i++)
425 threads->map[i] = threads->map[i + 1];
426
427 threads->nr--;
428 return 0;
429}