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