From 2d9c08add2cf34326d54e1da2256e77c099fe28a Mon Sep 17 00:00:00 2001 From: "Matthew Wilcox (Oracle)" Date: Sat, 12 Oct 2019 23:19:22 -0400 Subject: [PATCH] maple_tree: Random whitespace fixes Also add some missing EXPORT_SYMBOLs Signed-off-by: Matthew Wilcox (Oracle) --- lib/maple_tree.c | 15 ++++++++++++--- 1 file changed, 12 insertions(+), 3 deletions(-) diff --git a/lib/maple_tree.c b/lib/maple_tree.c index 3f696a1eaec1..590a2eee3f36 100644 --- a/lib/maple_tree.c +++ b/lib/maple_tree.c @@ -3204,6 +3204,7 @@ ascend: mas_set_slot(mas, i); return found; } + /* * Private: Returns true if mas->node is a leaf */ @@ -3273,6 +3274,7 @@ done: mas_set_slot(mas, i); return ret; } + static inline bool _mas_walk(struct ma_state *mas) { mas->node = mas_start(mas); @@ -3298,6 +3300,7 @@ static inline int mas_safe_slot(struct ma_state *mas, unsigned char *slot, } return false; } + static inline int mas_dead_node(struct ma_state *mas, unsigned long index) { if (!mte_dead_node(mas->node)) @@ -3374,9 +3377,9 @@ done: not_found: mas->node = MAS_NONE; return NULL; - - } +EXPORT_SYMBOL_GPL(mas_find); + /** * mas_pause() - Pause a mas_find/mas_for_each to drop the lock. * @@ -3395,6 +3398,8 @@ void mas_pause(struct ma_state *mas) mas->index = mas->last + 1; mas->last++; } +EXPORT_SYMBOL_GPL(mas_pause); + /* mt_find() - Search from start up until an entry is found. * * Note: Does not return the zero entry. @@ -3438,6 +3443,7 @@ done: return entry; } +EXPORT_SYMBOL(mt_find); /* mt_find_after() - Search up from the entry of index until an entry is * found. @@ -3470,6 +3476,8 @@ done: return entry; } +EXPORT_SYMBOL(mt_find_after); + static inline void ma_inactive_insert(struct ma_state *mas, void *entry); static inline int mas_replace_tree(struct ma_state *mas, void *new_entry) { @@ -4039,6 +4047,7 @@ retry: return 0; } EXPORT_SYMBOL(mtree_store_range); + int mtree_store(struct maple_tree *mt, unsigned long index, void *entry, gfp_t gfp) { @@ -4162,8 +4171,8 @@ int mtree_next(struct maple_tree *mt, unsigned long index, unsigned long *next) if (mas.node) return 0; return ret; - } + int mtree_erase(struct maple_tree *mt, unsigned long index) { int ret = -EINVAL; -- 2.50.1