Lines Matching defs:aLTerm

151464   u16 nLTerm;           /* Number of entries in aLTerm[] */
151465 u16 nSkip; /* Number of NULL aLTerm[] entries */
151468 u16 nLSlot; /* Number of slots allocated for aLTerm[] */
151469 WhereTerm **aLTerm; /* WhereTerms used */
151471 WhereTerm *aLTermSpace[3]; /* Initial aLTerm[] space */
152419 if( pLoop->aLTerm[i]->pExpr==pX ){
152421 assert( (pLoop->aLTerm[i]->eOperator & (WO_OR|WO_AND))==0 );
152422 iField = pLoop->aLTerm[i]->u.x.iField - 1;
152497 assert( pLevel->pWLoop->aLTerm[iEq]==pTerm );
152526 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
152532 assert( pLoop->aLTerm[i]!=0 );
152533 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
152586 if( pLoop->aLTerm[i]->pExpr==pX ){
152749 pTerm = pLoop->aLTerm[j];
152766 pTerm = pLoop->aLTerm[j];
153013 /* All terms in pWLoop->aLTerm[] except pEndRange are used to initialize
153017 for(j=0; j<pLoop->nLTerm && pLoop->aLTerm[j]!=pTerm; j++){}
153207 WhereTerm *pTerm = pLoop->aLTerm[0];
153348 pTerm = pLoop->aLTerm[j];
153390 pTerm = pLoop->aLTerm[j];
153468 pTerm = pLoop->aLTerm[0];
153499 if( pLoop->wsFlags & WHERE_BTM_LIMIT ) pStart = pLoop->aLTerm[j++];
153500 if( pLoop->wsFlags & WHERE_TOP_LIMIT ) pEnd = pLoop->aLTerm[j++];
153673 pRangeStart = pLoop->aLTerm[j++];
153680 pRangeEnd = pLoop->aLTerm[j++];
154069 pTerm = pLoop->aLTerm[0];
157443 pLoop->aLTerm[nKeyCol++] = pTerm;
158733 sqlite3WhereTermPrint(p->aLTerm[i], i);
158744 p->aLTerm = p->aLTermSpace;
158772 if( p->aLTerm!=p->aLTermSpace ){
158773 sqlite3DbFreeNN(db, p->aLTerm);
158774 p->aLTerm = p->aLTermSpace;
158783 ** Increase the memory allocation for pLoop->aLTerm[] to be at least n.
158789 paNew = sqlite3DbMallocRawNN(db, sizeof(p->aLTerm[0])*n);
158791 memcpy(paNew, p->aLTerm, sizeof(p->aLTerm[0])*p->nLSlot);
158792 if( p->aLTerm!=p->aLTermSpace ) sqlite3DbFreeNN(db, p->aLTerm);
158793 p->aLTerm = paNew;
158810 memcpy(pTo->aLTerm, pFrom->aLTerm, pTo->nLTerm*sizeof(pTo->aLTerm[0]));
158878 if( pX->aLTerm[i]==0 ) continue;
158880 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
159188 pX = pLoop->aLTerm[j];
159430 break; /* OOM while trying to enlarge the pNew->aLTerm array */
159432 pNew->aLTerm[pNew->nLTerm++] = pTerm;
159454 if( pNew->aLTerm[i] && pNew->aLTerm[i]->pExpr==pExpr ) nIn = 0;
159543 pNew->aLTerm[pNew->nLTerm++] = pTop;
159555 pNew->aLTerm[pNew->nLTerm-2] : 0;
159708 pNew->aLTerm[pNew->nLTerm++] = 0;
160008 pNew->aLTerm[0] = pTerm;
160289 memset(pNew->aLTerm, 0, sizeof(pNew->aLTerm[0])*nConstraint );
160300 || pNew->aLTerm[iTerm]!=0
160313 pNew->aLTerm[iTerm] = pTerm;
160361 if( pNew->aLTerm[i]==0 ){
160773 pNew->aLTerm[0] = pTerm;
160827 assert( pNew->aLTerm!=0 );
161014 for(j=0; j<pLoop->nLTerm && pTerm!=pLoop->aLTerm[j]; j++){}
161060 || (pLoop->aLTerm[j]==0)==(j<pLoop->nSkip)
161063 u16 eOp = pLoop->aLTerm[j]->eOperator;
161090 Expr *pX = pLoop->aLTerm[j]->pExpr;
161092 if( pLoop->aLTerm[i]->pExpr==pX ){
161093 assert( (pLoop->aLTerm[i]->eOperator & WO_IN) );
161761 pLoop->aLTerm[0] = pTerm;
161769 assert( pLoop->aLTermSpace==pLoop->aLTerm );
161780 pLoop->aLTerm[j] = pTerm;