Lines Matching full:insert

545 	 *	search for the entry location at which to insert:  in xtInsert()
548 * pinned, index at which to insert). in xtInsert()
585 * insert entry for new extent in xtInsert()
593 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtInsert()
618 * insert the new entry into the leaf page in xtInsert()
627 /* if insert into middle, shift right remaining entries. */ in xtInsert()
632 /* insert the new entry: mark the entry NEW */ in xtInsert()
715 /* if insert into middle, shift right remaining entries. */ in xtSplitUp()
722 /* insert the new entry: mark the entry NEW */ in xtSplitUp()
776 * The split routines insert the new entry into the leaf page, in xtSplitUp()
791 * insert a router entry for the new page into the parent page, in xtSplitUp()
792 * propagate the insert/split up the tree by walking back the stack in xtSplitUp()
796 * the propagation of insert/split up the tree stops if the root in xtSplitUp()
818 * insert router entry in parent for new right child page <rp> in xtSplitUp()
843 split->index = skip; /* index at insert */ in xtSplitUp()
852 /* The split routines insert the new entry, in xtSplitUp()
868 * parent page is not full - insert in parent page in xtSplitUp()
872 * insert router entry in parent for the right child in xtSplitUp()
883 * if insert into middle, shift right remaining entries in xtSplitUp()
890 /* insert the router entry */ in xtSplitUp()
942 * Pointer to page in which to insert or NULL on error.
1049 /* insert entry at the first entry of the new right page */ in xtSplitPage()
1069 * non-sequential insert (at possibly middle page) in xtSplitPage()
1108 * skip index in old split/left page - insert into left page: in xtSplitPage()
1120 /* insert new entry */ in xtSplitPage()
1136 * skip index in new right page - insert into right page: in xtSplitPage()
1144 /* insert new entry */ in xtSplitPage()
1209 * Pointer to page in which to insert or NULL on error.
1277 * insert the new entry into the new right/child page in xtSplitRoot()
1281 /* if insert into middle, shift right remaining entries */ in xtSplitRoot()
1405 * extent overflow: insert entry for new extent in xtExtend()
1413 * if the leaf page is full, insert the new entry and in xtExtend()
1416 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtExtend()
1459 * insert the new entry into the leaf page in xtExtend()
1462 /* insert the new entry: mark the entry NEW */ in xtExtend()
1574 * partially replace extent: insert entry for new extent in xtTailgate()
1578 * if the leaf page is full, insert the new entry and in xtTailgate()
1581 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtTailgate()
1624 * insert the new entry into the leaf page in xtTailgate()
1627 /* insert the new entry: mark the entry NEW */ in xtTailgate()
1914 /* insert nXAD:recorded */ in xtUpdate()
1966 /* if insert into middle, shift right remaining entries */ in xtUpdate()
1971 /* insert the entry */ in xtUpdate()
2062 /* insert rXAD:not_recorded */ in xtUpdate()
2110 /* if insert into middle, shift right remaining entries */ in xtUpdate()
2115 /* insert the entry */ in xtUpdate()
2184 * search for the entry location at which to insert: in xtAppend()
2187 * pinned, index at which to insert). in xtAppend()
2204 //insert: in xtAppend()
2206 * insert entry for new extent in xtAppend()
2214 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtAppend()
2269 * insert the new entry into the leaf page in xtAppend()
2287 /* insert the new entry: mark the entry NEW */ in xtAppend()