1# Trace Processor 2 3_The Trace Processor is a C++ library 4([/src/trace_processor](/src/trace_processor)) that ingests traces encoded in a 5wide variety of formats and exposes an SQL interface for querying trace events 6contained in a consistent set of tables. It also has other features including 7computation of summary metrics, annotating the trace with user-friendly 8descriptions and deriving new events from the contents of the trace._ 9 10 11 12## Quickstart 13 14The [quickstart](/docs/quickstart/trace-analysis.md) provides a quick overview 15on how to run SQL queries against traces using trace processor. 16 17## Introduction 18 19Events in a trace are optimized for fast, low-overhead recording. Therefore 20traces need significant data processing to extract meaningful information from 21them. This is compounded by the number of legacy formats which are still in use and 22need to be supported in trace analysis tools. 23 24The trace processor abstracts this complexity by parsing traces, extracting the 25data inside, and exposing it in a set of database tables which can be queried 26with SQL. 27 28Features of the trace processor include: 29 30* Execution of SQL queries on a custom, in-memory, columnar database backed by 31 the SQLite query engine. 32* Metrics subsystem which allows computation of summarized view of the trace 33 (e.g. CPU or memory usage of a process, time taken for app startup etc.). 34* Annotating events in the trace with user-friendly descriptions, providing 35 context and explanation of events to newer users. 36* Creation of new events derived from the contents of the trace. 37 38The formats supported by trace processor include: 39 40* Perfetto native protobuf format 41* Linux ftrace 42* Android systrace 43* Chrome JSON (including JSON embedding Android systrace text) 44* Fuchsia binary format 45* [Ninja](https://ninja-build.org/) logs (the build system) 46 47The trace processor is embedded in a wide variety of trace analysis tools, including: 48 49* [trace_processor](/docs/analysis/trace-processor.md), a standalone binary 50 providing a shell interface (and the reference embedder). 51* [Perfetto UI](https://ui.perfetto.dev), in the form of a WebAssembly module. 52* [Android GPU Inspector](https://gpuinspector.dev/). 53* [Android Studio](https://developer.android.com/studio/). 54 55## Concepts 56 57The trace processor has some foundational terminology and concepts which are 58used in the rest of documentation. 59 60### Events 61 62In the most general sense, a trace is simply a collection of timestamped 63"events". Events can have associated metadata and context which allows them to 64be interpreted and analyzed. 65 66Events form the foundation of trace processor and are one of two types: slices 67and counters. 68 69#### Slices 70 71 72 73A slice refers to an interval of time with some data describing what was 74happening in that interval. Some example of slices include: 75 76* Scheduling slices for each CPU 77* Atrace slices on Android 78* Userspace slices from Chrome 79 80#### Counters 81 82 83 84A counter is a continuous value which varies over time. Some examples of 85counters include: 86 87* CPU frequency for each CPU core 88* RSS memory events - both from the kernel and polled from /proc/stats 89* atrace counter events from Android 90* Chrome counter events 91 92### Tracks 93 94A track is a named partition of events of the same type and the same associated 95context. For example: 96 97* Scheduling slices have one track for each CPU 98* Sync userspace slice have one track for each thread which emitted an event 99* Async userspace slices have one track for each “cookie” linking a set of async 100 events 101 102The most intuitive way to think of a track is to imagine how they would be drawn 103in a UI; if all the events are in a single row, they belong to the same track. 104For example, all the scheduling events for CPU 5 are on the same track: 105 106 107 108Tracks can be split into various types based on the type of event they contain 109and the context they are associated with. Examples include: 110 111* Global tracks are not associated to any context and contain slices 112* Thread tracks are associated to a single thread and contain slices 113* Counter tracks are not associated to any context and contain counters 114* CPU counter tracks are associated to a single CPU and contain counters 115 116### Thread and process identifiers 117 118The handling of threads and processes needs special care when considered in the 119context of tracing; identifiers for threads and processes (e.g. `pid`/`tgid` and 120`tid` in Android/macOS/Linux) can be reused by the operating system over the 121course of a trace. This means they cannot be relied upon as a unique identifier 122when querying tables in trace processor. 123 124To solve this problem, the trace processor uses `utid` (_unique_ tid) for 125threads and `upid` (_unique_ pid) for processes. All references to threads and 126processes (e.g. in CPU scheduling data, thread tracks) uses `utid` and `upid` 127instead of the system identifiers. 128 129## Object-oriented tables 130 131Modeling an object with many types is a common problem in trace processor. For 132example, tracks can come in many varieties (thread tracks, process tracks, 133counter tracks etc). Each type has a piece of data associated to it unique to 134that type; for example, thread tracks have a `utid` of the thread, counter 135tracks have the `unit` of the counter. 136 137To solve this problem in object-oriented languages, a `Track` class could be 138created and inheritance used for all subclasses (e.g. `ThreadTrack` and 139`CounterTrack` being subclasses of `Track`, `ProcessCounterTrack` being a 140subclass of `CounterTrack` etc). 141 142 143 144In trace processor, this "object-oriented" approach is replicated by having 145different tables for each type of object. For example, we have a `track` table 146as the "root" of the hierarchy with the `thread_track` and `counter_track` 147tables "inheriting from" the `track` table. 148 149NOTE: [The appendix below](#appendix-table-inheritance) gives the exact rules 150for inheritance between tables for interested readers. 151 152Inheritance between the tables works in the natural way (i.e. how it works in 153OO languages) and is best summarized by a diagram. 154 155 156 157NOTE: For an up-to-date of how tables currently inherit from each other as well 158as a comprehensive reference of all the column and how they are inherited see 159the [SQL tables](/docs/analysis/sql-tables.autogen) reference page. 160 161## Writing Queries 162 163### Context using tracks 164 165A common question when querying tables in trace processor is: "how do I obtain 166the process or thread for a slice?". Phrased more generally, the question is 167"how do I get the context for an event?". 168 169In trace processor, any context associated with all events on a track is found 170on the associated `track` tables. 171 172For example, to obtain the `utid` of any thread which emitted a `measure` slice 173 174```sql 175SELECT utid 176FROM slice 177JOIN thread_track ON thread_track.id = slice.track_id 178WHERE slice.name = 'measure' 179``` 180 181Similarly, to obtain the `upid`s of any process which has a `mem.swap` counter 182greater than 1000 183 184```sql 185SELECT upid 186FROM counter 187JOIN process_counter_track ON process_counter_track.id = counter.track_id 188WHERE process_counter_track.name = 'mem.swap' AND value > 1000 189``` 190 191If the source and type of the event is known beforehand (which is generally the 192case), the following can be used to find the `track` table to join with 193 194| Event type | Associated with | Track table | Constraint in WHERE clause | 195| :--------- | ------------------ | --------------------- | -------------------------- | 196| slice | N/A (global scope) | track | `type = 'track'` | 197| slice | thread | thread_track | N/A | 198| slice | process | process_track | N/A | 199| counter | N/A (global scope) | counter_track | `type = 'counter_track'` | 200| counter | thread | thread_counter_track | N/A | 201| counter | process | process_counter_track | N/A | 202| counter | cpu | cpu_counter_track | N/A | 203 204On the other hand, sometimes the source is not known. In this case, joining with 205the `track `table and looking up the `type` column will give the exact track 206table to join with. 207 208For example, to find the type of track for `measure` events, the following query 209could be used. 210 211```sql 212SELECT type 213FROM slice 214JOIN track ON track.id = slice.track_id 215WHERE slice.name = 'measure' 216``` 217 218### Thread and process tables 219 220While obtaining `utid`s and `upid`s are a step in the right direction, generally 221users want the original `tid`, `pid`, and process/thread names. 222 223The `thread` and `process` tables map `utid`s and `upid`s to threads and 224processes respectively. For example, to lookup the thread with `utid` 10 225 226```sql 227SELECT tid, name 228FROM thread 229WHERE utid = 10 230``` 231 232The `thread` and `process` tables can also be joined with the associated track 233tables directly to jump directly from the slice or counter to the information 234about processes and threads. 235 236For example, to get a list of all the threads which emitted a `measure` slice 237 238```sql 239SELECT thread.name AS thread_name 240FROM slice 241JOIN thread_track ON slice.track_id = thread_track.id 242JOIN thread USING(utid) 243WHERE slice.name = 'measure' 244GROUP BY thread_name 245``` 246 247## Helper functions 248Helper functions are functions built into C++ which reduce the amount of 249boilerplate which needs to be written in SQL. 250 251### Extract args 252`EXTRACT_ARG` is a helper function which retreives a property of an 253event (e.g. slice or counter) from the `args` table. 254 255It takes an `arg_set_id` and `key` as input and returns the value looked 256up in the `args` table. 257 258For example, to retrieve the `prev_comm` field for `sched_switch` events in 259the `raw` table. 260```sql 261SELECT EXTRACT_ARG(arg_set_id, 'prev_comm') 262FROM raw 263WHERE name = 'sched_switch' 264``` 265 266Behind the scenes, the above query would desugar to the following: 267```sql 268SELECT 269 ( 270 SELECT string_value 271 FROM args 272 WHERE key = 'prev_comm' AND args.arg_set_id = raw.arg_set_id 273 ) 274FROM raw 275WHERE name = 'sched_switch' 276``` 277 278NOTE: while convinient, `EXTRACT_ARG` can inefficient compared to a `JOIN` 279when working with very large tables; a function call is required for every 280row which will be slower than the batch filters/sorts used by `JOIN`. 281 282## Operator tables 283SQL queries are usually sufficient to retrieve data from trace processor. 284Sometimes though, certain constructs can be difficult to express pure SQL. 285 286In these situations, trace processor has special "operator tables" which solve 287a particular problem in C++ but expose an SQL interface for queries to take 288advantage of. 289 290### Span join 291Span join is a custom operator table which computes the intersection of 292spans of time from two tables or views. A column (called the *partition*) 293can optionally be specified which divides the rows from each table into 294partitions before computing the intersection. 295 296 297 298```sql 299-- Get all the scheduling slices 300CREATE VIEW sp_sched AS 301SELECT ts, dur, cpu, utid 302FROM sched; 303 304-- Get all the cpu frequency slices 305CREATE VIEW sp_frequency AS 306SELECT 307 ts, 308 lead(ts) OVER (PARTITION BY track_id ORDER BY ts) - ts as dur, 309 cpu, 310 value as freq 311FROM counter 312JOIN cpu_counter_track ON counter.track_id = cpu_counter_track.id; 313 314-- Create the span joined table which combines cpu frequency with 315-- scheduling slices. 316CREATE VIRTUAL TABLE sched_with_frequency 317USING SPAN_JOIN(sp_sched PARTITIONED cpu, sp_frequency PARTITIONED cpu); 318 319-- This span joined table can be queried as normal and has the columns from both 320-- tables. 321SELECT ts, dur, cpu, utid, freq 322FROM sched_with_frequency; 323``` 324 325NOTE: A partition can be specified on neither, either or both tables. If 326specified on both, the same column name has to be specified on each table. 327 328WARNING: An important restriction on span joined tables is that spans from 329the same table in the same partition *cannot* overlap. For performance 330reasons, span join does not attempt to detect and error out in this situation; 331instead, incorrect rows will silently be produced. 332 333Left and outer span joins are also supported; both function analogously to 334the left and outer joins from SQL. 335```sql 336-- Left table partitioned + right table unpartitioned. 337CREATE VIRTUAL TABLE left_join 338USING SPAN_LEFT_JOIN(table_a PARTITIONED a, table_b); 339 340-- Both tables unpartitioned. 341CREATE VIRTUAL TABLE outer_join 342USING SPAN_OUTER_JOIN(table_x, table_y); 343``` 344 345NOTE: there is a subtlety if the partitioned table is empty and is 346either a) part of an outer join b) on the right side of a left join. 347In this case, *no* slices will be emitted even if the other table is 348non-empty. This approach was decided as being the most natural 349after considering how span joins are used in practice. 350 351### Ancestor slice 352ancestor_slice is a custom operator table that takes a 353[slice table's id column](/docs/analysis/sql-tables.autogen#slice) and computes 354all slices on the same track that are direct parents above that id (i.e. given 355a slice id it will return as rows all slices that can be found by following 356the parent_id column to the top slice (depth = 0)). 357 358The returned format is the same as the 359[slice table](/docs/analysis/sql-tables.autogen#slice) 360 361For example, the following finds the top level slice given a bunch of slices of 362interest. 363 364```sql 365CREATE VIEW interesting_slices AS 366SELECT id, ts, dur, track_id 367FROM slice WHERE name LIKE "%interesting slice name%"; 368 369SELECT 370 * 371FROM 372 interesting_slices LEFT JOIN 373 ancestor_slice(interesting_slices.id) AS ancestor ON ancestor.depth = 0 374``` 375 376### Ancestor slice by stack 377ancestor_slice_by_stack is a custom operator table that takes a 378[slice table's stack_id column](/docs/analysis/sql-tables.autogen#slice) and 379finds all slice ids with that stack_id, then, for each id it computes 380all the ancestor slices similarly to 381[ancestor_slice](/docs/analysis/trace-processor#ancestor-slice). 382 383The returned format is the same as the 384[slice table](/docs/analysis/sql-tables.autogen#slice) 385 386For example, the following finds the top level slice of all slices with the 387given name. 388 389```sql 390CREATE VIEW interesting_stack_ids AS 391SELECT stack_id 392FROM slice WHERE name LIKE "%interesting slice name%"; 393 394SELECT 395 * 396FROM 397 interesting_stack_ids LEFT JOIN 398 ancestor_slice_by_stack(interesting_stack_ids.stack_id) AS ancestor 399 ON ancestor.depth = 0 400``` 401 402### Descendant slice 403descendant_slice is a custom operator table that takes a 404[slice table's id column](/docs/analysis/sql-tables.autogen#slice) and 405computes all slices on the same track that are nested under that id (i.e. 406all slices that are on the same track at the same time frame with a depth 407greater than the given slice's depth. 408 409The returned format is the same as the 410[slice table](/docs/analysis/sql-tables.autogen#slice) 411 412For example, the following finds the number of slices under each slice of 413interest. 414 415```sql 416CREATE VIEW interesting_slices AS 417SELECT id, ts, dur, track_id 418FROM slice WHERE name LIKE "%interesting slice name%"; 419 420SELECT 421 * 422 ( 423 SELECT 424 COUNT(*) AS total_descendants 425 FROM descendant_slice(interesting_slice.id) 426 ) 427FROM interesting_slices 428``` 429 430### Descendant slice by stack 431descendant_slice_by_stack is a custom operator table that takes a 432[slice table's stack_id column](/docs/analysis/sql-tables.autogen#slice) and 433finds all slice ids with that stack_id, then, for each id it computes 434all the descendant slices similarly to 435[descendant_slice](/docs/analysis/trace-processor#descendant-slice). 436 437The returned format is the same as the 438[slice table](/docs/analysis/sql-tables.autogen#slice) 439 440For example, the following finds the next level descendant of all slices with 441the given name. 442 443```sql 444CREATE VIEW interesting_stacks AS 445SELECT stack_id, depth 446FROM slice WHERE name LIKE "%interesting slice name%"; 447 448SELECT 449 * 450FROM 451 interesting_stacks LEFT JOIN 452 descendant_slice_by_stack(interesting_stacks.stack_id) AS descendant 453 ON descendant.depth = interesting_stacks.depth + 1 454``` 455 456### Connected/Following/Preceding flows 457 458DIRECTLY_CONNECTED_FLOW, FOLLOWING_FLOW and PRECEDING_FLOW are custom operator 459tables that take a 460[slice table's id column](/docs/analysis/sql-tables.autogen#slice) and collect 461all entries of [flow table](/docs/analysis/sql-tables.autogen#flow), that are 462directly or indirectly connected to the given starting slice. 463 464`DIRECTLY_CONNECTED_FLOW(start_slice_id)` - contains all entries of 465[flow table](/docs/analysis/sql-tables.autogen#flow) that are present in any 466chain of kind: `flow[0] -> flow[1] -> ... -> flow[n]`, where 467`flow[i].slice_out = flow[i+1].slice_in` and `flow[0].slice_out = start_slice_id 468OR start_slice_id = flow[n].slice_in`. 469 470NOTE: Unlike the following/preceding flow functions, this function will not 471include flows connected to ancestors or descendants while searching for flows 472from a slice. It only includes the slices in the directly connected chain. 473 474`FOLLOWING_FLOW(start_slice_id)` - contains all flows which can be reached from 475a given slice via recursively following from flow's outgoing slice to its 476incoming one and from a reached slice to its child. The return table contains 477all entries of [flow table](/docs/analysis/sql-tables.autogen#flow) that are 478present in any chain of kind: `flow[0] -> flow[1] -> ... -> flow[n]`, where 479`flow[i+1].slice_out IN DESCENDANT_SLICE(flow[i].slice_in) OR 480flow[i+1].slice_out = flow[i].slice_in` and `flow[0].slice_out IN 481DESCENDANT_SLICE(start_slice_id) OR flow[0].slice_out = start_slice_id`. 482 483`PRECEDING_FLOW(start_slice_id)` - contains all flows which can be reached from 484a given slice via recursively following from flow's incoming slice to its 485outgoing one and from a reached slice to its parent. The return table contains 486all entries of [flow table](/docs/analysis/sql-tables.autogen#flow) that are 487present in any chain of kind: `flow[n] -> flow[n-1] -> ... -> flow[0]`, where 488`flow[i].slice_in IN ANCESTOR_SLICE(flow[i+1].slice_out) OR flow[i].slice_in = 489flow[i+1].slice_out` and `flow[0].slice_in IN ANCESTOR_SLICE(start_slice_id) OR 490flow[0].slice_in = start_slice_id`. 491 492```sql 493--number of following flows for each slice 494SELECT (SELECT COUNT(*) FROM FOLLOWING_FLOW(slice_id)) as following FROM slice; 495``` 496 497## Metrics 498 499TIP: To see how to add to add a new metric to trace processor, see the checklist 500[here](/docs/contributing/common-tasks.md#new-metric). 501 502The metrics subsystem is a significant part of trace processor and thus is 503documented on its own [page](/docs/analysis/metrics.md). 504 505## Annotations 506 507TIP: To see how to add to add a new annotation to trace processor, see the 508checklist [here](/docs/contributing/common-tasks.md#new-annotation). 509 510Annotations attach a human-readable description to a slice in the trace. This 511can include information like the source of a slice, why a slice is important and 512links to documentation where the viewer can learn more about the slice. 513In essence, descriptions act as if an expert was telling the user what the slice 514means. 515 516For example, consider the `inflate` slice which occurs during view inflation in 517Android. We can add the following description and link: 518 519**Description**: Constructing a View hierarchy from pre-processed XML via 520LayoutInflater#layout. This includes constructing all of the View objects in the 521hierarchy, and applying styled attributes. 522 523## Creating derived events 524 525TIP: To see how to add to add a new annotation to trace processor, see the 526 checklist [here](/docs/contributing/common-tasks.md#new-annotation). 527 528This feature allows creation of new events (slices and counters) from the data 529in the trace. These events can then be displayed in the UI tracks as if they 530were part of the trace itself. 531 532This is useful as often the data in the trace is very low-level. While low 533level information is important for experts to perform deep debugging, often 534users are just looking for a high level overview without needing to consider 535events from multiple locations. 536 537For example, an app startup in Android spans multiple components including 538`ActivityManager`, `system_server`, and the newly created app process derived 539from `zygote`. Most users do not need this level of detail; they are only 540interested in a single slice spanning the entire startup. 541 542Creating derived events is tied very closely to 543[metrics subsystem](/docs/analysis/metrics.md); often SQL-based metrics need to 544create higher-level abstractions from raw events as intermediate artifacts. 545 546From previous example, the 547[startup metric](/src/trace_processor/metrics/sql/android/android_startup.sql) 548creates the exact `launching` slice we want to display in the UI. 549 550The other benefit of aligning the two is that changes in metrics are 551automatically kept in sync with what the user sees in the UI. 552 553## Alerts 554 555Alerts are used to draw the attention of the user to interesting parts of the 556trace; this are usually warnings or errors about anomalies which occurred in the 557trace. 558 559Currently, alerts are not implemented in the trace processor but the API to 560create derived events was designed with them in mind. We plan on adding another 561column `alert_type` (name to be finalized) to the annotations table which can 562have the value `warning`, `error` or `null`. Depending on this value, the 563Perfetto UI will flag these events to the user. 564 565NOTE: we do not plan on supporting case where alerts need to be added to 566 existing events. Instead, new events should be created using annotations 567 and alerts added on these instead; this is because the trace processor 568 storage is monotonic-append-only. 569 570## Python API 571 572The trace processor Python API is built on the existing HTTP interface of `trace processor` 573and is available as part of the standalone build. The API allows you to load in traces and 574query tables and run metrics without requiring the `trace_processor` binary to be 575downloaded or installed. 576 577### Setup 578``` 579pip install perfetto 580``` 581NOTE: The API is only compatible with Python3. 582 583```python 584from perfetto.trace_processor import TraceProcessor 585# Initialise TraceProcessor with a trace file 586tp = TraceProcessor(trace='trace.perfetto-trace') 587``` 588 589NOTE: The TraceProcessor can be initialized in a combination of ways including: 590 <br> - An address at which there exists a running instance of `trace_processor` with a 591 loaded trace (e.g.`TraceProcessor(addr='localhost:9001')`) 592 <br> - An address at which there exists a running instance of `trace_processor` and 593 needs a trace to be loaded in 594 (e.g. `TraceProcessor(trace='trace.perfetto-trace', addr='localhost:9001')`) 595 <br> - A path to a `trace_processor` binary and the trace to be loaded in 596 (e.g. `TraceProcessor(trace='trace.perfetto-trace', config=TraceProcessorConfig(bin_path='./trace_processor'))`) 597 598 599### API 600 601The `trace_processor.api` module contains the `TraceProcessor` class which provides various 602functions that can be called on the loaded trace. For more information on how to use 603these functions, see this [`example`](/python/example.py). 604 605#### Query 606The query() function takes an SQL query as input and returns an iterator through the rows 607of the result. 608 609```python 610from perfetto.trace_processor import TraceProcessor 611tp = TraceProcessor(trace='trace.perfetto-trace') 612 613qr_it = tp.query('SELECT ts, dur, name FROM slice') 614for row in qr_it: 615 print(row.ts, row.dur, row.name) 616``` 617**Output** 618``` 619261187017446933 358594 eglSwapBuffersWithDamageKHR 620261187017518340 357 onMessageReceived 621261187020825163 9948 queueBuffer 622261187021345235 642 bufferLoad 623261187121345235 153 query 624... 625``` 626The QueryResultIterator can also be converted to a Pandas DataFrame, although this 627requires you to have both the `NumPy` and `Pandas` modules installed. 628```python 629from perfetto.trace_processor import TraceProcessor 630tp = TraceProcessor(trace='trace.perfetto-trace') 631 632qr_it = tp.query('SELECT ts, dur, name FROM slice') 633qr_df = qr_it.as_pandas_dataframe() 634print(qr_df.to_string()) 635``` 636**Output** 637``` 638ts dur name 639-------------------- -------------------- --------------------------- 640 261187017446933 358594 eglSwapBuffersWithDamageKHR 641 261187017518340 357 onMessageReceived 642 261187020825163 9948 queueBuffer 643 261187021345235 642 bufferLoad 644 261187121345235 153 query 645 ... 646``` 647Furthermore, you can use the query result in a Pandas DataFrame format to easily 648make visualisations from the trace data. 649```python 650from perfetto.trace_processor import TraceProcessor 651tp = TraceProcessor(trace='trace.perfetto-trace') 652 653qr_it = tp.query('SELECT ts, value FROM counter WHERE track_id=50') 654qr_df = qr_it.as_pandas_dataframe() 655qr_df = qr_df.replace(np.nan,0) 656qr_df = qr_df.set_index('ts')['value'].plot() 657``` 658**Output** 659 660 661 662 663#### Metric 664The metric() function takes in a list of trace metrics and returns the results as a Protobuf. 665 666```python 667from perfetto.trace_processor import TraceProcessor 668tp = TraceProcessor(trace='trace.perfetto-trace') 669 670ad_cpu_metrics = tp.metric(['android_cpu']) 671print(ad_cpu_metrics) 672``` 673**Output** 674``` 675metrics { 676 android_cpu { 677 process_info { 678 name: "/system/bin/init" 679 threads { 680 name: "init" 681 core { 682 id: 1 683 metrics { 684 mcycles: 1 685 runtime_ns: 570365 686 min_freq_khz: 1900800 687 max_freq_khz: 1900800 688 avg_freq_khz: 1902017 689 } 690 } 691 core { 692 id: 3 693 metrics { 694 mcycles: 0 695 runtime_ns: 366406 696 min_freq_khz: 1900800 697 max_freq_khz: 1900800 698 avg_freq_khz: 1902908 699 } 700 } 701 ... 702 } 703 ... 704 } 705 process_info { 706 name: "/system/bin/logd" 707 threads { 708 name: "logd.writer" 709 core { 710 id: 0 711 metrics { 712 mcycles: 8 713 runtime_ns: 33842357 714 min_freq_khz: 595200 715 max_freq_khz: 1900800 716 avg_freq_khz: 1891825 717 } 718 } 719 core { 720 id: 1 721 metrics { 722 mcycles: 9 723 runtime_ns: 36019300 724 min_freq_khz: 1171200 725 max_freq_khz: 1900800 726 avg_freq_khz: 1887969 727 } 728 } 729 ... 730 } 731 ... 732 } 733 ... 734 } 735} 736``` 737 738### HTTP 739The `trace_processor.http` module contains the `TraceProcessorHttp` class which 740provides methods to make HTTP requests to an address at which there already 741exists a running instance of `trace_processor` with a trace loaded in. All 742results are returned in Protobuf format 743(see [`trace_processor_proto`](/protos/perfetto/trace_processor/trace_processor.proto)). 744Some functions include: 745* `execute_query()` - Takes in an SQL query and returns a `QueryResult` Protobuf 746 message 747* `compute_metric()` - Takes in a list of trace metrics and returns a 748 `ComputeMetricResult` Protobuf message 749* `status()` - Returns a `StatusResult` Protobuf message 750 751 752## Testing 753 754Trace processor is mainly tested in two ways: 7551. Unit tests of low-level building blocks 7562. "Diff" tests which parse traces and check the output of queries 757 758### Unit tests 759Unit testing trace processor is the same as in other parts of Perfetto and 760other C++ projects. However, unlike the rest of Perfetto, unit testing is 761relatively light in trace processor. 762 763We have discovered over time that unit tests are generally too brittle 764when dealing with code which parses traces leading to painful, mechanical 765changes being needed when refactorings happen. 766 767Because of this, we choose to focus on diff tests for most areas (e.g. 768parsing events, testing schema of tables, testing metrics etc.) and only 769use unit testing for the low-level building blocks on which the rest of 770trace processor is built. 771 772### Diff tests 773Diff tests are essentially integration tests for trace processor and the 774main way trace processor is tested. 775 776Each diff test takes as input a) a trace file b) a query file *or* a metric 777name. It runs `trace_processor_shell` to parse the trace and then executes 778the query/metric. The result is then compared to a 'golden' file and any 779difference is highlighted. 780 781All diff tests are organized under [test/trace_processor](/test/trace_processor) 782and are run by the script 783[`tools/diff_test_trace_processor.py`](/tools/diff_test_trace_processor.py). 784New tests can be added with the helper script 785[`tools/add_tp_diff_test.py`](/tools/add_tp_diff_test.py). 786 787NOTE: `trace_processor_shell` and associated proto descriptors needs to be 788built before running `tools/diff_test_trace_processor.py`. The easiest way 789to do this is to run `tools/ninja -C <out directory>` both initially and on 790every change to trace processor code or builtin metrics. 791 792#### Choosing where to add diff tests 793When adding a new test with `tools/add_tp_diff_test.py`, the user is 794prompted for a folder to add the new test to. Often this can be confusing 795as a test can fall into more than one category. This section is a guide 796to decide which folder to choose. 797 798Broadly, there are two categories which all folders fall into: 7991. __"Area" folders__ which encompass a "vertical" area of interest 800 e.g. startup/ contains Android app startup related tests or chrome/ 801 contains all Chrome related tests. 8022. __"Feature" folders__ which encompass a particular feature of 803 trace processor e.g. process_tracking/ tests the lifetime tracking of 804 processes, span_join/ tests the span join operator. 805 806"Area" folders should be preferred for adding tests unless the test is 807applicable to more than one "area"; in this case, one of "feature" folders 808can be used instead. 809 810Here are some common scenarios in which new tests may be added and 811answers on where to add the test: 812 813__Scenario__: A new event is being parsed, the focus of the test is to ensure 814the event is being parsed correctly and the event is focused on a single 815vertical "Area". 816 817_Answer_: Add the test in one of the "Area" folders. 818 819__Scenario__: A new event is being parsed and the focus of the test is to ensure 820the event is being parsed correctly and the event is applicable to more than one 821vertical "Area". 822 823_Answer_: Add the test to the parsing/ folder. 824 825__Scenario__: A new metric is being added and the focus of the test is to 826ensure the metric is being correctly computed. 827 828_Answer_: Add the test in one of the "Area" folders. 829 830__Scenario__: A new dynamic table is being added and the focus of the test is to 831ensure the dynamic table is being correctly computed... 832 833_Answer_: Add the test to the dynamic/ folder 834 835__Scenario__: The interals of trace processor are being modified and the test 836is to ensure the trace processor is correctly filtering/sorting important 837built-in tables. 838 839_Answer_: Add the test to the tables/ folder. 840 841 842## Appendix: table inheritance 843 844Concretely, the rules for inheritance between tables works are as follows: 845 846* Every row in a table has an `id` which is unique for a hierarchy of tables. 847 * For example, every `track` will have an `id` which is unique among all 848 tracks (regardless of the type of track) 849* If a table C inherits from P, each row in C will also be in P _with the same 850 id_ 851 * This allows for ids to act as "pointers" to rows; lookups by id can be 852 performed on any table which has that row 853 * For example, every `process_counter_track` row will have a matching row in 854 `counter_track` which will itself have matching rows in `track` 855* If a table C with columns `A` and `B` inherits from P with column `A`, `A` 856 will have the same data in both C and P 857 * For example, suppose 858 * `process_counter_track` has columns `name`, `unit` and `upid` 859 * `counter_track` has `name` and `unit` 860 * `track` has `name` 861 * Every row in `process_counter_track` will have the same `name` for the row 862 with the same id in `track` and `counter_track` 863 * Similarly, every row in `process_counter_track` will have both the same 864 `name ` and `unit` for the row with the same id in `counter_track` 865* Every row in a table has a `type` column. This specifies the _most specific_ 866 table this row belongs to. 867 * This allows _dynamic casting_ of a row to its most specific type 868 * For example, for if a row in the `track` is actually a 869 `process_counter_track`, it's type column will be `process_counter_track`. 870