Searched refs:nEq (Results 1 – 2 of 2) sorted by relevance
155675 u16 nEq; /* Number of equality constraints */156244 u16 nEq = pLoop->u.btree.nEq;156248 if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;156250 for(i=0; i<nEq; i++){156302 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))156418 for(i=pLoop->nSkip; i<pLoop->u.btree.nEq; i++){156770 int nEq = 0;156792 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;156804 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);156811 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*MAX(nEq,n));[all …]
12729 int nEq = 0; /* Number of elements in pEq */ in idxFindCompatible() local12733 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; in idxFindCompatible()12752 if( iIdx<nEq ){ in idxFindCompatible()