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

12

/external/webkit/Source/WebCore/dom/
H A DNodeWithIndex.h49 m_index = m_node->nodeIndex();
52 ASSERT(m_index == static_cast<int>(m_node->nodeIndex()));
H A DPosition.h80 // will return img->parentNode() and img->nodeIndex() from these functions.
218 return Position(node->parentNode(), node->nodeIndex(), Position::PositionIsOffsetInAnchor);
224 return Position(node->parentNode(), node->nodeIndex() + 1, Position::PositionIsOffsetInAnchor);
H A DRange.cpp387 int nodeIndex = refNode->nodeIndex(); local
396 if (comparePoint(parentNode, nodeIndex, ec) < 0) { // starts before
397 if (comparePoint(parentNode, nodeIndex + 1, ec) > 0) // ends after the range
401 if (comparePoint(parentNode, nodeIndex + 1, ec) > 0) // ends after the range
589 int nodeIndex = refNode->nodeIndex(); local
598 if (comparePoint(parentNode, nodeIndex, ec) < 0 && // starts before start
599 comparePoint(parentNode, nodeIndex + 1, ec) < 0) { // ends before start
601 } else if (comparePoint(parentNode, nodeIndex, e
[all...]
H A DRangeBoundaryPoint.h89 m_offsetInContainer = m_childBeforeBoundary->nodeIndex() + 1;
H A DPosition.cpp143 return m_anchorNode->nodeIndex();
145 return m_anchorNode->nodeIndex() + 1;
274 return Position(parent, n->nodeIndex());
306 return Position(parent, n->nodeIndex() + 1);
567 // return lastVisible on the next iteration, but we terminate early to avoid doing a nodeIndex() call.
680 // positions will be [boundary->parentNode(), originalBlock->nodeIndex() + 1].
/external/webkit/Source/JavaScriptCore/dfg/
H A DDFGGraph.h70 void ref(NodeIndex nodeIndex) argument
72 Node& node = at(nodeIndex);
75 refChildren(nodeIndex);
77 void deref(NodeIndex nodeIndex) argument
79 Node& node = at(nodeIndex);
83 derefChildren(nodeIndex);
H A DDFGGenerationInfo.h72 void initConstant(NodeIndex nodeIndex, uint32_t useCount) argument
74 m_nodeIndex = nodeIndex;
80 void initInteger(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr) argument
82 m_nodeIndex = nodeIndex;
89 void initJSValue(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr, DataFormat format = DataFormatJS) argument
93 m_nodeIndex = nodeIndex;
100 void initCell(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr) argument
102 m_nodeIndex = nodeIndex;
109 void initDouble(NodeIndex nodeIndex, uint32_t useCount, FPRReg fpr) argument
111 m_nodeIndex = nodeIndex;
118 initNone(NodeIndex nodeIndex, uint32_t useCount) argument
128 NodeIndex nodeIndex() { return m_nodeIndex; } function in class:JSC::DFG::GenerationInfo
[all...]
H A DDFGJITCompiler.cpp43 void JITCompiler::fillNumericToDouble(NodeIndex nodeIndex, FPRReg fpr, GPRReg temporary) argument
45 Node& node = graph()[nodeIndex];
50 move(MacroAssembler::ImmPtr(reinterpret_cast<void*>(reinterpretDoubleToIntptr(valueOfDoubleConstant(nodeIndex)))), tempReg);
66 void JITCompiler::fillInt32ToInteger(NodeIndex nodeIndex, GPRReg gpr) argument
68 Node& node = graph()[nodeIndex];
72 move(MacroAssembler::Imm32(valueOfInt32Constant(nodeIndex)), gprToRegisterID(gpr));
84 void JITCompiler::fillToJS(NodeIndex nodeIndex, GPRReg gpr) argument
86 Node& node = graph()[nodeIndex];
89 if (isInt32Constant(nodeIndex)) {
90 JSValue jsValue = jsNumber(valueOfInt32Constant(nodeIndex));
132 NodeIndex nodeIndex = check.m_gprInfo[gpr].nodeIndex; local
147 NodeIndex nodeIndex = check.m_fprInfo[fpr]; local
160 NodeIndex nodeIndex = entry.m_fprInfo[fpr]; local
169 NodeIndex nodeIndex = entry.m_gprInfo[gpr].nodeIndex; local
[all...]
H A DDFGJITCompiler.h251 bool isConstant(NodeIndex nodeIndex)
253 return graph()[nodeIndex].isConstant();
255 bool isInt32Constant(NodeIndex nodeIndex)
257 return graph()[nodeIndex].op == Int32Constant;
259 bool isDoubleConstant(NodeIndex nodeIndex)
261 return graph()[nodeIndex].op == DoubleConstant;
263 bool isJSConstant(NodeIndex nodeIndex)
265 return graph()[nodeIndex].op == JSConstant;
269 int32_t valueOfInt32Constant(NodeIndex nodeIndex)
271 ASSERT(isInt32Constant(nodeIndex));
[all...]
H A DDFGJITCodeGenerator.h95 bool canReuse(NodeIndex nodeIndex) argument
97 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
135 bool isFilled(NodeIndex nodeIndex) argument
137 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
141 bool isFilledDouble(NodeIndex nodeIndex) argument
143 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
185 void use(NodeIndex nodeIndex) argument
187 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
240 bool isConstant(NodeIndex nodeIndex) { return m_jit.isConstant(nodeIndex); } argument
241 isInt32Constant(NodeIndex nodeIndex) argument
242 isDoubleConstant(NodeIndex nodeIndex) argument
243 isJSConstant(NodeIndex nodeIndex) argument
244 valueOfInt32Constant(NodeIndex nodeIndex) argument
245 valueOfDoubleConstant(NodeIndex nodeIndex) argument
246 valueOfJSConstant(NodeIndex nodeIndex) argument
292 constantAsJSValue(NodeIndex nodeIndex) argument
302 constantAsJSValueAsImmPtr(NodeIndex nodeIndex) argument
381 integerResult(GPRReg reg, NodeIndex nodeIndex, DataFormat format = DataFormatInteger) argument
400 noResult(NodeIndex nodeIndex) argument
409 cellResult(GPRReg reg, NodeIndex nodeIndex) argument
419 jsValueResult(GPRReg reg, NodeIndex nodeIndex, DataFormat format = DataFormatJS) argument
432 doubleResult(FPRReg reg, NodeIndex nodeIndex) argument
442 initConstantInfo(NodeIndex nodeIndex) argument
[all...]
H A DDFGNonSpeculativeJIT.h53 NodeIndex nodeIndex; member in struct:JSC::DFG::EntryLocation::RegisterInfo
130 NodeIndex nodeIndex = info.nodeIndex();
131 Node& node = m_jit.graph()[nodeIndex];
138 ASSERT(isInt32Constant(nodeIndex));
139 m_jit.move(Imm32(valueOfInt32Constant(nodeIndex)), reg);
146 m_jit.move(constantAsJSValueAsImmPtr(nodeIndex), reg);
158 NodeIndex nodeIndex = info.nodeIndex();
159 Node& node = m_jit.graph()[nodeIndex];
[all...]
H A DDFGJITCodeGenerator.cpp37 GPRReg JITCodeGenerator::fillInteger(NodeIndex nodeIndex, DataFormat& returnFormat) argument
39 Node& node = m_jit.graph()[nodeIndex];
49 if (isInt32Constant(nodeIndex)) {
50 m_jit.move(MacroAssembler::Imm32(valueOfInt32Constant(nodeIndex)), reg);
55 if (isDoubleConstant(nodeIndex)) {
56 JSValue jsValue = jsNumber(valueOfDoubleConstant(nodeIndex));
59 ASSERT(isJSConstant(nodeIndex));
60 JSValue jsValue = valueOfJSConstant(nodeIndex);
108 FPRReg JITCodeGenerator::fillDouble(NodeIndex nodeIndex) argument
110 Node& node = m_jit.graph()[nodeIndex];
234 fillJSValue(NodeIndex nodeIndex) argument
[all...]
H A DDFGSpeculativeJIT.h85 NodeIndex nodeIndex; member in struct:JSC::DFG::SpeculationCheck::RegisterInfo
138 bool isDoubleConstantWithInt32Value(NodeIndex nodeIndex, int32_t& out) argument
140 if (!m_jit.isDoubleConstant(nodeIndex))
142 double value = m_jit.valueOfDoubleConstant(nodeIndex);
350 bool hasCheckAtIndex(NodeIndex nodeIndex) argument
354 if (current >= nodeIndex)
355 return current == nodeIndex;
H A DDFGGraph.cpp44 void Graph::dump(NodeIndex nodeIndex, CodeBlock* codeBlock) argument
46 Node& node = at(nodeIndex);
61 // (1) The nodeIndex of this operation.
73 printf("% 4d:\t<%c%u:%u>\t%s(", (int)nodeIndex, mustGenerate ? '!' : ' ', refCount, node.virtualRegister, dfgOpNames[op & NodeIdMask]);
H A DDFGSpeculativeJIT.cpp34 GPRReg SpeculativeJIT::fillSpeculateIntInternal(NodeIndex nodeIndex, DataFormat& returnFormat) argument
36 Node& node = m_jit.graph()[nodeIndex];
47 if (isInt32Constant(nodeIndex)) {
48 m_jit.move(MacroAssembler::Imm32(valueOfInt32Constant(nodeIndex)), reg);
53 m_jit.move(constantAsJSValueAsImmPtr(nodeIndex), reg);
152 m_gprInfo[gpr].nodeIndex = info.nodeIndex();
155 m_gprInfo[gpr].nodeIndex = NoNode;
162 m_fprInfo[fpr] = info.nodeIndex();
168 GPRReg SpeculativeJIT::fillSpeculateInt(NodeIndex nodeIndex, DataForma argument
173 fillSpeculateIntStrict(NodeIndex nodeIndex) argument
181 fillSpeculateCell(NodeIndex nodeIndex) argument
[all...]
H A DDFGNonSpeculativeJIT.cpp45 m_gprInfo[gpr].nodeIndex = info.nodeIndex();
48 m_gprInfo[gpr].nodeIndex = NoNode;
55 m_fprInfo[fpr] = info.nodeIndex();
140 bool NonSpeculativeJIT::isKnownInteger(NodeIndex nodeIndex) argument
142 GenerationInfo& info = m_generationInfo[m_jit.graph()[nodeIndex].virtualRegister];
152 ASSERT(isConstant(nodeIndex));
153 return isInt32Constant(nodeIndex);
156 bool NonSpeculativeJIT::isKnownNumeric(NodeIndex nodeIndex) argument
158 GenerationInfo& info = m_generationInfo[m_jit.graph()[nodeIndex]
[all...]
/external/webkit/Source/WebCore/inspector/front-end/
H A DHeapSnapshot.js103 return new WebInspector.HeapSnapshotNode(this._snapshot, this.nodeIndex);
106 get nodeIndex()
253 get nodeIndex()
328 WebInspector.HeapSnapshotNode = function(snapshot, nodeIndex)
331 this._firstNodeIndex = nodeIndex;
332 this.nodeIndex = nodeIndex;
356 return this._nodes[this.nodeIndex + this._snapshot._dominatorOffset];
366 return this._nodes[this.nodeIndex + this._snapshot._edgesCountOffset];
371 return this._nodes[this.nodeIndex
[all...]
H A DHeapSnapshotProxy.js57 return {name: edge.name, node: this._extractNodeData(edge.node), nodeIndex: edge.nodeIndex, type: edge.type};
62 return {id: node.id, name: node.name, nodeIndex: node.nodeIndex, retainedSize: node.retainedSize, selfSize: node.selfSize, type: node.type};
70 createEdgesProvider: function(nodeIndex, filter)
76 return new WebInspector.HeapSnapshotEdgesProvider(this._snapshot, nodeIndex, filter);
H A DDetailedHeapshotGridNodes.js162 this.snapshotNodeIndex = node.nodeIndex;
265 this._provider = this._createProvider(tree.snapshot, edge.nodeIndex);
275 _createProvider: function(snapshot, nodeIndex)
279 nodeIndex,
352 this._provider = this._createProvider(baseSnapshot || snapshot, node.nodeIndex);
362 _createProvider: function(snapshot, nodeIndex)
366 nodeIndex,
659 this._provider = this._createProvider(tree.snapshot, node.nodeIndex);
669 _createProvider: function(snapshot, nodeIndex)
675 return dominatorIndex === nodeIndex
[all...]
/external/webkit/Source/WebCore/xml/
H A DXPathPath.cpp138 for (size_t nodeIndex = 0; nodeIndex < matches.size(); ++nodeIndex) {
139 Node* node = matches[nodeIndex];
/external/webkit/Source/WebCore/page/
H A DDOMSelection.cpp112 return shadowAncestor->nodeIndex();
130 return shadowAncestor->nodeIndex();
148 return shadowAncestor->nodeIndex();
166 return shadowAncestor->nodeIndex();
380 int offset = shadowAncestor->nodeIndex();
470 unsigned nodeIndex = n->nodeIndex(); local
477 bool nodeFullySelected = Range::compareBoundaryPoints(parentNode, nodeIndex, selectedRange->startContainer(ec), selectedRange->startOffset(ec), ec) >= 0 && !ec
478 && Range::compareBoundaryPoints(parentNode, nodeIndex + 1, selectedRange->endContainer(ec), selectedRange->endOffset(ec), ec) <= 0 && !ec;
483 bool nodeFullyUnselected = (Range::compareBoundaryPoints(parentNode, nodeIndex, selectedRang
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
H A DDOM2DTM.java185 int nodeIndex = m_nodes.size();
188 if(m_dtmIdent.size() == (nodeIndex>>>DTMManager.IDENT_DTM_NODE_BITS))
198 mgrD.addDTM(this,id,nodeIndex);
211 // ensureSize(nodeIndex);
248 m_firstch.setElementAt(NOTPROCESSED,nodeIndex);
249 m_nextsib.setElementAt(NOTPROCESSED,nodeIndex);
250 m_prevsib.setElementAt(previousSibling,nodeIndex);
251 m_parent.setElementAt(parentIndex,nodeIndex);
259 m_firstch.setElementAt(nodeIndex,parentIndex);
296 m_exptype.setElementAt(expandedNameID,nodeIndex);
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
H A DSAX2DTM.java872 int nodeIndex = m_size++;
875 if(m_dtmIdent.size() == (nodeIndex>>>DTMManager.IDENT_DTM_NODE_BITS))
877 addNewDTMID(nodeIndex);
891 m_nextsib.setElementAt(nodeIndex,previousSibling);
905 declareNamespaceInContext(parentIndex,nodeIndex);
911 m_firstch.setElementAt(nodeIndex,parentIndex);
916 return nodeIndex;
921 * @param nodeIndex The node identity at which the new DTM ID will begin
924 protected void addNewDTMID(int nodeIndex) { argument
933 mgrD.addDTM(this,id,nodeIndex);
[all...]
/external/webkit/Source/WebCore/platform/graphics/android/context/
H A DRTree.cpp345 int nodeIndex = -1; local
348 nodeIndex = i;
352 if (nodeIndex == -1)
356 for (unsigned int i = nodeIndex; i < m_nbChildren - 1; i++)
/external/icu4c/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...]

Completed in 669 milliseconds

12