Lines Matching refs:ix

27711           int ix = (length - 1)%3 + 1;
27715 ix--;
27716 if( ix==0 ){
27719 ix = 3;
62710 u16 ix; /* Current index for apPage[iPage] */
67681 btreeParseCell(pCur->pPage, pCur->ix, &info);
67690 btreeParseCell(pCur->pPage,pCur->ix,&pCur->info);
67930 assert( pCur->ix<pPage->nCell );
68115 assert( pCur->ix<pCur->pPage->nCell );
68177 assert( pCur->ix<pCur->pPage->nCell );
68233 pCur->aiIdx[pCur->iPage] = pCur->ix;
68235 pCur->ix = 0;
68284 pCur->ix = pCur->aiIdx[pCur->iPage-1];
68371 pCur->ix = 0;
68406 assert( pCur->ix<pPage->nCell );
68407 pgno = get4byte(findCell(pPage, pCur->ix));
68432 pCur->ix = pPage->nCell;
68436 pCur->ix = pPage->nCell-1;
68483 assert( pCur->ix==pCur->pPage->nCell-1 );
68632 pCur->ix = (u16)idx;
68653 pCur->ix = (u16)idx;
68722 pCur->ix = (u16)idx;
68744 pCur->ix = (u16)idx;
68756 assert( pCur->ix<pCur->pPage->nCell );
68757 pCur->ix = (u16)idx;
68768 pCur->ix = (u16)lwr;
68861 idx = ++pCur->ix;
68893 }while( pCur->ix>=pPage->nCell );
68915 if( (++pCur->ix)>=pPage->nCell ){
68916 pCur->ix--;
68970 int idx = pCur->ix;
68975 while( pCur->ix==0 ){
68985 pCur->ix--;
69002 || pCur->ix==0
69007 pCur->ix--;
71497 pCur->ix = 0;
71877 idx = pCur->ix;
71911 idx = ++pCur->ix;
72016 iCellIdx = pCur->ix;
72147 pCur->ix = pPage->nCell-1;
72665 }while ( pCur->ix>=pCur->pPage->nCell );
72667 pCur->ix++;
72674 iIdx = pCur->ix;
75033 i64 ix;
75039 ix = doubleToInt64(pMem->u.r);
75051 if( pMem->u.r==ix && ix>SMALLEST_INT64 && ix<LARGEST_INT64 ){
75052 pMem->u.i = ix;
117750 int ix; /* Index loop counter */
118068 for(ix=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, ix++){
118074 if( aRegIdx[ix]==0 ) continue; /* Skip indices that do not change */
118088 iThisCur = iIdxCur+ix;
118093 sqlite3VdbeAddOp2(v, OP_Null, 0, aRegIdx[ix]);
118103 regIdx = aRegIdx[ix]+1;
118122 sqlite3VdbeAddOp3(v, OP_MakeRecord, regIdx, pIdx->nColumn, aRegIdx[ix]);
118171 if( (ix==0 && pIdx->pNext==0) /* Condition 3 */
118260 sqlite3UpsertDoUpdate(pParse, pUpsert, pTab, pIdx, iIdxCur+ix);
135956 int ix[BMS]; /* Cursor assigned to each bit */
140241 if( pMaskSet->ix[i]==iCursor ){
140257 assert( pMaskSet->n < ArraySize(pMaskSet->ix) );
140258 pMaskSet->ix[pMaskSet->n++] = iCursor;
144481 assert( pWInfo->sMaskSet.n==1 && iCur==pWInfo->sMaskSet.ix[0] );