Lines Matching defs:nConstraint

7772   int nConstraint;           /* Number of entries in aConstraint */
105958   for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){
141596   for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){
158878     int nConstraint = pLoop->nLTerm;
158880     iReg = sqlite3GetTempRange(pParse, nConstraint+2);
158882     for(j=0; j<nConstraint; j++){
158911     sqlite3VdbeAddOp2(v, OP_Integer, nConstraint, iReg+1);
158925     for(j=0; j<nConstraint; j++){
158990     **    sqlite3ReleaseTempRange(pParse, iReg, nConstraint+2);
159188     int nConstraint;             /* Number of constraint terms */
159303     nConstraint = nEq;
159317       nConstraint += nBtm;
159329       nConstraint++;
159333       nConstraint++;
159335     codeApplyAffinity(pParse, regBase, nConstraint - bSeekPastNull, zStartAff);
159336     if( pLoop->nSkip>0 && nConstraint==pLoop->nSkip ){
159373       sqlite3VdbeAddOp4Int(v, op, iIdxCur, addrNxt, regBase, nConstraint);
159388         op = aStartOp[(nConstraint>1)*4 + 2 + bRev];
159390                              nConstraint-startEq);
159403     nConstraint = nEq;
159422       nConstraint += nTop;
159435       nConstraint++;
159444     if( nConstraint ){
159452       sqlite3VdbeAddOp4Int(v, op, iIdxCur, addrNxt, regBase, nConstraint);
159464       assert( nConstraint+bSeekPastNull>0 );
159470                            nConstraint+bSeekPastNull);
162884   for(i=0; i<p->nConstraint; i++){
162908   for(i=0; i<p->nConstraint; i++){
163610   pIdxInfo->nConstraint = j;
163638   for(i=0; i<pIdxInfo->nConstraint; i++){
166234   int nConstraint = pIdxInfo->nConstraint;
166243   for(i=0; i<nConstraint; i++, pIdxCons++){
166255   memset(pUsage, 0, sizeof(pUsage[0])*nConstraint);
166281   assert( pNew->nLSlot>=nConstraint );
166282   memset(pNew->aLTerm, 0, sizeof(pNew->aLTerm[0])*nConstraint );
166285   for(i=0; i<nConstraint; i++, pIdxCons++){
166290       if( iTerm>=nConstraint
166300       testcase( iTerm==nConstraint-1 );
166337       assert( !isLimitTerm(pTerm) || i>=nConstraint-2 );
166338       assert( !isLimitTerm(pTerm) || i==nConstraint-1 || isLimitTerm(pTerm+1) );
166417   if( iCons>=0 && iCons<pIdxInfo->nConstraint ){
166462   if( iCons<0 || iCons>=pIdxInfo->nConstraint ){
166551   int nConstraint;             /* Number of constraints in p */
166571   nConstraint = p->nConstraint;
166572   if( whereLoopResize(pParse->db, pNew, nConstraint) ){
166621       for(i=0; i<nConstraint; i++){
187782   for(i=0; i<pInfo->nConstraint; i++){
192514   for(i=0; i<pInfo->nConstraint; i++){
196250   for(i=0; i<pInfo->nConstraint; i++){
210018   for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){
210603   int nConstraint;                  /* Number of entries in aConstraint */
211420     for(i=0; i<pCsr->nConstraint; i++){
211939   int nConstraint = pCur->nConstraint;
211955       for(ii=0; ii<nConstraint; ii++){
212215       pCsr->nConstraint = argc;
212344   for(ii=0; ii<pIdxInfo->nConstraint; ii++){
212351   for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
216016       pCsr->nConstraint = 4;
216103   for(ii=0; ii<pIdxInfo->nConstraint; ii++){
223766   for(i=0; i<pIdxInfo->nConstraint; i++){
224571   for(i=0; i<pIdxInfo->nConstraint; i++){
224592   for(i=0; i<pIdxInfo->nConstraint; i++){
249351   for(i=0, p=pIdxInfo->aConstraint; i<pIdxInfo->nConstraint; i++, p++){
250181   idxStr = (char*)sqlite3_malloc(pInfo->nConstraint * 8 + 1);
250186   for(i=0; i<pInfo->nConstraint; i++){
250197         assert( iIdxStr < pInfo->nConstraint*6 + 1 );
250232     for(i=0; i<pInfo->nConstraint; i++){
256805   for(i=0; i<pInfo->nConstraint; i++){