Lines Matching defs:iKey
40023 unsigned int iKey; /* Key value (page number) */
40334 unsigned int h = pPage->iKey % nNew;
40393 h = pPage->iKey % pCache->nHash;
40434 if( pPage->iKey>=iLimit ){
40602 unsigned int iKey,
40663 unsigned int h = iKey % pCache->nHash;
40665 pPage->iKey = iKey;
40673 if( iKey>pCache->iMaxKey ){
40674 pCache->iMaxKey = iKey;
40736 unsigned int iKey,
40751 pPage = pCache->apHash[iKey % pCache->nHash];
40752 while( pPage && pPage->iKey!=iKey ){ pPage = pPage->pNext; }
40759 pPage = pcache1FetchStage2(pCache, iKey, createFlag);
40761 assert( pPage==0 || pCache->iMaxKey>=iKey );
40824 assert( pPage->iKey==iOld );
40837 pPage->iKey = iNew;
49100 ** To look for page P in the hash table, first compute a hash iKey on
49103 ** iKey = (P * 383) % HASHTABLE_NSLOT
49105 ** Then start scanning entries of the hash table, starting with iKey
49108 ** be at index iUnused. (iUnused might be less than iKey if there was
49111 ** iMax be the value between iKey and iUnused, closest to iUnused,
49858 int iKey; /* Hash key */
49860 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
49861 if( aHash[iKey]==i ) break;
49863 assert( aHash[iKey]==i );
49886 int iKey; /* Hash table key */
49914 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
49918 aHash[iKey] = (ht_slot)idx;
49939 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
49940 if( aHash[iKey]==i ) break;
49942 assert( aHash[iKey]==i );
51295 ** slot (aHash[iKey]) may have been added before or after the
51317 int iKey; /* Hash slot index */
51326 for(iKey=walHash(pgno); aHash[iKey]; iKey=walNextHash(iKey)){
51327 u32 iFrame = aHash[iKey] + iZero;
51328 if( iFrame<=iLast && aPgno[aHash[iKey]]==pgno ){
74441 i64 iKey; /* The rowid we are to seek to */
74482 iKey = sqlite3VdbeIntValue(pIn3);
74494 /* If the approximation iKey is larger than the actual real search
74501 if( pIn3->u.r<(double)iKey ){
74508 /* If the approximation iKey is smaller than the actual real search
74510 else if( pIn3->u.r>(double)iKey ){
74517 rc = sqlite3BtreeMovetoUnpacked(pC->pCursor, 0, (u64)iKey, 0, &res);
74518 pC->movetoTarget = iKey; /* Used by OP_Delete */
74775 u64 iKey;
74790 iKey = pIn3->u.i;
74791 rc = sqlite3BtreeMovetoUnpacked(pCrsr, 0, iKey, 0, &res);
74792 pC->movetoTarget = iKey; /* Used by OP_Delete */
75003 i64 iKey; /* The integer ROWID or key for the record to be inserted */
75026 iKey = pKey->u.i;
75029 iKey = pOp->p3;
75033 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = lastRowid = iKey;
75046 rc = sqlite3BtreeInsert(pC->pCursor, 0, iKey,
75059 db->xUpdateCallback(db->pUpdateArg, op, zDb, zTbl, iKey);
75099 i64 iKey = 0;
75100 sqlite3BtreeKeySize(pC->pCursor, &iKey);
75101 assert( pC->movetoTarget==iKey );
95828 int iKey; /* Memory cell holding key of row to be deleted */
96001 iKey = iPk;
96003 iKey = pParse->nMem + 1;
96004 iKey = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iTabCur, iKey, 0);
96005 if( iKey>pParse->nMem ) pParse->nMem = iKey;
96027 iKey = ++pParse->nMem;
96029 sqlite3VdbeAddOp4(v, OP_MakeRecord, iPk, nPk, iKey,
96031 sqlite3VdbeAddOp2(v, OP_IdxInsert, iEphCur, iKey);
96035 sqlite3VdbeAddOp2(v, OP_RowSetAdd, iRowSet, iKey);
96069 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
96074 sqlite3VdbeAddOp2(v, OP_RowKey, iEphCur, iKey);
96077 addrLoop = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, 0, iKey);
96087 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iKey, pVTab, P4_VTAB);
96095 iKey, nKey, count, OE_Default, okOnePass);
99025 int iKey;
99026 for(iKey=0; iKey<pTab->nCol; iKey++){
99027 if( aChange[iKey]>=0 || (iKey==pTab->iPKey && bChngRowid) ){
99028 Column *pCol = &pTab->aCol[iKey];
104911 int iKey = pFK->aCol[0].iFrom;
104912 assert( iKey>=0 && iKey<pTab->nCol );
104913 if( iKey!=pTab->iPKey ){
104914 sqlite3VdbeAddOp3(v, OP_Column, 0, iKey, regRow);
104915 sqlite3ColumnDefault(v, pTab, iKey, regRow);
