Lines Matching refs:tm_list
287 struct tree_mod_elem **tm_list = NULL;
295 tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), GFP_NOFS);
296 if (!tm_list) {
309 tm_list[i] = alloc_tree_mod_elem(eb, i + dst_slot,
311 if (!tm_list[i]) {
341 ret = tree_mod_log_insert(eb->fs_info, tm_list[i]);
350 kfree(tm_list);
355 if (tm_list) {
357 if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
358 rb_erase(&tm_list[i]->node, &eb->fs_info->tree_mod_log);
359 kfree(tm_list[i]);
364 kfree(tm_list);
371 struct tree_mod_elem **tm_list,
378 ret = tree_mod_log_insert(fs_info, tm_list[i]);
381 rb_erase(&tm_list[j]->node,
396 struct tree_mod_elem **tm_list = NULL;
406 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),
408 if (!tm_list) {
413 tm_list[i] = alloc_tree_mod_elem(old_root, i,
415 if (!tm_list[i]) {
450 if (tm_list)
451 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems);
459 kfree(tm_list);
464 if (tm_list) {
466 kfree(tm_list[i]);
467 kfree(tm_list);
546 struct tree_mod_elem **tm_list = NULL;
562 tm_list = kcalloc(nr_items * 2, sizeof(struct tree_mod_elem *),
564 if (!tm_list) {
589 tm_list_add = tm_list;
590 tm_list_rem = tm_list + nr_items;
645 kfree(tm_list);
656 if (tm_list) {
658 if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
659 rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log);
660 kfree(tm_list[i]);
665 kfree(tm_list);
672 struct tree_mod_elem **tm_list = NULL;
681 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);
682 if (!tm_list) {
688 tm_list[i] = alloc_tree_mod_elem(eb, i,
690 if (!tm_list[i]) {
712 ret = tree_mod_log_free_eb(eb->fs_info, tm_list, nritems);
717 kfree(tm_list);
722 if (tm_list) {
724 kfree(tm_list[i]);
725 kfree(tm_list);