Lines Matching defs:nSrc
15311 int nSrc; /* Number of tables or subqueries in the FROM clause */
25755 assert( k>=0 && k<pSrc->nSrc );
26293 if( p->pSrc && p->pSrc->nSrc ) n++;
26302 if( p->pSrc && p->pSrc->nSrc ){
26306 for(i=0; i<p->pSrc->nSrc; i++){
26327 sqlite3TreeViewItem(pView, zLine, i<p->pSrc->nSrc-1);
65145 int nSrc, n, rc;
65167 nSrc = pX->nData;
65173 nSrc = nPayload = (int)pX->nKey;
65289 if( nSrc>0 ){
65290 if( n>nSrc ) n = nSrc;
65299 nSrc -= n;
89131 for(i=pSrc->nSrc, pItem=pSrc->a; i>0; i--, pItem++){
89427 for(i=0, pItem=pSrcList->a; i<pSrcList->nSrc; i++, pItem++){
89774 for(i=0; i<pNC->pSrcList->nSrc; i++){
89789 assert( pSrcList && pSrcList->nSrc==1 );
90406 assert( p->pSrc->nSrc==1 && p->pOrderBy );
90414 for(i=0; i<p->pSrc->nSrc; i++){
90481 for(i=0; i<p->pSrc->nSrc; i++){
90725 sSrc.nSrc = 1;
92099 nByte = sizeof(*p) + (p->nSrc>0 ? sizeof(p->a[0]) * (p->nSrc-1) : 0);
92102 pNew->nSrc = pNew->nAlloc = p->nSrc;
92103 for(i=0; i<p->nSrc; i++){
92743 if( pSrc->nSrc!=1 ) return 0; /* Single term in FROM clause */
95549 int nSrc = pSrc ? pSrc->nSrc : 0;
95550 for(i=0; i<nSrc; i++){
95553 if( i<nSrc ){
95635 for(i=0; i<pSrcList->nSrc; i++, pItem++){
96289 assert( pSrc->nSrc==1 );
99073 for(i=0, pItem=pList->a; i<pList->nSrc; i++, pItem++){
99358 for(iSrc=0; ALWAYS(iSrc<pTabList->nSrc); iSrc++){
101972 assert( pName->nSrc==1 );
102947 assert( pName->nSrc==1 );
103127 assert( iStart<=pSrc->nSrc );
103130 if( (u32)pSrc->nSrc+nExtra>pSrc->nAlloc ){
103132 int nAlloc = pSrc->nSrc*2+nExtra;
103147 for(i=pSrc->nSrc-1; i>=iStart; i--){
103150 pSrc->nSrc += nExtra;
103210 pList->nSrc = 1;
103214 pList = sqlite3SrcListEnlarge(db, pList, 1, pList->nSrc);
103220 pItem = &pList->a[pList->nSrc-1];
103242 for(i=0, pItem=pList->a; i<pList->nSrc; i++, pItem++){
103259 for(pItem=pList->a, i=0; i<pList->nSrc; i++, pItem++){
103308 if( p==0 || NEVER(p->nSrc==0) ){
103311 pItem = &p->a[p->nSrc-1];
103335 if( p && ALWAYS(p->nSrc>0) ){
103336 struct SrcList_item *pItem = &p->a[p->nSrc-1];
103357 struct SrcList_item *pItem = &p->a[p->nSrc-1];
103386 for(i=p->nSrc-1; i>0; i--){
104425 assert( pItem && pSrc->nSrc==1 );
104494 assert( pFrom->nSrc==1 );
104645 assert( pTabList->nSrc==1 );
104692 assert( pTabList->nSrc==1 );
109113 assert( pTabList->nSrc==1 );
110562 if( pSelect->pSrc->nSrc!=1 ){
116580 assert( pSrc->nSrc>iRight );
116663 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
117656 for(j=0;j<pTabList->nSrc && pTabList->a[j].iCursor!=pExpr->iTable;j++);
117657 if( j<pTabList->nSrc ){
117847 for(j=0; ALWAYS(j<pTabList->nSrc); j++){
117850 assert( j<pTabList->nSrc );
118302 for(i=0; ALWAYS(i<pSrc->nSrc); i++){
119474 for(i=pSrc->nSrc, pItem=pSrc->a; i>0; i--, pItem++){
119650 assert( pSrc && iFrom>=0 && iFrom<pSrc->nSrc );
119657 if( pSrc->nSrc>1 ) return 0; /* Restriction (2a) */
119678 if( pSubSrc->nSrc==0 ) return 0; /* Restriction (7) */
119680 if( pSub->pLimit && (pSrc->nSrc>1 || isAgg) ){
119748 if( isAgg || (p->selFlags & SF_Distinct)!=0 || pSrc->nSrc!=1 ){
119758 || pSub1->pSrc->nSrc<1
119762 testcase( pSub1->pSrc->nSrc>1 );
119901 nSubSrc = pSubSrc->nSrc; /* Number of terms in subquery FROM clause */
120174 || p->pSrc->nSrc!=1 || p->pSrc->a[0].pSelect
120415 for(i=0; i<pSrc->nSrc; i++){
120561 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
120686 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
120745 if( longNames || pTabList->nSrc>1 ){
120866 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
121186 for(i=0; !p->pPrior && i<pTabList->nSrc; i++){
121241 for(i=0; i<pTabList->nSrc; i++){
121298 && (pTabList->nSrc==1
122334 assert( pTableName->nSrc==1 );
122679 assert( pName->nSrc==1 );
122846 assert( pSrc->nSrc>0 );
122847 pSrc->a[pSrc->nSrc-1].zName = sqlite3DbStrDup(db, pStep->zTarget);
122853 pSrc->a[pSrc->nSrc-1].zDatabase = sqlite3DbStrDup(db, zDb);
123441 assert( pTabList->nSrc==1 );
128051 pOrTab->nSrc = pOrTab->nAlloc;
129200 for(i=0; i<pSrc->nSrc; i++){
130293 if( pTabList->nSrc!=1 ) return 0;
131558 int nb = 1+(pWInfo->pTabList->nSrc+3)/4;
133700 assert( nLoop<=pWInfo->pTabList->nSrc );
134052 assert( pWInfo->pTabList->nSrc>=1 );
134256 testcase( pTabList->nSrc==BMS );
134257 if( pTabList->nSrc>BMS ){
134267 nTabList = (wctrlFlags & WHERE_OR_SUBCLAUSE) ? 1 : pTabList->nSrc;
134343 ** Note that bitmasks are created for all pTabList->nSrc tables in
134345 ** equal to pTabList->nSrc but might be shortened to 1 if the
134348 for(ii=0; ii<pTabList->nSrc; ii++){
134353 for(ii=0; ii<pTabList->nSrc; ii++){
134750 assert( pWInfo->nLevel<=pTabList->nSrc );
137536 if( ALWAYS(yymsp[-1].minor.yy185 && yymsp[-1].minor.yy185->nSrc>0) ) yymsp[-1].minor.yy185->a[yymsp[-1].minor.yy185->nSrc-1].fg.jointype = (u8)yymsp[0].minor.yy194;
137563 }else if( yymsp[-4].minor.yy185->nSrc==1 ){
137566 struct SrcList_item *pNew = &yymsp[-6].minor.yy185->a[yymsp[-6].minor.yy185->nSrc-1];
