Lines Matching defs:jj
34360 int jj = i;
34362 if( !sqlite3Isspace(zNum[jj]) ){
34366 jj += incr;
34367 }while( &zNum[jj]<zEnd );
128905 int ii, jj;
128909 for(ii=jj=0; zP4[jj]; ii++){
128914 zP4[jj] = SQLITE_AFF_NONE;
128916 jj++;
130527 int nIdx, jj;
130544 jj = 0;
130548 jj++;
130550 if( bUsed[jj] ) continue; /* Duplicate ON CONFLICT clause ignored */
130551 bUsed[jj] = 1;
130553 sIdxIter.u.ax.aIdx[i].ix = jj;
130556 for(jj=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, jj++){
130557 if( bUsed[jj] ) continue;
130559 sIdxIter.u.ax.aIdx[i].ix = jj;
147286 int jj;
147287 for(jj=0; jj<pTab->nCol; jj++){
147289 if( IsHiddenColumn(pTab->aCol+jj) ) continue;
147290 pNewExpr = sqlite3Expr(db, TK_ID, pTab->aCol[jj].zCnName);
147294 pItem->zEName = sqlite3DbStrDup(db, pTab->aCol[jj].zCnName);
149343 int ii, jj, nn;
149371 for(jj=0; jj<nn; jj++){
149372 if( sqlite3ExprCompare(pParse,pTarget->a[jj].pExpr,pExpr,iCursor)<2 ){
149373 break; /* Column ii of the index matches column jj of target */
149376 if( jj>=nn ){
149377 /* The target contains no match for column jj of the index */
157673 int jj;
157674 for(jj=0; jj<n; jj++){
157675 int iCol = pIdx->aiColumn[jj];
157677 sqlite3ExprCodeGetColumnOfTable(v, pIdx->pTable, iCur, iCol,r1+jj);
159742 int ii, jj;
159751 for(jj=0; jj<pIndex->nKeyCol; jj++){
159752 if( pExpr->iColumn==pIndex->aiColumn[jj] ) return 1;
159755 for(jj=0; jj<pIndex->nKeyCol; jj++){
159756 if( pIndex->aiColumn[jj]!=XN_EXPR ) continue;
159757 if( sqlite3ExprCompareSkip(pExpr,aColExpr->a[jj].pExpr,iCursor)==0 ){
161334 int ii, jj; /* Loop counters */
161492 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){
161496 testcase( jj==nTo-1 );
161500 if( jj>=nTo ){
161521 jj = nTo++;
161524 jj = mxI;
161526 pTo = &aTo[jj];
161535 /* Control reaches here if best-so-far path pTo=aTo[jj] covers the
161593 for(jj=1, pTo=&aTo[1]; jj<mxChoice; jj++, pTo++){
161599 mxI = jj;
162654 int ii, jj;
162656 jj = pIx->aiColumn[ii];
162657 if( jj<0 ) continue;
162658 if( jj>63 ) jj = 63;
162659 if( (pTabItem->colUsed & MASKBIT(jj))==0 ) continue;
186665 int jj;
186684 for(jj=0; jj<p->pPhrase->nToken; jj++){
186685 p->pPhrase->aToken[jj].z = zBuf;
186686 zBuf += p->pPhrase->aToken[jj].n;
191468 sqlite3_int64 jj;
191469 for(jj=pReader->iStartBlock; jj<=pReader->iLeafEndBlock; jj++){
191471 rc = sqlite3Fts3ReadBlock(p, jj, 0, &nBlob, 0);
200529 int jj, nn;
200540 for(jj=2; jj<nn-1 && sqlite3Isalnum(z[jj]); jj++){}
200541 if( jj==nn-1 ){
202960 int jj;
202961 for(jj=0; jj<ii; jj++){
202962 pIdxInfo->aConstraintUsage[jj].argvIndex = 0;
202963 pIdxInfo->aConstraintUsage[jj].omit = 0;
202967 pIdxInfo->aConstraintUsage[jj].omit = 1;
203120 int jj;
203122 for(jj=0; jj<pRtree->nDim2; jj+=2){
203124 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
203125 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
203322 int jj;
203323 for(jj=1; jj<nIdx; jj++){
203324 RtreeDValue left = aDistance[aIdx[jj-1]];
203325 RtreeDValue right = aDistance[aIdx[jj]];
203387 int jj;
203388 for(jj=1; jj<nIdx; jj++){
203389 RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];
203390 RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];
203391 RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];
203392 RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];
203430 int jj;
203432 for(jj=0; jj<nCell; jj++){
203433 aaSorted[ii][jj] = jj;
204294 int jj;
204296 for(jj=0; jj<pRtree->nAux; jj++){
204297 sqlite3_bind_value(pUp, jj+2, aData[pRtree->nDim2+3+jj]);
204834 int jj;
204839 for(jj=0; jj<tree.nDim2; jj++){
204841 sqlite3_str_appendf(pOut, " %g", (double)cell.aCoord[jj].f);
204843 sqlite3_str_appendf(pOut, " %d", cell.aCoord[jj].i);
205892 int ii, jj;
205893 for(ii=1, jj=p->nVertex-1; ii<jj; ii++, jj--){
205895 GeoX(p,ii) = GeoX(p,jj);
205896 GeoX(p,jj) = t;
205898 GeoY(p,ii) = GeoY(p,jj);
205899 GeoY(p,jj) = t;
207029 int jj;
207048 for(jj=1; jj<nData-2; jj++){
207050 sqlite3_bind_value(pUp, jj+2, aData[jj+2]);
224725 int jj;
224743 for(jj=0; jj<(sFinder.nFirst-1); jj++){
224744 if( sFinder.aFirst[jj+1]>io ) break;
224747 if( sFinder.aFirst[jj]<io ){
224750 sFinder.aFirst[jj], nToken, &nScore, 0
224753 nScore += (sFinder.aFirst[jj]==0 ? 120 : 100);
224757 iBestStart = sFinder.aFirst[jj];
226702 int jj;
226704 for(jj=iFirst; jj<i; jj++){
226705 zExpr[iOut++] = zText[jj];
226706 if( zText[jj]=='"' ) zExpr[iOut++] = '"';