util.c 13 KB

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