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 */
141 struct dtsplit * split, struct btstack * btstack);
143 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
147 struct dtsplit * split, struct btstack * btstack);
150 struct dtsplit * split, struct metapage ** rmpp);
603 /* init level count for max pages to split */
768 /* update max. number of pages to split */
823 struct dtsplit split; /* split information */
861 * extend/split the leaf page;
866 split.mp = mp;
867 split.index = index;
868 split.nslot = n;
869 split.key = name;
870 split.data = &data;
871 rc = dtSplitUp(tid, ip, &split, btstack);
927 struct inode *ip, struct dtsplit * split, struct btstack * btstack)
932 dtpage_t *sp; /* split page */
934 dtpage_t *rp; /* new right page split from sp */
945 ddata_t *data = split->data;
952 /* get split page */
953 smp = split->mp;
964 * split leaf page
966 * The split routines insert the new entry, and
970 * split root leaf page:
980 if (n <= split->nslot)
992 split->pxdlist = &pxdlist;
993 rc = dtSplitRoot(tid, ip, split, &rmp);
1021 if ((n + sp->header.freecnt) <= split->nslot)
1041 split->pxdlist = &pxdlist;
1042 if ((rc = dtExtendPage(tid, ip, split, btstack))) {
1064 * split leaf page <sp> into <sp> and a new right page <rp>.
1070 * new index page(s) to cover page split(s)
1091 split->pxdlist = &pxdlist;
1092 if ((rc = dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd))) {
1103 * propagate up the router entry for the leaf page just split
1106 * propagate the insert/split up the tree by walking back the stack
1108 * that were traversed during the search for the page that split.
1110 * the propagation of insert/split up the tree stops if the root
1111 * splits or the page inserted into doesn't have to split to hold
1114 * the parent entry for the split page remains the same, and
1143 * because the split was to the right.
1163 * if split occurs between these two entries, and
1226 * parent page is full - split the parent page
1229 /* init for parent page split */
1230 split->mp = smp;
1231 split->index = skip; /* index at insert */
1232 split->nslot = n;
1233 split->key = &key;
1234 /* split->data = data; */
1239 /* The split routines insert the new entry,
1244 dtSplitRoot(tid, ip, split, &rmp) :
1245 dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd);
1289 /* unpin current split and its right page */
1294 * free remaining extents allocated for split
1318 * function: Split a non-root page of a btree.
1324 * return split and new page pinned;
1326 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
1352 /* get split page */
1353 smp = split->mp;
1357 * allocate the new right page for the split
1359 pxdlist = split->pxdlist;
1389 * acquire a transaction lock on the split page
1396 /* linelock header of split page */
1430 * sequential append at tail: append without split
1436 * If we're wrong it's no big deal, we'll just do the split the right
1439 * reverse sorted data, that is, split the tree left,
1442 if (nextbn == 0 && split->index == sp->header.nextindex) {
1458 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck);
1498 * split the data between the split and right pages.
1500 skip = split->index;
1505 * compute fill factor for split pages
1515 n = split->nslot;
1552 * split page moved out entries are linelocked;
1595 /* insert the new entry in the split page */
1596 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck);
1598 /* linelock stbl of split page */
1616 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck);
1639 struct inode *ip, struct dtsplit * split, struct btstack * btstack)
1664 smp = split->mp;
1676 pxdlist = split->pxdlist;
1817 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck);
1857 * split the full root page into
1858 * original/root/split page and new right page
1862 * the split root page contains a single entry for the
1872 struct inode *ip, struct dtsplit * split, struct metapage ** rmpp)
1894 /* get split root page */
1895 smp = split->mp;
1901 * N.B. at first split, a one (or two) block to fit new entry
1902 * is allocated; at subsequent split, a full page is allocated;
1904 pxdlist = split->pxdlist;
2009 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck);
3783 * function: move entries from split/left page to new/right page