Loading arch/sparc/lib/usercopy.c +1 −2 Original line number Diff line number Diff line #include <linux/module.h> #include <linux/uaccess.h> #include <linux/kernel.h> #include <linux/errno.h> #include <linux/bug.h> Loading @@ -11,8 +12,6 @@ void copy_from_user_overflow(void) } EXPORT_SYMBOL(copy_from_user_overflow); #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) static inline long find_zero(unsigned long mask) { long byte = 0; Loading arch/x86/include/asm/word-at-a-time.h +2 −2 Original line number Diff line number Diff line #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 Loading Loading @@ -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) { Loading fs/namei.c +1 −0 Original line number Diff line number Diff line Loading @@ -16,6 +16,7 @@ #include <linux/init.h> #include <linux/export.h> #include <linux/kernel.h> #include <linux/slab.h> #include <linux/fs.h> #include <linux/namei.h> Loading include/linux/kernel.h +2 −0 Original line number Diff line number Diff line Loading @@ -38,6 +38,8 @@ #define STACK_MAGIC 0xdeadbeef #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) #define ALIGN(x, a) __ALIGN_KERNEL((x), (a)) #define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask)) #define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a))) Loading Loading
arch/sparc/lib/usercopy.c +1 −2 Original line number Diff line number Diff line #include <linux/module.h> #include <linux/uaccess.h> #include <linux/kernel.h> #include <linux/errno.h> #include <linux/bug.h> Loading @@ -11,8 +12,6 @@ void copy_from_user_overflow(void) } EXPORT_SYMBOL(copy_from_user_overflow); #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) static inline long find_zero(unsigned long mask) { long byte = 0; Loading
arch/x86/include/asm/word-at-a-time.h +2 −2 Original line number Diff line number Diff line #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 Loading Loading @@ -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) { Loading
fs/namei.c +1 −0 Original line number Diff line number Diff line Loading @@ -16,6 +16,7 @@ #include <linux/init.h> #include <linux/export.h> #include <linux/kernel.h> #include <linux/slab.h> #include <linux/fs.h> #include <linux/namei.h> Loading
include/linux/kernel.h +2 −0 Original line number Diff line number Diff line Loading @@ -38,6 +38,8 @@ #define STACK_MAGIC 0xdeadbeef #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) #define ALIGN(x, a) __ALIGN_KERNEL((x), (a)) #define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask)) #define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a))) Loading