Commit message (Expand) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/jik... | Linus Torvalds | 2013-11-15 | 1 | -1/+1 |
|\ | |||||
| * | treewide: fix "distingush" typo | Michael Opdenacker | 2013-10-14 | 1 | -1/+1 |
* | | Merge branch 'for-linus' of git://git.kernel.dk/linux-block | Linus Torvalds | 2013-11-15 | 25 | -3005/+2587 |
|\ \ | |||||
| * | | bcache: defensively handle format strings | Kees Cook | 2013-11-10 | 1 | -1/+1 |
| * | | bcache: Bypass torture test | Kent Overstreet | 2013-11-10 | 5 | -8/+28 |
| * | | bcache: Delete some slower inline asm | Kent Overstreet | 2013-11-10 | 1 | -8/+0 |
| * | | bcache: Use ida for bcache block dev minor | Kent Overstreet | 2013-11-10 | 1 | -6/+20 |
| * | | bcache: Fix sysfs splat on shutdown with flash only devs | Kent Overstreet | 2013-11-10 | 6 | -33/+30 |
| * | | bcache: Better full stripe scanning | Kent Overstreet | 2013-11-10 | 5 | -57/+99 |
| * | | bcache: Have btree_split() insert into parent directly | Kent Overstreet | 2013-11-10 | 1 | -46/+39 |
| * | | bcache: Move spinlock into struct time_stats | Kent Overstreet | 2013-11-10 | 6 | -16/+17 |
| * | | bcache: Kill sequential_merge option | Kent Overstreet | 2013-11-10 | 4 | -31/+18 |
| * | | bcache: Kill bch_next_recurse_key() | Kent Overstreet | 2013-11-10 | 3 | -21/+11 |
| * | | bcache: Avoid deadlocking in garbage collection | Kent Overstreet | 2013-11-10 | 3 | -12/+13 |
| * | | bcache: Incremental gc | Kent Overstreet | 2013-11-10 | 4 | -167/+226 |
| * | | bcache: Add make_btree_freeing_key() | Kent Overstreet | 2013-11-10 | 1 | -13/+18 |
| * | | bcache: Add btree_node_write_sync() | Kent Overstreet | 2013-11-10 | 1 | -19/+16 |
| * | | bcache: PRECEDING_KEY() | Kent Overstreet | 2013-11-10 | 2 | -7/+20 |
| * | | bcache: bch_(btree|extent)_ptr_invalid() | Kent Overstreet | 2013-11-10 | 4 | -21/+49 |
| * | | bcache: Don't bother with bucket refcount for btree node allocations | Kent Overstreet | 2013-11-10 | 4 | -27/+9 |
| * | | bcache: Debug code improvements | Kent Overstreet | 2013-11-10 | 11 | -186/+162 |
| * | | bcache: Fix bch_ptr_bad() | Kent Overstreet | 2013-11-10 | 1 | -34/+33 |
| * | | bcache: Pull on disk data structures out into a separate header | Kent Overstreet | 2013-11-10 | 9 | -340/+14 |
| * | | bcache: Move sector allocator to alloc.c | Kent Overstreet | 2013-11-10 | 4 | -186/+189 |
| * | | bcache: Break up struct search | Kent Overstreet | 2013-11-10 | 8 | -385/+370 |
| * | | bcache: Convert bch_btree_insert() to bch_btree_map_leaf_nodes() | Kent Overstreet | 2013-11-10 | 5 | -52/+43 |
| * | | bcache: Don't use op->insert_collision | Kent Overstreet | 2013-11-10 | 5 | -7/+16 |
| * | | bcache: Kill op->replace | Kent Overstreet | 2013-11-10 | 7 | -73/+71 |
| * | | bcache: Drop some closure stuff | Kent Overstreet | 2013-11-10 | 3 | -250/+40 |
| * | | bcache: Kill op->cl | Kent Overstreet | 2013-11-10 | 8 | -81/+63 |
| * | | bcache: Prune struct btree_op | Kent Overstreet | 2013-11-10 | 11 | -171/+179 |
| * | | bcache: Clean up cache_lookup_fn | Kent Overstreet | 2013-11-10 | 1 | -62/+46 |
| * | | bcache: Convert bch_btree_read_async() to bch_btree_map_keys() | Kent Overstreet | 2013-11-10 | 5 | -168/+125 |
| * | | bcache: Move some stuff to btree.c | Kent Overstreet | 2013-11-10 | 3 | -97/+96 |
| * | | bcache: Add btree_map() functions | Kent Overstreet | 2013-11-10 | 5 | -97/+186 |
| * | | bcache: Convert writeback to a kthread | Kent Overstreet | 2013-11-10 | 4 | -206/+203 |
| * | | bcache: Convert gc to a kthread | Kent Overstreet | 2013-11-10 | 8 | -60/+74 |
| * | | bcache: Convert bucket_wait to wait_queue_head_t | Kent Overstreet | 2013-11-10 | 6 | -67/+70 |
| * | | bcache: Convert try_wait to wait_queue_head_t | Kent Overstreet | 2013-11-10 | 4 | -99/+75 |
| * | | bcache: Move keylist out of btree_op | Kent Overstreet | 2013-11-10 | 6 | -28/+36 |
| * | | bcache: Refactor journalling flow control | Kent Overstreet | 2013-11-10 | 7 | -179/+207 |
| * | | bcache: Refactor read request code a bit | Kent Overstreet | 2013-11-10 | 1 | -36/+35 |
| * | | bcache: Refactor request_write() | Kent Overstreet | 2013-11-10 | 2 | -187/+183 |
| * | | bcache: Clean up keylist code | Kent Overstreet | 2013-11-10 | 5 | -52/+57 |
| * | | bcache: Add explicit keylist arg to btree_insert() | Kent Overstreet | 2013-11-10 | 5 | -16/+18 |
| * | | bcache: Convert btree_insert_check_key() to btree_insert_node() | Kent Overstreet | 2013-11-10 | 4 | -72/+79 |
| * | | bcache: Insert multiple keys at a time | Kent Overstreet | 2013-11-10 | 1 | -17/+16 |
| * | | bcache: Add btree_insert_node() | Kent Overstreet | 2013-11-10 | 3 | -66/+105 |
| * | | bcache: Explicitly track btree node's parent | Kent Overstreet | 2013-11-10 | 2 | -10/+20 |
| * | | bcache: Remove unnecessary check in should_split() | Kent Overstreet | 2013-11-10 | 1 | -3/+2 |