From c535cb5593af3aad9e236266a6174a94ca24eedc Mon Sep 17 00:00:00 2001 From: "Liam R. Howlett" Date: Fri, 29 Nov 2024 20:33:38 -0500 Subject: [PATCH] inlineing Signed-off-by: Liam R. Howlett --- lib/maple_tree.c | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/lib/maple_tree.c b/lib/maple_tree.c index ab0f8123e4850..9f6f032d44169 100644 --- a/lib/maple_tree.c +++ b/lib/maple_tree.c @@ -764,7 +764,7 @@ mas_safe_pivot(const struct ma_state *mas, unsigned long *pivots, * * Return: The minimum range value that is contained in @offset. */ -static inline unsigned long +static __always_inline unsigned long mas_safe_min(struct ma_state *mas, unsigned long *pivots, unsigned char offset) { if (likely(offset)) @@ -4074,7 +4074,7 @@ static inline void mas_store_root(struct ma_state *mas, void *entry) * * Return: True if this is a spanning write, false otherwise. */ -static bool mas_is_span_wr(struct ma_wr_state *wr_mas) +static 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; @@ -4104,14 +4104,16 @@ static bool mas_is_span_wr(struct ma_wr_state *wr_mas) return true; } -static inline void mas_wr_walk_descend(struct ma_wr_state *wr_mas) +static __always_inline +void mas_wr_walk_descend(struct ma_wr_state *wr_mas) { wr_mas->type = mte_node_type(wr_mas->mas->node); mas_wr_node_walk(wr_mas); wr_mas->slots = ma_slots(wr_mas->node, wr_mas->type); } -static inline void mas_wr_walk_traverse(struct ma_wr_state *wr_mas) +static __always_inline +void mas_wr_walk_traverse(struct ma_wr_state *wr_mas) { wr_mas->mas->max = wr_mas->r_max; wr_mas->mas->min = wr_mas->r_min; -- 2.50.1