iDepth 41314 ext/sqlite3/libsqlite/sqlite3.c int iDepth iDepth 41321 ext/sqlite3/libsqlite/sqlite3.c if( iDepth==1 ){ iDepth 41327 ext/sqlite3/libsqlite/sqlite3.c pLeft = rowSetNDeepTree(ppList, iDepth-1); iDepth 41334 ext/sqlite3/libsqlite/sqlite3.c p->pRight = rowSetNDeepTree(ppList, iDepth-1); iDepth 41343 ext/sqlite3/libsqlite/sqlite3.c int iDepth; /* Depth of the tree so far */ iDepth 41351 ext/sqlite3/libsqlite/sqlite3.c for(iDepth=1; pList; iDepth++){ iDepth 41356 ext/sqlite3/libsqlite/sqlite3.c p->pRight = rowSetNDeepTree(&pList, iDepth); iDepth 151091 ext/sqlite3/libsqlite/sqlite3.c int iDepth; /* Current depth of the r-tree structure */ iDepth 151531 ext/sqlite3/libsqlite/sqlite3.c pRtree->iDepth = readInt16(pNode->zData); iDepth 151532 ext/sqlite3/libsqlite/sqlite3.c if( pRtree->iDepth>RTREE_MAX_DEPTH ){ iDepth 151654 ext/sqlite3/libsqlite/sqlite3.c pRtree->iDepth = -1; iDepth 152542 ext/sqlite3/libsqlite/sqlite3.c memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1)); iDepth 152560 ext/sqlite3/libsqlite/sqlite3.c p->pInfo->mxLevel = pRtree->iDepth + 1; iDepth 152573 ext/sqlite3/libsqlite/sqlite3.c pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, pRtree->iDepth+1); iDepth 152824 ext/sqlite3/libsqlite/sqlite3.c for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){ iDepth 153221 ext/sqlite3/libsqlite/sqlite3.c pRtree->iDepth++; iDepth 153223 ext/sqlite3/libsqlite/sqlite3.c writeInt16(pNode->zData, pRtree->iDepth); iDepth 153694 ext/sqlite3/libsqlite/sqlite3.c if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){ iDepth 153700 ext/sqlite3/libsqlite/sqlite3.c rc = removeNode(pRtree, pChild, pRtree->iDepth-1); iDepth 153705 ext/sqlite3/libsqlite/sqlite3.c pRtree->iDepth--; iDepth 153706 ext/sqlite3/libsqlite/sqlite3.c writeInt16(pRoot->zData, pRtree->iDepth);