Lines Matching refs:ii
16644 int ii; /* Loop counter */
16675 for(ii=0; ii<=LOGMAX; ii++){
16676 mem5.aiFreelist[ii] = -1;
16680 for(ii=LOGMAX; ii>=0; ii--){
16681 int nAlloc = (1<<ii);
16683 mem5.aCtrl[iOffset] = ii | CTRL_FREE;
16684 memsys5Link(iOffset, ii);
27865 int ii;
27870 for(ii=(int)strlen(zDirname); ii>1 && zDirname[ii]!='/'; ii--);
27871 if( ii>0 ){
27872 zDirname[ii] = '\0';
38879 int ii; /* Loop counter */
38891 for(ii=0; ii<pPager->nSavepoint; ii++){
38892 if( pPager->aSavepoint[ii].iHdrOffset==0 ){
38893 pPager->aSavepoint[ii].iHdrOffset = pPager->journalOff;
39211 int ii; /* Iterator for looping through Pager.aSavepoint */
39212 for(ii=0; ii<pPager->nSavepoint; ii++){
39213 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
39230 int ii; /* Loop counter */
39233 for(ii=0; ii<pPager->nSavepoint; ii++){
39234 PagerSavepoint *p = &pPager->aSavepoint[ii];
40777 u32 ii; /* Loop counter */
40793 for(ii=0; rc==SQLITE_OK && ii<nJRec && pPager->journalOff<szJ; ii++){
40805 u32 ii; /* Loop counter */
40811 for(ii=pSavepoint->iSubRec; rc==SQLITE_OK && ii<pPager->nSubRec; ii++){
40812 assert( offset==ii*(4+pPager->pageSize) );
41986 int ii;
41990 for(ii=szPageDflt; ii<=SQLITE_MAX_DEFAULT_PAGE_SIZE; ii=ii*2){
41991 if( iDc&(SQLITE_IOCAP_ATOMIC|(ii>>8)) ){
41992 szPageDflt = ii;
42983 int ii; /* Loop counter */
43012 for(ii=0; ii<nPage && rc==SQLITE_OK; ii++){
43013 Pgno pg = pg1+ii;
43042 for(ii=0; ii<nPage; ii++){
43043 PgHdr *pPage = pager_lookup(pPager, pg1+ii);
43646 int ii; /* Iterator variable */
43663 for(ii=nCurrent; ii<nSavepoint; ii++){
43664 aNew[ii].nOrig = pPager->dbSize;
43666 aNew[ii].iOffset = pPager->journalOff;
43668 aNew[ii].iOffset = JOURNAL_HDR_SZ(pPager);
43670 aNew[ii].iSubRec = pPager->nSubRec;
43671 aNew[ii].pInSavepoint = sqlite3BitvecCreate(pPager->dbSize);
43672 if( !aNew[ii].pInSavepoint ){
43676 sqlite3WalSavepoint(pPager->pWal, aNew[ii].aWalData);
43678 pPager->nSavepoint = ii+1;
43724 int ii; /* Iterator variable */
43732 for(ii=nNew; ii<pPager->nSavepoint; ii++){
43733 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
52627 int ii;
52628 for(ii=0; ii<pCur->iPage; ii++){
52629 assert( pCur->aiIdx[ii]==pCur->apPage[ii]->nCell );
56787 int ii; /* Iterator variable */
56831 for(ii=0; (nPage<0 || ii<nPage) && p->iNext<=(Pgno)nSrcPage && !rc; ii++){
63803 int ii;
63866 u16 ii;
66148 int ii;
66254 for(u.aq.ii=0; u.aq.ii<db->nDb; u.aq.ii++){
66255 rc = sqlite3BtreeSavepoint(db->aDb[u.aq.ii].pBt, u.aq.p1, u.aq.iSavepoint);
67207 u16 ii;
67232 for(u.bd.ii=0; u.bd.ii<u.bd.nField; u.bd.ii++){
67233 if( u.bd.aMx[u.bd.ii].flags & MEM_Null ){
90400 int ii;
90401 for(ii=0; ii<db->nDb; ii++){
90402 sqlite3BtreeSecureDelete(db->aDb[ii].pBt, b);
90464 int ii;
90466 for(ii=2; ii<db->nDb; ii++){
90467 pPager = sqlite3BtreePager(db->aDb[ii].pBt);
90493 int ii; /* Loop counter */
90525 for(ii=db->nDb-1; ii>=0; ii--){
90526 if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
90527 sqlite3VdbeUsesBtree(v, ii);
90528 sqlite3VdbeAddOp3(v, OP_JournalMode, ii, 1, eMode);
95165 int ii;
95166 for(ii=0; ii<p->pOrderBy->nExpr; ii++){
95167 if( p->pOrderBy->a[ii].iCol==0 ) return 0;
104606 int ii;
104656 for(ii=0; ii<pOrWc->nTerm; ii++){
104657 WhereTerm *pOrTerm = &pOrWc->a[ii];
104669 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
118116 int ii; /* Iterator variable for various purposes */
118126 for(ii=0; ii<nTC; ii++){
118127 if( aTC[ii].pRoot==pRoot ){
118128 nOvfl += aTC[ii].nOvfl;
118161 for(ii=0; ii<nToken && rc==SQLITE_OK; ii++){
118175 if( ii && pTC->nOvfl>=((nMinEst+(nLoad4/4)-1)/(nLoad4/4))*nDocSize ){
118186 if( ii==0 || pTC->pPhrase->nToken>1 ){
118201 if( ii==0 || nCount<nMinEst ) nMinEst = nCount;
118245 int ii;
118255 for(ii=0; rc==SQLITE_OK && ii<nOr; ii++){
118256 rc = fts3EvalSelectDeferred(pCsr, apOr[ii], aTC, nToken);
119798 int ii;
119800 for(ii=0; rc==SQLITE_OK; ii++){
119807 p = fts3ReallocOrFree(p, nSpace + ii*sizeof(Fts3PhraseToken));
119813 assert( nToken==ii );
119814 pToken = &((Fts3Phrase *)(&p[1]))->aToken[ii];
119822 nToken = ii+1;
119897 int ii;
119920 for(ii=0; ii<(int)(sizeof(aKeyword)/sizeof(struct Fts3Keyword)); ii++){
119921 const struct Fts3Keyword *pKey = &aKeyword[ii];
119995 for(ii=1; ii<nInput && zInput[ii]!='"'; ii++);
119996 *pnConsumed = (int)((zInput - z) + ii + 1);
119997 if( ii==nInput ){
120000 return getNextString(pParse, &zInput[1], ii-1, ppExpr);
120017 for(ii=0; ii<pParse->nCol; ii++){
120018 const char *zStr = pParse->azCol[ii];
120023 iCol = ii;
120428 int ii;
120466 for(ii=0; ii<nCol; ii++){
120467 azCol[ii] = (char *)sqlite3_value_text(argv[ii+2]);
123573 int ii;
123580 for(ii=0; rc==SQLITE_OK && ii<pMsr->nSegment; ii++){
123581 Fts3SegReader *pReader = pMsr->apSegment[ii];
127587 int ii;
127590 for(ii=0; ii<(pRtree->nDim*2); ii++){
127591 p += writeCoord(p, &pCell->aCoord[ii]);
127725 int ii;
127727 for(ii=0; ii<pRtree->nDim*2; ii++){
127728 nodeGetCoord(pRtree, pNode, iCell, ii, &pCell->aCoord[ii]);
127923 int ii;
127928 for(ii=0; bRes==0 && ii<pCursor->nConstraint; ii++){
127929 RtreeConstraint *p = &pCursor->aConstraint[ii];
127977 int ii;
127981 for(ii=0; ii<pCursor->nConstraint; ii++){
127982 RtreeConstraint *p = &pCursor->aConstraint[ii];
128028 int ii;
128055 for(ii=0; isEof && ii<NCELL(pChild); ii++){
128056 pCursor->iCell = ii;
128086 int ii;
128088 for(ii=0; ii<nCell; ii++){
128089 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
128090 *piIndex = ii;
128271 int ii;
128301 for(ii=0; ii<argc; ii++){
128302 RtreeConstraint *p = &pCsr->aConstraint[ii];
128303 p->op = idxStr[ii*2];
128304 p->iCoord = idxStr[ii*2+1]-'a';
128310 rc = deserializeGeometry(argv[ii], p);
128315 p->rValue = sqlite3_value_double(argv[ii]);
128385 int ii;
128393 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
128394 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
128399 for(jj=0; jj<ii; jj++){
128404 pIdxInfo->aConstraintUsage[ii].argvIndex = 1;
128431 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
128432 pIdxInfo->aConstraintUsage[ii].omit = 1;
128451 int ii;
128452 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
128453 area = (float)(area * (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii])));
128464 int ii;
128465 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
128466 margin += (float)(DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii]));
128475 int ii;
128477 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
128478 p1->aCoord[ii].f = MIN(p1->aCoord[ii].f, p2->aCoord[ii].f);
128479 p1->aCoord[ii+1].f = MAX(p1->aCoord[ii+1].f, p2->aCoord[ii+1].f);
128482 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
128483 p1->aCoord[ii].i = MIN(p1->aCoord[ii].i, p2->aCoord[ii].i);
128484 p1->aCoord[ii+1].i = MAX(p1->aCoord[ii+1].i, p2->aCoord[ii+1].i);
128494 int ii;
128496 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
128497 RtreeCoord *a1 = &p1->aCoord[ii];
128498 RtreeCoord *a2 = &p2->aCoord[ii];
128528 int ii;
128530 for(ii=0; ii<nCell; ii++){
128532 if( ii!=iExclude )
128544 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
128545 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
128591 int ii;
128595 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
128610 if( ii==(pRtree->iDepth-1) ){
128639 if( ii==(pRtree->iDepth-1) ){
128738 int ii;
128739 for(ii=0; aiUsed[ii]; ii++);
128740 aiUsed[ii] = 1;
128741 return &aCell[ii];
128822 int ii;
128823 for(ii=0; ii<nCell; ii++){
128824 if( aiUsed[ii]==0 ){
128825 float left = cellGrowth(pRtree, pLeftBox, &aCell[ii]);
128826 float right = cellGrowth(pRtree, pLeftBox, &aCell[ii]);
128830 iSelect = ii;
128849 int ii;
128856 for(ii=0; ii<nCell; ii++){
128857 for(jj=ii+1; jj<nCell; jj++){
128859 float growth = cellGrowth(pRtree, &aCell[ii], &aCell[jj]);
128863 iLeftSeed = ii;
129029 int ii;
129044 for(ii=0; ii<pRtree->nDim; ii++){
129046 aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];
129048 aaSorted[ii][jj] = jj;
129050 SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);
129053 for(ii=0; ii<pRtree->nDim; ii++){
129071 memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell));
129072 memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));
129075 cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]);
129077 cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]);
129094 if( ii==0 || margin<fBestMargin ){
129095 iBestDim = ii;
129103 for(ii=0; ii<nCell; ii++){
129104 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
129105 RtreeCell *pBbox = (ii<iBestSplit)?pBboxLeft:pBboxRight;
129106 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];
129422 int ii;
129426 for(ii=1; ii<nCell; ii++){
129428 nodeGetCell(pRtree, pNode, ii, &cell);
129432 rc = nodeParentIndex(pRtree, pNode, &ii);
129434 nodeOverwriteCell(pRtree, pParent, &box, ii);
129489 int ii;
129512 for(ii=0; ii<nCell; ii++){
129513 if( ii==(nCell-1) ){
129514 memcpy(&aCell[ii], pCell, sizeof(RtreeCell));
129516 nodeGetCell(pRtree, pNode, ii, &aCell[ii]);
129518 aOrder[ii] = ii;
129520 aCenterCoord[iDim] += (float)DCOORD(aCell[ii].aCoord[iDim*2]);
129521 aCenterCoord[iDim] += (float)DCOORD(aCell[ii].aCoord[iDim*2+1]);
129528 for(ii=0; ii<nCell; ii++){
129529 aDistance[ii] = 0.0;
129531 float coord = (float)(DCOORD(aCell[ii].aCoord[iDim*2+1]) -
129532 DCOORD(aCell[ii].aCoord[iDim*2]));
129533 aDistance[ii] += (coord-aCenterCoord[iDim])*(coord-aCenterCoord[iDim]);
129540 for(ii=0; rc==SQLITE_OK && ii<(nCell-(RTREE_MINCELLS(pRtree)+1)); ii++){
129541 RtreeCell *p = &aCell[aOrder[ii]];
129554 for(; rc==SQLITE_OK && ii<nCell; ii++){
129559 RtreeCell *p = &aCell[aOrder[ii]];
129619 int ii;
129623 for(ii=0; rc==SQLITE_OK && ii<nCell; ii++){
129626 nodeGetCell(pRtree, pNode, ii, &cell);
129770 int ii;
129775 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
129776 cell.aCoord[ii].f = (float)sqlite3_value_double(azData[ii+3]);
129777 cell.aCoord[ii+1].f = (float)sqlite3_value_double(azData[ii+4]);
129778 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){
129784 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
129785 cell.aCoord[ii].i = sqlite3_value_int(azData[ii+3]);
129786 cell.aCoord[ii+1].i = sqlite3_value_int(azData[ii+4]);
129787 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){
130113 int ii;
130114 for(ii=4; zSql && ii<argc; ii++){
130116 zSql = sqlite3_mprintf("%s, %s", zTmp, argv[ii]);
130162 int ii;
130171 for(ii=0; ii<NCELL(&node); ii++){
130177 nodeGetCell(&tree, &node, ii, &cell);