Lines Matching refs:aHash

48470     u32 aHash[BITVEC_NINT];      /* Hash table representation */
48511     while( p->u.aHash[h] ){
48512       if( p->u.aHash[h]==i ) return 1;
48557   if( !p->u.aHash[h] ){
48567     if( p->u.aHash[h]==i ) return SQLITE_OK;
48570   } while( p->u.aHash[h] );
48578     u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
48582       memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
48595   p->u.aHash[h] = i;
48622     memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
48623     memset(p->u.aHash, 0, sizeof(p->u.aHash));
48629         while( p->u.aHash[h] ){
48633         p->u.aHash[h] = aiValues[j];
60219   volatile ht_slot *aHash;  /* Start of the wal-index hash table */
60249     pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
60330     if( sLoc.aHash[i]>iLimit ){
60331       sLoc.aHash[i] = 0;
60338   nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit+1]);
60349       for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
60350         if( sLoc.aHash[iKey]==j ) break;
60352       assert( sLoc.aHash[iKey]==j );
60384       int nByte = (int)((u8 *)&sLoc.aHash[HASHTABLE_NSLOT]
60402     for(iKey=walHash(iPage); sLoc.aHash[iKey]; iKey=walNextHash(iKey)){
60406     sLoc.aHash[iKey] = (ht_slot)idx;
60415       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
60428             sLoc.aHash[iKey];
60430           if( sLoc.aHash[iKey]==i ) break;
60432         assert( sLoc.aHash[iKey]==i );
60982         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
62340     while( (iH = AtomicLoad(&sLoc.aHash[iKey]))!=0 ){
187365   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ 
187778   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
187789   pNode->pNext = pRtree->aHash[iHash];
187790   pRtree->aHash[iHash] = pNode;
187799     pp = &pRtree->aHash[nodeHash(pNode->iNode)];