83 	 * If this extent tree is supported by an extent map, insert
590 	 * Tree depth may change during truncate, or insert. If we're  in ocfs2_reinit_path()
659  * Insert an extent block at given index.
671 	 * safely removed if we ever need to insert extent block  in ocfs2_path_insert_eb()
2029  *   - When our insert into the right path leaf is at the leftmost edge
2356  * - In the case that the rotation requires a post-insert update,
2431 				"Owner %llu: error during insert of %u "  in ocfs2_rotate_tree_right()
2451 			 * before the record insert is that an error  in ocfs2_rotate_tree_right()
2489 			 * instead of a real insert, then we have to  in ocfs2_rotate_tree_right()
3698 		 * Since the leftright insert always covers the entire  in ocfs2_try_to_merge_extent()
3699 		 * extent, this call will delete the insert record  in ocfs2_try_to_merge_extent()
3861 				 struct ocfs2_insert_type *insert)  in ocfs2_insert_at_leaf()  argument
3863 	int i = insert->ins_contig_index;  in ocfs2_insert_at_leaf()
3869 	if (insert->ins_split != SPLIT_NONE) {  in ocfs2_insert_at_leaf()
3874 					insert->ins_split, rec,  in ocfs2_insert_at_leaf()
3880 	 * Contiguous insert - either left or right.  in ocfs2_insert_at_leaf()
3882 	if (insert->ins_contig != CONTIG_NONE) {  in ocfs2_insert_at_leaf()
3884 		if (insert->ins_contig == CONTIG_LEFT) {  in ocfs2_insert_at_leaf()
3894 	 * Handle insert into an empty leaf.  in ocfs2_insert_at_leaf()
3905 	 * Appending insert.  in ocfs2_insert_at_leaf()
3907 	if (insert->ins_appending == APPEND_TAIL) {  in ocfs2_insert_at_leaf()
3918 				"insert.cpos %u, insert.clusters %u\n",  in ocfs2_insert_at_leaf()
4003 	 * If our appending insert is at the leftmost edge of a leaf,  in ocfs2_append_rec_to_path()
4096 			 * do the later insert there.  in ocfs2_split_record()
4100 			 * it back for a post-insert update.  in ocfs2_split_record()
4108 				 * can just do the insert there.  in ocfs2_split_record()
4115 				 * leaf. The insert will be into the  in ocfs2_split_record()
4132 		 * Left path is easy - we can just allow the insert to  in ocfs2_split_record()
4151  * right_path is the path we want to do the actual insert
4153  * portion of the tree after an edge insert.
4160 			     struct ocfs2_insert_type *insert)  in ocfs2_insert_path()  argument
4195 	if (insert->ins_split != SPLIT_NONE) {  in ocfs2_insert_path()
4202 				   insert_rec, insert->ins_split);  in ocfs2_insert_path()
4206 		 * have a guarantee that the later edge insert will  in ocfs2_insert_path()
4214 				     insert);  in ocfs2_insert_path()
4221 		 * up portions of the tree after the insert.  in ocfs2_insert_path()
4293 	 * left_path to account for an edge insert.  in ocfs2_do_insert_extent()
4295 	 * XXX: When modifying this code, keep in mind that an insert  in ocfs2_do_insert_extent()
4477 				     struct ocfs2_insert_type *insert,  in ocfs2_figure_contig_type()  argument
4490 			insert->ins_contig_index = i;  in ocfs2_figure_contig_type()
4494 	insert->ins_contig = contig_type;  in ocfs2_figure_contig_type()
4496 	if (insert->ins_contig != CONTIG_NONE) {  in ocfs2_figure_contig_type()
4498 				&el->l_recs[insert->ins_contig_index];  in ocfs2_figure_contig_type()
4508 			insert->ins_contig = CONTIG_NONE;  in ocfs2_figure_contig_type()
4516  * insert at the tail of the rightmost leaf.
4522 static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,  in ocfs2_figure_appending_type()  argument
4530 	insert->ins_appending = APPEND_NONE;  in ocfs2_figure_appending_type()
4553 	insert->ins_appending = APPEND_TAIL;  in ocfs2_figure_appending_type()
4557  * Helper function called at the beginning of an insert.
4563  *   - Whether the insert is an appending one.
4573 				    struct ocfs2_insert_type *insert)  in ocfs2_figure_insert_type()  argument
4581 	insert->ins_split = SPLIT_NONE;  in ocfs2_figure_insert_type()
4584 	insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);  in ocfs2_figure_insert_type()
4605 	 * Unless we have a contiguous insert, we'll need to know if  in ocfs2_figure_insert_type()
4615 	if (!insert->ins_tree_depth) {  in ocfs2_figure_insert_type()
4616 		ocfs2_figure_contig_type(et, insert, el, insert_rec);  in ocfs2_figure_insert_type()
4617 		ocfs2_figure_appending_type(insert, el, insert_rec);  in ocfs2_figure_insert_type()
4650 	ocfs2_figure_contig_type(et, insert, el, insert_rec);  in ocfs2_figure_insert_type()
4653 	 * The insert code isn't quite ready to deal with all cases of  in ocfs2_figure_insert_type()
4654 	 * left contiguousness. Specifically, if it's an insert into  in ocfs2_figure_insert_type()
4661 	if (insert->ins_contig == CONTIG_LEFT &&  in ocfs2_figure_insert_type()
4662 	    insert->ins_contig_index == 0)  in ocfs2_figure_insert_type()
4663 		insert->ins_contig = CONTIG_NONE;  in ocfs2_figure_insert_type()
4675 		 * tree path. This might be an appending insert. There are  in ocfs2_figure_insert_type()
4681 		ocfs2_figure_appending_type(insert, el, insert_rec);  in ocfs2_figure_insert_type()
4695  * Insert an extent into a btree.
4710 	struct ocfs2_insert_type insert = {0, };  in ocfs2_insert_extent()  local
4729 					  &free_records, &insert);  in ocfs2_insert_extent()
4735 	trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig,  in ocfs2_insert_extent()
4736 				  insert.ins_contig_index, free_records,  in ocfs2_insert_extent()
4737 				  insert.ins_tree_depth);  in ocfs2_insert_extent()
4739 	if (insert.ins_contig == CONTIG_NONE && free_records == 0) {  in ocfs2_insert_extent()
4741 					 &insert.ins_tree_depth, &last_eb_bh,  in ocfs2_insert_extent()
4750 	status = ocfs2_do_insert_extent(handle, et, &rec, &insert);  in ocfs2_insert_extent()
4915 	struct ocfs2_insert_type insert;  in ocfs2_split_and_insert()  local
4944 	memset(&insert, 0, sizeof(struct ocfs2_insert_type));  in ocfs2_split_and_insert()
4945 	insert.ins_appending = APPEND_NONE;  in ocfs2_split_and_insert()
4946 	insert.ins_contig = CONTIG_NONE;  in ocfs2_split_and_insert()
4947 	insert.ins_tree_depth = depth;  in ocfs2_split_and_insert()
4955 		insert.ins_split = SPLIT_LEFT;  in ocfs2_split_and_insert()
4957 		insert.ins_split = SPLIT_RIGHT;  in ocfs2_split_and_insert()
4963 		insert.ins_split = SPLIT_RIGHT;  in ocfs2_split_and_insert()
4974 	ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);  in ocfs2_split_and_insert()
5256 	 * XXX: This should be fixed up so that we just re-insert the  in ocfs2_mark_extent_written()
5282 	struct ocfs2_insert_type insert;  in ocfs2_split_tree()  local
5325 	memset(&insert, 0, sizeof(struct ocfs2_insert_type));  in ocfs2_split_tree()
5326 	insert.ins_appending = APPEND_NONE;  in ocfs2_split_tree()
5327 	insert.ins_contig = CONTIG_NONE;  in ocfs2_split_tree()
5328 	insert.ins_split = SPLIT_RIGHT;  in ocfs2_split_tree()
5329 	insert.ins_tree_depth = depth;  in ocfs2_split_tree()
5331 	ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);  in ocfs2_split_tree()
7107 		 * Save two copies, one for insert, and one that can  in ocfs2_convert_inline_data_to_extents()