Lines Matching refs:iDepth

51298   int iDepth
51306   if( iDepth>1 ){   /*OPTIMIZATION-IF-TRUE*/
51310     pLeft = rowSetNDeepTree(ppList, iDepth-1);
51319     p->pRight = rowSetNDeepTree(ppList, iDepth-1);
51333   int iDepth;           /* Depth of the tree so far */
51341   for(iDepth=1; pList; iDepth++){
51346     p->pRight = rowSetNDeepTree(&pList, iDepth);
184862   u16 iDepth;        /* Nesting depth */
185489       if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
185492         pParse->iDepth--;
185505       pParse->iDepth--;
185522       if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
185524       pParse->iDepth--;
185647     assert( pParse->iDepth==0 );
187459   int iDepth;                 /* Current depth of the r-tree structure */
188063     pRtree->iDepth = readInt16(pNode->zData);
188064     if( pRtree->iDepth>RTREE_MAX_DEPTH ){
188196         pRtree->iDepth = -1;
189173         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
189192             p->pInfo->mxLevel = pRtree->iDepth + 1;
189214       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));
189489   for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
189888     pRtree->iDepth++;
189890     writeInt16(pNode->zData, pRtree->iDepth);
190368   if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
190374       rc = removeNode(pRtree, pChild, pRtree->iDepth-1);
190379       pRtree->iDepth--;
190380       writeInt16(pRoot->zData, pRtree->iDepth);
191447   int iDepth,                     /* Depth of iNode (0==leaf) */
191467         iDepth = readInt16(aNode);
191468         if( iDepth>RTREE_MAX_DEPTH ){
191469           rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
191486           if( iDepth>0 ){
191488             rtreeCheckNode(pCheck, iDepth-1, &pCell[8], iVal);
193063         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
193103       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));