Lines Matching defs:iKey

35929   unsigned int iKey;             /* Key value (page number) */
36413 unsigned int h = pPage->iKey % nNew;
36476 h = pPage->iKey % pCache->nHash;
36516 if( pPage->iKey>=iLimit ){
36697 static void *pcache1Fetch(sqlite3_pcache *p, unsigned int iKey, int createFlag){
36711 unsigned int h = iKey % pCache->nHash;
36712 for(pPage=pCache->apHash[h]; pPage&&pPage->iKey!=iKey; pPage=pPage->pNext);
36779 unsigned int h = iKey % pCache->nHash;
36781 pPage->iKey = iKey;
36791 if( pPage && iKey>pCache->iMaxKey ){
36792 pCache->iMaxKey = iKey;
36850 assert( pPage->iKey==iOld );
36863 pPage->iKey = iNew;
44566 ** To look for page P in the hash table, first compute a hash iKey on
44569 ** iKey = (P * 383) % HASHTABLE_NSLOT
44571 ** Then start scanning entries of the hash table, starting with iKey
44574 ** be at index iUnused. (iUnused might be less than iKey if there was
44577 ** iMax be the value between iKey and iUnused, closest to iUnused,
45318 int iKey; /* Hash key */
45320 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
45321 if( aHash[iKey]==i ) break;
45323 assert( aHash[iKey]==i );
45346 int iKey; /* Hash table key */
45374 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
45378 aHash[iKey] = (ht_slot)idx;
45399 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
45400 if( aHash[iKey]==i ) break;
45402 assert( aHash[iKey]==i );
46648 ** slot (aHash[iKey]) may have been added before or after the
46670 int iKey; /* Hash slot index */
46679 for(iKey=walHash(pgno); aHash[iKey]; iKey=walNextHash(iKey)){
46680 u32 iFrame = aHash[iKey] + iZero;
46681 if( iFrame<=iLast && aPgno[aHash[iKey]]==pgno ){
63851 i64 iKey; /* The rowid we are to seek to */
63878 u64 iKey;
63891 i64 iKey; /* The integer ROWID or key for the record to be inserted */
63900 i64 iKey;
66919 i64 iKey; /* The rowid we are to seek to */
66940 u.ba.iKey = sqlite3VdbeIntValue(pIn3);
66956 if( u.ba.iKey==SMALLEST_INT64 && (pIn3->r<(double)u.ba.iKey || pIn3->r>0) ){
66977 if( pIn3->r > (double)u.ba.iKey ) u.ba.iKey++;
66981 if( pIn3->r < (double)u.ba.iKey ) u.ba.iKey--;
66984 rc = sqlite3BtreeMovetoUnpacked(u.ba.pC->pCursor, 0, (u64)u.ba.iKey, 0, &u.ba.res);
66990 u.ba.pC->lastRowid = u.ba.iKey;
67287 u64 iKey;
67300 u.be.iKey = pIn3->u.i;
67301 rc = sqlite3BtreeMovetoUnpacked(u.be.pCrsr, 0, u.be.iKey, 0, &u.be.res);
67538 i64 iKey; /* The integer ROWID or key for the record to be inserted */
67562 u.bg.iKey = u.bg.pKey->u.i;
67565 u.bg.iKey = pOp->p3;
67569 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = lastRowid = u.bg.iKey;
67583 rc = sqlite3BtreeInsert(u.bg.pC->pCursor, 0, u.bg.iKey,
67597 db->xUpdateCallback(db->pUpdateArg, u.bg.op, u.bg.zDb, u.bg.zTbl, u.bg.iKey);
67625 i64 iKey;
67629 u.bh.iKey = 0;
67635 /* If the update-hook will be invoked, set u.bh.iKey to the rowid of the
67641 u.bh.iKey = u.bh.pC->lastRowid;
67663 db->xUpdateCallback(db->pUpdateArg, SQLITE_DELETE, zDb, zTbl, u.bh.iKey);
86585 int iKey;
86586 for(iKey=0; iKey<pTab->nCol; iKey++){
86587 Column *pCol = &pTab->aCol[iKey];
86589 if( aChange[iKey]>=0 ) return 1;
86590 if( iKey==pTab->iPKey && chngRowid ) return 1;