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
860 * extend/split the leaf page; in dtInsert()
865 split.mp = mp; in dtInsert()
866 split.index = index; in dtInsert()
867 split.nslot = n; in dtInsert()
868 split.key = name; in dtInsert()
869 split.data = &data; in dtInsert()
870 rc = dtSplitUp(tid, ip, &split, btstack); in dtInsert()
926 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtSplitUp() argument
931 dtpage_t *sp; /* split page */ in dtSplitUp()
933 dtpage_t *rp; /* new right page split from sp */ in dtSplitUp()
944 ddata_t *data = split->data; in dtSplitUp()
951 /* get split page */ in dtSplitUp()
952 smp = split->mp; in dtSplitUp()
963 * split leaf page in dtSplitUp()
965 * The split routines insert the new entry, and in dtSplitUp()
969 * split root leaf page: in dtSplitUp()
979 if (n <= split->nslot) in dtSplitUp()
991 split->pxdlist = &pxdlist; in dtSplitUp()
992 rc = dtSplitRoot(tid, ip, split, &rmp); in dtSplitUp()
1020 if ((n + sp->header.freecnt) <= split->nslot) in dtSplitUp()
1040 split->pxdlist = &pxdlist; in dtSplitUp()
1041 if ((rc = dtExtendPage(tid, ip, split, btstack))) { in dtSplitUp()
1063 * split leaf page <sp> into <sp> and a new right page <rp>. in dtSplitUp()
1069 * new index page(s) to cover page split(s) in dtSplitUp()
1090 split->pxdlist = &pxdlist; in dtSplitUp()
1091 if ((rc = dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd))) { in dtSplitUp()
1102 * propagate up the router entry for the leaf page just split in dtSplitUp()
1105 * propagate the insert/split up the tree by walking back the stack in dtSplitUp()
1107 * that were traversed during the search for the page that split. in dtSplitUp()
1109 * the propagation of insert/split up the tree stops if the root in dtSplitUp()
1110 * splits or the page inserted into doesn't have to split to hold in dtSplitUp()
1113 * the parent entry for the split page remains the same, and in dtSplitUp()
1142 * because the split was to the right. in dtSplitUp()
1162 * if split occurs between these two entries, and in dtSplitUp()
1225 * parent page is full - split the parent page in dtSplitUp()
1228 /* init for parent page split */ in dtSplitUp()
1229 split->mp = smp; in dtSplitUp()
1230 split->index = skip; /* index at insert */ in dtSplitUp()
1231 split->nslot = n; in dtSplitUp()
1232 split->key = &key; in dtSplitUp()
1233 /* split->data = data; */ in dtSplitUp()
1238 /* The split routines insert the new entry, in dtSplitUp()
1243 dtSplitRoot(tid, ip, split, &rmp) : in dtSplitUp()
1244 dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd); in dtSplitUp()
1288 /* unpin current split and its right page */ in dtSplitUp()
1293 * free remaining extents allocated for split in dtSplitUp()
1317 * function: Split a non-root page of a btree.
1323 * return split and new page pinned;
1325 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, in dtSplitPage() argument
1351 /* get split page */ in dtSplitPage()
1352 smp = split->mp; in dtSplitPage()
1356 * allocate the new right page for the split in dtSplitPage()
1358 pxdlist = split->pxdlist; in dtSplitPage()
1388 * acquire a transaction lock on the split page in dtSplitPage()
1395 /* linelock header of split page */ in dtSplitPage()
1429 * sequential append at tail: append without split in dtSplitPage()
1435 * If we're wrong it's no big deal, we'll just do the split the right in dtSplitPage()
1438 * reverse sorted data, that is, split the tree left, in dtSplitPage()
1441 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1457 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); in dtSplitPage()
1497 * split the data between the split and right pages. in dtSplitPage()
1499 skip = split->index; in dtSplitPage()
1504 * compute fill factor for split pages in dtSplitPage()
1514 n = split->nslot; in dtSplitPage()
1551 * split page moved out entries are linelocked; in dtSplitPage()
1594 /* insert the new entry in the split page */ in dtSplitPage()
1595 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); in dtSplitPage()
1597 /* linelock stbl of split page */ in dtSplitPage()
1615 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); in dtSplitPage()
1638 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtExtendPage() argument
1663 smp = split->mp; in dtExtendPage()
1675 pxdlist = split->pxdlist; in dtExtendPage()
1816 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); in dtExtendPage()
1856 * split the full root page into
1857 * original/root/split page and new right page
1861 * the split root page contains a single entry for the
1871 struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) in dtSplitRoot() argument
1893 /* get split root page */ in dtSplitRoot()
1894 smp = split->mp; in dtSplitRoot()
1900 * N.B. at first split, a one (or two) block to fit new entry in dtSplitRoot()
1901 * is allocated; at subsequent split, a full page is allocated; in dtSplitRoot()
1903 pxdlist = split->pxdlist; in dtSplitRoot()
2008 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); in dtSplitRoot()
3755 * function: move entries from split/left page to new/right page