[OPTIM] force inlining of large functions with gcc >= 3
GCC 3 and above do not inline large functions, which is a problem
with ebtree where most core functions are inlined.
This simple patch has both reduced code size and increased speed.
It should be back-ported to ebtree.
diff --git a/include/common/eb64tree.h b/include/common/eb64tree.h
index 767ba83..3874ac8 100644
--- a/include/common/eb64tree.h
+++ b/include/common/eb64tree.h
@@ -109,7 +109,7 @@
*/
/* Delete node from the tree if it was linked in. Mark the node unused. */
-static inline void __eb64_delete(struct eb64_node *eb64)
+static forceinline void __eb64_delete(struct eb64_node *eb64)
{
__eb_delete(&eb64->node);
}
@@ -118,7 +118,7 @@
* Find the first occurence of a key in the tree <root>. If none can be
* found, return NULL.
*/
-static inline struct eb64_node *__eb64_lookup(struct eb_root *root, u64 x)
+static forceinline struct eb64_node *__eb64_lookup(struct eb_root *root, u64 x)
{
struct eb64_node *node;
eb_troot_t *troot;
@@ -162,7 +162,7 @@
* Find the first occurence of a signed key in the tree <root>. If none can
* be found, return NULL.
*/
-static inline struct eb64_node *__eb64i_lookup(struct eb_root *root, s64 x)
+static forceinline struct eb64_node *__eb64i_lookup(struct eb_root *root, s64 x)
{
struct eb64_node *node;
eb_troot_t *troot;
@@ -207,7 +207,7 @@
* Only new->key needs be set with the key. The eb64_node is returned.
* If root->b[EB_RGHT]==1, the tree may only contain unique keys.
*/
-static inline struct eb64_node *
+static forceinline struct eb64_node *
__eb64_insert(struct eb_root *root, struct eb64_node *new) {
struct eb64_node *old;
unsigned int side;
@@ -381,7 +381,7 @@
* signed keys. Only new->key needs be set with the key. The eb64_node
* is returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys.
*/
-static inline struct eb64_node *
+static forceinline struct eb64_node *
__eb64i_insert(struct eb_root *root, struct eb64_node *new) {
struct eb64_node *old;
unsigned int side;