contrib/sqlite3/sqlite3.c

98786   int nIn;                          /* Number of bytes in input */
98798   nIn = sqlite3_value_bytes(argv[0]);
98830       while( nIn>0 ){
98834           if( len<=nIn && memcmp(zIn, azChar[i], len)==0 ) break;
98838         nIn -= len;
98842       while( nIn>0 ){
98846           if( len<=nIn && memcmp(&zIn[nIn-len],azChar[i],len)==0 ) break;
98849         nIn -= len;
98856   sqlite3_result_text(context, (char*)zIn, nIn, SQLITE_TRANSIENT);
116967       int nIn;              /* Number of entries in aInLoop[] */
117790     if( pLevel->u.in.nIn==0 ){
117793     pLevel->u.in.nIn++;
117796                               sizeof(pLevel->u.in.aInLoop[0])*pLevel->u.in.nIn);
117799       pIn += pLevel->u.in.nIn - 1;
117809       pLevel->u.in.nIn = 0;
122315     int nIn = 0;
122348         nIn = 46;  assert( 46==sqlite3LogEst(25) );
122351         nIn = sqlite3LogEst(pExpr->x.pList->nExpr);
122353       assert( nIn>0 );  /* RHS always has 2 or more terms...  The parser
122396     ** values of nIn and nInMul. In other words, assuming that all
122398     ** the value of pNew->nOut to account for pTerm (but not nIn/nInMul).  */
122410         assert( (eOp & WO_IN) || nIn==0 );
122413         pNew->nOut -= nIn;
122436             pNew->nOut -= nIn;
122465     pNew->rRun += nInMul + nIn;
122466     pNew->nOut += nInMul + nIn;
122479       whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);
124517     if( pLoop->wsFlags & WHERE_IN_ABLE && pLevel->u.in.nIn>0 ){
124521       for(j=pLevel->u.in.nIn, pIn=&pLevel->u.in.aInLoop[j-1]; j>0; j--, pIn--){
141545   int nIn = n;
141554     rc = getNextNode(pParse, zIn, nIn, &p, &nByte);
141644     assert( rc!=SQLITE_OK || (nByte>0 && nByte<=nIn) );
141645     nIn -= nByte;
141669   *pnConsumed = n - nIn;
142891 static void copy_stemmer(const char *zIn, int nIn, char *zOut, int *pnOut){
142894   for(i=0; i<nIn; i++){
142904   if( nIn>mx*2 ){
142905     for(j=mx, i=nIn-mx; i<nIn; i++, j++){
142916 ** Stem the input word zIn[0..nIn-1].  Store the output in zOut.
142917 ** zOut is at least big enough to hold nIn bytes.  Write the actual
142938 static void porter_stemmer(const char *zIn, int nIn, char *zOut, int *pnOut){
142942   if( nIn<3 || nIn>=(int)sizeof(zReverse)-7 ){
142945     copy_stemmer(zIn, nIn, zOut, pnOut);
142948   for(i=0, j=sizeof(zReverse)-6; i<nIn; i++, j--){
142957       copy_stemmer(zIn, nIn, zOut, pnOut);
151945 ** all characters in string zIn/nIn to be separators (if bAlnum==0) or
151948 ** For each codepoint in the zIn/nIn string, this function checks if the
151956 ** identifies as a diacritic) occurs in the zIn/nIn string it is ignored.
151964   int nIn                         /* Length of z in bytes */
151967   const unsigned char *zTerm = &z[nIn];