Home
last modified time | relevance | path

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

12

/sqlite-3.40.0/test/
H A Dvt02.c589 int iCol = pInfo->aConstraint[i].iColumn; in sqlite3BestIndexLog()
590 int op = pInfo->aConstraint[i].op; in sqlite3BestIndexLog()
609 pInfo->aConstraint[i].usable); in sqlite3BestIndexLog()
666 int iCol = pInfo->aConstraint[i].iColumn; in sqlite3BestIndexLog()
667 int op = pInfo->aConstraint[i].op; in sqlite3BestIndexLog()
750 if( !pInfo->aConstraint[i].usable ) continue; in vt02BestIndex()
752 switch( pInfo->aConstraint[i].iColumn ){ in vt02BestIndex()
776 int j = pInfo->aConstraint[i].iColumn; in vt02BestIndex()
778 if( pInfo->aConstraint[i].usable==0 in vt02BestIndex()
781 switch( pInfo->aConstraint[i].op ){ in vt02BestIndex()
[all …]
H A Dvtabrhs1.test29 # P->aConstraint[], then this routine attempts to set *V to the value
/sqlite-3.40.0/ext/misc/
H A Dqpvtab.c348 int iCol = pIdxInfo->aConstraint[i].iColumn; in qpvtabBestIndex()
349 int op = pIdxInfo->aConstraint[i].op; in qpvtabBestIndex()
350 if( iCol==QPVTAB_FLAGS && pIdxInfo->aConstraint[i].usable ){ in qpvtabBestIndex()
368 pIdxInfo->aConstraint[i].usable); in qpvtabBestIndex()
378 int iCol = pIdxInfo->aConstraint[i].iColumn; in qpvtabBestIndex()
379 int op = pIdxInfo->aConstraint[i].op; in qpvtabBestIndex()
385 if( iCol>=QPVTAB_A && pIdxInfo->aConstraint[i].usable ){ in qpvtabBestIndex()
H A Dfossildelta.c1017 if( pIdxInfo->aConstraint[i].iColumn != DELTAPARSEVTAB_DELTA ) continue; in deltaparsevtabBestIndex()
1018 if( pIdxInfo->aConstraint[i].usable==0 ) continue; in deltaparsevtabBestIndex()
1019 if( pIdxInfo->aConstraint[i].op!=SQLITE_INDEX_CONSTRAINT_EQ ) continue; in deltaparsevtabBestIndex()
H A Dunionvtab.c1277 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i]; in unionBestIndex()
1310 idxNum |= pIdxInfo->aConstraint[iLt].op; in unionBestIndex()
1316 idxNum |= pIdxInfo->aConstraint[iGt].op; in unionBestIndex()
H A Dwholenumber.c188 pConstraint = pIdxInfo->aConstraint; in wholenumberBestIndex()
H A Dcsv.c862 if( pIdxInfo->aConstraint[i].usable==0 ) continue; in csvtabBestIndex()
863 op = pIdxInfo->aConstraint[i].op; in csvtabBestIndex()
H A Dprefixes.c208 for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){ in prefixesBestIndex()
H A Dexplain.c245 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i]; in explainBestIndex()
H A Dseries.c343 pConstraint = pIdxInfo->aConstraint; in seriesBestIndex()
H A Dbtreeinfo.c164 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i]; in binfoBestIndex()
H A Dcarray.c331 pConstraint = pIdxInfo->aConstraint; in carrayBestIndex()
H A Dcompletion.c416 pConstraint = pIdxInfo->aConstraint; in completionBestIndex()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_tokenize_vtab.c242 if( pInfo->aConstraint[i].usable in fts3tokBestIndexMethod()
243 && pInfo->aConstraint[i].iColumn==0 in fts3tokBestIndexMethod()
244 && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ in fts3tokBestIndexMethod()
H A Dfts3_aux.c173 if( pInfo->aConstraint[i].usable ){ in fts3auxBestIndexMethod()
174 int op = pInfo->aConstraint[i].op; in fts3auxBestIndexMethod()
175 int iCol = pInfo->aConstraint[i].iColumn; in fts3auxBestIndexMethod()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_test_tok.c254 if( pInfo->aConstraint[i].usable in fts5tokBestIndexMethod()
255 && pInfo->aConstraint[i].iColumn==0 in fts5tokBestIndexMethod()
256 && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ in fts5tokBestIndexMethod()
/sqlite-3.40.0/src/
H A Dtest_fs.c189 struct sqlite3_index_constraint const *p = &pIdxInfo->aConstraint[ii]; in fsdirBestIndex()
394 struct sqlite3_index_constraint const *p = &pIdxInfo->aConstraint[ii]; in fstreeBestIndex()
778 struct sqlite3_index_constraint const *pCons = &pIdxInfo->aConstraint[ii]; in fsBestIndex()
H A Ddbpage.c119 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i]; in dbpageBestIndex()
140 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i]; in dbpageBestIndex()
H A Ddbstat.c226 if( pIdxInfo->aConstraint[i].op!=SQLITE_INDEX_CONSTRAINT_EQ ) continue; in statBestIndex()
227 if( pIdxInfo->aConstraint[i].usable==0 ){ in statBestIndex()
231 switch( pIdxInfo->aConstraint[i].iColumn ){ in statBestIndex()
H A Dvdbevtab.c367 for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){ in bytecodevtabBestIndex()
H A Dwhere.c713 p->aConstraint[i].iColumn, in whereTraceIndexInfoInputs()
714 p->aConstraint[i].iTermOffset, in whereTraceIndexInfoInputs()
715 p->aConstraint[i].op, in whereTraceIndexInfoInputs()
716 p->aConstraint[i].usable, in whereTraceIndexInfoInputs()
1291 pIdxInfo->aConstraint = pIdxCons; in allocateIndexInfo()
3699 pIdxCons = *(struct sqlite3_index_constraint**)&pIdxInfo->aConstraint; in whereLoopAddVirtualOne()
3741 pIdxCons = *(struct sqlite3_index_constraint**)&pIdxInfo->aConstraint; in whereLoopAddVirtualOne()
3869 int iTerm = pIdxInfo->aConstraint[iCons].iTermOffset; in sqlite3_vtab_collation()
3916 WhereTerm *pTerm = &pH->pWC->a[pIdxInfo->aConstraint[iCons].iTermOffset]; in sqlite3_vtab_rhs_value()
4078 pWC->a[p->aConstraint[i].iTermOffset].prereqRight & ~mPrereq in whereLoopAddVirtual()
H A Dtest_tclvar.c361 struct sqlite3_index_constraint const *pCons = &pIdxInfo->aConstraint[ii]; in tclvarBestIndex()
H A Dtest_bestindex.c399 struct sqlite3_index_constraint const *pCons = &pIdxInfo->aConstraint[ii]; in testBestIndexObjConstraints()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c286 RtreeConstraint *aConstraint; /* Search constraints. */ member
1097 if( pCsr->aConstraint ){ in resetCursor()
1100 sqlite3_rtree_query_info *pInfo = pCsr->aConstraint[i].pInfo; in resetCursor()
1106 sqlite3_free(pCsr->aConstraint); in resetCursor()
1107 pCsr->aConstraint = 0; in resetCursor()
1633 RtreeConstraint *pConstraint = pCur->aConstraint + ii; in rtreeStepToLeaf()
1885 if( !pCsr->aConstraint ){ in rtreeFilter()
1888 memset(pCsr->aConstraint, 0, sizeof(RtreeConstraint)*argc); in rtreeFilter()
1893 RtreeConstraint *p = &pCsr->aConstraint[ii]; in rtreeFilter()
2001 if( pIdxInfo->aConstraint[ii].op==SQLITE_INDEX_CONSTRAINT_MATCH ){ in rtreeBestIndex()
[all …]
H A Dgeopoly.c1392 pCsr->aConstraint = p = sqlite3_malloc(sizeof(RtreeConstraint)*4); in geopolyFilter()
1397 memset(pCsr->aConstraint, 0, sizeof(RtreeConstraint)*4); in geopolyFilter()
1480 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii]; in geopolyBestIndex()

12