diff for duplicates of <20060126033415.GE11138@miraclelinux.com> diff --git a/a/1.txt b/N1/1.txt index 8b4b9ae..6ca50b7 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -8,7 +8,8 @@ This code largely copied from: include/asm-powerpc/bitops.h Index: 2.6-git/include/asm-generic/bitops.h -=================================--- 2.6-git.orig/include/asm-generic/bitops.h 2006-01-25 19:14:10.000000000 +0900 +=================================================================== +--- 2.6-git.orig/include/asm-generic/bitops.h 2006-01-25 19:14:10.000000000 +0900 +++ 2.6-git/include/asm-generic/bitops.h 2006-01-25 19:14:10.000000000 +0900 @@ -383,6 +383,41 @@ @@ -26,13 +27,13 @@ Index: 2.6-git/include/asm-generic/bitops.h + */ +static inline int sched_find_first_bit(const unsigned long *b) +{ -+#if BITS_PER_LONG = 64 ++#if BITS_PER_LONG == 64 + if (unlikely(b[0])) + return __ffs(b[0]); + if (unlikely(b[1])) + return __ffs(b[1]) + 64; + return __ffs(b[2]) + 128; -+#elif BITS_PER_LONG = 32 ++#elif BITS_PER_LONG == 32 + if (unlikely(b[0])) + return __ffs(b[0]); + if (unlikely(b[1])) diff --git a/a/content_digest b/N1/content_digest index 76064e0..8d78bfb 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -5,7 +5,7 @@ "ref\020060126032713.GA9984@miraclelinux.com\0" "From\0mita@miraclelinux.com (Akinobu Mita)\0" "Subject\0[PATCH 6/12] generic sched_find_first_bit()\0" - "Date\0Thu, 26 Jan 2006 03:34:15 +0000\0" + "Date\0Thu, 26 Jan 2006 12:34:15 +0900\0" "To\0Grant Grundler <iod00d@hp.com>\0" "Cc\0Linux Kernel Development <linux-kernel@vger.kernel.org>" " linux-ia64@vger.kernel.org\0" @@ -21,7 +21,8 @@ "include/asm-powerpc/bitops.h\n" "\n" "Index: 2.6-git/include/asm-generic/bitops.h\n" - "=================================--- 2.6-git.orig/include/asm-generic/bitops.h\t2006-01-25 19:14:10.000000000 +0900\n" + "===================================================================\n" + "--- 2.6-git.orig/include/asm-generic/bitops.h\t2006-01-25 19:14:10.000000000 +0900\n" "+++ 2.6-git/include/asm-generic/bitops.h\t2006-01-25 19:14:10.000000000 +0900\n" "@@ -383,6 +383,41 @@\n" " \n" @@ -39,13 +40,13 @@ "+ */\n" "+static inline int sched_find_first_bit(const unsigned long *b)\n" "+{\n" - "+#if BITS_PER_LONG = 64\n" + "+#if BITS_PER_LONG == 64\n" "+\tif (unlikely(b[0]))\n" "+\t\treturn __ffs(b[0]);\n" "+\tif (unlikely(b[1]))\n" "+\t\treturn __ffs(b[1]) + 64;\n" "+\treturn __ffs(b[2]) + 128;\n" - "+#elif BITS_PER_LONG = 32\n" + "+#elif BITS_PER_LONG == 32\n" "+\tif (unlikely(b[0]))\n" "+\t\treturn __ffs(b[0]);\n" "+\tif (unlikely(b[1]))\n" @@ -66,4 +67,4 @@ " * ffs: find first bit set. This is defined the same way as\n" * the libc and compiler builtin ffs routines, therefore -d27388fc5d0428c63a1ed20b92d27f89a583e28ca362b8f9550ad467453d3e5a +75aec8bee737dd0cec45778afedf83506c6f99fec2788a3306332e93b53e1608
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.