Lines Matching refs:nPhrase
169977 int nPhrase; /* Number of matchable phrases in query */
186054 #define FTS3_MATCHINFO_HITS 'x' /* 3*nCol*nPhrase values */
186055 #define FTS3_MATCHINFO_LHITS 'y' /* nCol*nPhrase values */
186056 #define FTS3_MATCHINFO_LHITS_BM 'b' /* nCol*nPhrase values */
186071 int nPhrase; /* Number of phrases seen so far */
186087 int nPhrase; /* Number of phrases in query */
186088 SnippetPhrase *aPhrase; /* Array of size nPhrase */
186116 int nPhrase; /* Number of matchable phrases in query */
186325 p->nPhrase++;
186350 if( pnPhrase ) *pnPhrase = sCtx.nPhrase;
186361 int nPhrase = 0;
186362 (void)fts3ExprIterate(pExpr, fts3ExprPhraseCountCb, (void *)&nPhrase);
186363 return nPhrase;
186406 for(i=0; i<pIter->nPhrase; i++){
186414 for(i=0; i<pIter->nPhrase; i++){
186425 for(i=0; i<pIter->nPhrase; i++){
186453 for(i=0; i<pIter->nPhrase; i++){
186580 sIter.nPhrase = nList;
187046 nVal = pInfo->nCol * pInfo->nPhrase;
187050 nVal = pInfo->nPhrase * ((pInfo->nCol + 31) / 32);
187055 nVal = pInfo->nCol * pInfo->nPhrase * 3;
187173 aIter = sqlite3_malloc64(sizeof(LcsIterator) * pCsr->nPhrase);
187175 memset(aIter, 0, sizeof(LcsIterator) * pCsr->nPhrase);
187178 for(i=0; i<pInfo->nPhrase; i++){
187188 for(i=0; i<pInfo->nPhrase; i++){
187207 for(i=0; i<pInfo->nPhrase; i++){
187267 if( bGlobal ) pInfo->aMatchinfo[0] = pInfo->nPhrase;
187409 pCsr->nPhrase = fts3ExprPhraseCount(pCsr->pExpr);
187410 sInfo.nPhrase = pCsr->nPhrase;
187440 sInfo.nPhrase = pCsr->nPhrase;
214501 int nPhrase; /* Number of phrases in query */
214525 nPhrase = pApi->xPhraseCount(pFts);
214526 aSeen = sqlite3_malloc(nPhrase);
214561 memset(aSeen, 0, nPhrase);
214578 memset(aSeen, 0, nPhrase);
214647 int nPhrase; /* Number of phrases in query */
214683 int nPhrase; /* Number of phrases in query */
214690 nPhrase = pApi->xPhraseCount(pFts);
214691 nByte = sizeof(Fts5Bm25Data) + nPhrase*2*sizeof(double);
214697 p->nPhrase = nPhrase;
214699 p->aFreq = &p->aIDF[nPhrase];
214709 for(i=0; rc==SQLITE_OK && i<nPhrase; i++){
214768 memset(aFreq, 0, sizeof(double) * pData->nPhrase);
214790 for(i=0; i<pData->nPhrase; i++){
216239 int nPhrase; /* Number of phrases in expression */
216308 int nPhrase; /* Number of entries in aPhrase[] array */
216320 int nPhrase; /* Size of apPhrase array */
216470 pNew->nPhrase = sParse.nPhrase;
216589 int nPhrase = p1->nPhrase + p2->nPhrase;
216596 p1->apExprPhrase, nPhrase * sizeof(Fts5ExprPhrase*)
216602 memmove(&ap[p2->nPhrase], ap, p1->nPhrase*sizeof(Fts5ExprPhrase*));
216603 for(i=0; i<p2->nPhrase; i++){
216606 p1->nPhrase = nPhrase;
216877 assert( pNear->nPhrase>1 );
216881 if( pNear->nPhrase>ArraySize(aStatic) ){
216882 sqlite3_int64 nByte = sizeof(Fts5NearTrimmer) * pNear->nPhrase;
216900 for(i=0; i<pNear->nPhrase; i++){
216917 for(i=0; i<pNear->nPhrase; i++){
216931 for(i=0; i<pNear->nPhrase; i++){
216941 for(i=0; i<pNear->nPhrase; i++){
217050 for(i=0; rc==SQLITE_OK && i<pNear->nPhrase; i++){
217065 if( i==pNear->nPhrase && (i==1 || fts5ExprNearIsMatch(pRc, pNear)) ){
217090 for(i=0; i<pNear->nPhrase; i++){
217172 for(i=0; i<pNear->nPhrase; i++){
217232 assert( pNear->nPhrase>1
217250 for(i=0; i<pNear->nPhrase; i++){
217367 assert( pNode->pNear->nPhrase==1 && pPhrase->nTerm==1 );
217799 }else if( (pNear->nPhrase % SZALLOC)==0 ){
217800 int nNew = pNear->nPhrase + SZALLOC;
217818 if( pRet->nPhrase>0 ){
217819 Fts5ExprPhrase *pLast = pRet->apPhrase[pRet->nPhrase-1];
217820 assert( pLast==pParse->apPhrase[pParse->nPhrase-2] );
217823 pRet->nPhrase--;
217824 pParse->nPhrase--;
217828 pParse->apPhrase[pParse->nPhrase-2] = pPhrase;
217829 pParse->nPhrase--;
217830 pRet->nPhrase--;
217833 pRet->apPhrase[pRet->nPhrase++] = pPhrase;
217922 for(i=0; i<pNear->nPhrase; i++){
217936 if( (pParse->nPhrase % 8)==0 ){
217937 sqlite3_int64 nByte = sizeof(Fts5ExprPhrase*) * (pParse->nPhrase + 8);
217988 pParse->nPhrase++;
217998 pParse->apPhrase[pParse->nPhrase-1] = sCtx.pPhrase;
218072 pNew->nPhrase = 1;
218075 pNew->pRoot->pNear->nPhrase = 1;
218353 if( pNear->nPhrase==1 && pNear->apPhrase[0]->nTerm==1
218413 assert( pNear->nPhrase==1 );
218422 pParse->nPhrase--;
218431 pParse->apPhrase[pParse->nPhrase++] = pPhrase;
218501 for(iPhrase=0; iPhrase<pNear->nPhrase; iPhrase++){
218511 if( pNear->nPhrase!=1
218520 pNear->nPhrase==1 ? "phrase": "NEAR"
218577 assert( pParse->apPhrase[pParse->nPhrase-1]==pRight->pNear->apPhrase[0] );
218580 pParse->nPhrase--;
218592 ap = &pParse->apPhrase[pParse->nPhrase-1-pRight->pNear->nPhrase];
218594 memmove(ap, &ap[1], sizeof(Fts5ExprPhrase*)*pRight->pNear->nPhrase);
218595 pParse->nPhrase--;
218688 if( pNear->nPhrase>1 ){
218696 for(i=0; i<pNear->nPhrase; i++){
218764 if( pNear->nPhrase>1 ){
218769 for(i=0; i<pNear->nPhrase; i++){
218788 if( pNear->nPhrase>1 ){
219011 return (pExpr ? pExpr->nPhrase : 0);
219018 if( iPhrase<0 || iPhrase>=pExpr->nPhrase ) return 0;
219048 pRet = sqlite3_malloc64(sizeof(Fts5PoslistPopulator)*pExpr->nPhrase);
219051 memset(pRet, 0, sizeof(Fts5PoslistPopulator)*pExpr->nPhrase);
219052 for(i=0; i<pExpr->nPhrase; i++){
219102 for(i=0; i<pExpr->nPhrase; i++){
219134 for(i=0; i<pExpr->nPhrase; i++){
219223 assert( iPhrase>=0 && iPhrase<pExpr->nPhrase );
227503 int nPhrase;
227509 nPhrase = sqlite3Fts5ExprPhraseCount(pCsr->pExpr);
227510 nByte = sizeof(Fts5Sorter) + sizeof(int) * (nPhrase-1);
227514 pSorter->nIdx = nPhrase;
228918 ** A position-list blob begins with (nPhrase-1) varints, where nPhrase is
228930 int nPhrase = sqlite3Fts5ExprPhraseCount(pCsr->pExpr);
228938 for(i=0; i<(nPhrase-1); i++){
228945 for(i=0; i<nPhrase; i++){
228956 for(i=0; rc==SQLITE_OK && i<(nPhrase-1); i++){
228964 for(i=0; rc==SQLITE_OK && i<nPhrase; i++){