Lines Matching defs:iTab
13383 SQLITE_PRIVATE int sqlite3BtreeLockTable(Btree *pBtree, int iTab, u8 isWriteLock);
60578 Pgno iTab = 0;
60609 if( iTab ){
60615 iTab = pIdx->pTable->tnum;
60619 iTab = iRoot;
60622 /* Search for the required lock. Either a write-lock on root-page iTab, a
60624 ** read-lock on iTab will suffice. Return 1 if any of these are found. */
60627 && (pLock->iTable==iTab || (pLock->eLock==WRITE_LOCK && pLock->iTable==1))
60674 ** (READ_LOCK or WRITE_LOCK) on the table with root-page iTab. Return
60678 static int querySharedCacheTableLock(Btree *p, Pgno iTab, u8 eLock){
60685 assert( !(p->db->flags&SQLITE_ReadUncommit)||eLock==WRITE_LOCK||iTab==1 );
60719 if( pIter->pBtree!=p && pIter->iTable==iTab && pIter->eLock!=eLock ){
70223 ** Obtain a lock on the table whose root page is iTab. The
70227 SQLITE_PRIVATE int sqlite3BtreeLockTable(Btree *p, int iTab, u8 isWriteLock){
70236 rc = querySharedCacheTableLock(p, iTab, lockType);
70238 rc = setSharedCacheTableLock(p, iTab, lockType);
94933 int iTab = pParse->nTab++; /* Cursor of the RHS table */
94982 sqlite3OpenTable(pParse, iTab, iDb, pTab, OP_OpenRead);
95068 sqlite3VdbeAddOp3(v, OP_OpenRead, iTab, pIdx->tnum, iDb);
95078 iTab, 0, 0, (u8*)&mask, P4_INT64);
95082 sqlite3SetHasNullFlag(v, iTab, *prRhsHasNull);
95125 pX->iTable = iTab;
95836 SQLITE_PRIVATE void sqlite3ExprCacheStore(Parse *pParse, int iTab, int iCol, int iReg){
95859 assert( p->iTable!=iTab || p->iColumn!=iCol );
95880 p->iTable = iTab;
96214 int iTab = pExpr->iTable;
96215 if( iTab<0 ){
96222 iTab = pParse->iSelfTab - 1;
96226 pExpr->iColumn, iTab, target,
97453 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
97475 SQLITE_PRIVATE int sqlite3ExprCompare(Parse *pParse, Expr *pA, Expr *pB, int iTab){
97491 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pParse, pA->pLeft,pB,iTab)<2 ){
97494 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pParse, pA,pB->pLeft,iTab)<2 ){
97509 if( sqlite3ExprCompare(pParse, pA->pLeft, pB->pLeft, iTab) ) return 2;
97510 if( sqlite3ExprCompare(pParse, pA->pRight, pB->pRight, iTab) ) return 2;
97511 if( sqlite3ExprListCompare(pA->x.pList, pB->x.pList, iTab) ) return 2;
97515 && (pA->iTable!=iTab || NEVER(pB->iTable>=0)) ) return 2;
97526 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
97536 SQLITE_PRIVATE int sqlite3ExprListCompare(ExprList *pA, ExprList *pB, int iTab){
97545 if( sqlite3ExprCompare(0, pExprA, pExprB, iTab) ) return 1;
97554 SQLITE_PRIVATE int sqlite3ExprCompareSkip(Expr *pA, Expr *pB, int iTab){
97558 iTab);
97575 ** Expr.iTable<0 then assume a table number given by iTab.
97586 SQLITE_PRIVATE int sqlite3ExprImpliesExpr(Parse *pParse, Expr *pE1, Expr *pE2, int iTab){
97587 if( sqlite3ExprCompare(pParse, pE1, pE2, iTab)==0 ){
97591 && (sqlite3ExprImpliesExpr(pParse, pE1, pE2->pLeft, iTab)
97592 || sqlite3ExprImpliesExpr(pParse, pE1, pE2->pRight, iTab) )
97599 if( sqlite3ExprCompare(pParse, pX, pE2->pLeft, iTab)==0 ) return 1;
99813 int iTab /* Next available cursor */
99880 iTabCur = iTab++;
99881 iIdxCur = iTab++;
99882 pParse->nTab = MAX(pParse->nTab, iTab);
100170 int iTab;
100177 iTab = pParse->nTab;
100181 analyzeOneTable(pParse, pTab, 0, iStatCur, iMem, iTab);
101652 int iTab; /* The root page of the table to be locked */
101660 ** The table to be locked has root page iTab and is found in database iDb.
101670 int iTab, /* Root page number of the table to be locked */
101684 if( p->iDb==iDb && p->iTab==iTab ){
101696 p->iTab = iTab;
101719 sqlite3VdbeAddOp4(pVdbe, OP_TableLock, p1, p->iTab, p->isWriteLock,
104005 int iTab = pTab->tnum;
104012 if( iDestroyed==0 || iTab<iDestroyed ){
104013 iLargest = iTab;
104391 int iTab = pParse->nTab++; /* Btree cursor used for pTab */
104431 sqlite3OpenTable(pParse, iTab, iDb, pTab, OP_OpenRead);
104432 addr1 = sqlite3VdbeAddOp2(v, OP_Rewind, iTab, 0); VdbeCoverage(v);
104435 sqlite3GenerateIndexKey(pParse,pIndex,iTab,regRecord,0,&iPartIdxLabel,0,0);
104438 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr1+1); VdbeCoverage(v);
104464 sqlite3VdbeAddOp1(v, OP_Close, iTab);
119319 ** form a distinct entry. iTab is a sorting index that holds previously
119320 ** seen combinations of the N values. A new entry is made in iTab
119328 int iTab, /* A sorting index used to test for distinctness */
119338 sqlite3VdbeAddOp4Int(v, OP_Found, iTab, addrRepeat, iMem, N); VdbeCoverage(v);
119340 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iTab, r1, iMem, N);
119905 int iTab;
119925 iTab = pSort->iECursor;
119944 addr = 1 + sqlite3VdbeAddOp2(v, OP_SorterSort, iTab, addrBreak);
119947 sqlite3VdbeAddOp3(v, OP_SorterData, iTab, regSortOut, iSortTab);
119950 addr = 1 + sqlite3VdbeAddOp2(v, OP_Sort, iTab, addrBreak); VdbeCoverage(v);
119952 iSortTab = iTab;
120012 sqlite3VdbeAddOp2(v, OP_SorterNext, iTab, addr); VdbeCoverage(v);
120014 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr); VdbeCoverage(v);
128740 Bitmask maskSelf; /* Bitmask identifying table iTab */
128744 u8 iTab; /* Position in FROM clause of table for this loop */
129681 int iTab;
129729 iTab = pX->iTable;
129730 sqlite3VdbeAddOp2(v, bRev ? OP_Last : OP_Rewind, iTab, 0);
129754 pIn->addrInTop = sqlite3VdbeAddOp2(v, OP_Rowid, iTab, iOut);
129757 pIn->addrInTop = sqlite3VdbeAddOp3(v,OP_Column,iTab, iCol, iOut);
129761 pIn->iCur = iTab;
134664 struct SrcList_item *pItem = pWInfo->pTabList->a + p->iTab;
134668 p->iTab, nb, p->maskSelf, nb, p->prereq & mAll);
134872 if( p->iTab!=pTemplate->iTab ) continue;
134912 if( p->iTab!=pTemplate->iTab || p->iSortIdx!=pTemplate->iSortIdx ){
134913 /* If either the iTab or iSortIdx values for two WhereLoop are different
134989 ** (1) They have the same iTab.
135633 static int whereUsablePartialIndex(int iTab, WhereClause *pWC, Expr *pWhere){
135638 if( !whereUsablePartialIndex(iTab,pWC,pWhere->pLeft) ) return 0;
135644 if( (!ExprHasProperty(pExpr, EP_FromJoin) || pExpr->iRightJoinTable==iTab)
135645 && sqlite3ExprImpliesExpr(pParse, pExpr, pWhere, iTab)
135655 ** is identified by pBuilder->pNew->iTab. That table is guaranteed to be
135712 pSrc = pTabList->a + pNew->iTab;
135806 testcase( pNew->iTab!=pSrc->iCursor ); /* See ticket [98d973b8f5] */
135922 ** be used by the virtual table identified by pBuilder->pNew->iTab. This
135957 struct SrcList_item *pSrc = &pBuilder->pWInfo->pTabList->a[pNew->iTab];
136092 ** pBuilder->pNew->iTab. That table is guaranteed to be a virtual table.
136137 pSrc = &pWInfo->pTabList->a[pNew->iTab];
136256 pItem = pWInfo->pTabList->a + pNew->iTab;
136363 int iTab;
136375 for(iTab=0, pItem=pTabList->a; pItem<pEnd; iTab++, pItem++){
136377 pNew->iTab = iTab;
136509 iCur = pWInfo->pTabList->a[pLoop->iTab].iCursor;
137106 pLevel->iFrom = pWLoop->iTab;
137673 pItem = &pWInfo->pTabList->a[pLoop->iTab];
