Lines Matching defs:aConstraint

7679 ** ^(The aConstraint[] array records WHERE clause constraints of the form:
7684 ** stored in aConstraint[].op using one of the
7687 ** aConstraint[].iColumn.)^  ^(aConstraint[].usable is TRUE if the
7694 ** ^The aConstraint[] array only reports WHERE clause terms that are
7713 ** the right-hand side of the corresponding aConstraint[] is evaluated
7772   int nConstraint;           /* Number of entries in aConstraint */
7778   } *aConstraint;            /* Table of WHERE clause constraints */
7815 ** [sqlite3_index_info].aConstraint[].op field.  Each value represents
7820 ** aConstraint[].iColumn field.  ^An iColumn of -1 indicates the left-hand
7824 ** corresponding aConstraint[].iColumn is meaningless and should not be
10202 ** must be an index into the aConstraint[] array belonging to the
10347 **   if and only if the [sqlite3_index_info|P->aConstraint][N] constraint
10452 ** J being a 0-based index into P->aConstraint[], then this routine
105958   for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){
141593   pConstraint = pIdxInfo->aConstraint;
162888        p->aConstraint[i].iColumn,
162889        p->aConstraint[i].iTermOffset,
162890        p->aConstraint[i].op,
162891        p->aConstraint[i].usable,
163558   pIdxInfo->aConstraint = pIdxCons;
166242   pIdxCons = *(struct sqlite3_index_constraint**)&pIdxInfo->aConstraint;
166284   pIdxCons = *(struct sqlite3_index_constraint**)&pIdxInfo->aConstraint;
166419     int iTerm = pIdxInfo->aConstraint[iCons].iTermOffset;
166466       WhereTerm *pTerm = &pH->pWC->a[pIdxInfo->aConstraint[iCons].iTermOffset];
166623             pWC->a[p->aConstraint[i].iTermOffset].prereqRight & ~mPrereq
187784     struct sqlite3_index_constraint *pCons = &pInfo->aConstraint[i];
192515     if( pInfo->aConstraint[i].usable ){
192516       int op = pInfo->aConstraint[i].op;
192517       int iCol = pInfo->aConstraint[i].iColumn;
196251     if( pInfo->aConstraint[i].usable
196252      && pInfo->aConstraint[i].iColumn==0
196253      && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ
210017   pConstraint = pIdxInfo->aConstraint;
210603   int nConstraint;                  /* Number of entries in aConstraint */
210604   RtreeConstraint *aConstraint;     /* Search constraints. */
211418   if( pCsr->aConstraint ){
211421       sqlite3_rtree_query_info *pInfo = pCsr->aConstraint[i].pInfo;
211427     sqlite3_free(pCsr->aConstraint);
211428     pCsr->aConstraint = 0;
211956         RtreeConstraint *pConstraint = pCur->aConstraint + ii;
212209     /* Normal case - r-tree scan. Set up the RtreeCursor.aConstraint array
212214       pCsr->aConstraint = sqlite3_malloc64(sizeof(RtreeConstraint)*argc);
212216       if( !pCsr->aConstraint ){
212219         memset(pCsr->aConstraint, 0, sizeof(RtreeConstraint)*argc);
212224           RtreeConstraint *p = &pCsr->aConstraint[ii];
212345     if( pIdxInfo->aConstraint[ii].op==SQLITE_INDEX_CONSTRAINT_MATCH ){
212352     struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
216002     /* Normal case - r-tree scan. Set up the RtreeCursor.aConstraint array
216015       pCsr->aConstraint = p = sqlite3_malloc(sizeof(RtreeConstraint)*4);
216020         memset(pCsr->aConstraint, 0, sizeof(RtreeConstraint)*4);
216104     struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii];
223767     if( pIdxInfo->aConstraint[i].op!=SQLITE_INDEX_CONSTRAINT_EQ ) continue;
223768     if( pIdxInfo->aConstraint[i].usable==0 ){
223772     switch( pIdxInfo->aConstraint[i].iColumn ){
224572     struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i];
224593     struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[i];
249351   for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){
250187     struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];
250233       struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];
256806     struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];