Home
last modified time | relevance | path

Searched refs:nNodes (Results 1 – 18 of 18) sorted by relevance

/external/bzip2/
Dhuffman.c72 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/
DNodeVector.java399 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()
DDOMHelper.java386 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/
DNodeSet.java1141 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/
DdrcGainDec_process.cpp203 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()
DdrcDec_reader.cpp247 int nNodes = 0, endMarker = 0; in _decodeNNodes() local
251 nNodes++; in _decodeNNodes()
252 if (nNodes >= 128) break; in _decodeNNodes()
255 return nNodes; in _decodeNNodes()
260 const int nNodes, GAIN_NODE* pNodes) { in _decodeGains() argument
272 for (k = 1; k < nNodes; k++) { in _decodeGains()
285 const int nNodes, GAIN_NODE* pNodes) { in _decodeSlopes() argument
290 for (k = 0; k < nNodes; k++) { in _decodeSlopes()
319 const int timeOffset, const int Z, const int nNodes, in _decodeTimes() argument
335 for (k = 0; k < nNodes - 1; k++) { in _decodeTimes()
[all …]
DdrcGainDec_init.cpp234 drcGainBuffers->linearNodeBuffer[i].nNodes[j] = 1; in initDrcGainBuffers()
251 drcGainBuffers->dummyLnb.nNodes[i] = 1; in initDrcGainBuffers()
DdrcDec_gainDecoder.cpp290 lastNodeIndex = hUniDrcGain->nNodes[seq] - 1; in drcDec_GainDecoder_Conceal()
295 hUniDrcGain->nNodes[seq] = 1; in drcDec_GainDecoder_Conceal()
DdrcDec_gainDecoder.h144 int nNodes[NUM_LNB_FRAMES]; /* number of nodes, saturated to 16 */ member
DdrcGainDec_preprocess.cpp697 pLnb->nNodes[lnbp] = fMin((int)hUniDrcGain->nNodes[seq], 16); in prepareDrcGain()
698 for (i = 0; i < pLnb->nNodes[lnbp]; i++) { in prepareDrcGain()
DdrcDec_types.h128 UCHAR nNodes[12]; /* unsaturated value, i.e. as provided in bitstream */ member
/external/pdfium/fxjs/
Dcfxjse_engine.cpp564 int32_t nNodes = 0; in ResolveObjects() local
566 nNodes = pdfium::CollectionSize<int32_t>(findObjects); in ResolveObjects()
610 while (i < nNodes) { in ResolveObjects()
614 nNodes > 1) { in ResolveObjects()
617 m_ResolveProcessor->SetIndexDataBind(rndBind.m_wsCondition, i, nNodes); in ResolveObjects()
646 nNodes = pdfium::CollectionSize<int32_t>(retObjects); in ResolveObjects()
647 if (nNodes < 1) { in ResolveObjects()
678 if (nNodes > 0) { in ResolveObjects()
706 return nNodes > 0; in ResolveObjects()
/external/valgrind/memcheck/tests/
Dorigin5-bz2.c3242 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()
Dvarinfo6.c3280 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()
/external/valgrind/exp-sgcheck/tests/
Dhackedbz2.c3251 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/perf/
Dbz2.c3240 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()
Dtest_input_for_tinycc.c2752 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()
/external/swiftshader/third_party/PowerVR_SDK/Tools/
DPVRTModelPOD.cpp1636 unsigned int nCameras=0, nLights=0, nMaterials=0, nMeshes=0, nTextures=0, nNodes=0; in ReadScene() local
1654 if(nNodes != s.nNumNode) return false; in ReadScene()
1675 case ePODFileNode: if(!ReadNode(s.pNode[nNodes++], src)) return false; break; in ReadScene()