return 0;
}
-static void __free_root_info(struct rb_node *node)
+static void free_root_info(struct rb_node *node)
{
struct root_info *ri;
return 0;
}
-static int __list_subvol_search(int fd, struct root_lookup *root_lookup)
+static int list_subvol_search(int fd, struct root_lookup *root_lookup)
{
int ret;
struct btrfs_ioctl_search_args args;
return 1;
}
-static void __filter_and_sort_subvol(struct root_lookup *all_subvols,
+static void filter_and_sort_subvol(struct root_lookup *all_subvols,
struct root_lookup *sort_tree,
struct btrfs_list_filter_set *filter_set,
struct btrfs_list_comparer_set *comp_set,
}
}
-static int __list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
+static int list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
{
struct rb_node *n;
{
int ret;
- ret = __list_subvol_search(fd, root_lookup);
+ ret = list_subvol_search(fd, root_lookup);
if (ret) {
fprintf(stderr, "ERROR: can't perform the search - %s\n",
strerror(errno));
* now we have an rbtree full of root_info objects, but we need to fill
* in their path names within the subvol that is referencing each one.
*/
- ret = __list_subvol_fill_paths(fd, root_lookup);
+ ret = list_subvol_fill_paths(fd, root_lookup);
return ret;
}
ret = btrfs_list_subvols(fd, &root_lookup);
if (ret)
return ret;
- __filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
+ filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
comp_set, top_id);
print_all_volume_info(&root_sort, layout, raw_prefix);
- rb_free_nodes(&root_lookup.root, __free_root_info);
+ rb_free_nodes(&root_lookup.root, free_root_info);
return 0;
}
}
rbn = rb_next(rbn);
}
- rb_free_nodes(&rl.root, __free_root_info);
+ rb_free_nodes(&rl.root, free_root_info);
return ret;
}
if (ret)
return ERR_PTR(ret);
- ret = __list_subvol_search(fd, &root_lookup);
+ ret = list_subvol_search(fd, &root_lookup);
if (ret < 0)
return ERR_PTR(ret);
- ret = __list_subvol_fill_paths(fd, &root_lookup);
+ ret = list_subvol_fill_paths(fd, &root_lookup);
if (ret < 0)
return ERR_PTR(ret);
n = rb_prev(n);
}
- rb_free_nodes(&root_lookup.root, __free_root_info);
+ rb_free_nodes(&root_lookup.root, free_root_info);
return ret_path;
}