Lines Matching refs:aHash

53550     u32 aHash[BITVEC_NINT];      /* Hash table representation */
53591     while( p->u.aHash[h] ){
53592       if( p->u.aHash[h]==i ) return 1;
53637   if( !p->u.aHash[h] ){
53647     if( p->u.aHash[h]==i ) return SQLITE_OK;
53650   } while( p->u.aHash[h] );
53658     u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
53662       memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
53675   p->u.aHash[h] = i;
53702     memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
53703     memset(p->u.aHash, 0, sizeof(p->u.aHash));
53709         while( p->u.aHash[h] ){
53713         p->u.aHash[h] = aiValues[j];
65692   volatile ht_slot *aHash;  /* Start of the wal-index hash table */
65722     pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
65805     if( sLoc.aHash[i]>iLimit ){
65806       sLoc.aHash[i] = 0;
65813   nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]);
65825       for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
65826         if( sLoc.aHash[iKey]==j+1 ) break;
65828       assert( sLoc.aHash[iKey]==j+1 );
65860       int nByte = (int)((u8*)&sLoc.aHash[HASHTABLE_NSLOT] - (u8*)sLoc.aPgno);
65878     for(iKey=walHash(iPage); sLoc.aHash[iKey]; iKey=walNextHash(iKey)){
65882     AtomicStore(&sLoc.aHash[iKey], (ht_slot)idx);
65891       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
65904             sLoc.aHash[iKey];
65906           if( sLoc.aHash[iKey]==i+1 ) break;
65908         assert( sLoc.aHash[iKey]==i+1 );
66534         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
68101     while( (iH = AtomicLoad(&sLoc.aHash[iKey]))!=0 ){
208720   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
209161   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
209172   pNode->pNext = pRtree->aHash[iHash];
209173   pRtree->aHash[iHash] = pNode;
209182     pp = &pRtree->aHash[nodeHash(pNode->iNode)];