lib/sqlite/sqlite3.c

10540   u32 nEq;                       /* Number of == constraints */
102371   pLevel->plan.nEq = nColumn;
102423   assert( (u32)n==pLevel->plan.nEq );
102765   pCost->plan.nEq = 0;
102938 ** The nEq parameter is passed the index of the index column subject to the
102945 ** then nEq should be passed the value 1 (as the range restricted column,
102950 ** then nEq should be passed 0.
102954 ** approximately 1/100th (1%) of the rows selected by the nEq equality
102967   int nEq,             /* index into p->aCol[] of the range-compared column */
102976   if( nEq==0 && p->aSample ){
103033   UNUSED_PARAMETER(nEq);
103290     **  nEq:
103350     int nEq;                      /* Number of == or IN terms matching index */
103363     /* Determine the values of nEq and nInMul */
103364     for(nEq=0; nEq<pProbe->nColumn; nEq++){
103365       int j = pProbe->aiColumn[nEq];
103384       if( nEq==0 && pProbe->aSample ) pFirstTerm = pTerm;
103390     if( nEq<pProbe->nColumn && pProbe->bUnordered==0 ){
103391       int j = pProbe->aiColumn[nEq];
103395         whereRangeScanEst(pParse, pProbe, nEq, pBtm, pTop, &estBound);
103421           pParse, pWC->pMaskSet, pProbe, iCur, pOrderBy, nEq, wsFlags, &rev)
103431     if( isDistinctIndex(pParse, pWC, pProbe, iCur, pDistinct, nEq) ){
103461     nRow = (double)(aiRowEst[nEq] * nInMul);
103464       nInMul = (int)(nRow / aiRowEst[nEq]);
103474     if( nRow>(double)1 && nEq==1 && pFirstTerm!=0 && aiRowEst[1]>1 ){
103575       int nSkipEq = nEq;           /* Number of == constraints to skip */
103585             /* Ignore the first nEq equality matches since the index
103617       "%s(%s): nEq=%d nInMul=%d estBound=%d bSort=%d bLookup=%d wsFlags=0x%x\n"
103620       nEq, nInMul, estBound, bSort, bLookup, wsFlags,
103634       pCost->plan.nEq = nEq;
103861 ** In the example above nEq==2.  But this subroutine works for any value
103862 ** of nEq including 0.  If nEq==0, this routine is nearly a no-op.
103870 ** this routine allocates an additional nEq memory cells for internal
103896   int nEq = pLevel->plan.nEq;   /* The number of == or IN constraints to code */
103913   nReg = pLevel->plan.nEq + nExtraReg;
103923   assert( pIdx->nColumn>=nEq );
103924   for(j=0; j<nEq; j++){
104004   int nEq = pPlan->nEq;
104010   if( nEq==0 && (pPlan->wsFlags & (WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ){
104016   for(i=0; i<nEq; i++){
104057     isSearch = (pLevel->plan.nEq>0)
104363     int nEq = pLevel->plan.nEq;  /* Number of == or IN terms */
104382     k = pIdx->aiColumn[nEq];     /* Column for inequality constraints */
104389     ** the first one after the nEq equality constraints in the index,
104394      && (pIdx->nColumn>nEq)
104397       /* assert( pOrderBy->a[0].pExpr->iColumn==pIdx->aiColumn[nEq] ); */
104428     if( nEq<pIdx->nColumn && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC) ){
104438     start_constraints = pRangeStart || nEq>0;
104441     nConstraint = nEq;
104444       sqlite3ExprCode(pParse, pRight, regBase+nEq);
104446         sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
104449         if( sqlite3CompareAffinity(pRight, zStartAff[nEq])==SQLITE_AFF_NONE){
104453           zStartAff[nEq] = SQLITE_AFF_NONE;
104455         if( sqlite3ExprNeedsNoAffinityChange(pRight, zStartAff[nEq]) ){
104456           zStartAff[nEq] = SQLITE_AFF_NONE;
104462       sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
104481     nConstraint = nEq;
104484       sqlite3ExprCacheRemove(pParse, regBase+nEq, 1);
104485       sqlite3ExprCode(pParse, pRight, regBase+nEq);
104487         sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
104490         if( sqlite3CompareAffinity(pRight, zEndAff[nEq])==SQLITE_AFF_NONE){
104494           zEndAff[nEq] = SQLITE_AFF_NONE;
104496         if( sqlite3ExprNeedsNoAffinityChange(pRight, zEndAff[nEq]) ){
104497           zEndAff[nEq] = SQLITE_AFF_NONE;
104500       codeApplyAffinity(pParse, regBase, nEq+1, zEndAff);
104511     op = aEndOp[(pRangeEnd || nEq) * (1 + bRev)];
104528       sqlite3VdbeAddOp3(v, OP_Column, iIdxCur, nEq, r1);
105049   **   pWInfo->a[].nEq       The number of == and IN constraints