2014       int jj;  in rtreeBestIndex()  local
2015       for(jj=0; jj<ii; jj++){  in rtreeBestIndex()
2016         pIdxInfo->aConstraintUsage[jj].argvIndex = 0;  in rtreeBestIndex()
2017         pIdxInfo->aConstraintUsage[jj].omit = 0;  in rtreeBestIndex()
2021       pIdxInfo->aConstraintUsage[jj].omit = 1;  in rtreeBestIndex()
2174     int jj;  in cellOverlap()  local
2176     for(jj=0; jj<pRtree->nDim2; jj+=2){  in cellOverlap()
2178       x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));  in cellOverlap()
2179       x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));  in cellOverlap()
2376       int jj;  in SortByDistance()
2377       for(jj=1; jj<nIdx; jj++){  in SortByDistance()
2378         RtreeDValue left = aDistance[aIdx[jj-1]];  in SortByDistance()
2379         RtreeDValue right = aDistance[aIdx[jj]];  in SortByDistance()
2441       int jj;  in SortByDimension()
2442       for(jj=1; jj<nIdx; jj++){  in SortByDimension()
2443         RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];  in SortByDimension()
2444         RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];  in SortByDimension()
2445         RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];  in SortByDimension()
2446         RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];  in SortByDimension()
2484     int jj;  in splitNodeStartree()  local
2486     for(jj=0; jj<nCell; jj++){  in splitNodeStartree()
2487       aaSorted[ii][jj] = jj;  in splitNodeStartree()
3348       int jj;  in rtreeUpdate()  local
3350       for(jj=0; jj<pRtree->nAux; jj++){  in rtreeUpdate()
3351         sqlite3_bind_value(pUp, jj+2, aData[pRtree->nDim2+3+jj]);  in rtreeUpdate()
3888     int jj;  in rtreenode()  local
3893     for(jj=0; jj<tree.nDim2; jj++){  in rtreenode()
3895       sqlite3_str_appendf(pOut, " %g", (double)cell.aCoord[jj].f);  in rtreenode()
3897       sqlite3_str_appendf(pOut, " %d", cell.aCoord[jj].i);  in rtreenode()