Searched refs:aSlot (Results 1 – 3 of 3) sorted by relevance
34 Fts5HashEntry **aSlot; /* Array of hash slots */ member101 if( pNew->aSlot==0 ){ in sqlite3Fts5HashNew()106 memset(pNew->aSlot, 0, (size_t)nByte); in sqlite3Fts5HashNew()118 sqlite3_free(pHash->aSlot); in sqlite3Fts5HashFree()131 for(pSlot=pHash->aSlot[i]; pSlot; pSlot=pNext){ in sqlite3Fts5HashClear()166 Fts5HashEntry **apOld = pHash->aSlot; in fts5HashResize()186 pHash->aSlot = apNew; in fts5HashResize()259 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){ in sqlite3Fts5HashWrite()295 p->pHashNext = pHash->aSlot[iHash]; in sqlite3Fts5HashWrite()296 pHash->aSlot[iHash] = p; in sqlite3Fts5HashWrite()[all …]
1406 SorterRecord *aSlot[64]; in vdbeSorterSort() local1413 memset(aSlot, 0, sizeof(aSlot)); in vdbeSorterSort()1429 for(i=0; aSlot[i]; i++){ in vdbeSorterSort()1430 p = vdbeSorterMerge(pTask, p, aSlot[i]); in vdbeSorterSort()1431 aSlot[i] = 0; in vdbeSorterSort()1433 aSlot[i] = p; in vdbeSorterSort()1438 for(i=0; i<ArraySize(aSlot); i++){ in vdbeSorterSort()1439 if( aSlot[i]==0 ) continue; in vdbeSorterSort()1440 p = p ? vdbeSorterMerge(pTask, p, aSlot[i]) : aSlot[i]; in vdbeSorterSort()
1498 } aSlot[1]; member1516 pSlot = &p->aSlot[iSlot]; in idxRemFunc()1808 sqlite3_free(pCtx->aSlot[i].z); in idxPopulateStat1()