| /external/pdfium/core/fpdfdoc/ |
| D | cpdf_nametree.cpp | 41 int nLevel, in GetNodeAncestorsLimits() argument
43 if (nLevel > kNameTreeMaxRecursion) in GetNodeAncestorsLimits()
60 if (GetNodeAncestorsLimits(pKid, pFind, nLevel + 1, pLimits)) { in GetNodeAncestorsLimits()
74 int nLevel) { in UpdateNodesAndLimitsUponDeletion() argument
75 if (nLevel > kNameTreeMaxRecursion) in UpdateNodesAndLimitsUponDeletion()
118 if (!UpdateNodesAndLimitsUponDeletion(pKid, pFind, csName, nLevel + 1)) in UpdateNodesAndLimitsUponDeletion()
158 int nLevel, in SearchNameNodeByName() argument
162 if (nLevel > kNameTreeMaxRecursion) in SearchNameNodeByName()
219 CPDF_Object* pFound = SearchNameNodeByName(pKid, csName, nLevel + 1, nIndex, in SearchNameNodeByName()
233 int nLevel, in SearchNameNodeByIndex() argument
[all …]
|
| D | cpdf_structtree.cpp | 88 int nLevel) { in AddPageNode() argument
90 if (nLevel > kStructTreeMaxRecursion) in AddPageNode()
107 AddPageNode(pParent, map, nLevel + 1); in AddPageNode()
|
| D | cpdf_structtree.h | 42 int nLevel);
|
| D | cpdf_interactiveform.h | 113 void LoadField(CPDF_Dictionary* pFieldDict, int nLevel);
|
| D | cpdf_formfield.cpp | 37 int nLevel) { in GetFieldAttrRecursive() argument
39 if (!pFieldDict || nLevel > kGetFieldMaxRecursion) in GetFieldAttrRecursive()
47 pFieldDict->GetDictFor(pdfium::form_fields::kParent), name, nLevel + 1); in GetFieldAttrRecursive()
|
| D | cpdf_interactiveform.cpp | 846 void CPDF_InteractiveForm::LoadField(CPDF_Dictionary* pFieldDict, int nLevel) { in LoadField() argument
847 if (nLevel > nMaxRecursion) in LoadField()
869 LoadField(pChildDict, nLevel + 1); in LoadField()
|
| /external/pdfium/core/fpdfapi/page/ |
| D | cpdf_occontext.cpp | 196 bool CPDF_OCContext::GetOCGVE(const CPDF_Array* pExpression, int nLevel) const { in GetOCGVE()
197 if (nLevel > 32 || !pExpression) in GetOCGVE()
208 return !GetOCGVE(pArray, nLevel + 1); in GetOCGVE()
225 bItem = GetOCGVE(pArray, nLevel + 1); in GetOCGVE()
|
| D | cpdf_occontext.h | 38 bool GetOCGVE(const CPDF_Array* pExpression, int nLevel) const;
|
| /external/deqp/external/vulkancts/modules/vulkan/ray_tracing/ |
| D | vktRayTracingMiscTests.cpp | 1822 for (deUint32 nLevel = 0; nLevel < m_nMaxCallableLevels; nLevel++) in getCallableShaderCollectionNames() local
1824 resultVec.at(nLevel) = "call" + de::toString(nLevel); in getCallableShaderCollectionNames()
2112 for (deUint32 nLevel = 0; nLevel < nCallableShader + 1; ++nLevel) in initPrograms() local
2115 …sultData[nInvocation].dataChunk[" + de::toString(nLevel) + "] = inData.dataChunk[" + de::toString(… in initPrograms()
2127 for (deUint32 nLevel = 0; nLevel <= nCallableShader + 1; ++nLevel) in initPrograms() local
2130 …eShader + 1) + ".dataChunk[" + de::toString(nLevel) + "] = float(inData.nOriginRay + " + de::toStr… in initPrograms()
2181 deUint32 nLevel; in verifyResultBuffer() member
2186 nLevel (0) in verifyResultBuffer()
2215 item.nLevel = *(itemDataPtr + 2); in verifyResultBuffer()
2322 : (currentItem.nLevel + 1); in verifyResultBuffer()
[all …]
|
| /external/pdfium/fxjs/xfa/ |
| D | cfxjse_engine.cpp | 627 int32_t nLevel = 0; in ResolveObjects() local
683 rndFind.m_nLevel = nLevel; in ResolveObjects()
729 if (nLevel == 0) in ResolveObjects()
732 nLevel++; in ResolveObjects()
|
| /external/rust/crates/libsqlite3-sys/sqlite3/ |
| D | sqlite3.c | 141401 u8 nLevel; /* Number of nested loop */
142832 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
143587 if( pWInfo->nLevel>1 ){
143590 nNotReady = pWInfo->nLevel - iLevel - 1;
143807 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
145714 pInner = &pWInfo->a[pWInfo->nLevel-1];
147548 for(i=0; i<pWInfo->nLevel; i++){
149220 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
149718 nLoop = pWInfo->nLevel;
149998 assert( pWInfo->nLevel==nLoop );
[all …]
|
| /external/sqlite/dist/orig/ |
| D | sqlite3.c | 140741 u8 nLevel; /* Number of nested loop */
142172 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142927 if( pWInfo->nLevel>1 ){
142930 nNotReady = pWInfo->nLevel - iLevel - 1;
143147 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
145050 pInner = &pWInfo->a[pWInfo->nLevel-1];
146884 for(i=0; i<pWInfo->nLevel; i++){
148554 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
149049 nLoop = pWInfo->nLevel;
149329 assert( pWInfo->nLevel==nLoop );
[all …]
|
| /external/sqlite/dist/ |
| D | sqlite3.c | 140757 u8 nLevel; /* Number of nested loop */
142188 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142943 if( pWInfo->nLevel>1 ){
142946 nNotReady = pWInfo->nLevel - iLevel - 1;
143163 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
145066 pInner = &pWInfo->a[pWInfo->nLevel-1];
146900 for(i=0; i<pWInfo->nLevel; i++){
148570 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
149065 nLoop = pWInfo->nLevel;
149345 assert( pWInfo->nLevel==nLoop );
[all …]
|