Lines Matching refs:file
3 // found in the LICENSE file.
142 function findNextFrame(file, stack, stackPos, step, filter) {
147 code = codeId >= 0 ? file.code[codeId] : undefined;
159 function addOrUpdateChildNode(parent, file, stackIndex, stackPos, ascending) {
169 let stack = file.ticks[stackIndex].s;
172 let code = codeId >= 0 ? file.code[codeId] : undefined;
177 let vmState = file.ticks[stackIndex].vm;
187 function expandTreeNode(file, node, filter) {
198 let stack = file.ticks[stackIndex].s;
201 let stackPos = findNextFrame(file, stack, depth + step, step, filter);
202 addOrUpdateChildNode(node, file, stackIndex, stackPos, ascending);
225 addStack(file, tickIndex) {
228 let stack = file.ticks[tickIndex].s;
233 let code = file.code[codeId];
240 addOrUpdateChildNode(this.tree, file, tickIndex, i, false);
252 addStack(file, tickIndex) {
253 let stack = file.ticks[tickIndex].s;
257 let stackPos = findNextFrame(file, stack, start, step, this.filter);
258 addOrUpdateChildNode(this.tree, file, tickIndex, stackPos, this.isBottomUp);
303 addStack(file, tickIndex) {
304 let stack = file.ticks[tickIndex].s;
305 let vmState = file.ticks[tickIndex].vm;
308 let code = codeId >= 0 ? file.code[codeId] : undefined;
318 let stackPos = findNextFrame(file, stack, start, step, this.filter);
319 addOrUpdateChildNode(node, file, tickIndex, stackPos, this.isBottomUp);
338 addStack(file, tickIndex) {
339 let stack = file.ticks[tickIndex].s;
340 let vmState = file.ticks[tickIndex].vm;
349 let code = file.code[codeId];
398 constructor(file, bucketCount) {
401 this.firstTime = file.ticks[0].tm;
402 let lastTime = file.ticks[file.ticks.length - 1].tm;
415 addStack(file, tickIndex) {
416 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
426 let code = codeId >= 0 ? file.code[codeId] : undefined;
440 addStack(file, tickIndex) {
443 let { tm : timestamp, vm : vmState, s : stack } = file.ticks[tickIndex];
444 let functionCode = file.code[this.functionCodeId];
453 let code = codeId >= 0 ? file.code[codeId] : undefined;
501 // {file} is the JSON files with the ticks and code objects.
505 file, startTime, endTime, tree) {
506 let ticks = file.ticks;
514 tree.addStack(file, i);
522 function computeOptimizationStats(file,
531 funcData = { f : file.functions[code.func], instances : [] };
550 for (let i = 0; i < file.functions.length; i++) {
551 let f = file.functions[i];
555 if (file.code[f.codes[0]].type !== "JS") continue;
563 let code = file.code[f.codes[j]];