inline three small functions

Signed-off-by: Liam R. Howlett <Liam.Howlett@Oracle.com>

diff --git a/lib/maple_tree.c b/lib/maple_tree.c
index fd650cb53fc370cf2e751227d8014ca1faf598c9..20280615c14b526fcadc8f7bf49111e458e7ba8a 100644 (file)
--- 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;