Denis Bakhvalov

Intel Processor Trace Part4. Better profiling experience.

Categories: tools

13 Sep 2019


Subscribe to my newsletter, support me on Patreon or by PayPal donation.

This is the 4th part of my series about Intel Processor Traces (PT). If you are reading this article and you are not familiar with what Intel PT is, I encourage you to take a few minutes and quickly grasp through the part1 of this series.

Here is the list of all parts in the series of posts about Intel PT:

  1. Part1: Introduction to Intel Processor Trace.
  2. Part2: Better debugging experience with Intel PT.
  3. Part3: Analyzing performance glitches with Intel PT.
  4. Part4: Better profiling experience with Intel PT (this article).

Traditionally performance analysis is done through profiling which is the process of collecting statistics about the execution of an application. This process is implemented by periodically stopping the application and recording where we are in the program right now. Going one level below, each stop is made by triggering an interrupt (PMI - Performance Monitoring Interrupt). And if we collect enough samples, we can get a nice distribution of the time spent in different part of the program. This is how we can identify the hotspots in our program.

However, taking an interrupt itself comes with a cost. Imagine bursty application which sleeps almost most of the time. Profiling such an application might not show anything interesting at all. Since it can happen that all our interrupts occur during the time when the app was sleeping. This is the case when we would want to increase the frequency of our interrupts. The more interrupts, the more runtime overhead. In this article I will show how Intel PT can give you better profiling accuracy with less runtime overhead.

If you’ve read part3 of this series, you would know how to collect the traces. If not, here is the command:

$ perf record -e intel_pt//u ./a.out

This command essentially dumps the processor traces into a file on a disk. Those traces contain encoded history for the entire runtime. What’s interesting, is that you can view it as a collection of samples. And it is the exact collection, in a sense that we didn’t missed a sample. And now we can use those traces to do the same analysis we can do with interrupts, but much more precise.

To demonstrate that I will use example from part3. Suppose we have an application a.out that runs for 1.78s:

$ time -p ./a.out
real 1.78
user 1.78
sys 0.00

Collecting Processor Traces in our case involves ~11% runtime overhead:

$ time -p perf record -e intel_pt/cyc=1/u ./a.out
[ perf record: Woken up 199 times to write data ]
[ perf record: Captured and wrote 397.617 MB ]
real 1.98
user 1.90
sys 0.26

Now let’s do the same with traditional sampling at the highest possible accuracy:

$ echo 999999999 | sudo tee /proc/sys/kernel/perf_event_max_sample_rate
$ time -p perf record -F 999999999 -e cycles:u -o ./a.out
[ perf record: Woken up 39 times to write data ]
[ perf record: Captured and wrote 9.712 MB (253272 samples) ]
real 2.22
user 2.11
sys 0.05
$ perf report -i -n --stdio --no-call-graph --itrace=i100ns
# Samples: 434K of event 'cycles:u'
# Overhead       Samples  Command  Shared Object  Symbol                                                                                                                         
# ........  ............  .......  .............  ..................................................
    88.53%        384801  a.out    a.out          [.] std::uniform_int_distribution<int>::operator()
     5.76%         25044  a.out    a.out          [.] goFastPath
     3.64%         15807  a.out    a.out          [.] main
     1.82%          7923  a.out    a.out          [.] goSlowPath
     0.25%          1067  a.out     [.] _start

The maximum sample rate I was able to collect with interrupt-based sampling on my machine is around 100Khz (100K samples/second). I.e. we have roughly 1 sample each 10 microseconds. Don’t get me wrong, it’s still pretty high precision and is suitable for most of the cases. However, the overhead goes from 1.87s1 to 2.22s and now it is ~28%, which is much more than with Intel PT.

With Intel PT, easily we get 100x more samples:

$ perf record -e intel_pt/cyc=1/u -o ./a.out
$ perf report -i -n --stdio --no-call-graph --itrace=i100ns
# Samples: 32M of event 'instructions:u'
# Overhead       Samples  Command  Shared Object        Symbol                                                                                                                         
# ........  ............  .......  ...................  ..................................................
    76.10%      25030327  a.out    a.out                [.] std::uniform_int_distribution<int>::operator()
    10.57%       3523065  a.out    a.out                [.] main
     8.48%       2811222  a.out    a.out                [.] goFastPath
     4.82%        677681  a.out    a.out                [.] goSlowPath

Let me first explain the mechanics of what we just did. After executing perf record we have the traces in After that we asked perf to build report by synthesizing one instruction sample per 100ns (--itrace=i100ns). So, the process basically is very much the same as we do with interrupts: skip 100ns of traces2, see where we are in the program, skip 100ns of traces more and record the instruction again, and so on. After that we can identify the hotspots by looking at the samples distribution.

I’m not 100% sure why there is such a big difference between reports based on interrupts and PT. I tend to think this is the skid effect, which might make significant impact on small applications like ours. You can read more about the skid here and here.3

In general Intel PT allows you to get the precision you want. Just set perf report --itrace=i1t for the most accurate sample rate one would ever need. Or set perf report --itrace=i100ms for as low as 10 samples per second. What I like about this is that it essentially moves the overhead from the runtime into the analysis time. You just collect PT traces once and then can do all sort of complicated analysis you may need. With interrupt-based sampling you need to rerun the collection every time you need to modify the parameters.

There is one interesting limitation to profiling with PT. With interrupt-based profiling you can sample on different events, say cache misses. With PT it’s only possible to synthesize instruction samples since information about cache misses is not encoded in the traces.

A nice bonus for profiling with PT is that we have call stacks for free4:

$ perf report -i -n --stdio --no-children -G
# Samples: 31K of event 'instructions:u'
# Overhead       Samples  Command  Shared Object  Symbol                                                                                                                         
# ........  ............  .......  .............  ..................................................
    75.16%         24045  a.out    a.out          [.] std::uniform_int_distribution<int>::operator()

    12.50%          4000  a.out    a.out          [.] main

    10.12%          3191  a.out    a.out          [.] goFastPath

     2.20%           695  a.out    a.out          [.] goSlowPath

As I’ve shown, Intel PT can provide great level of details. There are many strategies how to drive your analysis using PT. For initial analysis one can start with profiling based on traditional sampling and then collect the traces for particular region of code or time period. This allows you to “zoom in” at particular execution timeframe.

For example, to limit collecting traces for only goSlowPath function you can use:

$ perf record -e intel_pt//u --filter 'filter goSlowPath @ a.out' ./a.out
$ perf script ...

To analyze traces only during particular time frame you can use:

$ perf record -e intel_pt//u ./a.out
$ perf script --ns --itrace=i1t -F +srcline,+srccode --time 253.555413140,253.555413520 > time_range.dump

See more examples of using PT with Linux perf in the part3 of this series and in the cheat sheet for Intel Processor Trace.

  1. This is the timing for default 1000Hz sample rate (perf record -F 1000). 

  2. See part3 for better understanding of how decoded PT traces look like. 

  3. In the end, I tend to trust PT based report more, but even it is not 100% precise, since it doesn’t analyze all instructions and simply takes one instruction per specified time period. However, the most accurate distribution might be achieved with perf report --itrace=i1t, since it should treat every instruction in the trace as individual sample. 

  4. LBR mechanism (perf record --call-graph lbr) also allows capturing call stacks with each sample. However, they are only few (usually 2-3) functions deep and incur additional overhead. 

comments powered by Disqus

Subscribe to get more updates from me:

If you like this blog, support me on Patreon or by PayPal donation.

All content on Easyperf blog is licensed under a Creative Commons Attribution 4.0 International License