Lines Matching refs:iDepth

51386   int iDepth
51394 if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/
51398 pLeft = rowSetNDeepTree(ppList, iDepth-1);
51407 p->pRight = rowSetNDeepTree(ppList, iDepth-1);
51421 int iDepth; /* Depth of the tree so far */
51429 for(iDepth=1; pList; iDepth++){
51434 p->pRight = rowSetNDeepTree(&pList, iDepth);
185602 u16 iDepth; /* Nesting depth */
186229 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
186232 pParse->iDepth--;
186245 pParse->iDepth--;
186262 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
186264 pParse->iDepth--;
186387 assert( pParse->iDepth==0 );
188201 int iDepth; /* Current depth of the r-tree structure */
188822 pRtree->iDepth = readInt16(pNode->zData);
188823 if( pRtree->iDepth>RTREE_MAX_DEPTH ){
188955 pRtree->iDepth = -1;
189932 memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
189951 p->pInfo->mxLevel = pRtree->iDepth + 1;
189973 pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));
190248 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
190647 pRtree->iDepth++;
190649 writeInt16(pNode->zData, pRtree->iDepth);
191127 if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
191133 rc = removeNode(pRtree, pChild, pRtree->iDepth-1);
191138 pRtree->iDepth--;
191139 writeInt16(pRoot->zData, pRtree->iDepth);
192206 int iDepth, /* Depth of iNode (0==leaf) */
192226 iDepth = readInt16(aNode);
192227 if( iDepth>RTREE_MAX_DEPTH ){
192228 rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
192245 if( iDepth>0 ){
192247 rtreeCheckNode(pCheck, iDepth-1, &pCell[8], iVal);
193824 memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
193864 pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));