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()
762 /* update max. number of pages to split */ in dtSearch()
817 struct dtsplit split; /* split information */ in dtInsert() local
853 * extend/split the leaf page; in dtInsert()
858 split.mp = mp; in dtInsert()
859 split.index = index; in dtInsert()
860 split.nslot = n; in dtInsert()
861 split.key = name; in dtInsert()
862 split.data = &data; in dtInsert()
863 rc = dtSplitUp(tid, ip, &split, btstack); in dtInsert()
919 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtSplitUp() argument
924 dtpage_t *sp; /* split page */ in dtSplitUp()
926 dtpage_t *rp; /* new right page split from sp */ in dtSplitUp()
937 ddata_t *data = split->data; in dtSplitUp()
944 /* get split page */ in dtSplitUp()
945 smp = split->mp; in dtSplitUp()
956 * split leaf page in dtSplitUp()
958 * The split routines insert the new entry, and in dtSplitUp()
962 * split root leaf page: in dtSplitUp()
972 if (n <= split->nslot) in dtSplitUp()
984 split->pxdlist = &pxdlist; in dtSplitUp()
985 rc = dtSplitRoot(tid, ip, split, &rmp); in dtSplitUp()
1013 if ((n + sp->header.freecnt) <= split->nslot) in dtSplitUp()
1033 split->pxdlist = &pxdlist; in dtSplitUp()
1034 if ((rc = dtExtendPage(tid, ip, split, btstack))) { in dtSplitUp()
1056 * split leaf page <sp> into <sp> and a new right page <rp>. in dtSplitUp()
1062 * new index page(s) to cover page split(s) in dtSplitUp()
1083 split->pxdlist = &pxdlist; in dtSplitUp()
1084 if ((rc = dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd))) { in dtSplitUp()
1095 * propagate up the router entry for the leaf page just split in dtSplitUp()
1098 * propagate the insert/split up the tree by walking back the stack in dtSplitUp()
1100 * that were traversed during the search for the page that split. in dtSplitUp()
1102 * the propagation of insert/split up the tree stops if the root in dtSplitUp()
1103 * splits or the page inserted into doesn't have to split to hold in dtSplitUp()
1106 * the parent entry for the split page remains the same, and in dtSplitUp()
1135 * because the split was to the right. in dtSplitUp()
1155 * if split occurs between these two entries, and in dtSplitUp()
1218 * parent page is full - split the parent page in dtSplitUp()
1221 /* init for parent page split */ in dtSplitUp()
1222 split->mp = smp; in dtSplitUp()
1223 split->index = skip; /* index at insert */ in dtSplitUp()
1224 split->nslot = n; in dtSplitUp()
1225 split->key = &key; in dtSplitUp()
1226 /* split->data = data; */ in dtSplitUp()
1231 /* The split routines insert the new entry, in dtSplitUp()
1236 dtSplitRoot(tid, ip, split, &rmp) : in dtSplitUp()
1237 dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd); in dtSplitUp()
1281 /* unpin current split and its right page */ in dtSplitUp()
1286 * free remaining extents allocated for split in dtSplitUp()
1310 * function: Split a non-root page of a btree.
1316 * return split and new page pinned;
1318 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, in dtSplitPage() argument
1344 /* get split page */ in dtSplitPage()
1345 smp = split->mp; in dtSplitPage()
1349 * allocate the new right page for the split in dtSplitPage()
1351 pxdlist = split->pxdlist; in dtSplitPage()
1381 * acquire a transaction lock on the split page in dtSplitPage()
1388 /* linelock header of split page */ in dtSplitPage()
1422 * sequential append at tail: append without split in dtSplitPage()
1428 * If we're wrong it's no big deal, we'll just do the split the right in dtSplitPage()
1431 * reverse sorted data, that is, split the tree left, in dtSplitPage()
1434 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1450 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); in dtSplitPage()
1490 * split the data between the split and right pages. in dtSplitPage()
1492 skip = split->index; in dtSplitPage()
1497 * compute fill factor for split pages in dtSplitPage()
1507 n = split->nslot; in dtSplitPage()
1544 * split page moved out entries are linelocked; in dtSplitPage()
1587 /* insert the new entry in the split page */ in dtSplitPage()
1588 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); in dtSplitPage()
1590 /* linelock stbl of split page */ in dtSplitPage()
1608 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); in dtSplitPage()
1631 struct inode *ip, struct dtsplit * split, struct btstack * btstack) in dtExtendPage() argument
1656 smp = split->mp; in dtExtendPage()
1668 pxdlist = split->pxdlist; in dtExtendPage()
1809 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); in dtExtendPage()
1849 * split the full root page into
1850 * original/root/split page and new right page
1854 * the split root page contains a single entry for the
1864 struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) in dtSplitRoot() argument
1886 /* get split root page */ in dtSplitRoot()
1887 smp = split->mp; in dtSplitRoot()
1893 * N.B. at first split, a one (or two) block to fit new entry in dtSplitRoot()
1894 * is allocated; at subsequent split, a full page is allocated; in dtSplitRoot()
1896 pxdlist = split->pxdlist; in dtSplitRoot()
2001 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); in dtSplitRoot()
4046 * function: move entries from split/left page to new/right page