contrib/sqlite3/sqlite3.c

143450   u16 nLTerm;           /* Number of entries in aLTerm[] */
143451   u16 nSkip;            /* Number of NULL aLTerm[] entries */
143454   u16 nLSlot;           /* Number of slots allocated for aLTerm[] */
143455   WhereTerm **aLTerm;   /* WhereTerms used */
143457   WhereTerm *aLTermSpace[3];  /* Initial aLTerm[] space */
144336       if( pLoop->aLTerm[i]->pExpr==pX ){
144337         int iField = pLoop->aLTerm[i]->u.x.iField - 1;
144412   assert( pLevel->pWLoop->aLTerm[iEq]==pTerm );
144441       if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
144447       assert( pLoop->aLTerm[i]!=0 );
144448       if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
144494         if( pLoop->aLTerm[i]->pExpr==pX ){
144640     pTerm = pLoop->aLTerm[j];
144900     /* All terms in pWLoop->aLTerm[] except pEndRange are used to initialize
144904       for(j=0; j<pLoop->nLTerm && pLoop->aLTerm[j]!=pTerm; j++){}
145295       pTerm = pLoop->aLTerm[j];
145320       pTerm = pLoop->aLTerm[j];
145384     pTerm = pLoop->aLTerm[0];
145410     if( pLoop->wsFlags & WHERE_BTM_LIMIT ) pStart = pLoop->aLTerm[j++];
145411     if( pLoop->wsFlags & WHERE_TOP_LIMIT ) pEnd = pLoop->aLTerm[j++];
145584       pRangeStart = pLoop->aLTerm[j++];
145591       pRangeEnd = pLoop->aLTerm[j++];
145981     pTerm = pLoop->aLTerm[0];
149107         pLoop->aLTerm[nKeyCol++] = pTerm;
150184       sqlite3WhereTermPrint(p->aLTerm[i], i);
150195   p->aLTerm = p->aLTermSpace;
150222   if( p->aLTerm!=p->aLTermSpace ) sqlite3DbFreeNN(db, p->aLTerm);
150228 ** Increase the memory allocation for pLoop->aLTerm[] to be at least n.
150234   paNew = sqlite3DbMallocRawNN(db, sizeof(p->aLTerm[0])*n);
150236   memcpy(paNew, p->aLTerm, sizeof(p->aLTerm[0])*p->nLSlot);
150237   if( p->aLTerm!=p->aLTermSpace ) sqlite3DbFreeNN(db, p->aLTerm);
150238   p->aLTerm = paNew;
150253   memcpy(pTo->aLTerm, pFrom->aLTerm, pTo->nLTerm*sizeof(pTo->aLTerm[0]));
150324     if( pX->aLTerm[i]==0 ) continue;
150326       if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
150630       pX = pLoop->aLTerm[j];
150850     pNew->aLTerm[pNew->nLTerm++] = pTerm;
150872           if( pNew->aLTerm[i] && pNew->aLTerm[i]->pExpr==pExpr ) nIn = 0;
150949         pNew->aLTerm[pNew->nLTerm++] = pTop;
150963                      pNew->aLTerm[pNew->nLTerm-2] : 0;
151113     pNew->aLTerm[pNew->nLTerm++] = 0;
151319         pNew->aLTerm[0] = pTerm;
151575   for(i=0; i<nConstraint; i++) pNew->aLTerm[i] = 0;
151586        || pNew->aLTerm[iTerm]!=0
151599       pNew->aLTerm[iTerm] = pTerm;
151626     if( pNew->aLTerm[i]==0 ){
151926       pNew->aLTerm[0] = pTerm;
152144         for(j=0; j<pLoop->nLTerm && pTerm!=pLoop->aLTerm[j]; j++){}
152186             || (pLoop->aLTerm[j]==0)==(j<pLoop->nSkip)
152189           u16 eOp = pLoop->aLTerm[j]->eOperator;
152216             Expr *pX = pLoop->aLTerm[j]->pExpr;
152218               if( pLoop->aLTerm[i]->pExpr==pX ){
152219                 assert( (pLoop->aLTerm[i]->eOperator & WO_IN) );
152868     pLoop->aLTerm[0] = pTerm;
152876       assert( pLoop->aLTermSpace==pLoop->aLTerm );
152886         pLoop->aLTerm[j] = pTerm;