Files
linux/drivers
Kent Overstreet 403b6cdeb1 bcache: Insert multiple keys at a time
We'll often end up with a list of adjacent keys to insert -
because bch_data_insert() may have to fragment the data it writes.

Originally, to simplify things and avoid having to deal with corner
cases bch_btree_insert() would pass keys from this list one at a time to
btree_insert_recurse() - mainly because the list of keys might span leaf
nodes, so it was easier this way.

With the btree_insert_node() refactoring, it's now a lot easier to just
pass down the whole list and have btree_insert_recurse() iterate over
leaf nodes until it's done.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
2013-11-10 21:55:58 -08:00
..
2013-08-12 15:45:40 -07:00
2013-10-31 15:28:23 -07:00
2013-10-21 13:39:37 +02:00
2013-11-10 21:55:58 -08:00
2013-09-13 15:09:52 +02:00
2013-10-25 10:09:43 -07:00
2013-09-13 15:09:52 +02:00
2013-08-01 15:49:33 -04:00
2013-08-19 17:08:16 -07:00