Lines Matching refs:aHash
35903 /* Hashing function for the aHash representation.
35922 ** If iSize>BITVEC_NBIT and iDivisor==0 then Bitvec.u.aHash[] is
35935 u32 nSet; /* Number of bits that are set - only valid for aHash
35944 u32 aHash[BITVEC_NINT]; /* Hash table representation */
35985 while( p->u.aHash[h] ){
35986 if( p->u.aHash[h]==i ) return 1;
36028 if( !p->u.aHash[h] ){
36038 if( p->u.aHash[h]==i ) return SQLITE_OK;
36041 } while( p->u.aHash[h] );
36049 u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
36053 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
36066 p->u.aHash[h] = i;
36093 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash));
36094 memset(p->u.aHash, 0, sizeof(p->u.aHash));
36100 while( p->u.aHash[h] ){
36104 p->u.aHash[h] = aiValues[j];
43028 /* memset(pPager->aHash, 0, sizeof(pPager->aHash)); */
45570 ** where aHash[iMax]==P. If there is no iMax entry (if there exists
45571 ** no hash slot such that aHash[i]==p) then page P is not in the
46212 volatile ht_slot *aHash;
46214 aHash = (volatile ht_slot *)&aPgno[HASHTABLE_NPAGE];
46223 *paHash = aHash;
46270 volatile ht_slot *aHash = 0; /* Pointer to hash table to clear */
46272 u32 iZero = 0; /* frame == (aHash[x]+iZero) */
46275 int i; /* Used to iterate through aHash[] */
46290 walHashGet(pWal, walFramePage(pWal->hdr.mxFrame), &aHash, &aPgno, &iZero);
46298 if( aHash[i]>iLimit ){
46299 aHash[i] = 0;
46306 nByte = (int)((char *)aHash - (char *)&aPgno[iLimit+1]);
46317 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
46318 if( aHash[iKey]==i ) break;
46320 assert( aHash[iKey]==i );
46335 volatile ht_slot *aHash = 0; /* Hash table */
46337 rc = walHashGet(pWal, walFramePage(iFrame), &aHash, &aPgno, &iZero);
46354 int nByte = (int)((u8 *)&aHash[HASHTABLE_NSLOT] - (u8 *)&aPgno[1]);
46371 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
46375 aHash[iKey] = (ht_slot)idx;
46384 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
46396 for(iKey=walHash(aPgno[i]); aHash[iKey]; iKey=walNextHash(iKey)){
46397 if( aHash[iKey]==i ) break;
46399 assert( aHash[iKey]==i );
46918 volatile ht_slot *aHash;
46922 rc = walHashGet(pWal, i, &aHash, &aPgno, &iZero);
46932 nEntry = (int)((u32*)aHash - (u32*)aPgno);
47688 ** slot (aHash[iKey]) may have been added before or after the
47707 volatile ht_slot *aHash; /* Pointer to hash table */
47714 rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
47719 for(iKey=walHash(pgno); aHash[iKey]; iKey=walNextHash(iKey)){
47720 u32 iFrame = aHash[iKey] + iZero;
47721 if( iFrame<=iLast && aPgno[aHash[iKey]]==pgno ){
111422 static const unsigned char aHash[127] = {
111502 for(i=((int)aHash[h])-1; i>=0; i=((int)aNext[i])-1){
130293 /* Size of hash table Rtree.aHash. This hash table is not expected to
130311 RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
130556 ** in the Rtree.aHash table.
130571 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
130582 pNode->pNext = pRtree->aHash[iHash];
130583 pRtree->aHash[iHash] = pNode;
130592 pp = &pRtree->aHash[nodeHash(pNode->iNode)];
