Lines Matching refs:ii
25804 int ii; /* Loop counter */
25835 for(ii=0; ii<=LOGMAX; ii++){
25836 mem5.aiFreelist[ii] = -1;
25840 for(ii=LOGMAX; ii>=0; ii--){
25841 int nAlloc = (1<<ii);
25843 mem5.aCtrl[iOffset] = ii | CTRL_FREE;
25844 memsys5Link(iOffset, ii);
29227 int ii = length - 1;
29228 while( ii>=0 ) if( (bufpt[ii--] & 0xc0)==0x80 ) width++;
37560 int ii;
37565 for(ii=(int)strlen(zDirname); ii>0 && zDirname[ii]!='/'; ii--);
37566 if( ii>0 ){
37567 zDirname[ii] = '\0';
38774 int ii;
38777 for(ii=ofst; ii<ofst+n; ii++){
38778 if( aLock[ii]>((p->sharedMask & (1<<ii)) ? 1 : 0) ){
38818 int ii;
38819 for(ii=ofst; ii<ofst+n; ii++){
38821 if( ALWAYS((p->exclMask & (1<<ii))==0) && aLock[ii] ){
38834 for(ii=ofst; ii<ofst+n; ii++){
38835 aLock[ii] = -1;
53590 int ii; /* Loop counter */
53602 for(ii=0; ii<pPager->nSavepoint; ii++){
53603 if( pPager->aSavepoint[ii].iHdrOffset==0 ){
53604 pPager->aSavepoint[ii].iHdrOffset = pPager->journalOff;
53915 int ii; /* Iterator for looping through Pager.aSavepoint */
53916 for(ii=0; ii<pPager->nSavepoint; ii++){
53917 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
53934 int ii; /* Loop counter */
53937 for(ii=0; ii<pPager->nSavepoint; ii++){
53938 PagerSavepoint *p = &pPager->aSavepoint[ii];
55552 u32 ii; /* Loop counter */
55568 for(ii=0; rc==SQLITE_OK && ii<nJRec && pPager->journalOff<szJ; ii++){
55580 u32 ii; /* Loop counter */
55586 for(ii=pSavepoint->iSubRec; rc==SQLITE_OK && ii<pPager->nSubRec; ii++){
55587 assert( offset==(i64)ii*(4+pPager->pageSize) );
57045 int ii;
57049 for(ii=szPageDflt; ii<=SQLITE_MAX_DEFAULT_PAGE_SIZE; ii=ii*2){
57050 if( iDc&(SQLITE_IOCAP_ATOMIC|(ii>>8)) ){
57051 szPageDflt = ii;
58202 int ii; /* Loop counter */
58233 for(ii=0; ii<nPage && rc==SQLITE_OK; ii++){
58234 Pgno pg = pg1+ii;
58263 for(ii=0; ii<nPage; ii++){
58264 PgHdr *pPage = sqlite3PagerLookup(pPager, pg1+ii);
58972 int ii; /* Iterator variable */
58993 for(ii=nCurrent; ii<nSavepoint; ii++){
58994 aNew[ii].nOrig = pPager->dbSize;
58996 aNew[ii].iOffset = pPager->journalOff;
58998 aNew[ii].iOffset = JOURNAL_HDR_SZ(pPager);
59000 aNew[ii].iSubRec = pPager->nSubRec;
59001 aNew[ii].pInSavepoint = sqlite3BitvecCreate(pPager->dbSize);
59002 aNew[ii].bTruncateOnRelease = 1;
59003 if( !aNew[ii].pInSavepoint ){
59007 sqlite3WalSavepoint(pPager->pWal, aNew[ii].aWalData);
59009 pPager->nSavepoint = ii+1;
59068 int ii; /* Iterator variable */
59076 for(ii=nNew; ii<pPager->nSavepoint; ii++){
59077 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
70349 int ii;
70350 for(ii=0; ii<pCur->iPage; ii++){
70351 assert( pCur->aiIdx[ii]==pCur->apPage[ii]->nCell );
76035 int ii; /* Iterator variable */
76089 for(ii=0; (nPage<0 || ii<nPage) && p->iNext<=(Pgno)nSrcPage && !rc; ii++){
79855 int ii;
79874 for(ii=0; (c = zSynopsis[ii])!=0; ii++){
79876 c = zSynopsis[++ii];
79885 if( strncmp(zSynopsis+ii+1, "@P", 2)==0 ){
79886 ii += 3;
79887 v2 = translateP(zSynopsis[ii], pOp);
79888 if( strncmp(zSynopsis+ii+1,"+1",2)==0 ){
79889 ii += 2;
79897 }else if( strncmp(zSynopsis+ii+1, "@NP", 3)==0 ){
79906 ii++;
79908 ii += 3;
79911 if( strncmp(zSynopsis+ii+1, "..P3", 4)==0 && pOp->p3==0 ){
79912 ii += 4;
89205 int ii;
89314 for(ii=0; ii<db->nDb; ii++){
89315 rc = sqlite3BtreeTripAllCursors(db->aDb[ii].pBt,
89324 for(ii=0; ii<db->nDb; ii++){
89325 rc = sqlite3BtreeSavepoint(db->aDb[ii].pBt, p1, iSavepoint);
90650 int ii;
90677 for(ii=0; ii<r.nField; ii++){
90678 assert( memIsValid(&r.aMem[ii]) );
90679 assert( (r.aMem[ii].flags & MEM_Zero)==0 || r.aMem[ii].n==0 );
90680 if( ii ) REGISTER_TRACE(pOp->p3+ii, &r.aMem[ii]);
90700 for(ii=0; ii<pIdxKey->nField; ii++){
90701 if( pIdxKey->aMem[ii].flags & MEM_Null ){
94060 ** except if bit ii of P3 set, then do not release register P1+ii.
103958 int ii;
103964 for(ii=0; ii<pList->nExpr; ii++){
103965 r2 = sqlite3ExprCodeTemp(pParse, pList->a[ii].pExpr, ®ToFree);
103966 if( regCkNull && sqlite3ExprCanBeNull(pList->a[ii].pExpr) ){
103970 if( ii<pList->nExpr-1 || destIfNull!=destIfFalse ){
103974 VdbeCoverageIf(v, ii<pList->nExpr-1 && op==OP_Eq);
103975 VdbeCoverageIf(v, ii==pList->nExpr-1 && op==OP_Eq);
103976 VdbeCoverageIf(v, ii<pList->nExpr-1 && op==OP_NotNull);
103977 VdbeCoverageIf(v, ii==pList->nExpr-1 && op==OP_NotNull);
107565 int ii;
107566 for(ii=0; ii<pIdList->nId; ii++){
107567 sqlite3RenameTokenRemap(pParse, 0, (void*)pIdList->a[ii].zName);
114049 int ii, nNG = 0;
114052 for(ii=0; ii<p->nCol; ii++){
114053 u32 colFlags = p->aCol[ii].colFlags;
114055 Expr *pX = p->aCol[ii].pDflt;
114066 p->aCol[ii].pDflt = sqlite3ExprAlloc(db, TK_NULL, 0, 0);
122417 int ii, jj;
122421 for(ii=jj=0; zP4[jj]; ii++){
122422 if( pTab->aCol[ii].colFlags & COLFLAG_VIRTUAL ){
122425 if( pTab->aCol[ii].colFlags & COLFLAG_STORED ){
126556 int ii;
126591 for(ii=0; ii<ArraySize(azEndings) && handle==0; ii++){
126592 char *zAltFile = sqlite3_mprintf("%s.%s", zFile, azEndings[ii]);
128133 int ii;
128134 for(ii=0; ii<db->nDb; ii++){
128135 sqlite3BtreeSecureDelete(db->aDb[ii].pBt, b);
128205 int ii;
128207 for(ii=2; ii<db->nDb; ii++){
128208 pPager = sqlite3BtreePager(db->aDb[ii].pBt);
128233 int ii; /* Loop counter */
128261 for(ii=db->nDb-1; ii>=0; ii--){
128262 if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
128263 sqlite3VdbeUsesBtree(v, ii);
128264 sqlite3VdbeAddOp3(v, OP_JournalMode, ii, 1, eMode);
128453 int ii;
128457 for(ii=db->nDb-1; ii>=0; ii--){
128458 if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
128459 sqlite3BtreeSetMmapLimit(db->aDb[ii].pBt, sz);
135190 int ii;
135191 for(ii=0; ii<p->pOrderBy->nExpr; ii++){
135192 if( p->pOrderBy->a[ii].u.x.iOrderByCol==0 ) return 0;
137810 int ii;
137816 for(ii=0; ii<pGroupBy->nExpr; ii++){
137817 u8 sortFlags = sSort.pOrderBy->a[ii].sortFlags & KEYINFO_ORDER_DESC;
137818 pGroupBy->a[ii].sortFlags = sortFlags;
137889 int ii;
137896 for(ii=0; ii<pAggInfo->nColumn; ii++){
137898 ii, pAggInfo->aCol[ii].iMem);
137899 sqlite3TreeViewExpr(0, pAggInfo->aCol[ii].pCExpr, 0);
137901 for(ii=0; ii<pAggInfo->nFunc; ii++){
137903 ii, pAggInfo->aFunc[ii].iMem);
137904 sqlite3TreeViewExpr(0, pAggInfo->aFunc[ii].pFExpr, 0);
141401 int ii, jj, nn;
141412 for(ii=0; ii<nn; ii++){
141414 sCol[0].u.zToken = (char*)pIdx->azColl[ii];
141415 if( pIdx->aiColumn[ii]==XN_EXPR ){
141417 assert( pIdx->aColExpr->nExpr>ii );
141418 pExpr = pIdx->aColExpr->a[ii].pExpr;
141425 sCol[1].iColumn = pIdx->aiColumn[ii];
141430 break; /* Column ii of the index matches column jj of target */
141438 if( ii<nn ){
141439 /* Column ii of the index did not match any term of the conflict target.
142123 int ii;
142124 for(ii=0; azNames[ii]!=0 && strcmp(azNames[ii],pMod->zName)!=0; ii++){}
142125 if( azNames[ii]!=0 ) continue;
145977 int ii; /* Loop counter */
146079 for(ii=0; ii<pOrWc->nTerm; ii++){
146080 WhereTerm *pOrTerm = &pOrWc->a[ii];
146093 ExplainQueryPlan((pParse, 1, "INDEX %d", ii+1));
146111 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
146186 && (ii==0 || pSubLoop->u.btree.pIndex==pCov)
147422 int ii;
147423 for(ii=0; ii<pSrc->nSrc; ii++){
147424 if( pSrc->a[ii].iCursor==iCsr ){
151147 int ii, jj;
151151 for(ii=0; ii<pOB->nExpr; ii++){
151152 Expr *pExpr = sqlite3ExprSkipCollateAndLikely(pOB->a[ii].pExpr);
151443 int ii;
151446 for(ii=0; ii<pWC2->nTerm; ii++){
151447 WhereTerm *pTerm = &pWC2->a[ii];
152455 int ii, jj; /* Loop counters */
152501 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
152540 for(ii=0, pFrom=aFrom; ii<nFrom; ii++, pFrom++){
152722 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){
152750 for(ii=1; ii<nFrom; ii++){
152751 if( pFrom->rCost>aFrom[ii].rCost ) pFrom = &aFrom[ii];
153075 int ii; /* Loop counter */
153189 ii = 0;
153191 createMask(pMaskSet, pTabList->a[ii].iCursor);
153192 sqlite3WhereTabFuncArgs(pParse, &pTabList->a[ii], &pWInfo->sWC);
153193 }while( (++ii)<pTabList->nSrc );
153197 for(ii=0; ii<pTabList->nSrc; ii++){
153198 Bitmask m = sqlite3WhereGetMask(pMaskSet, pTabList->a[ii].iCursor);
153221 for(ii=0; ii<sWLB.pWC->nTerm; ii++){
153222 WhereTerm *pT = &sWLB.pWC->a[ii];
153326 for(ii=0; ii<pWInfo->nLevel; ii++){
153327 sqlite3WhereLoopPrint(pWInfo->a[ii].pWLoop, sWLB.pWC);
153460 for(ii=0, pLevel=pWInfo->a; ii<nTabList; ii++, pLevel++){
153568 int ii, jj;
153569 for(ii=0; ii<pIx->nColumn; ii++){
153570 jj = pIx->aiColumn[ii];
153574 colUsed |= ((u64)1)<<(ii<63 ? ii : 63);
153591 for(ii=0; ii<nTabList; ii++){
153594 pLevel = &pWInfo->a[ii];
153607 notReady = sqlite3WhereCodeOneLoopStart(pParse,v,pWInfo,ii,pLevel,notReady);
174992 int ii; /* Iterator variable for various purposes */
175011 for(ii=0; ii<nTC; ii++){
175012 if( aTC[ii].pRoot==pRoot ){
175013 nOvfl += aTC[ii].nOvfl;
175046 for(ii=0; ii<nToken && rc==SQLITE_OK; ii++){
175060 if( ii && pTC->nOvfl>=((nMinEst+(nLoad4/4)-1)/(nLoad4/4))*nDocSize ){
175073 if( ii<12 ) nLoad4 = nLoad4*4;
175075 if( ii==0 || (pTC->pPhrase->nToken>1 && ii!=nToken-1) ){
175094 if( ii==0 || nCount<nMinEst ) nMinEst = nCount;
175139 int ii;
175149 for(ii=0; rc==SQLITE_OK && ii<nOr; ii++){
175150 rc = fts3EvalSelectDeferred(pCsr, apOr[ii], aTC, nToken);
176972 int ii;
176973 for(ii=0; rc==SQLITE_OK; ii++){
176980 p = fts3ReallocOrFree(p, nSpace + ii*sizeof(Fts3PhraseToken));
176986 assert( nToken==ii );
176987 pToken = &((Fts3Phrase *)(&p[1]))->aToken[ii];
176996 nToken = ii+1;
177069 int ii;
177092 for(ii=0; ii<(int)(sizeof(aKeyword)/sizeof(struct Fts3Keyword)); ii++){
177093 const struct Fts3Keyword *pKey = &aKeyword[ii];
177143 for(ii=1; ii<nInput && zInput[ii]!='"'; ii++);
177144 *pnConsumed = (int)((zInput - z) + ii + 1);
177145 if( ii==nInput ){
177148 return getNextString(pParse, &zInput[1], ii-1, ppExpr);
177184 for(ii=0; ii<pParse->nCol; ii++){
177185 const char *zStr = pParse->azCol[ii];
177190 iCol = ii;
177850 int ii;
177884 for(ii=0; ii<nCol; ii++){
177885 azCol[ii] = (char *)sqlite3_value_text(argv[ii+2]);
181784 int ii;
181791 for(ii=0; rc==SQLITE_OK && ii<pMsr->nSegment; ii++){
181792 Fts3SegReader *pReader = pMsr->apSegment[ii];
192006 int ii;
192009 for(ii=0; ii<pRtree->nDim2; ii++){
192010 p += writeCoord(p, &pCell->aCoord[ii]);
192146 int ii = 0;
192151 readCoord(pData, &pCoord[ii]);
192152 readCoord(pData+4, &pCoord[ii+1]);
192154 ii += 2;
192155 }while( ii<pRtree->nDim2 );
192286 int ii;
192300 for(ii=0; ii<RTREE_CACHE_SZ; ii++) nodeRelease(pRtree, pCsr->aNode[ii]);
192545 int ii;
192548 for(ii=0; ii<nCell; ii++){
192549 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
192550 *piIndex = ii;
192625 int ii = 1 - pCur->bPoint;
192626 assert( ii==0 || ii==1 );
192628 if( pCur->aNode[ii]==0 ){
192630 id = ii ? pCur->aPoint[0].id : pCur->sPoint.id;
192631 *pRC = nodeAcquire(RTREE_OF_CURSOR(pCur), id, 0, &pCur->aNode[ii]);
192633 return pCur->aNode[ii];
192687 int ii;
192690 ii = (int)(pNew - pCur->aPoint) + 1;
192691 if( ii<RTREE_CACHE_SZ ){
192692 assert( pCur->aNode[ii]==0 );
192693 pCur->aNode[ii] = pCur->aNode[0];
192724 int ii;
192729 for(ii=0; ii<pCur->nPoint; ii++){
192730 if( ii>0 || pCur->bPoint ) printf(" ");
192731 tracePoint(&pCur->aPoint[ii], ii, pCur);
192797 int ii;
192812 for(ii=0; ii<nConstraint; ii++){
192813 RtreeConstraint *pConstraint = pCur->aConstraint + ii;
192834 for(ii=0; ii<pCur->nPoint; ii++){
192835 if( pCur->aPoint[ii].id==x.id ){
193020 int ii;
193072 for(ii=0; ii<argc; ii++){
193073 RtreeConstraint *p = &pCsr->aConstraint[ii];
193074 int eType = sqlite3_value_numeric_type(argv[ii]);
193075 p->op = idxStr[ii*2];
193076 p->iCoord = idxStr[ii*2+1]-'0';
193082 rc = deserializeGeometry(argv[ii], p);
193091 p->u.rValue = sqlite3_value_int64(argv[ii]);
193093 p->u.rValue = sqlite3_value_double(argv[ii]);
193165 int ii;
193177 for(ii=0; ii<pIdxInfo->nConstraint; ii++){
193178 if( pIdxInfo->aConstraint[ii].op==SQLITE_INDEX_CONSTRAINT_MATCH ){
193184 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
193185 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
193192 for(jj=0; jj<ii; jj++){
193197 pIdxInfo->aConstraintUsage[ii].argvIndex = 1;
193229 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
193230 pIdxInfo->aConstraintUsage[ii].omit = 1;
193283 int ii = pRtree->nDim2 - 2;
193285 margin += (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii]));
193286 ii -= 2;
193287 }while( ii>=0 );
193295 int ii = 0;
193298 p1->aCoord[ii].f = MIN(p1->aCoord[ii].f, p2->aCoord[ii].f);
193299 p1->aCoord[ii+1].f = MAX(p1->aCoord[ii+1].f, p2->aCoord[ii+1].f);
193300 ii += 2;
193301 }while( ii<pRtree->nDim2 );
193304 p1->aCoord[ii].i = MIN(p1->aCoord[ii].i, p2->aCoord[ii].i);
193305 p1->aCoord[ii+1].i = MAX(p1->aCoord[ii+1].i, p2->aCoord[ii+1].i);
193306 ii += 2;
193307 }while( ii<pRtree->nDim2 );
193316 int ii;
193318 for(ii=0; ii<pRtree->nDim2; ii+=2){
193319 RtreeCoord *a1 = &p1->aCoord[ii];
193320 RtreeCoord *a2 = &p2->aCoord[ii];
193348 int ii;
193350 for(ii=0; ii<nCell; ii++){
193355 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
193356 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
193381 int ii;
193385 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
193638 int ii;
193653 for(ii=0; ii<pRtree->nDim; ii++){
193655 aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];
193657 aaSorted[ii][jj] = jj;
193659 SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);
193662 for(ii=0; ii<pRtree->nDim; ii++){
193680 memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell));
193681 memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));
193684 cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]);
193686 cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]);
193703 if( ii==0 || margin<fBestMargin ){
193704 iBestDim = ii;
193712 for(ii=0; ii<nCell; ii++){
193713 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
193714 RtreeCell *pBbox = (ii<iBestSplit)?pBboxLeft:pBboxRight;
193715 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];
193979 int ii;
193983 for(ii=1; ii<nCell; ii++){
193985 nodeGetCell(pRtree, pNode, ii, &cell);
193989 rc = nodeParentIndex(pRtree, pNode, &ii);
193991 nodeOverwriteCell(pRtree, pParent, &box, ii);
194046 int ii;
194071 for(ii=0; ii<nCell; ii++){
194072 if( ii==(nCell-1) ){
194073 memcpy(&aCell[ii], pCell, sizeof(RtreeCell));
194075 nodeGetCell(pRtree, pNode, ii, &aCell[ii]);
194077 aOrder[ii] = ii;
194079 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);
194080 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);
194087 for(ii=0; ii<nCell; ii++){
194088 aDistance[ii] = RTREE_ZERO;
194090 RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -
194091 DCOORD(aCell[ii].aCoord[iDim*2]));
194092 aDistance[ii] += (coord-aCenterCoord[iDim])*(coord-aCenterCoord[iDim]);
194099 for(ii=0; rc==SQLITE_OK && ii<(nCell-(RTREE_MINCELLS(pRtree)+1)); ii++){
194100 RtreeCell *p = &aCell[aOrder[ii]];
194113 for(; rc==SQLITE_OK && ii<nCell; ii++){
194118 RtreeCell *p = &aCell[aOrder[ii]];
194174 int ii;
194178 for(ii=0; rc==SQLITE_OK && ii<nCell; ii++){
194181 nodeGetCell(pRtree, pNode, ii, &cell);
194415 int ii;
194430 for(ii=0; ii<nn; ii+=2){
194431 cell.aCoord[ii].f = rtreeValueDown(aData[ii+3]);
194432 cell.aCoord[ii+1].f = rtreeValueUp(aData[ii+4]);
194433 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){
194434 rc = rtreeConstraintError(pRtree, ii+1);
194441 for(ii=0; ii<nn; ii+=2){
194442 cell.aCoord[ii].i = sqlite3_value_int(aData[ii+3]);
194443 cell.aCoord[ii+1].i = sqlite3_value_int(aData[ii+4]);
194444 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){
194445 rc = rtreeConstraintError(pRtree, ii+1);
194714 int ii;
194718 for(ii=0; ii<pRtree->nAux; ii++){
194719 sqlite3_str_appendf(p,",a%d",ii);
194778 int ii;
194781 for(ii=0; ii<pRtree->nAux; ii++){
194782 if( ii ) sqlite3_str_append(p, ",", 1);
194783 if( ii<pRtree->nAuxNotNull ){
194784 sqlite3_str_appendf(p,"a%d=coalesce(?%d,a%d)",ii,ii+2,ii);
194786 sqlite3_str_appendf(p,"a%d=?%d",ii,ii+2);
194912 int ii = 4;
194955 for(ii=4; ii<argc; ii++){
194956 const char *zArg = argv[ii];
194973 }else if( ii<argc ){
195037 int ii;
195055 for(ii=0; ii<NCELL(&node); ii++){
195059 nodeGetCell(&tree, &node, ii, &cell);
195060 if( ii>0 ) sqlite3_str_append(pOut, " ", 1);
195272 i64 ii = sqlite3_column_int64(pStmt, 0);
195273 if( ii!=iVal ){
195276 iKey, ii, (bLeaf ? "%_rowid" : "%_parent"), iKey, iVal
195798 int ii = 0;
195812 while( geopolyParseNumber(&s, ii<=1 ? &s.a[s.nVertex*2+ii] : 0) ){
195813 ii++;
195814 if( ii==2 ) s.nVertex++;
195818 if( c==']' && ii>=2 ) break;
195892 int ii;
195893 for(ii=0; ii<nVertex; ii++){
195894 geopolySwab32((unsigned char*)&GeoX(p,ii));
195895 geopolySwab32((unsigned char*)&GeoY(p,ii));
196028 int ii;
196030 for(ii=0; ii<p->nVertex; ii++){
196031 x0 = GeoX(p,ii);
196032 y0 = GeoY(p,ii);
196035 GeoX(p,ii) = x1;
196036 GeoY(p,ii) = y1;
196053 int ii;
196054 for(ii=0; ii<p->nVertex-1; ii++){
196055 rArea += (GeoX(p,ii) - GeoX(p,ii+1)) /* (x0 - x1) */
196056 * (GeoY(p,ii) + GeoY(p,ii+1)) /* (y0 + y1) */
196059 rArea += (GeoX(p,ii) - GeoX(p,0)) /* (xN - x0) */
196060 * (GeoY(p,ii) + GeoY(p,0)) /* (yN + y0) */
196106 int ii, jj;
196107 for(ii=1, jj=p->nVertex-1; ii<jj; ii++, jj--){
196108 GeoCoord t = GeoX(p,ii);
196109 GeoX(p,ii) = GeoX(p,jj);
196111 t = GeoY(p,ii);
196112 GeoY(p,ii) = GeoY(p,jj);
196210 int ii;
196213 for(ii=1; ii<p->nVertex; ii++){
196214 double r = GeoX(p,ii);
196217 r = GeoY(p,ii);
196232 ii = 1;
196233 pOut->hdr[0] = *(unsigned char*)ⅈ
196381 int ii;
196383 for(ii=0; ii<p1->nVertex-1; ii++){
196384 v = pointBeneathLine(x0,y0,GeoX(p1,ii), GeoY(p1,ii),
196385 GeoX(p1,ii+1),GeoY(p1,ii+1));
196390 v = pointBeneathLine(x0,y0,GeoX(p1,ii), GeoY(p1,ii),
196799 int ii;
196830 for(ii=3; ii<argc; ii++){
196832 sqlite3_str_appendf(pSql, ",%s", argv[ii]);
197037 int ii;
197042 for(ii=0; ii<pIdxInfo->nConstraint; ii++){
197043 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
197046 iRowidTerm = ii;
197053 iFuncTerm = ii;
209167 int ii;
209179 for(ii=0; ii<pIter->nCol; ii++){
209180 if( sessionChangesetNew(pIter, ii) ){
209181 p->aUpdateMask[ii/32] |= (1<<(ii%32));
209235 for(ii=0; ii<pIter->nCol; ii++){
209236 if( p->abPK[ii]==0 && sessionChangesetNew(pIter, ii) ){
209238 sessionAppendIdent(&buf, p->azCol[ii], &rc);
209240 sessionAppendInteger(&buf, ii*2+1, &rc);
209248 for(ii=0; ii<pIter->nCol; ii++){
209249 if( p->abPK[ii] || (bPatchset==0 && sessionChangesetOld(pIter, ii)) ){
209251 if( bStat1 && ii==1 ){
209252 assert( sqlite3_stricmp(p->azCol[ii], "idx")==0 );
209259 sessionAppendIdent(&buf, p->azCol[ii], &rc);
209261 sessionAppendInteger(&buf, ii*2+2, &rc);
214539 int ii;
214551 for(ii=0; rc==SQLITE_OK && ii<nInst; ii++){
214557 rc = pApi->xInst(pFts, ii, &ip, &ic, &io);
215669 int ii = fts5Dequote(zOut);
215670 zRet = &zIn[ii];
217310 i64 ii = p->pIter->iRowid;
217311 if( ii==iRowid
217312 || (bFromValid && ii!=iFrom && (ii>iFrom)==pExpr->bDesc)
218409 int ii;
218423 for(ii=0; ii<nTerm; ii++){
218434 &pParse->rc, pNear->apPhrase[0]->aTerm[ii].zTerm, -1
218436 pRet->apChild[ii] = sqlite3Fts5ParseNode(pParse, FTS5_STRING,
218750 int ii;
218753 for(ii=0; ii<pColset->nCol; ii++){
218755 pConfig->azCol[pColset->aiCol[ii]], ii==pColset->nCol-1 ? "" : " "
221196 int ii;
221213 for(ii=iOff-1; ii>=pLvl->iFirstOff && a[ii]==0x00; ii--){
221216 if( ii>=pLvl->iFirstOff && (a[ii] & 0x80) ){
221219 ** bytes before a[ii]. */
221221 if( (ii-8)>=pLvl->iFirstOff ){
221223 for(j=1; j<=8 && (a[ii-j] & 0x80); j++);
225756 int ii;
225761 ii = pLeaf->szLeaf;
225762 while( ii<pLeaf->nn && p->rc==SQLITE_OK ){
225767 ii += fts5GetVarint32(&pLeaf->p[ii], nIncr);
230265 int ii;
230302 for(ii=0; rc==SQLITE_OK && ii<pCtx->pConfig->nPrefix; ii++){
230303 const int nChar = pCtx->pConfig->aPrefix[ii];
230306 rc = sqlite3Fts5TermsetAdd(pTermset, ii+1, pToken, nByte, &bPresent);
230309 pCtx->iRowid, iCol, iPos, ii+1, pToken, nByte
233677 int ii = FTS5_POS2COLUMN(iPos);
233678 if( iCol!=ii ){
233679 if( ii>=nCol ){
233683 pCsr->aDoc[ii]++;
233684 iCol = ii;
233686 pCsr->aCnt[ii]++;
233854 int ii = -1;
233856 ii = FTS5_POS2COLUMN(pCsr->iInstPos);
233858 ii = (int)pCsr->iInstPos;
233860 if( ii>=0 && ii<pCsr->pFts5->pConfig->nCol ){
233861 const char *z = pCsr->pFts5->pConfig->azCol[ii];
233869 int ii = FTS5_POS2OFFSET(pCsr->iInstPos);
233870 sqlite3_result_int(pCtx, ii);