Lines Matching defs:iTab
10083 SQLITE_PRIVATE int sqlite3BtreeLockTable(Btree *pBtree, int iTab, u8 isWriteLock);
54668 Pgno iTab = 0;
54699 if( iTab ){
54705 iTab = pIdx->pTable->tnum;
54709 iTab = iRoot;
54712 /* Search for the required lock. Either a write-lock on root-page iTab, a
54714 ** read-lock on iTab will suffice. Return 1 if any of these are found. */
54717 && (pLock->iTable==iTab || (pLock->eLock==WRITE_LOCK && pLock->iTable==1))
54764 ** (READ_LOCK or WRITE_LOCK) on the table with root-page iTab. Return
54768 static int querySharedCacheTableLock(Btree *p, Pgno iTab, u8 eLock){
54775 assert( !(p->db->flags&SQLITE_ReadUncommitted)||eLock==WRITE_LOCK||iTab==1 );
54809 if( pIter->pBtree!=p && pIter->iTable==iTab && pIter->eLock!=eLock ){
64022 ** Obtain a lock on the table whose root page is iTab. The
64026 SQLITE_PRIVATE int sqlite3BtreeLockTable(Btree *p, int iTab, u8 isWriteLock){
64035 rc = querySharedCacheTableLock(p, iTab, lockType);
64037 rc = setSharedCacheTableLock(p, iTab, lockType);
86699 int iTab = pParse->nTab++; /* Cursor of the RHS table */
86740 sqlite3OpenTable(pParse, iTab, iDb, pTab, OP_OpenRead);
86764 sqlite3VdbeAddOp3(v, OP_OpenRead, iTab, pIdx->tnum, iDb);
86772 sqlite3SetHasNullFlag(v, iTab, *prRhsHasNull);
86814 pX->iTable = iTab;
87304 SQLITE_PRIVATE void sqlite3ExprCacheStore(Parse *pParse, int iTab, int iCol, int iReg){
87327 assert( p->iReg==0 || p->iTable!=iTab || p->iColumn!=iCol );
87335 p->iTable = iTab;
87356 p->iTable = iTab;
87635 int iTab = pExpr->iTable;
87636 if( iTab<0 ){
87644 iTab = pParse->iSelfTab;
87648 pExpr->iColumn, iTab, target,
88750 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
88765 SQLITE_PRIVATE int sqlite3ExprCompare(Expr *pA, Expr *pB, int iTab){
88778 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
88781 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
88796 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
88797 if( sqlite3ExprCompare(pA->pRight, pB->pRight, iTab) ) return 2;
88798 if( sqlite3ExprListCompare(pA->x.pList, pB->x.pList, iTab) ) return 2;
88802 && (pA->iTable!=iTab || NEVER(pB->iTable>=0)) ) return 2;
88813 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
88823 SQLITE_PRIVATE int sqlite3ExprListCompare(ExprList *pA, ExprList *pB, int iTab){
88832 if( sqlite3ExprCompare(pExprA, pExprB, iTab) ) return 1;
88851 ** Expr.iTable<0 then assume a table number given by iTab.
88857 SQLITE_PRIVATE int sqlite3ExprImpliesExpr(Expr *pE1, Expr *pE2, int iTab){
88858 if( sqlite3ExprCompare(pE1, pE2, iTab)==0 ){
88862 && (sqlite3ExprImpliesExpr(pE1, pE2->pLeft, iTab)
88863 || sqlite3ExprImpliesExpr(pE1, pE2->pRight, iTab) )
88868 && sqlite3ExprCompare(pE1->pLeft, pE2->pLeft, iTab)==0
90999 int iTab /* Next available cursor */
91051 iTabCur = iTab++;
91052 iIdxCur = iTab++;
91053 pParse->nTab = MAX(pParse->nTab, iTab);
91335 int iTab;
91342 iTab = pParse->nTab;
91346 analyzeOneTable(pParse, pTab, 0, iStatCur, iMem, iTab);
92825 int iTab; /* The root page of the table to be locked */
92833 ** The table to be locked has root page iTab and is found in database iDb.
92843 int iTab, /* Root page number of the table to be locked */
92855 if( p->iDb==iDb && p->iTab==iTab ){
92867 p->iTab = iTab;
92890 sqlite3VdbeAddOp4(pVdbe, OP_TableLock, p1, p->iTab, p->isWriteLock,
95166 int iTab = pTab->tnum;
95173 if( iDestroyed==0 || iTab<iDestroyed ){
95174 iLargest = iTab;
95552 int iTab = pParse->nTab++; /* Btree cursor used for pTab */
95591 sqlite3OpenTable(pParse, iTab, iDb, pTab, OP_OpenRead);
95592 addr1 = sqlite3VdbeAddOp2(v, OP_Rewind, iTab, 0); VdbeCoverage(v);
95595 sqlite3GenerateIndexKey(pParse,pIndex,iTab,regRecord,0,&iPartIdxLabel,0,0);
95598 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr1+1); VdbeCoverage(v);
95625 sqlite3VdbeAddOp1(v, OP_Close, iTab);
109260 ** form a distinct entry. iTab is a sorting index that holds previously
109261 ** seen combinations of the N values. A new entry is made in iTab
109269 int iTab, /* A sorting index used to test for distinctness */
109279 sqlite3VdbeAddOp4Int(v, OP_Found, iTab, addrRepeat, iMem, N); VdbeCoverage(v);
109281 sqlite3VdbeAddOp2(v, OP_IdxInsert, iTab, r1);
109844 int iTab;
109864 iTab = pSort->iECursor;
109883 addr = 1 + sqlite3VdbeAddOp2(v, OP_SorterSort, iTab, addrBreak);
109886 sqlite3VdbeAddOp3(v, OP_SorterData, iTab, regSortOut, iSortTab);
109889 addr = 1 + sqlite3VdbeAddOp2(v, OP_Sort, iTab, addrBreak); VdbeCoverage(v);
109891 iSortTab = iTab;
109942 sqlite3VdbeAddOp2(v, OP_SorterNext, iTab, addr); VdbeCoverage(v);
109944 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr); VdbeCoverage(v);
118133 Bitmask maskSelf; /* Bitmask identifying table iTab */
118137 u8 iTab; /* Position in FROM clause of table for this loop */
118905 int iTab;
118924 iTab = pX->iTable;
118925 sqlite3VdbeAddOp2(v, bRev ? OP_Last : OP_Rewind, iTab, 0);
118940 pIn->iCur = iTab;
118942 pIn->addrInTop = sqlite3VdbeAddOp2(v, OP_Rowid, iTab, iReg);
118944 pIn->addrInTop = sqlite3VdbeAddOp3(v, OP_Column, iTab, 0, iReg);
123039 struct SrcList_item *pItem = pWInfo->pTabList->a + p->iTab;
123042 p->iTab, nb, p->maskSelf, nb, p->prereq);
123242 if( p->iTab!=pTemplate->iTab ) continue;
123281 if( p->iTab!=pTemplate->iTab || p->iSortIdx!=pTemplate->iSortIdx ){
123282 /* If either the iTab or iSortIdx values for two WhereLoop are different
123358 ** (1) They have the same iTab.
123889 static int whereUsablePartialIndex(int iTab, WhereClause *pWC, Expr *pWhere){
123893 if( !whereUsablePartialIndex(iTab,pWC,pWhere->pLeft) ) return 0;
123898 if( sqlite3ExprImpliesExpr(pExpr, pWhere, iTab)
123899 && (!ExprHasProperty(pExpr, EP_FromJoin) || pExpr->iRightJoinTable==iTab)
123909 ** is idenfied by pBuilder->pNew->iTab. That table is guaranteed to be
123966 pSrc = pTabList->a + pNew->iTab;
124057 testcase( pNew->iTab!=pSrc->iCursor ); /* See ticket [98d973b8f5] */
124141 ** pBuilder->pNew->iTab. That table is guaranteed to be a virtual table.
124194 pSrc = &pWInfo->pTabList->a[pNew->iTab];
124364 pItem = pWInfo->pTabList->a + pNew->iTab;
124473 int iTab;
124485 for(iTab=0, pItem=pTabList->a; pItem<pEnd; iTab++, pItem++){
124487 pNew->iTab = iTab;
124606 iCur = pWInfo->pTabList->a[pLoop->iTab].iCursor;
125159 pLevel->iFrom = pWLoop->iTab;
125623 if( (pWInfo->pTabList->a[pLoop->iTab].fg.jointype & JT_LEFT)==0 ) break;
