litmus-rt.git - The LITMUS^RT kernel.

	Commit message (Expand)	Author	Age
*	Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/jik...	Linus Torvalds	2013-11-15
\|\
\| *	treewide: fix "distingush" typo	Michael Opdenacker	2013-10-14
* \|	Merge branch 'for-linus' of git://git.kernel.dk/linux-block	Linus Torvalds	2013-11-15
\|\ \
\| * \|	bcache: defensively handle format strings	Kees Cook	2013-11-11
\| * \|	bcache: Bypass torture test	Kent Overstreet	2013-11-11
\| * \|	bcache: Delete some slower inline asm	Kent Overstreet	2013-11-11
\| * \|	bcache: Use ida for bcache block dev minor	Kent Overstreet	2013-11-11
\| * \|	bcache: Fix sysfs splat on shutdown with flash only devs	Kent Overstreet	2013-11-11
\| * \|	bcache: Better full stripe scanning	Kent Overstreet	2013-11-11
\| * \|	bcache: Have btree_split() insert into parent directly	Kent Overstreet	2013-11-11
\| * \|	bcache: Move spinlock into struct time_stats	Kent Overstreet	2013-11-11
\| * \|	bcache: Kill sequential_merge option	Kent Overstreet	2013-11-11
\| * \|	bcache: Kill bch_next_recurse_key()	Kent Overstreet	2013-11-11
\| * \|	bcache: Avoid deadlocking in garbage collection	Kent Overstreet	2013-11-11
\| * \|	bcache: Incremental gc	Kent Overstreet	2013-11-11
\| * \|	bcache: Add make_btree_freeing_key()	Kent Overstreet	2013-11-11
\| * \|	bcache: Add btree_node_write_sync()	Kent Overstreet	2013-11-11
\| * \|	bcache: PRECEDING_KEY()	Kent Overstreet	2013-11-11
\| * \|	bcache: bch_(btree\|extent)_ptr_invalid()	Kent Overstreet	2013-11-11
\| * \|	bcache: Don't bother with bucket refcount for btree node allocations	Kent Overstreet	2013-11-11
\| * \|	bcache: Debug code improvements	Kent Overstreet	2013-11-11
\| * \|	bcache: Fix bch_ptr_bad()	Kent Overstreet	2013-11-11
\| * \|	bcache: Pull on disk data structures out into a separate header	Kent Overstreet	2013-11-11
\| * \|	bcache: Move sector allocator to alloc.c	Kent Overstreet	2013-11-11
\| * \|	bcache: Break up struct search	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert bch_btree_insert() to bch_btree_map_leaf_nodes()	Kent Overstreet	2013-11-11
\| * \|	bcache: Don't use op->insert_collision	Kent Overstreet	2013-11-11
\| * \|	bcache: Kill op->replace	Kent Overstreet	2013-11-11
\| * \|	bcache: Drop some closure stuff	Kent Overstreet	2013-11-11
\| * \|	bcache: Kill op->cl	Kent Overstreet	2013-11-11
\| * \|	bcache: Prune struct btree_op	Kent Overstreet	2013-11-11
\| * \|	bcache: Clean up cache_lookup_fn	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert bch_btree_read_async() to bch_btree_map_keys()	Kent Overstreet	2013-11-11
\| * \|	bcache: Move some stuff to btree.c	Kent Overstreet	2013-11-11
\| * \|	bcache: Add btree_map() functions	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert writeback to a kthread	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert gc to a kthread	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert bucket_wait to wait_queue_head_t	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert try_wait to wait_queue_head_t	Kent Overstreet	2013-11-11
\| * \|	bcache: Move keylist out of btree_op	Kent Overstreet	2013-11-11
\| * \|	bcache: Refactor journalling flow control	Kent Overstreet	2013-11-11
\| * \|	bcache: Refactor read request code a bit	Kent Overstreet	2013-11-11
\| * \|	bcache: Refactor request_write()	Kent Overstreet	2013-11-11
\| * \|	bcache: Clean up keylist code	Kent Overstreet	2013-11-11
\| * \|	bcache: Add explicit keylist arg to btree_insert()	Kent Overstreet	2013-11-11
\| * \|	bcache: Convert btree_insert_check_key() to btree_insert_node()	Kent Overstreet	2013-11-11
\| * \|	bcache: Insert multiple keys at a time	Kent Overstreet	2013-11-11
\| * \|	bcache: Add btree_insert_node()	Kent Overstreet	2013-11-11
\| * \|	bcache: Explicitly track btree node's parent	Kent Overstreet	2013-11-11
\| * \|	bcache: Remove unnecessary check in should_split()	Kent Overstreet	2013-11-11