Merge branch 'next' (accumulated 3.16 merge window patches) into master

Now that 3.15 is released, this merges the 'next' branch into 'master',
bringing us to the normal situation where my 'master' branch is the
merge window.

* accumulated work in next: (6809 commits)
  ufs: sb mutex merge + mutex_destroy
  powerpc: update comments for generic idle conversion
  cris: update comments for generic idle conversion
  idle: remove cpu_idle() forward declarations
  nbd: zero from and len fields in NBD_CMD_DISCONNECT.
  mm: convert some level-less printks to pr_*
  MAINTAINERS: adi-buildroot-devel is moderated
  MAINTAINERS: add linux-api for review of API/ABI changes
  mm/kmemleak-test.c: use pr_fmt for logging
  fs/dlm/debug_fs.c: replace seq_printf by seq_puts
  fs/dlm/lockspace.c: convert simple_str to kstr
  fs/dlm/config.c: convert simple_str to kstr
  mm: mark remap_file_pages() syscall as deprecated
  mm: memcontrol: remove unnecessary memcg argument from soft limit functions
  mm: memcontrol: clean up memcg zoneinfo lookup
  mm/memblock.c: call kmemleak directly from memblock_(alloc|free)
  mm/mempool.c: update the kmemleak stack trace for mempool allocations
  lib/radix-tree.c: update the kmemleak stack trace for radix tree allocations
  mm: introduce kmemleak_update_trace()
  mm/kmemleak.c: use %u to print ->checksum
  ...

1 files changed, 54 insertions, 2 deletions

diff --git a/lib/plist.c b/lib/plist.c
index 1ebc95f7a46f..d408e774b746 100644
--- a/lib/plist.c
+++ b/lib/plist.c
@@ -134,6 +134,46 @@ void plist_del(struct plist_node *node, struct plist_head *head)
         plist_check_head(head);
 }
 
+/**
+ * plist_requeue - Requeue @node at end of same-prio entries.
+ *
+ * This is essentially an optimized plist_del() followed by
+ * plist_add().  It moves an entry already in the plist to
+ * after any other same-priority entries.
+ *
+ * @node:       &struct plist_node pointer - entry to be moved
+ * @head:       &struct plist_head pointer - list head
+ */
+void plist_requeue(struct plist_node *node, struct plist_head *head)
+{
+        struct plist_node *iter;
+        struct list_head *node_next = &head->node_list;
+
+        plist_check_head(head);
+        BUG_ON(plist_head_empty(head));
+        BUG_ON(plist_node_empty(node));
+
+        if (node == plist_last(head))
+                return;
+
+        iter = plist_next(node);
+
+        if (node->prio != iter->prio)
+                return;
+
+        plist_del(node, head);
+
+        plist_for_each_continue(iter, head) {
+                if (node->prio != iter->prio) {
+                        node_next = &iter->node_list;
+                        break;
+                }
+        }
+        list_add_tail(&node->node_list, node_next);
+
+        plist_check_head(head);
+}
+
 #ifdef CONFIG_DEBUG_PI_LIST
 #include <linux/sched.h>
 #include <linux/module.h>
@@ -170,12 +210,20 @@ static void __init plist_test_check(int nr_expect)
         BUG_ON(prio_pos->prio_list.next != &first->prio_list);
 }
 
+static void __init plist_test_requeue(struct plist_node *node)
+{
+        plist_requeue(node, &test_head);
+
+        if (node != plist_last(&test_head))
+                BUG_ON(node->prio == plist_next(node)->prio);
+}
+
 static int  __init plist_test(void)
 {
         int nr_expect = 0, i, loop;
         unsigned int r = local_clock();
 
-        pr_debug("start plist test\n");
+        printk(KERN_DEBUG "start plist test\n");
         plist_head_init(&test_head);
         for (i = 0; i < ARRAY_SIZE(test_node); i++)
                 plist_node_init(test_node + i, 0);
@@ -193,6 +241,10 @@ static int  __init plist_test(void)
                         nr_expect--;
                 }
                 plist_test_check(nr_expect);
+                if (!plist_node_empty(test_node + i)) {
+                        plist_test_requeue(test_node + i);
+                        plist_test_check(nr_expect);
+                }
         }
 
         for (i = 0; i < ARRAY_SIZE(test_node); i++) {
@@ -203,7 +255,7 @@ static int  __init plist_test(void)
                 plist_test_check(nr_expect);
         }
 
-        pr_debug("end plist test\n");
+        printk(KERN_DEBUG "end plist test\n");
         return 0;
 }