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-11-10 21:55:54 -08:00
2013-11-10 21:55:57 -08:00
2013-11-10 21:55:57 -08:00
2013-11-10 21:55:58 -08:00
2013-07-12 00:22:33 -07:00
2013-03-25 13:06:13 -06:00
2013-07-01 14:43:53 -07:00
2013-06-26 17:09:15 -07:00
2013-07-01 14:43:53 -07:00
2013-05-15 00:42:51 -07:00
2013-03-23 16:11:31 -07:00
2013-11-10 21:55:54 -08:00
2013-06-26 17:09:15 -07:00
2013-03-23 16:11:31 -07:00
2013-06-26 17:09:15 -07:00