Lines Matching defs:this
2 // Use of this source code is governed by a BSD-style license that can be
221 this.tree = createEmptyNode("root");
222 this.tree.delayedExpansion = { frameList : [], ascending : false };
226 this.tree.ticks++;
240 addOrUpdateChildNode(this.tree, file, tickIndex, i, false);
246 this.filter = filter;
247 this.tree = createEmptyNode("root");
248 this.tree.delayedExpansion = { frameList : [], ascending : isBottomUp };
249 this.isBottomUp = isBottomUp;
254 let step = this.isBottomUp ? 2 : -2;
255 let start = this.isBottomUp ? 0 : stack.length - 2;
257 let stackPos = findNextFrame(file, stack, start, step, this.filter);
258 addOrUpdateChildNode(this.tree, file, tickIndex, stackPos, this.isBottomUp);
260 this.tree.ticks++;
295 this.filter = filter;
298 this.tree = root;
299 this.categories = categories;
300 this.isBottomUp = isBottomUp;
310 let node = this.categories[kind];
312 this.tree.ticks++;
315 let step = this.isBottomUp ? 2 : -2;
316 let start = this.isBottomUp ? 0 : stack.length - 2;
318 let stackPos = findNextFrame(file, stack, start, step, this.filter);
319 addOrUpdateChildNode(node, file, tickIndex, stackPos, this.isBottomUp);
327 this.tree = root;
328 this.categories = categories;
330 this.tree = createEmptyNode("root");
331 this.categories = null;
334 this.codeVisited = [];
335 this.filter = filter;
342 this.tree.ticks++;
347 if (codeId < 0 || this.codeVisited[codeId]) continue;
350 if (this.filter) {
353 if (!this.filter(type, kind)) continue;
356 if (this.categories) {
358 tree = this.categories[kind];
360 tree = this.tree;
380 this.codeVisited[codeId] = true;
391 if (codeId >= 0) this.codeVisited[codeId] = false;
399 this.bucketCount = bucketCount;
401 this.firstTime = file.ticks[0].tm;
403 this.step = (lastTime - this.firstTime) / bucketCount;
405 this.buckets = [];
411 this.buckets.push(Object.assign({ total : 0 }, bucket));
418 let i = Math.floor((timestamp - this.firstTime) / this.step);
419 if (i === this.buckets.length) i--;
420 console.assert(i >= 0 && i < this.buckets.length);
422 let bucket = this.buckets[i];
434 this.functionCodeId = functionCodeId;
435 this.filter = filter;
436 this.blocks = [];
437 this.currentBlock = null;
441 if (!this.functionCodeId) return;
444 let functionCode = file.code[this.functionCodeId];
456 if (!this.filter(type, kind)) continue;
473 if (this.currentBlock !== null) {
474 this.currentBlock.end = timestamp;
476 if (codeIsTopOfStack === this.currentBlock.topOfStack
477 && stackKind === this.currentBlock.kind) {
486 this.currentBlock = {
493 this.blocks.push(this.currentBlock);
495 this.currentBlock = null;