Searched refs:aHash (Results 1 – 5 of 5) sorted by relevance
146 while( p->u.aHash[h] ){ in sqlite3BitvecTestNotNull()147 if( p->u.aHash[h]==i ) return 1; in sqlite3BitvecTestNotNull()192 if( !p->u.aHash[h] ){ in sqlite3BitvecSet()202 if( p->u.aHash[h]==i ) return SQLITE_OK; in sqlite3BitvecSet()205 } while( p->u.aHash[h] ); in sqlite3BitvecSet()217 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash)); in sqlite3BitvecSet()230 p->u.aHash[h] = i; in sqlite3BitvecSet()257 memcpy(aiValues, p->u.aHash, sizeof(p->u.aHash)); in sqlite3BitvecClear()258 memset(p->u.aHash, 0, sizeof(p->u.aHash)); in sqlite3BitvecClear()264 while( p->u.aHash[h] ){ in sqlite3BitvecClear()[all …]
1099 if( sLoc.aHash[i]>iLimit ){ in walCleanupHash()1100 sLoc.aHash[i] = 0; in walCleanupHash()1107 nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]); in walCleanupHash()1120 if( sLoc.aHash[iKey]==j+1 ) break; in walCleanupHash()1122 assert( sLoc.aHash[iKey]==j+1 ); in walCleanupHash()1176 AtomicStore(&sLoc.aHash[iKey], (ht_slot)idx); in walIndexAppend()1198 sLoc.aHash[iKey]; in walIndexAppend()1200 if( sLoc.aHash[iKey]==i+1 ) break; in walIndexAppend()1202 assert( sLoc.aHash[iKey]==i+1 ); in walIndexAppend()1829 nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno); in walIteratorInit()[all …]
34 TmAgg *aHash[10000]; member155 iHash = iHash % ArraySize(pTm->aHash); in tmMalloc()157 for(pAgg=pTm->aHash[iHash]; pAgg; pAgg=pAgg->pNext){ in tmMalloc()164 pAgg->pNext = pTm->aHash[iHash]; in tmMalloc()165 pTm->aHash[iHash] = pAgg; in tmMalloc()274 for(i=0; i<ArraySize(pTm->aHash); i++){ in tmMallocCheck()276 for(pAgg=pTm->aHash[i]; pAgg; pAgg=pAgg->pNext){ in tmMallocCheck()288 for(i=0; i<ArraySize(pTm->aHash); i++){ in tmMallocCheck()290 for(pAgg=pTm->aHash[i]; pAgg; pAgg=pAgg->pNext){ in tmMallocCheck()
148 IdxHashEntry *aHash[IDX_HASH_SIZE]; member203 for(pEntry=pHash->aHash[i]; pEntry; pEntry=pNext){ in idxHashClear()241 for(pEntry=pHash->aHash[iHash]; pEntry; pEntry=pEntry->pHashNext){ in idxHashAdd()254 pEntry->pHashNext = pHash->aHash[iHash]; in idxHashAdd()255 pHash->aHash[iHash] = pEntry; in idxHashAdd()273 for(pEntry=pHash->aHash[iHash]; pEntry; pEntry=pEntry->pHashNext){ in idxHashFind()
198 RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ member633 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext); in nodeHashLookup()644 pNode->pNext = pRtree->aHash[iHash]; in nodeHashInsert()645 pRtree->aHash[iHash] = pNode; in nodeHashInsert()654 pp = &pRtree->aHash[nodeHash(pNode->iNode)]; in nodeHashDelete()