diff options
| author | Wang Shilong <wangsl.fnst@cn.fujitsu.com> | 2014-01-28 11:25:35 -0500 |
|---|---|---|
| committer | Chris Mason <clm@fb.com> | 2014-01-29 10:06:27 -0500 |
| commit | 49fc647a2c558862145357f3a25892248042f6fe (patch) | |
| tree | f8f82c49a8ff6d6986229da550c5b56d493e22ba | |
| parent | 4c7a6f74ceeafd738b55d1c57349327f7ea8e895 (diff) | |
Btrfs: do not export ulist functions
There are not any users that use ulist except Btrfs,don't
export them.
Signed-off-by: Wang Shilong <wangsl.fnst@cn.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.cz>
Signed-off-by: Josef Bacik <jbacik@fb.com>
Signed-off-by: Chris Mason <clm@fb.com>
| -rw-r--r-- | fs/btrfs/ulist.c | 10 | ||||
| -rw-r--r-- | fs/btrfs/ulist.h | 1 |
2 files changed, 1 insertions, 10 deletions
diff --git a/fs/btrfs/ulist.c b/fs/btrfs/ulist.c index 8dd0e8dfdaf4..840a38b2778a 100644 --- a/fs/btrfs/ulist.c +++ b/fs/btrfs/ulist.c | |||
| @@ -5,7 +5,6 @@ | |||
| 5 | */ | 5 | */ |
| 6 | 6 | ||
| 7 | #include <linux/slab.h> | 7 | #include <linux/slab.h> |
| 8 | #include <linux/export.h> | ||
| 9 | #include "ulist.h" | 8 | #include "ulist.h" |
| 10 | #include "ctree.h" | 9 | #include "ctree.h" |
| 11 | 10 | ||
| @@ -51,7 +50,6 @@ void ulist_init(struct ulist *ulist) | |||
| 51 | ulist->root = RB_ROOT; | 50 | ulist->root = RB_ROOT; |
| 52 | ulist->nnodes = 0; | 51 | ulist->nnodes = 0; |
| 53 | } | 52 | } |
| 54 | EXPORT_SYMBOL(ulist_init); | ||
| 55 | 53 | ||
| 56 | /** | 54 | /** |
| 57 | * ulist_fini - free up additionally allocated memory for the ulist | 55 | * ulist_fini - free up additionally allocated memory for the ulist |
| @@ -60,7 +58,7 @@ EXPORT_SYMBOL(ulist_init); | |||
| 60 | * This is useful in cases where the base 'struct ulist' has been statically | 58 | * This is useful in cases where the base 'struct ulist' has been statically |
| 61 | * allocated. | 59 | * allocated. |
| 62 | */ | 60 | */ |
| 63 | void ulist_fini(struct ulist *ulist) | 61 | static void ulist_fini(struct ulist *ulist) |
| 64 | { | 62 | { |
| 65 | struct ulist_node *node; | 63 | struct ulist_node *node; |
| 66 | struct ulist_node *next; | 64 | struct ulist_node *next; |
| @@ -71,7 +69,6 @@ void ulist_fini(struct ulist *ulist) | |||
| 71 | ulist->root = RB_ROOT; | 69 | ulist->root = RB_ROOT; |
| 72 | INIT_LIST_HEAD(&ulist->nodes); | 70 | INIT_LIST_HEAD(&ulist->nodes); |
| 73 | } | 71 | } |
| 74 | EXPORT_SYMBOL(ulist_fini); | ||
| 75 | 72 | ||
| 76 | /** | 73 | /** |
| 77 | * ulist_reinit - prepare a ulist for reuse | 74 | * ulist_reinit - prepare a ulist for reuse |
| @@ -85,7 +82,6 @@ void ulist_reinit(struct ulist *ulist) | |||
| 85 | ulist_fini(ulist); | 82 | ulist_fini(ulist); |
| 86 | ulist_init(ulist); | 83 | ulist_init(ulist); |
| 87 | } | 84 | } |
| 88 | EXPORT_SYMBOL(ulist_reinit); | ||
| 89 | 85 | ||
| 90 | /** | 86 | /** |
| 91 | * ulist_alloc - dynamically allocate a ulist | 87 | * ulist_alloc - dynamically allocate a ulist |
| @@ -104,7 +100,6 @@ struct ulist *ulist_alloc(gfp_t gfp_mask) | |||
| 104 | 100 | ||
| 105 | return ulist; | 101 | return ulist; |
| 106 | } | 102 | } |
| 107 | EXPORT_SYMBOL(ulist_alloc); | ||
| 108 | 103 | ||
| 109 | /** | 104 | /** |
| 110 | * ulist_free - free dynamically allocated ulist | 105 | * ulist_free - free dynamically allocated ulist |
| @@ -119,7 +114,6 @@ void ulist_free(struct ulist *ulist) | |||
| 119 | ulist_fini(ulist); | 114 | ulist_fini(ulist); |
| 120 | kfree(ulist); | 115 | kfree(ulist); |
| 121 | } | 116 | } |
| 122 | EXPORT_SYMBOL(ulist_free); | ||
| 123 | 117 | ||
| 124 | static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val) | 118 | static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val) |
| 125 | { | 119 | { |
| @@ -214,7 +208,6 @@ int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, | |||
| 214 | 208 | ||
| 215 | return 1; | 209 | return 1; |
| 216 | } | 210 | } |
| 217 | EXPORT_SYMBOL(ulist_add); | ||
| 218 | 211 | ||
| 219 | /** | 212 | /** |
| 220 | * ulist_next - iterate ulist | 213 | * ulist_next - iterate ulist |
| @@ -256,4 +249,3 @@ struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) | |||
| 256 | #endif | 249 | #endif |
| 257 | return node; | 250 | return node; |
| 258 | } | 251 | } |
| 259 | EXPORT_SYMBOL(ulist_next); | ||
diff --git a/fs/btrfs/ulist.h b/fs/btrfs/ulist.h index 2be7102d8073..7f78cbf5cf41 100644 --- a/fs/btrfs/ulist.h +++ b/fs/btrfs/ulist.h | |||
| @@ -51,7 +51,6 @@ struct ulist { | |||
| 51 | }; | 51 | }; |
| 52 | 52 | ||
| 53 | void ulist_init(struct ulist *ulist); | 53 | void ulist_init(struct ulist *ulist); |
| 54 | void ulist_fini(struct ulist *ulist); | ||
| 55 | void ulist_reinit(struct ulist *ulist); | 54 | void ulist_reinit(struct ulist *ulist); |
| 56 | struct ulist *ulist_alloc(gfp_t gfp_mask); | 55 | struct ulist *ulist_alloc(gfp_t gfp_mask); |
| 57 | void ulist_free(struct ulist *ulist); | 56 | void ulist_free(struct ulist *ulist); |
