89   u16 nEq = pLoop->u.btree.nEq;  in explainIndexRange()  local
93   if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;  in explainIndexRange()
95   for(i=0; i<nEq; i++){  in explainIndexRange()
147             || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))  in sqlite3WhereExplainOneScan()
263     for(i=pLoop->nSkip; i<pLoop->u.btree.nEq; i++){  in sqlite3WhereExplainBloomFilter()
585     int nEq = 0;  in codeEqualityTerm()  local
607       if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;  in codeEqualityTerm()
619           aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);  in codeEqualityTerm()
626         aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*MAX(nEq,n));  in codeEqualityTerm()
650     pLevel->u.in.nIn += nEq;  in codeEqualityTerm()
769   u16 nEq;                      /* The number of == or IN constraints to code */  in codeAllEqualityTerms()  local
783   nEq = pLoop->u.btree.nEq;  in codeAllEqualityTerms()
791   nReg = pLoop->u.btree.nEq + nExtraReg;  in codeAllEqualityTerms()
820   assert( zAff==0 || (int)strlen(zAff)>=nEq );  in codeAllEqualityTerms()
821   for(j=nSkip; j<nEq; j++){  in codeAllEqualityTerms()
839   for(j=nSkip; j<nEq; j++){  in codeAllEqualityTerms()
1090     if( pLoop->u.btree.nEq==0 && pTerm!=pEndRange ){  in codeCursorHint()
1294       u16 nEq = pLoop->u.btree.nEq;  in filterPullDown()  local
1301       codeApplyAffinity(pParse, r1, nEq, zStartAff);  in filterPullDown()
1304                            addrNxt, r1, nEq);  in filterPullDown()
1541     assert( pLoop->u.btree.nEq==1 );  in sqlite3WhereCodeOneLoopStart()
1717     u16 nEq = pLoop->u.btree.nEq;     /* Number of == or IN terms */  in sqlite3WhereCodeOneLoopStart()  local
1740     assert( nEq>=pLoop->nSkip );  in sqlite3WhereCodeOneLoopStart()
1745     j = nEq;  in sqlite3WhereCodeOneLoopStart()
1767         testcase( pIdx->aSortOrder[nEq]==SQLITE_SO_DESC );  in sqlite3WhereCodeOneLoopStart()
1770         pLevel->iLikeRepCntr |= bRev ^ (pIdx->aSortOrder[nEq]==SQLITE_SO_DESC);  in sqlite3WhereCodeOneLoopStart()
1774         j = pIdx->aiColumn[nEq];  in sqlite3WhereCodeOneLoopStart()
1808     if( (nEq<pIdx->nColumn && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC)) ){  in sqlite3WhereCodeOneLoopStart()
1826     assert( zStartAff==0 || sqlite3Strlen30(zStartAff)>=nEq );  in sqlite3WhereCodeOneLoopStart()
1828       zEndAff = sqlite3DbStrDup(db, &zStartAff[nEq]);  in sqlite3WhereCodeOneLoopStart()
1838     start_constraints = pRangeStart || nEq>0;  in sqlite3WhereCodeOneLoopStart()
1841     nConstraint = nEq;  in sqlite3WhereCodeOneLoopStart()
1844       codeExprOrVector(pParse, pRight, regBase+nEq, nBtm);  in sqlite3WhereCodeOneLoopStart()
1849         sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);  in sqlite3WhereCodeOneLoopStart()
1853         updateRangeAffinityStr(pRight, nBtm, &zStartAff[nEq]);  in sqlite3WhereCodeOneLoopStart()
1865       sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);  in sqlite3WhereCodeOneLoopStart()
1869       sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);  in sqlite3WhereCodeOneLoopStart()
1885                              regBase, nEq);  in sqlite3WhereCodeOneLoopStart()
1941     nConstraint = nEq;  in sqlite3WhereCodeOneLoopStart()
1955       codeExprOrVector(pParse, pRight, regBase+nEq, nTop);  in sqlite3WhereCodeOneLoopStart()
1960         sqlite3VdbeAddOp2(v, OP_IsNull, regBase+nEq, addrNxt);  in sqlite3WhereCodeOneLoopStart()
1965         codeApplyAffinity(pParse, regBase+nEq, nTop, zEndAff);  in sqlite3WhereCodeOneLoopStart()
1979         sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);  in sqlite3WhereCodeOneLoopStart()
2025       sqlite3VdbeAddOp3(v, OP_SeekHit, iIdxCur, nEq, nEq);  in sqlite3WhereCodeOneLoopStart()