aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--drivers/md/bcache/btree.c2
-rw-r--r--drivers/md/bcache/closure.c8
-rw-r--r--drivers/md/bcache/request.c1
-rw-r--r--drivers/md/bcache/util.c18
4 files changed, 14 insertions, 15 deletions
diff --git a/drivers/md/bcache/btree.c b/drivers/md/bcache/btree.c
index 143ed5a758e7..17936b2dc7d6 100644
--- a/drivers/md/bcache/btree.c
+++ b/drivers/md/bcache/btree.c
@@ -962,7 +962,7 @@ err:
962 return b; 962 return b;
963} 963}
964 964
965/** 965/*
966 * bch_btree_node_get - find a btree node in the cache and lock it, reading it 966 * bch_btree_node_get - find a btree node in the cache and lock it, reading it
967 * in from disk if necessary. 967 * in from disk if necessary.
968 * 968 *
diff --git a/drivers/md/bcache/closure.c b/drivers/md/bcache/closure.c
index c0949c9f843b..0e14969182c6 100644
--- a/drivers/md/bcache/closure.c
+++ b/drivers/md/bcache/closure.c
@@ -46,7 +46,7 @@ void closure_sub(struct closure *cl, int v)
46} 46}
47EXPORT_SYMBOL(closure_sub); 47EXPORT_SYMBOL(closure_sub);
48 48
49/** 49/*
50 * closure_put - decrement a closure's refcount 50 * closure_put - decrement a closure's refcount
51 */ 51 */
52void closure_put(struct closure *cl) 52void closure_put(struct closure *cl)
@@ -55,7 +55,7 @@ void closure_put(struct closure *cl)
55} 55}
56EXPORT_SYMBOL(closure_put); 56EXPORT_SYMBOL(closure_put);
57 57
58/** 58/*
59 * closure_wake_up - wake up all closures on a wait list, without memory barrier 59 * closure_wake_up - wake up all closures on a wait list, without memory barrier
60 */ 60 */
61void __closure_wake_up(struct closure_waitlist *wait_list) 61void __closure_wake_up(struct closure_waitlist *wait_list)
@@ -79,9 +79,9 @@ EXPORT_SYMBOL(__closure_wake_up);
79 79
80/** 80/**
81 * closure_wait - add a closure to a waitlist 81 * closure_wait - add a closure to a waitlist
82 * 82 * @waitlist: will own a ref on @cl, which will be released when
83 * @waitlist will own a ref on @cl, which will be released when
84 * closure_wake_up() is called on @waitlist. 83 * closure_wake_up() is called on @waitlist.
84 * @cl: closure pointer.
85 * 85 *
86 */ 86 */
87bool closure_wait(struct closure_waitlist *waitlist, struct closure *cl) 87bool closure_wait(struct closure_waitlist *waitlist, struct closure *cl)
diff --git a/drivers/md/bcache/request.c b/drivers/md/bcache/request.c
index 5a82237c7025..a65e3365eeb9 100644
--- a/drivers/md/bcache/request.c
+++ b/drivers/md/bcache/request.c
@@ -296,6 +296,7 @@ err:
296 296
297/** 297/**
298 * bch_data_insert - stick some data in the cache 298 * bch_data_insert - stick some data in the cache
299 * @cl: closure pointer.
299 * 300 *
300 * This is the starting point for any data to end up in a cache device; it could 301 * This is the starting point for any data to end up in a cache device; it could
301 * be from a normal write, or a writeback write, or a write to a flash only 302 * be from a normal write, or a writeback write, or a write to a flash only
diff --git a/drivers/md/bcache/util.c b/drivers/md/bcache/util.c
index 6198041f0ee2..74febd5230df 100644
--- a/drivers/md/bcache/util.c
+++ b/drivers/md/bcache/util.c
@@ -82,10 +82,9 @@ STRTO_H(strtoll, long long)
82STRTO_H(strtoull, unsigned long long) 82STRTO_H(strtoull, unsigned long long)
83 83
84/** 84/**
85 * bch_hprint() - formats @v to human readable string for sysfs. 85 * bch_hprint - formats @v to human readable string for sysfs.
86 * 86 * @buf: the (at least 8 byte) buffer to format the result into.
87 * @v - signed 64 bit integer 87 * @v: signed 64 bit integer
88 * @buf - the (at least 8 byte) buffer to format the result into.
89 * 88 *
90 * Returns the number of bytes used by format. 89 * Returns the number of bytes used by format.
91 */ 90 */
@@ -225,13 +224,12 @@ void bch_time_stats_update(struct time_stats *stats, uint64_t start_time)
225} 224}
226 225
227/** 226/**
228 * bch_next_delay() - increment @d by the amount of work done, and return how 227 * bch_next_delay() - update ratelimiting statistics and calculate next delay
229 * long to delay until the next time to do some work. 228 * @d: the struct bch_ratelimit to update
230 * 229 * @done: the amount of work done, in arbitrary units
231 * @d - the struct bch_ratelimit to update
232 * @done - the amount of work done, in arbitrary units
233 * 230 *
234 * Returns the amount of time to delay by, in jiffies 231 * Increment @d by the amount of work done, and return how long to delay in
232 * jiffies until the next time to do some work.
235 */ 233 */
236uint64_t bch_next_delay(struct bch_ratelimit *d, uint64_t done) 234uint64_t bch_next_delay(struct bch_ratelimit *d, uint64_t done)
237{ 235{