| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Date: Sat, 24 Feb 2018 15:05:17 +0800
From: kbuild test robot <fengguang.wu@...el.com>
To: Arnd Bergmann <arnd@...db.de>
Cc: kbuild-all@...org, linux-kernel@...r.kernel.org,
Andrew Morton <akpm@...ux-foundation.org>,
Linux Memory Management List <linux-mm@...ck.org>
Subject: lib/find_bit.c:203:15: error: redefinition of 'find_next_zero_bit_le'
tree: https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git master
head: 9cb9c07d6b0c5fd97d83b8ab14d7e308ba4b612f
commit: 101110f6271ce956a049250c907bc960030577f8 Kbuild: always define endianess in kconfig.h
date: 2 days ago
config: m32r-allyesconfig (attached as .config)
compiler: m32r-linux-gcc (GCC) 7.2.0
reproduce:
wget https://raw.githubusercontent.com/intel/lkp-tests/master/sbin/make.cross -O ~/bin/make.cross
chmod +x ~/bin/make.cross
git checkout 101110f6271ce956a049250c907bc960030577f8
# save the attached .config to linux build tree
make.cross ARCH=m32r
All errors (new ones prefixed by >>):
In file included from arch/m32r/include/uapi/asm/byteorder.h:8:0,
from arch/m32r/include/asm/bitops.h:22,
from include/linux/bitops.h:38,
from lib/find_bit.c:19:
include/linux/byteorder/big_endian.h:8:2: warning: #warning inconsistent configuration, needs CONFIG_CPU_BIG_ENDIAN [-Wcpp]
#warning inconsistent configuration, needs CONFIG_CPU_BIG_ENDIAN
^~~~~~~
>> lib/find_bit.c:203:15: error: redefinition of 'find_next_zero_bit_le'
unsigned long find_next_zero_bit_le(const void *addr, unsigned
^~~~~~~~~~~~~~~~~~~~~
In file included from arch/m32r/include/asm/bitops.h:269:0,
from include/linux/bitops.h:38,
from lib/find_bit.c:19:
include/asm-generic/bitops/le.h:12:29: note: previous definition of 'find_next_zero_bit_le' was here
static inline unsigned long find_next_zero_bit_le(const void *addr,
^~~~~~~~~~~~~~~~~~~~~
>> lib/find_bit.c:212:15: error: redefinition of 'find_next_bit_le'
unsigned long find_next_bit_le(const void *addr, unsigned
^~~~~~~~~~~~~~~~
In file included from arch/m32r/include/asm/bitops.h:269:0,
from include/linux/bitops.h:38,
from lib/find_bit.c:19:
include/asm-generic/bitops/le.h:18:29: note: previous definition of 'find_next_bit_le' was here
static inline unsigned long find_next_bit_le(const void *addr,
^~~~~~~~~~~~~~~~
vim +/find_next_zero_bit_le +203 lib/find_bit.c
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 @19 #include <linux/bitops.h>
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 20 #include <linux/bitmap.h>
8bc3bcc9 lib/find_next_bit.c Paul Gortmaker 2011-11-16 21 #include <linux/export.h>
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 22 #include <linux/kernel.h>
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 23
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 24 #if !defined(find_next_bit) || !defined(find_next_zero_bit) || \
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 25 !defined(find_next_and_bit)
c7f612cd lib/find_next_bit.c Akinobu Mita 2006-03-26 26
64970b68 lib/find_next_bit.c Alexander van Heukelum 2008-03-11 27 /*
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 28 * This is a common helper function for find_next_bit, find_next_zero_bit, and
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 29 * find_next_and_bit. The differences are:
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 30 * - The "invert" argument, which is XORed with each fetched word before
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 31 * searching it for one bits.
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 32 * - The optional "addr2", which is anded with "addr1" if present.
c7f612cd lib/find_next_bit.c Akinobu Mita 2006-03-26 33 */
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 34 static inline unsigned long _find_next_bit(const unsigned long *addr1,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 35 const unsigned long *addr2, unsigned long nbits,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 36 unsigned long start, unsigned long invert)
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 37 {
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 38 unsigned long tmp;
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 39
e4afd2e5 lib/find_bit.c Matthew Wilcox 2017-02-24 40 if (unlikely(start >= nbits))
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 41 return nbits;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 42
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 43 tmp = addr1[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 44 if (addr2)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 45 tmp &= addr2[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 46 tmp ^= invert;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 47
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 48 /* Handle 1st word. */
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 49 tmp &= BITMAP_FIRST_WORD_MASK(start);
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 50 start = round_down(start, BITS_PER_LONG);
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 51
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 52 while (!tmp) {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 53 start += BITS_PER_LONG;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 54 if (start >= nbits)
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 55 return nbits;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 56
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 57 tmp = addr1[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 58 if (addr2)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 59 tmp &= addr2[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 60 tmp ^= invert;
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 61 }
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 62
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 63 return min(start + __ffs(tmp), nbits);
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 64 }
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 65 #endif
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 66
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 67 #ifndef find_next_bit
c7f612cd lib/find_next_bit.c Akinobu Mita 2006-03-26 68 /*
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 69 * Find the next set bit in a memory region.
c7f612cd lib/find_next_bit.c Akinobu Mita 2006-03-26 70 */
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 71 unsigned long find_next_bit(const unsigned long *addr, unsigned long size,
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 72 unsigned long offset)
c7f612cd lib/find_next_bit.c Akinobu Mita 2006-03-26 73 {
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 74 return _find_next_bit(addr, NULL, size, offset, 0UL);
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 75 }
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 76 EXPORT_SYMBOL(find_next_bit);
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 77 #endif
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 78
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 79 #ifndef find_next_zero_bit
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 80 unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 81 unsigned long offset)
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 82 {
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 83 return _find_next_bit(addr, NULL, size, offset, ~0UL);
^1da177e lib/find_next_bit.c Linus Torvalds 2005-04-16 84 }
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 85 EXPORT_SYMBOL(find_next_zero_bit);
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 86 #endif
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 87
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 88 #if !defined(find_next_and_bit)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 89 unsigned long find_next_and_bit(const unsigned long *addr1,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 90 const unsigned long *addr2, unsigned long size,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 91 unsigned long offset)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 92 {
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 93 return _find_next_bit(addr1, addr2, size, offset, 0UL);
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 94 }
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 95 EXPORT_SYMBOL(find_next_and_bit);
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 96 #endif
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 97
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 98 #ifndef find_first_bit
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 99 /*
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 100 * Find the first set bit in a memory region.
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 101 */
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 102 unsigned long find_first_bit(const unsigned long *addr, unsigned long size)
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 103 {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 104 unsigned long idx;
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 105
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 106 for (idx = 0; idx * BITS_PER_LONG < size; idx++) {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 107 if (addr[idx])
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 108 return min(idx * BITS_PER_LONG + __ffs(addr[idx]), size);
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 109 }
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 110
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 111 return size;
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 112 }
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 113 EXPORT_SYMBOL(find_first_bit);
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 114 #endif
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 115
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 116 #ifndef find_first_zero_bit
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 117 /*
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 118 * Find the first cleared bit in a memory region.
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 119 */
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 120 unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size)
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 121 {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 122 unsigned long idx;
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 123
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 124 for (idx = 0; idx * BITS_PER_LONG < size; idx++) {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 125 if (addr[idx] != ~0UL)
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 126 return min(idx * BITS_PER_LONG + ffz(addr[idx]), size);
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 127 }
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 128
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 129 return size;
77b9bd9c lib/find_next_bit.c Alexander van Heukelum 2008-04-01 130 }
fee4b19f lib/find_next_bit.c Thomas Gleixner 2008-04-29 131 EXPORT_SYMBOL(find_first_zero_bit);
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 132 #endif
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 133
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 134 #ifndef find_last_bit
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 135 unsigned long find_last_bit(const unsigned long *addr, unsigned long size)
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 136 {
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 137 if (size) {
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 138 unsigned long val = BITMAP_LAST_WORD_MASK(size);
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 139 unsigned long idx = (size-1) / BITS_PER_LONG;
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 140
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 141 do {
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 142 val &= addr[idx];
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 143 if (val)
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 144 return idx * BITS_PER_LONG + __fls(val);
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 145
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 146 val = ~0ul;
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 147 } while (idx--);
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 148 }
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 149 return size;
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 150 }
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 151 EXPORT_SYMBOL(find_last_bit);
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 152 #endif
8f6f19dd lib/find_next_bit.c Yury Norov 2015-04-16 153
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 154 #ifdef __BIG_ENDIAN
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 155
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 156 /* include/linux/byteorder does not support "unsigned long" type */
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 157 static inline unsigned long ext2_swab(const unsigned long y)
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 158 {
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 159 #if BITS_PER_LONG == 64
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 160 return (unsigned long) __swab64((u64) y);
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 161 #elif BITS_PER_LONG == 32
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 162 return (unsigned long) __swab32((u32) y);
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 163 #else
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 164 #error BITS_PER_LONG not defined
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 165 #endif
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 166 }
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 167
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 168 #if !defined(find_next_bit_le) || !defined(find_next_zero_bit_le)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 169 static inline unsigned long _find_next_bit_le(const unsigned long *addr1,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 170 const unsigned long *addr2, unsigned long nbits,
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 171 unsigned long start, unsigned long invert)
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 172 {
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 173 unsigned long tmp;
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 174
e4afd2e5 lib/find_bit.c Matthew Wilcox 2017-02-24 175 if (unlikely(start >= nbits))
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 176 return nbits;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 177
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 178 tmp = addr1[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 179 if (addr2)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 180 tmp &= addr2[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 181 tmp ^= invert;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 182
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 183 /* Handle 1st word. */
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 184 tmp &= ext2_swab(BITMAP_FIRST_WORD_MASK(start));
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 185 start = round_down(start, BITS_PER_LONG);
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 186
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 187 while (!tmp) {
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 188 start += BITS_PER_LONG;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 189 if (start >= nbits)
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 190 return nbits;
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 191
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 192 tmp = addr1[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 193 if (addr2)
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 194 tmp &= addr2[start / BITS_PER_LONG];
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 195 tmp ^= invert;
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 196 }
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 197
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 198 return min(start + __ffs(ext2_swab(tmp)), nbits);
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 199 }
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 200 #endif
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 201
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 202 #ifndef find_next_zero_bit_le
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 @203 unsigned long find_next_zero_bit_le(const void *addr, unsigned
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 204 long size, unsigned long offset)
2c57a0e2 lib/find_next_bit.c Yury Norov 2015-04-16 205 {
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 206 return _find_next_bit_le(addr, NULL, size, offset, ~0UL);
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 207 }
c4945b9e lib/find_next_bit.c Akinobu Mita 2011-03-23 208 EXPORT_SYMBOL(find_next_zero_bit_le);
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 209 #endif
930ae745 lib/find_next_bit.c Akinobu Mita 2006-03-26 210
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 211 #ifndef find_next_bit_le
a56560b3 lib/find_next_bit.c Akinobu Mita 2011-03-23 @212 unsigned long find_next_bit_le(const void *addr, unsigned
aa02ad67 lib/find_next_bit.c Aneesh Kumar K.V 2008-01-28 213 long size, unsigned long offset)
aa02ad67 lib/find_next_bit.c Aneesh Kumar K.V 2008-01-28 214 {
0ade34c3 lib/find_bit.c Clement Courbet 2018-02-06 215 return _find_next_bit_le(addr, NULL, size, offset, 0UL);
aa02ad67 lib/find_next_bit.c Aneesh Kumar K.V 2008-01-28 216 }
c4945b9e lib/find_next_bit.c Akinobu Mita 2011-03-23 217 EXPORT_SYMBOL(find_next_bit_le);
19de85ef lib/find_next_bit.c Akinobu Mita 2011-05-26 218 #endif
0664996b lib/find_next_bit.c Akinobu Mita 2011-03-23 219
:::::: The code at line 203 was first introduced by commit
:::::: 2c57a0e233d72f8c2e2404560dcf0188ac3cf5d7 lib: find_*_bit reimplementation
:::::: TO: Yury Norov <yury.norov@...il.com>
:::::: CC: Linus Torvalds <torvalds@...ux-foundation.org>
---
0-DAY kernel test infrastructure Open Source Technology Center
https://lists.01.org/pipermail/kbuild-all Intel Corporation
Download attachment ".config.gz" of type "application/gzip" (45103 bytes)
Powered by blists - more mailing lists