util.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743
  1. #include "../perf.h"
  2. #include "util.h"
  3. #include "debug.h"
  4. #include <api/fs/fs.h>
  5. #include <sys/mman.h>
  6. #include <sys/utsname.h>
  7. #ifdef HAVE_BACKTRACE_SUPPORT
  8. #include <execinfo.h>
  9. #endif
  10. #include <stdio.h>
  11. #include <stdlib.h>
  12. #include <string.h>
  13. #include <errno.h>
  14. #include <limits.h>
  15. #include <byteswap.h>
  16. #include <linux/kernel.h>
  17. #include <linux/log2.h>
  18. #include <unistd.h>
  19. #include "callchain.h"
  20. #include "strlist.h"
  21. struct callchain_param callchain_param = {
  22. .mode = CHAIN_GRAPH_ABS,
  23. .min_percent = 0.5,
  24. .order = ORDER_CALLEE,
  25. .key = CCKEY_FUNCTION,
  26. .value = CCVAL_PERCENT,
  27. };
  28. /*
  29. * XXX We need to find a better place for these things...
  30. */
  31. unsigned int page_size;
  32. int cacheline_size;
  33. bool test_attr__enabled;
  34. bool perf_host = true;
  35. bool perf_guest = false;
  36. void event_attr_init(struct perf_event_attr *attr)
  37. {
  38. if (!perf_host)
  39. attr->exclude_host = 1;
  40. if (!perf_guest)
  41. attr->exclude_guest = 1;
  42. /* to capture ABI version */
  43. attr->size = sizeof(*attr);
  44. }
  45. int mkdir_p(char *path, mode_t mode)
  46. {
  47. struct stat st;
  48. int err;
  49. char *d = path;
  50. if (*d != '/')
  51. return -1;
  52. if (stat(path, &st) == 0)
  53. return 0;
  54. while (*++d == '/');
  55. while ((d = strchr(d, '/'))) {
  56. *d = '\0';
  57. err = stat(path, &st) && mkdir(path, mode);
  58. *d++ = '/';
  59. if (err)
  60. return -1;
  61. while (*d == '/')
  62. ++d;
  63. }
  64. return (stat(path, &st) && mkdir(path, mode)) ? -1 : 0;
  65. }
  66. int rm_rf(char *path)
  67. {
  68. DIR *dir;
  69. int ret = 0;
  70. struct dirent *d;
  71. char namebuf[PATH_MAX];
  72. dir = opendir(path);
  73. if (dir == NULL)
  74. return 0;
  75. while ((d = readdir(dir)) != NULL && !ret) {
  76. struct stat statbuf;
  77. if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
  78. continue;
  79. scnprintf(namebuf, sizeof(namebuf), "%s/%s",
  80. path, d->d_name);
  81. ret = stat(namebuf, &statbuf);
  82. if (ret < 0) {
  83. pr_debug("stat failed: %s\n", namebuf);
  84. break;
  85. }
  86. if (S_ISREG(statbuf.st_mode))
  87. ret = unlink(namebuf);
  88. else if (S_ISDIR(statbuf.st_mode))
  89. ret = rm_rf(namebuf);
  90. else {
  91. pr_debug("unknown file: %s\n", namebuf);
  92. ret = -1;
  93. }
  94. }
  95. closedir(dir);
  96. if (ret < 0)
  97. return ret;
  98. return rmdir(path);
  99. }
  100. /* A filter which removes dot files */
  101. bool lsdir_no_dot_filter(const char *name __maybe_unused, struct dirent *d)
  102. {
  103. return d->d_name[0] != '.';
  104. }
  105. /* lsdir reads a directory and store it in strlist */
  106. struct strlist *lsdir(const char *name,
  107. bool (*filter)(const char *, struct dirent *))
  108. {
  109. struct strlist *list = NULL;
  110. DIR *dir;
  111. struct dirent *d;
  112. dir = opendir(name);
  113. if (!dir)
  114. return NULL;
  115. list = strlist__new(NULL, NULL);
  116. if (!list) {
  117. errno = -ENOMEM;
  118. goto out;
  119. }
  120. while ((d = readdir(dir)) != NULL) {
  121. if (!filter || filter(name, d))
  122. strlist__add(list, d->d_name);
  123. }
  124. out:
  125. closedir(dir);
  126. return list;
  127. }
  128. static int slow_copyfile(const char *from, const char *to)
  129. {
  130. int err = -1;
  131. char *line = NULL;
  132. size_t n;
  133. FILE *from_fp = fopen(from, "r"), *to_fp;
  134. if (from_fp == NULL)
  135. goto out;
  136. to_fp = fopen(to, "w");
  137. if (to_fp == NULL)
  138. goto out_fclose_from;
  139. while (getline(&line, &n, from_fp) > 0)
  140. if (fputs(line, to_fp) == EOF)
  141. goto out_fclose_to;
  142. err = 0;
  143. out_fclose_to:
  144. fclose(to_fp);
  145. free(line);
  146. out_fclose_from:
  147. fclose(from_fp);
  148. out:
  149. return err;
  150. }
  151. int copyfile_offset(int ifd, loff_t off_in, int ofd, loff_t off_out, u64 size)
  152. {
  153. void *ptr;
  154. loff_t pgoff;
  155. pgoff = off_in & ~(page_size - 1);
  156. off_in -= pgoff;
  157. ptr = mmap(NULL, off_in + size, PROT_READ, MAP_PRIVATE, ifd, pgoff);
  158. if (ptr == MAP_FAILED)
  159. return -1;
  160. while (size) {
  161. ssize_t ret = pwrite(ofd, ptr + off_in, size, off_out);
  162. if (ret < 0 && errno == EINTR)
  163. continue;
  164. if (ret <= 0)
  165. break;
  166. size -= ret;
  167. off_in += ret;
  168. off_out -= ret;
  169. }
  170. munmap(ptr, off_in + size);
  171. return size ? -1 : 0;
  172. }
  173. int copyfile_mode(const char *from, const char *to, mode_t mode)
  174. {
  175. int fromfd, tofd;
  176. struct stat st;
  177. int err = -1;
  178. char *tmp = NULL, *ptr = NULL;
  179. if (stat(from, &st))
  180. goto out;
  181. /* extra 'x' at the end is to reserve space for '.' */
  182. if (asprintf(&tmp, "%s.XXXXXXx", to) < 0) {
  183. tmp = NULL;
  184. goto out;
  185. }
  186. ptr = strrchr(tmp, '/');
  187. if (!ptr)
  188. goto out;
  189. ptr = memmove(ptr + 1, ptr, strlen(ptr) - 1);
  190. *ptr = '.';
  191. tofd = mkstemp(tmp);
  192. if (tofd < 0)
  193. goto out;
  194. if (fchmod(tofd, mode))
  195. goto out_close_to;
  196. if (st.st_size == 0) { /* /proc? do it slowly... */
  197. err = slow_copyfile(from, tmp);
  198. goto out_close_to;
  199. }
  200. fromfd = open(from, O_RDONLY);
  201. if (fromfd < 0)
  202. goto out_close_to;
  203. err = copyfile_offset(fromfd, 0, tofd, 0, st.st_size);
  204. close(fromfd);
  205. out_close_to:
  206. close(tofd);
  207. if (!err)
  208. err = link(tmp, to);
  209. unlink(tmp);
  210. out:
  211. free(tmp);
  212. return err;
  213. }
  214. int copyfile(const char *from, const char *to)
  215. {
  216. return copyfile_mode(from, to, 0755);
  217. }
  218. unsigned long convert_unit(unsigned long value, char *unit)
  219. {
  220. *unit = ' ';
  221. if (value > 1000) {
  222. value /= 1000;
  223. *unit = 'K';
  224. }
  225. if (value > 1000) {
  226. value /= 1000;
  227. *unit = 'M';
  228. }
  229. if (value > 1000) {
  230. value /= 1000;
  231. *unit = 'G';
  232. }
  233. return value;
  234. }
  235. static ssize_t ion(bool is_read, int fd, void *buf, size_t n)
  236. {
  237. void *buf_start = buf;
  238. size_t left = n;
  239. while (left) {
  240. ssize_t ret = is_read ? read(fd, buf, left) :
  241. write(fd, buf, left);
  242. if (ret < 0 && errno == EINTR)
  243. continue;
  244. if (ret <= 0)
  245. return ret;
  246. left -= ret;
  247. buf += ret;
  248. }
  249. BUG_ON((size_t)(buf - buf_start) != n);
  250. return n;
  251. }
  252. /*
  253. * Read exactly 'n' bytes or return an error.
  254. */
  255. ssize_t readn(int fd, void *buf, size_t n)
  256. {
  257. return ion(true, fd, buf, n);
  258. }
  259. /*
  260. * Write exactly 'n' bytes or return an error.
  261. */
  262. ssize_t writen(int fd, void *buf, size_t n)
  263. {
  264. return ion(false, fd, buf, n);
  265. }
  266. size_t hex_width(u64 v)
  267. {
  268. size_t n = 1;
  269. while ((v >>= 4))
  270. ++n;
  271. return n;
  272. }
  273. static int hex(char ch)
  274. {
  275. if ((ch >= '0') && (ch <= '9'))
  276. return ch - '0';
  277. if ((ch >= 'a') && (ch <= 'f'))
  278. return ch - 'a' + 10;
  279. if ((ch >= 'A') && (ch <= 'F'))
  280. return ch - 'A' + 10;
  281. return -1;
  282. }
  283. /*
  284. * While we find nice hex chars, build a long_val.
  285. * Return number of chars processed.
  286. */
  287. int hex2u64(const char *ptr, u64 *long_val)
  288. {
  289. const char *p = ptr;
  290. *long_val = 0;
  291. while (*p) {
  292. const int hex_val = hex(*p);
  293. if (hex_val < 0)
  294. break;
  295. *long_val = (*long_val << 4) | hex_val;
  296. p++;
  297. }
  298. return p - ptr;
  299. }
  300. /* Obtain a backtrace and print it to stdout. */
  301. #ifdef HAVE_BACKTRACE_SUPPORT
  302. void dump_stack(void)
  303. {
  304. void *array[16];
  305. size_t size = backtrace(array, ARRAY_SIZE(array));
  306. char **strings = backtrace_symbols(array, size);
  307. size_t i;
  308. printf("Obtained %zd stack frames.\n", size);
  309. for (i = 0; i < size; i++)
  310. printf("%s\n", strings[i]);
  311. free(strings);
  312. }
  313. #else
  314. void dump_stack(void) {}
  315. #endif
  316. void sighandler_dump_stack(int sig)
  317. {
  318. psignal(sig, "perf");
  319. dump_stack();
  320. signal(sig, SIG_DFL);
  321. raise(sig);
  322. }
  323. int parse_nsec_time(const char *str, u64 *ptime)
  324. {
  325. u64 time_sec, time_nsec;
  326. char *end;
  327. time_sec = strtoul(str, &end, 10);
  328. if (*end != '.' && *end != '\0')
  329. return -1;
  330. if (*end == '.') {
  331. int i;
  332. char nsec_buf[10];
  333. if (strlen(++end) > 9)
  334. return -1;
  335. strncpy(nsec_buf, end, 9);
  336. nsec_buf[9] = '\0';
  337. /* make it nsec precision */
  338. for (i = strlen(nsec_buf); i < 9; i++)
  339. nsec_buf[i] = '0';
  340. time_nsec = strtoul(nsec_buf, &end, 10);
  341. if (*end != '\0')
  342. return -1;
  343. } else
  344. time_nsec = 0;
  345. *ptime = time_sec * NSEC_PER_SEC + time_nsec;
  346. return 0;
  347. }
  348. unsigned long parse_tag_value(const char *str, struct parse_tag *tags)
  349. {
  350. struct parse_tag *i = tags;
  351. while (i->tag) {
  352. char *s;
  353. s = strchr(str, i->tag);
  354. if (s) {
  355. unsigned long int value;
  356. char *endptr;
  357. value = strtoul(str, &endptr, 10);
  358. if (s != endptr)
  359. break;
  360. if (value > ULONG_MAX / i->mult)
  361. break;
  362. value *= i->mult;
  363. return value;
  364. }
  365. i++;
  366. }
  367. return (unsigned long) -1;
  368. }
  369. int get_stack_size(const char *str, unsigned long *_size)
  370. {
  371. char *endptr;
  372. unsigned long size;
  373. unsigned long max_size = round_down(USHRT_MAX, sizeof(u64));
  374. size = strtoul(str, &endptr, 0);
  375. do {
  376. if (*endptr)
  377. break;
  378. size = round_up(size, sizeof(u64));
  379. if (!size || size > max_size)
  380. break;
  381. *_size = size;
  382. return 0;
  383. } while (0);
  384. pr_err("callchain: Incorrect stack dump size (max %ld): %s\n",
  385. max_size, str);
  386. return -1;
  387. }
  388. int parse_callchain_record(const char *arg, struct callchain_param *param)
  389. {
  390. char *tok, *name, *saveptr = NULL;
  391. char *buf;
  392. int ret = -1;
  393. /* We need buffer that we know we can write to. */
  394. buf = malloc(strlen(arg) + 1);
  395. if (!buf)
  396. return -ENOMEM;
  397. strcpy(buf, arg);
  398. tok = strtok_r((char *)buf, ",", &saveptr);
  399. name = tok ? : (char *)buf;
  400. do {
  401. /* Framepointer style */
  402. if (!strncmp(name, "fp", sizeof("fp"))) {
  403. if (!strtok_r(NULL, ",", &saveptr)) {
  404. param->record_mode = CALLCHAIN_FP;
  405. ret = 0;
  406. } else
  407. pr_err("callchain: No more arguments "
  408. "needed for --call-graph fp\n");
  409. break;
  410. #ifdef HAVE_DWARF_UNWIND_SUPPORT
  411. /* Dwarf style */
  412. } else if (!strncmp(name, "dwarf", sizeof("dwarf"))) {
  413. const unsigned long default_stack_dump_size = 8192;
  414. ret = 0;
  415. param->record_mode = CALLCHAIN_DWARF;
  416. param->dump_size = default_stack_dump_size;
  417. tok = strtok_r(NULL, ",", &saveptr);
  418. if (tok) {
  419. unsigned long size = 0;
  420. ret = get_stack_size(tok, &size);
  421. param->dump_size = size;
  422. }
  423. #endif /* HAVE_DWARF_UNWIND_SUPPORT */
  424. } else if (!strncmp(name, "lbr", sizeof("lbr"))) {
  425. if (!strtok_r(NULL, ",", &saveptr)) {
  426. param->record_mode = CALLCHAIN_LBR;
  427. ret = 0;
  428. } else
  429. pr_err("callchain: No more arguments "
  430. "needed for --call-graph lbr\n");
  431. break;
  432. } else {
  433. pr_err("callchain: Unknown --call-graph option "
  434. "value: %s\n", arg);
  435. break;
  436. }
  437. } while (0);
  438. free(buf);
  439. return ret;
  440. }
  441. const char *get_filename_for_perf_kvm(void)
  442. {
  443. const char *filename;
  444. if (perf_host && !perf_guest)
  445. filename = strdup("perf.data.host");
  446. else if (!perf_host && perf_guest)
  447. filename = strdup("perf.data.guest");
  448. else
  449. filename = strdup("perf.data.kvm");
  450. return filename;
  451. }
  452. int perf_event_paranoid(void)
  453. {
  454. int value;
  455. if (sysctl__read_int("kernel/perf_event_paranoid", &value))
  456. return INT_MAX;
  457. return value;
  458. }
  459. void mem_bswap_32(void *src, int byte_size)
  460. {
  461. u32 *m = src;
  462. while (byte_size > 0) {
  463. *m = bswap_32(*m);
  464. byte_size -= sizeof(u32);
  465. ++m;
  466. }
  467. }
  468. void mem_bswap_64(void *src, int byte_size)
  469. {
  470. u64 *m = src;
  471. while (byte_size > 0) {
  472. *m = bswap_64(*m);
  473. byte_size -= sizeof(u64);
  474. ++m;
  475. }
  476. }
  477. bool find_process(const char *name)
  478. {
  479. size_t len = strlen(name);
  480. DIR *dir;
  481. struct dirent *d;
  482. int ret = -1;
  483. dir = opendir(procfs__mountpoint());
  484. if (!dir)
  485. return false;
  486. /* Walk through the directory. */
  487. while (ret && (d = readdir(dir)) != NULL) {
  488. char path[PATH_MAX];
  489. char *data;
  490. size_t size;
  491. if ((d->d_type != DT_DIR) ||
  492. !strcmp(".", d->d_name) ||
  493. !strcmp("..", d->d_name))
  494. continue;
  495. scnprintf(path, sizeof(path), "%s/%s/comm",
  496. procfs__mountpoint(), d->d_name);
  497. if (filename__read_str(path, &data, &size))
  498. continue;
  499. ret = strncmp(name, data, len);
  500. free(data);
  501. }
  502. closedir(dir);
  503. return ret ? false : true;
  504. }
  505. int
  506. fetch_kernel_version(unsigned int *puint, char *str,
  507. size_t str_size)
  508. {
  509. struct utsname utsname;
  510. int version, patchlevel, sublevel, err;
  511. if (uname(&utsname))
  512. return -1;
  513. if (str && str_size) {
  514. strncpy(str, utsname.release, str_size);
  515. str[str_size - 1] = '\0';
  516. }
  517. err = sscanf(utsname.release, "%d.%d.%d",
  518. &version, &patchlevel, &sublevel);
  519. if (err != 3) {
  520. pr_debug("Unablt to get kernel version from uname '%s'\n",
  521. utsname.release);
  522. return -1;
  523. }
  524. if (puint)
  525. *puint = (version << 16) + (patchlevel << 8) + sublevel;
  526. return 0;
  527. }
  528. const char *perf_tip(const char *dirpath)
  529. {
  530. struct strlist *tips;
  531. struct str_node *node;
  532. char *tip = NULL;
  533. struct strlist_config conf = {
  534. .dirname = dirpath,
  535. .file_only = true,
  536. };
  537. tips = strlist__new("tips.txt", &conf);
  538. if (tips == NULL)
  539. return errno == ENOENT ? NULL : "Tip: get more memory! ;-p";
  540. if (strlist__nr_entries(tips) == 0)
  541. goto out;
  542. node = strlist__entry(tips, random() % strlist__nr_entries(tips));
  543. if (asprintf(&tip, "Tip: %s", node->s) < 0)
  544. tip = (char *)"Tip: get more memory! ;-)";
  545. out:
  546. strlist__delete(tips);
  547. return tip;
  548. }
  549. bool is_regular_file(const char *file)
  550. {
  551. struct stat st;
  552. if (stat(file, &st))
  553. return false;
  554. return S_ISREG(st.st_mode);
  555. }
  556. int fetch_current_timestamp(char *buf, size_t sz)
  557. {
  558. struct timeval tv;
  559. struct tm tm;
  560. char dt[32];
  561. if (gettimeofday(&tv, NULL) || !localtime_r(&tv.tv_sec, &tm))
  562. return -1;
  563. if (!strftime(dt, sizeof(dt), "%Y%m%d%H%M%S", &tm))
  564. return -1;
  565. scnprintf(buf, sz, "%s%02u", dt, (unsigned)tv.tv_usec / 10000);
  566. return 0;
  567. }
  568. void print_binary(unsigned char *data, size_t len,
  569. size_t bytes_per_line, print_binary_t printer,
  570. void *extra)
  571. {
  572. size_t i, j, mask;
  573. if (!printer)
  574. return;
  575. bytes_per_line = roundup_pow_of_two(bytes_per_line);
  576. mask = bytes_per_line - 1;
  577. printer(BINARY_PRINT_DATA_BEGIN, 0, extra);
  578. for (i = 0; i < len; i++) {
  579. if ((i & mask) == 0) {
  580. printer(BINARY_PRINT_LINE_BEGIN, -1, extra);
  581. printer(BINARY_PRINT_ADDR, i, extra);
  582. }
  583. printer(BINARY_PRINT_NUM_DATA, data[i], extra);
  584. if (((i & mask) == mask) || i == len - 1) {
  585. for (j = 0; j < mask-(i & mask); j++)
  586. printer(BINARY_PRINT_NUM_PAD, -1, extra);
  587. printer(BINARY_PRINT_SEP, i, extra);
  588. for (j = i & ~mask; j <= i; j++)
  589. printer(BINARY_PRINT_CHAR_DATA, data[j], extra);
  590. for (j = 0; j < mask-(i & mask); j++)
  591. printer(BINARY_PRINT_CHAR_PAD, i, extra);
  592. printer(BINARY_PRINT_LINE_END, -1, extra);
  593. }
  594. }
  595. printer(BINARY_PRINT_DATA_END, -1, extra);
  596. }