Lines Matching refs:nMerge
67758 int nMerge = 0; /* Number of elements in list aMerge */ local
67769 nMerge = 1;
67777 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
67780 aSub[iSub].nList = nMerge;
67790 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
67794 *pnList = nMerge;
191982 int nMerge = nDoclist;
191989 pTS->anOutput[iOut] = nMerge;
191995 int rc = fts3DoclistOrMerge(p->bDescIdx, aMerge, nMerge,
192008 nMerge = nNew;
192011 pTS->anOutput[iOut] = nMerge;
199522 static void fts3LogMerge(int nMerge, sqlite3_int64 iAbsLevel){
199523 sqlite3_log(SQLITE_OK, "%d-way merge from level %d", nMerge, (int)iAbsLevel);
202130 int nMerge = pMsr->nAdvance;
202136 if( nMerge==0 ){
202158 && j<nMerge
202166 fts3SegReaderSort(pMsr->apSegment, nMerge, j, xCmp);
202343 int nMerge;
202384 nMerge = 1;
202385 while( nMerge<nSegment
202386 && apSegment[nMerge]->aNode
202387 && apSegment[nMerge]->nTerm==pCsr->nTerm
202388 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
202390 nMerge++;
202394 if( nMerge==1
202416 for(i=0; i<nMerge; i++){
202419 fts3SegReaderSort(apSegment, nMerge, nMerge, xCmp);
202428 while( j<nMerge
202479 fts3SegReaderSort(apSegment, nMerge, j, xCmp);
202490 pCsr->nAdvance = nMerge;
204363 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
204365 int nRem = nMerge; /* Number of leaf pages yet to be written */
204562 int nMerge = 0;
204566 nMerge = fts3Getint(&z);
204584 rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
236142 static int sqlite3Fts5IndexMerge(Fts5Index *p, int nMerge);
236316 static int sqlite3Fts5StorageMerge(Fts5Storage *p, int nMerge);
244669 int nMerge; /* Number of segments in incr-merge */
245389 i += fts5GetVarint32(&pData[i], pLvl->nMerge);
245391 if( nTotal<pLvl->nMerge ) rc = FTS5_CORRUPT;
245423 if( iLvl>0 && pLvl[-1].nMerge && nTotal==0 ) rc = FTS5_CORRUPT;
245424 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
245570 assert_nc( p->pStruct->aLevel[i].nMerge==pTest->aLevel[i].nMerge );
245663 fts5BufferAppendVarint(&p->rc, &buf, pLvl->nMerge);
245665 assert( pLvl->nMerge<=pLvl->nSeg );
245720 if( pOut->nMerge==0 ){
245723 if( pLvl->nMerge ) return;
245777 assert( pTst->nMerge==0 );
248995 assert( pLvl->nMerge<=pLvl->nSeg );
248999 if( pLvl->nMerge ){
249002 nInput = pLvl->nMerge;
249112 pLvl->nMerge = 0;
249120 pLvl->nMerge = nInput;
249164 if( pLvl->nMerge ) break;
249194 if( pLvl->nMerge ){
249195 if( pLvl->nMerge>nBest ){
249213 if( p->rc==SQLITE_OK && pStruct->aLevel[iBestLvl].nMerge==0 ){
250054 int nMerge = pStruct->aLevel[i].nMerge;
250055 if( nThis>0 && (nThis==nSeg || (nThis==nSeg-1 && nMerge==nThis)) ){
250062 assert( pStruct->aLevel[i].nMerge<=nThis );
250136 static int sqlite3Fts5IndexMerge(Fts5Index *p, int nMerge){
250144 if( nMerge<0 ){
250149 nMerge = nMerge*-1;
250152 if( fts5IndexMerge(p, &pStruct, nMerge, nMin) ){
250416 int nMerge = 0;
250429 nMerge++;
250442 if( sqlite3Fts5BufferSize(&p->rc, &tmp, nTmp+nMerge*10) ){
250470 assert( tmp.n+nTail<=nTmp+nMerge*10 );
250833 int nMerge;
250851 const int nMerge = pSetup->nMerge;
250857 int i1 = i*nMerge;
250859 assert( i1+nMerge<=pSetup->nBuf );
250860 for(iStore=i1; iStore<i1+nMerge; iStore++){
250867 if( iStore==i1+nMerge ){
250868 pSetup->xMerge(p, &pSetup->doclist, nMerge, &pSetup->aBuf[i1]);
250869 for(iStore=i1; iStore<i1+nMerge; iStore++){
250904 s.nMerge = 1;
250919 s.nMerge = FTS5_MERGE_NLIST-1;
250920 s.nBuf = s.nMerge*8; /* Sufficient to merge (16^8)==(2^32) lists */
250947 assert( (s.nBuf%s.nMerge)==0 );
250948 for(i=0; i<s.nBuf; i+=s.nMerge){
250951 s.xMerge(p, &s.doclist, s.nMerge, &s.aBuf[i]);
250953 for(iFree=i; iFree<i+s.nMerge; iFree++){
252972 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg
253591 sqlite3_result_int(ctx, pCsr->iSeg < p->aLevel[pCsr->iLevel].nMerge);
255485 int nMerge = sqlite3_value_int(pVal);
255486 rc = sqlite3Fts5StorageMerge(pTab->pStorage, nMerge);
258501 static int sqlite3Fts5StorageMerge(Fts5Storage *p, int nMerge){
258502 return sqlite3Fts5IndexMerge(p->pIndex, nMerge);