Searched hist:"48 dad8baf92fe8967d9e1358af1cfdda1d2d3298" (Results 1 – 5 of 5) sorted by relevance
| /linux/drivers/md/bcache/ |
| H A D | btree.h | diff 48dad8baf92fe8967d9e1358af1cfdda1d2d3298 Wed Sep 11 03:48:51 CEST 2013 Kent Overstreet <kmo@daterainc.com> bcache: Add btree_map() functions
Lots of stuff has been open coding its own btree traversal - which is
generally pretty simple code, but there are a few subtleties.
This adds new new functions, bch_btree_map_nodes() and
bch_btree_map_keys(), which do the traversal for you. Everything that's
open coding btree traversal now (with the exception of garbage
collection) is slowly going to be converted to these two functions;
being able to write other code at a higher level of abstraction is a
big improvement w.r.t. overall code quality.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
|
| H A D | bset.c | diff 48dad8baf92fe8967d9e1358af1cfdda1d2d3298 Wed Sep 11 03:48:51 CEST 2013 Kent Overstreet <kmo@daterainc.com> bcache: Add btree_map() functions
Lots of stuff has been open coding its own btree traversal - which is
generally pretty simple code, but there are a few subtleties.
This adds new new functions, bch_btree_map_nodes() and
bch_btree_map_keys(), which do the traversal for you. Everything that's
open coding btree traversal now (with the exception of garbage
collection) is slowly going to be converted to these two functions;
being able to write other code at a higher level of abstraction is a
big improvement w.r.t. overall code quality.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
|
| H A D | bcache.h | diff 48dad8baf92fe8967d9e1358af1cfdda1d2d3298 Wed Sep 11 03:48:51 CEST 2013 Kent Overstreet <kmo@daterainc.com> bcache: Add btree_map() functions
Lots of stuff has been open coding its own btree traversal - which is
generally pretty simple code, but there are a few subtleties.
This adds new new functions, bch_btree_map_nodes() and
bch_btree_map_keys(), which do the traversal for you. Everything that's
open coding btree traversal now (with the exception of garbage
collection) is slowly going to be converted to these two functions;
being able to write other code at a higher level of abstraction is a
big improvement w.r.t. overall code quality.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
|
| H A D | writeback.c | diff 48dad8baf92fe8967d9e1358af1cfdda1d2d3298 Wed Sep 11 03:48:51 CEST 2013 Kent Overstreet <kmo@daterainc.com> bcache: Add btree_map() functions
Lots of stuff has been open coding its own btree traversal - which is
generally pretty simple code, but there are a few subtleties.
This adds new new functions, bch_btree_map_nodes() and
bch_btree_map_keys(), which do the traversal for you. Everything that's
open coding btree traversal now (with the exception of garbage
collection) is slowly going to be converted to these two functions;
being able to write other code at a higher level of abstraction is a
big improvement w.r.t. overall code quality.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
|
| H A D | btree.c | diff 48dad8baf92fe8967d9e1358af1cfdda1d2d3298 Wed Sep 11 03:48:51 CEST 2013 Kent Overstreet <kmo@daterainc.com> bcache: Add btree_map() functions
Lots of stuff has been open coding its own btree traversal - which is
generally pretty simple code, but there are a few subtleties.
This adds new new functions, bch_btree_map_nodes() and
bch_btree_map_keys(), which do the traversal for you. Everything that's
open coding btree traversal now (with the exception of garbage
collection) is slowly going to be converted to these two functions;
being able to write other code at a higher level of abstraction is a
big improvement w.r.t. overall code quality.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
|