Lines Matching refs:ii
18978 int ii; /* Loop counter */ in memsys5Init() local
19009 for(ii=0; ii<=LOGMAX; ii++){ in memsys5Init()
19010 mem5.aiFreelist[ii] = -1; in memsys5Init()
19014 for(ii=LOGMAX; ii>=0; ii--){ in memsys5Init()
19015 int nAlloc = (1<<ii); in memsys5Init()
19017 mem5.aCtrl[iOffset] = ii | CTRL_FREE; in memsys5Init()
19018 memsys5Link(iOffset, ii); in memsys5Init()
28979 int ii;
28984 for(ii=(int)strlen(zDirname); ii>1 && zDirname[ii]!='/'; ii--);
28985 if( ii>0 ){
28986 zDirname[ii] = '\0';
43010 int ii; /* Loop counter */
43022 for(ii=0; ii<pPager->nSavepoint; ii++){
43023 if( pPager->aSavepoint[ii].iHdrOffset==0 ){
43024 pPager->aSavepoint[ii].iHdrOffset = pPager->journalOff;
43335 int ii; /* Iterator for looping through Pager.aSavepoint */
43336 for(ii=0; ii<pPager->nSavepoint; ii++){
43337 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
43354 int ii; /* Loop counter */
43357 for(ii=0; ii<pPager->nSavepoint; ii++){
43358 PagerSavepoint *p = &pPager->aSavepoint[ii];
44959 u32 ii; /* Loop counter */
44975 for(ii=0; rc==SQLITE_OK && ii<nJRec && pPager->journalOff<szJ; ii++){
44987 u32 ii; /* Loop counter */
44993 for(ii=pSavepoint->iSubRec; rc==SQLITE_OK && ii<pPager->nSubRec; ii++){
44994 assert( offset==(i64)ii*(4+pPager->pageSize) );
46326 int ii;
46330 for(ii=szPageDflt; ii<=SQLITE_MAX_DEFAULT_PAGE_SIZE; ii=ii*2){
46331 if( iDc&(SQLITE_IOCAP_ATOMIC|(ii>>8)) ){
46332 szPageDflt = ii;
47431 int ii; /* Loop counter */
47462 for(ii=0; ii<nPage && rc==SQLITE_OK; ii++){
47463 Pgno pg = pg1+ii;
47492 for(ii=0; ii<nPage; ii++){
47493 PgHdr *pPage = sqlite3PagerLookup(pPager, pg1+ii);
48125 int ii; /* Iterator variable */
48142 for(ii=nCurrent; ii<nSavepoint; ii++){
48143 aNew[ii].nOrig = pPager->dbSize;
48145 aNew[ii].iOffset = pPager->journalOff;
48147 aNew[ii].iOffset = JOURNAL_HDR_SZ(pPager);
48149 aNew[ii].iSubRec = pPager->nSubRec;
48150 aNew[ii].pInSavepoint = sqlite3BitvecCreate(pPager->dbSize);
48151 if( !aNew[ii].pInSavepoint ){
48155 sqlite3WalSavepoint(pPager->pWal, aNew[ii].aWalData);
48157 pPager->nSavepoint = ii+1;
48203 int ii; /* Iterator variable */
48211 for(ii=nNew; ii<pPager->nSavepoint; ii++){
48212 sqlite3BitvecDestroy(pPager->aSavepoint[ii].pInSavepoint);
57804 int ii;
57805 for(ii=0; ii<pCur->iPage; ii++){
57806 assert( pCur->aiIdx[ii]==pCur->apPage[ii]->nCell );
62672 int ii; /* Iterator variable */
62716 for(ii=0; (nPage<0 || ii<nPage) && p->iNext<=(Pgno)nSrcPage && !rc; ii++){
65766 int ii, jj;
65773 for(ii=jj=0; jj<nTemp-1 && (c = zSynopsis[ii])!=0; ii++){
65775 c = zSynopsis[++ii];
65785 if( strncmp(zSynopsis+ii+1, "@P", 2)==0 ){
65786 ii += 3;
65788 v2 = translateP(zSynopsis[ii], pOp);
65789 if( strncmp(zSynopsis+ii+1,"+1",2)==0 ){
65790 ii += 2;
65796 }else if( strncmp(zSynopsis+ii+1, "..P3", 4)==0 && pOp->p3==0 ){
65797 ii += 4;
73608 int ii;
73714 for(ii=0; ii<db->nDb; ii++){
73715 rc = sqlite3BtreeTripAllCursors(db->aDb[ii].pBt,
73723 for(ii=0; ii<db->nDb; ii++){
73724 rc = sqlite3BtreeSavepoint(db->aDb[ii].pBt, p1, iSavepoint);
74676 int ii;
74703 for(ii=0; ii<r.nField; ii++){
74704 assert( memIsValid(&r.aMem[ii]) );
74705 ExpandBlob(&r.aMem[ii]);
74707 if( ii ) REGISTER_TRACE(pOp->p3+ii, &r.aMem[ii]);
74726 for(ii=0; ii<pIdxKey->nField; ii++){
74727 if( pIdxKey->aMem[ii].flags & MEM_Null ){
84908 int ii;
84914 for(ii=0; ii<pList->nExpr; ii++){
84915 r2 = sqlite3ExprCodeTemp(pParse, pList->a[ii].pExpr, ®ToFree);
84916 if( regCkNull && sqlite3ExprCanBeNull(pList->a[ii].pExpr) ){
84919 if( ii<pList->nExpr-1 || destIfNull!=destIfFalse ){
84922 VdbeCoverageIf(v, ii<pList->nExpr-1);
84923 VdbeCoverageIf(v, ii==pList->nExpr-1);
102789 int ii;
102822 for(ii=0; ii<ArraySize(azEndings) && handle==0; ii++){
102823 char *zAltFile = sqlite3_mprintf("%s.%s", zFile, azEndings[ii]);
104070 int ii;
104071 for(ii=0; ii<db->nDb; ii++){
104072 sqlite3BtreeSecureDelete(db->aDb[ii].pBt, b);
104138 int ii;
104140 for(ii=2; ii<db->nDb; ii++){
104141 pPager = sqlite3BtreePager(db->aDb[ii].pBt);
104169 int ii; /* Loop counter */
104195 for(ii=db->nDb-1; ii>=0; ii--){
104196 if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
104197 sqlite3VdbeUsesBtree(v, ii);
104198 sqlite3VdbeAddOp3(v, OP_JournalMode, ii, 1, eMode);
104342 int ii;
104346 for(ii=db->nDb-1; ii>=0; ii--){
104347 if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
104348 sqlite3BtreeSetMmapLimit(db->aDb[ii].pBt, sz);
109915 int ii;
109916 for(ii=0; ii<p->pOrderBy->nExpr; ii++){
109917 if( p->pOrderBy->a[ii].u.x.iOrderByCol==0 ) return 0;
119978 int ii; /* Loop counter */
120078 for(ii=0; ii<pOrWc->nTerm; ii++){
120079 WhereTerm *pOrTerm = &pOrWc->a[ii];
120107 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
120179 && (ii==0 || pSubLoop->u.btree.pIndex==pCov)
121149 int ii, jj;
121153 for(ii=0; ii<pOB->nExpr; ii++){
121154 Expr *pExpr = sqlite3ExprSkipCollate(pOB->a[ii].pExpr);
122120 int ii, jj; /* Loop counters */
122166 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
122205 for(ii=0, pFrom=aFrom; ii<nFrom; ii++, pFrom++){
122363 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){
122391 for(ii=1; ii<nFrom; ii++){
122392 if( pFrom->rCost>aFrom[ii].rCost ) pFrom = &aFrom[ii];
122638 int ii; /* Loop counter */
122717 for(ii=0; ii<sWLB.pWC->nTerm; ii++){
122718 if( nTabList==0 || sqlite3ExprIsConstantNotJoin(sWLB.pWC->a[ii].pExpr) ){
122719 sqlite3ExprIfFalse(pParse, sWLB.pWC->a[ii].pExpr, pWInfo->iBreak,
122721 sWLB.pWC->a[ii].wtFlags |= TERM_CODED;
122750 for(ii=0; ii<pTabList->nSrc; ii++){
122751 createMask(pMaskSet, pTabList->a[ii].iCursor);
122756 for(ii=0; ii<pTabList->nSrc; ii++){
122757 Bitmask m = getMask(pMaskSet, pTabList->a[ii].iCursor);
122849 for(ii=0; ii<pWInfo->nLevel; ii++){
122850 whereLoopPrint(pWInfo->a[ii].pWLoop, sWLB.pWC);
122906 for(ii=0, pLevel=pWInfo->a; ii<nTabList; ii++, pLevel++){
123004 for(ii=0; ii<nTabList; ii++){
123007 pLevel = &pWInfo->a[ii];
123017 pParse, pTabList, pLevel, ii, pLevel->iFrom, wctrlFlags
123020 notReady = codeOneLoopStart(pWInfo, ii, notReady);
137794 int ii; /* Iterator variable for various purposes */
137813 for(ii=0; ii<nTC; ii++){
137814 if( aTC[ii].pRoot==pRoot ){
137815 nOvfl += aTC[ii].nOvfl;
137848 for(ii=0; ii<nToken && rc==SQLITE_OK; ii++){
137862 if( ii && pTC->nOvfl>=((nMinEst+(nLoad4/4)-1)/(nLoad4/4))*nDocSize ){
137875 if( ii<12 ) nLoad4 = nLoad4*4;
137877 if( ii==0 || (pTC->pPhrase->nToken>1 && ii!=nToken-1) ){
137896 if( ii==0 || nCount<nMinEst ) nMinEst = nCount;
137941 int ii;
137951 for(ii=0; rc==SQLITE_OK && ii<nOr; ii++){
137952 rc = fts3EvalSelectDeferred(pCsr, apOr[ii], aTC, nToken);
139753 int ii;
139754 for(ii=0; rc==SQLITE_OK; ii++){
139761 p = fts3ReallocOrFree(p, nSpace + ii*sizeof(Fts3PhraseToken));
139767 assert( nToken==ii );
139768 pToken = &((Fts3Phrase *)(&p[1]))->aToken[ii];
139777 nToken = ii+1;
139850 int ii;
139873 for(ii=0; ii<(int)(sizeof(aKeyword)/sizeof(struct Fts3Keyword)); ii++){
139874 const struct Fts3Keyword *pKey = &aKeyword[ii];
139927 for(ii=1; ii<nInput && zInput[ii]!='"'; ii++);
139928 *pnConsumed = (int)((zInput - z) + ii + 1);
139929 if( ii==nInput ){
139932 return getNextString(pParse, &zInput[1], ii-1, ppExpr);
139964 for(ii=0; ii<pParse->nCol; ii++){
139965 const char *zStr = pParse->azCol[ii];
139970 iCol = ii;
140632 int ii;
140670 for(ii=0; ii<nCol; ii++){
140671 azCol[ii] = (char *)sqlite3_value_text(argv[ii+2]);
144494 int ii;
144501 for(ii=0; rc==SQLITE_OK && ii<pMsr->nSegment; ii++){
144502 Fts3SegReader *pReader = pMsr->apSegment[ii];
151571 int ii;
151574 for(ii=0; ii<(pRtree->nDim*2); ii++){
151575 p += writeCoord(p, &pCell->aCoord[ii]);
151708 int ii;
151712 for(ii=0; ii<pRtree->nDim*2; ii++){
151713 readCoord(&pData[ii*4], &pCoord[ii]);
151855 int ii;
151859 for(ii=0; ii<RTREE_CACHE_SZ; ii++) nodeRelease(pRtree, pCsr->aNode[ii]);
152042 int ii;
152045 for(ii=0; ii<nCell; ii++){
152046 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
152047 *piIndex = ii;
152121 int ii = 1 - pCur->bPoint;
152122 assert( ii==0 || ii==1 );
152124 if( pCur->aNode[ii]==0 ){
152126 id = ii ? pCur->aPoint[0].id : pCur->sPoint.id;
152127 *pRC = nodeAcquire(RTREE_OF_CURSOR(pCur), id, 0, &pCur->aNode[ii]);
152129 return pCur->aNode[ii];
152183 int ii;
152186 ii = (int)(pNew - pCur->aPoint) + 1;
152187 if( ii<RTREE_CACHE_SZ ){
152188 assert( pCur->aNode[ii]==0 );
152189 pCur->aNode[ii] = pCur->aNode[0];
152220 int ii;
152225 for(ii=0; ii<pCur->nPoint; ii++){
152226 if( ii>0 || pCur->bPoint ) printf(" ");
152227 tracePoint(&pCur->aPoint[ii], ii, pCur);
152293 int ii;
152307 for(ii=0; ii<nConstraint; ii++){
152308 RtreeConstraint *pConstraint = pCur->aConstraint + ii;
152498 int ii;
152545 for(ii=0; ii<argc; ii++){
152546 RtreeConstraint *p = &pCsr->aConstraint[ii];
152547 p->op = idxStr[ii*2];
152548 p->iCoord = idxStr[ii*2+1]-'0';
152554 rc = deserializeGeometry(argv[ii], p);
152563 p->u.rValue = sqlite3_value_int64(argv[ii]);
152565 p->u.rValue = sqlite3_value_double(argv[ii]);
152641 int ii;
152649 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
152650 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
152655 for(jj=0; jj<ii; jj++){
152660 pIdxInfo->aConstraintUsage[ii].argvIndex = 1;
152689 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
152690 pIdxInfo->aConstraintUsage[ii].omit = 1;
152712 int ii;
152713 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
152714 area = (area * (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii])));
152725 int ii;
152726 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
152727 margin += (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii]));
152736 int ii;
152738 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
152739 p1->aCoord[ii].f = MIN(p1->aCoord[ii].f, p2->aCoord[ii].f);
152740 p1->aCoord[ii+1].f = MAX(p1->aCoord[ii+1].f, p2->aCoord[ii+1].f);
152743 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
152744 p1->aCoord[ii].i = MIN(p1->aCoord[ii].i, p2->aCoord[ii].i);
152745 p1->aCoord[ii+1].i = MAX(p1->aCoord[ii+1].i, p2->aCoord[ii+1].i);
152755 int ii;
152757 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
152758 RtreeCoord *a1 = &p1->aCoord[ii];
152759 RtreeCoord *a2 = &p2->aCoord[ii];
152787 int ii;
152789 for(ii=0; ii<nCell; ii++){
152794 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
152795 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
152820 int ii;
152824 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
153075 int ii;
153090 for(ii=0; ii<pRtree->nDim; ii++){
153092 aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];
153094 aaSorted[ii][jj] = jj;
153096 SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);
153099 for(ii=0; ii<pRtree->nDim; ii++){
153117 memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell));
153118 memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));
153121 cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]);
153123 cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]);
153140 if( ii==0 || margin<fBestMargin ){
153141 iBestDim = ii;
153149 for(ii=0; ii<nCell; ii++){
153150 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
153151 RtreeCell *pBbox = (ii<iBestSplit)?pBboxLeft:pBboxRight;
153152 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];
153413 int ii;
153417 for(ii=1; ii<nCell; ii++){
153419 nodeGetCell(pRtree, pNode, ii, &cell);
153423 rc = nodeParentIndex(pRtree, pNode, &ii);
153425 nodeOverwriteCell(pRtree, pParent, &box, ii);
153480 int ii;
153505 for(ii=0; ii<nCell; ii++){
153506 if( ii==(nCell-1) ){
153507 memcpy(&aCell[ii], pCell, sizeof(RtreeCell));
153509 nodeGetCell(pRtree, pNode, ii, &aCell[ii]);
153511 aOrder[ii] = ii;
153513 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);
153514 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);
153521 for(ii=0; ii<nCell; ii++){
153522 aDistance[ii] = RTREE_ZERO;
153524 RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -
153525 DCOORD(aCell[ii].aCoord[iDim*2]));
153526 aDistance[ii] += (coord-aCenterCoord[iDim])*(coord-aCenterCoord[iDim]);
153533 for(ii=0; rc==SQLITE_OK && ii<(nCell-(RTREE_MINCELLS(pRtree)+1)); ii++){
153534 RtreeCell *p = &aCell[aOrder[ii]];
153547 for(; rc==SQLITE_OK && ii<nCell; ii++){
153552 RtreeCell *p = &aCell[aOrder[ii]];
153608 int ii;
153612 for(ii=0; rc==SQLITE_OK && ii<nCell; ii++){
153615 nodeGetCell(pRtree, pNode, ii, &cell);
153791 int ii;
153805 for(ii=0; ii<nData-4; ii+=2){
153806 cell.aCoord[ii].f = rtreeValueDown(azData[ii+3]);
153807 cell.aCoord[ii+1].f = rtreeValueUp(azData[ii+4]);
153808 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){
153816 for(ii=0; ii<nData-4; ii+=2){
153817 cell.aCoord[ii].i = sqlite3_value_int(azData[ii+3]);
153818 cell.aCoord[ii+1].i = sqlite3_value_int(azData[ii+4]);
153819 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){
154190 int ii;
154191 for(ii=4; zSql && ii<argc; ii++){
154193 zSql = sqlite3_mprintf("%s, %s", zTmp, argv[ii]);
154241 int ii;
154250 for(ii=0; ii<NCELL(&node); ii++){
154256 nodeGetCell(&tree, &node, ii, &cell);
