Lines Matching refs:iDepth

51314   int iDepth
51322   if( iDepth>1 ){   /*OPTIMIZATION-IF-TRUE*/
51326     pLeft = rowSetNDeepTree(ppList, iDepth-1);
51335     p->pRight = rowSetNDeepTree(ppList, iDepth-1);
51349   int iDepth;           /* Depth of the tree so far */
51357   for(iDepth=1; pList; iDepth++){
51362     p->pRight = rowSetNDeepTree(&pList, iDepth);
184890   u16 iDepth;        /* Nesting depth */
185517       if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
185520         pParse->iDepth--;
185533       pParse->iDepth--;
185550       if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
185552       pParse->iDepth--;
185675     assert( pParse->iDepth==0 );
187487   int iDepth;                 /* Current depth of the r-tree structure */
188091     pRtree->iDepth = readInt16(pNode->zData);
188092     if( pRtree->iDepth>RTREE_MAX_DEPTH ){
188224         pRtree->iDepth = -1;
189201         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
189220             p->pInfo->mxLevel = pRtree->iDepth + 1;
189242       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));
189517   for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
189916     pRtree->iDepth++;
189918     writeInt16(pNode->zData, pRtree->iDepth);
190396   if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
190402       rc = removeNode(pRtree, pChild, pRtree->iDepth-1);
190407       pRtree->iDepth--;
190408       writeInt16(pRoot->zData, pRtree->iDepth);
191475   int iDepth,                     /* Depth of iNode (0==leaf) */
191495         iDepth = readInt16(aNode);
191496         if( iDepth>RTREE_MAX_DEPTH ){
191497           rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
191514           if( iDepth>0 ){
191516             rtreeCheckNode(pCheck, iDepth-1, &pCell[8], iVal);
193091         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
193131       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));