Home
last modified time | relevance | path

Searched refs:nList (Results 1 – 9 of 9) sorted by relevance

/sqlite-3.40.0/ext/fts3/
H A Dfts3.c2771 char *pEnd = &pList[nList]; in sqlite3Fts3FirstFilter()
4223 p->doclist.nAll = nList; in fts3EvalPhraseMergeToken()
4241 nRight = nList; in fts3EvalPhraseMergeToken()
4247 nLeft = nList; in fts3EvalPhraseMergeToken()
4319 int nList; in fts3EvalDeferredPhrase() local
4332 nPoslist = nList; in fts3EvalDeferredPhrase()
4624 int nList; member
4650 p->nList = pPhrase->doclist.nList; in incrPhraseTokenNext()
4746 int nList = 0; in fts3EvalIncrPhraseNext() local
4767 pDL->nList = nList; in fts3EvalIncrPhraseNext()
[all …]
H A Dfts3_write.c2627 int nList = *pnList; in fts3ColumnFilter() local
2644 if( nList<=0 ){ in fts3ColumnFilter()
2652 memset(&pList[nList], 0, pEnd - &pList[nList]); in fts3ColumnFilter()
2655 *pnList = nList; in fts3ColumnFilter()
2668 i64 nList in fts3MsrBufferData() argument
2670 if( nList>pMsr->nBuffer ){ in fts3MsrBufferData()
2678 assert( nList>0 ); in fts3MsrBufferData()
2711 int nList; in sqlite3Fts3MsrIncrNext() local
2739 if( nList>0 ){ in sqlite3Fts3MsrIncrNext()
2742 *pnPoslist = nList; in sqlite3Fts3MsrIncrNext()
[all …]
H A Dfts3_snippet.c526 int nList; /* Number of phrases in expression */ in fts3BestSnippet() local
537 rc = fts3ExprLoadDoclists(pCsr, &nList, 0); in fts3BestSnippet()
545 nByte = sizeof(SnippetPhrase) * nList; in fts3BestSnippet()
557 sIter.nPhrase = nList; in fts3BestSnippet()
563 for(i=0; i<nList; i++){ in fts3BestSnippet()
H A Dfts3Int.h395 int nList; /* Length of position list */ member
/sqlite-3.40.0/ext/fts5/
H A Dfts5_hash.c506 int nList = p->nData - nHashPre; in sqlite3Fts5HashQuery() local
507 u8 *pRet = (u8*)(*ppOut = sqlite3_malloc64(nPre + nList + 10)); in sqlite3Fts5HashQuery()
510 memcpy(&pRet[nPre], &((u8*)p)[nHashPre], nList); in sqlite3Fts5HashQuery()
511 nList += fts5HashAddPoslistSize(pHash, p, pFaux); in sqlite3Fts5HashQuery()
512 *pnDoclist = nList; in sqlite3Fts5HashQuery()
H A Dfts5_index.c1995 int nList; in fts5SegIterNext_None() local
2000 pIter->pLeaf->nn = nList; in fts5SegIterNext_None()
2001 pIter->pLeaf->szLeaf = nList; in fts5SegIterNext_None()
2002 pIter->iEndofDoclist = nList; in fts5SegIterNext_None()
2069 int nList = 0; in fts5SegIterNext() local
2080 pIter->pLeaf->nn = nList; in fts5SegIterNext()
2081 pIter->pLeaf->szLeaf = nList; in fts5SegIterNext()
2082 pIter->iEndofDoclist = nList+1; in fts5SegIterNext()
2516 int nList = 0; in fts5SegIterHashInit() local
2538 (const char*)pTerm, nTerm, (void**)&pLeaf, &nList in fts5SegIterHashInit()
[all …]
/sqlite-3.40.0/src/
H A Dwal.c1707 int nList; /* Number of elements in aList */ in walMergesort() member
1711 const int nList = *pnList; /* Size of input list */ in walMergesort() local
1719 assert( nList<=HASHTABLE_NPAGE && nList>0 ); in walMergesort()
1722 for(iList=0; iList<nList; iList++){ in walMergesort()
1729 assert( p->aList && p->nList<=(1<<iSub) ); in walMergesort()
1731 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer); in walMergesort()
1734 aSub[iSub].nList = nMerge; in walMergesort()
1738 if( nList & (1<<iSub) ){ in walMergesort()
1742 assert( p->nList<=(1<<iSub) ); in walMergesort()
1743 assert( p->aList==&aList[nList&~((2<<iSub)-1)] ); in walMergesort()
[all …]
H A Dalter.c709 int nList; /* Number of tokens in pList */ member
976 pCtx->nList++; in renameTokenFind()
1211 zOut = sqlite3DbMallocZero(db, nSql + pRename->nList*nQuot + 1); in renameEditSql()
H A Dpager.c3133 int nList; /* Number of pages in pList */ in pagerWalFrames() local
3152 nList = 0; in pagerWalFrames()
3156 nList++; in pagerWalFrames()
3161 nList = 1; in pagerWalFrames()
3163 pPager->aStat[PAGER_STAT_WRITE] += nList; in pagerWalFrames()