From 0726bb6b4e0250a72ce399d945d250724b4a29ab Mon Sep 17 00:00:00 2001 From: John Naylor Date: Mon, 6 Feb 2023 21:04:14 +0700 Subject: [PATCH v26 6/9] Adjust some inlining declarations --- src/include/lib/radixtree.h | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/include/lib/radixtree.h b/src/include/lib/radixtree.h index d6919aef08..4bd0aaa810 100644 --- a/src/include/lib/radixtree.h +++ b/src/include/lib/radixtree.h @@ -1124,7 +1124,7 @@ RT_INIT_NODE(RT_PTR_LOCAL node, uint8 kind, RT_SIZE_CLASS size_class, bool is_le * Create a new node as the root. Subordinate nodes will be created during * the insertion. */ -static void +static pg_noinline void RT_NEW_ROOT(RT_RADIX_TREE *tree, uint64 key) { int shift = RT_KEY_GET_SHIFT(key); @@ -1215,7 +1215,7 @@ RT_NODE_UPDATE_INNER(RT_PTR_LOCAL node, uint64 key, RT_PTR_ALLOC new_child) /* * Replace old_child with new_child, and free the old one. */ -static void +static inline void RT_REPLACE_NODE(RT_RADIX_TREE *tree, RT_PTR_LOCAL parent, RT_PTR_ALLOC stored_old_child, RT_PTR_LOCAL old_child, RT_PTR_ALLOC new_child, uint64 key) @@ -1242,7 +1242,7 @@ RT_REPLACE_NODE(RT_RADIX_TREE *tree, RT_PTR_LOCAL parent, * The radix tree doesn't have sufficient height. Extend the radix tree so * it can store the key. */ -static void +static pg_noinline void RT_EXTEND(RT_RADIX_TREE *tree, uint64 key) { int target_shift; @@ -1281,7 +1281,7 @@ RT_EXTEND(RT_RADIX_TREE *tree, uint64 key) * The radix tree doesn't have inner and leaf nodes for given key-value pair. * Insert inner and leaf nodes from 'node' to bottom. */ -static inline void +static pg_noinline void RT_SET_EXTEND(RT_RADIX_TREE *tree, uint64 key, RT_VALUE_TYPE *value_p, RT_PTR_LOCAL parent, RT_PTR_ALLOC stored_node, RT_PTR_LOCAL node) { @@ -1486,7 +1486,7 @@ RT_GET_HANDLE(RT_RADIX_TREE *tree) /* * Recursively free all nodes allocated to the DSA area. */ -static inline void +static void RT_FREE_RECURSE(RT_RADIX_TREE *tree, RT_PTR_ALLOC ptr) { RT_PTR_LOCAL node = RT_PTR_GET_LOCAL(tree, ptr); -- 2.39.1