fs/ocfs2/alloc.c

83 	 * If this extent tree is supported by an extent map, insert
590 	 * Tree depth may change during truncate, or insert. If we're
671 	 * safely removed if we ever need to insert extent block
2036  *   - When our insert into the right path leaf is at the leftmost edge
2363  * - In the case that the rotation requires a post-insert update,
2438 				"Owner %llu: error during insert of %u "
2458 			 * before the record insert is that an error
2496 			 * instead of a real insert, then we have to
3705 		 * Since the leftright insert always covers the entire
3706 		 * extent, this call will delete the insert record
3868 				 struct ocfs2_insert_type *insert)
3870 	int i = insert->ins_contig_index;
3876 	if (insert->ins_split != SPLIT_NONE) {
3881 					insert->ins_split, rec,
3887 	 * Contiguous insert - either left or right.
3889 	if (insert->ins_contig != CONTIG_NONE) {
3891 		if (insert->ins_contig == CONTIG_LEFT) {
3901 	 * Handle insert into an empty leaf.
3912 	 * Appending insert.
3914 	if (insert->ins_appending == APPEND_TAIL) {
3925 				"insert.cpos %u, insert.clusters %u\n",
4010 	 * If our appending insert is at the leftmost edge of a leaf,
4103 			 * do the later insert there.
4107 			 * it back for a post-insert update.
4115 				 * can just do the insert there.
4122 				 * leaf. The insert will be into the
4139 		 * Left path is easy - we can just allow the insert to
4158  * right_path is the path we want to do the actual insert
4160  * portion of the tree after an edge insert.
4167 			     struct ocfs2_insert_type *insert)
4202 	if (insert->ins_split != SPLIT_NONE) {
4209 				   insert_rec, insert->ins_split);
4213 		 * have a guarantee that the later edge insert will
4221 				     insert);
4228 		 * up portions of the tree after the insert.
4300 	 * left_path to account for an edge insert.
4302 	 * XXX: When modifying this code, keep in mind that an insert
4484 				     struct ocfs2_insert_type *insert,
4497 			insert->ins_contig_index = i;
4501 	insert->ins_contig = contig_type;
4503 	if (insert->ins_contig != CONTIG_NONE) {
4505 				&el->l_recs[insert->ins_contig_index];
4515 			insert->ins_contig = CONTIG_NONE;
4523  * insert at the tail of the rightmost leaf.
4529 static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,
4537 	insert->ins_appending = APPEND_NONE;
4560 	insert->ins_appending = APPEND_TAIL;
4564  * Helper function called at the beginning of an insert.
4570  *   - Whether the insert is an appending one.
4580 				    struct ocfs2_insert_type *insert)
4588 	insert->ins_split = SPLIT_NONE;
4591 	insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);
4612 	 * Unless we have a contiguous insert, we'll need to know if
4622 	if (!insert->ins_tree_depth) {
4623 		ocfs2_figure_contig_type(et, insert, el, insert_rec);
4624 		ocfs2_figure_appending_type(insert, el, insert_rec);
4657 	ocfs2_figure_contig_type(et, insert, el, insert_rec);
4660 	 * The insert code isn't quite ready to deal with all cases of
4661 	 * left contiguousness. Specifically, if it's an insert into
4668 	if (insert->ins_contig == CONTIG_LEFT &&
4669 	    insert->ins_contig_index == 0)
4670 		insert->ins_contig = CONTIG_NONE;
4682 		 * tree path. This might be an appending insert. There are
4688 		ocfs2_figure_appending_type(insert, el, insert_rec);
4717 	struct ocfs2_insert_type insert = {0, };
4736 					  &free_records, &insert);
4742 	trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig,
4743 				  insert.ins_contig_index, free_records,
4744 				  insert.ins_tree_depth);
4746 	if (insert.ins_contig == CONTIG_NONE && free_records == 0) {
4748 					 &insert.ins_tree_depth, &last_eb_bh,
4757 	status = ocfs2_do_insert_extent(handle, et, &rec, &insert);
4922 	struct ocfs2_insert_type insert;
4951 	memset(&insert, 0, sizeof(struct ocfs2_insert_type));
4952 	insert.ins_appending = APPEND_NONE;
4953 	insert.ins_contig = CONTIG_NONE;
4954 	insert.ins_tree_depth = depth;
4962 		insert.ins_split = SPLIT_LEFT;
4964 		insert.ins_split = SPLIT_RIGHT;
4970 		insert.ins_split = SPLIT_RIGHT;
4981 	ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
5263 	 * XXX: This should be fixed up so that we just re-insert the
5289 	struct ocfs2_insert_type insert;
5332 	memset(&insert, 0, sizeof(struct ocfs2_insert_type));
5333 	insert.ins_appending = APPEND_NONE;
5334 	insert.ins_contig = CONTIG_NONE;
5335 	insert.ins_split = SPLIT_RIGHT;
5336 	insert.ins_tree_depth = depth;
5338 	ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
7121 		 * Save two copies, one for insert, and one that can