Lines Matching refs:aHash

54858     u32 aHash[BITVEC_NINT];      /* Hash table representation */  member
54899     while( p->u.aHash[h] ){
54900       if( p->u.aHash[h]==i ) return 1;
54945   if( !p->u.aHash[h] ){
54955     if( p->u.aHash[h]==i ) return SQLITE_OK;
54958   } while( p->u.aHash[h] );
54966     u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
54970       memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
54985   p->u.aHash[h] = i;
55012     memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
55013     memset(p->u.aHash, 0, sizeof(p->u.aHash));
55019         while( p->u.aHash[h] ){
55023         p->u.aHash[h] = aiValues[j];
67026   volatile ht_slot *aHash;  /* Start of the wal-index hash table */  member
67056     pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
67139     if( sLoc.aHash[i]>iLimit ){
67140       sLoc.aHash[i] = 0;
67147   nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]);
67159       for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
67160         if( sLoc.aHash[iKey]==j+1 ) break;
67162       assert( sLoc.aHash[iKey]==j+1 );
67194       int nByte = (int)((u8*)&sLoc.aHash[HASHTABLE_NSLOT] - (u8*)sLoc.aPgno);
67212     for(iKey=walHash(iPage); sLoc.aHash[iKey]; iKey=walNextHash(iKey)){
67216     AtomicStore(&sLoc.aHash[iKey], (ht_slot)idx);
67225       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
67238             sLoc.aHash[iKey];
67240           if( sLoc.aHash[iKey]==i+1 ) break;
67242         assert( sLoc.aHash[iKey]==i+1 );
67867         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
69447     while( (iH = AtomicLoad(&sLoc.aHash[iKey]))!=0 ){
213668   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
214113   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
214124   pNode->pNext = pRtree->aHash[iHash];
214125   pRtree->aHash[iHash] = pNode;
214134     pp = &pRtree->aHash[nodeHash(pNode->iNode)];