1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
use std::collections::HashMap;
use std::io;
use std::iter;
use log::warn;
#[derive(Debug, PartialEq, Eq, Hash)]
pub(super) struct Frame<'a> {
pub(super) function: &'a str,
pub(super) depth: usize,
}
#[derive(Debug, PartialEq)]
pub(super) struct TimedFrame<'a> {
pub(super) location: Frame<'a>,
pub(super) start_time: usize,
pub(super) end_time: usize,
pub(super) delta: Option<isize>,
}
#[derive(Copy, Clone, Debug, PartialEq)]
pub(super) struct FrameTime {
pub(super) start_time: usize,
pub(super) delta: Option<isize>,
}
fn flow<'a, LI, TI>(
tmp: &mut HashMap<Frame<'a>, FrameTime>,
frames: &mut Vec<TimedFrame<'a>>,
last: LI,
this: TI,
time: usize,
delta: Option<isize>,
) where
LI: IntoIterator<Item = &'a str>,
TI: IntoIterator<Item = &'a str>,
{
let mut this = this.into_iter().peekable();
let mut last = last.into_iter().peekable();
let mut shared_depth = 0;
while last.peek() == this.peek() {
if last.peek().is_none() {
break;
}
last.next();
this.next();
shared_depth += 1;
}
for (i, func) in last.enumerate() {
let key = Frame {
function: func,
depth: shared_depth + i,
};
let frame_time = tmp.remove(&key).unwrap_or_else(|| {
unreachable!("did not have start time for {:?}", key);
});
let frame = TimedFrame {
location: key,
start_time: frame_time.start_time,
end_time: time,
delta: frame_time.delta,
};
frames.push(frame);
}
let mut i = 0;
while this.peek().is_some() {
let func = this.next().unwrap();
let key = Frame {
function: func,
depth: shared_depth + i,
};
let is_last = this.peek().is_none();
let delta = match delta {
Some(_) if !is_last => Some(0),
d => d,
};
let frame_time = FrameTime {
start_time: time,
delta,
};
if let Some(frame_time) = tmp.insert(key, frame_time) {
unreachable!(
"start time {} already registered for frame",
frame_time.start_time
);
}
i += 1;
}
}
pub(super) fn frames<'a, I>(
lines: I,
suppress_sort_check: bool,
) -> quick_xml::Result<(Vec<TimedFrame<'a>>, usize, usize, usize)>
where
I: IntoIterator<Item = &'a str>,
{
let mut time = 0;
let mut ignored = 0;
let mut last = "";
let mut tmp = Default::default();
let mut frames = Default::default();
let mut delta = None;
let mut delta_max = 1;
let mut stripped_fractional_samples = false;
let mut prev_line = None;
for line in lines {
let mut line = line.trim();
if line.is_empty() {
continue;
}
if !suppress_sort_check {
if let Some(prev_line) = prev_line {
if prev_line > line {
return Err(quick_xml::Error::Io(io::Error::new(
io::ErrorKind::InvalidData,
"unsorted input lines detected",
)));
}
}
}
let nsamples =
if let Some(samples) = parse_nsamples(&mut line, &mut stripped_fractional_samples) {
if let Some(original_samples) =
parse_nsamples(&mut line, &mut stripped_fractional_samples)
{
delta = Some(samples as isize - original_samples as isize);
delta_max = std::cmp::max(delta.unwrap().abs() as usize, delta_max);
}
samples
} else {
ignored += 1;
continue;
};
if line.is_empty() {
ignored += 1;
continue;
}
let stack = line;
let this = iter::once("").chain(stack.split(';'));
if last.is_empty() {
flow(&mut tmp, &mut frames, None, this, time, delta);
} else {
flow(
&mut tmp,
&mut frames,
iter::once("").chain(last.split(';')),
this,
time,
delta,
);
}
last = stack;
time += nsamples;
prev_line = Some(line);
}
if !last.is_empty() {
flow(
&mut tmp,
&mut frames,
iter::once("").chain(last.split(';')),
None,
time,
delta,
);
}
Ok((frames, time, ignored, delta_max))
}
fn parse_nsamples(line: &mut &str, stripped_fractional_samples: &mut bool) -> Option<usize> {
if let Some((samplesi, doti)) = rfind_samples(line) {
let mut samples = &line[samplesi..];
if !*stripped_fractional_samples
&& doti < samples.len() - 1
&& !samples[doti + 1..].chars().all(|c| c == '0')
{
*stripped_fractional_samples = true;
warn!(
"The input data has fractional sample counts that will be truncated to integers. \
If you need to retain the extra precision you can scale up the sample data and \
use the --factor option to scale it back down."
);
}
samples = &samples[..doti];
let nsamples = samples.parse::<usize>().ok()?;
*line = line[..samplesi].trim_end();
Some(nsamples)
} else {
None
}
}
pub(super) fn rfind_samples(line: &str) -> Option<(usize, usize)> {
let samplesi = line.rfind(' ')? + 1;
let samples = &line[samplesi..];
if let Some(doti) = samples.find('.') {
if samples[..doti]
.chars()
.chain(samples[doti + 1..].chars())
.all(|c| c.is_digit(10))
{
Some((samplesi, doti))
} else {
None
}
} else if !samples.chars().all(|c| c.is_digit(10)) {
None
} else {
Some((samplesi, line.len() - samplesi))
}
}