Searched refs:nEq (Results 1 – 4 of 4) sorted by relevance
99518 tRowcnt nEq = p->current.anEq[0];99521 if( (nLt/p->nPSample)!=(nLt+nEq)/p->nPSample ){128751 u16 nEq; /* Number of equality constraints */129257 u16 nEq = pLoop->u.btree.nEq;129261 if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;129263 for(i=0; i<nEq; i++){129318 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))129685 int nEq = 0;129707 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;129717 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);[all …]
6780 int nEq = 0; /* Number of elements in pEq */ in idxFindCompatible() local6784 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; in idxFindCompatible()6802 if( iIdx<nEq ){ in idxFindCompatible()
99534 tRowcnt nEq = p->current.anEq[0];99537 if( (nLt/p->nPSample)!=(nLt+nEq)/p->nPSample ){128767 u16 nEq; /* Number of equality constraints */129273 u16 nEq = pLoop->u.btree.nEq;129277 if( nEq==0 && (pLoop->wsFlags&(WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ) return;129279 for(i=0; i<nEq; i++){129334 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))129701 int nEq = 0;129723 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;129733 aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq);[all …]
6786 int nEq = 0; /* Number of elements in pEq */ in idxFindCompatible() local6790 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; in idxFindCompatible()6808 if( iIdx<nEq ){ in idxFindCompatible()