#include <linux/module.h>
#include <linux/uaccess.h>
+#include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/bug.h>
}
EXPORT_SYMBOL(copy_from_user_overflow);
-#define REPEAT_BYTE(x) ((~0ul / 0xff) * (x))
-
static inline long find_zero(unsigned long mask)
{
long byte = 0;
#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
#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)
{
#include <linux/init.h>
#include <linux/export.h>
+#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/fs.h>
#include <linux/namei.h>
#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)))