Lines Matching refs:nEq
899 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol; in constructAutomaticIndex()
950 assert( (u32)n==pLoop->u.btree.nEq ); in constructAutomaticIndex()
1006 regBase, pLoop->u.btree.nEq); in constructAutomaticIndex()
1121 int n = pLoop->u.btree.nEq; in sqlite3ConstructBloomFilter()
1697 int nEq = pLoop->u.btree.nEq; in whereRangeSkipScanEst() local
1702 u8 aff = sqlite3IndexColumnAffinity(db, p, nEq); in whereRangeSkipScanEst()
1709 pColl = sqlite3LocateCollSeq(pParse, p->azColl[nEq]); in whereRangeSkipScanEst()
1723 rc = sqlite3Stat4Column(db, p->aSample[i].p, p->aSample[i].n, nEq, &pVal); in whereRangeSkipScanEst()
1814 int nEq = pLoop->u.btree.nEq; in whereRangeScanEst() local
1816 if( p->nSample>0 && ALWAYS(nEq<p->nSampleCol) in whereRangeScanEst()
1819 if( nEq==pBuilder->nRecValid ){ in whereRangeScanEst()
1854 if( nEq==0 ){ in whereRangeScanEst()
1868 if( p->aSortOrder[nEq] ){ in whereRangeScanEst()
1878 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, nBtm, nEq, &n); in whereRangeScanEst()
1895 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, nTop, nEq, &n); in whereRangeScanEst()
1989 int nEq = pBuilder->pNew->u.btree.nEq; in whereEqualScanEst() local
1995 assert( nEq>=1 ); in whereEqualScanEst()
1996 assert( nEq<=p->nColumn ); in whereEqualScanEst()
1999 assert( pBuilder->nRecValid<nEq ); in whereEqualScanEst()
2003 if( pBuilder->nRecValid<(nEq-1) ){ in whereEqualScanEst()
2009 if( nEq>=p->nColumn ){ in whereEqualScanEst()
2014 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, 1, nEq-1, &bOk); in whereEqualScanEst()
2018 pBuilder->nRecValid = nEq; in whereEqualScanEst()
2022 p->zName, nEq-1, (int)a[1])); in whereEqualScanEst()
2159 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq); in sqlite3WhereLoopPrint()
2714 int nEq, /* Number of prior equality constraints on same index */ in whereRangeVectorLen() argument
2720 nCmp = MIN(nCmp, (pIdx->nColumn - nEq)); in whereRangeVectorLen()
2744 || pLhs->iColumn!=pIdx->aiColumn[i+nEq] in whereRangeVectorLen()
2745 || pIdx->aSortOrder[i+nEq]!=pIdx->aSortOrder[nEq] in whereRangeVectorLen()
2757 if( sqlite3StrICmp(pColl->zName, pIdx->azColl[i+nEq]) ) break; in whereRangeVectorLen()
2814 pNew->u.btree.nEq, pNew->nSkip, pNew->rRun)); in whereLoopAddBtreeIndex()
2826 assert( pNew->u.btree.nEq<pProbe->nColumn ); in whereLoopAddBtreeIndex()
2827 assert( pNew->u.btree.nEq<pProbe->nKeyCol in whereLoopAddBtreeIndex()
2830 saved_nEq = pNew->u.btree.nEq; in whereLoopAddBtreeIndex()
2873 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
2959 assert( saved_nEq==pNew->u.btree.nEq ); in whereLoopAddBtreeIndex()
3020 int nEq = ++pNew->u.btree.nEq; in whereLoopAddBtreeIndex() local
3034 && ALWAYS(pNew->u.btree.nEq<=pProbe->nSampleCol) in whereLoopAddBtreeIndex()
3051 if( nEq==1 in whereLoopAddBtreeIndex()
3079 pNew->nOut += (pProbe->aiRowLogEst[nEq] - pProbe->aiRowLogEst[nEq-1]); in whereLoopAddBtreeIndex()
3115 && pNew->u.btree.nEq<pProbe->nColumn in whereLoopAddBtreeIndex()
3116 && (pNew->u.btree.nEq<pProbe->nKeyCol || in whereLoopAddBtreeIndex()
3127 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
3156 pNew->u.btree.nEq++; in whereLoopAddBtreeIndex()
3167 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
3454 pNew->u.btree.nEq = 1; in whereLoopAddBtree()
3503 pNew->u.btree.nEq = 0; in whereLoopAddBtree()
4509 assert( j>=pLoop->u.btree.nEq in wherePathSatisfiesOrderBy()
4512 if( j<pLoop->u.btree.nEq && j>=pLoop->nSkip ){ in wherePathSatisfiesOrderBy()
4541 for(i=j+1; i<pLoop->u.btree.nEq; i++){ in wherePathSatisfiesOrderBy()
4568 && j>=pLoop->u.btree.nEq in wherePathSatisfiesOrderBy()
4625 if( j==pLoop->u.btree.nEq ){ in wherePathSatisfiesOrderBy()
5213 pLoop->u.btree.nEq = 1; in whereShortCut()
5238 pLoop->u.btree.nEq = j; in whereShortCut()