lib/sqlite/sqlite3.c

34828 /* Hashing function for the aHash representation.
34847 ** If iSize>BITVEC_NBIT and iDivisor==0 then Bitvec.u.aHash[] is
34860   u32 nSet;       /* Number of bits that are set - only valid for aHash
34869     u32 aHash[BITVEC_NINT];      /* Hash table representation */
34910     while( p->u.aHash[h] ){
34911       if( p->u.aHash[h]==i ) return 1;
34953   if( !p->u.aHash[h] ){
34963     if( p->u.aHash[h]==i ) return SQLITE_OK;
34966   } while( p->u.aHash[h] );
34974     u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
34978       memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
34991   p->u.aHash[h] = i;
35018     memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
35019     memset(p->u.aHash, 0, sizeof(p->u.aHash));
35025         while( p->u.aHash[h] ){
35029         p->u.aHash[h] = aiValues[j];
42083   /* memset(pPager->aHash, 0, sizeof(pPager->aHash)); */
44578 ** where aHash[iMax]==P.  If there is no iMax entry (if there exists
44579 ** no hash slot such that aHash[i]==p) then page P is not in the
45215     volatile ht_slot *aHash;
45217     aHash = (volatile ht_slot *)&aPgno[HASHTABLE_NPAGE];
45226     *paHash = aHash;
45273   volatile ht_slot *aHash = 0;    /* Pointer to hash table to clear */
45275   u32 iZero = 0;                  /* frame == (aHash[x]+iZero) */
45278   int i;                          /* Used to iterate through aHash[] */
45293   walHashGet(pWal, walFramePage(pWal->hdr.mxFrame), &aHash, &aPgno, &iZero);
45301     if( aHash[i]>iLimit ){
45302       aHash[i] = 0;
45309   nByte = (int)((char *)aHash - (char *)&aPgno[iLimit+1]);
45320       for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
45321         if( aHash[iKey]==i ) break;
45323       assert( aHash[iKey]==i );
45338   volatile ht_slot *aHash = 0;    /* Hash table */
45340   rc = walHashGet(pWal, walFramePage(iFrame), &aHash, &aPgno, &iZero);
45357       int nByte = (int)((u8 *)&aHash[HASHTABLE_NSLOT] - (u8 *)&aPgno[1]);
45374     for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
45378     aHash[iKey] = (ht_slot)idx;
45387       for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
45399         for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
45400           if( aHash[iKey]==i ) break;
45402         assert( aHash[iKey]==i );
45913     volatile ht_slot *aHash;
45917     rc = walHashGet(pWal, i, &aHash, &aPgno, &iZero);
45927         nEntry = (int)((u32*)aHash - (u32*)aPgno);
46648   ** slot (aHash[iKey]) may have been added before or after the
46667     volatile ht_slot *aHash;      /* Pointer to hash table */
46674     rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
46679     for(iKey=walHash(pgno); aHash[iKey]; iKey=walNextHash(iKey)){
46680       u32 iFrame = aHash[iKey] + iZero;
46681       if( iFrame<=iLast && aPgno[aHash[iKey]]==pgno ){
109094   static const unsigned char aHash[127] = {
109174   for(i=((int)aHash[h])-1; i>=0; i=((int)aNext[i])-1){
127163 /* Size of hash table Rtree.aHash. This hash table is not expected to
127181   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
127426 ** in the Rtree.aHash table.
127441   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
127452   pNode->pNext = pRtree->aHash[iHash];
127453   pRtree->aHash[iHash] = pNode;
127462     pp = &pRtree->aHash[nodeHash(pNode->iNode)];