contrib/sqlite3/sqlite3.c

96151   SorterRecord *aSlot[64];
96158   memset(aSlot, 0, sizeof(aSlot));
96174     for(i=0; aSlot[i]; i++){
96175       p = vdbeSorterMerge(pTask, p, aSlot[i]);
96176       aSlot[i] = 0;
96178     aSlot[i] = p;
96183   for(i=0; i<ArraySize(aSlot); i++){
96184     if( aSlot[i]==0 ) continue;
96185     p = p ? vdbeSorterMerge(pTask, p, aSlot[i]) : aSlot[i];
219279   int nSlot;                      /* Size of aSlot[] array */
219281   Fts5HashEntry **aSlot;          /* Array of hash slots */
219347     pNew->aSlot = (Fts5HashEntry**)sqlite3_malloc64(nByte);
219348     if( pNew->aSlot==0 ){
219353       memset(pNew->aSlot, 0, (size_t)nByte);
219365     sqlite3_free(pHash->aSlot);
219378     for(pSlot=pHash->aSlot[i]; pSlot; pSlot=pNext){
219383   memset(pHash->aSlot, 0, pHash->nSlot * sizeof(Fts5HashEntry*));
219413   Fts5HashEntry **apOld = pHash->aSlot;
219433   pHash->aSlot = apNew;
219506   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
219523     /* Grow the Fts5Hash.aSlot[] array if necessary. */
219542     p->pHashNext = pHash->aSlot[iHash];
219543     pHash->aSlot[iHash] = p;
219575       for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
219705     for(pIter=pHash->aSlot[iSlot]; pIter; pIter=pIter->pHashNext){
219745   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){