Lines Matching defs:iKey
40041 unsigned int iKey; /* Key value (page number) */
40352 unsigned int h = pPage->iKey % nNew;
40411 h = pPage->iKey % pCache->nHash;
40452 if( pPage->iKey>=iLimit ){
40620 unsigned int iKey,
40681 unsigned int h = iKey % pCache->nHash;
40683 pPage->iKey = iKey;
40691 if( iKey>pCache->iMaxKey ){
40692 pCache->iMaxKey = iKey;
40754 unsigned int iKey,
40769 pPage = pCache->apHash[iKey % pCache->nHash];
40770 while( pPage && pPage->iKey!=iKey ){ pPage = pPage->pNext; }
40777 pPage = pcache1FetchStage2(pCache, iKey, createFlag);
40779 assert( pPage==0 || pCache->iMaxKey>=iKey );
40842 assert( pPage->iKey==iOld );
40855 pPage->iKey = iNew;
49118 ** To look for page P in the hash table, first compute a hash iKey on
49121 ** iKey = (P * 383) % HASHTABLE_NSLOT
49123 ** Then start scanning entries of the hash table, starting with iKey
49126 ** be at index iUnused. (iUnused might be less than iKey if there was
49129 ** iMax be the value between iKey and iUnused, closest to iUnused,
49876 int iKey; /* Hash key */
49878 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
49879 if( aHash[iKey]==i ) break;
49881 assert( aHash[iKey]==i );
49904 int iKey; /* Hash table key */
49932 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
49936 aHash[iKey] = (ht_slot)idx;
49957 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
49958 if( aHash[iKey]==i ) break;
49960 assert( aHash[iKey]==i );
51313 ** slot (aHash[iKey]) may have been added before or after the
51335 int iKey; /* Hash slot index */
51344 for(iKey=walHash(pgno); aHash[iKey]; iKey=walNextHash(iKey)){
51345 u32 iFrame = aHash[iKey] + iZero;
51346 if( iFrame<=iLast && aPgno[aHash[iKey]]==pgno ){
74459 i64 iKey; /* The rowid we are to seek to */
74500 iKey = sqlite3VdbeIntValue(pIn3);
74512 /* If the approximation iKey is larger than the actual real search
74519 if( pIn3->u.r<(double)iKey ){
74526 /* If the approximation iKey is smaller than the actual real search
74528 else if( pIn3->u.r>(double)iKey ){
74535 rc = sqlite3BtreeMovetoUnpacked(pC->pCursor, 0, (u64)iKey, 0, &res);
74536 pC->movetoTarget = iKey; /* Used by OP_Delete */
74793 u64 iKey;
74808 iKey = pIn3->u.i;
74809 rc = sqlite3BtreeMovetoUnpacked(pCrsr, 0, iKey, 0, &res);
74810 pC->movetoTarget = iKey; /* Used by OP_Delete */
75021 i64 iKey; /* The integer ROWID or key for the record to be inserted */
75044 iKey = pKey->u.i;
75047 iKey = pOp->p3;
75051 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = lastRowid = iKey;
75064 rc = sqlite3BtreeInsert(pC->pCursor, 0, iKey,
75077 db->xUpdateCallback(db->pUpdateArg, op, zDb, zTbl, iKey);
75117 i64 iKey = 0;
75118 sqlite3BtreeKeySize(pC->pCursor, &iKey);
75119 assert( pC->movetoTarget==iKey );
95846 int iKey; /* Memory cell holding key of row to be deleted */
96019 iKey = iPk;
96021 iKey = pParse->nMem + 1;
96022 iKey = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iTabCur, iKey, 0);
96023 if( iKey>pParse->nMem ) pParse->nMem = iKey;
96045 iKey = ++pParse->nMem;
96047 sqlite3VdbeAddOp4(v, OP_MakeRecord, iPk, nPk, iKey,
96049 sqlite3VdbeAddOp2(v, OP_IdxInsert, iEphCur, iKey);
96053 sqlite3VdbeAddOp2(v, OP_RowSetAdd, iRowSet, iKey);
96087 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
96092 sqlite3VdbeAddOp2(v, OP_RowKey, iEphCur, iKey);
96095 addrLoop = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, 0, iKey);
96105 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iKey, pVTab, P4_VTAB);
96113 iKey, nKey, count, OE_Default, okOnePass);
99043 int iKey;
99044 for(iKey=0; iKey<pTab->nCol; iKey++){
99045 if( aChange[iKey]>=0 || (iKey==pTab->iPKey && bChngRowid) ){
99046 Column *pCol = &pTab->aCol[iKey];
104929 int iKey = pFK->aCol[0].iFrom;
104930 assert( iKey>=0 && iKey<pTab->nCol );
104931 if( iKey!=pTab->iPKey ){
104932 sqlite3VdbeAddOp3(v, OP_Column, 0, iKey, regRow);
104933 sqlite3ColumnDefault(v, pTab, iKey, regRow);
