diff options
| author | David S. Miller <davem@davemloft.net> | 2012-05-24 07:12:50 +0400 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2012-05-25 00:10:05 +0400 |
| commit | 446969084d33a4064a39d280806da642c54ba4ac (patch) | |
| tree | 0887795d96007b228733c9499bda1731d64e48fe /arch/x86 | |
| parent | 35c9646062eba15351c6d64ea0c02176e5cb66ac (diff) | |
| download | linux-446969084d33a4064a39d280806da642c54ba4ac.tar.xz | |
kernel: Move REPEAT_BYTE definition into linux/kernel.h
And make sure that everything using it explicitly includes
that header file.
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'arch/x86')
| -rw-r--r-- | arch/x86/include/asm/word-at-a-time.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/arch/x86/include/asm/word-at-a-time.h b/arch/x86/include/asm/word-at-a-time.h index e58f03b206c3..ae03facfadd6 100644 --- a/arch/x86/include/asm/word-at-a-time.h +++ b/arch/x86/include/asm/word-at-a-time.h @@ -1,6 +1,8 @@ #ifndef _ASM_WORD_AT_A_TIME_H #define _ASM_WORD_AT_A_TIME_H +#include <linux/kernel.h> + /* * This is largely generic for little-endian machines, but the * optimal byte mask counting is probably going to be something @@ -35,8 +37,6 @@ static inline long count_masked_bytes(long mask) #endif -#define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) - /* Return the high bit set in the first byte that is a zero */ static inline unsigned long has_zero(unsigned long a) { |