Profile.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491
  1. /*
  2. * Copyright (c) 2018-2021, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "Profile.h"
  7. #include "DisassemblyModel.h"
  8. #include "ProfileModel.h"
  9. #include "SamplesModel.h"
  10. #include <AK/HashTable.h>
  11. #include <AK/LexicalPath.h>
  12. #include <AK/MappedFile.h>
  13. #include <AK/NonnullOwnPtrVector.h>
  14. #include <AK/QuickSort.h>
  15. #include <AK/RefPtr.h>
  16. #include <LibCore/File.h>
  17. #include <LibELF/Image.h>
  18. #include <sys/stat.h>
  19. namespace Profiler {
  20. static void sort_profile_nodes(Vector<NonnullRefPtr<ProfileNode>>& nodes)
  21. {
  22. quick_sort(nodes.begin(), nodes.end(), [](auto& a, auto& b) {
  23. return a->event_count() >= b->event_count();
  24. });
  25. for (auto& child : nodes)
  26. child->sort_children();
  27. }
  28. Profile::Profile(Vector<Process> processes, Vector<Event> events)
  29. : m_processes(move(processes))
  30. , m_events(move(events))
  31. {
  32. m_first_timestamp = m_events.first().timestamp;
  33. m_last_timestamp = m_events.last().timestamp;
  34. m_model = ProfileModel::create(*this);
  35. m_samples_model = SamplesModel::create(*this);
  36. for (auto& event : m_events) {
  37. m_deepest_stack_depth = max((u32)event.frames.size(), m_deepest_stack_depth);
  38. }
  39. rebuild_tree();
  40. }
  41. Profile::~Profile()
  42. {
  43. }
  44. GUI::Model& Profile::model()
  45. {
  46. return *m_model;
  47. }
  48. GUI::Model& Profile::samples_model()
  49. {
  50. return *m_samples_model;
  51. }
  52. void Profile::rebuild_tree()
  53. {
  54. Vector<NonnullRefPtr<ProfileNode>> roots;
  55. auto find_or_create_root = [&roots](FlyString object_name, String symbol, u32 address, u32 offset, u64 timestamp, pid_t pid) -> ProfileNode& {
  56. for (auto root : roots) {
  57. if (root->symbol() == symbol) {
  58. return root;
  59. }
  60. }
  61. auto new_root = ProfileNode::create(move(object_name), move(symbol), address, offset, timestamp, pid);
  62. roots.append(new_root);
  63. return new_root;
  64. };
  65. HashTable<FlatPtr> live_allocations;
  66. for_each_event_in_filter_range([&](auto& event) {
  67. if (event.type == "malloc"sv)
  68. live_allocations.set(event.ptr);
  69. else if (event.type == "free"sv)
  70. live_allocations.remove(event.ptr);
  71. });
  72. m_filtered_event_indices.clear();
  73. for (size_t event_index = 0; event_index < m_events.size(); ++event_index) {
  74. auto& event = m_events.at(event_index);
  75. if (has_timestamp_filter_range()) {
  76. auto timestamp = event.timestamp;
  77. if (timestamp < m_timestamp_filter_range_start || timestamp > m_timestamp_filter_range_end)
  78. continue;
  79. }
  80. if (!process_filter_contains(event.pid, event.timestamp))
  81. continue;
  82. m_filtered_event_indices.append(event_index);
  83. if (event.type == "malloc"sv && !live_allocations.contains(event.ptr))
  84. continue;
  85. if (event.type == "free"sv)
  86. continue;
  87. auto for_each_frame = [&]<typename Callback>(Callback callback) {
  88. if (!m_inverted) {
  89. for (size_t i = 0; i < event.frames.size(); ++i) {
  90. if (callback(event.frames.at(i), i == event.frames.size() - 1) == IterationDecision::Break)
  91. break;
  92. }
  93. } else {
  94. for (ssize_t i = event.frames.size() - 1; i >= 0; --i) {
  95. if (callback(event.frames.at(i), static_cast<size_t>(i) == event.frames.size() - 1) == IterationDecision::Break)
  96. break;
  97. }
  98. }
  99. };
  100. if (!m_show_top_functions) {
  101. ProfileNode* node = nullptr;
  102. for_each_frame([&](const Frame& frame, bool is_innermost_frame) {
  103. auto& object_name = frame.object_name;
  104. auto& symbol = frame.symbol;
  105. auto& address = frame.address;
  106. auto& offset = frame.offset;
  107. if (symbol.is_empty())
  108. return IterationDecision::Break;
  109. // FIXME: More cheating with intentional mixing of TID/PID here:
  110. if (!node)
  111. node = &find_or_create_root(object_name, symbol, address, offset, event.timestamp, event.pid);
  112. else
  113. node = &node->find_or_create_child(object_name, symbol, address, offset, event.timestamp, event.pid);
  114. node->increment_event_count();
  115. if (is_innermost_frame) {
  116. node->add_event_address(address);
  117. node->increment_self_count();
  118. }
  119. return IterationDecision::Continue;
  120. });
  121. } else {
  122. for (size_t i = 0; i < event.frames.size(); ++i) {
  123. ProfileNode* node = nullptr;
  124. ProfileNode* root = nullptr;
  125. for (size_t j = i; j < event.frames.size(); ++j) {
  126. auto& frame = event.frames.at(j);
  127. auto& object_name = frame.object_name;
  128. auto& symbol = frame.symbol;
  129. auto& address = frame.address;
  130. auto& offset = frame.offset;
  131. if (symbol.is_empty())
  132. break;
  133. // FIXME: More PID/TID mixing cheats here:
  134. if (!node) {
  135. node = &find_or_create_root(object_name, symbol, address, offset, event.timestamp, event.pid);
  136. root = node;
  137. root->will_track_seen_events(m_events.size());
  138. } else {
  139. node = &node->find_or_create_child(object_name, symbol, address, offset, event.timestamp, event.pid);
  140. }
  141. if (!root->has_seen_event(event_index)) {
  142. root->did_see_event(event_index);
  143. root->increment_event_count();
  144. } else if (node != root) {
  145. node->increment_event_count();
  146. }
  147. if (j == event.frames.size() - 1) {
  148. node->add_event_address(address);
  149. node->increment_self_count();
  150. }
  151. }
  152. }
  153. }
  154. }
  155. sort_profile_nodes(roots);
  156. m_roots = move(roots);
  157. m_model->update();
  158. }
  159. Result<NonnullOwnPtr<Profile>, String> Profile::load_from_perfcore_file(const StringView& path)
  160. {
  161. auto file = Core::File::construct(path);
  162. if (!file->open(Core::OpenMode::ReadOnly))
  163. return String::formatted("Unable to open {}, error: {}", path, file->error_string());
  164. auto json = JsonValue::from_string(file->read_all());
  165. if (!json.has_value() || !json.value().is_object())
  166. return String { "Invalid perfcore format (not a JSON object)" };
  167. auto& object = json.value().as_object();
  168. auto file_or_error = MappedFile::map("/boot/Kernel");
  169. OwnPtr<ELF::Image> kernel_elf;
  170. if (!file_or_error.is_error())
  171. kernel_elf = make<ELF::Image>(file_or_error.value()->bytes());
  172. auto events_value = object.get_ptr("events");
  173. if (!events_value || !events_value->is_array())
  174. return String { "Malformed profile (events is not an array)" };
  175. auto& perf_events = events_value->as_array();
  176. NonnullOwnPtrVector<Process> all_processes;
  177. HashMap<pid_t, Process*> current_processes;
  178. Vector<Event> events;
  179. for (auto& perf_event_value : perf_events.values()) {
  180. auto& perf_event = perf_event_value.as_object();
  181. Event event;
  182. event.timestamp = perf_event.get("timestamp").to_number<u64>();
  183. event.lost_samples = perf_event.get("lost_samples").to_number<u32>();
  184. event.type = perf_event.get("type").to_string();
  185. event.pid = perf_event.get("pid").to_i32();
  186. event.tid = perf_event.get("tid").to_i32();
  187. if (event.type == "malloc"sv) {
  188. event.ptr = perf_event.get("ptr").to_number<FlatPtr>();
  189. event.size = perf_event.get("size").to_number<size_t>();
  190. } else if (event.type == "free"sv) {
  191. event.ptr = perf_event.get("ptr").to_number<FlatPtr>();
  192. } else if (event.type == "mmap"sv) {
  193. event.ptr = perf_event.get("ptr").to_number<FlatPtr>();
  194. event.size = perf_event.get("size").to_number<size_t>();
  195. event.name = perf_event.get("name").to_string();
  196. auto it = current_processes.find(event.pid);
  197. if (it != current_processes.end())
  198. it->value->library_metadata.handle_mmap(event.ptr, event.size, event.name);
  199. continue;
  200. } else if (event.type == "munmap"sv) {
  201. event.ptr = perf_event.get("ptr").to_number<FlatPtr>();
  202. event.size = perf_event.get("size").to_number<size_t>();
  203. continue;
  204. } else if (event.type == "process_create"sv) {
  205. event.parent_pid = perf_event.get("parent_pid").to_number<FlatPtr>();
  206. event.executable = perf_event.get("executable").to_string();
  207. auto sampled_process = adopt_own(*new Process {
  208. .pid = event.pid,
  209. .executable = event.executable,
  210. .start_valid = event.timestamp,
  211. });
  212. current_processes.set(sampled_process->pid, sampled_process);
  213. all_processes.append(move(sampled_process));
  214. continue;
  215. } else if (event.type == "process_exec"sv) {
  216. event.executable = perf_event.get("executable").to_string();
  217. auto old_process = current_processes.get(event.pid).value();
  218. old_process->end_valid = event.timestamp - 1;
  219. current_processes.remove(event.pid);
  220. auto sampled_process = adopt_own(*new Process {
  221. .pid = event.pid,
  222. .executable = event.executable,
  223. .start_valid = event.timestamp });
  224. current_processes.set(sampled_process->pid, sampled_process);
  225. all_processes.append(move(sampled_process));
  226. continue;
  227. } else if (event.type == "process_exit"sv) {
  228. auto old_process = current_processes.get(event.pid).value();
  229. old_process->end_valid = event.timestamp - 1;
  230. current_processes.remove(event.pid);
  231. continue;
  232. } else if (event.type == "thread_create"sv) {
  233. event.parent_tid = perf_event.get("parent_tid").to_i32();
  234. auto it = current_processes.find(event.pid);
  235. if (it != current_processes.end())
  236. it->value->handle_thread_create(event.tid, event.timestamp);
  237. continue;
  238. } else if (event.type == "thread_exit"sv) {
  239. auto it = current_processes.find(event.pid);
  240. if (it != current_processes.end())
  241. it->value->handle_thread_exit(event.tid, event.timestamp);
  242. continue;
  243. }
  244. auto* stack = perf_event.get_ptr("stack");
  245. VERIFY(stack);
  246. auto& stack_array = stack->as_array();
  247. for (ssize_t i = stack_array.values().size() - 1; i >= 0; --i) {
  248. auto& frame = stack_array.at(i);
  249. auto ptr = frame.to_number<u32>();
  250. u32 offset = 0;
  251. FlyString object_name;
  252. String symbol;
  253. if (ptr >= 0xc0000000) {
  254. if (kernel_elf) {
  255. symbol = kernel_elf->symbolicate(ptr, &offset);
  256. } else {
  257. symbol = String::formatted("?? <{:p}>", ptr);
  258. }
  259. } else {
  260. auto it = current_processes.find(event.pid);
  261. // FIXME: This logic is kinda gnarly, find a way to clean it up.
  262. LibraryMetadata* library_metadata {};
  263. if (it != current_processes.end())
  264. library_metadata = &it->value->library_metadata;
  265. if (auto* library = library_metadata ? library_metadata->library_containing(ptr) : nullptr) {
  266. object_name = library->name;
  267. symbol = library->symbolicate(ptr, &offset);
  268. } else {
  269. symbol = String::formatted("?? <{:p}>", ptr);
  270. }
  271. }
  272. event.frames.append({ object_name, symbol, ptr, offset });
  273. }
  274. if (event.frames.size() < 2)
  275. continue;
  276. FlatPtr innermost_frame_address = event.frames.at(1).address;
  277. event.in_kernel = innermost_frame_address >= 0xc0000000;
  278. events.append(move(event));
  279. }
  280. if (events.is_empty())
  281. return String { "No events captured (targeted process was never on CPU)" };
  282. quick_sort(all_processes, [](auto& a, auto& b) {
  283. if (a.pid == b.pid)
  284. return a.start_valid < b.start_valid;
  285. else
  286. return a.pid < b.pid;
  287. });
  288. Vector<Process> processes;
  289. for (auto& it : all_processes)
  290. processes.append(move(it));
  291. return adopt_own(*new Profile(move(processes), move(events)));
  292. }
  293. void ProfileNode::sort_children()
  294. {
  295. sort_profile_nodes(m_children);
  296. }
  297. void Profile::set_timestamp_filter_range(u64 start, u64 end)
  298. {
  299. if (m_has_timestamp_filter_range && m_timestamp_filter_range_start == start && m_timestamp_filter_range_end == end)
  300. return;
  301. m_has_timestamp_filter_range = true;
  302. m_timestamp_filter_range_start = min(start, end);
  303. m_timestamp_filter_range_end = max(start, end);
  304. rebuild_tree();
  305. m_samples_model->update();
  306. }
  307. void Profile::clear_timestamp_filter_range()
  308. {
  309. if (!m_has_timestamp_filter_range)
  310. return;
  311. m_has_timestamp_filter_range = false;
  312. rebuild_tree();
  313. m_samples_model->update();
  314. }
  315. void Profile::add_process_filter(pid_t pid, u64 start_valid, u64 end_valid)
  316. {
  317. auto filter = ProcessFilter { pid, start_valid, end_valid };
  318. if (m_process_filters.contains_slow(filter))
  319. return;
  320. m_process_filters.append(move(filter));
  321. rebuild_tree();
  322. if (m_disassembly_model)
  323. m_disassembly_model->update();
  324. m_samples_model->update();
  325. }
  326. void Profile::remove_process_filter(pid_t pid, u64 start_valid, u64 end_valid)
  327. {
  328. auto filter = ProcessFilter { pid, start_valid, end_valid };
  329. if (!m_process_filters.contains_slow(filter))
  330. return;
  331. m_process_filters.remove_first_matching([&filter](ProcessFilter const& other_filter) {
  332. return other_filter == filter;
  333. });
  334. rebuild_tree();
  335. if (m_disassembly_model)
  336. m_disassembly_model->update();
  337. m_samples_model->update();
  338. }
  339. void Profile::clear_process_filter()
  340. {
  341. if (m_process_filters.is_empty())
  342. return;
  343. m_process_filters.clear();
  344. rebuild_tree();
  345. if (m_disassembly_model)
  346. m_disassembly_model->update();
  347. m_samples_model->update();
  348. }
  349. bool Profile::process_filter_contains(pid_t pid, u32 timestamp)
  350. {
  351. if (!has_process_filter())
  352. return true;
  353. for (auto const& process_filter : m_process_filters)
  354. if (pid == process_filter.pid && timestamp >= process_filter.start_valid && timestamp <= process_filter.end_valid)
  355. return true;
  356. return false;
  357. }
  358. void Profile::set_inverted(bool inverted)
  359. {
  360. if (m_inverted == inverted)
  361. return;
  362. m_inverted = inverted;
  363. rebuild_tree();
  364. }
  365. void Profile::set_show_top_functions(bool show)
  366. {
  367. if (m_show_top_functions == show)
  368. return;
  369. m_show_top_functions = show;
  370. rebuild_tree();
  371. }
  372. void Profile::set_show_percentages(bool show_percentages)
  373. {
  374. if (m_show_percentages == show_percentages)
  375. return;
  376. m_show_percentages = show_percentages;
  377. }
  378. void Profile::set_disassembly_index(const GUI::ModelIndex& index)
  379. {
  380. if (m_disassembly_index == index)
  381. return;
  382. m_disassembly_index = index;
  383. auto* node = static_cast<ProfileNode*>(index.internal_data());
  384. m_disassembly_model = DisassemblyModel::create(*this, *node);
  385. }
  386. GUI::Model* Profile::disassembly_model()
  387. {
  388. return m_disassembly_model;
  389. }
  390. ProfileNode::ProfileNode(const String& object_name, String symbol, u32 address, u32 offset, u64 timestamp, pid_t pid)
  391. : m_symbol(move(symbol))
  392. , m_pid(pid)
  393. , m_address(address)
  394. , m_offset(offset)
  395. , m_timestamp(timestamp)
  396. {
  397. String object;
  398. if (object_name.ends_with(": .text"sv)) {
  399. object = object_name.view().substring_view(0, object_name.length() - 7);
  400. } else {
  401. object = object_name;
  402. }
  403. m_object_name = LexicalPath(object).basename();
  404. }
  405. const Process* ProfileNode::process(Profile& profile, u64 timestamp) const
  406. {
  407. return profile.find_process(m_pid, timestamp);
  408. }
  409. }