Lines Matching refs:aHash

53909     u32 aHash[BITVEC_NINT];      /* Hash table representation */
53950     while( p->u.aHash[h] ){
53951       if( p->u.aHash[h]==i ) return 1;
53996   if( !p->u.aHash[h] ){
54006     if( p->u.aHash[h]==i ) return SQLITE_OK;
54009   } while( p->u.aHash[h] );
54017     u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
54021       memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
54034   p->u.aHash[h] = i;
54061     memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
54062     memset(p->u.aHash, 0, sizeof(p->u.aHash));
54068         while( p->u.aHash[h] ){
54072         p->u.aHash[h] = aiValues[j];
66051   volatile ht_slot *aHash;  /* Start of the wal-index hash table */
66081     pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
66164     if( sLoc.aHash[i]>iLimit ){
66165       sLoc.aHash[i] = 0;
66172   nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]);
66184       for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
66185         if( sLoc.aHash[iKey]==j+1 ) break;
66187       assert( sLoc.aHash[iKey]==j+1 );
66219       int nByte = (int)((u8*)&sLoc.aHash[HASHTABLE_NSLOT] - (u8*)sLoc.aPgno);
66237     for(iKey=walHash(iPage); sLoc.aHash[iKey]; iKey=walNextHash(iKey)){
66241     AtomicStore(&sLoc.aHash[iKey], (ht_slot)idx);
66250       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
66263             sLoc.aHash[iKey];
66265           if( sLoc.aHash[iKey]==i+1 ) break;
66267         assert( sLoc.aHash[iKey]==i+1 );
66893         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
68460     while( (iH = AtomicLoad(&sLoc.aHash[iKey]))!=0 ){
210516   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
210957   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
210968   pNode->pNext = pRtree->aHash[iHash];
210969   pRtree->aHash[iHash] = pNode;
210978     pp = &pRtree->aHash[nodeHash(pNode->iNode)];