Lines Matching refs:nEq
99518 tRowcnt nEq = p->current.anEq[0];
99521 if( (nLt/p->nPSample)!=(nLt+nEq)/p->nPSample ){
128751 u16 nEq; /* Number of equality constraints */
129257 u16 nEq = pLoop->u.btree.nEq;
129261 if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;
129263 for(i=0; i<nEq; i++){
129318 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))
129685 int nEq = 0;
129707 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
129717 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);
129741 pLevel->u.in.nIn += nEq;
129753 testcase( nEq>1 ); /* Happens with a UNIQUE index on ROWID */
129831 u16 nEq; /* The number of == or IN constraints to code */
129845 nEq = pLoop->u.btree.nEq;
129853 nReg = pLoop->u.btree.nEq + nExtraReg;
129880 assert( zAff==0 || (int)strlen(zAff)>=nEq );
129881 for(j=nSkip; j<nEq; j++){
130149 if( pLoop->u.btree.nEq==0 && pTerm!=pEndRange ){
130502 assert( pLoop->u.btree.nEq==1 );
130669 u16 nEq = pLoop->u.btree.nEq; /* Number of == or IN terms */
130689 assert( nEq>=pLoop->nSkip );
130704 && (pIdx->nKeyCol>nEq)
130714 j = nEq;
130736 testcase( pIdx->aSortOrder[nEq]==SQLITE_SO_DESC );
130739 pLevel->iLikeRepCntr |= bRev ^ (pIdx->aSortOrder[nEq]==SQLITE_SO_DESC);
130743 j = pIdx->aiColumn[nEq];
130755 if( (nEq<pIdx->nKeyCol && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC))
130756 || (bRev && pIdx->nKeyCol==nEq)
130769 assert( zStartAff==0 || sqlite3Strlen30(zStartAff)>=nEq );
130771 zEndAff = sqlite3DbStrDup(db, &zStartAff[nEq]);
130781 start_constraints = pRangeStart || nEq>0;
130784 nConstraint = nEq;
130787 codeExprOrVector(pParse, pRight, regBase+nEq, nBtm);
130792 sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);
130796 updateRangeAffinityStr(pRight, nBtm, &zStartAff[nEq]);
130807 sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
130833 nConstraint = nEq;
130836 sqlite3ExprCacheRemove(pParse, regBase+nEq, 1);
130837 codeExprOrVector(pParse, pRight, regBase+nEq, nTop);
130842 sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);
130847 codeApplyAffinity(pParse, regBase+nEq, nTop, zEndAff);
130860 sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
130861 sqlite3ExprCacheRemove(pParse, regBase+nEq, 1);
133636 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol;
133683 assert( (u32)n==pLoop->u.btree.nEq );
134228 int nEq = pLoop->u.btree.nEq;
134233 u8 aff = sqlite3IndexColumnAffinity(db, p, nEq);
134240 pColl = sqlite3LocateCollSeq(pParse, p->azColl[nEq]);
134254 rc = sqlite3Stat4Column(db, p->aSample[i].p, p->aSample[i].n, nEq, &pVal);
134345 int nEq = pLoop->u.btree.nEq;
134347 if( p->nSample>0 && nEq<p->nSampleCol ){
134348 if( nEq==pBuilder->nRecValid ){
134383 if( nEq==0 ){
134397 if( p->aSortOrder[nEq] ){
134407 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, nBtm, nEq, &n);
134424 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, nTop, nEq, &n);
134518 int nEq = pBuilder->pNew->u.btree.nEq;
134524 assert( nEq>=1 );
134525 assert( nEq<=p->nColumn );
134528 assert( pBuilder->nRecValid<nEq );
134532 if( pBuilder->nRecValid<(nEq-1) ){
134538 if( nEq>=p->nColumn ){
134543 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, 1, nEq-1, &bOk);
134547 pBuilder->nRecValid = nEq;
134551 p->zName, nEq-1, (int)a[1]));
134679 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq);
135189 int nEq, /* Number of prior equality constraints on same index */
135195 nCmp = MIN(nCmp, (pIdx->nColumn - nEq));
135216 || pLhs->iColumn!=pIdx->aiColumn[i+nEq]
135217 || pIdx->aSortOrder[i+nEq]!=pIdx->aSortOrder[nEq]
135229 if( sqlite3StrICmp(pColl->zName, pIdx->azColl[i+nEq]) ) break;
135285 pProbe->zName, pNew->u.btree.nEq));
135297 assert( pNew->u.btree.nEq<pProbe->nColumn );
135299 saved_nEq = pNew->u.btree.nEq;
135349 pNew->u.btree.nEq = saved_nEq;
135388 assert( saved_nEq==pNew->u.btree.nEq );
135445 int nEq = ++pNew->u.btree.nEq;
135459 && pNew->u.btree.nEq<=pProbe->nSampleCol
135482 pNew->nOut += (pProbe->aiRowLogEst[nEq] - pProbe->aiRowLogEst[nEq-1]);
135517 && pNew->u.btree.nEq<pProbe->nColumn
135527 pNew->u.btree.nEq = saved_nEq;
135553 pNew->u.btree.nEq++;
135564 pNew->u.btree.nEq = saved_nEq;
135766 pNew->u.btree.nEq = 1;
135811 pNew->u.btree.nEq = 0;
136566 assert( j>=pLoop->u.btree.nEq
136569 if( j<pLoop->u.btree.nEq && j>=pLoop->nSkip ){
136592 for(i=j+1; i<pLoop->u.btree.nEq; i++){
136619 && j>=pLoop->u.btree.nEq
137212 pLoop->u.btree.nEq = 1;
137236 pLoop->u.btree.nEq = j;