Lines Matching defs:nSegment
63940 int nSegment; /* Number of entries in aSegment[] */
64962 for(i=p->nSegment-1; i>=0; i--){
65143 int nSegment; /* Number of segments to merge */
65157 nSegment = walFramePage(iLast) + 1;
65159 + (nSegment-1)*sizeof(struct WalSegment)
65166 p->nSegment = nSegment;
65178 for(i=walFramePage(nBackfill+1); rc==SQLITE_OK && i<nSegment; i++){
65187 if( (i+1)==nSegment ){
65192 aIndex = &((ht_slot *)&p->aSegment[p->nSegment])[sLoc.iZero];
179832 int nSegment; /* Size of apSegment array */
182586 if( (pCsr->nSegment%16)==0 ){
182588 sqlite3_int64 nByte = (pCsr->nSegment + 16)*sizeof(Fts3SegReader*);
182596 pCsr->apSegment[pCsr->nSegment++] = pNew;
182660 rc = sqlite3Fts3SegReaderNew(pCsr->nSegment+1,
191463 for(ii=0; rc==SQLITE_OK && ii<pMsr->nSegment; ii++){
191773 ** Argument apSegment is an array of nSegment elements. It is known that
191774 ** the final (nSegment-nSuspect) members are already in sorted order
191780 int nSegment, /* Size of apSegment array */
191786 assert( nSuspect<=nSegment );
191788 if( nSuspect==nSegment ) nSuspect--;
191791 for(j=i; j<(nSegment-1); j++){
192645 int nSeg = pCsr->nSegment;
192653 for(i=0; pCsr->bRestart==0 && i<pCsr->nSegment; i++){
192688 int nSegment = pCsr->nSegment;
192701 for(i=0; i<nSegment; i++){
192744 for(i=0; i<pCsr->nSegment; i++){
192781 int nSegment = pCsr->nSegment;
192787 if( pCsr->nSegment==0 ) return SQLITE_OK;
192805 fts3SegReaderSort(apSegment, nSegment, pCsr->nAdvance, fts3SegReaderCmp);
192832 while( nMerge<nSegment
192949 for(i=0; i<pCsr->nSegment; i++){
192955 pCsr->nSegment = 0;
193129 if( rc!=SQLITE_OK || csr.nSegment==0 ) goto finished;
193141 if( csr.nSegment==1 && 0==fts3SegReaderIsPending(csr.apSegment[0]) ){
193160 assert( csr.nSegment>0 );
193182 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
193548 assert( pCsr->nSegment==0 );
193558 pCsr->nSegment++;
194347 sqlite3_bind_int64(pLeafEst, 2, pCsr->nSegment);
194648 for(i=pCsr->nSegment-1; i>=0 && rc==SQLITE_OK; i--){
194654 for(j=0; ALWAYS(j<pCsr->nSegment); j++){
194658 assert( j<pCsr->nSegment && pSeg->iIdx==i );
194678 if( rc==SQLITE_OK && nRem!=pCsr->nSegment ){
194906 if( SQLITE_OK==rc && pCsr->nSegment==nSeg
206241 int nSegment; /* Number of segments */
206267 pSeg = p->aSegment + p->nSegment;
206268 p->nSegment++;
206426 p->nEvent = p->nSegment = 0;
230341 int nSegment; /* Total segments in this structure */
230907 int nSegment = 0;
230918 i += fts5GetVarint32(&pData[i], nSegment);
230920 || nSegment>FTS5_MAX_SEGMENT || nSegment<0
230933 pRet->nSegment = nSegment;
230950 nSegment -= nTotal;
230973 if( nSegment!=0 && rc==SQLITE_OK ) rc = FTS5_CORRUPT;
231112 assert_nc( p->pStruct->nSegment==pTest->nSegment );
231150 int nSegment = 0; /* Total number of segments */
231154 nSegment += pStruct->aLevel[iLvl].nSeg;
231158 return nSegment;
231186 assert( pStruct->nSegment==fts5StructureCountSegments(pStruct) );
231197 fts5BufferSafeAppendVarint(&buf, pStruct->nSegment);
233445 ** is zero or greater, data from the first nSegment segments on level iLevel
233458 int nSegment, /* Number of segments to merge (iLevel>=0) */
233472 assert( pStruct->nSegment==fts5StructureCountSegments(pStruct) );
233473 nSeg = pStruct->nSegment;
233476 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
233656 if( pStruct->nSegment>=FTS5_MAX_SEGMENT ){
234347 pStruct->nSegment++;
234419 pStruct->nSegment -= nInput;
234424 pStruct->nSegment--;
234718 pStruct->nSegment++;
234747 int nSeg = pStruct->nSegment;
234793 pNew->nSegment = pLvl->nSeg = nSeg;
234817 assert( pNew==0 || pNew->nSegment>0 );