Lines Matching full:split
32 * it is extended rather than split (its size is doubled),
33 * until its length becoms 4 KBytes, from then the extent is split
63 * (e.g., if split occurs <abc> and <aBd>, <ABD> trather than <aB>
64 * should be made the router key for the split)
101 /* dtree split parameter */
140 struct dtsplit * split, struct btstack * btstack);
142 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
146 struct dtsplit * split, struct btstack * btstack);
149 struct dtsplit * split, struct metapage ** rmpp);
602 /* init level count for max pages to split */ in dtSearch()
767 /* update max. number of pages to split */ in dtSearch()
822 struct dtsplit split; /* split information */ in dtInsert() local
858 * extend/split the leaf page; in dtInsert()
863 split.mp = mp; in dtInsert()
864 split.index = index; in dtInsert()
865 split.nslot = n; in dtInsert()
866 split.key = name; in dtInsert()
867 split.data = &data; in dtInsert()
868 rc = dtSplitUp(tid, ip, &split, btstack); in dtInsert()
924 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtSplitUp() argument
929 dtpage_t *sp; /* split page */ in dtSplitUp()
931 dtpage_t *rp; /* new right page split from sp */ in dtSplitUp()
942 ddata_t *data = split->data; in dtSplitUp()
949 /* get split page */ in dtSplitUp()
950 smp = split->mp; in dtSplitUp()
961 * split leaf page in dtSplitUp()
963 * The split routines insert the new entry, and in dtSplitUp()
967 * split root leaf page: in dtSplitUp()
977 if (n <= split->nslot) in dtSplitUp()
989 split->pxdlist = &pxdlist; in dtSplitUp()
990 rc = dtSplitRoot(tid, ip, split, &rmp); in dtSplitUp()
1018 if ((n + sp->header.freecnt) <= split->nslot) in dtSplitUp()
1038 split->pxdlist = &pxdlist; in dtSplitUp()
1039 if ((rc = dtExtendPage(tid, ip, split, btstack))) { in dtSplitUp()
1061 * split leaf page <sp> into <sp> and a new right page <rp>. in dtSplitUp()
1067 * new index page(s) to cover page split(s) in dtSplitUp()
1088 split->pxdlist = &pxdlist; in dtSplitUp()
1089 if ((rc = dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd))) { in dtSplitUp()
1100 * propagate up the router entry for the leaf page just split in dtSplitUp()
1103 * propagate the insert/split up the tree by walking back the stack in dtSplitUp()
1105 * that were traversed during the search for the page that split. in dtSplitUp()
1107 * the propagation of insert/split up the tree stops if the root in dtSplitUp()
1108 * splits or the page inserted into doesn't have to split to hold in dtSplitUp()
1111 * the parent entry for the split page remains the same, and in dtSplitUp()
1140 * because the split was to the right. in dtSplitUp()
1160 * if split occurs between these two entries, and in dtSplitUp()
1223 * parent page is full - split the parent page in dtSplitUp()
1226 /* init for parent page split */ in dtSplitUp()
1227 split->mp = smp; in dtSplitUp()
1228 split->index = skip; /* index at insert */ in dtSplitUp()
1229 split->nslot = n; in dtSplitUp()
1230 split->key = &key; in dtSplitUp()
1231 /* split->data = data; */ in dtSplitUp()
1236 /* The split routines insert the new entry, in dtSplitUp()
1241 dtSplitRoot(tid, ip, split, &rmp) : in dtSplitUp()
1242 dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd); in dtSplitUp()
1286 /* unpin current split and its right page */ in dtSplitUp()
1291 * free remaining extents allocated for split in dtSplitUp()
1315 * function: Split a non-root page of a btree.
1321 * return split and new page pinned;
1323 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, in dtSplitPage() argument
1349 /* get split page */ in dtSplitPage()
1350 smp = split->mp; in dtSplitPage()
1354 * allocate the new right page for the split in dtSplitPage()
1356 pxdlist = split->pxdlist; in dtSplitPage()
1386 * acquire a transaction lock on the split page in dtSplitPage()
1393 /* linelock header of split page */ in dtSplitPage()
1427 * sequential append at tail: append without split in dtSplitPage()
1433 * If we're wrong it's no big deal, we'll just do the split the right in dtSplitPage()
1436 * reverse sorted data, that is, split the tree left, in dtSplitPage()
1439 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1455 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); in dtSplitPage()
1495 * split the data between the split and right pages. in dtSplitPage()
1497 skip = split->index; in dtSplitPage()
1502 * compute fill factor for split pages in dtSplitPage()
1512 n = split->nslot; in dtSplitPage()
1549 * split page moved out entries are linelocked; in dtSplitPage()
1592 /* insert the new entry in the split page */ in dtSplitPage()
1593 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); in dtSplitPage()
1595 /* linelock stbl of split page */ in dtSplitPage()
1613 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); in dtSplitPage()
1636 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtExtendPage() argument
1661 smp = split->mp; in dtExtendPage()
1673 pxdlist = split->pxdlist; in dtExtendPage()
1814 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); in dtExtendPage()
1854 * split the full root page into
1855 * original/root/split page and new right page
1859 * the split root page contains a single entry for the
1869 struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) in dtSplitRoot() argument
1891 /* get split root page */ in dtSplitRoot()
1892 smp = split->mp; in dtSplitRoot()
1898 * N.B. at first split, a one (or two) block to fit new entry in dtSplitRoot()
1899 * is allocated; at subsequent split, a full page is allocated; in dtSplitRoot()
1901 pxdlist = split->pxdlist; in dtSplitRoot()
2006 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); in dtSplitRoot()
3753 * function: move entries from split/left page to new/right page