Home | History | Annotate | Download | only in dist

Lines Matching defs:nSegment

45835   int nSegment;                   /* Number of entries in aSegment[] */
46706 for(i=p->nSegment-1; i>=0; i--){
46882 int nSegment; /* Number of segments to merge */
46896 nSegment = walFramePage(iLast) + 1;
46898 + (nSegment-1)*sizeof(struct WalSegment)
46905 p->nSegment = nSegment;
46917 for(i=0; rc==SQLITE_OK && i<nSegment; i++){
46929 if( (i+1)==nSegment ){
46934 aIndex = &((ht_slot *)&p->aSegment[p->nSegment])[iZero];
116886 int nSegment; /* Size of apSegment array */
119248 if( (pCsr->nSegment%16)==0 ){
119250 int nByte = (pCsr->nSegment + 16)*sizeof(Fts3SegReader*);
119258 pCsr->apSegment[pCsr->nSegment++] = pNew;
119322 rc = sqlite3Fts3SegReaderNew(pCsr->nSegment+1,
126537 for(ii=0; rc==SQLITE_OK && ii<pMsr->nSegment; ii++){
126837 ** Argument apSegment is an array of nSegment elements. It is known that
126838 ** the final (nSegment-nSuspect) members are already in sorted order
126844 int nSegment, /* Size of apSegment array */
126850 assert( nSuspect<=nSegment );
126852 if( nSuspect==nSegment ) nSuspect--;
126855 for(j=i; j<(nSegment-1); j++){
127605 int nSeg = pCsr->nSegment;
127613 for(i=0; pCsr->bRestart==0 && i<pCsr->nSegment; i++){
127648 int nSegment = pCsr->nSegment;
127661 for(i=0; i<nSegment; i++){
127704 for(i=0; i<pCsr->nSegment; i++){
127728 int nSegment = pCsr->nSegment;
127734 if( pCsr->nSegment==0 ) return SQLITE_OK;
127752 fts3SegReaderSort(apSegment, nSegment, pCsr->nAdvance, fts3SegReaderCmp);
127779 while( nMerge<nSegment
127897 for(i=0; i<pCsr->nSegment; i++){
127903 pCsr->nSegment = 0;
127942 if( rc!=SQLITE_OK || csr.nSegment==0 ) goto finished;
127949 if( csr.nSegment==1 ){
127968 assert( csr.nSegment>0 );
127988 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment