Loading drivers/md/bcache/btree.c +1 −1 Original line number Diff line number Diff line Loading @@ -962,7 +962,7 @@ static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op, return b; } /** /* * bch_btree_node_get - find a btree node in the cache and lock it, reading it * in from disk if necessary. * Loading drivers/md/bcache/closure.c +4 −4 Original line number Diff line number Diff line Loading @@ -46,7 +46,7 @@ void closure_sub(struct closure *cl, int v) } EXPORT_SYMBOL(closure_sub); /** /* * closure_put - decrement a closure's refcount */ void closure_put(struct closure *cl) Loading @@ -55,7 +55,7 @@ void closure_put(struct closure *cl) } EXPORT_SYMBOL(closure_put); /** /* * closure_wake_up - wake up all closures on a wait list, without memory barrier */ void __closure_wake_up(struct closure_waitlist *wait_list) Loading @@ -79,9 +79,9 @@ EXPORT_SYMBOL(__closure_wake_up); /** * closure_wait - add a closure to a waitlist * * @waitlist will own a ref on @cl, which will be released when * @waitlist: will own a ref on @cl, which will be released when * closure_wake_up() is called on @waitlist. * @cl: closure pointer. * */ bool closure_wait(struct closure_waitlist *waitlist, struct closure *cl) Loading drivers/md/bcache/request.c +1 −0 Original line number Diff line number Diff line Loading @@ -296,6 +296,7 @@ static void bch_data_insert_start(struct closure *cl) /** * bch_data_insert - stick some data in the cache * @cl: closure pointer. * * This is the starting point for any data to end up in a cache device; it could * be from a normal write, or a writeback write, or a write to a flash only Loading drivers/md/bcache/util.c +8 −10 Original line number Diff line number Diff line Loading @@ -82,10 +82,9 @@ STRTO_H(strtoll, long long) STRTO_H(strtoull, unsigned long long) /** * bch_hprint() - formats @v to human readable string for sysfs. * * @v - signed 64 bit integer * @buf - the (at least 8 byte) buffer to format the result into. * bch_hprint - formats @v to human readable string for sysfs. * @buf: the (at least 8 byte) buffer to format the result into. * @v: signed 64 bit integer * * Returns the number of bytes used by format. */ Loading Loading @@ -225,13 +224,12 @@ void bch_time_stats_update(struct time_stats *stats, uint64_t start_time) } /** * bch_next_delay() - increment @d by the amount of work done, and return how * long to delay until the next time to do some work. * * @d - the struct bch_ratelimit to update * @done - the amount of work done, in arbitrary units * bch_next_delay() - update ratelimiting statistics and calculate next delay * @d: the struct bch_ratelimit to update * @done: the amount of work done, in arbitrary units * * Returns the amount of time to delay by, in jiffies * Increment @d by the amount of work done, and return how long to delay in * jiffies until the next time to do some work. */ uint64_t bch_next_delay(struct bch_ratelimit *d, uint64_t done) { Loading Loading
drivers/md/bcache/btree.c +1 −1 Original line number Diff line number Diff line Loading @@ -962,7 +962,7 @@ static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op, return b; } /** /* * bch_btree_node_get - find a btree node in the cache and lock it, reading it * in from disk if necessary. * Loading
drivers/md/bcache/closure.c +4 −4 Original line number Diff line number Diff line Loading @@ -46,7 +46,7 @@ void closure_sub(struct closure *cl, int v) } EXPORT_SYMBOL(closure_sub); /** /* * closure_put - decrement a closure's refcount */ void closure_put(struct closure *cl) Loading @@ -55,7 +55,7 @@ void closure_put(struct closure *cl) } EXPORT_SYMBOL(closure_put); /** /* * closure_wake_up - wake up all closures on a wait list, without memory barrier */ void __closure_wake_up(struct closure_waitlist *wait_list) Loading @@ -79,9 +79,9 @@ EXPORT_SYMBOL(__closure_wake_up); /** * closure_wait - add a closure to a waitlist * * @waitlist will own a ref on @cl, which will be released when * @waitlist: will own a ref on @cl, which will be released when * closure_wake_up() is called on @waitlist. * @cl: closure pointer. * */ bool closure_wait(struct closure_waitlist *waitlist, struct closure *cl) Loading
drivers/md/bcache/request.c +1 −0 Original line number Diff line number Diff line Loading @@ -296,6 +296,7 @@ static void bch_data_insert_start(struct closure *cl) /** * bch_data_insert - stick some data in the cache * @cl: closure pointer. * * This is the starting point for any data to end up in a cache device; it could * be from a normal write, or a writeback write, or a write to a flash only Loading
drivers/md/bcache/util.c +8 −10 Original line number Diff line number Diff line Loading @@ -82,10 +82,9 @@ STRTO_H(strtoll, long long) STRTO_H(strtoull, unsigned long long) /** * bch_hprint() - formats @v to human readable string for sysfs. * * @v - signed 64 bit integer * @buf - the (at least 8 byte) buffer to format the result into. * bch_hprint - formats @v to human readable string for sysfs. * @buf: the (at least 8 byte) buffer to format the result into. * @v: signed 64 bit integer * * Returns the number of bytes used by format. */ Loading Loading @@ -225,13 +224,12 @@ void bch_time_stats_update(struct time_stats *stats, uint64_t start_time) } /** * bch_next_delay() - increment @d by the amount of work done, and return how * long to delay until the next time to do some work. * * @d - the struct bch_ratelimit to update * @done - the amount of work done, in arbitrary units * bch_next_delay() - update ratelimiting statistics and calculate next delay * @d: the struct bch_ratelimit to update * @done: the amount of work done, in arbitrary units * * Returns the amount of time to delay by, in jiffies * Increment @d by the amount of work done, and return how long to delay in * jiffies until the next time to do some work. */ uint64_t bch_next_delay(struct bch_ratelimit *d, uint64_t done) { Loading