| /external/bzip2/ |
| D | huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
84 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
103 nNodes++; in BZ2_hbMakeCodeLengths()
104 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
106 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
108 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
112 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | NodeVector.java | 399 int nNodes = nodes.size(); in appendNodes() local
403 m_mapSize = nNodes + m_blocksize; in appendNodes()
406 else if ((m_firstFree + nNodes) >= m_mapSize) in appendNodes()
408 m_mapSize += (nNodes + m_blocksize); in appendNodes()
412 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes); in appendNodes()
417 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes); in appendNodes()
419 m_firstFree += nNodes; in appendNodes()
|
| D | DOMHelper.java | 386 int nNodes = children.getLength(); in isNodeAfterSibling() local
390 for (int i = 0; i < nNodes; i++) in isNodeAfterSibling()
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| D | NodeSet.java | 1141 int nNodes = nodes.size(); in appendNodes() local
1145 m_mapSize = nNodes + m_blocksize; in appendNodes()
1148 else if ((m_firstFree + nNodes) >= m_mapSize) in appendNodes()
1150 m_mapSize += (nNodes + m_blocksize); in appendNodes()
1154 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes); in appendNodes()
1159 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes); in appendNodes()
1161 m_firstFree += nNodes; in appendNodes()
|
| /external/pdfium/xfa/src/fxfa/src/parser/ |
| D | xfa_script_imp.cpp | 636 int32_t nNodes = 0; in ResolveObjects() local
638 nNodes = findNodes.GetSize(); in ResolveObjects()
681 while (i < nNodes) { in ResolveObjects()
685 nNodes > 1) { in ResolveObjects()
690 rndBind.m_wsCondition, i, nNodes); in ResolveObjects()
721 nNodes = retNodes.GetSize(); in ResolveObjects()
722 if (nNodes < 1) { in ResolveObjects()
752 if (nNodes > 0) { in ResolveObjects()
769 return nNodes; in ResolveObjects()
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| D | btSoftBodyHelpers.cpp | 538 int i, nLinks=psb->m_links.size(), nNodes=psb->m_nodes.size(); in ReoptimizeLinkOrder() local
547 …int *nodeWrittenAt = new int[nNodes+1]; // What link calculation produced this node's current valu… in ReoptimizeLinkOrder()
559 for (i=0; i < nNodes+1; i++) { in ReoptimizeLinkOrder()
|
| /external/valgrind/VEX/switchback/ |
| D | test_bzip2.c | 3225 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
3237 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
3256 nNodes++; in BZ2_hbMakeCodeLengths()
3257 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
3258 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
3259 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
3261 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
3265 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| /external/valgrind/exp-sgcheck/tests/ |
| D | hackedbz2.c | 3251 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
3263 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
3282 nNodes++; in BZ2_hbMakeCodeLengths()
3283 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
3284 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
3285 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
3287 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
3291 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| /external/valgrind/memcheck/tests/ |
| D | varinfo6.c | 3280 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
3292 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
3311 nNodes++; in BZ2_hbMakeCodeLengths()
3312 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
3313 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
3314 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
3316 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
3320 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| D | origin5-bz2.c | 3242 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
3254 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
3273 nNodes++; in BZ2_hbMakeCodeLengths()
3274 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
3275 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
3276 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
3278 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
3282 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| /external/valgrind/perf/ |
| D | bz2.c | 3240 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
3252 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
3271 nNodes++; in BZ2_hbMakeCodeLengths()
3272 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
3273 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
3274 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
3276 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
3280 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 ); in BZ2_hbMakeCodeLengths()
|
| D | test_input_for_tinycc.c | 2752 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
2764 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
2783 nNodes++; in BZ2_hbMakeCodeLengths()
2784 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
2785 …weight[nNodes] = (((weight[n1]) & 0xffffff00)+((weight[n2]) & 0xffffff00)) | (1 + ((((weight[n1]) … in BZ2_hbMakeCodeLengths()
2786 parent[nNodes] = -1; in BZ2_hbMakeCodeLengths()
2788 heap[nHeap] = nNodes; in BZ2_hbMakeCodeLengths()
2792 { if (!(nNodes < (258 * 2))) bz_internal_error ( 2002 ); }; in BZ2_hbMakeCodeLengths()
|