Home
last modified time | relevance | path

Searched refs:nConstraint (Results 1 – 25 of 46) sorted by relevance

12

/sqlite-3.40.0/src/
H A Dwherecode.c1416 int nConstraint = pLoop->nLTerm; in sqlite3WhereCodeOneLoopStart() local
1420 for(j=0; j<nConstraint; j++){ in sqlite3WhereCodeOneLoopStart()
1463 for(j=0; j<nConstraint; j++){ in sqlite3WhereCodeOneLoopStart()
1841 nConstraint = nEq; in sqlite3WhereCodeOneLoopStart()
1855 nConstraint += nBtm; in sqlite3WhereCodeOneLoopStart()
1867 nConstraint++; in sqlite3WhereCodeOneLoopStart()
1871 nConstraint++; in sqlite3WhereCodeOneLoopStart()
1941 nConstraint = nEq; in sqlite3WhereCodeOneLoopStart()
1969 nConstraint += nTop; in sqlite3WhereCodeOneLoopStart()
1982 nConstraint++; in sqlite3WhereCodeOneLoopStart()
[all …]
H A Dtest_fs.c188 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in fsdirBestIndex()
393 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in fstreeBestIndex()
777 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in fsBestIndex()
H A Ddbpage.c118 for(i=0; i<pIdxInfo->nConstraint; i++){ in dbpageBestIndex()
139 for(i=0; i<pIdxInfo->nConstraint; i++){ in dbpageBestIndex()
H A Dwhere.c709 for(i=0; i<p->nConstraint; i++){ in whereTraceIndexInfoInputs()
729 for(i=0; i<p->nConstraint; i++){ in whereTraceIndexInfoOutputs()
1343 pIdxInfo->nConstraint = j; in allocateIndexInfo()
1371 for(i=0; i<pIdxInfo->nConstraint; i++){ in freeIndexInfo()
3691 int nConstraint = pIdxInfo->nConstraint; in whereLoopAddVirtualOne() local
3700 for(i=0; i<nConstraint; i++, pIdxCons++){ in whereLoopAddVirtualOne()
3738 assert( pNew->nLSlot>=nConstraint ); in whereLoopAddVirtualOne()
3747 if( iTerm>=nConstraint in whereLoopAddVirtualOne()
3757 testcase( iTerm==nConstraint-1 ); in whereLoopAddVirtualOne()
4026 nConstraint = p->nConstraint; in whereLoopAddVirtual()
[all …]
H A Dtest_bestindex.c398 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in testBestIndexObjConstraints()
672 if( iCons<0 || iCons>=pIdxInfo->nConstraint ){ in tclBestIndex()
H A Dvdbevtab.c367 for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){ in bytecodevtabBestIndex()
H A Dtest_tclvar.c360 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in tclvarBestIndex()
/sqlite-3.40.0/test/
H A Dvt02.c584 zLogTab, iBI, pInfo->nConstraint in sqlite3BestIndexLog()
586 for(i=0; i<pInfo->nConstraint; i++){ in sqlite3BestIndexLog()
665 for(i=0; i<pInfo->nConstraint; i++){ in sqlite3BestIndexLog()
748 for(i=0; i<pInfo->nConstraint; i++){ in vt02BestIndex()
775 for(i=0; i<pInfo->nConstraint; i++){ in vt02BestIndex()
930 for(i=0; i<pInfo->nConstraint; i++){ in vt02BestIndex()
/sqlite-3.40.0/ext/misc/
H A Dqpvtab.c345 sqlite3_str_appendf(pStr, "nConstraint,%d,,,,\n", pIdxInfo->nConstraint); in qpvtabBestIndex()
346 for(i=0; i<pIdxInfo->nConstraint; i++){ in qpvtabBestIndex()
377 for(i=0; i<pIdxInfo->nConstraint; i++){ in qpvtabBestIndex()
H A Dwholenumber.c189 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in wholenumberBestIndex()
H A Dclosure.c834 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in closureBestIndex()
898 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in closureBestIndex()
H A Dprefixes.c208 for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){ in prefixesBestIndex()
H A Dexplain.c244 for(i=0; i<pIdxInfo->nConstraint; i++){ in explainBestIndex()
H A Dseries.c344 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in seriesBestIndex()
H A Dbtreeinfo.c163 for(i=0; i<pIdxInfo->nConstraint; i++){ in binfoBestIndex()
H A Dcarray.c332 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in carrayBestIndex()
H A Dcompletion.c417 for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){ in completionBestIndex()
H A Dcsv.c860 for(i=0; i<pIdxInfo->nConstraint; i++){ in csvtabBestIndex()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c285 int nConstraint; /* Number of entries in aConstraint */ member
1099 for(i=0; i<pCsr->nConstraint; i++){ in resetCursor()
1616 int nConstraint = pCur->nConstraint; in rtreeStepToLeaf() local
1632 for(ii=0; ii<nConstraint; ii++){ in rtreeStepToLeaf()
1884 pCsr->nConstraint = argc; in rtreeFilter()
2000 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in rtreeBestIndex()
2007 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){ in rtreeBestIndex()
H A Dgeopoly.c1393 pCsr->nConstraint = 4; in geopolyFilter()
1479 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in geopolyBestIndex()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_tokenize_vtab.c241 for(i=0; i<pInfo->nConstraint; i++){ in fts3tokBestIndexMethod()
H A Dfts3_aux.c172 for(i=0; i<pInfo->nConstraint; i++){ in fts3auxBestIndexMethod()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_test_tok.c253 for(i=0; i<pInfo->nConstraint; i++){ in fts5tokBestIndexMethod()
H A Dfts5_main.c578 idxStr = (char*)sqlite3_malloc(pInfo->nConstraint * 8 + 1); in fts5BestIndexMethod()
583 for(i=0; i<pInfo->nConstraint; i++){ in fts5BestIndexMethod()
594 assert( iIdxStr < pInfo->nConstraint*6 + 1 ); in fts5BestIndexMethod()
629 for(i=0; i<pInfo->nConstraint; i++){ in fts5BestIndexMethod()
/sqlite-3.40.0/ext/recover/
H A Ddbdata.c214 for(i=0; i<pIdx->nConstraint; i++){ in dbdataBestIndex()

12