You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
47 lines
2.2 KiB
47 lines
2.2 KiB
4 months ago
|
# RUN: llvm-xray account -d %s -o - -m %S/Inputs/simple-instrmap.yaml | FileCheck --check-prefixes=ALL %s
|
||
|
# RUN: llvm-xray account -d -recursive-calls-only %s -o - -m %S/Inputs/simple-instrmap.yaml | FileCheck --check-prefixes=RECURSIVE %s
|
||
|
|
||
|
---
|
||
|
header:
|
||
|
version: 1
|
||
|
type: 0
|
||
|
constant-tsc: true
|
||
|
nonstop-tsc: true
|
||
|
cycle-frequency: 0
|
||
|
records:
|
||
|
# Here we reconstruct the following call trace:
|
||
|
#
|
||
|
# f1()
|
||
|
# f2()
|
||
|
# f3()
|
||
|
# f2()
|
||
|
#
|
||
|
# But we find that we're missing an exit record for f2() because it's
|
||
|
# tail-called f3(). We make sure that if we see a trace like this that we can
|
||
|
# deduce tail calls, and account the time (potentially wrongly) to f2() when
|
||
|
# f1() exits. That is because we don't go back to f3()'s entry record to
|
||
|
# properly do the math on the timing of f2().
|
||
|
#
|
||
|
# As a result, we can deduce that f2() is not recursive here.
|
||
|
#
|
||
|
# Note that by default, tail/sibling call deduction is disabled, and is enabled
|
||
|
# with a flag "-d" or "-deduce-sibling-calls".
|
||
|
#
|
||
|
- { type: 0, func-id: 1, cpu: 1, thread: 111, kind: function-enter, tsc: 10000 }
|
||
|
- { type: 0, func-id: 2, cpu: 1, thread: 111, kind: function-enter, tsc: 10001 }
|
||
|
- { type: 0, func-id: 3, cpu: 1, thread: 111, kind: function-enter, tsc: 10002 }
|
||
|
- { type: 0, func-id: 3, cpu: 1, thread: 111, kind: function-exit, tsc: 10003 }
|
||
|
- { type: 0, func-id: 1, cpu: 1, thread: 111, kind: function-exit, tsc: 10004 }
|
||
|
- { type: 0, func-id: 2, cpu: 1, thread: 111, kind: function-enter, tsc: 10005 }
|
||
|
- { type: 0, func-id: 2, cpu: 1, thread: 111, kind: function-exit, tsc: 10006 }
|
||
|
...
|
||
|
|
||
|
# ALL: Functions with latencies: 3
|
||
|
# ALL-NEXT: funcid count [ min, med, 90p, 99p, max] sum function
|
||
|
# ALL-NEXT: 1 1 [ 4.000000, 4.000000, 4.000000, 4.000000, 4.000000] 4.000000 <invalid>:0:0: @(1)
|
||
|
# ALL-NEXT: 2 2 [ 1.000000, 3.000000, 3.000000, 3.000000, 3.000000] 4.000000 <invalid>:0:0: @(2)
|
||
|
# ALL-NEXT: 3 1 [ 1.000000, 1.000000, 1.000000, 1.000000, 1.000000] 1.000000 <invalid>:0:0: @(3)
|
||
|
|
||
|
# RECURSIVE: Functions with latencies: 0
|
||
|
# RECURSIVE-NEXT: funcid count [ min, med, 90p, 99p, max] sum function
|