tm_list           521 fs/btrfs/ctree.c 	struct tree_mod_elem **tm_list = NULL;
tm_list           529 fs/btrfs/ctree.c 	tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), GFP_NOFS);
tm_list           530 fs/btrfs/ctree.c 	if (!tm_list)
tm_list           546 fs/btrfs/ctree.c 		tm_list[i] = alloc_tree_mod_elem(eb, i + dst_slot,
tm_list           548 fs/btrfs/ctree.c 		if (!tm_list[i]) {
tm_list           564 fs/btrfs/ctree.c 		ret = __tree_mod_log_insert(eb->fs_info, tm_list[i]);
tm_list           573 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           578 fs/btrfs/ctree.c 		if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
tm_list           579 fs/btrfs/ctree.c 			rb_erase(&tm_list[i]->node, &eb->fs_info->tree_mod_log);
tm_list           580 fs/btrfs/ctree.c 		kfree(tm_list[i]);
tm_list           584 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           592 fs/btrfs/ctree.c 		       struct tree_mod_elem **tm_list,
tm_list           599 fs/btrfs/ctree.c 		ret = __tree_mod_log_insert(fs_info, tm_list[i]);
tm_list           602 fs/btrfs/ctree.c 				rb_erase(&tm_list[j]->node,
tm_list           616 fs/btrfs/ctree.c 	struct tree_mod_elem **tm_list = NULL;
tm_list           626 fs/btrfs/ctree.c 		tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),
tm_list           628 fs/btrfs/ctree.c 		if (!tm_list) {
tm_list           633 fs/btrfs/ctree.c 			tm_list[i] = alloc_tree_mod_elem(old_root, i,
tm_list           635 fs/btrfs/ctree.c 			if (!tm_list[i]) {
tm_list           657 fs/btrfs/ctree.c 	if (tm_list)
tm_list           658 fs/btrfs/ctree.c 		ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);
tm_list           665 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           670 fs/btrfs/ctree.c 	if (tm_list) {
tm_list           672 fs/btrfs/ctree.c 			kfree(tm_list[i]);
tm_list           673 fs/btrfs/ctree.c 		kfree(tm_list);
tm_list           751 fs/btrfs/ctree.c 	struct tree_mod_elem **tm_list = NULL;
tm_list           762 fs/btrfs/ctree.c 	tm_list = kcalloc(nr_items * 2, sizeof(struct tree_mod_elem *),
tm_list           764 fs/btrfs/ctree.c 	if (!tm_list)
tm_list           767 fs/btrfs/ctree.c 	tm_list_add = tm_list;
tm_list           768 fs/btrfs/ctree.c 	tm_list_rem = tm_list + nr_items;
tm_list           799 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           805 fs/btrfs/ctree.c 		if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
tm_list           806 fs/btrfs/ctree.c 			rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log);
tm_list           807 fs/btrfs/ctree.c 		kfree(tm_list[i]);
tm_list           811 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           818 fs/btrfs/ctree.c 	struct tree_mod_elem **tm_list = NULL;
tm_list           830 fs/btrfs/ctree.c 	tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);
tm_list           831 fs/btrfs/ctree.c 	if (!tm_list)
tm_list           835 fs/btrfs/ctree.c 		tm_list[i] = alloc_tree_mod_elem(eb, i,
tm_list           837 fs/btrfs/ctree.c 		if (!tm_list[i]) {
tm_list           846 fs/btrfs/ctree.c 	ret = __tree_mod_log_free_eb(eb->fs_info, tm_list, nritems);
tm_list           850 fs/btrfs/ctree.c 	kfree(tm_list);
tm_list           856 fs/btrfs/ctree.c 		kfree(tm_list[i]);
tm_list           857 fs/btrfs/ctree.c 	kfree(tm_list);