Home
last modified time | relevance | path

Searched refs:nodeCount (Results 1 – 19 of 19) sorted by relevance

/external/chromium_org/third_party/WebKit/Source/core/xml/
DXPathNodeSet.cpp142 unsigned nodeCount = m_nodes.size(); in sort() local
143 if (nodeCount < 2) { in sort()
148 if (nodeCount > traversalSortCutoff) { in sort()
155 Vector<Vector<Node*> > parentMatrix(nodeCount); in sort()
156 for (unsigned i = 0; i < nodeCount; ++i) { in sort()
168 sortBlock(0, nodeCount, parentMatrix, containsAttributeNodes); in sort()
172 sortedNodes.reserveInitialCapacity(nodeCount); in sort()
173 for (unsigned i = 0; i < nodeCount; ++i) in sort()
197 unsigned nodeCount = m_nodes.size(); in traversalSort() local
198 ASSERT(nodeCount > 1); in traversalSort()
[all …]
/external/chromium-trace/trace-viewer/src/tracing/analysis/
Danalysis_results_test.js32 assertEquals(0, table.nodeCount);
35 assertEquals(1, table.nodeCount);
41 assertEquals(1, table.nodeCount);
47 assertEquals(1, table.nodeCount);
53 assertEquals(1, table.nodeCount);
59 assertEquals(1, table.nodeCount);
64 assertEquals(0, table.nodeCount);
Dstub_analysis_table.js29 get nodeCount() { getter in StubAnalysisTable
/external/chromium_org/third_party/icu/source/common/
Dtriedict.cpp397 uint32_t nodeCount; // Number of entries in offsets[] member
406 uint16_t nodeCount; // Number of entries in offsets[] member
415 uint32_t nodeCount; // Number of entries in offsets[] member
432 nodeCount = headerV1->nodeCount; in CompactTrieInfo()
437 nodeCount = header->nodeCount; in CompactTrieInfo()
602 …uint32_t calcEqualLink(const CompactTrieHorizontalNode *hnode, uint16_t index, uint16_t nodeCount){ in calcEqualLink() argument
605 uint16_t *overflow = (uint16_t *) &hnode->entries[nodeCount]; in calcEqualLink()
645 UChar uc, uint16_t nodeCount){ in searchHorizontalEntries() argument
647 int high = nodeCount-1; in searchHorizontalEntries()
712 int nodeCount = getCount(node); in matches() local
[all …]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
DHeapSnapshot.js621 this.nodeCount = this._nodes.length / this._nodeFieldCount;
649 var nodeCount = this.nodeCount;
650 var firstEdgeIndexes = this._firstEdgeIndexes = new Uint32Array(nodeCount + 1);
654 firstEdgeIndexes[nodeCount] = this._containmentEdges.length;
655 for (var nodeOrdinal = 0, edgeIndex = 0; nodeOrdinal < nodeCount; ++nodeOrdinal) {
667 var firstRetainerIndex = this._firstRetainerIndex = new Uint32Array(this.nodeCount + 1);
674 var nodeCount = this.nodeCount;
682 for (var i = 0, firstUnusedRetainerSlot = 0; i < nodeCount; i++) {
688 firstRetainerIndex[nodeCount] = retainingNodes.length;
691 for (var srcNodeOrdinal = 0; srcNodeOrdinal < nodeCount; ++srcNodeOrdinal) {
[all …]
DDOMCountersGraph.js72 WebInspector.DOMCountersGraph.Counter = function(time, documentCount, nodeCount, listenerCount, use… argument
76 this.nodeCount = nodeCount;
167 return entry.nodeCount;
250 this._counters[index].nodeCount = this._counters[copyFrom].nodeCount;
254 this._counters[index].nodeCount = 0;
DJSHeapSnapshot.js149 this._flags = new Uint32Array(this.nodeCount);
295 var nodeCount = this.nodeCount;
340 var nodesCount = this.nodeCount;
DHeapSnapshotProxy.js527 get nodeCount() getter in WebInspector.HeapSnapshotProxy
529 return this._staticData.nodeCount;
DHeapSnapshotGridNodes.js888 return this._count / this.dataGrid.snapshot.nodeCount * 100.0;
/external/chromium_org/chrome/browser/ui/webui/options/chromeos/
Dbluetooth_options_browsertest.js341 var nodeCount = function(node) { function
347 tally += nodeCount(node.childNodes[i]);
353 var unpairedDeviceListSize = nodeCount(unpairedDeviceList);
354 var pairDeviceDialogSize = nodeCount(pairDeviceDialog);
362 assertEquals(unpairedDeviceListSize, nodeCount(unpairedDeviceList));
369 assertEquals(pairDeviceDialogSize, nodeCount(pairDeviceDialog));
/external/chromium_org/third_party/icu/patches/
Dsegmentation.patch753 + uint32_t nodeCount; // Number of entries in offsets[]
762 uint16_t nodeCount; // Number of entries in offsets[]
772 + uint32_t nodeCount; // Number of entries in offsets[]
789 + nodeCount = headerV1->nodeCount;
794 + nodeCount = header->nodeCount;
940 + * @param nodeCount The length of hnode->entries[]
956 + * @param nodeCount The length of hnode->entries[]
958 …uint32_t calcEqualLink(const CompactTrieHorizontalNode *hnode, uint16_t index, uint16_t nodeCount){
961 + uint16_t *overflow = (uint16_t *) &hnode->entries[nodeCount];
1001 + UChar uc, uint16_t nodeCount){
[all …]
/external/srec/tools/grxmlcompile/
Dsub_min.cpp542 int *nodeCount= new int [numVertex]; in VisitationConsistencyCheck() local
549 nodeCount[ii]= 0; in VisitationConsistencyCheck()
555 nodeCount[arc[ii]->GetToId()]++; in VisitationConsistencyCheck()
559 if (vertexProp[ii] != nodeCount[ii]) { in VisitationConsistencyCheck()
566 delete [] nodeCount; in VisitationConsistencyCheck()
/external/chromium_org/third_party/icu/source/test/intltest/
Dssearch.cpp247 int32_t nodeCount = 0; in searchTest() local
257 nodeCount++; in searchTest()
264 nodeCount++; in searchTest()
274 nodeCount++; in searchTest()
282 nodeCount++; in searchTest()
286 TEST_ASSERT(nodeCount == testCase->countChildren()); in searchTest()
585 int32_t nodeCount = 0; in bmSearchTest() local
595 nodeCount++; in bmSearchTest()
602 nodeCount++; in bmSearchTest()
612 nodeCount++; in bmSearchTest()
[all …]
/external/icu4c/test/intltest/
Dssearch.cpp213 int32_t nodeCount = 0; in searchTest() local
223 nodeCount++; in searchTest()
230 nodeCount++; in searchTest()
240 nodeCount++; in searchTest()
248 nodeCount++; in searchTest()
252 TEST_ASSERT(nodeCount == testCase->countChildren()); in searchTest()
/external/chromium_org/third_party/WebKit/Source/core/dom/
DNode.cpp694 unsigned nodeCount = 0; in styledSubtreeSizeIgnoringSelfAndShadowRoots() local
696 nodeCount += styledSubtreeSize(child); in styledSubtreeSizeIgnoringSelfAndShadowRoots()
697 return nodeCount; in styledSubtreeSizeIgnoringSelfAndShadowRoots()
708 unsigned nodeCount = 1 + styledSubtreeSizeIgnoringSelfAndShadowRoots(rootNode); in styledSubtreeSize() local
712 nodeCount += styledSubtreeSizeIgnoringSelfAndShadowRoots(shadowRoot); in styledSubtreeSize()
714 return nodeCount; in styledSubtreeSize()
728 PassRefPtr<JSONObject> jsonObjectForStyleInvalidation(unsigned nodeCount, const Node* rootNode) in jsonObjectForStyleInvalidation() argument
731 jsonObject->setNumber("node_count", nodeCount); in jsonObjectForStyleInvalidation()
742 unsigned nodeCount = styledSubtreeSize(this); in traceStyleChange() local
743 if (nodeCount < kMinLoggedSize) in traceStyleChange()
[all …]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
Dnv50_ir_ra.cpp694 unsigned int nodeCount; member in nv50_ir::GCRA
721 for (unsigned int i = 0; i < nodeCount; ++i) { in printNodeInfo()
1084 for (unsigned int i = 0; i < nodeCount; ++i) { in calculateSpillWeights()
1292 for (unsigned int i = 0; i < nodeCount; ++i) { in selectRegisters()
1309 nodeCount = func->allLValues.getSize(); in allocateRegisters()
1310 nodes = new RIG_Node[nodeCount]; in allocateRegisters()
1313 for (unsigned int i = 0; i < nodeCount; ++i) { in allocateRegisters()
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
Dnv50_ir_ra.cpp694 unsigned int nodeCount; member in nv50_ir::GCRA
721 for (unsigned int i = 0; i < nodeCount; ++i) { in printNodeInfo()
1084 for (unsigned int i = 0; i < nodeCount; ++i) { in calculateSpillWeights()
1292 for (unsigned int i = 0; i < nodeCount; ++i) { in selectRegisters()
1309 nodeCount = func->allLValues.getSize(); in allocateRegisters()
1310 nodes = new RIG_Node[nodeCount]; in allocateRegisters()
1313 for (unsigned int i = 0; i < nodeCount; ++i) { in allocateRegisters()
/external/chromium_org/third_party/WebKit/Source/core/inspector/
DInspectorTimelineAgent.cpp1063 int nodeCount = 0; in setDOMCounters() local
1067 nodeCount = InspectorCounters::counterValue(InspectorCounters::NodeCounter); in setDOMCounters()
1072 .setNodes(nodeCount) in setDOMCounters()
DInspectorDOMAgent.cpp1544 int nodeCount = innerChildNodeCount(node); in buildObjectForNode() local
1545 value->setChildNodeCount(nodeCount); in buildObjectForNode()