Lines Matching refs:nSeg
206767 int nSeg = pCsr->nSegment; local
206787 fts3SegReaderSort(pCsr->apSegment, nSeg, nSeg, fts3SegReaderCmp);
207651 int nSeg, /* Number of segments to merge */ argument
207660 nByte = sizeof(Fts3SegReader *) * nSeg;
207674 for(i=0; rc==SQLITE_OK && sqlite3_step(pStmt)==SQLITE_ROW && i<nSeg; i++){
208938 int nSeg = 0; /* Number of input segments */ local
208967 nSeg = sqlite3_column_int(pFindLevel, 1);
208968 assert( nSeg>=2 );
208970 nSeg = -1;
208985 if( nSeg<0 || (iAbsLevel % nMod) >= (iHintAbsLevel % nMod) ){
208993 nSeg = MIN(MAX(nMin,nSeg), nHintSeg);
209006 if( nSeg<=0 ) break;
209036 rc = fts3IncrmergeCsr(p, iAbsLevel, nSeg, pCsr);
209038 if( SQLITE_OK==rc && pCsr->nSegment==nSeg
209058 fts3LogMerge(nSeg, iAbsLevel);
209070 rc = fts3IncrmergeChomp(p, iAbsLevel, pCsr, &nSeg);
209071 if( nSeg!=0 ){
209073 fts3IncrmergeHintPush(&hint, iAbsLevel, nSeg, &rc);
209078 if( nSeg!=0 ){
209082 if( nSeg==0 && pWriter->bNoLeafData==0 ){
250502 int nSeg; /* Total number of segments on level */ member
250748 int nSeg; /* Size of aSeg[] array */ member
251169 nByte = sizeof(Fts5StructureSegment) * pNew->aLevel[i].nSeg;
251261 pLvl->nSeg = nTotal;
251343 nByte = (pLvl->nSeg + nExtra) * sizeof(Fts5StructureSegment);
251347 memset(&aNew[pLvl->nSeg], 0, sizeof(Fts5StructureSegment) * nExtra);
251349 int nMove = pLvl->nSeg * sizeof(Fts5StructureSegment);
251439 assert_nc( p->pStruct->aLevel[i].nSeg==pTest->aLevel[i].nSeg );
251440 for(j=0; j<pTest->aLevel[i].nSeg; j++){
251477 nSegment += pStruct->aLevel[iLvl].nSeg;
251532 fts5BufferAppendVarint(&p->rc, &buf, pLvl->nSeg);
251533 assert( pLvl->nMerge<=pLvl->nSeg );
251535 for(iSeg=0; iSeg<pLvl->nSeg; iSeg++){
251592 for(is=pLvl->nSeg-1; is>=0; is--){
251598 pOut->nSeg++;
251599 pLvl->nSeg--;
251633 int nSeg = pStruct->aLevel[iLvl].nSeg; local
251635 if( nSeg==0 ) return;
251636 pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1];
251640 for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--);
251646 for(i=0; i<pTst->nSeg; i++){
253100 for(i=0; i<pIter->nSeg; i++){
253110 for(i=0; i<pIter->nSeg; i+=2){
253113 Fts5CResult *pRes = &pIter->aFirst[(pIter->nSeg + i) / 2];
253117 for(i=1; i<(pIter->nSeg / 2); i+=2){
253145 assert( iOut<pIter->nSeg && iOut>0 );
253148 if( iOut>=(pIter->nSeg/2) ){
253149 i1 = (iOut - pIter->nSeg/2) * 2;
253287 for(i=0; i<pIter->nSeg; i++){
253302 for(i=(pIter->nSeg+iChanged)/2; i>=iMinset && p->rc==SQLITE_OK; i=i/2){
253308 i = pIter->nSeg + iEq;
253336 for(i=(pIter->nSeg+iChanged)/2; 1; i=i/2){
253534 int nSeg argument
253539 for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2);
253545 pNew->nSeg = nSlot;
253987 for(iIter=pIter->nSeg-1; iIter>0; iIter--){
254029 int nSeg = 0; /* Number of segment-iters in use */ local
254041 nSeg = pStruct->nSegment;
254042 nSeg += (p->pHash && 0==(flags & FTS5INDEX_QUERY_SKIPHASH));
254044 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
254047 *ppOut = pNew = fts5MultiIterAlloc(p, nSeg);
254069 for(iSeg=pLvl->nSeg-1; iSeg>=0; iSeg--){
254081 for(iSeg=nSeg-1; iSeg>=0; iSeg--){
254085 assert( iIter==nSeg );
254217 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
254232 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
254771 for(i=0; i<pIter->nSeg && p->rc==SQLITE_OK; i++){
254866 assert( pLvl->nMerge<=pLvl->nSeg );
254872 assert( pLvlOut->nSeg>0 );
254874 pSeg = &pLvlOut->aSeg[pLvlOut->nSeg-1];
254896 pSeg = &pLvlOut->aSeg[pLvlOut->nSeg];
254897 pLvlOut->nSeg++;
254903 nInput = pLvl->nSeg;
254908 pSeg->iOrigin2 = pLvl->aSeg[pLvl->nSeg-1].iOrigin2;
254911 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
254977 if( pLvl->nSeg!=nInput ){
254978 int nMove = (pLvl->nSeg - nInput) * sizeof(Fts5StructureSegment);
254982 pLvl->nSeg -= nInput;
254985 pLvlOut->nSeg--;
255019 for(iSeg=0; iSeg<pLvl->nSeg; iSeg++){
255023 assert_nc( nEntry>0 || pLvl->nSeg==0 );
255072 if( pLvl->nSeg>nBest ){
255073 nBest = pLvl->nSeg;
255131 while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){
255861 pSeg = &pStruct->aLevel[0].aSeg[ pStruct->aLevel[0].nSeg++ ];
255913 int nSeg = pStruct->nSegment; local
255927 if( nSeg==0 ) return 0;
255929 int nThis = pStruct->aLevel[i].nSeg;
255931 if( nThis>0 && (nThis==nSeg || (nThis==nSeg-1 && nMerge==nThis)) ){
255932 if( nSeg==1 && nThis==1 && pStruct->aLevel[i].aSeg[0].nPgTombstone==0 ){
255947 nByte = nSeg * sizeof(Fts5StructureSegment);
255961 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
255966 pNew->nSegment = pLvl->nSeg = nSeg;
255995 for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){}
255996 while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){
257371 for(iSeg=pStruct->aLevel[iLvl].nSeg-1; iSeg>=0; iSeg--){
257415 for(ii=0; ii<pNew->nSeg; ii++){
257442 for(iSeg=0; iSeg<pIter->nSeg; iSeg++){
257453 pRet->nSeg = 0;
257578 if( pIter->nSeg==0 ){
257616 if( pIter->nSeg==0 ){
257705 assert( pT || (pToken && pIter->nSeg>0) );
257737 if( pIter->nSeg==0 ){
257758 && (pIter->nSeg==0 || pIter->pIndex->pConfig->eDetail!=FTS5_DETAIL_FULL)
257782 assert( pIter->pTokenDataIter || pIter->nSeg>0 );
257783 if( pIter->nSeg>0 ){
258222 for(iSeg=pStruct->aLevel[iLvl].nSeg-1; iSeg>=0; iSeg--){
258735 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
258875 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg
258877 for(iSeg=0; iSeg<pLvl->nSeg; iSeg++){
259444 while( pCsr->iLevel<p->nLevel && pCsr->iSeg>=p->aLevel[pCsr->iLevel].nSeg ){