Home
last modified time | relevance | path

Searched refs:nTo (Results 1 – 4 of 4) sorted by relevance

/sqlite-3.40.0/ext/misc/
H A Dfuzzer.c313 nTo = (int)strlen(zTo); in fuzzerLoadOneRule()
327 if( nFrom>FUZZER_MX_LENGTH || nTo>FUZZER_MX_LENGTH ){ in fuzzerLoadOneRule()
340 pRule = sqlite3_malloc64( sizeof(*pRule) + nFrom + nTo ); in fuzzerLoadOneRule()
346 pRule->zFrom += nTo + 1; in fuzzerLoadOneRule()
349 memcpy(pRule->zTo, zTo, nTo+1); in fuzzerLoadOneRule()
350 pRule->nTo = (fuzzer_len)nTo; in fuzzerLoadOneRule()
623 n = pStem->nBasis + pRule->nTo - pRule->nFrom; in fuzzerRender()
635 memcpy(&z[n], pRule->zTo, pRule->nTo); in fuzzerRender()
636 memcpy(&z[n+pRule->nTo], &pStem->zBasis[n+pRule->nFrom], in fuzzerRender()
640 assert( z[pStem->nBasis + pRule->nTo - pRule->nFrom]==0 ); in fuzzerRender()
[all …]
H A Dspellfix.c764 assert( zTo!=0 || nTo==0 ); in editDist3ConfigLoad()
765 if( nFrom>100 || nTo>100 ) continue; in editDist3ConfigLoad()
782 if( nFrom==1 && zFrom[0]=='?' && nTo==0 ){ in editDist3ConfigLoad()
784 }else if( nFrom==0 && nTo==1 && zTo[0]=='?' ){ in editDist3ConfigLoad()
790 int nExtra = nFrom + nTo - 4; in editDist3ConfigLoad()
795 pCost->nTo = (u8)nTo; in editDist3ConfigLoad()
798 memcpy(pCost->a + nFrom, zTo, nTo); in editDist3ConfigLoad()
840 if( p->nTo>n ) return 0; in matchTo()
841 if( strncmp(p->a+p->nFrom, z, p->nTo)!=0 ) return 0; in matchTo()
928 if( p->nTo==0 ){ in editDist3FromStringNew()
[all …]
H A Damatch.c486 amatch_len nFrom, nTo; /* Length of the zFrom and zTo strings */ member
580 int nTo; /* Size of string zTo, in bytes */ in amatchLoadOneRule() local
586 nTo = (int)strlen(zTo); in amatchLoadOneRule()
603 if( nFrom>AMATCH_MX_LENGTH || nTo>AMATCH_MX_LENGTH ){ in amatchLoadOneRule()
622 pRule = sqlite3_malloc64( sizeof(*pRule) + nFrom + nTo ); in amatchLoadOneRule()
627 pRule->zFrom = &pRule->zTo[nTo+1]; in amatchLoadOneRule()
630 memcpy(pRule->zTo, zTo, nTo+1); in amatchLoadOneRule()
631 pRule->nTo = (amatch_len)nTo; in amatchLoadOneRule()
/sqlite-3.40.0/src/
H A Dwhere.c4789 int nTo, nFrom; /* Number of valid entries in aTo[] and aFrom[] */ in wherePathSolver() local
4867 nTo = 0; in wherePathSolver()
4942 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){ in wherePathSolver()
4946 testcase( jj==nTo-1 ); in wherePathSolver()
4950 if( jj>=nTo ){ in wherePathSolver()
4952 if( nTo>=mxChoice in wherePathSolver()
4969 if( nTo<mxChoice ){ in wherePathSolver()
4971 jj = nTo++; in wherePathSolver()
5039 if( nTo>=mxChoice ){ in wherePathSolver()
5059 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){ in wherePathSolver()
[all …]