linux - Linux Kernel (branches are rebased on master from time to time)

Age	Commit message (Expand)	Author	Files	Lines
2013-11-23	block: Introduce new bio_split()	Kent Overstreet	3	-87/+8
2013-11-23	block: Generic bio chaining	Kent Overstreet	1	-1/+1
2013-11-23	block: Remove bi_idx hacks	Kent Overstreet	1	-45/+2
2013-11-23	block: Add bio_clone_fast()	Kent Overstreet	1	-6/+2
2013-11-23	block: Kill bio_segments()/bi_vcnt usage	Kent Overstreet	1	-30/+23
2013-11-23	block: Convert bio_for_each_segment() to bvec_iter	Kent Overstreet	4	-64/+54
2013-11-23	block: Convert bio_iovec() to bvec_iter	Kent Overstreet	1	-6/+7
2013-11-23	block: Abstract out bvec iterator	Kent Overstreet	10	-67/+67
2013-11-23	bcache: Kill unaligned bvec hack	Kent Overstreet	3	-35/+7
2013-11-10	bcache: defensively handle format strings	Kees Cook	1	-1/+1
2013-11-10	bcache: Bypass torture test	Kent Overstreet	5	-8/+28
2013-11-10	bcache: Delete some slower inline asm	Kent Overstreet	1	-8/+0
2013-11-10	bcache: Use ida for bcache block dev minor	Kent Overstreet	1	-6/+20
2013-11-10	bcache: Fix sysfs splat on shutdown with flash only devs	Kent Overstreet	6	-33/+30
2013-11-10	bcache: Better full stripe scanning	Kent Overstreet	5	-57/+99
2013-11-10	bcache: Have btree_split() insert into parent directly	Kent Overstreet	1	-46/+39
2013-11-10	bcache: Move spinlock into struct time_stats	Kent Overstreet	6	-16/+17
2013-11-10	bcache: Kill sequential_merge option	Kent Overstreet	4	-31/+18
2013-11-10	bcache: Kill bch_next_recurse_key()	Kent Overstreet	3	-21/+11
2013-11-10	bcache: Avoid deadlocking in garbage collection	Kent Overstreet	3	-12/+13
2013-11-10	bcache: Incremental gc	Kent Overstreet	4	-167/+226
2013-11-10	bcache: Add make_btree_freeing_key()	Kent Overstreet	1	-13/+18
2013-11-10	bcache: Add btree_node_write_sync()	Kent Overstreet	1	-19/+16
2013-11-10	bcache: PRECEDING_KEY()	Kent Overstreet	2	-7/+20
2013-11-10	bcache: bch_(btree\|extent)_ptr_invalid()	Kent Overstreet	4	-21/+49
2013-11-10	bcache: Don't bother with bucket refcount for btree node allocations	Kent Overstreet	4	-27/+9
2013-11-10	bcache: Debug code improvements	Kent Overstreet	11	-186/+162
2013-11-10	bcache: Fix bch_ptr_bad()	Kent Overstreet	1	-34/+33
2013-11-10	bcache: Pull on disk data structures out into a separate header	Kent Overstreet	9	-340/+14
2013-11-10	bcache: Move sector allocator to alloc.c	Kent Overstreet	4	-186/+189
2013-11-10	bcache: Break up struct search	Kent Overstreet	8	-385/+370
2013-11-10	bcache: Convert bch_btree_insert() to bch_btree_map_leaf_nodes()	Kent Overstreet	5	-52/+43
2013-11-10	bcache: Don't use op->insert_collision	Kent Overstreet	5	-7/+16
2013-11-10	bcache: Kill op->replace	Kent Overstreet	7	-73/+71
2013-11-10	bcache: Drop some closure stuff	Kent Overstreet	3	-250/+40
2013-11-10	bcache: Kill op->cl	Kent Overstreet	8	-81/+63
2013-11-10	bcache: Prune struct btree_op	Kent Overstreet	11	-171/+179
2013-11-10	bcache: Clean up cache_lookup_fn	Kent Overstreet	1	-62/+46
2013-11-10	bcache: Convert bch_btree_read_async() to bch_btree_map_keys()	Kent Overstreet	5	-168/+125
2013-11-10	bcache: Move some stuff to btree.c	Kent Overstreet	3	-97/+96
2013-11-10	bcache: Add btree_map() functions	Kent Overstreet	5	-97/+186
2013-11-10	bcache: Convert writeback to a kthread	Kent Overstreet	4	-206/+203
2013-11-10	bcache: Convert gc to a kthread	Kent Overstreet	8	-60/+74
2013-11-10	bcache: Convert bucket_wait to wait_queue_head_t	Kent Overstreet	6	-67/+70
2013-11-10	bcache: Convert try_wait to wait_queue_head_t	Kent Overstreet	4	-99/+75
2013-11-10	bcache: Move keylist out of btree_op	Kent Overstreet	6	-28/+36
2013-11-10	bcache: Refactor journalling flow control	Kent Overstreet	7	-179/+207
2013-11-10	bcache: Refactor read request code a bit	Kent Overstreet	1	-36/+35
2013-11-10	bcache: Refactor request_write()	Kent Overstreet	2	-187/+183
2013-11-10	bcache: Clean up keylist code	Kent Overstreet	5	-52/+57