graph_impl_operations.cc 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
  1. // Copyright 2019 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "components/performance_manager/graph/graph_impl_operations.h"
  5. #include "components/performance_manager/graph/process_node_impl.h"
  6. namespace performance_manager {
  7. // static
  8. base::flat_set<PageNodeImpl*> GraphImplOperations::GetAssociatedPageNodes(
  9. const ProcessNodeImpl* process) {
  10. base::flat_set<PageNodeImpl*> page_nodes;
  11. for (auto* frame_node : process->frame_nodes())
  12. page_nodes.insert(frame_node->page_node());
  13. return page_nodes;
  14. }
  15. // static
  16. base::flat_set<ProcessNodeImpl*> GraphImplOperations::GetAssociatedProcessNodes(
  17. const PageNodeImpl* page) {
  18. base::flat_set<ProcessNodeImpl*> process_nodes;
  19. VisitFrameTreePreOrder(page,
  20. [&process_nodes](FrameNodeImpl* frame_node) -> bool {
  21. if (auto* process_node = frame_node->process_node())
  22. process_nodes.insert(process_node);
  23. return true;
  24. });
  25. return process_nodes;
  26. }
  27. // static
  28. std::vector<FrameNodeImpl*> GraphImplOperations::GetFrameNodes(
  29. const PageNodeImpl* page) {
  30. std::vector<FrameNodeImpl*> frame_nodes;
  31. frame_nodes.reserve(20); // This is in the 99.9th %ile of frame tree sizes.
  32. for (auto* main_frame_node : page->main_frame_nodes())
  33. frame_nodes.push_back(main_frame_node);
  34. for (size_t i = 0; i < frame_nodes.size(); ++i) {
  35. auto* parent_frame_node = frame_nodes[i];
  36. for (auto* frame_node : parent_frame_node->child_frame_nodes())
  37. frame_nodes.push_back(frame_node);
  38. }
  39. return frame_nodes;
  40. }
  41. // static
  42. bool GraphImplOperations::HasFrame(const PageNodeImpl* page,
  43. FrameNodeImpl* frame) {
  44. bool has_frame = false;
  45. VisitFrameTreePreOrder(page, [&has_frame, frame](FrameNodeImpl* f) -> bool {
  46. if (f == frame) {
  47. has_frame = true;
  48. return false;
  49. }
  50. return true;
  51. });
  52. return has_frame;
  53. }
  54. } // namespace performance_manager