Lines Matching defs:nPrefix
151407 int nPrefix; /* Number of prior entires in the key */
152600 pIn->nPrefix = i;
152602 pIn->nPrefix = 0;
162887 if( pIn->nPrefix ){
162907 pIn->iBase, pIn->nPrefix);
178832 ** varint nPrefix; (length of prefix shared with previous term)
178878 ** varint nPrefix; (length of shared prefix with previous term)
179563 int nPrefix; /* Prefix length (0 for main terms index) */
180696 int nPrefix = 0;
180697 if( fts3GobbleInt(&p, &nPrefix) ) return SQLITE_ERROR;
180698 assert( nPrefix>=0 );
180699 if( nPrefix==0 ){
180703 aIndex[i].nPrefix = nPrefix;
181567 int nPrefix = 0; /* Size of term prefix */
181572 zCsr += fts3GetVarint32(zCsr, &nPrefix);
181573 if( nPrefix>nBuffer ){
181581 assert( nPrefix>=0 && nSuffix>=0 );
181582 if( nPrefix>zCsr-zNode || nSuffix>zEnd-zCsr || nSuffix==0 ){
181586 if( (i64)nPrefix+nSuffix>nAlloc ){
181588 nAlloc = ((i64)nPrefix+nSuffix) * 2;
181597 memcpy(&zBuffer[nPrefix], zCsr, nSuffix);
181598 nBuffer = nPrefix + nSuffix;
182756 if( p->aIndex[i].nPrefix==nTerm ){
182766 if( p->aIndex[i].nPrefix==nTerm+1 ){
190448 ** So, for a system with nPrefix prefix indexes configured, the block of
190450 ** iIndex starts at absolute level ((iLangid * (nPrefix+1) + iIndex) * 1024).
190736 if( nToken<pIndex->nPrefix ) continue;
190738 p, iCol, iPos, &pIndex->hPending, zToken, pIndex->nPrefix
191206 int nPrefix; /* Number of bytes in term prefix */
191279 pNext += fts3GetVarint32(pNext, &nPrefix);
191283 || nPrefix>pReader->nTerm
191288 /* Both nPrefix and nSuffix were read by fts3GetVarint32() and so are
191291 if( (i64)nPrefix+nSuffix>(i64)pReader->nTermAlloc ){
191292 i64 nNew = ((i64)nPrefix+nSuffix)*2;
191304 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
191305 pReader->nTerm = nPrefix+nSuffix;
191927 int nPrefix; /* Number of bytes of prefix compression */
191930 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
191931 nSuffix = nTerm-nPrefix;
191938 nReq += sqlite3Fts3VarintLen(nPrefix)+sqlite3Fts3VarintLen(nSuffix)+nSuffix;
191958 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
191962 memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
192130 int nPrefix; /* Size of term prefix in bytes */
192163 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
192164 nSuffix = nTerm-nPrefix;
192172 nReq = sqlite3Fts3VarintLen(nPrefix) + /* varint containing prefix size */
192199 assert( nPrefix<nTerm );
192200 rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
192206 nPrefix = 0;
192230 nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nPrefix);
192233 memcpy(&pWriter->aData[nData], &zTerm[nPrefix], nSuffix);
193664 int nPrefix = 0; /* Bytes to copy from previous term */
193675 p->iOff += fts3GetVarint32(&p->aNode[p->iOff], &nPrefix);
193679 if( nPrefix>p->term.n || nSuffix>p->nNode-p->iOff || nSuffix==0 ){
193682 blobGrowBuffer(&p->term, nPrefix+nSuffix, &rc);
193684 memcpy(&p->term.a[nPrefix], &p->aNode[p->iOff], nSuffix);
193685 p->term.n = nPrefix+nSuffix;
193756 int nPrefix;
193764 nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
193765 nSuffix = nTerm - nPrefix;
193767 nSpace = sqlite3Fts3VarintLen(nPrefix);
193788 pBlk->n += sqlite3Fts3PutVarint(&pBlk->a[pBlk->n], nPrefix);
193791 assert( nPrefix+nSuffix<=nTerm );
193792 assert( nPrefix>=0 );
193793 memcpy(&pBlk->a[pBlk->n], &zTerm[nPrefix], nSuffix);
193856 int nPrefix; /* Size of term prefix in bytes */
193867 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
193868 nSuffix = nTerm - nPrefix;
193874 pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nPrefix);
193877 memcpy(&pNode->a[pNode->n], &zTerm[nPrefix], nSuffix);
193908 int nPrefix; /* Size of prefix shared with previous term */
193909 int nSuffix; /* Size of suffix (nTerm - nPrefix) */
193913 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
193914 nSuffix = nTerm - nPrefix;
193917 nSpace = sqlite3Fts3VarintLen(nPrefix);
193941 rc = fts3IncrmergePush(p, pWriter, zTerm, nPrefix+1);
195233 if( p->aIndex[i].nPrefix<=nToken ){
195235 zToken, p->aIndex[i].nPrefix, iLang, i, iDocid, iCol, iPos
222117 int nPrefix; /* Number of prefix indexes */
222118 int *aPrefix; /* Sizes in bytes of nPrefix prefix indexes */
225675 if( pConfig->nPrefix==FTS5_MAX_PREFIX_INDEXES ){
225694 pConfig->aPrefix[pConfig->nPrefix] = nPre;
225695 pConfig->nPrefix++;
225698 assert( pConfig->nPrefix<=FTS5_MAX_PREFIX_INDEXES );
231696 ** of the "nPrefix" field (if there was one - it is passed 0 if this is
233994 int nPrefix; /* Bytes of prefix compression for term */
234023 nPrefix = 0;
234047 nPrefix = fts5PrefixCompress(nMin, pPage->term.p, pTerm);
234048 fts5BufferAppendVarint(&p->rc, &pPage->buf, nPrefix);
234053 fts5BufferAppendVarint(&p->rc, &pPage->buf, nTerm - nPrefix);
234054 fts5BufferAppendBlob(&p->rc, &pPage->buf, nTerm - nPrefix, &pTerm[nPrefix]);
235540 for(i=0; i<pConfig->nPrefix && rc==SQLITE_OK; i++){
235579 ** greater than pConfig->nPrefix to indicate that the query will be
235590 iIdx = 1+pConfig->nPrefix;
235595 for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){
235602 if( iIdx<=pConfig->nPrefix ){
240621 for(ii=0; rc==SQLITE_OK && ii<pCtx->pConfig->nPrefix; ii++){