Lines Matching refs:nList
46071 int nList; /* Number of pages in pList */
46090 nList = 0;
46094 nList++;
46099 nList = 1;
46101 pPager->aStat[PAGER_STAT_WRITE] += nList;
51756 int nList; /* Number of elements in aList */
51760 const int nList = *pnList; /* Size of input list */
51768 assert( nList<=HASHTABLE_NPAGE && nList>0 );
51771 for(iList=0; iList<nList; iList++){
51778 assert( p->aList && p->nList<=(1<<iSub) );
51780 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
51783 aSub[iSub].nList = nMerge;
51787 if( nList & (1<<iSub) ){
51791 assert( p->nList<=(1<<iSub) );
51792 assert( p->aList==&aList[nList&~((2<<iSub)-1)] );
51793 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
135886 int nList; /* Length of position list */
138470 int nList, /* Size of pList in bytes */
138476 char *pEnd = &pList[nList];
138924 static int fts3DoclistCountDocids(char *aList, int nList){
138927 char *aEnd = &aList[nList]; /* Pointer to one byte after EOF */
139882 int nList /* Number of bytes in pList */
139895 p->doclist.nAll = nList;
139913 nRight = nList;
139919 nLeft = nList;
139991 int nList;
139992 int rc = sqlite3Fts3DeferredTokenList(pDeferred, &pList, &nList);
139998 pPhrase->doclist.nList = 0;
140003 nPoslist = nList;
140018 pPhrase->doclist.nList = 0;
140030 pPhrase->doclist.nList = nPoslist;
140058 pPhrase->doclist.nList = (int)(aOut - pPhrase->doclist.pList);
140062 pPhrase->doclist.nList = 0;
140266 pDL->nList = (int)(pIter - pDL->pList);
140290 int nList;
140316 p->nList = pPhrase->doclist.nList;
140325 pTab, pToken->pSegcsr, &p->iDocid, &p->pList, &p->nList
140370 &pDL->iDocid, &pDL->pList, &pDL->nList
140412 int nList = 0;
140413 int nByte = a[p->nToken-1].nList;
140426 nList = (int)(pOut - aDoclist);
140432 pDL->nList = nList;
140467 &pDL->pNextDocid, &pDL->iDocid, &pDL->nList, pbEof
140758 int nList = 0;
140760 rc = fts3TermSelect(pTab, pToken, pTC->iCol, &nList, &pList);
140764 pTab, pTC->pPhrase, pTC->iToken,pList,nList
140849 pPhrase->doclist.nList = 0;
140898 assert( nNew<=pPhrase->doclist.nList && nNew>0 );
140899 memset(&pPhrase->doclist.pList[nNew], 0, pPhrase->doclist.nList - nNew);
140900 pPhrase->doclist.nList = nNew;
140997 memset(pDl->pList, 0, pDl->nList);
141004 memset(pDl->pList, 0, pDl->nList);
141124 nTmp += p->pRight->pPhrase->doclist.nList;
141126 nTmp += p->pPhrase->doclist.nList;
148470 int nList = *pnList;
148471 char *pEnd = &pList[nList];
148481 nList = (int)(p - pList);
148485 nList -= (int)(p - pList);
148487 if( nList==0 ){
148494 if( bZero && &pList[nList]!=pEnd ){
148495 memset(&pList[nList], 0, pEnd - &pList[nList]);
148498 *pnList = nList;
148511 int nList
148513 if( nList>pMsr->nBuffer ){
148515 pMsr->nBuffer = nList*2;
148521 memcpy(pMsr->aBuffer, pList, nList);
148553 int nList;
148557 rc = fts3SegReaderNextDocid(p, apSegment[0], &pList, &nList);
148570 if( nList>0 && fts3SegReaderIsPending(apSegment[0]) ){
148571 rc = fts3MsrBufferData(pMsr, pList, nList+1);
148573 assert( (pMsr->aBuffer[nList] & 0xFE)==0x00 );
148578 fts3ColumnFilter(pMsr->iColFilter, 1, &pList, &nList);
148581 if( nList>0 ){
148584 *pnPoslist = nList;
148811 int nList = 0;
148814 fts3SegReaderNextDocid(p, apSegment[0], &pList, &nList);
148825 fts3ColumnFilter(pFilter->iCol, 0, &pList, &nList);
148828 if( !isIgnoreEmpty || nList>0 ){
148841 nByte = sqlite3Fts3VarintLen(iDelta) + (isRequirePos?nList+1:0);
148856 nWrite = sqlite3Fts3FirstFilter(iDelta, pList, nList, a);
148865 memcpy(&pCsr->aBuffer[nDoclist], pList, nList);
148866 nDoclist += nList;
152083 int nList; /* Number of phrases in expression */
152094 rc = fts3ExprLoadDoclists(pCsr, &nList, 0);
152102 nByte = sizeof(SnippetPhrase) * nList;
152115 sIter.nPhrase = nList;
152121 for(i=0; i<nList; i++){
174241 int nList = 0;
174244 sqlite3Fts5HashScanEntry(p->pHash, &zTerm, &pList, &nList);
174251 pIter->pLeaf->nn = nList;
174252 pIter->pLeaf->szLeaf = nList;
174253 pIter->iEndofDoclist = nList+1;
174651 int nList = 0;
174660 sqlite3Fts5HashScanEntry(p->pHash, (const char**)&z, &pList, &nList);
174664 sqlite3Fts5HashQuery(p->pHash, (const char*)pTerm, nTerm, &pList, &nList);
174675 pLeaf->nn = pLeaf->szLeaf = nList;