Lines Matching refs:nPrefix

156891         int nPrefix;           /* Number of prior entries in the key */
158115               pIn->nPrefix = i;
158117               pIn->nPrefix = 0;
169097           if( pIn->nPrefix ){
169117                   pIn->iBase, pIn->nPrefix);
186068     int nPrefix;                  /* Prefix length (0 for main terms index) */
187206       int nPrefix = 0;
187207       if( fts3GobbleInt(&p, &nPrefix) ) return SQLITE_ERROR;
187208       assert( nPrefix>=0 );
187209       if( nPrefix==0 ){
187213         aIndex[i].nPrefix = nPrefix;
188077     int nPrefix = 0;              /* Size of term prefix */
188082       zCsr += fts3GetVarint32(zCsr, &nPrefix);
188083       if( nPrefix>nBuffer ){
188091     assert( nPrefix>=0 && nSuffix>=0 );
188092     if( nPrefix>zCsr-zNode || nSuffix>zEnd-zCsr || nSuffix==0 ){
188096     if( (i64)nPrefix+nSuffix>nAlloc ){
188098       nAlloc = ((i64)nPrefix+nSuffix) * 2;
188107     memcpy(&zBuffer[nPrefix], zCsr, nSuffix);
188108     nBuffer = nPrefix + nSuffix;
189266         if( p->aIndex[i].nPrefix==nTerm ){
189276         if( p->aIndex[i].nPrefix==nTerm+1 ){
197320       if( nToken<pIndex->nPrefix ) continue;
197322           p, iCol, iPos, &pIndex->hPending, zToken, pIndex->nPrefix
197790   int nPrefix;                    /* Number of bytes in term prefix */
197863   pNext += fts3GetVarint32(pNext, &nPrefix);
197867    || nPrefix>pReader->nTerm
197875   if( (i64)nPrefix+nSuffix>(i64)pReader->nTermAlloc ){
197876     i64 nNew = ((i64)nPrefix+nSuffix)*2;
197888   memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
197889   pReader->nTerm = nPrefix+nSuffix;
198511     int nPrefix;                  /* Number of bytes of prefix compression */
198514     nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
198515     nSuffix = nTerm-nPrefix;
198522     nReq += sqlite3Fts3VarintLen(nPrefix)+sqlite3Fts3VarintLen(nSuffix)+nSuffix;
198542         nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
198546       memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
198714   int nPrefix;                    /* Size of term prefix in bytes */
198747   nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
198748   nSuffix = nTerm-nPrefix;
198756   nReq = sqlite3Fts3VarintLen(nPrefix) +    /* varint containing prefix size */
198783     assert( nPrefix<nTerm );
198784     rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
198790     nPrefix = 0;
198814   nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nPrefix);
198817   memcpy(&pWriter->aData[nData], &zTerm[nPrefix], nSuffix);
200253   int nPrefix = 0;                /* Bytes to copy from previous term */
200264       p->iOff += fts3GetVarint32(&p->aNode[p->iOff], &nPrefix);
200268     if( nPrefix>p->term.n || nSuffix>p->nNode-p->iOff || nSuffix==0 ){
200271     blobGrowBuffer(&p->term, nPrefix+nSuffix, &rc);
200273       memcpy(&p->term.a[nPrefix], &p->aNode[p->iOff], nSuffix);
200274       p->term.n = nPrefix+nSuffix;
200345     int nPrefix;
200353     nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
200354     nSuffix = nTerm - nPrefix;
200356     nSpace  = sqlite3Fts3VarintLen(nPrefix);
200377           pBlk->n += sqlite3Fts3PutVarint(&pBlk->a[pBlk->n], nPrefix);
200380         assert( nPrefix+nSuffix<=nTerm );
200381         assert( nPrefix>=0 );
200382         memcpy(&pBlk->a[pBlk->n], &zTerm[nPrefix], nSuffix);
200445   int nPrefix;                    /* Size of term prefix in bytes */
200458   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
200459   nSuffix = nTerm - nPrefix;
200465     pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nPrefix);
200468   memcpy(&pNode->a[pNode->n], &zTerm[nPrefix], nSuffix);
200499   int nPrefix;                  /* Size of prefix shared with previous term */
200504   nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
200505   nSuffix = nTerm - nPrefix;
200508   nSpace  = sqlite3Fts3VarintLen(nPrefix);
200536       rc = fts3IncrmergePush(p, pWriter, zTerm, nPrefix+1);
201829                 if( p->aIndex[i].nPrefix<=nToken ){
201831                       zToken, p->aIndex[i].nPrefix, iLang, i, iDocid, iCol, iPos
232238   int nPrefix;                    /* Number of prefix indexes */
235900       if( pConfig->nPrefix==FTS5_MAX_PREFIX_INDEXES ){
235919       pConfig->aPrefix[pConfig->nPrefix] = nPre;
235920       pConfig->nPrefix++;
235923     assert( pConfig->nPrefix<=FTS5_MAX_PREFIX_INDEXES );
244930   int nPrefix;                    /* Bytes of prefix compression for term */
244959     nPrefix = 0;
244983     nPrefix = fts5PrefixCompress(nMin, pPage->term.p, pTerm);
244984     fts5BufferAppendVarint(&p->rc, &pPage->buf, nPrefix);
244989   fts5BufferAppendVarint(&p->rc, &pPage->buf, nTerm - nPrefix);
244990   fts5BufferAppendBlob(&p->rc, &pPage->buf, nTerm - nPrefix, &pTerm[nPrefix]);
245858       int nPrefix = 0;
245868         iKeyOff += fts5GetVarint32(&aPg[iKeyOff], nPrefix);
245872       nPrefix = MIN(nPrefix, nPrefix2);
245873       nSuffix = (nPrefix2 + nSuffix2) - nPrefix;
245879           iOff += sqlite3Fts5PutVarint(&aPg[iOff], nPrefix);
245884         }else if( nPrefix2>nPrefix ){
245885           memcpy(&aPg[iOff], &pSeg->term.p[nPrefix], nPrefix2-nPrefix);
245886           iOff += (nPrefix2-nPrefix);
247073   for(i=0; i<pConfig->nPrefix && rc==SQLITE_OK; i++){
247579       iIdx = 1+pConfig->nPrefix;
247584       for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){
247594     }else if( iIdx<=pConfig->nPrefix ){
253638   for(ii=0; rc==SQLITE_OK && ii<pCtx->pConfig->nPrefix; ii++){