Lines Matching defs:nTab
11101 int nTab; /* Number of previously allocated VDBE cursors */
61024 nCursor = pParse->nTab;
71503 pParse->nTab = 1;
73662 assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursor<pParse->nTab);
75874 int iTab = pParse->nTab++; /* Cursor of the RHS table */
76082 pExpr->iTable = pParse->nTab++;
78339 pItem->iDistinct = pParse->nTab++;
79756 int iTabCur = pParse->nTab++; /* Table cursor */
79790 iIdxCur = pParse->nTab++;
80021 iStatCur = pParse->nTab;
80022 pParse->nTab += 3;
80046 iStatCur = pParse->nTab;
80047 pParse->nTab += 3;
81434 if( pParse->pAinc!=0 && pParse->nTab==0 ) pParse->nTab = 1;
81441 pParse->nTab = 0;
81833 if( p->nTab==0 ){
81834 p->nTab = 1;
82789 assert(pParse->nTab==1);
82792 pParse->nTab = 2;
83027 n = pParse->nTab;
83040 pParse->nTab = n;
83571 int iTab = pParse->nTab++; /* Btree cursor used for pTab */
83572 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */
83613 iSorter = pParse->nTab++;
84510 pItem->iCursor = pParse->nTab++;
85806 iCur = pTabList->a[0].iCursor = pParse->nTab++;
85808 pParse->nTab++;
88104 int iCur = pParse->nTab - 1; /* Cursor number to use */
88563 pParse->nTab++;
88608 pItem->iCursor = pParse->nTab++;
89649 srcTab = pParse->nTab++;
89756 baseCur = pParse->nTab;
90506 if( pParse->nTab<baseCur+i ){
90507 pParse->nTab = baseCur+i;
90755 iSrc = pParse->nTab++;
90756 iDest = pParse->nTab++;
95438 pseudoTab = pParse->nTab++;
95446 int ptab2 = pParse->nTab++;
96233 unionTab = pParse->nTab++;
96320 tab1 = pParse->nTab++;
96321 tab2 = pParse->nTab++;
98509 pOrderBy->iECursor = pParse->nTab++;
98538 distinct = pParse->nTab++;
98693 sAggInfo.sortingIdx = pParse->nTab++;
98781 sAggInfo.sortingIdxPTab = sortPTab = pParse->nTab++;
98907 const int iCsr = pParse->nTab++; /* Cursor to scan b-tree */
100256 pProgram->nCsr = pSubParse->nTab;
100654 pTabList->a[0].iCursor = iCur = pParse->nTab++;
100656 pParse->nTab++;
100840 assert( pParse->nTab>iCur+i+1 );
101120 ephemTab = pParse->nTab++;
107509 pLevel->iIdxCur = pParse->nTab++;