H A D | btree.c | 372 Btree *pBt; /* The Btree to which this cursor belongs */ member 412 static int cellSize(Btree *pBt, Cell *pCell){ in cellSize() argument 428 static void defragmentPage(Btree *pBt, MemPage *pPage){ in defragmentPage() argument 477 allocateSpace(Btree * pBt,MemPage * pPage,int nByte) allocateSpace() argument 526 freeSpace(Btree * pBt,MemPage * pPage,int start,int size) freeSpace() argument 587 initPage(Bt * pBt,MemPage * pPage,Pgno pgnoThis,MemPage * pParent) initPage() argument 646 zeroPage(Btree * pBt,MemPage * pPage) zeroPage() argument 693 Btree *pBt; sqliteBtreeOpen() local 738 fileBtreeClose(Btree * pBt) fileBtreeClose() argument 762 fileBtreeSetCacheSize(Btree * pBt,int mxPage) fileBtreeSetCacheSize() argument 775 fileBtreeSetSafetyLevel(Btree * pBt,int level) fileBtreeSetSafetyLevel() argument 790 lockBtree(Btree * pBt) lockBtree() argument 826 unlockBtreeIfUnused(Btree * pBt) unlockBtreeIfUnused() argument 839 newDatabase(Btree * pBt) newDatabase() argument 882 fileBtreeBeginTrans(Btree * pBt) fileBtreeBeginTrans() argument 911 fileBtreeCommit(Btree * pBt) fileBtreeCommit() argument 929 fileBtreeRollback(Btree * pBt) fileBtreeRollback() argument 956 fileBtreeBeginCkpt(Btree * pBt) fileBtreeBeginCkpt() argument 971 fileBtreeCommitCkpt(Btree * pBt) fileBtreeCommitCkpt() argument 990 fileBtreeRollbackCkpt(Btree * pBt) fileBtreeRollbackCkpt() argument 1042 fileBtreeCursor(Btree * pBt,int iTable,int wrFlag,BtCursor ** ppCur) fileBtreeCursor() argument 1108 Btree *pBt = pCur->pBt; fileBtreeCloseCursor() local 1187 Btree *pBt = pCur->pBt; getPayload() local 1342 Btree *pBt = pCur->pBt; fileBtreeKeyCompare() local 1401 Btree *pBt = pCur->pBt; moveToChild() local 1482 Btree *pBt = pCur->pBt; moveToRoot() local 1759 allocatePage(Btree * pBt,MemPage ** ppPage,Pgno * pPgno,Pgno nearby) allocatePage() argument 1823 freePage(Btree * pBt,void * pPage,Pgno pgno) freePage() argument 1889 clearCell(Btree * pBt,Cell * pCell) clearCell() argument 1917 fillInCell(Btree * pBt,Cell * pCell,const void * pKey,int nKey,const void * pData,int nData) fillInCell() argument 2015 reparentChildPages(Btree * pBt,MemPage * pPage) reparentChildPages() argument 2038 dropCell(Btree * pBt,MemPage * pPage,int idx,int sz) dropCell() argument 2064 insertCell(Btree * pBt,MemPage * pPage,int i,Cell * pCell,int sz) insertCell() argument 2090 relinkCellList(Btree * pBt,MemPage * pPage) relinkCellList() argument 2186 balance(Btree * pBt,MemPage * pPage,BtCursor * pCur) balance() argument 2637 Btree *pBt = pCur->pBt; fileBtreeInsert() local 2700 Btree *pBt = pCur->pBt; fileBtreeDelete() local 2785 fileBtreeCreateTable(Btree * pBt,int * piTable) fileBtreeCreateTable() argument 2809 clearDatabasePage(Btree * pBt,Pgno pgno,int freePageFlag) clearDatabasePage() argument 2848 fileBtreeClearTable(Btree * pBt,int iTable) fileBtreeClearTable() argument 2872 fileBtreeDropTable(Btree * pBt,int iTable) fileBtreeDropTable() argument 2999 fileBtreeGetMeta(Btree * pBt,int * aMeta) fileBtreeGetMeta() argument 3017 fileBtreeUpdateMeta(Btree * pBt,int * aMeta) fileBtreeUpdateMeta() argument 3043 fileBtreePageDump(Btree * pBt,int pgno,int recursive) fileBtreePageDump() argument 3133 Btree *pBt = pCur->pBt; fileBtreeCursorDump() local 3161 fileBtreePager(Btree * pBt) fileBtreePager() argument 3171 Btree *pBt; /* The tree being checked out */ global() member 3306 Btree *pBt; checkTreePage() local 3433 fileBtreeIntegrityCheck(Btree * pBt,int * aRoot,int nRoot) fileBtreeIntegrityCheck() argument 3497 fileBtreeGetFilename(Btree * pBt) fileBtreeGetFilename() argument [all...] |