| /external/chromium_org/third_party/sqlite/src/src/ |
| btree.h | 39 typedef struct Btree Btree;
47 Btree **ppBtree, /* Return open Btree* here */
64 int sqlite3BtreeClose(Btree*);
65 int sqlite3BtreeSetCacheSize(Btree*,int);
66 int sqlite3BtreeSetSafetyLevel(Btree*,int,int,int);
67 int sqlite3BtreeSyncDisabled(Btree*);
68 int sqlite3BtreeSetPageSize(Btree *p, int nPagesize, int nReserve, int eFix);
69 int sqlite3BtreeGetPageSize(Btree*);
[all...] |
| btmutex.c | 13 ** This file contains code used to implement mutexes on Btree objects.
14 ** This code really belongs in btree.c. But btree.c is getting too
27 static void lockBtreeMutex(Btree *p){
41 static void unlockBtreeMutex(Btree *p){
53 ** Enter a mutex on the given BTree object.
57 ** But we keep a reference count in Btree.wantToLock so the behavior
62 ** Btrees belonging to the same database connection as the p Btree
68 void sqlite3BtreeEnter(Btree *p){
69 Btree *pLater
[all...] |
| btreeInt.h | 36 ** BTrees. Each BTree is identified by the index of its root page. The
50 ** Each page can be either a btree page, a freelist page, an overflow
53 ** The first page is always a btree page. The first 100 bytes of the first
105 ** Each btree pages is divided into three sections: The header, the
135 ** The flags define the format of this btree page. The leaf flag means that
186 ** bytes of key and data in a btree cell.
252 ** first byte of on-disk image of every BTree page.
265 ** walk up the BTree from any leaf to the root. Care must be taken to
308 ** a btree handle is closed.
311 Btree *pBtree; /* Btree handle holding this lock *
[all...] |
| test3.c | 12 ** Code for testing the btree.c module in SQLite. This code
49 ** A bogus sqlite3 connection structure for use in the btree
66 Btree *pBt;
104 Btree *pBt;
139 Btree *pBt;
168 Btree *pBt;
181 ** But this function is sometimes called with a btree handle obtained
218 Btree *pBt;
265 Btree *pBt;
512 ** This command returns the btree handle for the main database associate
[all...] |
| test_btree.c | 12 ** Code for testing the btree.c module in SQLite. This code
48 void sqlite3BtreeCursorList(Btree *p){
|
| btree.c | 40 ** from the header of a btree page. If the page size is 65536 and the page
106 ** Btree connection pBtree:
122 Btree *pBtree, /* Handle that must hold lock */
191 ** It is illegal for pBtree to write if some other Btree object that
193 ** the iRoot table. Except, if the other Btree object has the
202 static int hasReadConflicts(Btree *pBtree, Pgno iRoot){
217 ** Query to see if Btree handle p may obtain a lock of type eLock
222 static int querySharedCacheTableLock(Btree *p, Pgno iTab, u8 eLock){
231 /* If requesting a write-lock, then the Btree must have an open write
278 ** Add a lock on the table with root-page iTable to the shared-btree use
[all...] |
| vacuum.c | 97 Btree *pMain; /* The database being vacuumed */
98 Btree *pTemp; /* The temporary database we vacuum into */
268 ** Open a btree level transaction on the main database. This allows a
269 ** call to sqlite3BtreeCopyFile(). The main database btree level
294 /* Copy Btree meta values */
325 ** was committed at the btree level). So it safe to end the transaction
|
| backup.c | 29 Btree *pDest; /* Destination b-tree file */
35 Btree *pSrc; /* Source b-tree file */
74 ** the Btree objects may have their own mutexes that require locking.
88 static Btree *findBtree(sqlite3 *pErrorDb, sqlite3 *pDb, const char *zDb){
278 ** Then clear the Btree layer MemPage.isInit flag. Both this module
280 ** of the page 'extra' space to invalidate the Btree layers
514 ** no need to check the return values of the btree methods here, as
566 /* If a transaction is still open on the Btree, roll it back. */
666 int sqlite3BtreeCopyFile(Btree *pTo, Btree *pFrom)
[all...] |
| status.c | 145 Btree *pBt = db->aDb[i].pBt;
|
| test_stat.c | 279 static int statDecodePage(Btree *pBt, StatPage *p){
370 Btree *pBt = pTab->db->aDb[0].pBt;
|
| vdbeInt.h | 34 ** A cursor is a pointer into a single BTree within a database file.
35 ** The cursor can seek to a BTree entry with a particular key, or
36 ** loop over all entries of the Btree. You can also insert new BTree
45 Btree *pBt; /* Separate file holding temporary table */
|
| prepare.c | 454 Btree *pBt = db->aDb[iDb].pBt; /* Btree database to read cookie from */
570 Btree *pBt = db->aDb[i].pBt;
|
| vdbeaux.c | 952 ** Declare to the Vdbe that the BTree object at db->aDb[i] is used.
[all...] |
| callback.c | 437 ** Find and return the schema associated with a BTree. Create
440 Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
|
| pragma.c | 407 Btree *pBt = pDb->pBt;
432 Btree *pBt = pDb->pBt;
601 Btree *pBt = pDb->pBt;
[all...] |
| vdbe.c | [all...] |
| main.c | 712 Btree *pBt = db->aDb[j].pBt;
[all...] |
| sqliteInt.h | 641 ** Defer sourcing vdbe.h and btree.h until after the "u8" and
645 #include "btree.h"
663 Btree *pBt; /* The B*Tree structure for this database file */
672 ** Most Schema objects are associated with a Btree. The exception is
677 ** Schema objects are automatically deallocated when the last Btree that
681 ** A thread must be holding a mutex on the corresponding Btree in order
683 ** holding a mutex on the sqlite3 connection pointer that owns the Btree.
[all...] |
| vdbeapi.c | 320 Btree *pBt = db->aDb[i].pBt;
[all...] |
| recover.c | 135 * inappropriate btree.
218 * Btree, Pager, and DbPage structs.
395 Btree *pBt = NULL;
867 * minLocal to match naming in btree.c.
[all...] |
| build.c | 28 #include "btree.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...] |
