Lines Matching full:insert

534 	 *	search for the entry location at which to insert:  in xtInsert()
537 * pinned, index at which to insert). in xtInsert()
574 * insert entry for new extent in xtInsert()
582 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtInsert()
607 * insert the new entry into the leaf page in xtInsert()
616 /* if insert into middle, shift right remaining entries. */ in xtInsert()
621 /* insert the new entry: mark the entry NEW */ in xtInsert()
704 /* if insert into middle, shift right remaining entries. */ in xtSplitUp()
711 /* insert the new entry: mark the entry NEW */ in xtSplitUp()
765 * The split routines insert the new entry into the leaf page, in xtSplitUp()
780 * insert a router entry for the new page into the parent page, in xtSplitUp()
781 * propagate the insert/split up the tree by walking back the stack in xtSplitUp()
785 * the propagation of insert/split up the tree stops if the root in xtSplitUp()
807 * insert router entry in parent for new right child page <rp> in xtSplitUp()
832 split->index = skip; /* index at insert */ in xtSplitUp()
841 /* The split routines insert the new entry, in xtSplitUp()
857 * parent page is not full - insert in parent page in xtSplitUp()
861 * insert router entry in parent for the right child in xtSplitUp()
872 * if insert into middle, shift right remaining entries in xtSplitUp()
879 /* insert the router entry */ in xtSplitUp()
931 * Pointer to page in which to insert or NULL on error.
1038 /* insert entry at the first entry of the new right page */ in xtSplitPage()
1058 * non-sequential insert (at possibly middle page) in xtSplitPage()
1097 * skip index in old split/left page - insert into left page: in xtSplitPage()
1109 /* insert new entry */ in xtSplitPage()
1125 * skip index in new right page - insert into right page: in xtSplitPage()
1133 /* insert new entry */ in xtSplitPage()
1198 * Pointer to page in which to insert or NULL on error.
1266 * insert the new entry into the new right/child page in xtSplitRoot()
1270 /* if insert into middle, shift right remaining entries */ in xtSplitRoot()
1394 * extent overflow: insert entry for new extent in xtExtend()
1402 * if the leaf page is full, insert the new entry and in xtExtend()
1405 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtExtend()
1448 * insert the new entry into the leaf page in xtExtend()
1451 /* insert the new entry: mark the entry NEW */ in xtExtend()
1699 /* insert nXAD:recorded */ in xtUpdate()
1751 /* if insert into middle, shift right remaining entries */ in xtUpdate()
1756 /* insert the entry */ in xtUpdate()
1847 /* insert rXAD:not_recorded */ in xtUpdate()
1895 /* if insert into middle, shift right remaining entries */ in xtUpdate()
1900 /* insert the entry */ in xtUpdate()
1969 * search for the entry location at which to insert: in xtAppend()
1972 * pinned, index at which to insert). in xtAppend()
1989 //insert: in xtAppend()
1991 * insert entry for new extent in xtAppend()
1999 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtAppend()
2054 * insert the new entry into the leaf page in xtAppend()
2072 /* insert the new entry: mark the entry NEW */ in xtAppend()