Lines Matching defs:nTab
11101 int nTab; /* Number of previously allocated VDBE cursors */
60996 nCursor = pParse->nTab;
71475 pParse->nTab = 1;
73626 assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursor<pParse->nTab);
75838 int iTab = pParse->nTab++; /* Cursor of the RHS table */
76046 pExpr->iTable = pParse->nTab++;
78303 pItem->iDistinct = pParse->nTab++;
79720 int iTabCur = pParse->nTab++; /* Table cursor */
79754 iIdxCur = pParse->nTab++;
79985 iStatCur = pParse->nTab;
79986 pParse->nTab += 3;
80010 iStatCur = pParse->nTab;
80011 pParse->nTab += 3;
81398 if( pParse->pAinc!=0 && pParse->nTab==0 ) pParse->nTab = 1;
81405 pParse->nTab = 0;
81797 if( p->nTab==0 ){
81798 p->nTab = 1;
82753 assert(pParse->nTab==1);
82756 pParse->nTab = 2;
82991 n = pParse->nTab;
83004 pParse->nTab = n;
83535 int iTab = pParse->nTab++; /* Btree cursor used for pTab */
83536 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */
83577 iSorter = pParse->nTab++;
84474 pItem->iCursor = pParse->nTab++;
85770 iCur = pTabList->a[0].iCursor = pParse->nTab++;
85772 pParse->nTab++;
88068 int iCur = pParse->nTab - 1; /* Cursor number to use */
88527 pParse->nTab++;
88572 pItem->iCursor = pParse->nTab++;
89613 srcTab = pParse->nTab++;
89720 baseCur = pParse->nTab;
90470 if( pParse->nTab<baseCur+i ){
90471 pParse->nTab = baseCur+i;
90719 iSrc = pParse->nTab++;
90720 iDest = pParse->nTab++;
95402 pseudoTab = pParse->nTab++;
95410 int ptab2 = pParse->nTab++;
96197 unionTab = pParse->nTab++;
96284 tab1 = pParse->nTab++;
96285 tab2 = pParse->nTab++;
98473 pOrderBy->iECursor = pParse->nTab++;
98502 distinct = pParse->nTab++;
98657 sAggInfo.sortingIdx = pParse->nTab++;
98745 sAggInfo.sortingIdxPTab = sortPTab = pParse->nTab++;
98871 const int iCsr = pParse->nTab++; /* Cursor to scan b-tree */
100220 pProgram->nCsr = pSubParse->nTab;
100618 pTabList->a[0].iCursor = iCur = pParse->nTab++;
100620 pParse->nTab++;
100804 assert( pParse->nTab>iCur+i+1 );
101084 ephemTab = pParse->nTab++;
107473 pLevel->iIdxCur = pParse->nTab++;
