Lines Matching defs:nIn
92885 int nIn; /* Number of bytes in input */
92897 nIn = sqlite3_value_bytes(argv[0]);
92929 while( nIn>0 ){
92933 if( len<=nIn && memcmp(zIn, azChar[i], len)==0 ) break;
92937 nIn -= len;
92941 while( nIn>0 ){
92945 if( len<=nIn && memcmp(&zIn[nIn-len],azChar[i],len)==0 ) break;
92948 nIn -= len;
92955 sqlite3_result_text(context, (char*)zIn, nIn, SQLITE_TRANSIENT);
110547 int nIn; /* Number of entries in aInLoop[] */
113450 if( pLevel->u.in.nIn==0 ){
113453 pLevel->u.in.nIn++;
113456 sizeof(pLevel->u.in.aInLoop[0])*pLevel->u.in.nIn);
113459 pIn += pLevel->u.in.nIn - 1;
113469 pLevel->u.in.nIn = 0;
115253 int nIn
115282 nIn = 46; assert( 46==sqlite3LogEst(25) );
115285 nIn = sqlite3LogEst(pExpr->x.pList->nExpr);
115287 assert( nIn>0 ); /* RHS always has 2 or more terms... The parser
115319 ** values of nIn and nInMul. In other words, assuming that all
115321 ** the value of pNew->nOut to account for pTerm (but not nIn/nInMul). */
115333 assert( (eOp & WO_IN) || nIn==0 );
115336 pNew->nOut -= nIn;
115359 pNew->nOut -= nIn;
115388 pNew->rRun += nInMul + nIn;
115389 pNew->nOut += nInMul + nIn;
115402 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);
117316 if( pLoop->wsFlags & WHERE_IN_ABLE && pLevel->u.in.nIn>0 ){
117320 for(j=pLevel->u.in.nIn, pIn=&pLevel->u.in.aInLoop[j-1]; j>0; j--, pIn--){
133838 int nIn = n;
133847 rc = getNextNode(pParse, zIn, nIn, &p, &nByte);
133937 assert( rc!=SQLITE_OK || (nByte>0 && nByte<=nIn) );
133938 nIn -= nByte;
133962 *pnConsumed = n - nIn;
135180 static void copy_stemmer(const char *zIn, int nIn, char *zOut, int *pnOut){
135183 for(i=0; i<nIn; i++){
135193 if( nIn>mx*2 ){
135194 for(j=mx, i=nIn-mx; i<nIn; i++, j++){
135205 ** Stem the input word zIn[0..nIn-1]. Store the output in zOut.
135206 ** zOut is at least big enough to hold nIn bytes. Write the actual
135227 static void porter_stemmer(const char *zIn, int nIn, char *zOut, int *pnOut){
135231 if( nIn<3 || nIn>=(int)sizeof(zReverse)-7 ){
135234 copy_stemmer(zIn, nIn, zOut, pnOut);
135237 for(i=0, j=sizeof(zReverse)-6; i<nIn; i++, j--){
135246 copy_stemmer(zIn, nIn, zOut, pnOut);
144031 ** all characters in string zIn/nIn to be separators (if bAlnum==0) or
144034 ** For each codepoint in the zIn/nIn string, this function checks if the
144042 ** identifies as a diacritic) occurs in the zIn/nIn string it is ignored.
144050 int nIn /* Length of z in bytes */
144053 const unsigned char *zTerm = &z[nIn];
