commit | 51475bc85d86969ec395f0011c7c28841d0ccaf2 | [log] [tgz] |
---|---|---|
author | Lalit Maganti <lalitm@google.com> | Mon Apr 08 10:37:06 2024 +0100 |
committer | Lalit Maganti <lalitm@google.com> | Mon Apr 08 10:37:06 2024 +0100 |
tree | b439c1c1790a628a1df7be9f1ca1d546072ecc9b | |
parent | d5f1f982e6d33f4ad980a3277457717acc130ad5 [diff] |
tp: implement tree partitioning by group algorithm This CL implements an algorithm to partition tree into a forest based on a grouping key and preserving the structure of the original tree. This algorithm will be used to prevent double-counting for heap graphs and also might be generally useful in the future for critical path work. Change-Id: I0f0e89227d7da53f2b7bb89c4dfc9ba070ff872b
Perfetto is a production-grade open-source stack for performance instrumentation and trace analysis. It offers services and libraries and for recording system-level and app-level traces, native + java heap profiling, a library for analyzing traces using SQL and a web-based UI to visualize and explore multi-GB traces.
See https://perfetto.dev/docs or the /docs/ directory for documentation.