Searched refs:nodeIndex (Results 1 - 25 of 34) sorted by relevance

12

/macosx-10.9.5/WebCore-7537.78.1/dom/
H A DNodeWithIndex.h49 m_index = m_node->nodeIndex();
52 ASSERT(m_index == static_cast<int>(m_node->nodeIndex()));
H A DRange.cpp389 int nodeIndex = refNode->nodeIndex(); local
398 if (comparePoint(parentNode, nodeIndex, ec) < 0) { // starts before
399 if (comparePoint(parentNode, nodeIndex + 1, ec) > 0) // ends after the range
403 if (comparePoint(parentNode, nodeIndex + 1, ec) > 0) // ends after the range
594 int nodeIndex = refNode->nodeIndex(); local
603 if (comparePoint(parentNode, nodeIndex, ec) < 0 && // starts before start
604 comparePoint(parentNode, nodeIndex + 1, ec) < 0) { // ends before start
606 } else if (comparePoint(parentNode, nodeIndex, e
[all...]
H A DRangeBoundaryPoint.h89 m_offsetInContainer = m_childBeforeBoundary->nodeIndex() + 1;
H A DPosition.h97 // will return img->parentNode() and img->nodeIndex() from these functions.
255 return Position(Position::findParent(node), node->nodeIndex(), Position::PositionIsOffsetInAnchor);
261 return Position(Position::findParent(node), node->nodeIndex() + 1, Position::PositionIsOffsetInAnchor);
H A DPosition.cpp207 return m_anchorNode->nodeIndex();
209 return m_anchorNode->nodeIndex() + 1;
340 return createLegacyEditingPosition(parent, n->nodeIndex());
372 return createLegacyEditingPosition(parent, n->nodeIndex() + 1);
648 // return lastVisible on the next iteration, but we terminate early to avoid doing a nodeIndex() call.
762 // positions will be [boundary->parentNode(), originalBlock->nodeIndex() + 1].
H A DNode.h408 unsigned nodeIndex() const;
/macosx-10.9.5/WebCore-7537.78.1/inspector/front-end/
H A DHeapSnapshot.js84 return this._snapshot.createNode(this.nodeIndex());
87 nodeIndex: function() method in class:WebInspector.HeapSnapshotEdge
113 nodeIndex: this.nodeIndex(),
201 nodeIndex: function() method in class:WebInspector.HeapSnapshotRetainerEdge
255 nodeIndex: this.nodeIndex(),
309 * @param {number=} nodeIndex
311 WebInspector.HeapSnapshotNode = function(snapshot, nodeIndex)
314 this._firstNodeIndex = nodeIndex;
[all...]
H A DNativeHeapSnapshot.js44 createNode: function(nodeIndex)
46 return new WebInspector.NativeHeapSnapshotNode(this, nodeIndex);
98 node.nodeIndex = classData.idxs[i];
113 * @param {number=} nodeIndex
115 WebInspector.NativeHeapSnapshotNode = function(snapshot, nodeIndex)
117 WebInspector.HeapSnapshotNode.call(this, snapshot, nodeIndex)
128 return this._snapshot._nodes[this.nodeIndex + this._snapshot._nodeTypeOffset];
133 return this._snapshot._nodes[this.nodeIndex + this._snapshot._nodeIdOffset];
138 return this._snapshot._strings[this._snapshot._nodes[this.nodeIndex + this._snapshot._nodeNameOffset]];;
148 nodeIndex
[all...]
H A DJSHeapSnapshot.js49 createNode: function(nodeIndex)
51 return new WebInspector.JSHeapSnapshotNode(this, nodeIndex);
156 return this._flags[node.nodeIndex / this._nodeFieldCount];
179 this._flags[edgesIter.edge.node().nodeIndex / this._nodeFieldCount] |= flag;
208 list.push(iter.edge.node().nodeIndex / nodeFieldCount);
261 var nodeIndex = containmentEdges[edgeIndex + edgeToNodeOffset];
263 node.nodeIndex = nodeIndex;
268 var nodeOrdinal = nodeIndex / nodeFieldCount;
300 * @param {number=} nodeIndex
[all...]
H A DHeapSnapshotProxy.js441 dominatorIdsForNode: function(nodeIndex, callback)
443 this.callMethod(callback, "dominatorIdsForNode", nodeIndex);
446 createEdgesProvider: function(nodeIndex, showHiddenData)
448 return this.callFactoryMethod(null, "createEdgesProvider", WebInspector.HeapSnapshotProviderProxy, nodeIndex, showHiddenData);
451 createRetainingEdgesProvider: function(nodeIndex, showHiddenData)
453 return this.callFactoryMethod(null, "createRetainingEdgesProvider", WebInspector.HeapSnapshotProviderProxy, nodeIndex, showHiddenData);
476 createNodesProviderForDominator: function(nodeIndex)
478 return this.callFactoryMethod(null, "createNodesProviderForDominator", WebInspector.HeapSnapshotProviderProxy, nodeIndex);
H A DFlameChart.js396 var nodeIndex = this._coordinatesToNodeIndex(event.offsetX, event.offsetY);
398 this._highlightedNodeIndex = nodeIndex;
401 if (nodeIndex === -1)
405 this._entryToAnchorBox(this._timelineData.entries[nodeIndex], anchorBox);
498 for (var nodeIndex = 0; nodeIndex < timelineEntries.length; ++nodeIndex) {
499 var entry = timelineEntries[nodeIndex];
H A DHeapSnapshotDataGrids.js441 setDataSource: function(snapshot, nodeIndex)
444 var node = new WebInspector.HeapSnapshotNode(snapshot, nodeIndex || snapshot.rootNodeIndex);
499 * @param {number} nodeIndex
501 setDataSource: function(snapshot, nodeIndex)
503 WebInspector.HeapSnapshotContainmentDataGrid.prototype.setDataSource.call(this, snapshot, nodeIndex);
751 var fakeNode = { nodeIndex: this.snapshot.rootNodeIndex }; property in class:setDataSource.fakeNode
/macosx-10.9.5/WebCore-7537.78.1/xml/
H A DXPathPath.cpp146 for (size_t nodeIndex = 0; nodeIndex < matches.size(); ++nodeIndex) {
147 Node* node = matches[nodeIndex];
/macosx-10.9.5/WebCore-7537.78.1/page/
H A DDOMSelection.cpp370 int offset = shadowAncestor->nodeIndex();
462 unsigned nodeIndex = node->nodeIndex(); local
465 bool nodeFullySelected = Range::compareBoundaryPoints(parentNode, nodeIndex, selectedRange->startContainer(), selectedRange->startOffset(), ec) >= 0 && !ec
466 && Range::compareBoundaryPoints(parentNode, nodeIndex + 1, selectedRange->endContainer(), selectedRange->endOffset(), ec) <= 0 && !ec;
471 bool nodeFullyUnselected = (Range::compareBoundaryPoints(parentNode, nodeIndex, selectedRange->endContainer(), selectedRange->endOffset(), ec) > 0 && !ec)
472 || (Range::compareBoundaryPoints(parentNode, nodeIndex + 1, selectedRange->startContainer(), selectedRange->startOffset(), ec) < 0 && !ec);
528 return adjustedNode->nodeIndex();
/macosx-10.9.5/hfs-226.1.1/fsck_hfs/dfalib/
H A DBTreeAllocate.c186 UInt32 nodeIndex; local
193 nodeIndex = 0; // first node number of header map record
196 while (nodeNum >= nodeIndex)
201 nodeIndex += mapSize << 3; // covert to number of bits (nodes)
206 nodeNum -= (nodeIndex - (mapSize << 3)); // relative to this map record
/macosx-10.9.5/xnu-2422.115.4/bsd/hfs/hfscommon/BTree/
H A DBTreeAllocate.c242 u_int32_t nodeIndex; local
249 nodeIndex = 0; // first node number of header map record
253 while (nodeNum >= nodeIndex)
258 nodeIndex += mapSize << 3; // covert to number of bits (nodes)
266 nodeNum -= (nodeIndex - (mapSize << 3)); // relative to this map record
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGCFGSimplificationPhase.cpp259 for (unsigned nodeIndex = block->size(); nodeIndex--;)
260 m_graph.m_allocator.free(block->at(nodeIndex));
H A DDFGCPSRethreadingPhase.cpp320 for (unsigned nodeIndex = 0; nodeIndex < m_block->size(); ++nodeIndex) {
321 Node* node = m_block->at(nodeIndex);
/macosx-10.9.5/libauto-185.5/tests/
H A Ddump.m527 node_descriptor_t *getNodeDescriptor(char *buffer, uint32_t size, char *nibbles, NSMapTable *nodeIndex) {
541 long index = (long)[nodeIndex objectForKey:(id)fields[counter]];
553 long index = (long)[nodeIndex objectForKey:(id)fields[counter]];
616 NSMapTable *nodeIndex = [[NSMapTable alloc] initWithKeyPointerFunctions:pointerFunctions valuePointerFunctions:pointerFunctions capacity:32];
651 long index = (long)[nodeIndex objectForKey:pointer];
674 stack[i] = (long)[nodeIndex objectForKey:(id)stack[i]];
717 long index = (long)[nodeIndex objectForKey:(id)address];
725 long index = (long)[nodeIndex objectForKey:(id)value];
744 [nodeIndex setObject:(id)(1 + [nodeIndex coun
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/i18n/
H A Dtznames_impl.cpp231 uint16_t nodeIndex = parent->fFirstChild; local
232 while (nodeIndex > 0) {
233 CharacterNode *current = fNodes + nodeIndex;
240 prevIndex = nodeIndex;
241 nodeIndex = current->fNextSibling;
258 node->fNextSibling = nodeIndex;
271 uint16_t nodeIndex = parent->fFirstChild; local
272 while (nodeIndex > 0) {
273 CharacterNode *current = fNodes + nodeIndex;
280 nodeIndex
[all...]
/macosx-10.9.5/tcl-102/tcl_ext/tdom/tdom/generic/
H A Ddomxpath.c5789 int sameNodes, nodeIndex, len; local
5803 nodeIndex = 0;
5809 if (node == child) nodeIndex = sameNodes;
5810 if ((nodeIndex != 0) && (sameNodes > 2)) break;
5817 sprintf(step, "/%s[%d]", node->nodeName, nodeIndex);
5824 nodeIndex = 0;
5830 if (node == child) nodeIndex = sameNodes;
5831 if ((nodeIndex != 0) && (sameNodes > 2)) break;
5844 sprintf(step, "/%s[%d]", nTest, nodeIndex);
/macosx-10.9.5/WebCore-7537.78.1/editing/
H A DTextIterator.cpp1061 int index = m_positionOffsetBaseNode->nodeIndex();
1310 unsigned index = m_node->nodeIndex();
1324 unsigned index = m_node->nodeIndex();
H A DApplyStyleCommand.cpp1295 int startOffsetAdjustment = startChild->nodeIndex();
1329 int endOffset = nextChild ? nextChild->nodeIndex() : nextElement->childNodeCount();
H A DDeleteSelectionCommand.cpp552 offset = n->nodeIndex() + 1;
/macosx-10.9.5/WebCore-7537.78.1/html/
H A DHTMLTextFormControlElement.cpp447 offsetInContainer = node->nodeIndex() + offset;

Completed in 188 milliseconds

12