Lines Matching refs:nodeIndex
91 return this._snapshot.createNode(this.nodeIndex());
97 nodeIndex: function()
193 this._node.nodeIndex = index;
327 nodeIndex: function()
452 * @param {number=} nodeIndex
454 WebInspector.HeapSnapshotNode = function(snapshot, nodeIndex)
457 this.nodeIndex = nodeIndex || 0;
466 return this._snapshot._nodeDistances[this.nodeIndex / this._snapshot._nodeFieldCount];
491 return this._snapshot._dominatorsTree[this.nodeIndex / this._snapshot._nodeFieldCount] * nodeFieldCount;
523 return this.nodeIndex === this._snapshot._rootNodeIndex;
566 return snapshot.nodes[this.nodeIndex + snapshot._nodeSelfSizeOffset];
583 return snapshot.nodes[this.nodeIndex + snapshot._nodeTraceNodeIdOffset];
592 return this.nodeIndex;
601 return new WebInspector.HeapSnapshotCommon.Node(this.id(), this.name(), this.distance(), this.nodeIndex, this.retainedSize(), this.selfSize(), this.type());
610 return snapshot.nodes[this.nodeIndex + snapshot._nodeNameOffset];
634 return this.nodeIndex / this._snapshot._nodeFieldCount;
642 return this.nodeIndex + this._snapshot._nodeFieldCount;
651 return snapshot.nodes[this.nodeIndex + snapshot._nodeTypeOffset];
672 return this.node.nodeIndex < this._nodesLength;
685 this.node.nodeIndex = this.node._nextNodeIndex();
850 for (var nodeIndex = 0; nodeIndex < nodesLength; nodeIndex += nodeFieldCount) {
851 node.nodeIndex = nodeIndex;
1025 * @param {number=} nodeIndex
1027 createNode: function(nodeIndex)
1073 _getDominatedIndex: function(nodeIndex)
1075 if (nodeIndex % this._nodeFieldCount)
1076 throw new Error("Invalid nodeIndex: " + nodeIndex);
1077 return this._firstDominatedNodeIndex[nodeIndex / this._nodeFieldCount];
1187 * @param {number} nodeIndex
1190 allocationStack: function(nodeIndex)
1192 var node = this.createNode(nodeIndex);
1217 node.nodeIndex = indexes[i];
1278 nodesToVisit[nodesToVisitLength++] = node.nodeIndex;
1314 var nodeIndex = nodesToVisit[index++]; // shift generates too much garbage.
1315 var nodeOrdinal = nodeIndex / nodeFieldCount;
1319 node.nodeIndex = nodeIndex;
1356 for (var nodeIndex = 0; nodeIndex < nodesLength; nodeIndex += nodeFieldCount) {
1357 var nodeOrdinal = nodeIndex / nodeFieldCount;
1360 node.nodeIndex = nodeIndex;
1363 var selfSize = nodes[nodeIndex + selfSizeOffset];
1364 if (!selfSize && nodes[nodeIndex + nodeTypeOffset] !== nodeNativeType)
1377 idxs: [nodeIndex]
1387 clss.idxs.push(nodeIndex);
1418 var nodeIndex = list.pop();
1419 node.nodeIndex = nodeIndex;
1422 var nodeOrdinal = nodeIndex / nodeFieldCount;
1429 (node.selfSize() || nodes[nodeIndex + nodeTypeOffset] === nodeNativeType)
1457 nodeA.nodeIndex = idxA;
1458 nodeB.nodeIndex = idxB;
1532 dumpNode.nodeIndex = i * nodeFieldCount;
1805 nodeB.nodeIndex = indexes[++j];
1808 nodeB.nodeIndex = indexes[++j];
1821 nodeB.nodeIndex = indexes[++j];
1866 * @param {number} nodeIndex
1869 createEdgesProvider: function(nodeIndex)
1871 var node = this.createNode(nodeIndex);
1878 * @param {number} nodeIndex
1882 createEdgesProviderForTest: function(nodeIndex, filter)
1884 var node = this.createNode(nodeIndex);
1906 * @param {number} nodeIndex
1909 createRetainingEdgesProvider: function(nodeIndex)
1911 var node = this.createNode(nodeIndex);
1965 for (var nodeIndex = this._nodeIdOffset; nodeIndex < nodesLength; nodeIndex += nodeFieldCount) {
1966 var nextId = nodes[nodeIndex];
2110 nodeA.nodeIndex = edgeA.nodeIndex();
2114 nodeB.nodeIndex = edgeB.nodeIndex();
2188 node.nodeIndex = this._iterationOrder[i];
2235 nodeA.nodeIndex = indexA;
2236 nodeB.nodeIndex = indexB;
