Lines Matching refs:nExpr
18354 int nExpr; /* Number of expressions on the list */
29852 if( pCte->pCols && pCte->pCols->nExpr>0 ){
29855 for(j=0; j<pCte->pCols->nExpr; j++){
30494 for(i=0; i<pList->nExpr; i++){
30497 int moreToFollow = i<pList->nExpr - 1;
77874 if( pList ) nVal = pList->nExpr;
98490 for(i=p->nExpr, pItem=p->a; i>0; i--, pItem++){
98698 int iCol, /* A column in the result set. 0..pEList->nExpr-1 */
98706 assert( iCol>=0 && iCol<pEList->nExpr );
98936 for(j=0; j<pEList->nExpr; j++){
99134 for(j=0; j<pEList->nExpr; j++){
99517 int n = pList ? pList->nExpr : 0; /* Number of arguments */
99843 for(i=0; i<pEList->nExpr; i++){
99906 for(i=0; i<pEList->nExpr; i++){
99958 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){
99962 for(i=0; i<pOrderBy->nExpr; i++){
99975 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
99982 if( iCol<=0 || iCol>pEList->nExpr ){
99983 resolveOutOfRangeError(pParse, "ORDER", i+1, pEList->nExpr);
100043 for(i=0; i<pOrderBy->nExpr; i++){
100075 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){
100081 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
100083 if( pItem->u.x.iOrderByCol>pEList->nExpr ){
100084 resolveOutOfRangeError(pParse, zType, i+1, pEList->nExpr);
100154 nResult = pSelect->pEList->nExpr;
100156 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
100188 for(j=0; j<pSelect->pEList->nExpr; j++){
100395 for(i=0, pItem=pGroupBy->a; i<pGroupBy->nExpr; i++, pItem++){
100419 if( p->pNext && p->pEList->nExpr!=p->pNext->pEList->nExpr ){
100542 for(i=0; i<pList->nExpr; i++){
100756 for(i=0; i<pList->nExpr; i++){
100798 assert( pExpr->x.pList->nExpr>0 );
100866 for(i=0; ALWAYS(i<p->x.pList->nExpr); i++){
101087 return pExpr->x.pList->nExpr;
101089 return pExpr->x.pSelect->pEList->nExpr;
101367 for(i=0; i<p->nExpr; i++){
101639 if( pList && pList->nExpr > pParse->db->aLimit[SQLITE_LIMIT_FUNCTION_ARG] ){
102148 pNew->nExpr = p->nExpr;
102151 for(i=0; i<p->nExpr; i++, pItem++, pOldItem++){
102334 pList->nExpr = 0;
102335 }else if( (pList->nExpr & (pList->nExpr-1))==0 ){
102338 sizeof(*pList)+(2*(sqlite3_int64)pList->nExpr-1)*sizeof(pList->a[0]));
102344 pItem = &pList->a[pList->nExpr++];
102378 int iFirst = pList ? pList->nExpr : 0;
102403 assert( pList->nExpr==iFirst+i+1 );
102404 pList->a[pList->nExpr-1].zEName = pColumns->a[i].zName;
102436 assert( p->nExpr>0 );
102448 pItem = &p->a[p->nExpr-1];
102481 assert( pList->nExpr>0 );
102482 pItem = &pList->a[pList->nExpr-1];
102515 struct ExprList_item *pItem = &pList->a[pList->nExpr-1];
102516 assert( pList->nExpr>0 );
102534 testcase( pEList && pEList->nExpr==mx );
102535 testcase( pEList && pEList->nExpr==mx+1 );
102536 if( pEList && pEList->nExpr>mx ){
102545 int i = pList->nExpr;
102547 assert( pList->nExpr>0 );
102567 for(i=0; i<pList->nExpr; i++){
102821 for(i=0; i<pGroupBy->nExpr; i++){
103080 for(i=0; i<pEList->nExpr; i++){
103231 for(i=0; i<pEList->nExpr; i++){
103234 if( i==pEList->nExpr ){
103247 int nExpr = pEList->nExpr;
103261 if( nExpr==1 && pEList->a[0].pExpr->iColumn<0 ){
103280 for(i=0; i<nExpr && affinity_ok; i++){
103307 if( pIdx->nColumn<nExpr ) continue;
103310 ** BITMASK(nExpr) without overflowing */
103315 if( pIdx->nKeyCol>nExpr
103316 ||(pIdx->nColumn>nExpr && !IsUniqueIndex(pIdx))
103323 for(i=0; i<nExpr; i++){
103330 for(j=0; j<nExpr; j++){
103338 if( j==nExpr ) break;
103345 assert( i==nExpr || colUsed!=(MASKBIT(nExpr)-1) );
103346 if( colUsed==(MASKBIT(nExpr)-1) ){
103359 i64 mask = (1<<nExpr)-1;
103364 if( nExpr==1 ){
103385 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
103483 sqlite3SubselectError(pParse, pExpr->x.pSelect->pEList->nExpr, 1);
103600 if( ALWAYS(pEList->nExpr==nVal) ){
103616 assert( pEList->nExpr>0 );
103652 for(i=pList->nExpr, pItem=pList->a; i>0; i--, pItem++){
103760 nReg = pExpr->op==TK_SELECT ? pSel->pEList->nExpr : 1;
103820 if( nVector!=pIn->x.pSelect->pEList->nExpr ){
103821 sqlite3SubselectError(pParse, pIn->x.pSelect->pEList->nExpr, nVector);
103964 for(ii=0; ii<pList->nExpr; ii++){
103970 if( ii<pList->nExpr-1 || destIfNull!=destIfFalse ){
103974 VdbeCoverageIf(v, ii<pList->nExpr-1 && op==OP_Eq);
103975 VdbeCoverageIf(v, ii==pList->nExpr-1 && op==OP_Eq);
103976 VdbeCoverageIf(v, ii<pList->nExpr-1 && op==OP_NotNull);
103977 VdbeCoverageIf(v, ii==pList->nExpr-1 && op==OP_NotNull);
104179 assert( pIdx->aColExpr->nExpr>iIdxCol );
104374 nFarg = pFarg->nExpr;
104843 nFarg = pFarg ? pFarg->nExpr : 0;
104960 }else if( op==TK_SELECT && (nCol = pExpr->x.pSelect->pEList->nExpr)!=1 ){
105111 ** Y is in the last element of pExpr->x.pList if pExpr->x.pList->nExpr is
105123 int nExpr; /* 2x number of WHEN terms */
105134 assert(pExpr->x.pList->nExpr > 0);
105137 nExpr = pEList->nExpr;
105158 for(i=0; i<nExpr-1; i=i+2){
105173 if( (nExpr&1)!=0 ){
105174 sqlite3ExprCode(pParse, pEList->a[nExpr-1].pExpr, target);
105246 for(pItem=p->a, i=p->nExpr; i>0; pItem++, i--){
105269 struct ExprList_item *pItem = &p->a[p->nExpr-1];
105370 ** usually be pList->nExpr but might be reduced if SQLITE_ECEL_OMITREF
105399 n = pList->nExpr;
106008 if( pA->nExpr!=pB->nExpr ) return 1;
106009 for(i=0; i<pA->nExpr; i++){
106052 || (p->x.pList!=0 && p->x.pList->nExpr>0) );
106058 assert( pList->nExpr==2 );
106566 n = pGB->nExpr;
106621 pExpr->x.pList ? pExpr->x.pList->nExpr : 0, enc, 0);
106675 for(pItem=pList->a, i=0; i<pList->nExpr; i++, pItem++){
107582 for(i=0; i<pList->nExpr; i++){
107628 for(i=0; i<pEList->nExpr; i++){
107778 for(i=0; i<pEList->nExpr; i++){
111824 for(i=0; i<pEL->nExpr; i++){
113254 nTerm = pList->nExpr;
114430 && pTable->nCol==pSel->pEList->nExpr
114881 if( pToCol && pToCol->nExpr!=1 ){
114888 }else if( pToCol && pToCol->nExpr!=pFromCol->nExpr ){
114894 nCol = pFromCol->nExpr;
114898 for(i=0; i<pToCol->nExpr; i++){
115152 for(i=0; i<pList->nExpr; i++){
115379 assert( pList->nExpr==1 );
115389 for(i=0; i<pList->nExpr; i++){
115402 assert( pList->nExpr + nExtraCol <= 32767 /* Fits in i16 */ );
115403 pIndex = sqlite3AllocateIndexObject(db, pList->nExpr + nExtraCol,
115418 pIndex->nKeyCol = pList->nExpr;
120291 int nExpr;
120298 nExpr = pExpr->x.pList->nExpr;
120299 pDef = sqlite3FindFunction(db, pExpr->u.zToken, nExpr, SQLITE_UTF8, 0);
120316 if( nExpr<3 ){
123020 nColumn = pSelect->pEList->nExpr;
123073 nColumn = pList->nExpr;
123908 for(i=0; i<pCheck->nExpr; i++){
124919 if( pEList->nExpr!=1 ){
129244 for(k=pCheck->nExpr-1; k>0; k--){
131551 for(i=0; i<p->x.pList->nExpr; i++){
131577 for(i=0; i<p->x.pList->nExpr; i++){
131759 int nExpr = pSort->pOrderBy->nExpr; /* No. of ORDER BY terms */
131760 int nBase = nExpr + bSeq + nData; /* Fields in sorter record */
131786 assert( nPrefixReg==nExpr+bSeq );
131798 sqlite3VdbeAddOp2(v, OP_Sequence, pSort->iECursor, regBase+nExpr);
131801 sqlite3ExprCodeMove(pParse, regData, regBase+nExpr+bSeq, nData);
131814 nKey = nExpr - pSort->nOBSat + bSeq;
131816 addrFirst = sqlite3VdbeAddOp1(v, OP_IfNot, regBase+nExpr);
131867 iCsr, 0, regBase+nOBSat, nExpr-nOBSat);
131963 for(i=0; i<pEList->nExpr; i++){
132057 nResultCol = p->pEList->nExpr;
132061 nPrefixReg = pSort->pOrderBy->nExpr;
132105 for(i=pSort->nOBSat; i<pSort->pOrderBy->nExpr; i++){
132120 pOp->p2 += (pExtra->nExpr - pSort->nDefer);
132121 pOp->p4.pKeyInfo->nAllField += (pExtra->nExpr - pSort->nDefer);
132122 pParse->nMem += pExtra->nExpr;
132129 for(i=0; i<pEList->nExpr; i++){
132154 if( pExtra ) nResultCol += pExtra->nExpr;
132389 ** index with pSO->nExpr+2 columns. Build a key using pSO for the first
132390 ** pSO->nExpr columns, then make sure all keys are unique by adding a
132401 nKey = pSO->nExpr;
132530 int nExpr;
132536 nExpr = pList->nExpr;
132537 pInfo = sqlite3KeyInfoAlloc(db, nExpr-iStart, nExtra+1);
132540 for(i=iStart, pItem=pList->a+iStart; i<nExpr; i++, pItem++){
132655 nKey = pOrderBy->nExpr - pSort->nOBSat;
132892 if( iCol>=0 && iCol<pS->pEList->nExpr ){
132979 for(i=0; i<pEList->nExpr; i++){
133065 sqlite3VdbeSetNumCols(v, pEList->nExpr);
133066 for(i=0; i<pEList->nExpr; i++){
133144 nCol = pEList->nExpr;
133246 assert( pTab->nCol==pSelect->pEList->nExpr || db->mallocFailed );
133415 /* iCol must be less than p->pEList->nExpr. Otherwise an error would
133418 if( pRet==0 && ALWAYS(iCol<p->pEList->nExpr) ){
133435 int nOrderBy = p->pOrderBy->nExpr;
133505 int nCol = p->pEList->nExpr; /* Number of columns in the recursive table */
133569 sqlite3VdbeAddOp4(v, OP_OpenEphemeral, iQueue, pOrderBy->nExpr+2, 0,
133615 sqlite3VdbeAddOp3(v, OP_Column, iQueue, pOrderBy->nExpr+1, regCurrent);
133688 assert( p->pNext==0 || p->pEList->nExpr==p->pNext->pEList->nExpr );
133780 sqlite3VdbeAddOp2(v, OP_OpenEphemeral, dest.iSDParm, p->pEList->nExpr);
133796 assert( p->pEList->nExpr==pPrior->pEList->nExpr );
134051 nCol = p->pEList->nExpr;
134388 nOrderBy = pOrderBy->nExpr;
134395 for(i=1; db->mallocFailed==0 && i<=p->pEList->nExpr; i++){
134425 assert( pItem->u.x.iOrderByCol<=p->pEList->nExpr );
134445 int nExpr = p->pEList->nExpr;
134446 assert( nOrderBy>=nExpr || db->mallocFailed );
134448 pParse->nMem += nExpr+1;
134450 pKeyDup = sqlite3KeyInfoAlloc(db, nExpr, 1);
134453 for(i=0; i<nExpr; i++){
134684 assert( pSubst->pEList!=0 && pExpr->iColumn<pSubst->pEList->nExpr );
134750 for(i=0; i<pList->nExpr; i++){
135175 assert( pSub->pEList->nExpr==pSub1->pEList->nExpr );
135191 for(ii=0; ii<p->pOrderBy->nExpr; ii++){
135400 for(i=0; i<pOrderBy->nExpr; i++){
135865 || pEList->nExpr!=1
135906 if( p->pWhere || p->pEList->nExpr!=1
135995 for(i=p->pOrderBy->nExpr-1; i>=0; i--){
136245 if( pEList && pEList->nExpr!=pCte->pCols->nExpr ){
136247 pCte->zName, pEList->nExpr, pCte->pCols->nExpr
136476 for(k=0; k<pEList->nExpr; k++){
136484 if( k<pEList->nExpr ){
136496 for(k=0; k<pEList->nExpr; k++){
136508 pNew->a[pNew->nExpr-1].zEName = a[k].zEName;
136509 pNew->a[pNew->nExpr-1].eEName = a[k].eEName;
136601 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
136629 if( p->pEList->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){
136800 if( pE->x.pList==0 || pE->x.pList->nExpr!=1 ){
136824 sqlite3VdbeAddOp2(v, OP_AggFinal, pF->iMem, pList ? pList->nExpr : 0);
136878 nArg = pList->nExpr;
137088 if( p->pEList->nExpr!=1 ) return 0; /* Single result column */
137307 if( pTab->nCol!=pSub->pEList->nExpr ){
137309 pTab->nCol, pTab->zName, pSub->pEList->nExpr);
137653 pParse, sSort.pOrderBy, 0, pEList->nExpr);
137657 sSort.iECursor, sSort.pOrderBy->nExpr+1+pEList->nExpr, 0,
137667 sqlite3VdbeAddOp2(v, OP_OpenEphemeral, pDest->iSDParm, pEList->nExpr);
137723 if( sSort.nOBSat==sSort.pOrderBy->nExpr ){
137792 for(k=p->pEList->nExpr, pItem=p->pEList->a; k>0; k--, pItem++){
137795 for(k=pGroupBy->nExpr, pItem=pGroupBy->a; k>0; k--, pItem++){
137809 if( sSort.pOrderBy && pGroupBy->nExpr==sSort.pOrderBy->nExpr ){
137816 for(ii=0; ii<pGroupBy->nExpr; ii++){
137852 pAggInfo->nSortingColumn = pGroupBy ? pGroupBy->nExpr : 0;
137945 pParse->nMem += pGroupBy->nExpr;
137947 pParse->nMem += pGroupBy->nExpr;
137950 sqlite3VdbeAddOp3(v, OP_Null, 0, iAMem, iAMem+pGroupBy->nExpr-1);
137964 if( sqlite3WhereIsOrdered(pWInfo)==pGroupBy->nExpr ){
137986 nGroupBy = pGroupBy->nExpr;
138046 for(j=0; j<pGroupBy->nExpr; j++){
138054 sqlite3VdbeAddOp4(v, OP_Compare, iAMem, iBMem, pGroupBy->nExpr,
138068 sqlite3ExprCodeMove(pParse, iBMem, iAMem, pGroupBy->nExpr);
138238 assert( pMinMaxOrderBy==0 || pMinMaxOrderBy->nExpr==1 );
138277 generateSortTail(pParse, p, &sSort, pEList->nExpr, pDest);
139236 for(e=0; e<pEList->nExpr; e++){
139382 for(i=0; i<pList->nExpr; i++){
139393 struct ExprList_item *pItem = &pNew->a[pNew->nExpr-1];
139402 struct ExprList_item *pItem = &pNew->a[pNew->nExpr-1];
139411 sqlite3VdbeSetNumCols(v, pNew->nExpr);
139412 for(i=0; i<pNew->nExpr; i++){
139444 pReturning->nRetCol = pNew->nExpr;
139454 int nCol = pNew->nExpr;
140178 for(i=0; i<pChanges->nExpr; i++){
140258 int nChangeFrom = 0; /* If there is a FROM, pChanges->nExpr, else 0 */
140302 nChangeFrom = (pTabList->nSrc>1) ? pChanges->nExpr : 0;
140374 for(i=0; i<pChanges->nExpr; i++){
141378 && pTarget->nExpr==1
141403 if( pTarget->nExpr!=pIdx->nKeyCol ) continue;
141417 assert( pIdx->aColExpr->nExpr>ii );
144350 if( pLhs && pLhs->nExpr==1 ){
144369 for(i=0; i<pOrderBy->nExpr; i++){
144452 if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){
145012 assert( nReg<=pList->nExpr );
146355 && (pAlt->pExpr->x.pSelect->pEList->nExpr>1)
146772 if( pList==0 || pList->nExpr!=2 ){
147849 assert( pList->nExpr==2 );
148236 for(i=0; i<pList->nExpr; i++){
148284 for(j=k=0; j<pArgs->nExpr; j++){
148800 for(i=0; i<pList->nExpr; i++){
148865 for(i=0; i<pDistinct->nExpr; i++){
149284 int n = pOrderBy->nExpr;
150063 for(i=0; rc==SQLITE_OK && i<pList->nExpr; i++){
150874 }else if( ALWAYS(pExpr->x.pList && pExpr->x.pList->nExpr) ){
150876 nIn = sqlite3LogEst(pExpr->x.pList->nExpr);
151151 for(ii=0; ii<pOB->nExpr; ii++){
152095 nOrderBy = pOrderBy->nExpr;
152489 nOrderBy = pWInfo->pOrderBy->nExpr;
152769 if( rc==pWInfo->pResultSet->nExpr ){
152776 if( pFrom->isOrdered==pWInfo->pOrderBy->nExpr ){
152794 if( rc==pWInfo->pOrderBy->nExpr ){
152808 && pWInfo->nOBSat==pWInfo->pOrderBy->nExpr && nLoop>0
152815 if( nOrder==pWInfo->pOrderBy->nExpr ){
152908 if( pWInfo->pOrderBy ) pWInfo->nOBSat = pWInfo->pOrderBy->nExpr;
153094 testcase( pOrderBy && pOrderBy->nExpr==BMS-1 );
153095 if( pOrderBy && pOrderBy->nExpr>=BMS ) pOrderBy = 0;
153169 if( pOrderBy ) pWInfo->nOBSat = pOrderBy->nExpr;
154618 && (pWin->pOrderBy==0 || pWin->pOrderBy->nExpr!=1)
154730 for(i=0; i<p->pSub->nExpr; i++){
154751 pExpr->iColumn = (iCol<0 ? p->pSub->nExpr-1: iCol);
154835 int nInit = pList ? pList->nExpr : 0;
154836 for(i=0; i<pAppend->nExpr; i++){
154921 if( pSort && p->pOrderBy && p->pOrderBy->nExpr<=pSort->nExpr ){
154922 int nSave = pSort->nExpr;
154923 pSort->nExpr = p->pOrderBy->nExpr;
154928 pSort->nExpr = nSave;
154939 pMWin->nBufferCol = (pSublist ? pSublist->nExpr : 0);
154955 pWin->iArgCol = (pSublist ? pSublist->nExpr : 0);
154958 pWin->iArgCol = (pSublist ? pSublist->nExpr : 0);
155295 int nEphExpr = pSelect->pSrc->a[0].pSelect->pEList->nExpr;
155308 int nExpr = pMWin->pPartition->nExpr;
155310 pParse->nMem += nExpr;
155311 sqlite3VdbeAddOp3(v, OP_Null, 0, pMWin->regPart, pMWin->regPart+nExpr-1);
155427 return (pList ? pList->nExpr : 0);
155524 int iColOff = pMWin->nBufferCol + (pPart ? pPart->nExpr : 0);
155526 for(i=0; i<pOrderBy->nExpr; i++){
155610 assert( pWin->bExprArgs || !nArg ||nArg==pWin->pOwner->x.pList->nExpr );
155623 nArg = pWin->pOwner->x.pList->nExpr;
155725 nPeer = (pMWin->pOrderBy ? pMWin->pOrderBy->nExpr : 0);
155846 int nArg = pWin->pOwner->x.pList->nExpr;
155936 ** pOrderBy->nExpr. This function generates code to compare the two
155953 int nVal = pOrderBy->nExpr;
156009 assert( pOrderBy && pOrderBy->nExpr==1 );
156239 int nReg = (pMWin->pOrderBy ? pMWin->pOrderBy->nExpr : 0);
156769 int nPeer = (pOrderBy ? pOrderBy->nExpr : 0);
156771 if( pMWin->pPartition ) regNewPeer += pMWin->pPartition->nExpr;
156794 int nPart = pPart->nExpr;
156853 sqlite3VdbeAddOp3(v, OP_Copy, regNewPeer, regPeer, pOrderBy->nExpr-1);
156854 sqlite3VdbeAddOp3(v, OP_Copy, regPeer, s.start.reg, pOrderBy->nExpr-1);
156855 sqlite3VdbeAddOp3(v, OP_Copy, regPeer, s.current.reg, pOrderBy->nExpr-1);
156856 sqlite3VdbeAddOp3(v, OP_Copy, regPeer, s.end.reg, pOrderBy->nExpr-1);
161317 if( ALWAYS(pList->nExpr) ){
161423 }else if( yymsp[-1].minor.yy338->nExpr==1 && sqlite3ExprIsConstant(yymsp[-1].minor.yy338->a[0].pExpr) ){
177848 int nExpr;
177877 nExpr = sqlite3_value_bytes(argv[1]);
177891 pTokenizer, 0, azCol, 0, nCol, nCol, zExpr, nExpr, &pExpr, &zDummy
177897 pTokenizer, 0, azCol, 0, nCol, nCol, zExpr, nExpr, &pExpr