37 		int nr_items;  member
264 						     int nr_items)  in tree_mod_log_alloc_move()  argument
275 	tm->move.nr_items = nr_items;  in tree_mod_log_alloc_move()
284 				   int nr_items)  in btrfs_tree_mod_log_insert_move()  argument
295 	tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), GFP_NOFS);  in btrfs_tree_mod_log_insert_move()
301 	tm = tree_mod_log_alloc_move(eb, dst_slot, src_slot, nr_items);  in btrfs_tree_mod_log_insert_move()
308 	for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) {  in btrfs_tree_mod_log_insert_move()
340 	for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) {  in btrfs_tree_mod_log_insert_move()
356 		for (i = 0; i < nr_items; i++) {  in btrfs_tree_mod_log_insert_move()
542 			       int nr_items)  in btrfs_tree_mod_log_eb_copy()  argument
554 	u32 src_move_nr_items = btrfs_header_nritems(src) - (src_offset + nr_items);  in btrfs_tree_mod_log_eb_copy()
562 	tm_list = kcalloc(nr_items * 2, sizeof(struct tree_mod_elem *),  in btrfs_tree_mod_log_eb_copy()
570 		dst_move_tm = tree_mod_log_alloc_move(dst, dst_offset + nr_items,  in btrfs_tree_mod_log_eb_copy()
580 						      src_offset + nr_items,  in btrfs_tree_mod_log_eb_copy()
590 	tm_list_rem = tm_list + nr_items;  in btrfs_tree_mod_log_eb_copy()
591 	for (i = 0; i < nr_items; i++) {  in btrfs_tree_mod_log_eb_copy()
630 	for (i = 0; i < nr_items; i++) {  in btrfs_tree_mod_log_eb_copy()
657 		for (i = 0; i < nr_items * 2; i++) {  in btrfs_tree_mod_log_eb_copy()
865 			ASSERT(tm->move.nr_items > 0);  in tree_mod_log_rewind()
866 			move_src_end_slot = tm->move.dst_slot + tm->move.nr_items - 1;  in tree_mod_log_rewind()
867 			move_dst_end_slot = tm->slot + tm->move.nr_items - 1;  in tree_mod_log_rewind()
871 				    tm->move.nr_items <= 0)) {  in tree_mod_log_rewind()
875 					   tm->move.dst_slot, tm->move.nr_items,  in tree_mod_log_rewind()
879 					      tm->move.nr_items * p_size);  in tree_mod_log_rewind()