summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorKent Overstreet <kmo@daterainc.com>2015-02-03 19:23:50 -0800
committerKent Overstreet <kmo@daterainc.com>2015-02-12 23:43:52 -0800
commit59639fb1b40d8a9d8b3f220ecd4669a21c7fb906 (patch)
treebea16c90749b70b3fed1db979a63858e7ebe132f
parentd7553b3a1154034713db5162838066ef136ef2f8 (diff)
bcache: Better inlining
bch_bset_search() is now only called in the one place, so flatten that function instead Change-Id: I6a41b1bfa23f1abe4d8cd73bd1a1120d704a184c
-rw-r--r--drivers/md/bcache/bset.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/drivers/md/bcache/bset.c b/drivers/md/bcache/bset.c
index bf78c620d6a8..652c485b6a95 100644
--- a/drivers/md/bcache/bset.c
+++ b/drivers/md/bcache/bset.c
@@ -942,7 +942,6 @@ static struct bkey *bset_search_tree(struct bset_tree *t,
/*
* Returns the first key greater than or equal to @search
*/
-__attribute__((flatten))
static struct bkey *bch_bset_search(struct btree_keys *b, struct bset_tree *t,
struct bpos search)
{
@@ -1058,6 +1057,7 @@ static void __bch_btree_node_iter_init(struct btree_keys *b,
#endif
}
+__attribute__((flatten))
void bch_btree_node_iter_init(struct btree_keys *b,
struct btree_node_iter *iter,
struct bpos search)