contrib/sqlite3/sqlite3.c

57731   int iDepth
57739   if( iDepth>1 ){   /*OPTIMIZATION-IF-TRUE*/
57743     pLeft = rowSetNDeepTree(ppList, iDepth-1);
57752     p->pRight = rowSetNDeepTree(ppList, iDepth-1);
57766   int iDepth;           /* Depth of the tree so far */  local
57774   for(iDepth=1; pList; iDepth++){
57779     p->pRight = rowSetNDeepTree(&pList, iDepth);
208204   u16 iDepth;        /* Nesting depth */
209207   u32 iDepth                  /* Current nesting depth */
209212   if( iDepth>JSON_MAX_DEPTH ) return i+1;
209360         sub = jsonbValidityCheck(pParse, j, j+n+sz, iDepth+1);
209381         sub = jsonbValidityCheck(pParse, j, j+n+sz, iDepth+1);
209425     if( ++pParse->iDepth > JSON_MAX_DEPTH ){
209519     pParse->iDepth--;
209529     if( ++pParse->iDepth > JSON_MAX_DEPTH ){
209572     pParse->iDepth--;
209896     assert( pParse->iDepth==0 );
213631   int iDepth;                 /* Current depth of the r-tree structure */
214243     pRtree->iDepth = readInt16(pNode->zData);
214244     if( pRtree->iDepth>RTREE_MAX_DEPTH ){
214377         pRtree->iDepth = -1;
215376         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
215395             p->pInfo->mxLevel = pRtree->iDepth + 1;
215431       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));
215704   for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
216058     pRtree->iDepth++;
216060     writeInt16(pNode->zData, pRtree->iDepth);
216434   if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
216440       rc = removeNode(pRtree, pChild, pRtree->iDepth-1);
216445       pRtree->iDepth--;
216446       writeInt16(pRoot->zData, pRtree->iDepth);
217523   int iDepth,                     /* Depth of iNode (0==leaf) */
217543         iDepth = readInt16(aNode);
217544         if( iDepth>RTREE_MAX_DEPTH ){
217545           rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
217562           if( iDepth>0 ){
217564             rtreeCheckNode(pCheck, iDepth-1, &pCell[8], iVal);
219177         memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
219217       pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));