Message ID | 20230522050656.96215-11-zhangpeng.00@bytedance.com (mailing list archive) |
---|---|
State | New |
Headers | show |
Series | Clean ups for maple tree | expand |
* Peng Zhang <zhangpeng.00@bytedance.com> [230522 01:07]: > Relocate the declaration of mas_empty_area_rev() so that > mas_empty_area() and mas_empty_area_rev() are together. > > Signed-off-by: Peng Zhang <zhangpeng.00@bytedance.com> Reviewed-by: Liam R. Howlett <Liam.Howlett@oracle.com> > --- > include/linux/maple_tree.h | 12 ++++++------ > 1 file changed, 6 insertions(+), 6 deletions(-) > > diff --git a/include/linux/maple_tree.h b/include/linux/maple_tree.h > index 85559a34a098..c4681cb8414f 100644 > --- a/include/linux/maple_tree.h > +++ b/include/linux/maple_tree.h > @@ -474,6 +474,12 @@ void *mas_next_range(struct ma_state *mas, unsigned long max); > > int mas_empty_area(struct ma_state *mas, unsigned long min, unsigned long max, > unsigned long size); > +/* > + * This finds an empty area from the highest address to the lowest. > + * AKA "Topdown" version, > + */ > +int mas_empty_area_rev(struct ma_state *mas, unsigned long min, > + unsigned long max, unsigned long size); > > static inline void mas_init(struct ma_state *mas, struct maple_tree *tree, > unsigned long addr) > @@ -497,12 +503,6 @@ static inline bool mas_is_paused(const struct ma_state *mas) > return mas->node == MAS_PAUSE; > } > > -/* > - * This finds an empty area from the highest address to the lowest. > - * AKA "Topdown" version, > - */ > -int mas_empty_area_rev(struct ma_state *mas, unsigned long min, > - unsigned long max, unsigned long size); > /** > * mas_reset() - Reset a Maple Tree operation state. > * @mas: Maple Tree operation state. > -- > 2.20.1 >
diff --git a/include/linux/maple_tree.h b/include/linux/maple_tree.h index 85559a34a098..c4681cb8414f 100644 --- a/include/linux/maple_tree.h +++ b/include/linux/maple_tree.h @@ -474,6 +474,12 @@ void *mas_next_range(struct ma_state *mas, unsigned long max); int mas_empty_area(struct ma_state *mas, unsigned long min, unsigned long max, unsigned long size); +/* + * This finds an empty area from the highest address to the lowest. + * AKA "Topdown" version, + */ +int mas_empty_area_rev(struct ma_state *mas, unsigned long min, + unsigned long max, unsigned long size); static inline void mas_init(struct ma_state *mas, struct maple_tree *tree, unsigned long addr) @@ -497,12 +503,6 @@ static inline bool mas_is_paused(const struct ma_state *mas) return mas->node == MAS_PAUSE; } -/* - * This finds an empty area from the highest address to the lowest. - * AKA "Topdown" version, - */ -int mas_empty_area_rev(struct ma_state *mas, unsigned long min, - unsigned long max, unsigned long size); /** * mas_reset() - Reset a Maple Tree operation state. * @mas: Maple Tree operation state.
Relocate the declaration of mas_empty_area_rev() so that mas_empty_area() and mas_empty_area_rev() are together. Signed-off-by: Peng Zhang <zhangpeng.00@bytedance.com> --- include/linux/maple_tree.h | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-)