| /external/chromium_org/third_party/sqlite/src/src/ |
| btree.h | 88 int sqlite3BtreeLockTable(Btree *pBtree, int iTab, u8 isWriteLock);
|
| build.c | 43 int iTab; /* The root page of the table to be locked */
51 ** The table to be locked has root page iTab and is found in database iDb.
61 int iTab, /* Root page number of the table to be locked */
73 if( p->iDb==iDb && p->iTab==iTab ){
85 p->iTab = iTab;
108 sqlite3VdbeAddOp4(pVdbe, OP_TableLock, p1, p->iTab, p->isWriteLock,
[all...] |
| expr.c | [all...] |
| select.c | 468 ** form a distinct entry. iTab is a sorting index that holds previously
469 ** seen combinations of the N values. A new entry is made in iTab
477 int iTab, /* A sorting index used to test for distinctness */
487 sqlite3VdbeAddOp4Int(v, OP_Found, iTab, addrRepeat, iMem, N);
489 sqlite3VdbeAddOp2(v, OP_IdxInsert, iTab, r1);
877 int iTab;
887 iTab = pOrderBy->iECursor;
896 addr = 1 + sqlite3VdbeAddOp2(v, OP_Sort, iTab, addrBreak);
898 sqlite3VdbeAddOp3(v, OP_Column, iTab, pOrderBy->nExpr + 1, regRow);
951 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr)
[all...] |
| where.c | [all...] |
| btree.c | 128 Pgno iTab = 0;
159 iTab = pIdx->pTable->tnum;
163 iTab = iRoot;
166 /* Search for the required lock. Either a write-lock on root-page iTab, a
168 ** read-lock on iTab will suffice. Return 1 if any of these are found. */
171 && (pLock->iTable==iTab || (pLock->eLock==WRITE_LOCK && pLock->iTable==1))
218 ** (READ_LOCK or WRITE_LOCK) on the table with root-page iTab. Return
222 static int querySharedCacheTableLock(Btree *p, Pgno iTab, u8 eLock){
229 assert( !(p->db->flags&SQLITE_ReadUncommitted)||eLock==WRITE_LOCK||iTab==1 );
263 if( pIter->pBtree!=p && pIter->iTable==iTab && pIter->eLock!=eLock )
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| tom.h | [all...] |
| /external/chromium_org/third_party/sqlite/amalgamation/ |
| sqlite3.c | [all...] |
| /external/sqlite/dist/orig/ |
| sqlite3.c | [all...] |
| /external/sqlite/dist/ |
| sqlite3.c | [all...] |
