149   u8 nDim;                    /* Number of dimensions */  member
2076   assert( pRtree->nDim>=1 && pRtree->nDim<=5 );  in cellArea()
2079     switch( pRtree->nDim ){  in cellArea()
2089     switch( pRtree->nDim ){  in cellArea()
2474   sqlite3_int64 nByte = (pRtree->nDim+1)*(sizeof(int*)+nCell*sizeof(int));  in splitNodeStartree()
2481   aSpare = &((int *)&aaSorted[pRtree->nDim])[pRtree->nDim*nCell];  in splitNodeStartree()
2483   for(ii=0; ii<pRtree->nDim; ii++){  in splitNodeStartree()
2485     aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];  in splitNodeStartree()
2492   for(ii=0; ii<pRtree->nDim; ii++){  in splitNodeStartree()
2915     for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
2920   for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
2926     for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
3811   pRtree->nDim = pRtree->nDim2/2;  in rtreeInit()
3812   if( pRtree->nDim<1 ){  in rtreeInit()
3875   tree.nDim = (u8)sqlite3_value_int(apArg[0]);  in rtreenode()
3876   if( tree.nDim<1 || tree.nDim>5 ) return;  in rtreenode()
3877   tree.nDim2 = tree.nDim*2;  in rtreenode()
3878   tree.nBytesPerCell = 8 + 8 * tree.nDim;  in rtreenode()
3943   int nDim;                       /* Number of dimensions for this rtree tbl */  member
4142   for(i=0; i<pCheck->nDim; i++){  in rtreeCheckCellCoord()
4187   assert( pCheck->nDim>0 );  in rtreeCheckNode()
4207       if( (4 + nCell*(8 + pCheck->nDim*2*4))>nNode ){  in rtreeCheckNode()
4214           u8 *pCell = &aNode[4 + i*(8 + pCheck->nDim*2*4)];  in rtreeCheckNode()
4305     check.nDim = (sqlite3_column_count(pStmt) - 1 - nAux) / 2;  in rtreeCheckTable()
4306     if( check.nDim<1 ){  in rtreeCheckTable()
4316   if( check.nDim>=1 ){  in rtreeCheckTable()