| /external/webkit/Source/WebCore/dom/ |
| NodeWithIndex.h | 49 m_index = m_node->nodeIndex();
52 ASSERT(m_index == static_cast<int>(m_node->nodeIndex()));
|
| Position.h | 80 // 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);
|
| Range.cpp | 387 int nodeIndex = refNode->nodeIndex();
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();
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, ec) > 0 && // starts after en
[all...] |
| RangeBoundaryPoint.h | 89 m_offsetInContainer = m_childBeforeBoundary->nodeIndex() + 1;
|
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGGraph.h | 44 BasicBlock(unsigned bytecodeBegin, NodeIndex begin, NodeIndex end)
57 NodeIndex begin;
58 NodeIndex end;
70 void ref(NodeIndex nodeIndex)
72 Node& node = at(nodeIndex);
75 refChildren(nodeIndex);
77 void deref(NodeIndex nodeIndex)
[all...] |
| DFGGenerationInfo.h | 72 void initConstant(NodeIndex nodeIndex, uint32_t useCount)
74 m_nodeIndex = nodeIndex;
80 void initInteger(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr)
82 m_nodeIndex = nodeIndex;
89 void initJSValue(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr, DataFormat format = DataFormatJS)
93 m_nodeIndex = nodeIndex;
100 void initCell(NodeIndex nodeIndex, uint32_t useCount, GPRReg gpr
[all...] |
| DFGJITCompiler.cpp | 43 void JITCompiler::fillNumericToDouble(NodeIndex nodeIndex, FPRReg fpr, GPRReg temporary)
45 Node& node = graph()[nodeIndex];
50 move(MacroAssembler::ImmPtr(reinterpret_cast<void*>(reinterpretDoubleToIntptr(valueOfDoubleConstant(nodeIndex)))), tempReg);
66 void JITCompiler::fillInt32ToInteger(NodeIndex nodeIndex, GPRReg gpr)
68 Node& node = graph()[nodeIndex];
72 move(MacroAssembler::Imm32(valueOfInt32Constant(nodeIndex)), gprToRegisterID(gpr));
84 void JITCompiler::fillToJS(NodeIndex nodeIndex, GPRReg gpr
[all...] |
| DFGJITCompiler.h | 251 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
[all...] |
| DFGJITCodeGenerator.h | 71 GPRReg fillInteger(NodeIndex, DataFormat& returnFormat);
72 FPRReg fillDouble(NodeIndex);
73 GPRReg fillJSValue(NodeIndex);
95 bool canReuse(NodeIndex nodeIndex)
97 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
135 bool isFilled(NodeIndex nodeIndex)
137 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
141 bool isFilledDouble(NodeIndex nodeIndex
[all...] |
| DFGNonSpeculativeJIT.h | 47 NodeIndex m_nodeIndex;
53 NodeIndex nodeIndex;
57 NodeIndex m_fprInfo[numberOfFPRs];
85 bool isKnownInteger(NodeIndex);
86 bool isKnownNumeric(NodeIndex);
130 NodeIndex nodeIndex = info.nodeIndex();
131 Node& node = m_jit.graph()[nodeIndex];
[all...] |
| DFGJITCodeGenerator.cpp | 37 GPRReg JITCodeGenerator::fillInteger(NodeIndex nodeIndex, DataFormat& returnFormat)
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
[all...] |
| DFGSpeculativeJIT.h | 78 NodeIndex m_nodeIndex;
85 NodeIndex nodeIndex;
89 NodeIndex m_fprInfo[numberOfFPRs];
130 GPRReg fillSpeculateInt(NodeIndex, DataFormat& returnFormat);
131 GPRReg fillSpeculateIntStrict(NodeIndex);
132 GPRReg fillSpeculateCell(NodeIndex);
138 bool isDoubleConstantWithInt32Value(NodeIndex nodeIndex, int32_t& out)
140 if (!m_jit.isDoubleConstant(nodeIndex))
[all...] |
| DFGGraph.cpp | 44 void Graph::dump(NodeIndex nodeIndex, CodeBlock* codeBlock)
46 Node& node = at(nodeIndex);
61 // (1) The nodeIndex of this operation.
68 // @# - a NodeIndex referencing a prior node in the graph.
73 printf("% 4d:\t<%c%u:%u>\t%s(", (int)nodeIndex, mustGenerate ? '!' : ' ', refCount, node.virtualRegister, dfgOpNames[op & NodeIdMask]);
138 void Graph::refChildren(NodeIndex op)
158 void Graph::derefChildren(NodeIndex op)
|
| DFGSpeculativeJIT.cpp | 34 GPRReg SpeculativeJIT::fillSpeculateIntInternal(NodeIndex nodeIndex, DataFormat& returnFormat)
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();
[all...] |
| DFGNonSpeculativeJIT.cpp | 45 m_gprInfo[gpr].nodeIndex = info.nodeIndex();
48 m_gprInfo[gpr].nodeIndex = NoNode;
55 m_fprInfo[fpr] = info.nodeIndex();
140 bool NonSpeculativeJIT::isKnownInteger(NodeIndex nodeIndex)
142 GenerationInfo& info = m_generationInfo[m_jit.graph()[nodeIndex].virtualRegister];
152 ASSERT(isConstant(nodeIndex));
153 return isInt32Constant(nodeIndex);
156 bool NonSpeculativeJIT::isKnownNumeric(NodeIndex nodeIndex
[all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| HeapSnapshot.js | 103 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 + this._snapshot._nodeIdOffset]
[all...] |
| HeapSnapshotProxy.js | 57 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);
|
| DetailedHeapshotGridNodes.js | 162 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/ |
| XPathPath.cpp | 138 for (size_t nodeIndex = 0; nodeIndex < matches.size(); ++nodeIndex) {
139 Node* node = matches[nodeIndex];
|
| /external/webkit/Source/WebCore/page/ |
| DOMSelection.cpp | 112 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();
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, selectedRange->endContainer(ec), selectedRange->endOffset(ec), ec) > 0 && !ec
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 185 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/ |
| SAX2DTM.java | 872 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) {
933 mgrD.addDTM(this,id,nodeIndex);
[all...] |
| /external/icu4c/i18n/ |
| tznames_impl.cpp | 230 uint16_t nodeIndex = parent->fFirstChild;
231 while (nodeIndex > 0) {
232 CharacterNode *current = fNodes + nodeIndex;
239 prevIndex = nodeIndex;
240 nodeIndex = current->fNextSibling;
257 node->fNextSibling = nodeIndex;
270 uint16_t nodeIndex = parent->fFirstChild;
271 while (nodeIndex > 0) {
272 CharacterNode *current = fNodes + nodeIndex;
279 nodeIndex = current->fNextSibling
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| FusionDictionary.java | 463 int nodeIndex = findIndexOfChar(mRoot, word[charIndex]);
464 while (CHARACTER_NOT_FOUND != nodeIndex) {
465 currentGroup = currentNode.mData.get(nodeIndex);
473 nodeIndex = findIndexOfChar(currentNode, word[charIndex]);
476 if (-1 == nodeIndex) {
541 currentNode.mData.set(nodeIndex, newParent);
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| RTree.cpp | 345 int nodeIndex = -1;
348 nodeIndex = i;
352 if (nodeIndex == -1)
356 for (unsigned int i = nodeIndex; i < m_nbChildren - 1; i++)
|
