Merge branch 'master' into for-upstream
Conflicts: Documentation/ABI/testing/sysfs-bus-usb drivers/Makefile
This commit is contained in:
@@ -8,10 +8,10 @@ config BITREVERSE
|
||||
tristate
|
||||
|
||||
config GENERIC_FIND_FIRST_BIT
|
||||
def_bool n
|
||||
bool
|
||||
|
||||
config GENERIC_FIND_NEXT_BIT
|
||||
def_bool n
|
||||
bool
|
||||
|
||||
config CRC_CCITT
|
||||
tristate "CRC-CCITT functions"
|
||||
|
@@ -495,6 +495,15 @@ config DEBUG_VM
|
||||
|
||||
If unsure, say N.
|
||||
|
||||
config DEBUG_VIRTUAL
|
||||
bool "Debug VM translations"
|
||||
depends on DEBUG_KERNEL && X86
|
||||
help
|
||||
Enable some costly sanity checks in virtual to page code. This can
|
||||
catch mistakes with virt_to_page() and friends.
|
||||
|
||||
If unsure, say N.
|
||||
|
||||
config DEBUG_WRITECOUNT
|
||||
bool "Debug filesystem writers count"
|
||||
depends on DEBUG_KERNEL
|
||||
@@ -597,6 +606,19 @@ config RCU_TORTURE_TEST_RUNNABLE
|
||||
Say N here if you want the RCU torture tests to start only
|
||||
after being manually enabled via /proc.
|
||||
|
||||
config RCU_CPU_STALL_DETECTOR
|
||||
bool "Check for stalled CPUs delaying RCU grace periods"
|
||||
depends on CLASSIC_RCU
|
||||
default n
|
||||
help
|
||||
This option causes RCU to printk information on which
|
||||
CPUs are delaying the current grace period, but only when
|
||||
the grace period extends for excessive time periods.
|
||||
|
||||
Say Y if you want RCU to perform such checks.
|
||||
|
||||
Say N if you are unsure.
|
||||
|
||||
config KPROBES_SANITY_TEST
|
||||
bool "Kprobes sanity tests"
|
||||
depends on DEBUG_KERNEL
|
||||
@@ -624,6 +646,33 @@ config BACKTRACE_SELF_TEST
|
||||
|
||||
Say N if you are unsure.
|
||||
|
||||
config DEBUG_BLOCK_EXT_DEVT
|
||||
bool "Force extended block device numbers and spread them"
|
||||
depends on DEBUG_KERNEL
|
||||
depends on BLOCK
|
||||
default n
|
||||
help
|
||||
BIG FAT WARNING: ENABLING THIS OPTION MIGHT BREAK BOOTING ON
|
||||
SOME DISTRIBUTIONS. DO NOT ENABLE THIS UNLESS YOU KNOW WHAT
|
||||
YOU ARE DOING. Distros, please enable this and fix whatever
|
||||
is broken.
|
||||
|
||||
Conventionally, block device numbers are allocated from
|
||||
predetermined contiguous area. However, extended block area
|
||||
may introduce non-contiguous block device numbers. This
|
||||
option forces most block device numbers to be allocated from
|
||||
the extended space and spreads them to discover kernel or
|
||||
userland code paths which assume predetermined contiguous
|
||||
device number allocation.
|
||||
|
||||
Note that turning on this debug option shuffles all the
|
||||
device numbers for all IDE and SCSI devices including libata
|
||||
ones, so root partition specified using device number
|
||||
directly (via rdev or root=MAJ:MIN) won't work anymore.
|
||||
Textual device names (root=/dev/sdXn) will continue to work.
|
||||
|
||||
Say N if you are unsure.
|
||||
|
||||
config LKDTM
|
||||
tristate "Linux Kernel Dump Test Tool Module"
|
||||
depends on DEBUG_KERNEL
|
||||
@@ -661,10 +710,21 @@ config FAIL_PAGE_ALLOC
|
||||
|
||||
config FAIL_MAKE_REQUEST
|
||||
bool "Fault-injection capability for disk IO"
|
||||
depends on FAULT_INJECTION
|
||||
depends on FAULT_INJECTION && BLOCK
|
||||
help
|
||||
Provide fault-injection capability for disk IO.
|
||||
|
||||
config FAIL_IO_TIMEOUT
|
||||
bool "Faul-injection capability for faking disk interrupts"
|
||||
depends on FAULT_INJECTION && BLOCK
|
||||
help
|
||||
Provide fault-injection capability on end IO handling. This
|
||||
will make the block layer "forget" an interrupt as configured,
|
||||
thus exercising the error handling.
|
||||
|
||||
Only works with drivers that use the generic timeout handling,
|
||||
for others it wont do anything.
|
||||
|
||||
config FAULT_INJECTION_DEBUG_FS
|
||||
bool "Debugfs entries for fault-injection capabilities"
|
||||
depends on FAULT_INJECTION && SYSFS && DEBUG_FS
|
||||
@@ -752,6 +812,61 @@ menuconfig BUILD_DOCSRC
|
||||
|
||||
Say N if you are unsure.
|
||||
|
||||
config DYNAMIC_PRINTK_DEBUG
|
||||
bool "Enable dynamic printk() call support"
|
||||
default n
|
||||
depends on PRINTK
|
||||
select PRINTK_DEBUG
|
||||
help
|
||||
|
||||
Compiles debug level messages into the kernel, which would not
|
||||
otherwise be available at runtime. These messages can then be
|
||||
enabled/disabled on a per module basis. This mechanism implicitly
|
||||
enables all pr_debug() and dev_dbg() calls. The impact of this
|
||||
compile option is a larger kernel text size of about 2%.
|
||||
|
||||
Usage:
|
||||
|
||||
Dynamic debugging is controlled by the debugfs file,
|
||||
dynamic_printk/modules. This file contains a list of the modules that
|
||||
can be enabled. The format of the file is the module name, followed
|
||||
by a set of flags that can be enabled. The first flag is always the
|
||||
'enabled' flag. For example:
|
||||
|
||||
<module_name> <enabled=0/1>
|
||||
.
|
||||
.
|
||||
.
|
||||
|
||||
<module_name> : Name of the module in which the debug call resides
|
||||
<enabled=0/1> : whether the messages are enabled or not
|
||||
|
||||
From a live system:
|
||||
|
||||
snd_hda_intel enabled=0
|
||||
fixup enabled=0
|
||||
driver enabled=0
|
||||
|
||||
Enable a module:
|
||||
|
||||
$echo "set enabled=1 <module_name>" > dynamic_printk/modules
|
||||
|
||||
Disable a module:
|
||||
|
||||
$echo "set enabled=0 <module_name>" > dynamic_printk/modules
|
||||
|
||||
Enable all modules:
|
||||
|
||||
$echo "set enabled=1 all" > dynamic_printk/modules
|
||||
|
||||
Disable all modules:
|
||||
|
||||
$echo "set enabled=0 all" > dynamic_printk/modules
|
||||
|
||||
Finally, passing "dynamic_printk" at the command line enables
|
||||
debugging for all modules. This mode can be turned off via the above
|
||||
disable command.
|
||||
|
||||
source "samples/Kconfig"
|
||||
|
||||
source "lib/Kconfig.kgdb"
|
||||
|
@@ -19,7 +19,8 @@ lib-$(CONFIG_SMP) += cpumask.o
|
||||
lib-y += kobject.o kref.o klist.o
|
||||
|
||||
obj-y += bcd.o div64.o sort.o parser.o halfmd4.o debug_locks.o random32.o \
|
||||
bust_spinlocks.o hexdump.o kasprintf.o bitmap.o scatterlist.o
|
||||
bust_spinlocks.o hexdump.o kasprintf.o bitmap.o scatterlist.o \
|
||||
string_helpers.o
|
||||
|
||||
ifeq ($(CONFIG_DEBUG_KOBJECT),y)
|
||||
CFLAGS_kobject.o += -DDEBUG
|
||||
@@ -80,6 +81,8 @@ obj-$(CONFIG_HAVE_LMB) += lmb.o
|
||||
|
||||
obj-$(CONFIG_HAVE_ARCH_TRACEHOOK) += syscall.o
|
||||
|
||||
obj-$(CONFIG_DYNAMIC_PRINTK_DEBUG) += dynamic_printk.o
|
||||
|
||||
hostprogs-y := gen_crc32table
|
||||
clean-files := crc32table.h
|
||||
|
||||
|
@@ -126,7 +126,7 @@ char *get_options(const char *str, int nints, int *ints)
|
||||
* megabyte, or one gigabyte, respectively.
|
||||
*/
|
||||
|
||||
unsigned long long memparse(char *ptr, char **retptr)
|
||||
unsigned long long memparse(const char *ptr, char **retptr)
|
||||
{
|
||||
char *endptr; /* local pointer to end of parsed string */
|
||||
|
||||
|
418
lib/dynamic_printk.c
Normal file
418
lib/dynamic_printk.c
Normal file
@@ -0,0 +1,418 @@
|
||||
/*
|
||||
* lib/dynamic_printk.c
|
||||
*
|
||||
* make pr_debug()/dev_dbg() calls runtime configurable based upon their
|
||||
* their source module.
|
||||
*
|
||||
* Copyright (C) 2008 Red Hat, Inc., Jason Baron <jbaron@redhat.com>
|
||||
*/
|
||||
|
||||
#include <linux/kernel.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/uaccess.h>
|
||||
#include <linux/seq_file.h>
|
||||
#include <linux/debugfs.h>
|
||||
#include <linux/fs.h>
|
||||
|
||||
extern struct mod_debug __start___verbose[];
|
||||
extern struct mod_debug __stop___verbose[];
|
||||
|
||||
struct debug_name {
|
||||
struct hlist_node hlist;
|
||||
struct hlist_node hlist2;
|
||||
int hash1;
|
||||
int hash2;
|
||||
char *name;
|
||||
int enable;
|
||||
int type;
|
||||
};
|
||||
|
||||
static int nr_entries;
|
||||
static int num_enabled;
|
||||
int dynamic_enabled = DYNAMIC_ENABLED_NONE;
|
||||
static struct hlist_head module_table[DEBUG_HASH_TABLE_SIZE] =
|
||||
{ [0 ... DEBUG_HASH_TABLE_SIZE-1] = HLIST_HEAD_INIT };
|
||||
static struct hlist_head module_table2[DEBUG_HASH_TABLE_SIZE] =
|
||||
{ [0 ... DEBUG_HASH_TABLE_SIZE-1] = HLIST_HEAD_INIT };
|
||||
static DECLARE_MUTEX(debug_list_mutex);
|
||||
|
||||
/* dynamic_printk_enabled, and dynamic_printk_enabled2 are bitmasks in which
|
||||
* bit n is set to 1 if any modname hashes into the bucket n, 0 otherwise. They
|
||||
* use independent hash functions, to reduce the chance of false positives.
|
||||
*/
|
||||
long long dynamic_printk_enabled;
|
||||
EXPORT_SYMBOL_GPL(dynamic_printk_enabled);
|
||||
long long dynamic_printk_enabled2;
|
||||
EXPORT_SYMBOL_GPL(dynamic_printk_enabled2);
|
||||
|
||||
/* returns the debug module pointer. */
|
||||
static struct debug_name *find_debug_module(char *module_name)
|
||||
{
|
||||
int i;
|
||||
struct hlist_head *head;
|
||||
struct hlist_node *node;
|
||||
struct debug_name *element;
|
||||
|
||||
element = NULL;
|
||||
for (i = 0; i < DEBUG_HASH_TABLE_SIZE; i++) {
|
||||
head = &module_table[i];
|
||||
hlist_for_each_entry_rcu(element, node, head, hlist)
|
||||
if (!strcmp(element->name, module_name))
|
||||
return element;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/* returns the debug module pointer. */
|
||||
static struct debug_name *find_debug_module_hash(char *module_name, int hash)
|
||||
{
|
||||
struct hlist_head *head;
|
||||
struct hlist_node *node;
|
||||
struct debug_name *element;
|
||||
|
||||
element = NULL;
|
||||
head = &module_table[hash];
|
||||
hlist_for_each_entry_rcu(element, node, head, hlist)
|
||||
if (!strcmp(element->name, module_name))
|
||||
return element;
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/* caller must hold mutex*/
|
||||
static int __add_debug_module(char *mod_name, int hash, int hash2)
|
||||
{
|
||||
struct debug_name *new;
|
||||
char *module_name;
|
||||
int ret = 0;
|
||||
|
||||
if (find_debug_module(mod_name)) {
|
||||
ret = -EINVAL;
|
||||
goto out;
|
||||
}
|
||||
module_name = kmalloc(strlen(mod_name) + 1, GFP_KERNEL);
|
||||
if (!module_name) {
|
||||
ret = -ENOMEM;
|
||||
goto out;
|
||||
}
|
||||
module_name = strcpy(module_name, mod_name);
|
||||
module_name[strlen(mod_name)] = '\0';
|
||||
new = kzalloc(sizeof(struct debug_name), GFP_KERNEL);
|
||||
if (!new) {
|
||||
kfree(module_name);
|
||||
ret = -ENOMEM;
|
||||
goto out;
|
||||
}
|
||||
INIT_HLIST_NODE(&new->hlist);
|
||||
INIT_HLIST_NODE(&new->hlist2);
|
||||
new->name = module_name;
|
||||
new->hash1 = hash;
|
||||
new->hash2 = hash2;
|
||||
hlist_add_head_rcu(&new->hlist, &module_table[hash]);
|
||||
hlist_add_head_rcu(&new->hlist2, &module_table2[hash2]);
|
||||
nr_entries++;
|
||||
out:
|
||||
return ret;
|
||||
}
|
||||
|
||||
int unregister_dynamic_debug_module(char *mod_name)
|
||||
{
|
||||
struct debug_name *element;
|
||||
int ret = 0;
|
||||
|
||||
down(&debug_list_mutex);
|
||||
element = find_debug_module(mod_name);
|
||||
if (!element) {
|
||||
ret = -EINVAL;
|
||||
goto out;
|
||||
}
|
||||
hlist_del_rcu(&element->hlist);
|
||||
hlist_del_rcu(&element->hlist2);
|
||||
synchronize_rcu();
|
||||
kfree(element->name);
|
||||
if (element->enable)
|
||||
num_enabled--;
|
||||
kfree(element);
|
||||
nr_entries--;
|
||||
out:
|
||||
up(&debug_list_mutex);
|
||||
return 0;
|
||||
}
|
||||
EXPORT_SYMBOL_GPL(unregister_dynamic_debug_module);
|
||||
|
||||
int register_dynamic_debug_module(char *mod_name, int type, char *share_name,
|
||||
char *flags, int hash, int hash2)
|
||||
{
|
||||
struct debug_name *elem;
|
||||
int ret = 0;
|
||||
|
||||
down(&debug_list_mutex);
|
||||
elem = find_debug_module(mod_name);
|
||||
if (!elem) {
|
||||
if (__add_debug_module(mod_name, hash, hash2))
|
||||
goto out;
|
||||
elem = find_debug_module(mod_name);
|
||||
if (dynamic_enabled == DYNAMIC_ENABLED_ALL &&
|
||||
!strcmp(mod_name, share_name)) {
|
||||
elem->enable = true;
|
||||
num_enabled++;
|
||||
}
|
||||
}
|
||||
elem->type |= type;
|
||||
out:
|
||||
up(&debug_list_mutex);
|
||||
return ret;
|
||||
}
|
||||
EXPORT_SYMBOL_GPL(register_dynamic_debug_module);
|
||||
|
||||
int __dynamic_dbg_enabled_helper(char *mod_name, int type, int value, int hash)
|
||||
{
|
||||
struct debug_name *elem;
|
||||
int ret = 0;
|
||||
|
||||
if (dynamic_enabled == DYNAMIC_ENABLED_ALL)
|
||||
return 1;
|
||||
rcu_read_lock();
|
||||
elem = find_debug_module_hash(mod_name, hash);
|
||||
if (elem && elem->enable)
|
||||
ret = 1;
|
||||
rcu_read_unlock();
|
||||
return ret;
|
||||
}
|
||||
EXPORT_SYMBOL_GPL(__dynamic_dbg_enabled_helper);
|
||||
|
||||
static void set_all(bool enable)
|
||||
{
|
||||
struct debug_name *e;
|
||||
struct hlist_node *node;
|
||||
int i;
|
||||
long long enable_mask;
|
||||
|
||||
for (i = 0; i < DEBUG_HASH_TABLE_SIZE; i++) {
|
||||
if (module_table[i].first != NULL) {
|
||||
hlist_for_each_entry(e, node, &module_table[i], hlist) {
|
||||
e->enable = enable;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (enable)
|
||||
enable_mask = ULLONG_MAX;
|
||||
else
|
||||
enable_mask = 0;
|
||||
dynamic_printk_enabled = enable_mask;
|
||||
dynamic_printk_enabled2 = enable_mask;
|
||||
}
|
||||
|
||||
static int disabled_hash(int i, bool first_table)
|
||||
{
|
||||
struct debug_name *e;
|
||||
struct hlist_node *node;
|
||||
|
||||
if (first_table) {
|
||||
hlist_for_each_entry(e, node, &module_table[i], hlist) {
|
||||
if (e->enable)
|
||||
return 0;
|
||||
}
|
||||
} else {
|
||||
hlist_for_each_entry(e, node, &module_table2[i], hlist2) {
|
||||
if (e->enable)
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
|
||||
static ssize_t pr_debug_write(struct file *file, const char __user *buf,
|
||||
size_t length, loff_t *ppos)
|
||||
{
|
||||
char *buffer, *s, *value_str, *setting_str;
|
||||
int err, value;
|
||||
struct debug_name *elem = NULL;
|
||||
int all = 0;
|
||||
|
||||
if (length > PAGE_SIZE || length < 0)
|
||||
return -EINVAL;
|
||||
|
||||
buffer = (char *)__get_free_page(GFP_KERNEL);
|
||||
if (!buffer)
|
||||
return -ENOMEM;
|
||||
|
||||
err = -EFAULT;
|
||||
if (copy_from_user(buffer, buf, length))
|
||||
goto out;
|
||||
|
||||
err = -EINVAL;
|
||||
if (length < PAGE_SIZE)
|
||||
buffer[length] = '\0';
|
||||
else if (buffer[PAGE_SIZE-1])
|
||||
goto out;
|
||||
|
||||
err = -EINVAL;
|
||||
down(&debug_list_mutex);
|
||||
|
||||
if (strncmp("set", buffer, 3))
|
||||
goto out_up;
|
||||
s = buffer + 3;
|
||||
setting_str = strsep(&s, "=");
|
||||
if (s == NULL)
|
||||
goto out_up;
|
||||
setting_str = strstrip(setting_str);
|
||||
value_str = strsep(&s, " ");
|
||||
if (s == NULL)
|
||||
goto out_up;
|
||||
s = strstrip(s);
|
||||
if (!strncmp(s, "all", 3))
|
||||
all = 1;
|
||||
else
|
||||
elem = find_debug_module(s);
|
||||
if (!strncmp(setting_str, "enable", 6)) {
|
||||
value = !!simple_strtol(value_str, NULL, 10);
|
||||
if (all) {
|
||||
if (value) {
|
||||
set_all(true);
|
||||
num_enabled = nr_entries;
|
||||
dynamic_enabled = DYNAMIC_ENABLED_ALL;
|
||||
} else {
|
||||
set_all(false);
|
||||
num_enabled = 0;
|
||||
dynamic_enabled = DYNAMIC_ENABLED_NONE;
|
||||
}
|
||||
err = 0;
|
||||
} else {
|
||||
if (elem) {
|
||||
if (value && (elem->enable == 0)) {
|
||||
dynamic_printk_enabled |=
|
||||
(1LL << elem->hash1);
|
||||
dynamic_printk_enabled2 |=
|
||||
(1LL << elem->hash2);
|
||||
elem->enable = 1;
|
||||
num_enabled++;
|
||||
dynamic_enabled = DYNAMIC_ENABLED_SOME;
|
||||
err = 0;
|
||||
printk(KERN_DEBUG
|
||||
"debugging enabled for module %s",
|
||||
elem->name);
|
||||
} else if (!value && (elem->enable == 1)) {
|
||||
elem->enable = 0;
|
||||
num_enabled--;
|
||||
if (disabled_hash(elem->hash1, true))
|
||||
dynamic_printk_enabled &=
|
||||
~(1LL << elem->hash1);
|
||||
if (disabled_hash(elem->hash2, false))
|
||||
dynamic_printk_enabled2 &=
|
||||
~(1LL << elem->hash2);
|
||||
if (num_enabled)
|
||||
dynamic_enabled =
|
||||
DYNAMIC_ENABLED_SOME;
|
||||
else
|
||||
dynamic_enabled =
|
||||
DYNAMIC_ENABLED_NONE;
|
||||
err = 0;
|
||||
printk(KERN_DEBUG
|
||||
"debugging disabled for module "
|
||||
"%s", elem->name);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!err)
|
||||
err = length;
|
||||
out_up:
|
||||
up(&debug_list_mutex);
|
||||
out:
|
||||
free_page((unsigned long)buffer);
|
||||
return err;
|
||||
}
|
||||
|
||||
static void *pr_debug_seq_start(struct seq_file *f, loff_t *pos)
|
||||
{
|
||||
return (*pos < DEBUG_HASH_TABLE_SIZE) ? pos : NULL;
|
||||
}
|
||||
|
||||
static void *pr_debug_seq_next(struct seq_file *s, void *v, loff_t *pos)
|
||||
{
|
||||
(*pos)++;
|
||||
if (*pos >= DEBUG_HASH_TABLE_SIZE)
|
||||
return NULL;
|
||||
return pos;
|
||||
}
|
||||
|
||||
static void pr_debug_seq_stop(struct seq_file *s, void *v)
|
||||
{
|
||||
/* Nothing to do */
|
||||
}
|
||||
|
||||
static int pr_debug_seq_show(struct seq_file *s, void *v)
|
||||
{
|
||||
struct hlist_head *head;
|
||||
struct hlist_node *node;
|
||||
struct debug_name *elem;
|
||||
unsigned int i = *(loff_t *) v;
|
||||
|
||||
rcu_read_lock();
|
||||
head = &module_table[i];
|
||||
hlist_for_each_entry_rcu(elem, node, head, hlist) {
|
||||
seq_printf(s, "%s enabled=%d", elem->name, elem->enable);
|
||||
seq_printf(s, "\n");
|
||||
}
|
||||
rcu_read_unlock();
|
||||
return 0;
|
||||
}
|
||||
|
||||
static struct seq_operations pr_debug_seq_ops = {
|
||||
.start = pr_debug_seq_start,
|
||||
.next = pr_debug_seq_next,
|
||||
.stop = pr_debug_seq_stop,
|
||||
.show = pr_debug_seq_show
|
||||
};
|
||||
|
||||
static int pr_debug_open(struct inode *inode, struct file *filp)
|
||||
{
|
||||
return seq_open(filp, &pr_debug_seq_ops);
|
||||
}
|
||||
|
||||
static const struct file_operations pr_debug_operations = {
|
||||
.open = pr_debug_open,
|
||||
.read = seq_read,
|
||||
.write = pr_debug_write,
|
||||
.llseek = seq_lseek,
|
||||
.release = seq_release,
|
||||
};
|
||||
|
||||
static int __init dynamic_printk_init(void)
|
||||
{
|
||||
struct dentry *dir, *file;
|
||||
struct mod_debug *iter;
|
||||
unsigned long value;
|
||||
|
||||
dir = debugfs_create_dir("dynamic_printk", NULL);
|
||||
if (!dir)
|
||||
return -ENOMEM;
|
||||
file = debugfs_create_file("modules", 0644, dir, NULL,
|
||||
&pr_debug_operations);
|
||||
if (!file) {
|
||||
debugfs_remove(dir);
|
||||
return -ENOMEM;
|
||||
}
|
||||
for (value = (unsigned long)__start___verbose;
|
||||
value < (unsigned long)__stop___verbose;
|
||||
value += sizeof(struct mod_debug)) {
|
||||
iter = (struct mod_debug *)value;
|
||||
register_dynamic_debug_module(iter->modname,
|
||||
iter->type,
|
||||
iter->logical_modname,
|
||||
iter->flag_names, iter->hash, iter->hash2);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
module_init(dynamic_printk_init);
|
||||
/* may want to move this earlier so we can get traces as early as possible */
|
||||
|
||||
static int __init dynamic_printk_setup(char *str)
|
||||
{
|
||||
if (str)
|
||||
return -ENOENT;
|
||||
set_all(true);
|
||||
return 0;
|
||||
}
|
||||
/* Use early_param(), so we can get debug output as early as possible */
|
||||
early_param("dynamic_printk", dynamic_printk_setup);
|
@@ -30,8 +30,7 @@ again:
|
||||
return index;
|
||||
}
|
||||
|
||||
static inline void set_bit_area(unsigned long *map, unsigned long i,
|
||||
int len)
|
||||
void iommu_area_reserve(unsigned long *map, unsigned long i, int len)
|
||||
{
|
||||
unsigned long end = i + len;
|
||||
while (i < end) {
|
||||
@@ -64,7 +63,7 @@ again:
|
||||
start = index + 1;
|
||||
goto again;
|
||||
}
|
||||
set_bit_area(map, index, nr);
|
||||
iommu_area_reserve(map, index, nr);
|
||||
}
|
||||
return index;
|
||||
}
|
||||
@@ -80,3 +79,12 @@ void iommu_area_free(unsigned long *map, unsigned long start, unsigned int nr)
|
||||
}
|
||||
}
|
||||
EXPORT_SYMBOL(iommu_area_free);
|
||||
|
||||
unsigned long iommu_num_pages(unsigned long addr, unsigned long len,
|
||||
unsigned long io_page_size)
|
||||
{
|
||||
unsigned long size = (addr & (io_page_size - 1)) + len;
|
||||
|
||||
return DIV_ROUND_UP(size, io_page_size);
|
||||
}
|
||||
EXPORT_SYMBOL(iommu_num_pages);
|
||||
|
102
lib/klist.c
102
lib/klist.c
@@ -37,6 +37,37 @@
|
||||
#include <linux/klist.h>
|
||||
#include <linux/module.h>
|
||||
|
||||
/*
|
||||
* Use the lowest bit of n_klist to mark deleted nodes and exclude
|
||||
* dead ones from iteration.
|
||||
*/
|
||||
#define KNODE_DEAD 1LU
|
||||
#define KNODE_KLIST_MASK ~KNODE_DEAD
|
||||
|
||||
static struct klist *knode_klist(struct klist_node *knode)
|
||||
{
|
||||
return (struct klist *)
|
||||
((unsigned long)knode->n_klist & KNODE_KLIST_MASK);
|
||||
}
|
||||
|
||||
static bool knode_dead(struct klist_node *knode)
|
||||
{
|
||||
return (unsigned long)knode->n_klist & KNODE_DEAD;
|
||||
}
|
||||
|
||||
static void knode_set_klist(struct klist_node *knode, struct klist *klist)
|
||||
{
|
||||
knode->n_klist = klist;
|
||||
/* no knode deserves to start its life dead */
|
||||
WARN_ON(knode_dead(knode));
|
||||
}
|
||||
|
||||
static void knode_kill(struct klist_node *knode)
|
||||
{
|
||||
/* and no knode should die twice ever either, see we're very humane */
|
||||
WARN_ON(knode_dead(knode));
|
||||
*(unsigned long *)&knode->n_klist |= KNODE_DEAD;
|
||||
}
|
||||
|
||||
/**
|
||||
* klist_init - Initialize a klist structure.
|
||||
@@ -79,7 +110,7 @@ static void klist_node_init(struct klist *k, struct klist_node *n)
|
||||
INIT_LIST_HEAD(&n->n_node);
|
||||
init_completion(&n->n_removed);
|
||||
kref_init(&n->n_ref);
|
||||
n->n_klist = k;
|
||||
knode_set_klist(n, k);
|
||||
if (k->get)
|
||||
k->get(n);
|
||||
}
|
||||
@@ -115,7 +146,7 @@ EXPORT_SYMBOL_GPL(klist_add_tail);
|
||||
*/
|
||||
void klist_add_after(struct klist_node *n, struct klist_node *pos)
|
||||
{
|
||||
struct klist *k = pos->n_klist;
|
||||
struct klist *k = knode_klist(pos);
|
||||
|
||||
klist_node_init(k, n);
|
||||
spin_lock(&k->k_lock);
|
||||
@@ -131,7 +162,7 @@ EXPORT_SYMBOL_GPL(klist_add_after);
|
||||
*/
|
||||
void klist_add_before(struct klist_node *n, struct klist_node *pos)
|
||||
{
|
||||
struct klist *k = pos->n_klist;
|
||||
struct klist *k = knode_klist(pos);
|
||||
|
||||
klist_node_init(k, n);
|
||||
spin_lock(&k->k_lock);
|
||||
@@ -144,9 +175,10 @@ static void klist_release(struct kref *kref)
|
||||
{
|
||||
struct klist_node *n = container_of(kref, struct klist_node, n_ref);
|
||||
|
||||
WARN_ON(!knode_dead(n));
|
||||
list_del(&n->n_node);
|
||||
complete(&n->n_removed);
|
||||
n->n_klist = NULL;
|
||||
knode_set_klist(n, NULL);
|
||||
}
|
||||
|
||||
static int klist_dec_and_del(struct klist_node *n)
|
||||
@@ -154,21 +186,28 @@ static int klist_dec_and_del(struct klist_node *n)
|
||||
return kref_put(&n->n_ref, klist_release);
|
||||
}
|
||||
|
||||
static void klist_put(struct klist_node *n, bool kill)
|
||||
{
|
||||
struct klist *k = knode_klist(n);
|
||||
void (*put)(struct klist_node *) = k->put;
|
||||
|
||||
spin_lock(&k->k_lock);
|
||||
if (kill)
|
||||
knode_kill(n);
|
||||
if (!klist_dec_and_del(n))
|
||||
put = NULL;
|
||||
spin_unlock(&k->k_lock);
|
||||
if (put)
|
||||
put(n);
|
||||
}
|
||||
|
||||
/**
|
||||
* klist_del - Decrement the reference count of node and try to remove.
|
||||
* @n: node we're deleting.
|
||||
*/
|
||||
void klist_del(struct klist_node *n)
|
||||
{
|
||||
struct klist *k = n->n_klist;
|
||||
void (*put)(struct klist_node *) = k->put;
|
||||
|
||||
spin_lock(&k->k_lock);
|
||||
if (!klist_dec_and_del(n))
|
||||
put = NULL;
|
||||
spin_unlock(&k->k_lock);
|
||||
if (put)
|
||||
put(n);
|
||||
klist_put(n, true);
|
||||
}
|
||||
EXPORT_SYMBOL_GPL(klist_del);
|
||||
|
||||
@@ -206,7 +245,6 @@ void klist_iter_init_node(struct klist *k, struct klist_iter *i,
|
||||
struct klist_node *n)
|
||||
{
|
||||
i->i_klist = k;
|
||||
i->i_head = &k->k_list;
|
||||
i->i_cur = n;
|
||||
if (n)
|
||||
kref_get(&n->n_ref);
|
||||
@@ -237,7 +275,7 @@ EXPORT_SYMBOL_GPL(klist_iter_init);
|
||||
void klist_iter_exit(struct klist_iter *i)
|
||||
{
|
||||
if (i->i_cur) {
|
||||
klist_del(i->i_cur);
|
||||
klist_put(i->i_cur, false);
|
||||
i->i_cur = NULL;
|
||||
}
|
||||
}
|
||||
@@ -258,27 +296,33 @@ static struct klist_node *to_klist_node(struct list_head *n)
|
||||
*/
|
||||
struct klist_node *klist_next(struct klist_iter *i)
|
||||
{
|
||||
struct list_head *next;
|
||||
struct klist_node *lnode = i->i_cur;
|
||||
struct klist_node *knode = NULL;
|
||||
void (*put)(struct klist_node *) = i->i_klist->put;
|
||||
struct klist_node *last = i->i_cur;
|
||||
struct klist_node *next;
|
||||
|
||||
spin_lock(&i->i_klist->k_lock);
|
||||
if (lnode) {
|
||||
next = lnode->n_node.next;
|
||||
if (!klist_dec_and_del(lnode))
|
||||
|
||||
if (last) {
|
||||
next = to_klist_node(last->n_node.next);
|
||||
if (!klist_dec_and_del(last))
|
||||
put = NULL;
|
||||
} else
|
||||
next = i->i_head->next;
|
||||
next = to_klist_node(i->i_klist->k_list.next);
|
||||
|
||||
if (next != i->i_head) {
|
||||
knode = to_klist_node(next);
|
||||
kref_get(&knode->n_ref);
|
||||
i->i_cur = NULL;
|
||||
while (next != to_klist_node(&i->i_klist->k_list)) {
|
||||
if (likely(!knode_dead(next))) {
|
||||
kref_get(&next->n_ref);
|
||||
i->i_cur = next;
|
||||
break;
|
||||
}
|
||||
next = to_klist_node(next->n_node.next);
|
||||
}
|
||||
i->i_cur = knode;
|
||||
|
||||
spin_unlock(&i->i_klist->k_lock);
|
||||
if (put && lnode)
|
||||
put(lnode);
|
||||
return knode;
|
||||
|
||||
if (put && last)
|
||||
put(last);
|
||||
return i->i_cur;
|
||||
}
|
||||
EXPORT_SYMBOL_GPL(klist_next);
|
||||
|
@@ -387,11 +387,17 @@ EXPORT_SYMBOL_GPL(kobject_init_and_add);
|
||||
* kobject_rename - change the name of an object
|
||||
* @kobj: object in question.
|
||||
* @new_name: object's new name
|
||||
*
|
||||
* It is the responsibility of the caller to provide mutual
|
||||
* exclusion between two different calls of kobject_rename
|
||||
* on the same kobject and to ensure that new_name is valid and
|
||||
* won't conflict with other kobjects.
|
||||
*/
|
||||
int kobject_rename(struct kobject *kobj, const char *new_name)
|
||||
{
|
||||
int error = 0;
|
||||
const char *devpath = NULL;
|
||||
const char *dup_name = NULL, *name;
|
||||
char *devpath_string = NULL;
|
||||
char *envp[2];
|
||||
|
||||
@@ -401,19 +407,6 @@ int kobject_rename(struct kobject *kobj, const char *new_name)
|
||||
if (!kobj->parent)
|
||||
return -EINVAL;
|
||||
|
||||
/* see if this name is already in use */
|
||||
if (kobj->kset) {
|
||||
struct kobject *temp_kobj;
|
||||
temp_kobj = kset_find_obj(kobj->kset, new_name);
|
||||
if (temp_kobj) {
|
||||
printk(KERN_WARNING "kobject '%s' cannot be renamed "
|
||||
"to '%s' as '%s' is already in existence.\n",
|
||||
kobject_name(kobj), new_name, new_name);
|
||||
kobject_put(temp_kobj);
|
||||
return -EINVAL;
|
||||
}
|
||||
}
|
||||
|
||||
devpath = kobject_get_path(kobj, GFP_KERNEL);
|
||||
if (!devpath) {
|
||||
error = -ENOMEM;
|
||||
@@ -428,15 +421,27 @@ int kobject_rename(struct kobject *kobj, const char *new_name)
|
||||
envp[0] = devpath_string;
|
||||
envp[1] = NULL;
|
||||
|
||||
name = dup_name = kstrdup(new_name, GFP_KERNEL);
|
||||
if (!name) {
|
||||
error = -ENOMEM;
|
||||
goto out;
|
||||
}
|
||||
|
||||
error = sysfs_rename_dir(kobj, new_name);
|
||||
if (error)
|
||||
goto out;
|
||||
|
||||
/* Install the new kobject name */
|
||||
dup_name = kobj->name;
|
||||
kobj->name = name;
|
||||
|
||||
/* This function is mostly/only used for network interface.
|
||||
* Some hotplug package track interfaces by their name and
|
||||
* therefore want to know when the name is changed by the user. */
|
||||
if (!error)
|
||||
kobject_uevent_env(kobj, KOBJ_MOVE, envp);
|
||||
kobject_uevent_env(kobj, KOBJ_MOVE, envp);
|
||||
|
||||
out:
|
||||
kfree(dup_name);
|
||||
kfree(devpath_string);
|
||||
kfree(devpath);
|
||||
kobject_put(kobj);
|
||||
|
@@ -100,7 +100,7 @@ static int match_one(char *s, const char *p, substring_t args[])
|
||||
* format identifiers which will be taken into account when matching the
|
||||
* tokens, and whose locations will be returned in the @args array.
|
||||
*/
|
||||
int match_token(char *s, match_table_t table, substring_t args[])
|
||||
int match_token(char *s, const match_table_t table, substring_t args[])
|
||||
{
|
||||
const struct match_token *p;
|
||||
|
||||
|
@@ -52,7 +52,7 @@ EXPORT_SYMBOL(__percpu_counter_add);
|
||||
* Add up all the per-cpu counts, return the result. This is a more accurate
|
||||
* but much slower version of percpu_counter_read_positive()
|
||||
*/
|
||||
s64 __percpu_counter_sum(struct percpu_counter *fbc, int set)
|
||||
s64 __percpu_counter_sum(struct percpu_counter *fbc)
|
||||
{
|
||||
s64 ret;
|
||||
int cpu;
|
||||
@@ -62,11 +62,9 @@ s64 __percpu_counter_sum(struct percpu_counter *fbc, int set)
|
||||
for_each_online_cpu(cpu) {
|
||||
s32 *pcount = per_cpu_ptr(fbc->counters, cpu);
|
||||
ret += *pcount;
|
||||
if (set)
|
||||
*pcount = 0;
|
||||
*pcount = 0;
|
||||
}
|
||||
if (set)
|
||||
fbc->count = ret;
|
||||
fbc->count = ret;
|
||||
|
||||
spin_unlock(&fbc->lock);
|
||||
return ret;
|
||||
|
64
lib/string_helpers.c
Normal file
64
lib/string_helpers.c
Normal file
@@ -0,0 +1,64 @@
|
||||
/*
|
||||
* Helpers for formatting and printing strings
|
||||
*
|
||||
* Copyright 31 August 2008 James Bottomley
|
||||
*/
|
||||
#include <linux/kernel.h>
|
||||
#include <linux/math64.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/string_helpers.h>
|
||||
|
||||
/**
|
||||
* string_get_size - get the size in the specified units
|
||||
* @size: The size to be converted
|
||||
* @units: units to use (powers of 1000 or 1024)
|
||||
* @buf: buffer to format to
|
||||
* @len: length of buffer
|
||||
*
|
||||
* This function returns a string formatted to 3 significant figures
|
||||
* giving the size in the required units. Returns 0 on success or
|
||||
* error on failure. @buf is always zero terminated.
|
||||
*
|
||||
*/
|
||||
int string_get_size(u64 size, const enum string_size_units units,
|
||||
char *buf, int len)
|
||||
{
|
||||
const char *units_10[] = { "B", "KB", "MB", "GB", "TB", "PB",
|
||||
"EB", "ZB", "YB", NULL};
|
||||
const char *units_2[] = {"B", "KiB", "MiB", "GiB", "TiB", "PiB",
|
||||
"EiB", "ZiB", "YiB", NULL };
|
||||
const char **units_str[] = {
|
||||
[STRING_UNITS_10] = units_10,
|
||||
[STRING_UNITS_2] = units_2,
|
||||
};
|
||||
const int divisor[] = {
|
||||
[STRING_UNITS_10] = 1000,
|
||||
[STRING_UNITS_2] = 1024,
|
||||
};
|
||||
int i, j;
|
||||
u64 remainder = 0, sf_cap;
|
||||
char tmp[8];
|
||||
|
||||
tmp[0] = '\0';
|
||||
|
||||
for (i = 0; size > divisor[units] && units_str[units][i]; i++)
|
||||
remainder = do_div(size, divisor[units]);
|
||||
|
||||
sf_cap = size;
|
||||
for (j = 0; sf_cap*10 < 1000; j++)
|
||||
sf_cap *= 10;
|
||||
|
||||
if (j) {
|
||||
remainder *= 1000;
|
||||
do_div(remainder, divisor[units]);
|
||||
snprintf(tmp, sizeof(tmp), ".%03lld",
|
||||
(unsigned long long)remainder);
|
||||
tmp[j+1] = '\0';
|
||||
}
|
||||
|
||||
snprintf(buf, len, "%lld%s%s", (unsigned long long)size,
|
||||
tmp, units_str[units][i]);
|
||||
|
||||
return 0;
|
||||
}
|
||||
EXPORT_SYMBOL(string_get_size);
|
@@ -274,13 +274,14 @@ cleanup1:
|
||||
}
|
||||
|
||||
static int
|
||||
address_needs_mapping(struct device *hwdev, dma_addr_t addr)
|
||||
address_needs_mapping(struct device *hwdev, dma_addr_t addr, size_t size)
|
||||
{
|
||||
dma_addr_t mask = 0xffffffff;
|
||||
/* If the device has a mask, use it, otherwise default to 32 bits */
|
||||
if (hwdev && hwdev->dma_mask)
|
||||
mask = *hwdev->dma_mask;
|
||||
return (addr & ~mask) != 0;
|
||||
return !is_buffer_dma_capable(dma_get_mask(hwdev), addr, size);
|
||||
}
|
||||
|
||||
static int is_swiotlb_buffer(char *addr)
|
||||
{
|
||||
return addr >= io_tlb_start && addr < io_tlb_end;
|
||||
}
|
||||
|
||||
/*
|
||||
@@ -467,15 +468,8 @@ swiotlb_alloc_coherent(struct device *hwdev, size_t size,
|
||||
void *ret;
|
||||
int order = get_order(size);
|
||||
|
||||
/*
|
||||
* XXX fix me: the DMA API should pass us an explicit DMA mask
|
||||
* instead, or use ZONE_DMA32 (ia64 overloads ZONE_DMA to be a ~32
|
||||
* bit range instead of a 16MB one).
|
||||
*/
|
||||
flags |= GFP_DMA;
|
||||
|
||||
ret = (void *)__get_free_pages(flags, order);
|
||||
if (ret && address_needs_mapping(hwdev, virt_to_bus(ret))) {
|
||||
if (ret && address_needs_mapping(hwdev, virt_to_bus(ret), size)) {
|
||||
/*
|
||||
* The allocated memory isn't reachable by the device.
|
||||
* Fall back on swiotlb_map_single().
|
||||
@@ -490,19 +484,16 @@ swiotlb_alloc_coherent(struct device *hwdev, size_t size,
|
||||
* swiotlb_map_single(), which will grab memory from
|
||||
* the lowest available address range.
|
||||
*/
|
||||
dma_addr_t handle;
|
||||
handle = swiotlb_map_single(hwdev, NULL, size, DMA_FROM_DEVICE);
|
||||
if (swiotlb_dma_mapping_error(hwdev, handle))
|
||||
ret = map_single(hwdev, NULL, size, DMA_FROM_DEVICE);
|
||||
if (!ret)
|
||||
return NULL;
|
||||
|
||||
ret = bus_to_virt(handle);
|
||||
}
|
||||
|
||||
memset(ret, 0, size);
|
||||
dev_addr = virt_to_bus(ret);
|
||||
|
||||
/* Confirm address can be DMA'd by device */
|
||||
if (address_needs_mapping(hwdev, dev_addr)) {
|
||||
if (address_needs_mapping(hwdev, dev_addr, size)) {
|
||||
printk("hwdev DMA mask = 0x%016Lx, dev_addr = 0x%016Lx\n",
|
||||
(unsigned long long)*hwdev->dma_mask,
|
||||
(unsigned long long)dev_addr);
|
||||
@@ -518,12 +509,11 @@ swiotlb_free_coherent(struct device *hwdev, size_t size, void *vaddr,
|
||||
dma_addr_t dma_handle)
|
||||
{
|
||||
WARN_ON(irqs_disabled());
|
||||
if (!(vaddr >= (void *)io_tlb_start
|
||||
&& vaddr < (void *)io_tlb_end))
|
||||
if (!is_swiotlb_buffer(vaddr))
|
||||
free_pages((unsigned long) vaddr, get_order(size));
|
||||
else
|
||||
/* DMA_TO_DEVICE to avoid memcpy in unmap_single */
|
||||
swiotlb_unmap_single (hwdev, dma_handle, size, DMA_TO_DEVICE);
|
||||
unmap_single(hwdev, vaddr, size, DMA_TO_DEVICE);
|
||||
}
|
||||
|
||||
static void
|
||||
@@ -567,7 +557,7 @@ swiotlb_map_single_attrs(struct device *hwdev, void *ptr, size_t size,
|
||||
* we can safely return the device addr and not worry about bounce
|
||||
* buffering it.
|
||||
*/
|
||||
if (!address_needs_mapping(hwdev, dev_addr) && !swiotlb_force)
|
||||
if (!address_needs_mapping(hwdev, dev_addr, size) && !swiotlb_force)
|
||||
return dev_addr;
|
||||
|
||||
/*
|
||||
@@ -584,7 +574,7 @@ swiotlb_map_single_attrs(struct device *hwdev, void *ptr, size_t size,
|
||||
/*
|
||||
* Ensure that the address returned is DMA'ble
|
||||
*/
|
||||
if (address_needs_mapping(hwdev, dev_addr))
|
||||
if (address_needs_mapping(hwdev, dev_addr, size))
|
||||
panic("map_single: bounce buffer is not DMA'ble");
|
||||
|
||||
return dev_addr;
|
||||
@@ -612,7 +602,7 @@ swiotlb_unmap_single_attrs(struct device *hwdev, dma_addr_t dev_addr,
|
||||
char *dma_addr = bus_to_virt(dev_addr);
|
||||
|
||||
BUG_ON(dir == DMA_NONE);
|
||||
if (dma_addr >= io_tlb_start && dma_addr < io_tlb_end)
|
||||
if (is_swiotlb_buffer(dma_addr))
|
||||
unmap_single(hwdev, dma_addr, size, dir);
|
||||
else if (dir == DMA_FROM_DEVICE)
|
||||
dma_mark_clean(dma_addr, size);
|
||||
@@ -642,7 +632,7 @@ swiotlb_sync_single(struct device *hwdev, dma_addr_t dev_addr,
|
||||
char *dma_addr = bus_to_virt(dev_addr);
|
||||
|
||||
BUG_ON(dir == DMA_NONE);
|
||||
if (dma_addr >= io_tlb_start && dma_addr < io_tlb_end)
|
||||
if (is_swiotlb_buffer(dma_addr))
|
||||
sync_single(hwdev, dma_addr, size, dir, target);
|
||||
else if (dir == DMA_FROM_DEVICE)
|
||||
dma_mark_clean(dma_addr, size);
|
||||
@@ -673,7 +663,7 @@ swiotlb_sync_single_range(struct device *hwdev, dma_addr_t dev_addr,
|
||||
char *dma_addr = bus_to_virt(dev_addr) + offset;
|
||||
|
||||
BUG_ON(dir == DMA_NONE);
|
||||
if (dma_addr >= io_tlb_start && dma_addr < io_tlb_end)
|
||||
if (is_swiotlb_buffer(dma_addr))
|
||||
sync_single(hwdev, dma_addr, size, dir, target);
|
||||
else if (dir == DMA_FROM_DEVICE)
|
||||
dma_mark_clean(dma_addr, size);
|
||||
@@ -727,7 +717,8 @@ swiotlb_map_sg_attrs(struct device *hwdev, struct scatterlist *sgl, int nelems,
|
||||
for_each_sg(sgl, sg, nelems, i) {
|
||||
addr = SG_ENT_VIRT_ADDRESS(sg);
|
||||
dev_addr = virt_to_bus(addr);
|
||||
if (swiotlb_force || address_needs_mapping(hwdev, dev_addr)) {
|
||||
if (swiotlb_force ||
|
||||
address_needs_mapping(hwdev, dev_addr, sg->length)) {
|
||||
void *map = map_single(hwdev, addr, sg->length, dir);
|
||||
if (!map) {
|
||||
/* Don't panic here, we expect map_sg users
|
||||
|
235
lib/vsprintf.c
235
lib/vsprintf.c
@@ -32,40 +32,48 @@
|
||||
/* Works only for digits and letters, but small and fast */
|
||||
#define TOLOWER(x) ((x) | 0x20)
|
||||
|
||||
static unsigned int simple_guess_base(const char *cp)
|
||||
{
|
||||
if (cp[0] == '0') {
|
||||
if (TOLOWER(cp[1]) == 'x' && isxdigit(cp[2]))
|
||||
return 16;
|
||||
else
|
||||
return 8;
|
||||
} else {
|
||||
return 10;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* simple_strtoul - convert a string to an unsigned long
|
||||
* @cp: The start of the string
|
||||
* @endp: A pointer to the end of the parsed string will be placed here
|
||||
* @base: The number base to use
|
||||
*/
|
||||
unsigned long simple_strtoul(const char *cp,char **endp,unsigned int base)
|
||||
unsigned long simple_strtoul(const char *cp, char **endp, unsigned int base)
|
||||
{
|
||||
unsigned long result = 0,value;
|
||||
unsigned long result = 0;
|
||||
|
||||
if (!base) {
|
||||
base = 10;
|
||||
if (*cp == '0') {
|
||||
base = 8;
|
||||
cp++;
|
||||
if ((TOLOWER(*cp) == 'x') && isxdigit(cp[1])) {
|
||||
cp++;
|
||||
base = 16;
|
||||
}
|
||||
}
|
||||
} else if (base == 16) {
|
||||
if (cp[0] == '0' && TOLOWER(cp[1]) == 'x')
|
||||
cp += 2;
|
||||
}
|
||||
while (isxdigit(*cp) &&
|
||||
(value = isdigit(*cp) ? *cp-'0' : TOLOWER(*cp)-'a'+10) < base) {
|
||||
result = result*base + value;
|
||||
if (!base)
|
||||
base = simple_guess_base(cp);
|
||||
|
||||
if (base == 16 && cp[0] == '0' && TOLOWER(cp[1]) == 'x')
|
||||
cp += 2;
|
||||
|
||||
while (isxdigit(*cp)) {
|
||||
unsigned int value;
|
||||
|
||||
value = isdigit(*cp) ? *cp - '0' : TOLOWER(*cp) - 'a' + 10;
|
||||
if (value >= base)
|
||||
break;
|
||||
result = result * base + value;
|
||||
cp++;
|
||||
}
|
||||
|
||||
if (endp)
|
||||
*endp = (char *)cp;
|
||||
return result;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(simple_strtoul);
|
||||
|
||||
/**
|
||||
@@ -74,13 +82,12 @@ EXPORT_SYMBOL(simple_strtoul);
|
||||
* @endp: A pointer to the end of the parsed string will be placed here
|
||||
* @base: The number base to use
|
||||
*/
|
||||
long simple_strtol(const char *cp,char **endp,unsigned int base)
|
||||
long simple_strtol(const char *cp, char **endp, unsigned int base)
|
||||
{
|
||||
if(*cp=='-')
|
||||
return -simple_strtoul(cp+1,endp,base);
|
||||
return simple_strtoul(cp,endp,base);
|
||||
if(*cp == '-')
|
||||
return -simple_strtoul(cp + 1, endp, base);
|
||||
return simple_strtoul(cp, endp, base);
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(simple_strtol);
|
||||
|
||||
/**
|
||||
@@ -89,34 +96,30 @@ EXPORT_SYMBOL(simple_strtol);
|
||||
* @endp: A pointer to the end of the parsed string will be placed here
|
||||
* @base: The number base to use
|
||||
*/
|
||||
unsigned long long simple_strtoull(const char *cp,char **endp,unsigned int base)
|
||||
unsigned long long simple_strtoull(const char *cp, char **endp, unsigned int base)
|
||||
{
|
||||
unsigned long long result = 0,value;
|
||||
unsigned long long result = 0;
|
||||
|
||||
if (!base) {
|
||||
base = 10;
|
||||
if (*cp == '0') {
|
||||
base = 8;
|
||||
cp++;
|
||||
if ((TOLOWER(*cp) == 'x') && isxdigit(cp[1])) {
|
||||
cp++;
|
||||
base = 16;
|
||||
}
|
||||
}
|
||||
} else if (base == 16) {
|
||||
if (cp[0] == '0' && TOLOWER(cp[1]) == 'x')
|
||||
cp += 2;
|
||||
}
|
||||
while (isxdigit(*cp)
|
||||
&& (value = isdigit(*cp) ? *cp-'0' : TOLOWER(*cp)-'a'+10) < base) {
|
||||
result = result*base + value;
|
||||
if (!base)
|
||||
base = simple_guess_base(cp);
|
||||
|
||||
if (base == 16 && cp[0] == '0' && TOLOWER(cp[1]) == 'x')
|
||||
cp += 2;
|
||||
|
||||
while (isxdigit(*cp)) {
|
||||
unsigned int value;
|
||||
|
||||
value = isdigit(*cp) ? *cp - '0' : TOLOWER(*cp) - 'a' + 10;
|
||||
if (value >= base)
|
||||
break;
|
||||
result = result * base + value;
|
||||
cp++;
|
||||
}
|
||||
|
||||
if (endp)
|
||||
*endp = (char *)cp;
|
||||
return result;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(simple_strtoull);
|
||||
|
||||
/**
|
||||
@@ -125,14 +128,13 @@ EXPORT_SYMBOL(simple_strtoull);
|
||||
* @endp: A pointer to the end of the parsed string will be placed here
|
||||
* @base: The number base to use
|
||||
*/
|
||||
long long simple_strtoll(const char *cp,char **endp,unsigned int base)
|
||||
long long simple_strtoll(const char *cp, char **endp, unsigned int base)
|
||||
{
|
||||
if(*cp=='-')
|
||||
return -simple_strtoull(cp+1,endp,base);
|
||||
return simple_strtoull(cp,endp,base);
|
||||
return -simple_strtoull(cp + 1, endp, base);
|
||||
return simple_strtoull(cp, endp, base);
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* strict_strtoul - convert a string to an unsigned long strictly
|
||||
* @cp: The string to be converted
|
||||
@@ -155,7 +157,27 @@ long long simple_strtoll(const char *cp,char **endp,unsigned int base)
|
||||
* simple_strtoul just ignores the successive invalid characters and
|
||||
* return the converted value of prefix part of the string.
|
||||
*/
|
||||
int strict_strtoul(const char *cp, unsigned int base, unsigned long *res);
|
||||
int strict_strtoul(const char *cp, unsigned int base, unsigned long *res)
|
||||
{
|
||||
char *tail;
|
||||
unsigned long val;
|
||||
size_t len;
|
||||
|
||||
*res = 0;
|
||||
len = strlen(cp);
|
||||
if (len == 0)
|
||||
return -EINVAL;
|
||||
|
||||
val = simple_strtoul(cp, &tail, base);
|
||||
if ((*tail == '\0') ||
|
||||
((len == (size_t)(tail - cp) + 1) && (*tail == '\n'))) {
|
||||
*res = val;
|
||||
return 0;
|
||||
}
|
||||
|
||||
return -EINVAL;
|
||||
}
|
||||
EXPORT_SYMBOL(strict_strtoul);
|
||||
|
||||
/**
|
||||
* strict_strtol - convert a string to a long strictly
|
||||
@@ -169,7 +191,20 @@ int strict_strtoul(const char *cp, unsigned int base, unsigned long *res);
|
||||
* It returns 0 if conversion is successful and *res is set to the converted
|
||||
* value, otherwise it returns -EINVAL and *res is set to 0.
|
||||
*/
|
||||
int strict_strtol(const char *cp, unsigned int base, long *res);
|
||||
int strict_strtol(const char *cp, unsigned int base, long *res)
|
||||
{
|
||||
int ret;
|
||||
if (*cp == '-') {
|
||||
ret = strict_strtoul(cp + 1, base, (unsigned long *)res);
|
||||
if (!ret)
|
||||
*res = -(*res);
|
||||
} else {
|
||||
ret = strict_strtoul(cp, base, (unsigned long *)res);
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
EXPORT_SYMBOL(strict_strtol);
|
||||
|
||||
/**
|
||||
* strict_strtoull - convert a string to an unsigned long long strictly
|
||||
@@ -193,7 +228,27 @@ int strict_strtol(const char *cp, unsigned int base, long *res);
|
||||
* simple_strtoull just ignores the successive invalid characters and
|
||||
* return the converted value of prefix part of the string.
|
||||
*/
|
||||
int strict_strtoull(const char *cp, unsigned int base, unsigned long long *res);
|
||||
int strict_strtoull(const char *cp, unsigned int base, unsigned long long *res)
|
||||
{
|
||||
char *tail;
|
||||
unsigned long long val;
|
||||
size_t len;
|
||||
|
||||
*res = 0;
|
||||
len = strlen(cp);
|
||||
if (len == 0)
|
||||
return -EINVAL;
|
||||
|
||||
val = simple_strtoull(cp, &tail, base);
|
||||
if ((*tail == '\0') ||
|
||||
((len == (size_t)(tail - cp) + 1) && (*tail == '\n'))) {
|
||||
*res = val;
|
||||
return 0;
|
||||
}
|
||||
|
||||
return -EINVAL;
|
||||
}
|
||||
EXPORT_SYMBOL(strict_strtoull);
|
||||
|
||||
/**
|
||||
* strict_strtoll - convert a string to a long long strictly
|
||||
@@ -207,53 +262,20 @@ int strict_strtoull(const char *cp, unsigned int base, unsigned long long *res);
|
||||
* It returns 0 if conversion is successful and *res is set to the converted
|
||||
* value, otherwise it returns -EINVAL and *res is set to 0.
|
||||
*/
|
||||
int strict_strtoll(const char *cp, unsigned int base, long long *res);
|
||||
int strict_strtoll(const char *cp, unsigned int base, long long *res)
|
||||
{
|
||||
int ret;
|
||||
if (*cp == '-') {
|
||||
ret = strict_strtoull(cp + 1, base, (unsigned long long *)res);
|
||||
if (!ret)
|
||||
*res = -(*res);
|
||||
} else {
|
||||
ret = strict_strtoull(cp, base, (unsigned long long *)res);
|
||||
}
|
||||
|
||||
#define define_strict_strtoux(type, valtype) \
|
||||
int strict_strtou##type(const char *cp, unsigned int base, valtype *res)\
|
||||
{ \
|
||||
char *tail; \
|
||||
valtype val; \
|
||||
size_t len; \
|
||||
\
|
||||
*res = 0; \
|
||||
len = strlen(cp); \
|
||||
if (len == 0) \
|
||||
return -EINVAL; \
|
||||
\
|
||||
val = simple_strtou##type(cp, &tail, base); \
|
||||
if ((*tail == '\0') || \
|
||||
((len == (size_t)(tail - cp) + 1) && (*tail == '\n'))) {\
|
||||
*res = val; \
|
||||
return 0; \
|
||||
} \
|
||||
\
|
||||
return -EINVAL; \
|
||||
} \
|
||||
|
||||
#define define_strict_strtox(type, valtype) \
|
||||
int strict_strto##type(const char *cp, unsigned int base, valtype *res) \
|
||||
{ \
|
||||
int ret; \
|
||||
if (*cp == '-') { \
|
||||
ret = strict_strtou##type(cp+1, base, res); \
|
||||
if (!ret) \
|
||||
*res = -(*res); \
|
||||
} else \
|
||||
ret = strict_strtou##type(cp, base, res); \
|
||||
\
|
||||
return ret; \
|
||||
} \
|
||||
|
||||
define_strict_strtoux(l, unsigned long)
|
||||
define_strict_strtox(l, long)
|
||||
define_strict_strtoux(ll, unsigned long long)
|
||||
define_strict_strtox(ll, long long)
|
||||
|
||||
EXPORT_SYMBOL(strict_strtoul);
|
||||
EXPORT_SYMBOL(strict_strtol);
|
||||
return ret;
|
||||
}
|
||||
EXPORT_SYMBOL(strict_strtoll);
|
||||
EXPORT_SYMBOL(strict_strtoull);
|
||||
|
||||
static int skip_atoi(const char **s)
|
||||
{
|
||||
@@ -565,6 +587,10 @@ static char *pointer(const char *fmt, char *buf, char *end, void *ptr, int field
|
||||
* @fmt: The format string to use
|
||||
* @args: Arguments for the format string
|
||||
*
|
||||
* This function follows C99 vsnprintf, but has some extensions:
|
||||
* %pS output the name of a text symbol
|
||||
* %pF output the name of a function pointer
|
||||
*
|
||||
* The return value is the number of characters which would
|
||||
* be generated for the given input, excluding the trailing
|
||||
* '\0', as per ISO C99. If you want to have the exact
|
||||
@@ -790,7 +816,6 @@ int vsnprintf(char *buf, size_t size, const char *fmt, va_list args)
|
||||
/* the trailing null byte doesn't count towards the total */
|
||||
return str-buf;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(vsnprintf);
|
||||
|
||||
/**
|
||||
@@ -806,6 +831,8 @@ EXPORT_SYMBOL(vsnprintf);
|
||||
*
|
||||
* Call this function if you are already dealing with a va_list.
|
||||
* You probably want scnprintf() instead.
|
||||
*
|
||||
* See the vsnprintf() documentation for format string extensions over C99.
|
||||
*/
|
||||
int vscnprintf(char *buf, size_t size, const char *fmt, va_list args)
|
||||
{
|
||||
@@ -814,7 +841,6 @@ int vscnprintf(char *buf, size_t size, const char *fmt, va_list args)
|
||||
i=vsnprintf(buf,size,fmt,args);
|
||||
return (i >= size) ? (size - 1) : i;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(vscnprintf);
|
||||
|
||||
/**
|
||||
@@ -828,6 +854,8 @@ EXPORT_SYMBOL(vscnprintf);
|
||||
* generated for the given input, excluding the trailing null,
|
||||
* as per ISO C99. If the return is greater than or equal to
|
||||
* @size, the resulting string is truncated.
|
||||
*
|
||||
* See the vsnprintf() documentation for format string extensions over C99.
|
||||
*/
|
||||
int snprintf(char * buf, size_t size, const char *fmt, ...)
|
||||
{
|
||||
@@ -839,7 +867,6 @@ int snprintf(char * buf, size_t size, const char *fmt, ...)
|
||||
va_end(args);
|
||||
return i;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(snprintf);
|
||||
|
||||
/**
|
||||
@@ -877,12 +904,13 @@ EXPORT_SYMBOL(scnprintf);
|
||||
*
|
||||
* Call this function if you are already dealing with a va_list.
|
||||
* You probably want sprintf() instead.
|
||||
*
|
||||
* See the vsnprintf() documentation for format string extensions over C99.
|
||||
*/
|
||||
int vsprintf(char *buf, const char *fmt, va_list args)
|
||||
{
|
||||
return vsnprintf(buf, INT_MAX, fmt, args);
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(vsprintf);
|
||||
|
||||
/**
|
||||
@@ -894,6 +922,8 @@ EXPORT_SYMBOL(vsprintf);
|
||||
* The function returns the number of characters written
|
||||
* into @buf. Use snprintf() or scnprintf() in order to avoid
|
||||
* buffer overflows.
|
||||
*
|
||||
* See the vsnprintf() documentation for format string extensions over C99.
|
||||
*/
|
||||
int sprintf(char * buf, const char *fmt, ...)
|
||||
{
|
||||
@@ -905,7 +935,6 @@ int sprintf(char * buf, const char *fmt, ...)
|
||||
va_end(args);
|
||||
return i;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(sprintf);
|
||||
|
||||
/**
|
||||
@@ -1134,7 +1163,6 @@ int vsscanf(const char * buf, const char * fmt, va_list args)
|
||||
|
||||
return num;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(vsscanf);
|
||||
|
||||
/**
|
||||
@@ -1153,5 +1181,4 @@ int sscanf(const char * buf, const char * fmt, ...)
|
||||
va_end(args);
|
||||
return i;
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(sscanf);
|
||||
|
Reference in New Issue
Block a user