commit | 8ae4c8664cc1d6e3e7dc0cd20ceeb78f6bcce4e5 | [log] [tgz] |
---|---|---|
author | Lalit Maganti <lalitm@google.com> | Tue Apr 23 16:50:16 2024 +0100 |
committer | Lalit Maganti <lalitm@google.com> | Tue Apr 23 18:18:08 2024 +0000 |
tree | f65f085e62daf7957f9906324a445cb3c3f24f36 | |
parent | e2dfc3df692d87605a3ef32159b72629342a21f1 [diff] |
tp: implement an implicit segment-tree like data structure This CL implements an implicit variant of a segment-tree [1] most closely described by [2]. This data structure will be used in upcoming CLs to compute aggregations over events in large traces for the UI, significantly speeding up the queries UI makes against trace processor. [1] https://en.algorithmica.org/hpc/data-structures/segment-trees/ [2] https://thume.ca/2021/03/14/iforests/ Change-Id: I9fe71b67985b1c777733407136e95900f6e9c5a3
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.