| /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/aac/libDRCdec/src/ |
| D | drcGainDec_process.cpp | 203 const int nNodes, const NODE_LIN* pNodeLin, const int offset, in _processNodeSegments() argument
215 for (n = 0; n < nNodes; n++) { in _processNodeSegments()
312 pLnbPrevious->linearNode[lnbIx][pLnbPrevious->nNodes[lnbIx] - 1]; in processDrcTime()
341 pLnb->nNodes[lnbIx], pLnb->linearNode[lnbIx], in processDrcTime()
458 nodePrevious = pLnb->linearNode[lnbIx][pLnb->nNodes[lnbIx] - 1]; in processDrcSubband()
469 pLnb->nNodes[lnbIx], pLnb->linearNode[lnbIx], in processDrcSubband()
|
| D | drcDec_reader.cpp | 252 int nNodes = 0, endMarker = 0; in _decodeNNodes() local
256 nNodes++; in _decodeNNodes()
257 if (nNodes >= 128) break; in _decodeNNodes()
260 return nNodes; in _decodeNNodes()
265 const int nNodes, GAIN_NODE* pNodes) { in _decodeGains() argument
277 for (k = 1; k < nNodes; k++) { in _decodeGains()
290 const int nNodes, GAIN_NODE* pNodes) { in _decodeSlopes() argument
295 for (k = 0; k < nNodes; k++) { in _decodeSlopes()
324 const int timeOffset, const int Z, const int nNodes, in _decodeTimes() argument
340 for (k = 0; k < nNodes - 1; k++) { in _decodeTimes()
[all …]
|
| D | drcGainDec_init.cpp | 221 drcGainBuffers->linearNodeBuffer[i].nNodes[j] = 1; in initDrcGainBuffers()
238 drcGainBuffers->dummyLnb.nNodes[i] = 1; in initDrcGainBuffers()
|
| D | drcDec_gainDecoder.cpp | 310 lastNodeIndex = hUniDrcGain->nNodes[seq] - 1; in drcDec_GainDecoder_Conceal()
315 hUniDrcGain->nNodes[seq] = 1; in drcDec_GainDecoder_Conceal()
|
| D | drcDec_gainDecoder.h | 146 int nNodes[NUM_LNB_FRAMES]; /* number of nodes, saturated to 16 */ member
|
| D | drcGainDec_preprocess.cpp | 701 pLnb->nNodes[lnbp] = fMin((int)hUniDrcGain->nNodes[seq], 16); in prepareDrcGain()
702 for (i = 0; i < pLnb->nNodes[lnbp]; i++) { in prepareDrcGain()
|
| D | drcDec_types.h | 128 UCHAR nNodes[12]; /* unsaturated value, i.e. as provided in bitstream */ member
|
| /external/pdfium/fxjs/xfa/ |
| D | cfxjse_engine.cpp | 631 int32_t nNodes = 0; in ResolveObjects() local
633 nNodes = pdfium::CollectionSize<int32_t>(findObjects); in ResolveObjects()
672 while (i < nNodes) { in ResolveObjects()
676 nNodes > 1) { in ResolveObjects()
679 m_ResolveProcessor->SetIndexDataBind(rndBind.m_wsCondition, i, nNodes); in ResolveObjects()
709 nNodes = pdfium::CollectionSize<int32_t>(retObjects); in ResolveObjects()
710 if (nNodes < 1) { in ResolveObjects()
737 if (nNodes > 0) { in ResolveObjects()
764 return nNodes > 0; in ResolveObjects()
|
| /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/bzip2/ |
| D | BZip2CompressorOutputStream.java | 159 int nNodes = alphaSize; in hbMakeCodeLengths() local
239 nNodes++; in hbMakeCodeLengths()
240 parent[n1] = parent[n2] = nNodes; in hbMakeCodeLengths()
244 weight[nNodes] = ((weight_n1 & 0xffffff00) in hbMakeCodeLengths()
251 parent[nNodes] = -1; in hbMakeCodeLengths()
253 heap[nHeap] = nNodes; in hbMakeCodeLengths()
|