Lines Matching refs:ticks
124 // We store list of ticks and positions within the ticks stack by
126 // Triplet { 123, 2, 3 } encodes positions in ticks 123, 124, 125,
162 // If we are doing top-down call tree, update own ticks.
169 let stack = file.ticks[stackIndex].s;
177 let vmState = file.ticks[stackIndex].vm;
182 child.ticks++;
198 let stack = file.ticks[stackIndex].s;
215 ticks : 0
226 this.tree.ticks++;
228 let stack = file.ticks[tickIndex].s;
253 let stack = file.ticks[tickIndex].s;
260 this.tree.ticks++;
304 let stack = file.ticks[tickIndex].s;
305 let vmState = file.ticks[tickIndex].vm;
312 this.tree.ticks++;
313 node.ticks++;
339 let stack = file.ticks[tickIndex].s;
340 let vmState = file.ticks[tickIndex].vm;
342 this.tree.ticks++;
373 child.ticks++;
374 child.children[0].ticks++;
377 child.children[1].ticks++;
385 tree.ticks++;
401 this.firstTime = file.ticks[0].tm;
402 let lastTime = file.ticks[file.ticks.length - 1].tm;
416 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
443 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
500 // Generates a tree out of a ticks sequence.
501 // {file} is the JSON files with the ticks and code objects.
506 let ticks = file.ticks;
508 while (i < ticks.length && ticks[i].tm < startTime) {
513 while (i < ticks.length && ticks[i].tm < endTime) {