Lines Matching refs:nMerge
67757 int nMerge = 0; /* Number of elements in list aMerge */ local
67768 nMerge = 1;
67776 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
67779 aSub[iSub].nList = nMerge;
67789 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
67793 *pnList = nMerge;
191941 int nMerge = nDoclist;
191948 pTS->anOutput[iOut] = nMerge;
191954 int rc = fts3DoclistOrMerge(p->bDescIdx, aMerge, nMerge,
191967 nMerge = nNew;
191970 pTS->anOutput[iOut] = nMerge;
199481 static void fts3LogMerge(int nMerge, sqlite3_int64 iAbsLevel){
199482 sqlite3_log(SQLITE_OK, "%d-way merge from level %d", nMerge, (int)iAbsLevel);
202089 int nMerge = pMsr->nAdvance;
202095 if( nMerge==0 ){
202117 && j<nMerge
202125 fts3SegReaderSort(pMsr->apSegment, nMerge, j, xCmp);
202302 int nMerge;
202343 nMerge = 1;
202344 while( nMerge<nSegment
202345 && apSegment[nMerge]->aNode
202346 && apSegment[nMerge]->nTerm==pCsr->nTerm
202347 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
202349 nMerge++;
202353 if( nMerge==1
202375 for(i=0; i<nMerge; i++){
202378 fts3SegReaderSort(apSegment, nMerge, nMerge, xCmp);
202387 while( j<nMerge
202438 fts3SegReaderSort(apSegment, nMerge, j, xCmp);
202449 pCsr->nAdvance = nMerge;
204322 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
204324 int nRem = nMerge; /* Number of leaf pages yet to be written */
204521 int nMerge = 0;
204525 nMerge = fts3Getint(&z);
204543 rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
236101 static int sqlite3Fts5IndexMerge(Fts5Index *p, int nMerge);
236275 static int sqlite3Fts5StorageMerge(Fts5Storage *p, int nMerge);
244628 int nMerge; /* Number of segments in incr-merge */
245348 i += fts5GetVarint32(&pData[i], pLvl->nMerge);
245350 if( nTotal<pLvl->nMerge ) rc = FTS5_CORRUPT;
245382 if( iLvl>0 && pLvl[-1].nMerge && nTotal==0 ) rc = FTS5_CORRUPT;
245383 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
245529 assert_nc( p->pStruct->aLevel[i].nMerge==pTest->aLevel[i].nMerge );
245622 fts5BufferAppendVarint(&p->rc, &buf, pLvl->nMerge);
245624 assert( pLvl->nMerge<=pLvl->nSeg );
245679 if( pOut->nMerge==0 ){
245682 if( pLvl->nMerge ) return;
245736 assert( pTst->nMerge==0 );
248954 assert( pLvl->nMerge<=pLvl->nSeg );
248958 if( pLvl->nMerge ){
248961 nInput = pLvl->nMerge;
249071 pLvl->nMerge = 0;
249079 pLvl->nMerge = nInput;
249123 if( pLvl->nMerge ) break;
249153 if( pLvl->nMerge ){
249154 if( pLvl->nMerge>nBest ){
249172 if( p->rc==SQLITE_OK && pStruct->aLevel[iBestLvl].nMerge==0 ){
250013 int nMerge = pStruct->aLevel[i].nMerge;
250014 if( nThis>0 && (nThis==nSeg || (nThis==nSeg-1 && nMerge==nThis)) ){
250021 assert( pStruct->aLevel[i].nMerge<=nThis );
250095 static int sqlite3Fts5IndexMerge(Fts5Index *p, int nMerge){
250103 if( nMerge<0 ){
250108 nMerge = nMerge*-1;
250111 if( fts5IndexMerge(p, &pStruct, nMerge, nMin) ){
250375 int nMerge = 0;
250388 nMerge++;
250401 if( sqlite3Fts5BufferSize(&p->rc, &tmp, nTmp+nMerge*10) ){
250429 assert( tmp.n+nTail<=nTmp+nMerge*10 );
250792 int nMerge;
250810 const int nMerge = pSetup->nMerge;
250816 int i1 = i*nMerge;
250818 assert( i1+nMerge<=pSetup->nBuf );
250819 for(iStore=i1; iStore<i1+nMerge; iStore++){
250826 if( iStore==i1+nMerge ){
250827 pSetup->xMerge(p, &pSetup->doclist, nMerge, &pSetup->aBuf[i1]);
250828 for(iStore=i1; iStore<i1+nMerge; iStore++){
250863 s.nMerge = 1;
250878 s.nMerge = FTS5_MERGE_NLIST-1;
250879 s.nBuf = s.nMerge*8; /* Sufficient to merge (16^8)==(2^32) lists */
250906 assert( (s.nBuf%s.nMerge)==0 );
250907 for(i=0; i<s.nBuf; i+=s.nMerge){
250910 s.xMerge(p, &s.doclist, s.nMerge, &s.aBuf[i]);
250912 for(iFree=i; iFree<i+s.nMerge; iFree++){
252931 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg
253550 sqlite3_result_int(ctx, pCsr->iSeg < p->aLevel[pCsr->iLevel].nMerge);
255444 int nMerge = sqlite3_value_int(pVal);
255445 rc = sqlite3Fts5StorageMerge(pTab->pStorage, nMerge);
258460 static int sqlite3Fts5StorageMerge(Fts5Storage *p, int nMerge){
258461 return sqlite3Fts5IndexMerge(p->pIndex, nMerge);