X-Git-Url: http://git.monstr.eu/?a=blobdiff_plain;f=lib%2Flist_sort.c;h=52f0c258c895a0fb62ef1384774a38036648e848;hb=11fb479ff5d9872ddff02dd533c16d60372c86b2;hp=712ed1f4eb645e29344a339529398394b15fc2e5;hpb=c39f2d9db0fd81ea20bb5cce9b3f082ca63753e2;p=linux-2.6-microblaze.git

diff --git a/lib/list_sort.c b/lib/list_sort.c
index 712ed1f4eb64..52f0c258c895 100644
--- a/lib/list_sort.c
+++ b/lib/list_sort.c
@@ -157,9 +157,11 @@ static void merge_final(void *priv, cmp_func cmp, struct list_head *head,
  *
  * The number of pending lists of size 2^k is determined by the
  * state of bit k of "count" plus two extra pieces of information:
+ *
  * - The state of bit k-1 (when k == 0, consider bit -1 always set), and
  * - Whether the higher-order bits are zero or non-zero (i.e.
  *   is count >= 2^(k+1)).
+ *
  * There are six states we distinguish.  "x" represents some arbitrary
  * bits, and "y" represents some arbitrary non-zero bits:
  * 0:  00x: 0 pending of size 2^k;           x pending of sizes < 2^k