Lines Matching refs:stack
124 // We store list of ticks and positions within the ticks stack by
142 function findNextFrame(file, stack, stackPos, step, filter) {
145 while (stackPos >= 0 && stackPos < stack.length) {
146 codeId = stack[stackPos];
169 let stack = file.ticks[stackIndex].s;
170 console.assert(stackPos >= 0 && stackPos < stack.length);
171 let codeId = stack[stackPos];
198 let stack = file.ticks[stackIndex].s;
201 let stackPos = findNextFrame(file, stack, depth + step, step, filter);
228 let stack = file.ticks[tickIndex].s;
230 for (i = 0; i < stack.length; i += 2) {
231 let codeId = stack[i];
239 if (i < 0 || i >= stack.length) return;
253 let stack = file.ticks[tickIndex].s;
255 let start = this.isBottomUp ? 0 : stack.length - 2;
257 let stackPos = findNextFrame(file, stack, start, step, this.filter);
304 let stack = file.ticks[tickIndex].s;
306 if (stack.length === 0) return;
307 let codeId = stack[0];
316 let start = this.isBottomUp ? 0 : stack.length - 2;
318 let stackPos = findNextFrame(file, stack, start, step, this.filter);
339 let stack = file.ticks[tickIndex].s;
345 for (let i = stack.length - 2; i >= 0; i -= 2) {
346 let codeId = stack[i];
389 for (let i = 0; i < stack.length; i += 2) {
390 let codeId = stack[i];
416 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
425 let codeId = (stack.length > 0) ? stack[0] : -1;
443 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
446 // Find if the function is on the stack, and its position on the stack,
451 for (let i = 0; i < stack.length - 1; i += 2) {
452 let codeId = stack[i];
478 // If we haven't changed the stack top or the function kind, then