From fd09e5bd77fa9861e58ce3aeb912f56940c7b1df Mon Sep 17 00:00:00 2001 From: "Liam R. Howlett" Date: Fri, 29 Nov 2024 23:02:41 -0500 Subject: [PATCH] inline three small functions Signed-off-by: Liam R. Howlett --- lib/maple_tree.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/maple_tree.c b/lib/maple_tree.c index fd650cb53fc3..20280615c14b 100644 --- a/lib/maple_tree.c +++ b/lib/maple_tree.c @@ -1363,7 +1363,7 @@ static inline void mas_free(struct ma_state *mas, struct maple_enode *used) * @count: The number of nodes needed * @gfp: the gfp flags */ -static void mas_node_count_gfp(struct ma_state *mas, int count, gfp_t gfp) +static inline void mas_node_count_gfp(struct ma_state *mas, int count, gfp_t gfp) { unsigned long allocated = mas_allocated(mas); @@ -3490,7 +3490,7 @@ finalise_leaf: } } -static inline unsigned char mas_wr_new_end(struct ma_wr_state *wr_mas) +static __always_inline unsigned char mas_wr_new_end(struct ma_wr_state *wr_mas) { struct ma_state *mas = wr_mas->mas; unsigned char new_end = mas->end + 2; @@ -4073,7 +4073,7 @@ static inline void mas_store_root(struct ma_state *mas, void *entry) * * Return: True if this is a spanning write, false otherwise. */ -static inline bool mas_is_span_wr(struct ma_wr_state *wr_mas) +static __always_inline bool mas_is_span_wr(struct ma_wr_state *wr_mas) { unsigned long max = wr_mas->r_max; unsigned long last = wr_mas->mas->last; -- 2.49.0