Searched refs:nEq (Results 1 – 2 of 2) sorted by relevance
156931 u16 nEq; /* Number of equality constraints */157500 u16 nEq = pLoop->u.btree.nEq;157504 if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;157506 for(i=0; i<nEq; i++){157558 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))157674 for(i=pLoop->nSkip; i<pLoop->u.btree.nEq; i++){158026 int nEq = 0;158048 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;158060 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);158067 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*MAX(nEq,n));[all …]
12808 int nEq = 0; /* Number of elements in pEq */ in idxFindCompatible() local12812 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; in idxFindCompatible()12831 if( iIdx<nEq ){ in idxFindCompatible()