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