Lines Matching defs:zTerm
20184 ** During translation, assume that the byte that zTerm points
20208 #define READ_UTF8(zIn, zTerm, c) \
20212 while( zIn!=zTerm && (*zIn & 0xc0)==0x80 ){ \
20225 /* Same as READ_UTF8() above but without the zTerm parameter.
20261 unsigned char *zTerm; /* End of input */
20292 zTerm = &zIn[pMem->n&~1];
20293 while( zIn<zTerm ){
20321 /* Set zIn to point at the start of the input buffer and zTerm to point 1
20328 zTerm = &zIn[pMem->n];
20338 while( zIn<zTerm ){
20339 /* c = sqlite3Utf8Read(zIn, zTerm, (const u8**)&zIn); */
20340 READ_UTF8(zIn, zTerm, c);
20346 while( zIn<zTerm ){
20347 /* c = sqlite3Utf8Read(zIn, zTerm, (const u8**)&zIn); */
20348 READ_UTF8(zIn, zTerm, c);
20358 while( zIn<zTerm ){
20359 READ_UTF16LE(zIn, zIn<zTerm, c);
20364 while( zIn<zTerm ){
20365 READ_UTF16BE(zIn, zIn<zTerm, c);
20442 const u8 *zTerm;
20444 zTerm = &z[nByte];
20446 zTerm = (const u8*)(-1);
20448 assert( z<=zTerm );
20449 while( *z!=0 && z<zTerm ){
114431 const char *zTerm;
114454 char *zTerm; /* Pointer to term buffer */
114455 int nTerm; /* Size of zTerm in bytes */
115575 ** passed in zTerm/nTerm.
115581 ** that heads a sub-tree that may contain a term for which zTerm/nTerm is
115587 const char *zTerm, /* Term to select leaves for */
115588 int nTerm, /* Size of term zTerm in bytes */
115656 ** headed by node iChild are smaller than zTerm. No need to search
115662 cmp = memcmp(zTerm, zBuffer, (nBuffer>nTerm ? nTerm : nBuffer));
115687 ** interior node of a b-tree segment. The zTerm buffer (size nTerm bytes)
115708 const char *zTerm, /* Term to select leaves for */
115709 int nTerm, /* Size of term zTerm in bytes */
115721 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
115731 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, 0);
115742 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, piLeaf2);
116560 const char *zTerm, /* Term to query for */
116561 int nTerm, /* Size of zTerm in bytes */
116563 int isScan, /* True to scan from zTerm to EOF */
116578 rc = sqlite3Fts3SegReaderPending(p, iIndex, zTerm, nTerm, isPrefix, &pSeg);
116599 /* If zTerm is not NULL, and this segment is not stored entirely on its
116601 if( iStartBlock && zTerm ){
116603 rc = fts3SelectLeaf(p, zTerm, nTerm, zRoot, nRoot, &iStartBlock, pi);
116631 const char *zTerm, /* Term to query for */
116632 int nTerm, /* Size of zTerm in bytes */
116634 int isScan, /* True to scan from zTerm to EOF */
116653 p, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
116659 ** passed as the 4th argument also scan the doclist for term zTerm/nTerm.
116665 const char *zTerm, /* Term to scan doclist of */
116666 int nTerm, /* Number of bytes in zTerm */
116669 return fts3SegReaderCursor(p, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0,pCsr);
116673 ** Open an Fts3MultiSegReader to scan the doclist for term zTerm/nTerm. Or,
116675 ** zTerm/nTerm is a prefix. If successful, return SQLITE_OK and write
116687 const char *zTerm, /* Term to query for */
116688 int nTerm, /* Size of zTerm in bytes */
116706 p, i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0, pSegcsr);
116715 p, i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 1, 0, pSegcsr
116718 rc = fts3SegReaderCursorAddZero(p, zTerm, nTerm, pSegcsr);
116726 p, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, isPrefix, 0, pSegcsr
116767 filter.zTerm = pTok->z;
119274 sqlite3_free((void *)pCsr->filter.zTerm);
119323 int mc = memcmp(pCsr->zStop, pCsr->csr.zTerm, n);
119417 testcase(pCsr->filter.zTerm);
119419 sqlite3_free((void *)pCsr->filter.zTerm);
119429 pCsr->filter.zTerm = sqlite3_mprintf("%s", zStr);
119431 if( pCsr->filter.zTerm==0 ) return SQLITE_NOMEM;
119442 pCsr->filter.zTerm, pCsr->filter.nTerm, 0, isScan, &pCsr->csr
119472 sqlite3_result_text(pContext, p->csr.zTerm, p->csr.nTerm, SQLITE_TRANSIENT);
122391 char *zTerm; /* Pointer to current term */
122392 int nTermAlloc; /* Allocated size of zTerm buffer */
122420 char *zTerm; /* Pointer to previous term buffer */
122421 int nTerm; /* Number of bytes in zTerm */
122423 char *zMalloc; /* Malloc'd space (possibly) used for zTerm */
122452 char *zTerm; /* Pointer to previous term buffer */
122453 int nTerm; /* Number of bytes in zTerm */
122455 char *zMalloc; /* Malloc'd space (possibly) used for zTerm */
123358 pReader->zTerm = (char *)fts3HashKey(pElem);
123412 char *zNew = sqlite3_realloc(pReader->zTerm, nNew);
123416 pReader->zTerm = zNew;
123423 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
123606 sqlite3_free(pReader->zTerm);
123705 const char *zTerm, /* Term to search for */
123706 int nTerm, /* Size of buffer zTerm */
123724 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
123754 Fts3HashElem *pE = fts3HashFindElem(pHash, zTerm, nTerm);
123798 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pLhs->nTerm);
123800 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pRhs->nTerm);
123853 ** points to with the term specified by arguments zTerm and nTerm.
123856 ** -ve if the pSeg term is less than zTerm/nTerm, 0 if the two terms are
123857 ** equal, or +ve if the pSeg term is greater than zTerm/nTerm.
123861 const char *zTerm, /* Term to compare to */
123862 int nTerm /* Size of term zTerm in bytes */
123867 res = memcmp(pSeg->zTerm, zTerm, nTerm);
123869 res = memcmp(pSeg->zTerm, zTerm, pSeg->nTerm);
123983 ** Add term zTerm to the SegmentNode. It is guaranteed that zTerm is larger
123989 int isCopyTerm, /* True if zTerm/nTerm is transient */
123990 const char *zTerm, /* Pointer to buffer containing term */
124002 int nReq = nData; /* Required space after adding zTerm */
124006 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
124010 if( nReq<=p->nNodeSize || !pTree->zTerm ){
124027 if( pTree->zTerm ){
124033 memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
124046 pTree->zTerm = pTree->zMalloc;
124047 memcpy(pTree->zTerm, zTerm, nTerm);
124050 pTree->zTerm = (char *)zTerm;
124057 /* If control flows to here, it was not possible to append zTerm to the
124075 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
124087 rc = fts3NodeAddTerm(p, &pNew, isCopyTerm, zTerm, nTerm);
124195 int isCopyTerm, /* True if buffer zTerm must be copied */
124196 const char *zTerm, /* Pointer to buffer containing term */
124234 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
124255 ** to the database (still available in pWriter->zTerm), and
124258 ** leaf node (zTerm/nTerm).
124260 ** In other words, it must be the prefix of zTerm 1 byte longer than
124261 ** the common prefix (if any) of zTerm and pWriter->zTerm.
124264 rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
124293 memcpy(&pWriter->aData[nData], &zTerm[nPrefix], nSuffix);
124301 ** zTerm is transient, so take a copy of the term data. Otherwise, just
124312 pWriter->zTerm = zNew;
124314 assert( pWriter->zTerm==pWriter->zMalloc );
124315 memcpy(pWriter->zTerm, zTerm, nTerm);
124317 pWriter->zTerm = (char *)zTerm;
124625 const char *zTerm, /* Term searched for (or NULL) */
124626 int nTerm /* Length of zTerm in bytes */
124642 }while( zTerm && fts3SegReaderTermCmp(pSeg, zTerm, nTerm)<0 );
124655 return fts3SegReaderStart(p, pCsr, pFilter->zTerm, pFilter->nTerm);
124662 const char *zTerm, /* Term to iterate through a doclist for */
124663 int nTerm /* Number of bytes in zTerm */
124673 assert( zTerm && nTerm>0 );
124675 /* Advance each segment iterator until it points to the term zTerm/nTerm. */
124676 rc = fts3SegReaderStart(p, pCsr, zTerm, nTerm);
124679 /* Determine how many of the segments actually point to zTerm/nTerm. */
124682 if( !pSeg->aNode || fts3SegReaderTermCmp(pSeg, zTerm, nTerm) ){
124716 assert( pCsr->zTerm==0 );
124773 pCsr->zTerm = apSegment[0]->zTerm;
124776 ** to does not share a suffix with pFilter->zTerm/nTerm, then all
124782 if( pFilter->zTerm && !isScan ){
124785 || memcmp(pCsr->zTerm, pFilter->zTerm, pFilter->nTerm)
124795 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
124976 csr.zTerm, csr.nTerm, csr.aDoclist, csr.nDoclist);