Lines Matching defs:nEq
11182 tRowcnt *aAvgEq; /* Average nEq values for keys not in aSample */
83453 ** CREATE TABLE sqlite_stat3(tbl, idx, nEq, nLt, nDLt, sample);
83454 ** CREATE TABLE sqlite_stat4(tbl, idx, nEq, nLt, nDLt, sample);
83541 ** binary encoding of a key from the index. The nEq column is a
83544 ** the left-most column of the sample. The second integer in nEq
83561 ** large nEq values.
83569 ** sqlite_stat4.sample. The nEq, nLt, and nDLt entries of sqlite_stat3
83698 tRowcnt *anEq; /* sqlite_stat4.nEq */
84094 tRowcnt nEq = p->current.anEq[0];
84097 if( (nLt/p->nPSample)!=(nLt+nEq)/p->nPSample ){
85004 tRowcnt sumEq = 0; /* Sum of the nEq values */
85011 ** sumEq to the sum of the nEq values for column iCol for the same
110587 u16 nEq; /* Number of equality constraints */
112547 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol;
112595 assert( (u32)n==pLoop->u.btree.nEq );
112959 int nEq = pLoop->u.btree.nEq;
112964 int iCol = p->aiColumn[nEq];
112972 pColl = sqlite3LocateCollSeq(pParse, p->azColl[nEq]);
112986 rc = sqlite3Stat4Column(db, p->aSample[i].p, p->aSample[i].n, nEq, &pVal);
113039 ** The value in (pBuilder->pNew->u.btree.nEq) is the index of the index
113046 ** then nEq is set to 1 (as the range restricted column, b, is the second
113051 ** then nEq is set to 0.
113055 ** considering the range constraints. If nEq is 0, this is the number of
113077 int nEq = pLoop->u.btree.nEq;
113080 && nEq<p->nSampleCol
113083 if( nEq==pBuilder->nRecValid ){
113091 ** key-prefix formed by the nEq values matched against the nEq left-most
113108 if( nEq==p->nKeyCol ){
113111 aff = p->pTable->aCol[p->aiColumn[nEq]].affinity;
113114 if( nEq==0 ){
113130 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, aff, nEq, &bOk);
113145 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, aff, nEq, &bOk);
113224 int nEq = pBuilder->pNew->u.btree.nEq;
113231 assert( nEq>=1 );
113232 assert( nEq<=p->nColumn );
113235 assert( pBuilder->nRecValid<nEq );
113239 if( pBuilder->nRecValid<(nEq-1) ){
113245 if( nEq>=p->nColumn ){
113250 aff = p->pTable->aCol[p->aiColumn[nEq-1]].affinity;
113251 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, aff, nEq-1, &bOk);
113255 pBuilder->nRecValid = nEq;
113489 ** In the example above nEq==2. But this subroutine works for any value
113490 ** of nEq including 0. If nEq==0, this routine is nearly a no-op.
113495 ** are == or IN and are covered by the nEq. nExtraReg is 1 if there is
113497 ** occurs after the nEq quality constraints.
113499 ** This routine allocates a range of nEq+nExtraReg memory cells and returns
113504 ** this routine allocates an additional nEq memory cells for internal
113529 u16 nEq; /* The number of == or IN constraints to code */
113543 nEq = pLoop->u.btree.nEq;
113551 nReg = pLoop->u.btree.nEq + nExtraReg;
113580 assert( zAff==0 || (int)strlen(zAff)>=nEq );
113581 for(j=nSkip; j<nEq; j++){
113662 u16 nEq = pLoop->u.btree.nEq;
113669 if( nEq==0 && (pLoop->wsFlags & (WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ){
113675 for(i=0; i<nEq; i++){
113732 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))
113916 assert( pLoop->u.btree.nEq==1 );
114071 u16 nEq = pLoop->u.btree.nEq; /* Number of == or IN terms */
114090 assert( nEq>=pLoop->u.btree.nSkip );
114097 ** the first one after the nEq equality constraints in the index,
114105 && (pIdx->nKeyCol>nEq)
114115 j = nEq;
114124 && (j = pIdx->aiColumn[nEq])>=0
114137 assert( zStartAff==0 || sqlite3Strlen30(zStartAff)>=nEq );
114138 if( zStartAff ) cEndAff = zStartAff[nEq];
114145 if( (nEq<pIdx->nKeyCol && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC))
114146 || (bRev && pIdx->nKeyCol==nEq)
114158 start_constraints = pRangeStart || nEq>0;
114161 nConstraint = nEq;
114164 sqlite3ExprCode(pParse, pRight, regBase+nEq);
114168 sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);
114172 if( sqlite3CompareAffinity(pRight, zStartAff[nEq])==SQLITE_AFF_NONE){
114176 zStartAff[nEq] = SQLITE_AFF_NONE;
114178 if( sqlite3ExprNeedsNoAffinityChange(pRight, zStartAff[nEq]) ){
114179 zStartAff[nEq] = SQLITE_AFF_NONE;
114185 sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
114205 nConstraint = nEq;
114208 sqlite3ExprCacheRemove(pParse, regBase+nEq, 1);
114209 sqlite3ExprCode(pParse, pRight, regBase+nEq);
114213 sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);
114219 codeApplyAffinity(pParse, regBase+nEq, 1, &cEndAff);
114224 sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
114705 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq);
115159 ** We have so far matched pBuilder->pNew->u.btree.nEq terms of the
115163 ** number of rows expected to be visited by filtering using the nEq
115185 u16 saved_nEq; /* Original value of pNew->u.btree.nEq */
115208 assert( pNew->u.btree.nEq<pProbe->nColumn );
115209 iCol = pProbe->aiColumn[pNew->u.btree.nEq];
115213 saved_nEq = pNew->u.btree.nEq;
115240 pNew->u.btree.nEq++;
115265 pNew->u.btree.nEq = saved_nEq;
115292 if( iCol<0 || (nInMul==0 && pNew->u.btree.nEq==pProbe->nKeyCol-1) ){
115328 int nEq = ++pNew->u.btree.nEq;
115342 && pNew->u.btree.nEq<=pProbe->nSampleCol
115365 pNew->nOut += (pProbe->aiRowLogEst[nEq] - pProbe->aiRowLogEst[nEq-1]);
115400 && pNew->u.btree.nEq<pProbe->nColumn
115410 pNew->u.btree.nEq = saved_nEq;
115591 pNew->u.btree.nEq = 1;
115623 pNew->u.btree.nEq = 0;
116160 if( j<pLoop->u.btree.nEq
116188 && j>=pLoop->u.btree.nEq
116737 pLoop->u.btree.nEq = 1;
116759 pLoop->u.btree.nEq = j;