more TDB

source/libs/tdb/CMakeLists.txt

@@ -8,6 +8,7 @@ target_sources(tdb
     "src/db/tdbBtree.c"
     "src/db/tdbDb.c"
     "src/db/tdbEnv.c"
+    "src/db/tdbPage.c"
 )
 
 target_include_directories(

source/libs/tdb/src/db/tdbBtree.c

@@ -405,6 +405,16 @@ static int tdbBtreeInitPage(SPage *pPage, void *arg) {
 }
 
 #ifndef TDB_BTREE_BALANCE
+typedef struct {
+  SBTree *pBt;
+  SPage  *pParent;
+  int     idx;
+  i8      nOldPages;
+  SPage  *pOldPages[3];
+  i8      nNewPages;
+  SPage  *pNewPages[5];
+} SBtreeBalanceHelper;
+
 static int tdbBtreeCopyPageContent(SPage *pFrom, SPage *pTo) {
   /* TODO */
 
@@ -450,20 +460,8 @@ static int tdbBtreeBalanceDeeper(SBTree *pBt, SPage *pRoot, SPage **ppChild) {
   return 0;
 }
 
-static int tdbBtreeBalanceNonRoot(SBTree *pBt, SPage *pParent, int idx) {
-  int    nOldPages;
-  SPage *pOldPages[3];
-  int    nNewPages;
-  SPage *pNewPages[5];
-  void  *pCell;
-  SPgno  pgno;
-  int    i;
-  int    nDiv;
-  int    ret;
-  SPage *pPage;
-  void  *pCellDiv[2];
-
-  {
+static int tdbBtreeBalanceStep1(SBtreeBalanceHelper *pBlh) {
+#if 0
   // TODO: Find three or less sibling pages on either side
   i = pParent->pPageHdr->nCells + pParent->nOverflow;
   if (i < 1) {
@@ -516,26 +514,84 @@ static int tdbBtreeBalanceNonRoot(SBTree *pBt, SPage *pParent, int idx) {
     }
     /* code */
   }
+
+#endif
+  return 0;
+}
+
+static int tdbBtreeBalanceStep2(SBtreeBalanceHelper *pBlh) {
+  // TODO
+  return 0;
+}
+
+static int tdbBtreeBalanceStep3(SBtreeBalanceHelper *pBlh) {
+  // TODO
+  return 0;
+}
+
+static int tdbBtreeBalanceStep4(SBtreeBalanceHelper *pBlh) {
+  // TODO
+  return 0;
+}
+
+static int tdbBtreeBalanceStep5(SBtreeBalanceHelper *pBlh) {
+  // TODO
+  return 0;
+}
+
+static int tdbBtreeBalanceStep6(SBtreeBalanceHelper *pBlh) {
+  // TODO
+  return 0;
+}
+
+static int tdbBtreeBalanceNonRoot(SBTree *pBt, SPage *pParent, int idx) {
+  int                 ret;
+  SBtreeBalanceHelper blh;
+
+  blh.pBt = pBt;
+  blh.pParent = pParent;
+  blh.idx = idx;
+
+  // Step 1: find two sibling pages and get engough info about the old pages
+  ret = tdbBtreeBalanceStep1(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
-  {
-      // TODO: Load all cells on the old page and the divider cells
+  // Step 2: Load all cells on the old page and the divider cells
+  ret = tdbBtreeBalanceStep2(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
-  {
-      // TODO: Get the number of pages needed to hold all cells
+  // Step 3: Get the number of pages needed to hold all cells
+  ret = tdbBtreeBalanceStep3(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
-  {
-      // TODO: Allocate enough new pages. Reuse old pages as much as possible
+  // Step 4: Allocate enough new pages. Reuse old pages as much as possible
+  ret = tdbBtreeBalanceStep4(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
-  {
-      // TODO: Insert new divider cells into pParent
+  // Step 5: Insert new divider cells into pParent
+  ret = tdbBtreeBalanceStep5(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
-  {
-      // TODO: Update the sibling pages
+  // Step 6: Update the sibling pages
+  ret = tdbBtreeBalanceStep6(&blh);
+  if (ret < 0) {
+    ASSERT(0);
+    return -1;
   }
 
   {