Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 | #include <stdio.h> #include "../libslang.h" #include <stdlib.h> #include <string.h> #include <linux/rbtree.h> #include "../../util/evsel.h" #include "../../util/evlist.h" #include "../../util/hist.h" #include "../../util/pstack.h" #include "../../util/sort.h" #include "../../util/util.h" #include "../../util/top.h" #include "../../arch/common.h" #include "../browser.h" #include "../helpline.h" #include "../util.h" #include "../ui.h" #include "map.h" #include "annotate.h" struct hist_browser { struct ui_browser b; struct hists *hists; struct hist_entry *he_selection; struct map_symbol *selection; int print_seq; bool show_dso; bool show_headers; float min_pcnt; u64 nr_non_filtered_entries; u64 nr_callchain_rows; }; extern void hist_browser__init_hpp(void); static int hists__browser_title(struct hists *hists, struct hist_browser_timer *hbt, char *bf, size_t size); static void hist_browser__update_nr_entries(struct hist_browser *hb); static struct rb_node *hists__filter_entries(struct rb_node *nd, float min_pcnt); static bool hist_browser__has_filter(struct hist_browser *hb) { return hists__has_filter(hb->hists) || hb->min_pcnt; } static u32 hist_browser__nr_entries(struct hist_browser *hb) { u32 nr_entries; if (hist_browser__has_filter(hb)) nr_entries = hb->nr_non_filtered_entries; else nr_entries = hb->hists->nr_entries; return nr_entries + hb->nr_callchain_rows; } static void hist_browser__update_rows(struct hist_browser *hb) { struct ui_browser *browser = &hb->b; u16 header_offset = hb->show_headers ? 1 : 0, index_row; browser->rows = browser->height - header_offset; /* * Verify if we were at the last line and that line isn't * visibe because we now show the header line(s). */ index_row = browser->index - browser->top_idx; if (index_row >= browser->rows) browser->index -= index_row - browser->rows + 1; } static void hist_browser__refresh_dimensions(struct ui_browser *browser) { struct hist_browser *hb = container_of(browser, struct hist_browser, b); /* 3 == +/- toggle symbol before actual hist_entry rendering */ browser->width = 3 + (hists__sort_list_width(hb->hists) + sizeof("[k]")); /* * FIXME: Just keeping existing behaviour, but this really should be * before updating browser->width, as it will invalidate the * calculation above. Fix this and the fallout in another * changeset. */ ui_browser__refresh_dimensions(browser); hist_browser__update_rows(hb); } static void hist_browser__gotorc(struct hist_browser *browser, int row, int column) { u16 header_offset = browser->show_headers ? 1 : 0; ui_browser__gotorc(&browser->b, row + header_offset, column); } static void hist_browser__reset(struct hist_browser *browser) { /* * The hists__remove_entry_filter() already folds non-filtered * entries so we can assume it has 0 callchain rows. */ browser->nr_callchain_rows = 0; hist_browser__update_nr_entries(browser); browser->b.nr_entries = hist_browser__nr_entries(browser); hist_browser__refresh_dimensions(&browser->b); ui_browser__reset_index(&browser->b); } static char tree__folded_sign(bool unfolded) { return unfolded ? '-' : '+'; } static char map_symbol__folded(const struct map_symbol *ms) { return ms->has_children ? tree__folded_sign(ms->unfolded) : ' '; } static char hist_entry__folded(const struct hist_entry *he) { return map_symbol__folded(&he->ms); } static char callchain_list__folded(const struct callchain_list *cl) { return map_symbol__folded(&cl->ms); } static void map_symbol__set_folding(struct map_symbol *ms, bool unfold) { ms->unfolded = unfold ? ms->has_children : false; } static int callchain_node__count_rows_rb_tree(struct callchain_node *node) { int n = 0; struct rb_node *nd; for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); struct callchain_list *chain; char folded_sign = ' '; /* No children */ list_for_each_entry(chain, &child->val, list) { ++n; /* We need this because we may not have children */ folded_sign = callchain_list__folded(chain); if (folded_sign == '+') break; } if (folded_sign == '-') /* Have children and they're unfolded */ n += callchain_node__count_rows_rb_tree(child); } return n; } static int callchain_node__count_rows(struct callchain_node *node) { struct callchain_list *chain; bool unfolded = false; int n = 0; list_for_each_entry(chain, &node->val, list) { ++n; unfolded = chain->ms.unfolded; } if (unfolded) n += callchain_node__count_rows_rb_tree(node); return n; } static int callchain__count_rows(struct rb_root *chain) { struct rb_node *nd; int n = 0; for (nd = rb_first(chain); nd; nd = rb_next(nd)) { struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); n += callchain_node__count_rows(node); } return n; } static bool map_symbol__toggle_fold(struct map_symbol *ms) { if (!ms) return false; if (!ms->has_children) return false; ms->unfolded = !ms->unfolded; return true; } static void callchain_node__init_have_children_rb_tree(struct callchain_node *node) { struct rb_node *nd = rb_first(&node->rb_root); for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); struct callchain_list *chain; bool first = true; list_for_each_entry(chain, &child->val, list) { if (first) { first = false; chain->ms.has_children = chain->list.next != &child->val || !RB_EMPTY_ROOT(&child->rb_root); } else chain->ms.has_children = chain->list.next == &child->val && !RB_EMPTY_ROOT(&child->rb_root); } callchain_node__init_have_children_rb_tree(child); } } static void callchain_node__init_have_children(struct callchain_node *node) { struct callchain_list *chain; if (!list_empty(&node->val)) { chain = list_entry(node->val.prev, struct callchain_list, list); chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root); } callchain_node__init_have_children_rb_tree(node); } static void callchain__init_have_children(struct rb_root *root) { struct rb_node *nd; for (nd = rb_first(root); nd; nd = rb_next(nd)) { struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); callchain_node__init_have_children(node); } } static void hist_entry__init_have_children(struct hist_entry *he) { if (!he->init_have_children) { he->ms.has_children = !RB_EMPTY_ROOT(&he->sorted_chain); callchain__init_have_children(&he->sorted_chain); he->init_have_children = true; } } static bool hist_browser__toggle_fold(struct hist_browser *browser) { if (map_symbol__toggle_fold(browser->selection)) { struct hist_entry *he = browser->he_selection; hist_entry__init_have_children(he); browser->b.nr_entries -= he->nr_rows; browser->nr_callchain_rows -= he->nr_rows; if (he->ms.unfolded) he->nr_rows = callchain__count_rows(&he->sorted_chain); else he->nr_rows = 0; browser->b.nr_entries += he->nr_rows; browser->nr_callchain_rows += he->nr_rows; return true; } /* If it doesn't have children, no toggling performed */ return false; } static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold) { int n = 0; struct rb_node *nd; for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); struct callchain_list *chain; bool has_children = false; list_for_each_entry(chain, &child->val, list) { ++n; map_symbol__set_folding(&chain->ms, unfold); has_children = chain->ms.has_children; } if (has_children) n += callchain_node__set_folding_rb_tree(child, unfold); } return n; } static int callchain_node__set_folding(struct callchain_node *node, bool unfold) { struct callchain_list *chain; bool has_children = false; int n = 0; list_for_each_entry(chain, &node->val, list) { ++n; map_symbol__set_folding(&chain->ms, unfold); has_children = chain->ms.has_children; } if (has_children) n += callchain_node__set_folding_rb_tree(node, unfold); return n; } static int callchain__set_folding(struct rb_root *chain, bool unfold) { struct rb_node *nd; int n = 0; for (nd = rb_first(chain); nd; nd = rb_next(nd)) { struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); n += callchain_node__set_folding(node, unfold); } return n; } static void hist_entry__set_folding(struct hist_entry *he, bool unfold) { hist_entry__init_have_children(he); map_symbol__set_folding(&he->ms, unfold); if (he->ms.has_children) { int n = callchain__set_folding(&he->sorted_chain, unfold); he->nr_rows = unfold ? n : 0; } else he->nr_rows = 0; } static void __hist_browser__set_folding(struct hist_browser *browser, bool unfold) { struct rb_node *nd; struct hists *hists = browser->hists; for (nd = rb_first(&hists->entries); (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL; nd = rb_next(nd)) { struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); hist_entry__set_folding(he, unfold); browser->nr_callchain_rows += he->nr_rows; } } static void hist_browser__set_folding(struct hist_browser *browser, bool unfold) { browser->nr_callchain_rows = 0; __hist_browser__set_folding(browser, unfold); browser->b.nr_entries = hist_browser__nr_entries(browser); /* Go to the start, we may be way after valid entries after a collapse */ ui_browser__reset_index(&browser->b); } static void ui_browser__warn_lost_events(struct ui_browser *browser) { ui_browser__warning(browser, 4, "Events are being lost, check IO/CPU overload!\n\n" "You may want to run 'perf' using a RT scheduler policy:\n\n" " perf top -r 80\n\n" "Or reduce the sampling frequency."); } static int hist_browser__run(struct hist_browser *browser, struct hist_browser_timer *hbt) { int key; char title[160]; int delay_secs = hbt ? hbt->refresh : 0; browser->b.entries = &browser->hists->entries; browser->b.nr_entries = hist_browser__nr_entries(browser); hists__browser_title(browser->hists, hbt, title, sizeof(title)); if (ui_browser__show(&browser->b, title, "Press '?' for help on key bindings") < 0) return -1; while (1) { key = ui_browser__run(&browser->b, delay_secs); switch (key) { case K_TIMER: { u64 nr_entries; hbt->timer(hbt->arg); if (hist_browser__has_filter(browser)) hist_browser__update_nr_entries(browser); nr_entries = hist_browser__nr_entries(browser); ui_browser__update_nr_entries(&browser->b, nr_entries); if (browser->hists->stats.nr_lost_warned != browser->hists->stats.nr_events[PERF_RECORD_LOST]) { browser->hists->stats.nr_lost_warned = browser->hists->stats.nr_events[PERF_RECORD_LOST]; ui_browser__warn_lost_events(&browser->b); } hists__browser_title(browser->hists, hbt, title, sizeof(title)); ui_browser__show_title(&browser->b, title); continue; } case 'D': { /* Debug */ static int seq; struct hist_entry *h = rb_entry(browser->b.top, struct hist_entry, rb_node); ui_helpline__pop(); ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d", seq++, browser->b.nr_entries, browser->hists->nr_entries, browser->b.rows, browser->b.index, browser->b.top_idx, h->row_offset, h->nr_rows); } break; case 'C': /* Collapse the whole world. */ hist_browser__set_folding(browser, false); break; case 'E': /* Expand the whole world. */ hist_browser__set_folding(browser, true); break; case 'H': browser->show_headers = !browser->show_headers; hist_browser__update_rows(browser); break; case K_ENTER: if (hist_browser__toggle_fold(browser)) break; /* fall thru */ default: goto out; } } out: ui_browser__hide(&browser->b); return key; } static char *callchain_list__sym_name(struct callchain_list *cl, char *bf, size_t bfsize, bool show_dso) { int printed; if (cl->ms.sym) printed = scnprintf(bf, bfsize, "%s", cl->ms.sym->name); else printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip); if (show_dso) scnprintf(bf + printed, bfsize - printed, " %s", cl->ms.map ? cl->ms.map->dso->short_name : "unknown"); return bf; } struct callchain_print_arg { /* for hists browser */ off_t row_offset; bool is_current_entry; /* for file dump */ FILE *fp; int printed; }; typedef void (*print_callchain_entry_fn)(struct hist_browser *browser, struct callchain_list *chain, const char *str, int offset, unsigned short row, struct callchain_print_arg *arg); static void hist_browser__show_callchain_entry(struct hist_browser *browser, struct callchain_list *chain, const char *str, int offset, unsigned short row, struct callchain_print_arg *arg) { int color, width; char folded_sign = callchain_list__folded(chain); color = HE_COLORSET_NORMAL; width = browser->b.width - (offset + 2); if (ui_browser__is_current_entry(&browser->b, row)) { browser->selection = &chain->ms; color = HE_COLORSET_SELECTED; arg->is_current_entry = true; } ui_browser__set_color(&browser->b, color); hist_browser__gotorc(browser, row, 0); slsmg_write_nstring(" ", offset); slsmg_printf("%c ", folded_sign); slsmg_write_nstring(str, width); } static void hist_browser__fprintf_callchain_entry(struct hist_browser *b __maybe_unused, struct callchain_list *chain, const char *str, int offset, unsigned short row __maybe_unused, struct callchain_print_arg *arg) { char folded_sign = callchain_list__folded(chain); arg->printed += fprintf(arg->fp, "%*s%c %s\n", offset, " ", folded_sign, str); } typedef bool (*check_output_full_fn)(struct hist_browser *browser, unsigned short row); static bool hist_browser__check_output_full(struct hist_browser *browser, unsigned short row) { return browser->b.rows == row; } static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused, unsigned short row __maybe_unused) { return false; } #define LEVEL_OFFSET_STEP 3 static int hist_browser__show_callchain(struct hist_browser *browser, struct rb_root *root, int level, unsigned short row, u64 total, print_callchain_entry_fn print, struct callchain_print_arg *arg, check_output_full_fn is_output_full) { struct rb_node *node; int first_row = row, offset = level * LEVEL_OFFSET_STEP; u64 new_total; node = rb_first(root); while (node) { struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); struct rb_node *next = rb_next(node); u64 cumul = callchain_cumul_hits(child); struct callchain_list *chain; char folded_sign = ' '; int first = true; int extra_offset = 0; list_for_each_entry(chain, &child->val, list) { char bf[1024], *alloc_str; const char *str; bool was_first = first; if (first) first = false; else if (level > 1) extra_offset = LEVEL_OFFSET_STEP; folded_sign = callchain_list__folded(chain); if (arg->row_offset != 0) { arg->row_offset--; goto do_next; } alloc_str = NULL; str = callchain_list__sym_name(chain, bf, sizeof(bf), browser->show_dso); if (was_first && level > 1) { double percent = cumul * 100.0 / total; if (asprintf(&alloc_str, "%2.2f%% %s", percent, str) < 0) str = "Not enough memory!"; else str = alloc_str; } print(browser, chain, str, offset + extra_offset, row, arg); free(alloc_str); if (is_output_full(browser, ++row)) goto out; do_next: if (folded_sign == '+') break; } if (folded_sign == '-') { const int new_level = level + (extra_offset ? 2 : 1); if (callchain_param.mode == CHAIN_GRAPH_REL) new_total = child->children_hit; else new_total = total; row += hist_browser__show_callchain(browser, &child->rb_root, new_level, row, new_total, print, arg, is_output_full); } if (is_output_full(browser, row)) break; node = next; } out: return row - first_row; } struct hpp_arg { struct ui_browser *b; char folded_sign; bool current_entry; }; static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...) { struct hpp_arg *arg = hpp->ptr; int ret, len; va_list args; double percent; va_start(args, fmt); len = va_arg(args, int); percent = va_arg(args, double); va_end(args); ui_browser__set_percent_color(arg->b, percent, arg->current_entry); ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent); slsmg_printf("%s", hpp->buf); advance_hpp(hpp, ret); return ret; } #define __HPP_COLOR_PERCENT_FN(_type, _field) \ static u64 __hpp_get_##_field(struct hist_entry *he) \ { \ return he->stat._field; \ } \ \ static int \ hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \ struct perf_hpp *hpp, \ struct hist_entry *he) \ { \ return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \ __hpp__slsmg_color_printf, true); \ } #define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \ static u64 __hpp_get_acc_##_field(struct hist_entry *he) \ { \ return he->stat_acc->_field; \ } \ \ static int \ hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \ struct perf_hpp *hpp, \ struct hist_entry *he) \ { \ if (!symbol_conf.cumulate_callchain) { \ int len = fmt->user_len ?: fmt->len; \ int ret = scnprintf(hpp->buf, hpp->size, \ "%*s", len, "N/A"); \ slsmg_printf("%s", hpp->buf); \ \ return ret; \ } \ return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \ " %*.2f%%", __hpp__slsmg_color_printf, true); \ } __HPP_COLOR_PERCENT_FN(overhead, period) __HPP_COLOR_PERCENT_FN(overhead_sys, period_sys) __HPP_COLOR_PERCENT_FN(overhead_us, period_us) __HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys) __HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us) __HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period) #undef __HPP_COLOR_PERCENT_FN #undef __HPP_COLOR_ACC_PERCENT_FN void hist_browser__init_hpp(void) { perf_hpp__format[PERF_HPP__OVERHEAD].color = hist_browser__hpp_color_overhead; perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color = hist_browser__hpp_color_overhead_sys; perf_hpp__format[PERF_HPP__OVERHEAD_US].color = hist_browser__hpp_color_overhead_us; perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color = hist_browser__hpp_color_overhead_guest_sys; perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color = hist_browser__hpp_color_overhead_guest_us; perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color = hist_browser__hpp_color_overhead_acc; } static int hist_browser__show_entry(struct hist_browser *browser, struct hist_entry *entry, unsigned short row) { char s[256]; int printed = 0; int width = browser->b.width; char folded_sign = ' '; bool current_entry = ui_browser__is_current_entry(&browser->b, row); off_t row_offset = entry->row_offset; bool first = true; struct perf_hpp_fmt *fmt; if (current_entry) { browser->he_selection = entry; browser->selection = &entry->ms; } if (symbol_conf.use_callchain) { hist_entry__init_have_children(entry); folded_sign = hist_entry__folded(entry); } if (row_offset == 0) { struct hpp_arg arg = { .b = &browser->b, .folded_sign = folded_sign, .current_entry = current_entry, }; struct perf_hpp hpp = { .buf = s, .size = sizeof(s), .ptr = &arg, }; hist_browser__gotorc(browser, row, 0); perf_hpp__for_each_format(fmt) { if (perf_hpp__should_skip(fmt)) continue; if (current_entry && browser->b.navkeypressed) { ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED); } else { ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL); } if (first) { if (symbol_conf.use_callchain) { slsmg_printf("%c ", folded_sign); width -= 2; } first = false; } else { slsmg_printf(" "); width -= 2; } if (fmt->color) { width -= fmt->color(fmt, &hpp, entry); } else { width -= fmt->entry(fmt, &hpp, entry); slsmg_printf("%s", s); } } /* The scroll bar isn't being used */ if (!browser->b.navkeypressed) width += 1; slsmg_write_nstring("", width); ++row; ++printed; } else --row_offset; if (folded_sign == '-' && row != browser->b.rows) { u64 total = hists__total_period(entry->hists); struct callchain_print_arg arg = { .row_offset = row_offset, .is_current_entry = current_entry, }; printed += hist_browser__show_callchain(browser, &entry->sorted_chain, 1, row, total, hist_browser__show_callchain_entry, &arg, hist_browser__check_output_full); if (arg.is_current_entry) browser->he_selection = entry; } return printed; } static int advance_hpp_check(struct perf_hpp *hpp, int inc) { advance_hpp(hpp, inc); return hpp->size <= 0; } static int hists__scnprintf_headers(char *buf, size_t size, struct hists *hists) { struct perf_hpp dummy_hpp = { .buf = buf, .size = size, }; struct perf_hpp_fmt *fmt; size_t ret = 0; if (symbol_conf.use_callchain) { ret = scnprintf(buf, size, " "); if (advance_hpp_check(&dummy_hpp, ret)) return ret; } perf_hpp__for_each_format(fmt) { if (perf_hpp__should_skip(fmt)) continue; ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists)); if (advance_hpp_check(&dummy_hpp, ret)) break; ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " "); if (advance_hpp_check(&dummy_hpp, ret)) break; } return ret; } static void hist_browser__show_headers(struct hist_browser *browser) { char headers[1024]; hists__scnprintf_headers(headers, sizeof(headers), browser->hists); ui_browser__gotorc(&browser->b, 0, 0); ui_browser__set_color(&browser->b, HE_COLORSET_ROOT); slsmg_write_nstring(headers, browser->b.width + 1); } static void ui_browser__hists_init_top(struct ui_browser *browser) { if (browser->top == NULL) { struct hist_browser *hb; hb = container_of(browser, struct hist_browser, b); browser->top = rb_first(&hb->hists->entries); } } static unsigned int hist_browser__refresh(struct ui_browser *browser) { unsigned row = 0; u16 header_offset = 0; struct rb_node *nd; struct hist_browser *hb = container_of(browser, struct hist_browser, b); if (hb->show_headers) { hist_browser__show_headers(hb); header_offset = 1; } ui_browser__hists_init_top(browser); for (nd = browser->top; nd; nd = rb_next(nd)) { struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); float percent; if (h->filtered) continue; percent = hist_entry__get_percent_limit(h); if (percent < hb->min_pcnt) continue; row += hist_browser__show_entry(hb, h, row); if (row == browser->rows) break; } return row + header_offset; } static struct rb_node *hists__filter_entries(struct rb_node *nd, float min_pcnt) { while (nd != NULL) { struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); float percent = hist_entry__get_percent_limit(h); if (!h->filtered && percent >= min_pcnt) return nd; nd = rb_next(nd); } return NULL; } static struct rb_node *hists__filter_prev_entries(struct rb_node *nd, float min_pcnt) { while (nd != NULL) { struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); float percent = hist_entry__get_percent_limit(h); if (!h->filtered && percent >= min_pcnt) return nd; nd = rb_prev(nd); } return NULL; } static void ui_browser__hists_seek(struct ui_browser *browser, off_t offset, int whence) { struct hist_entry *h; struct rb_node *nd; bool first = true; struct hist_browser *hb; hb = container_of(browser, struct hist_browser, b); if (browser->nr_entries == 0) return; ui_browser__hists_init_top(browser); switch (whence) { case SEEK_SET: nd = hists__filter_entries(rb_first(browser->entries), hb->min_pcnt); break; case SEEK_CUR: nd = browser->top; goto do_offset; case SEEK_END: nd = hists__filter_prev_entries(rb_last(browser->entries), hb->min_pcnt); first = false; break; default: return; } /* * Moves not relative to the first visible entry invalidates its * row_offset: */ h = rb_entry(browser->top, struct hist_entry, rb_node); h->row_offset = 0; /* * Here we have to check if nd is expanded (+), if it is we can't go * the next top level hist_entry, instead we must compute an offset of * what _not_ to show and not change the first visible entry. * * This offset increments when we are going from top to bottom and * decreases when we're going from bottom to top. * * As we don't have backpointers to the top level in the callchains * structure, we need to always print the whole hist_entry callchain, * skipping the first ones that are before the first visible entry * and stop when we printed enough lines to fill the screen. */ do_offset: if (offset > 0) { do { h = rb_entry(nd, struct hist_entry, rb_node); if (h->ms.unfolded) { u16 remaining = h->nr_rows - h->row_offset; if (offset > remaining) { offset -= remaining; h->row_offset = 0; } else { h->row_offset += offset; offset = 0; browser->top = nd; break; } } nd = hists__filter_entries(rb_next(nd), hb->min_pcnt); if (nd == NULL) break; --offset; browser->top = nd; } while (offset != 0); } else if (offset < 0) { while (1) { h = rb_entry(nd, struct hist_entry, rb_node); if (h->ms.unfolded) { if (first) { if (-offset > h->row_offset) { offset += h->row_offset; h->row_offset = 0; } else { h->row_offset += offset; offset = 0; browser->top = nd; break; } } else { if (-offset > h->nr_rows) { offset += h->nr_rows; h->row_offset = 0; } else { h->row_offset = h->nr_rows + offset; offset = 0; browser->top = nd; break; } } } nd = hists__filter_prev_entries(rb_prev(nd), hb->min_pcnt); if (nd == NULL) break; ++offset; browser->top = nd; if (offset == 0) { /* * Last unfiltered hist_entry, check if it is * unfolded, if it is then we should have * row_offset at its last entry. */ h = rb_entry(nd, struct hist_entry, rb_node); if (h->ms.unfolded) h->row_offset = h->nr_rows; break; } first = false; } } else { browser->top = nd; h = rb_entry(nd, struct hist_entry, rb_node); h->row_offset = 0; } } static int hist_browser__fprintf_callchain(struct hist_browser *browser, struct hist_entry *he, FILE *fp) { u64 total = hists__total_period(he->hists); struct callchain_print_arg arg = { .fp = fp, }; if (symbol_conf.cumulate_callchain) total = he->stat_acc->period; hist_browser__show_callchain(browser, &he->sorted_chain, 1, 0, total, hist_browser__fprintf_callchain_entry, &arg, hist_browser__check_dump_full); return arg.printed; } static int hist_browser__fprintf_entry(struct hist_browser *browser, struct hist_entry *he, FILE *fp) { char s[8192]; int printed = 0; char folded_sign = ' '; struct perf_hpp hpp = { .buf = s, .size = sizeof(s), }; struct perf_hpp_fmt *fmt; bool first = true; int ret; if (symbol_conf.use_callchain) folded_sign = hist_entry__folded(he); if (symbol_conf.use_callchain) printed += fprintf(fp, "%c ", folded_sign); perf_hpp__for_each_format(fmt) { if (perf_hpp__should_skip(fmt)) continue; if (!first) { ret = scnprintf(hpp.buf, hpp.size, " "); advance_hpp(&hpp, ret); } else first = false; ret = fmt->entry(fmt, &hpp, he); advance_hpp(&hpp, ret); } printed += fprintf(fp, "%s\n", rtrim(s)); if (folded_sign == '-') printed += hist_browser__fprintf_callchain(browser, he, fp); return printed; } static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp) { struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries), browser->min_pcnt); int printed = 0; while (nd) { struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); printed += hist_browser__fprintf_entry(browser, h, fp); nd = hists__filter_entries(rb_next(nd), browser->min_pcnt); } return printed; } static int hist_browser__dump(struct hist_browser *browser) { char filename[64]; FILE *fp; while (1) { scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq); if (access(filename, F_OK)) break; /* * XXX: Just an arbitrary lazy upper limit */ if (++browser->print_seq == 8192) { ui_helpline__fpush("Too many perf.hist.N files, nothing written!"); return -1; } } fp = fopen(filename, "w"); if (fp == NULL) { char bf[64]; const char *err = strerror_r(errno, bf, sizeof(bf)); ui_helpline__fpush("Couldn't write to %s: %s", filename, err); return -1; } ++browser->print_seq; hist_browser__fprintf(browser, fp); fclose(fp); ui_helpline__fpush("%s written!", filename); return 0; } static struct hist_browser *hist_browser__new(struct hists *hists) { struct hist_browser *browser = zalloc(sizeof(*browser)); if (browser) { browser->hists = hists; browser->b.refresh = hist_browser__refresh; browser->b.refresh_dimensions = hist_browser__refresh_dimensions; browser->b.seek = ui_browser__hists_seek; browser->b.use_navkeypressed = true; browser->show_headers = symbol_conf.show_hist_headers; } return browser; } static void hist_browser__delete(struct hist_browser *browser) { free(browser); } static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser) { return browser->he_selection; } static struct thread *hist_browser__selected_thread(struct hist_browser *browser) { return browser->he_selection->thread; } /* Check whether the browser is for 'top' or 'report' */ static inline bool is_report_browser(void *timer) { return timer == NULL; } static int hists__browser_title(struct hists *hists, struct hist_browser_timer *hbt, char *bf, size_t size) { char unit; int printed; const struct dso *dso = hists->dso_filter; const struct thread *thread = hists->thread_filter; unsigned long nr_samples = hists->stats.nr_events[PERF_RECORD_SAMPLE]; u64 nr_events = hists->stats.total_period; struct perf_evsel *evsel = hists_to_evsel(hists); const char *ev_name = perf_evsel__name(evsel); char buf[512]; size_t buflen = sizeof(buf); if (symbol_conf.filter_relative) { nr_samples = hists->stats.nr_non_filtered_samples; nr_events = hists->stats.total_non_filtered_period; } if (perf_evsel__is_group_event(evsel)) { struct perf_evsel *pos; perf_evsel__group_desc(evsel, buf, buflen); ev_name = buf; for_each_group_member(pos, evsel) { struct hists *pos_hists = evsel__hists(pos); if (symbol_conf.filter_relative) { nr_samples += pos_hists->stats.nr_non_filtered_samples; nr_events += pos_hists->stats.total_non_filtered_period; } else { nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE]; nr_events += pos_hists->stats.total_period; } } } nr_samples = convert_unit(nr_samples, &unit); printed = scnprintf(bf, size, "Samples: %lu%c of event '%s', Event count (approx.): %lu", nr_samples, unit, ev_name, nr_events); if (hists->uid_filter_str) printed += snprintf(bf + printed, size - printed, ", UID: %s", hists->uid_filter_str); if (thread) printed += scnprintf(bf + printed, size - printed, ", Thread: %s(%d)", (thread->comm_set ? thread__comm_str(thread) : ""), thread->tid); if (dso) printed += scnprintf(bf + printed, size - printed, ", DSO: %s", dso->short_name); if (!is_report_browser(hbt)) { struct perf_top *top = hbt->arg; if (top->zero) printed += scnprintf(bf + printed, size - printed, " [z]"); } return printed; } static inline void free_popup_options(char **options, int n) { int i; for (i = 0; i < n; ++i) zfree(&options[i]); } /* * Only runtime switching of perf data file will make "input_name" point * to a malloced buffer. So add "is_input_name_malloced" flag to decide * whether we need to call free() for current "input_name" during the switch. */ static bool is_input_name_malloced = false; static int switch_data_file(void) { char *pwd, *options[32], *abs_path[32], *tmp; DIR *pwd_dir; int nr_options = 0, choice = -1, ret = -1; struct dirent *dent; pwd = getenv("PWD"); if (!pwd) return ret; pwd_dir = opendir(pwd); if (!pwd_dir) return ret; memset(options, 0, sizeof(options)); memset(options, 0, sizeof(abs_path)); while ((dent = readdir(pwd_dir))) { char path[PATH_MAX]; u64 magic; char *name = dent->d_name; FILE *file; if (!(dent->d_type == DT_REG)) continue; snprintf(path, sizeof(path), "%s/%s", pwd, name); file = fopen(path, "r"); if (!file) continue; if (fread(&magic, 1, 8, file) < 8) goto close_file_and_continue; if (is_perf_magic(magic)) { options[nr_options] = strdup(name); if (!options[nr_options]) goto close_file_and_continue; abs_path[nr_options] = strdup(path); if (!abs_path[nr_options]) { zfree(&options[nr_options]); ui__warning("Can't search all data files due to memory shortage.\n"); fclose(file); break; } nr_options++; } close_file_and_continue: fclose(file); if (nr_options >= 32) { ui__warning("Too many perf data files in PWD!\n" "Only the first 32 files will be listed.\n"); break; } } closedir(pwd_dir); if (nr_options) { choice = ui__popup_menu(nr_options, options); if (choice < nr_options && choice >= 0) { tmp = strdup(abs_path[choice]); if (tmp) { if (is_input_name_malloced) free((void *)input_name); input_name = tmp; is_input_name_malloced = true; ret = 0; } else ui__warning("Data switch failed due to memory shortage!\n"); } } free_popup_options(options, nr_options); free_popup_options(abs_path, nr_options); return ret; } static void hist_browser__update_nr_entries(struct hist_browser *hb) { u64 nr_entries = 0; struct rb_node *nd = rb_first(&hb->hists->entries); if (hb->min_pcnt == 0) { hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries; return; } while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) { nr_entries++; nd = rb_next(nd); } hb->nr_non_filtered_entries = nr_entries; } static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events, const char *helpline, bool left_exits, struct hist_browser_timer *hbt, float min_pcnt, struct perf_session_env *env) { struct hists *hists = evsel__hists(evsel); struct hist_browser *browser = hist_browser__new(hists); struct branch_info *bi; struct pstack *fstack; char *options[16]; int nr_options = 0; int key = -1; char buf[64]; char script_opt[64]; int delay_secs = hbt ? hbt->refresh : 0; struct perf_hpp_fmt *fmt; #define HIST_BROWSER_HELP_COMMON \ "h/?/F1 Show this window\n" \ "UP/DOWN/PGUP\n" \ "PGDN/SPACE Navigate\n" \ "q/ESC/CTRL+C Exit browser\n\n" \ "For multiple event sessions:\n\n" \ "TAB/UNTAB Switch events\n\n" \ "For symbolic views (--sort has sym):\n\n" \ "-> Zoom into DSO/Threads & Annotate current symbol\n" \ "<- Zoom out\n" \ "a Annotate current symbol\n" \ "C Collapse all callchains\n" \ "d Zoom into current DSO\n" \ "E Expand all callchains\n" \ "F Toggle percentage of filtered entries\n" \ "H Display column headers\n" \ /* help messages are sorted by lexical order of the hotkey */ const char report_help[] = HIST_BROWSER_HELP_COMMON "i Show header information\n" "P Print histograms to perf.hist.N\n" "r Run available scripts\n" "s Switch to another data file in PWD\n" "t Zoom into current Thread\n" "V Verbose (DSO names in callchains, etc)\n" "/ Filter symbol by name"; const char top_help[] = HIST_BROWSER_HELP_COMMON "P Print histograms to perf.hist.N\n" "t Zoom into current Thread\n" "V Verbose (DSO names in callchains, etc)\n" "z Toggle zeroing of samples\n" "/ Filter symbol by name"; if (browser == NULL) return -1; if (min_pcnt) { browser->min_pcnt = min_pcnt; hist_browser__update_nr_entries(browser); } fstack = pstack__new(2); if (fstack == NULL) goto out; ui_helpline__push(helpline); memset(options, 0, sizeof(options)); perf_hpp__for_each_format(fmt) perf_hpp__reset_width(fmt, hists); if (symbol_conf.col_width_list_str) perf_hpp__set_user_width(symbol_conf.col_width_list_str); while (1) { const struct thread *thread = NULL; const struct dso *dso = NULL; int choice = 0, annotate = -2, zoom_dso = -2, zoom_thread = -2, annotate_f = -2, annotate_t = -2, browse_map = -2; int scripts_comm = -2, scripts_symbol = -2, scripts_all = -2, switch_data = -2; nr_options = 0; key = hist_browser__run(browser, hbt); if (browser->he_selection != NULL) { thread = hist_browser__selected_thread(browser); dso = browser->selection->map ? browser->selection->map->dso : NULL; } switch (key) { case K_TAB: case K_UNTAB: if (nr_events == 1) continue; /* * Exit the browser, let hists__browser_tree * go to the next or previous */ goto out_free_stack; case 'a': if (!sort__has_sym) { ui_browser__warning(&browser->b, delay_secs * 2, "Annotation is only available for symbolic views, " "include \"sym*\" in --sort to use it."); continue; } if (browser->selection == NULL || browser->selection->sym == NULL || browser->selection->map->dso->annotate_warned) continue; goto do_annotate; case 'P': hist_browser__dump(browser); continue; case 'd': goto zoom_dso; case 'V': browser->show_dso = !browser->show_dso; continue; case 't': goto zoom_thread; case '/': if (ui_browser__input_window("Symbol to show", "Please enter the name of symbol you want to see", buf, "ENTER: OK, ESC: Cancel", delay_secs * 2) == K_ENTER) { hists->symbol_filter_str = *buf ? buf : NULL; hists__filter_by_symbol(hists); hist_browser__reset(browser); } continue; case 'r': if (is_report_browser(hbt)) goto do_scripts; continue; case 's': if (is_report_browser(hbt)) goto do_data_switch; continue; case 'i': /* env->arch is NULL for live-mode (i.e. perf top) */ if (env->arch) tui__header_window(env); continue; case 'F': symbol_conf.filter_relative ^= 1; continue; case 'z': if (!is_report_browser(hbt)) { struct perf_top *top = hbt->arg; top->zero = !top->zero; } continue; case K_F1: case 'h': case '?': ui_browser__help_window(&browser->b, is_report_browser(hbt) ? report_help : top_help); continue; case K_ENTER: case K_RIGHT: /* menu */ break; case K_LEFT: { const void *top; if (pstack__empty(fstack)) { /* * Go back to the perf_evsel_menu__run or other user */ if (left_exits) goto out_free_stack; continue; } top = pstack__pop(fstack); if (top == &browser->hists->dso_filter) goto zoom_out_dso; if (top == &browser->hists->thread_filter) goto zoom_out_thread; continue; } case K_ESC: if (!left_exits && !ui_browser__dialog_yesno(&browser->b, "Do you really want to exit?")) continue; /* Fall thru */ case 'q': case CTRL('c'): goto out_free_stack; default: continue; } if (!sort__has_sym) goto add_exit_option; if (sort__mode == SORT_MODE__BRANCH) { bi = browser->he_selection->branch_info; if (browser->selection != NULL && bi && bi->from.sym != NULL && !bi->from.map->dso->annotate_warned && asprintf(&options[nr_options], "Annotate %s", bi->from.sym->name) > 0) annotate_f = nr_options++; if (browser->selection != NULL && bi && bi->to.sym != NULL && !bi->to.map->dso->annotate_warned && (bi->to.sym != bi->from.sym || bi->to.map->dso != bi->from.map->dso) && asprintf(&options[nr_options], "Annotate %s", bi->to.sym->name) > 0) annotate_t = nr_options++; } else { if (browser->selection != NULL && browser->selection->sym != NULL && !browser->selection->map->dso->annotate_warned) { struct annotation *notes; notes = symbol__annotation(browser->selection->sym); if (notes->src && asprintf(&options[nr_options], "Annotate %s", browser->selection->sym->name) > 0) annotate = nr_options++; } } if (thread != NULL && asprintf(&options[nr_options], "Zoom %s %s(%d) thread", (browser->hists->thread_filter ? "out of" : "into"), (thread->comm_set ? thread__comm_str(thread) : ""), thread->tid) > 0) zoom_thread = nr_options++; if (dso != NULL && asprintf(&options[nr_options], "Zoom %s %s DSO", (browser->hists->dso_filter ? "out of" : "into"), (dso->kernel ? "the Kernel" : dso->short_name)) > 0) zoom_dso = nr_options++; if (browser->selection != NULL && browser->selection->map != NULL && asprintf(&options[nr_options], "Browse map details") > 0) browse_map = nr_options++; /* perf script support */ if (browser->he_selection) { struct symbol *sym; if (asprintf(&options[nr_options], "Run scripts for samples of thread [%s]", thread__comm_str(browser->he_selection->thread)) > 0) scripts_comm = nr_options++; sym = browser->he_selection->ms.sym; if (sym && sym->namelen && asprintf(&options[nr_options], "Run scripts for samples of symbol [%s]", sym->name) > 0) scripts_symbol = nr_options++; } if (asprintf(&options[nr_options], "Run scripts for all samples") > 0) scripts_all = nr_options++; if (is_report_browser(hbt) && asprintf(&options[nr_options], "Switch to another data file in PWD") > 0) switch_data = nr_options++; add_exit_option: options[nr_options++] = (char *)"Exit"; retry_popup_menu: choice = ui__popup_menu(nr_options, options); if (choice == nr_options - 1) break; if (choice == -1) { free_popup_options(options, nr_options - 1); continue; } if (choice == annotate || choice == annotate_t || choice == annotate_f) { struct hist_entry *he; struct annotation *notes; int err; do_annotate: if (!objdump_path && perf_session_env__lookup_objdump(env)) continue; he = hist_browser__selected_entry(browser); if (he == NULL) continue; /* * we stash the branch_info symbol + map into the * the ms so we don't have to rewrite all the annotation * code to use branch_info. * in branch mode, the ms struct is not used */ if (choice == annotate_f) { he->ms.sym = he->branch_info->from.sym; he->ms.map = he->branch_info->from.map; } else if (choice == annotate_t) { he->ms.sym = he->branch_info->to.sym; he->ms.map = he->branch_info->to.map; } notes = symbol__annotation(he->ms.sym); if (!notes->src) continue; /* * Don't let this be freed, say, by hists__decay_entry. */ he->used = true; err = hist_entry__tui_annotate(he, evsel, hbt); he->used = false; /* * offer option to annotate the other branch source or target * (if they exists) when returning from annotate */ if ((err == 'q' || err == CTRL('c')) && annotate_t != -2 && annotate_f != -2) goto retry_popup_menu; ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries); if (err) ui_browser__handle_resize(&browser->b); } else if (choice == browse_map) map__browse(browser->selection->map); else if (choice == zoom_dso) { zoom_dso: if (browser->hists->dso_filter) { pstack__remove(fstack, &browser->hists->dso_filter); zoom_out_dso: ui_helpline__pop(); browser->hists->dso_filter = NULL; perf_hpp__set_elide(HISTC_DSO, false); } else { if (dso == NULL) continue; ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s DSO\"", dso->kernel ? "the Kernel" : dso->short_name); browser->hists->dso_filter = dso; perf_hpp__set_elide(HISTC_DSO, true); pstack__push(fstack, &browser->hists->dso_filter); } hists__filter_by_dso(hists); hist_browser__reset(browser); } else if (choice == zoom_thread) { zoom_thread: if (browser->hists->thread_filter) { pstack__remove(fstack, &browser->hists->thread_filter); zoom_out_thread: ui_helpline__pop(); browser->hists->thread_filter = NULL; perf_hpp__set_elide(HISTC_THREAD, false); } else { ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"", thread->comm_set ? thread__comm_str(thread) : "", thread->tid); browser->hists->thread_filter = thread; perf_hpp__set_elide(HISTC_THREAD, false); pstack__push(fstack, &browser->hists->thread_filter); } hists__filter_by_thread(hists); hist_browser__reset(browser); } /* perf scripts support */ else if (choice == scripts_all || choice == scripts_comm || choice == scripts_symbol) { do_scripts: memset(script_opt, 0, 64); if (choice == scripts_comm) sprintf(script_opt, " -c %s ", thread__comm_str(browser->he_selection->thread)); if (choice == scripts_symbol) sprintf(script_opt, " -S %s ", browser->he_selection->ms.sym->name); script_browse(script_opt); } /* Switch to another data file */ else if (choice == switch_data) { do_data_switch: if (!switch_data_file()) { key = K_SWITCH_INPUT_DATA; break; } else ui__warning("Won't switch the data files due to\n" "no valid data file get selected!\n"); } } out_free_stack: pstack__delete(fstack); out: hist_browser__delete(browser); free_popup_options(options, nr_options - 1); return key; } struct perf_evsel_menu { struct ui_browser b; struct perf_evsel *selection; bool lost_events, lost_events_warned; float min_pcnt; struct perf_session_env *env; }; static void perf_evsel_menu__write(struct ui_browser *browser, void *entry, int row) { struct perf_evsel_menu *menu = container_of(browser, struct perf_evsel_menu, b); struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node); struct hists *hists = evsel__hists(evsel); bool current_entry = ui_browser__is_current_entry(browser, row); unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE]; const char *ev_name = perf_evsel__name(evsel); char bf[256], unit; const char *warn = " "; size_t printed; ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED : HE_COLORSET_NORMAL); if (perf_evsel__is_group_event(evsel)) { struct perf_evsel *pos; ev_name = perf_evsel__group_name(evsel); for_each_group_member(pos, evsel) { struct hists *pos_hists = evsel__hists(pos); nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE]; } } nr_events = convert_unit(nr_events, &unit); printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events, unit, unit == ' ' ? "" : " ", ev_name); slsmg_printf("%s", bf); nr_events = hists->stats.nr_events[PERF_RECORD_LOST]; if (nr_events != 0) { menu->lost_events = true; if (!current_entry) ui_browser__set_color(browser, HE_COLORSET_TOP); nr_events = convert_unit(nr_events, &unit); printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!", nr_events, unit, unit == ' ' ? "" : " "); warn = bf; } slsmg_write_nstring(warn, browser->width - printed); if (current_entry) menu->selection = evsel; } static int perf_evsel_menu__run(struct perf_evsel_menu *menu, int nr_events, const char *help, struct hist_browser_timer *hbt) { struct perf_evlist *evlist = menu->b.priv; struct perf_evsel *pos; const char *title = "Available samples"; int delay_secs = hbt ? hbt->refresh : 0; int key; if (ui_browser__show(&menu->b, title, "ESC: exit, ENTER|->: Browse histograms") < 0) return -1; while (1) { key = ui_browser__run(&menu->b, delay_secs); switch (key) { case K_TIMER: hbt->timer(hbt->arg); if (!menu->lost_events_warned && menu->lost_events) { ui_browser__warn_lost_events(&menu->b); menu->lost_events_warned = true; } continue; case K_RIGHT: case K_ENTER: if (!menu->selection) continue; pos = menu->selection; browse_hists: perf_evlist__set_selected(evlist, pos); /* * Give the calling tool a chance to populate the non * default evsel resorted hists tree. */ if (hbt) hbt->timer(hbt->arg); key = perf_evsel__hists_browse(pos, nr_events, help, true, hbt, menu->min_pcnt, menu->env); ui_browser__show_title(&menu->b, title); switch (key) { case K_TAB: if (pos->node.next == &evlist->entries) pos = perf_evlist__first(evlist); else pos = perf_evsel__next(pos); goto browse_hists; case K_UNTAB: if (pos->node.prev == &evlist->entries) pos = perf_evlist__last(evlist); else pos = perf_evsel__prev(pos); goto browse_hists; case K_ESC: if (!ui_browser__dialog_yesno(&menu->b, "Do you really want to exit?")) continue; /* Fall thru */ case K_SWITCH_INPUT_DATA: case 'q': case CTRL('c'): goto out; default: continue; } case K_LEFT: continue; case K_ESC: if (!ui_browser__dialog_yesno(&menu->b, "Do you really want to exit?")) continue; /* Fall thru */ case 'q': case CTRL('c'): goto out; default: continue; } } out: ui_browser__hide(&menu->b); return key; } static bool filter_group_entries(struct ui_browser *browser __maybe_unused, void *entry) { struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node); if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel)) return true; return false; } static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist, int nr_entries, const char *help, struct hist_browser_timer *hbt, float min_pcnt, struct perf_session_env *env) { struct perf_evsel *pos; struct perf_evsel_menu menu = { .b = { .entries = &evlist->entries, .refresh = ui_browser__list_head_refresh, .seek = ui_browser__list_head_seek, .write = perf_evsel_menu__write, .filter = filter_group_entries, .nr_entries = nr_entries, .priv = evlist, }, .min_pcnt = min_pcnt, .env = env, }; ui_helpline__push("Press ESC to exit"); evlist__for_each(evlist, pos) { const char *ev_name = perf_evsel__name(pos); size_t line_len = strlen(ev_name) + 7; if (menu.b.width < line_len) menu.b.width = line_len; } return perf_evsel_menu__run(&menu, nr_entries, help, hbt); } int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help, struct hist_browser_timer *hbt, float min_pcnt, struct perf_session_env *env) { int nr_entries = evlist->nr_entries; single_entry: if (nr_entries == 1) { struct perf_evsel *first = perf_evlist__first(evlist); return perf_evsel__hists_browse(first, nr_entries, help, false, hbt, min_pcnt, env); } if (symbol_conf.event_group) { struct perf_evsel *pos; nr_entries = 0; evlist__for_each(evlist, pos) { if (perf_evsel__is_group_leader(pos)) nr_entries++; } if (nr_entries == 1) goto single_entry; } return __perf_evlist__tui_browse_hists(evlist, nr_entries, help, hbt, min_pcnt, env); } |