diff options
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Kconfig | 7 | ||||
-rw-r--r-- | lib/Kconfig.debug | 26 | ||||
-rw-r--r-- | lib/Makefile | 6 | ||||
-rw-r--r-- | lib/crc-t10dif.c | 67 | ||||
-rw-r--r-- | lib/kobject.c | 1 | ||||
-rw-r--r-- | lib/percpu_counter.c | 7 | ||||
-rw-r--r-- | lib/smp_processor_id.c | 6 | ||||
-rw-r--r-- | lib/textsearch.c | 15 | ||||
-rw-r--r-- | lib/ts_bm.c | 26 | ||||
-rw-r--r-- | lib/ts_fsm.c | 6 | ||||
-rw-r--r-- | lib/ts_kmp.c | 29 | ||||
-rw-r--r-- | lib/vsprintf.c | 128 |
12 files changed, 262 insertions, 62 deletions
diff --git a/lib/Kconfig b/lib/Kconfig index 8cc8e8722a3f..c7ad7a5b3535 100644 --- a/lib/Kconfig +++ b/lib/Kconfig | |||
@@ -29,6 +29,13 @@ config CRC16 | |||
29 | the kernel tree does. Such modules that use library CRC16 | 29 | the kernel tree does. Such modules that use library CRC16 |
30 | functions require M here. | 30 | functions require M here. |
31 | 31 | ||
32 | config CRC_T10DIF | ||
33 | tristate "CRC calculation for the T10 Data Integrity Field" | ||
34 | help | ||
35 | This option is only needed if a module that's not in the | ||
36 | kernel tree needs to calculate CRC checks for use with the | ||
37 | SCSI data integrity subsystem. | ||
38 | |||
32 | config CRC_ITU_T | 39 | config CRC_ITU_T |
33 | tristate "CRC ITU-T V.41 functions" | 40 | tristate "CRC ITU-T V.41 functions" |
34 | help | 41 | help |
diff --git a/lib/Kconfig.debug b/lib/Kconfig.debug index d2099f41aa1e..df27132a56f4 100644 --- a/lib/Kconfig.debug +++ b/lib/Kconfig.debug | |||
@@ -419,7 +419,6 @@ config DEBUG_LOCKING_API_SELFTESTS | |||
419 | 419 | ||
420 | config STACKTRACE | 420 | config STACKTRACE |
421 | bool | 421 | bool |
422 | depends on DEBUG_KERNEL | ||
423 | depends on STACKTRACE_SUPPORT | 422 | depends on STACKTRACE_SUPPORT |
424 | 423 | ||
425 | config DEBUG_KOBJECT | 424 | config DEBUG_KOBJECT |
@@ -531,16 +530,34 @@ config BOOT_PRINTK_DELAY | |||
531 | config RCU_TORTURE_TEST | 530 | config RCU_TORTURE_TEST |
532 | tristate "torture tests for RCU" | 531 | tristate "torture tests for RCU" |
533 | depends on DEBUG_KERNEL | 532 | depends on DEBUG_KERNEL |
534 | depends on m | ||
535 | default n | 533 | default n |
536 | help | 534 | help |
537 | This option provides a kernel module that runs torture tests | 535 | This option provides a kernel module that runs torture tests |
538 | on the RCU infrastructure. The kernel module may be built | 536 | on the RCU infrastructure. The kernel module may be built |
539 | after the fact on the running kernel to be tested, if desired. | 537 | after the fact on the running kernel to be tested, if desired. |
540 | 538 | ||
539 | Say Y here if you want RCU torture tests to be built into | ||
540 | the kernel. | ||
541 | Say M if you want the RCU torture tests to build as a module. | 541 | Say M if you want the RCU torture tests to build as a module. |
542 | Say N if you are unsure. | 542 | Say N if you are unsure. |
543 | 543 | ||
544 | config RCU_TORTURE_TEST_RUNNABLE | ||
545 | bool "torture tests for RCU runnable by default" | ||
546 | depends on RCU_TORTURE_TEST = y | ||
547 | default n | ||
548 | help | ||
549 | This option provides a way to build the RCU torture tests | ||
550 | directly into the kernel without them starting up at boot | ||
551 | time. You can use /proc/sys/kernel/rcutorture_runnable | ||
552 | to manually override this setting. This /proc file is | ||
553 | available only when the RCU torture tests have been built | ||
554 | into the kernel. | ||
555 | |||
556 | Say Y here if you want the RCU torture tests to start during | ||
557 | boot (you probably don't). | ||
558 | Say N here if you want the RCU torture tests to start only | ||
559 | after being manually enabled via /proc. | ||
560 | |||
544 | config KPROBES_SANITY_TEST | 561 | config KPROBES_SANITY_TEST |
545 | bool "Kprobes sanity tests" | 562 | bool "Kprobes sanity tests" |
546 | depends on DEBUG_KERNEL | 563 | depends on DEBUG_KERNEL |
@@ -563,6 +580,9 @@ config BACKTRACE_SELF_TEST | |||
563 | for distributions or general kernels, but only for kernel | 580 | for distributions or general kernels, but only for kernel |
564 | developers working on architecture code. | 581 | developers working on architecture code. |
565 | 582 | ||
583 | Note that if you want to also test saved backtraces, you will | ||
584 | have to enable STACKTRACE as well. | ||
585 | |||
566 | Say N if you are unsure. | 586 | Say N if you are unsure. |
567 | 587 | ||
568 | config LKDTM | 588 | config LKDTM |
@@ -634,6 +654,8 @@ config LATENCYTOP | |||
634 | Enable this option if you want to use the LatencyTOP tool | 654 | Enable this option if you want to use the LatencyTOP tool |
635 | to find out which userspace is blocking on what kernel operations. | 655 | to find out which userspace is blocking on what kernel operations. |
636 | 656 | ||
657 | source kernel/trace/Kconfig | ||
658 | |||
637 | config PROVIDE_OHCI1394_DMA_INIT | 659 | config PROVIDE_OHCI1394_DMA_INIT |
638 | bool "Remote debugging over FireWire early on boot" | 660 | bool "Remote debugging over FireWire early on boot" |
639 | depends on PCI && X86 | 661 | depends on PCI && X86 |
diff --git a/lib/Makefile b/lib/Makefile index 74b0cfb1fcc3..818c4d455518 100644 --- a/lib/Makefile +++ b/lib/Makefile | |||
@@ -2,6 +2,11 @@ | |||
2 | # Makefile for some libs needed in the kernel. | 2 | # Makefile for some libs needed in the kernel. |
3 | # | 3 | # |
4 | 4 | ||
5 | ifdef CONFIG_FTRACE | ||
6 | ORIG_CFLAGS := $(KBUILD_CFLAGS) | ||
7 | KBUILD_CFLAGS = $(subst -pg,,$(ORIG_CFLAGS)) | ||
8 | endif | ||
9 | |||
5 | lib-y := ctype.o string.o vsprintf.o cmdline.o \ | 10 | lib-y := ctype.o string.o vsprintf.o cmdline.o \ |
6 | rbtree.o radix-tree.o dump_stack.o \ | 11 | rbtree.o radix-tree.o dump_stack.o \ |
7 | idr.o int_sqrt.o extable.o prio_tree.o \ | 12 | idr.o int_sqrt.o extable.o prio_tree.o \ |
@@ -45,6 +50,7 @@ endif | |||
45 | obj-$(CONFIG_BITREVERSE) += bitrev.o | 50 | obj-$(CONFIG_BITREVERSE) += bitrev.o |
46 | obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o | 51 | obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o |
47 | obj-$(CONFIG_CRC16) += crc16.o | 52 | obj-$(CONFIG_CRC16) += crc16.o |
53 | obj-$(CONFIG_CRC_T10DIF)+= crc-t10dif.o | ||
48 | obj-$(CONFIG_CRC_ITU_T) += crc-itu-t.o | 54 | obj-$(CONFIG_CRC_ITU_T) += crc-itu-t.o |
49 | obj-$(CONFIG_CRC32) += crc32.o | 55 | obj-$(CONFIG_CRC32) += crc32.o |
50 | obj-$(CONFIG_CRC7) += crc7.o | 56 | obj-$(CONFIG_CRC7) += crc7.o |
diff --git a/lib/crc-t10dif.c b/lib/crc-t10dif.c new file mode 100644 index 000000000000..fbbd66ed86cd --- /dev/null +++ b/lib/crc-t10dif.c | |||
@@ -0,0 +1,67 @@ | |||
1 | /* | ||
2 | * T10 Data Integrity Field CRC16 calculation | ||
3 | * | ||
4 | * Copyright (c) 2007 Oracle Corporation. All rights reserved. | ||
5 | * Written by Martin K. Petersen <martin.petersen@oracle.com> | ||
6 | * | ||
7 | * This source code is licensed under the GNU General Public License, | ||
8 | * Version 2. See the file COPYING for more details. | ||
9 | */ | ||
10 | |||
11 | #include <linux/types.h> | ||
12 | #include <linux/module.h> | ||
13 | #include <linux/crc-t10dif.h> | ||
14 | |||
15 | /* Table generated using the following polynomium: | ||
16 | * x^16 + x^15 + x^11 + x^9 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1 | ||
17 | * gt: 0x8bb7 | ||
18 | */ | ||
19 | static const __u16 t10_dif_crc_table[256] = { | ||
20 | 0x0000, 0x8BB7, 0x9CD9, 0x176E, 0xB205, 0x39B2, 0x2EDC, 0xA56B, | ||
21 | 0xEFBD, 0x640A, 0x7364, 0xF8D3, 0x5DB8, 0xD60F, 0xC161, 0x4AD6, | ||
22 | 0x54CD, 0xDF7A, 0xC814, 0x43A3, 0xE6C8, 0x6D7F, 0x7A11, 0xF1A6, | ||
23 | 0xBB70, 0x30C7, 0x27A9, 0xAC1E, 0x0975, 0x82C2, 0x95AC, 0x1E1B, | ||
24 | 0xA99A, 0x222D, 0x3543, 0xBEF4, 0x1B9F, 0x9028, 0x8746, 0x0CF1, | ||
25 | 0x4627, 0xCD90, 0xDAFE, 0x5149, 0xF422, 0x7F95, 0x68FB, 0xE34C, | ||
26 | 0xFD57, 0x76E0, 0x618E, 0xEA39, 0x4F52, 0xC4E5, 0xD38B, 0x583C, | ||
27 | 0x12EA, 0x995D, 0x8E33, 0x0584, 0xA0EF, 0x2B58, 0x3C36, 0xB781, | ||
28 | 0xD883, 0x5334, 0x445A, 0xCFED, 0x6A86, 0xE131, 0xF65F, 0x7DE8, | ||
29 | 0x373E, 0xBC89, 0xABE7, 0x2050, 0x853B, 0x0E8C, 0x19E2, 0x9255, | ||
30 | 0x8C4E, 0x07F9, 0x1097, 0x9B20, 0x3E4B, 0xB5FC, 0xA292, 0x2925, | ||
31 | 0x63F3, 0xE844, 0xFF2A, 0x749D, 0xD1F6, 0x5A41, 0x4D2F, 0xC698, | ||
32 | 0x7119, 0xFAAE, 0xEDC0, 0x6677, 0xC31C, 0x48AB, 0x5FC5, 0xD472, | ||
33 | 0x9EA4, 0x1513, 0x027D, 0x89CA, 0x2CA1, 0xA716, 0xB078, 0x3BCF, | ||
34 | 0x25D4, 0xAE63, 0xB90D, 0x32BA, 0x97D1, 0x1C66, 0x0B08, 0x80BF, | ||
35 | 0xCA69, 0x41DE, 0x56B0, 0xDD07, 0x786C, 0xF3DB, 0xE4B5, 0x6F02, | ||
36 | 0x3AB1, 0xB106, 0xA668, 0x2DDF, 0x88B4, 0x0303, 0x146D, 0x9FDA, | ||
37 | 0xD50C, 0x5EBB, 0x49D5, 0xC262, 0x6709, 0xECBE, 0xFBD0, 0x7067, | ||
38 | 0x6E7C, 0xE5CB, 0xF2A5, 0x7912, 0xDC79, 0x57CE, 0x40A0, 0xCB17, | ||
39 | 0x81C1, 0x0A76, 0x1D18, 0x96AF, 0x33C4, 0xB873, 0xAF1D, 0x24AA, | ||
40 | 0x932B, 0x189C, 0x0FF2, 0x8445, 0x212E, 0xAA99, 0xBDF7, 0x3640, | ||
41 | 0x7C96, 0xF721, 0xE04F, 0x6BF8, 0xCE93, 0x4524, 0x524A, 0xD9FD, | ||
42 | 0xC7E6, 0x4C51, 0x5B3F, 0xD088, 0x75E3, 0xFE54, 0xE93A, 0x628D, | ||
43 | 0x285B, 0xA3EC, 0xB482, 0x3F35, 0x9A5E, 0x11E9, 0x0687, 0x8D30, | ||
44 | 0xE232, 0x6985, 0x7EEB, 0xF55C, 0x5037, 0xDB80, 0xCCEE, 0x4759, | ||
45 | 0x0D8F, 0x8638, 0x9156, 0x1AE1, 0xBF8A, 0x343D, 0x2353, 0xA8E4, | ||
46 | 0xB6FF, 0x3D48, 0x2A26, 0xA191, 0x04FA, 0x8F4D, 0x9823, 0x1394, | ||
47 | 0x5942, 0xD2F5, 0xC59B, 0x4E2C, 0xEB47, 0x60F0, 0x779E, 0xFC29, | ||
48 | 0x4BA8, 0xC01F, 0xD771, 0x5CC6, 0xF9AD, 0x721A, 0x6574, 0xEEC3, | ||
49 | 0xA415, 0x2FA2, 0x38CC, 0xB37B, 0x1610, 0x9DA7, 0x8AC9, 0x017E, | ||
50 | 0x1F65, 0x94D2, 0x83BC, 0x080B, 0xAD60, 0x26D7, 0x31B9, 0xBA0E, | ||
51 | 0xF0D8, 0x7B6F, 0x6C01, 0xE7B6, 0x42DD, 0xC96A, 0xDE04, 0x55B3 | ||
52 | }; | ||
53 | |||
54 | __u16 crc_t10dif(const unsigned char *buffer, size_t len) | ||
55 | { | ||
56 | __u16 crc = 0; | ||
57 | unsigned int i; | ||
58 | |||
59 | for (i = 0 ; i < len ; i++) | ||
60 | crc = (crc << 8) ^ t10_dif_crc_table[((crc >> 8) ^ buffer[i]) & 0xff]; | ||
61 | |||
62 | return crc; | ||
63 | } | ||
64 | EXPORT_SYMBOL(crc_t10dif); | ||
65 | |||
66 | MODULE_DESCRIPTION("T10 DIF CRC calculation"); | ||
67 | MODULE_LICENSE("GPL"); | ||
diff --git a/lib/kobject.c b/lib/kobject.c index 718e5101c263..dcade0543bd2 100644 --- a/lib/kobject.c +++ b/lib/kobject.c | |||
@@ -439,6 +439,7 @@ out: | |||
439 | 439 | ||
440 | return error; | 440 | return error; |
441 | } | 441 | } |
442 | EXPORT_SYMBOL_GPL(kobject_rename); | ||
442 | 443 | ||
443 | /** | 444 | /** |
444 | * kobject_move - move object to another parent | 445 | * kobject_move - move object to another parent |
diff --git a/lib/percpu_counter.c b/lib/percpu_counter.c index 119174494cb5..4a8ba4bf5f6f 100644 --- a/lib/percpu_counter.c +++ b/lib/percpu_counter.c | |||
@@ -52,7 +52,7 @@ EXPORT_SYMBOL(__percpu_counter_add); | |||
52 | * Add up all the per-cpu counts, return the result. This is a more accurate | 52 | * Add up all the per-cpu counts, return the result. This is a more accurate |
53 | * but much slower version of percpu_counter_read_positive() | 53 | * but much slower version of percpu_counter_read_positive() |
54 | */ | 54 | */ |
55 | s64 __percpu_counter_sum(struct percpu_counter *fbc) | 55 | s64 __percpu_counter_sum(struct percpu_counter *fbc, int set) |
56 | { | 56 | { |
57 | s64 ret; | 57 | s64 ret; |
58 | int cpu; | 58 | int cpu; |
@@ -62,7 +62,12 @@ s64 __percpu_counter_sum(struct percpu_counter *fbc) | |||
62 | for_each_online_cpu(cpu) { | 62 | for_each_online_cpu(cpu) { |
63 | s32 *pcount = per_cpu_ptr(fbc->counters, cpu); | 63 | s32 *pcount = per_cpu_ptr(fbc->counters, cpu); |
64 | ret += *pcount; | 64 | ret += *pcount; |
65 | if (set) | ||
66 | *pcount = 0; | ||
65 | } | 67 | } |
68 | if (set) | ||
69 | fbc->count = ret; | ||
70 | |||
66 | spin_unlock(&fbc->lock); | 71 | spin_unlock(&fbc->lock); |
67 | return ret; | 72 | return ret; |
68 | } | 73 | } |
diff --git a/lib/smp_processor_id.c b/lib/smp_processor_id.c index 6c90fb90e19c..3b4dc098181e 100644 --- a/lib/smp_processor_id.c +++ b/lib/smp_processor_id.c | |||
@@ -7,7 +7,7 @@ | |||
7 | #include <linux/kallsyms.h> | 7 | #include <linux/kallsyms.h> |
8 | #include <linux/sched.h> | 8 | #include <linux/sched.h> |
9 | 9 | ||
10 | unsigned int debug_smp_processor_id(void) | 10 | notrace unsigned int debug_smp_processor_id(void) |
11 | { | 11 | { |
12 | unsigned long preempt_count = preempt_count(); | 12 | unsigned long preempt_count = preempt_count(); |
13 | int this_cpu = raw_smp_processor_id(); | 13 | int this_cpu = raw_smp_processor_id(); |
@@ -37,7 +37,7 @@ unsigned int debug_smp_processor_id(void) | |||
37 | /* | 37 | /* |
38 | * Avoid recursion: | 38 | * Avoid recursion: |
39 | */ | 39 | */ |
40 | preempt_disable(); | 40 | preempt_disable_notrace(); |
41 | 41 | ||
42 | if (!printk_ratelimit()) | 42 | if (!printk_ratelimit()) |
43 | goto out_enable; | 43 | goto out_enable; |
@@ -49,7 +49,7 @@ unsigned int debug_smp_processor_id(void) | |||
49 | dump_stack(); | 49 | dump_stack(); |
50 | 50 | ||
51 | out_enable: | 51 | out_enable: |
52 | preempt_enable_no_resched(); | 52 | preempt_enable_no_resched_notrace(); |
53 | out: | 53 | out: |
54 | return this_cpu; | 54 | return this_cpu; |
55 | } | 55 | } |
diff --git a/lib/textsearch.c b/lib/textsearch.c index be8bda3862f5..4b7c6075256f 100644 --- a/lib/textsearch.c +++ b/lib/textsearch.c | |||
@@ -54,10 +54,13 @@ | |||
54 | * USAGE | 54 | * USAGE |
55 | * | 55 | * |
56 | * Before a search can be performed, a configuration must be created | 56 | * Before a search can be performed, a configuration must be created |
57 | * by calling textsearch_prepare() specyfing the searching algorithm and | 57 | * by calling textsearch_prepare() specifying the searching algorithm, |
58 | * the pattern to look for. The returned configuration may then be used | 58 | * the pattern to look for and flags. As a flag, you can set TS_IGNORECASE |
59 | * for an arbitary amount of times and even in parallel as long as a | 59 | * to perform case insensitive matching. But it might slow down |
60 | * separate struct ts_state variable is provided to every instance. | 60 | * performance of algorithm, so you should use it at own your risk. |
61 | * The returned configuration may then be used for an arbitary | ||
62 | * amount of times and even in parallel as long as a separate struct | ||
63 | * ts_state variable is provided to every instance. | ||
61 | * | 64 | * |
62 | * The actual search is performed by either calling textsearch_find_- | 65 | * The actual search is performed by either calling textsearch_find_- |
63 | * continuous() for linear data or by providing an own get_next_block() | 66 | * continuous() for linear data or by providing an own get_next_block() |
@@ -89,7 +92,6 @@ | |||
89 | * panic("Oh my god, dancing chickens at %d\n", pos); | 92 | * panic("Oh my god, dancing chickens at %d\n", pos); |
90 | * | 93 | * |
91 | * textsearch_destroy(conf); | 94 | * textsearch_destroy(conf); |
92 | * | ||
93 | * ========================================================================== | 95 | * ========================================================================== |
94 | */ | 96 | */ |
95 | 97 | ||
@@ -97,6 +99,7 @@ | |||
97 | #include <linux/types.h> | 99 | #include <linux/types.h> |
98 | #include <linux/string.h> | 100 | #include <linux/string.h> |
99 | #include <linux/init.h> | 101 | #include <linux/init.h> |
102 | #include <linux/rculist.h> | ||
100 | #include <linux/rcupdate.h> | 103 | #include <linux/rcupdate.h> |
101 | #include <linux/err.h> | 104 | #include <linux/err.h> |
102 | #include <linux/textsearch.h> | 105 | #include <linux/textsearch.h> |
@@ -279,7 +282,7 @@ struct ts_config *textsearch_prepare(const char *algo, const void *pattern, | |||
279 | if (ops == NULL) | 282 | if (ops == NULL) |
280 | goto errout; | 283 | goto errout; |
281 | 284 | ||
282 | conf = ops->init(pattern, len, gfp_mask); | 285 | conf = ops->init(pattern, len, gfp_mask, flags); |
283 | if (IS_ERR(conf)) { | 286 | if (IS_ERR(conf)) { |
284 | err = PTR_ERR(conf); | 287 | err = PTR_ERR(conf); |
285 | goto errout; | 288 | goto errout; |
diff --git a/lib/ts_bm.c b/lib/ts_bm.c index 4a7fce72898e..9e66ee4020e9 100644 --- a/lib/ts_bm.c +++ b/lib/ts_bm.c | |||
@@ -39,6 +39,7 @@ | |||
39 | #include <linux/module.h> | 39 | #include <linux/module.h> |
40 | #include <linux/types.h> | 40 | #include <linux/types.h> |
41 | #include <linux/string.h> | 41 | #include <linux/string.h> |
42 | #include <linux/ctype.h> | ||
42 | #include <linux/textsearch.h> | 43 | #include <linux/textsearch.h> |
43 | 44 | ||
44 | /* Alphabet size, use ASCII */ | 45 | /* Alphabet size, use ASCII */ |
@@ -64,6 +65,7 @@ static unsigned int bm_find(struct ts_config *conf, struct ts_state *state) | |||
64 | unsigned int i, text_len, consumed = state->offset; | 65 | unsigned int i, text_len, consumed = state->offset; |
65 | const u8 *text; | 66 | const u8 *text; |
66 | int shift = bm->patlen - 1, bs; | 67 | int shift = bm->patlen - 1, bs; |
68 | const u8 icase = conf->flags & TS_IGNORECASE; | ||
67 | 69 | ||
68 | for (;;) { | 70 | for (;;) { |
69 | text_len = conf->get_next_block(consumed, &text, conf, state); | 71 | text_len = conf->get_next_block(consumed, &text, conf, state); |
@@ -75,7 +77,9 @@ static unsigned int bm_find(struct ts_config *conf, struct ts_state *state) | |||
75 | DEBUGP("Searching in position %d (%c)\n", | 77 | DEBUGP("Searching in position %d (%c)\n", |
76 | shift, text[shift]); | 78 | shift, text[shift]); |
77 | for (i = 0; i < bm->patlen; i++) | 79 | for (i = 0; i < bm->patlen; i++) |
78 | if (text[shift-i] != bm->pattern[bm->patlen-1-i]) | 80 | if ((icase ? toupper(text[shift-i]) |
81 | : text[shift-i]) | ||
82 | != bm->pattern[bm->patlen-1-i]) | ||
79 | goto next; | 83 | goto next; |
80 | 84 | ||
81 | /* London calling... */ | 85 | /* London calling... */ |
@@ -111,14 +115,18 @@ static int subpattern(u8 *pattern, int i, int j, int g) | |||
111 | return ret; | 115 | return ret; |
112 | } | 116 | } |
113 | 117 | ||
114 | static void compute_prefix_tbl(struct ts_bm *bm) | 118 | static void compute_prefix_tbl(struct ts_bm *bm, int flags) |
115 | { | 119 | { |
116 | int i, j, g; | 120 | int i, j, g; |
117 | 121 | ||
118 | for (i = 0; i < ASIZE; i++) | 122 | for (i = 0; i < ASIZE; i++) |
119 | bm->bad_shift[i] = bm->patlen; | 123 | bm->bad_shift[i] = bm->patlen; |
120 | for (i = 0; i < bm->patlen - 1; i++) | 124 | for (i = 0; i < bm->patlen - 1; i++) { |
121 | bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; | 125 | bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; |
126 | if (flags & TS_IGNORECASE) | ||
127 | bm->bad_shift[tolower(bm->pattern[i])] | ||
128 | = bm->patlen - 1 - i; | ||
129 | } | ||
122 | 130 | ||
123 | /* Compute the good shift array, used to match reocurrences | 131 | /* Compute the good shift array, used to match reocurrences |
124 | * of a subpattern */ | 132 | * of a subpattern */ |
@@ -135,10 +143,11 @@ static void compute_prefix_tbl(struct ts_bm *bm) | |||
135 | } | 143 | } |
136 | 144 | ||
137 | static struct ts_config *bm_init(const void *pattern, unsigned int len, | 145 | static struct ts_config *bm_init(const void *pattern, unsigned int len, |
138 | gfp_t gfp_mask) | 146 | gfp_t gfp_mask, int flags) |
139 | { | 147 | { |
140 | struct ts_config *conf; | 148 | struct ts_config *conf; |
141 | struct ts_bm *bm; | 149 | struct ts_bm *bm; |
150 | int i; | ||
142 | unsigned int prefix_tbl_len = len * sizeof(unsigned int); | 151 | unsigned int prefix_tbl_len = len * sizeof(unsigned int); |
143 | size_t priv_size = sizeof(*bm) + len + prefix_tbl_len; | 152 | size_t priv_size = sizeof(*bm) + len + prefix_tbl_len; |
144 | 153 | ||
@@ -146,11 +155,16 @@ static struct ts_config *bm_init(const void *pattern, unsigned int len, | |||
146 | if (IS_ERR(conf)) | 155 | if (IS_ERR(conf)) |
147 | return conf; | 156 | return conf; |
148 | 157 | ||
158 | conf->flags = flags; | ||
149 | bm = ts_config_priv(conf); | 159 | bm = ts_config_priv(conf); |
150 | bm->patlen = len; | 160 | bm->patlen = len; |
151 | bm->pattern = (u8 *) bm->good_shift + prefix_tbl_len; | 161 | bm->pattern = (u8 *) bm->good_shift + prefix_tbl_len; |
152 | memcpy(bm->pattern, pattern, len); | 162 | if (flags & TS_IGNORECASE) |
153 | compute_prefix_tbl(bm); | 163 | for (i = 0; i < len; i++) |
164 | bm->pattern[i] = toupper(((u8 *)pattern)[i]); | ||
165 | else | ||
166 | memcpy(bm->pattern, pattern, len); | ||
167 | compute_prefix_tbl(bm, flags); | ||
154 | 168 | ||
155 | return conf; | 169 | return conf; |
156 | } | 170 | } |
diff --git a/lib/ts_fsm.c b/lib/ts_fsm.c index af575b61526b..5696a35184e4 100644 --- a/lib/ts_fsm.c +++ b/lib/ts_fsm.c | |||
@@ -257,7 +257,7 @@ found_match: | |||
257 | } | 257 | } |
258 | 258 | ||
259 | static struct ts_config *fsm_init(const void *pattern, unsigned int len, | 259 | static struct ts_config *fsm_init(const void *pattern, unsigned int len, |
260 | gfp_t gfp_mask) | 260 | gfp_t gfp_mask, int flags) |
261 | { | 261 | { |
262 | int i, err = -EINVAL; | 262 | int i, err = -EINVAL; |
263 | struct ts_config *conf; | 263 | struct ts_config *conf; |
@@ -269,6 +269,9 @@ static struct ts_config *fsm_init(const void *pattern, unsigned int len, | |||
269 | if (len % sizeof(struct ts_fsm_token) || ntokens < 1) | 269 | if (len % sizeof(struct ts_fsm_token) || ntokens < 1) |
270 | goto errout; | 270 | goto errout; |
271 | 271 | ||
272 | if (flags & TS_IGNORECASE) | ||
273 | goto errout; | ||
274 | |||
272 | for (i = 0; i < ntokens; i++) { | 275 | for (i = 0; i < ntokens; i++) { |
273 | struct ts_fsm_token *t = &tokens[i]; | 276 | struct ts_fsm_token *t = &tokens[i]; |
274 | 277 | ||
@@ -284,6 +287,7 @@ static struct ts_config *fsm_init(const void *pattern, unsigned int len, | |||
284 | if (IS_ERR(conf)) | 287 | if (IS_ERR(conf)) |
285 | return conf; | 288 | return conf; |
286 | 289 | ||
290 | conf->flags = flags; | ||
287 | fsm = ts_config_priv(conf); | 291 | fsm = ts_config_priv(conf); |
288 | fsm->ntokens = ntokens; | 292 | fsm->ntokens = ntokens; |
289 | memcpy(fsm->tokens, pattern, len); | 293 | memcpy(fsm->tokens, pattern, len); |
diff --git a/lib/ts_kmp.c b/lib/ts_kmp.c index 3ced628cab4b..632f783e65f1 100644 --- a/lib/ts_kmp.c +++ b/lib/ts_kmp.c | |||
@@ -33,6 +33,7 @@ | |||
33 | #include <linux/module.h> | 33 | #include <linux/module.h> |
34 | #include <linux/types.h> | 34 | #include <linux/types.h> |
35 | #include <linux/string.h> | 35 | #include <linux/string.h> |
36 | #include <linux/ctype.h> | ||
36 | #include <linux/textsearch.h> | 37 | #include <linux/textsearch.h> |
37 | 38 | ||
38 | struct ts_kmp | 39 | struct ts_kmp |
@@ -47,6 +48,7 @@ static unsigned int kmp_find(struct ts_config *conf, struct ts_state *state) | |||
47 | struct ts_kmp *kmp = ts_config_priv(conf); | 48 | struct ts_kmp *kmp = ts_config_priv(conf); |
48 | unsigned int i, q = 0, text_len, consumed = state->offset; | 49 | unsigned int i, q = 0, text_len, consumed = state->offset; |
49 | const u8 *text; | 50 | const u8 *text; |
51 | const int icase = conf->flags & TS_IGNORECASE; | ||
50 | 52 | ||
51 | for (;;) { | 53 | for (;;) { |
52 | text_len = conf->get_next_block(consumed, &text, conf, state); | 54 | text_len = conf->get_next_block(consumed, &text, conf, state); |
@@ -55,9 +57,11 @@ static unsigned int kmp_find(struct ts_config *conf, struct ts_state *state) | |||
55 | break; | 57 | break; |
56 | 58 | ||
57 | for (i = 0; i < text_len; i++) { | 59 | for (i = 0; i < text_len; i++) { |
58 | while (q > 0 && kmp->pattern[q] != text[i]) | 60 | while (q > 0 && kmp->pattern[q] |
61 | != (icase ? toupper(text[i]) : text[i])) | ||
59 | q = kmp->prefix_tbl[q - 1]; | 62 | q = kmp->prefix_tbl[q - 1]; |
60 | if (kmp->pattern[q] == text[i]) | 63 | if (kmp->pattern[q] |
64 | == (icase ? toupper(text[i]) : text[i])) | ||
61 | q++; | 65 | q++; |
62 | if (unlikely(q == kmp->pattern_len)) { | 66 | if (unlikely(q == kmp->pattern_len)) { |
63 | state->offset = consumed + i + 1; | 67 | state->offset = consumed + i + 1; |
@@ -72,24 +76,28 @@ static unsigned int kmp_find(struct ts_config *conf, struct ts_state *state) | |||
72 | } | 76 | } |
73 | 77 | ||
74 | static inline void compute_prefix_tbl(const u8 *pattern, unsigned int len, | 78 | static inline void compute_prefix_tbl(const u8 *pattern, unsigned int len, |
75 | unsigned int *prefix_tbl) | 79 | unsigned int *prefix_tbl, int flags) |
76 | { | 80 | { |
77 | unsigned int k, q; | 81 | unsigned int k, q; |
82 | const u8 icase = flags & TS_IGNORECASE; | ||
78 | 83 | ||
79 | for (k = 0, q = 1; q < len; q++) { | 84 | for (k = 0, q = 1; q < len; q++) { |
80 | while (k > 0 && pattern[k] != pattern[q]) | 85 | while (k > 0 && (icase ? toupper(pattern[k]) : pattern[k]) |
86 | != (icase ? toupper(pattern[q]) : pattern[q])) | ||
81 | k = prefix_tbl[k-1]; | 87 | k = prefix_tbl[k-1]; |
82 | if (pattern[k] == pattern[q]) | 88 | if ((icase ? toupper(pattern[k]) : pattern[k]) |
89 | == (icase ? toupper(pattern[q]) : pattern[q])) | ||
83 | k++; | 90 | k++; |
84 | prefix_tbl[q] = k; | 91 | prefix_tbl[q] = k; |
85 | } | 92 | } |
86 | } | 93 | } |
87 | 94 | ||
88 | static struct ts_config *kmp_init(const void *pattern, unsigned int len, | 95 | static struct ts_config *kmp_init(const void *pattern, unsigned int len, |
89 | gfp_t gfp_mask) | 96 | gfp_t gfp_mask, int flags) |
90 | { | 97 | { |
91 | struct ts_config *conf; | 98 | struct ts_config *conf; |
92 | struct ts_kmp *kmp; | 99 | struct ts_kmp *kmp; |
100 | int i; | ||
93 | unsigned int prefix_tbl_len = len * sizeof(unsigned int); | 101 | unsigned int prefix_tbl_len = len * sizeof(unsigned int); |
94 | size_t priv_size = sizeof(*kmp) + len + prefix_tbl_len; | 102 | size_t priv_size = sizeof(*kmp) + len + prefix_tbl_len; |
95 | 103 | ||
@@ -97,11 +105,16 @@ static struct ts_config *kmp_init(const void *pattern, unsigned int len, | |||
97 | if (IS_ERR(conf)) | 105 | if (IS_ERR(conf)) |
98 | return conf; | 106 | return conf; |
99 | 107 | ||
108 | conf->flags = flags; | ||
100 | kmp = ts_config_priv(conf); | 109 | kmp = ts_config_priv(conf); |
101 | kmp->pattern_len = len; | 110 | kmp->pattern_len = len; |
102 | compute_prefix_tbl(pattern, len, kmp->prefix_tbl); | 111 | compute_prefix_tbl(pattern, len, kmp->prefix_tbl, flags); |
103 | kmp->pattern = (u8 *) kmp->prefix_tbl + prefix_tbl_len; | 112 | kmp->pattern = (u8 *) kmp->prefix_tbl + prefix_tbl_len; |
104 | memcpy(kmp->pattern, pattern, len); | 113 | if (flags & TS_IGNORECASE) |
114 | for (i = 0; i < len; i++) | ||
115 | kmp->pattern[i] = toupper(((u8 *)pattern)[i]); | ||
116 | else | ||
117 | memcpy(kmp->pattern, pattern, len); | ||
105 | 118 | ||
106 | return conf; | 119 | return conf; |
107 | } | 120 | } |
diff --git a/lib/vsprintf.c b/lib/vsprintf.c index 6021757a4496..1dc2d1d18fa8 100644 --- a/lib/vsprintf.c +++ b/lib/vsprintf.c | |||
@@ -22,6 +22,8 @@ | |||
22 | #include <linux/string.h> | 22 | #include <linux/string.h> |
23 | #include <linux/ctype.h> | 23 | #include <linux/ctype.h> |
24 | #include <linux/kernel.h> | 24 | #include <linux/kernel.h> |
25 | #include <linux/kallsyms.h> | ||
26 | #include <linux/uaccess.h> | ||
25 | 27 | ||
26 | #include <asm/page.h> /* for PAGE_SIZE */ | 28 | #include <asm/page.h> /* for PAGE_SIZE */ |
27 | #include <asm/div64.h> | 29 | #include <asm/div64.h> |
@@ -482,6 +484,89 @@ static char *number(char *buf, char *end, unsigned long long num, int base, int | |||
482 | return buf; | 484 | return buf; |
483 | } | 485 | } |
484 | 486 | ||
487 | static char *string(char *buf, char *end, char *s, int field_width, int precision, int flags) | ||
488 | { | ||
489 | int len, i; | ||
490 | |||
491 | if ((unsigned long)s < PAGE_SIZE) | ||
492 | s = "<NULL>"; | ||
493 | |||
494 | len = strnlen(s, precision); | ||
495 | |||
496 | if (!(flags & LEFT)) { | ||
497 | while (len < field_width--) { | ||
498 | if (buf < end) | ||
499 | *buf = ' '; | ||
500 | ++buf; | ||
501 | } | ||
502 | } | ||
503 | for (i = 0; i < len; ++i) { | ||
504 | if (buf < end) | ||
505 | *buf = *s; | ||
506 | ++buf; ++s; | ||
507 | } | ||
508 | while (len < field_width--) { | ||
509 | if (buf < end) | ||
510 | *buf = ' '; | ||
511 | ++buf; | ||
512 | } | ||
513 | return buf; | ||
514 | } | ||
515 | |||
516 | static inline void *dereference_function_descriptor(void *ptr) | ||
517 | { | ||
518 | #if defined(CONFIG_IA64) || defined(CONFIG_PPC64) | ||
519 | void *p; | ||
520 | if (!probe_kernel_address(ptr, p)) | ||
521 | ptr = p; | ||
522 | #endif | ||
523 | return ptr; | ||
524 | } | ||
525 | |||
526 | static char *symbol_string(char *buf, char *end, void *ptr, int field_width, int precision, int flags) | ||
527 | { | ||
528 | unsigned long value = (unsigned long) ptr; | ||
529 | #ifdef CONFIG_KALLSYMS | ||
530 | char sym[KSYM_SYMBOL_LEN]; | ||
531 | sprint_symbol(sym, value); | ||
532 | return string(buf, end, sym, field_width, precision, flags); | ||
533 | #else | ||
534 | field_width = 2*sizeof(void *); | ||
535 | flags |= SPECIAL | SMALL | ZEROPAD; | ||
536 | return number(buf, end, value, 16, field_width, precision, flags); | ||
537 | #endif | ||
538 | } | ||
539 | |||
540 | /* | ||
541 | * Show a '%p' thing. A kernel extension is that the '%p' is followed | ||
542 | * by an extra set of alphanumeric characters that are extended format | ||
543 | * specifiers. | ||
544 | * | ||
545 | * Right now we just handle 'F' (for symbolic Function descriptor pointers) | ||
546 | * and 'S' (for Symbolic direct pointers), but this can easily be | ||
547 | * extended in the future (network address types etc). | ||
548 | * | ||
549 | * The difference between 'S' and 'F' is that on ia64 and ppc64 function | ||
550 | * pointers are really function descriptors, which contain a pointer the | ||
551 | * real address. | ||
552 | */ | ||
553 | static char *pointer(const char *fmt, char *buf, char *end, void *ptr, int field_width, int precision, int flags) | ||
554 | { | ||
555 | switch (*fmt) { | ||
556 | case 'F': | ||
557 | ptr = dereference_function_descriptor(ptr); | ||
558 | /* Fallthrough */ | ||
559 | case 'S': | ||
560 | return symbol_string(buf, end, ptr, field_width, precision, flags); | ||
561 | } | ||
562 | flags |= SMALL; | ||
563 | if (field_width == -1) { | ||
564 | field_width = 2*sizeof(void *); | ||
565 | flags |= ZEROPAD; | ||
566 | } | ||
567 | return number(buf, end, (unsigned long) ptr, 16, field_width, precision, flags); | ||
568 | } | ||
569 | |||
485 | /** | 570 | /** |
486 | * vsnprintf - Format a string and place it in a buffer | 571 | * vsnprintf - Format a string and place it in a buffer |
487 | * @buf: The buffer to place the result into | 572 | * @buf: The buffer to place the result into |
@@ -502,11 +587,9 @@ static char *number(char *buf, char *end, unsigned long long num, int base, int | |||
502 | */ | 587 | */ |
503 | int vsnprintf(char *buf, size_t size, const char *fmt, va_list args) | 588 | int vsnprintf(char *buf, size_t size, const char *fmt, va_list args) |
504 | { | 589 | { |
505 | int len; | ||
506 | unsigned long long num; | 590 | unsigned long long num; |
507 | int i, base; | 591 | int base; |
508 | char *str, *end, c; | 592 | char *str, *end, c; |
509 | const char *s; | ||
510 | 593 | ||
511 | int flags; /* flags to number() */ | 594 | int flags; /* flags to number() */ |
512 | 595 | ||
@@ -622,43 +705,18 @@ int vsnprintf(char *buf, size_t size, const char *fmt, va_list args) | |||
622 | continue; | 705 | continue; |
623 | 706 | ||
624 | case 's': | 707 | case 's': |
625 | s = va_arg(args, char *); | 708 | str = string(str, end, va_arg(args, char *), field_width, precision, flags); |
626 | if ((unsigned long)s < PAGE_SIZE) | ||
627 | s = "<NULL>"; | ||
628 | |||
629 | len = strnlen(s, precision); | ||
630 | |||
631 | if (!(flags & LEFT)) { | ||
632 | while (len < field_width--) { | ||
633 | if (str < end) | ||
634 | *str = ' '; | ||
635 | ++str; | ||
636 | } | ||
637 | } | ||
638 | for (i = 0; i < len; ++i) { | ||
639 | if (str < end) | ||
640 | *str = *s; | ||
641 | ++str; ++s; | ||
642 | } | ||
643 | while (len < field_width--) { | ||
644 | if (str < end) | ||
645 | *str = ' '; | ||
646 | ++str; | ||
647 | } | ||
648 | continue; | 709 | continue; |
649 | 710 | ||
650 | case 'p': | 711 | case 'p': |
651 | flags |= SMALL; | 712 | str = pointer(fmt+1, str, end, |
652 | if (field_width == -1) { | 713 | va_arg(args, void *), |
653 | field_width = 2*sizeof(void *); | 714 | field_width, precision, flags); |
654 | flags |= ZEROPAD; | 715 | /* Skip all alphanumeric pointer suffixes */ |
655 | } | 716 | while (isalnum(fmt[1])) |
656 | str = number(str, end, | 717 | fmt++; |
657 | (unsigned long) va_arg(args, void *), | ||
658 | 16, field_width, precision, flags); | ||
659 | continue; | 718 | continue; |
660 | 719 | ||
661 | |||
662 | case 'n': | 720 | case 'n': |
663 | /* FIXME: | 721 | /* FIXME: |
664 | * What does C99 say about the overflow case here? */ | 722 | * What does C99 say about the overflow case here? */ |