• Home
  • Raw
  • Download

Lines Matching refs:nodeCount

42   private nodeCount: number;  property in HeapLoader
57 this.nodeCount = fileStruct.snapshotStruct.nodeCount;
62 this.nodes = new Array<HeapNode>(this.nodeCount);
70 this.firstRetainerIndex = new Uint32Array(this.nodeCount + 1);
71 this.dominatorTree = new Uint32Array(this.nodeCount);
72 this.firstDominatedNodesIdx = new Uint32Array(this.nodeCount + 1);
73 this.dominatedNodes = new Uint32Array(this.nodeCount - 1);
158 this.firstRetainerIndex[this.nodeCount] = this.retainingNodes.length;
184 let domState = new DOMState(this.nodeCount);
222 if (postOrderIdx !== this.nodeCount) {
226 for (let i = 0; i < this.nodeCount; i++) {
262 stackNodes: new Uint32Array(this.nodeCount),
263 stackCurrentEdge: new Uint32Array(this.nodeCount),
264 orderIdx2NodeIdx: new Uint32Array(this.nodeCount),
265 nodeIdx2OrderIdx: new Uint32Array(this.nodeCount),
266 visited: new Uint8Array(this.nodeCount),
279 while (stack >= 0 && stack < this.nodeCount) {
312 if (postOrderIdx === this.nodeCount || iteration > 1) {
348 let newDominatorIdx = this.nodeCount;
366 if (dominators[retainerOrderIdx] !== this.nodeCount) {
367 if (newDominatorIdx === this.nodeCount) {
396 let rootOrderedIdx = this.nodeCount - 1;
397 let dominators = new Uint32Array(this.nodeCount).fill(this.nodeCount);
402 let affected = new Uint8Array(this.nodeCount);
424 if (newDominatorIdx !== this.nodeCount && dominators[orderIdx] !== newDominatorIdx) {
449 let nodesToVisit = new Uint32Array(this.nodeCount);
475 for (let idx = 0; idx < this.nodeCount - 1; idx++) {
487 let toNodeIdx = this.nodeCount;
502 for (let idx = 0; idx < this.nodeCount; idx++) {
507 this.firstDominatedNodesIdx[this.nodeCount] = this.dominatedNodes.length;
538 maxNodeId: this.nodes[this.nodeCount - 1].id,
602 if (nodesToVisitLen > this.nodeCount) {
603 … Error(`BFS failed. Nodes to visit ${nodesToVisitLen} is more than nodes count ${this.nodeCount}`);
680 let nodesToVisit = new Array<HeapNode>(this.nodeCount);