Lines Matching refs:aHash
17302 ** structure is held in the db->aHash hash table.
52259 /* Hashing function for the aHash representation.
52278 ** If iSize>BITVEC_NBIT and iDivisor==0 then Bitvec.u.aHash[] is
52291 u32 nSet; /* Number of bits that are set - only valid for aHash
52300 u32 aHash[BITVEC_NINT]; /* Hash table representation */
52341 while( p->u.aHash[h] ){
52342 if( p->u.aHash[h]==i ) return 1;
52387 if( !p->u.aHash[h] ){
52397 if( p->u.aHash[h]==i ) return SQLITE_OK;
52400 } while( p->u.aHash[h] );
52408 u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
52412 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
52425 p->u.aHash[h] = i;
52452 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
52453 memset(p->u.aHash, 0, sizeof(p->u.aHash));
52459 while( p->u.aHash[h] ){
52463 p->u.aHash[h] = aiValues[j];
60603 /* memset(pPager->aHash, 0, sizeof(pPager->aHash)); */
63577 ** where aHash[iMax]==P. If there is no iMax entry (if there exists
63578 ** no hash slot such that aHash[i]==p) then page P is not in the
64348 volatile ht_slot *aHash; /* Start of the wal-index hash table */
64358 ** Set output variable pLoc->aHash to point to the start of the hash table
64378 pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
64436 int i; /* Used to iterate through aHash[] */
64460 if( sLoc.aHash[i]>iLimit ){
64461 sLoc.aHash[i] = 0;
64468 nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]);
64480 for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
64481 if( sLoc.aHash[iKey]==j+1 ) break;
64483 assert( sLoc.aHash[iKey]==j+1 );
64515 int nByte = (int)((u8*)&sLoc.aHash[HASHTABLE_NSLOT] - (u8*)sLoc.aPgno);
64533 for(iKey=walHash(iPage); sLoc.aHash[iKey]; iKey=walNextHash(iKey)){
64537 AtomicStore(&sLoc.aHash[iKey], (ht_slot)idx);
64546 for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
64559 sLoc.aHash[iKey];
64561 if( sLoc.aHash[iKey]==i+1 ) break;
64563 assert( sLoc.aHash[iKey]==i+1 );
65190 nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
66535 ** slot (aHash[iKey]) may have been added before or after the
66567 while( (iH = AtomicLoad(&sLoc.aHash[iKey]))!=0 ){
201072 /* Size of hash table Rtree.aHash. This hash table is not expected to
201144 RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
201567 ** in the Rtree.aHash table.
201579 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
201590 pNode->pNext = pRtree->aHash[iHash];
201591 pRtree->aHash[iHash] = pNode;
201600 pp = &pRtree->aHash[nodeHash(pNode->iNode)];