12 files changed, 299 insertions, 84 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
           the kernel tree does. Such modules that use library CRC16
           functions require M here.
 
+config CRC_T10DIF
+        tristate "CRC calculation for the T10 Data Integrity Field"
+        help
+          This option is only needed if a module that's not in the
+          kernel tree needs to calculate CRC checks for use with the
+          SCSI data integrity subsystem.
+
 config CRC_ITU_T
         tristate "CRC ITU-T V.41 functions"
         help
diff --git a/lib/Kconfig.debug b/lib/Kconfig.debug
index 011e00bcfc30..882c51048993 100644
--- a/lib/Kconfig.debug
+++ b/lib/Kconfig.debug
@@ -74,6 +74,9 @@ config DEBUG_FS
           debugging files into.  Enable this option to be able to read and
           write to these files.
 
+          For detailed documentation on the debugfs API, see
+          Documentation/DocBook/filesystems.
+
           If unsure, say N.
 
 config HEADERS_CHECK
@@ -554,16 +557,34 @@ config BOOT_PRINTK_DELAY
 config RCU_TORTURE_TEST
         tristate "torture tests for RCU"
         depends on DEBUG_KERNEL
-        depends on m
         default n
         help
           This option provides a kernel module that runs torture tests
           on the RCU infrastructure.  The kernel module may be built
           after the fact on the running kernel to be tested, if desired.
 
+          Say Y here if you want RCU torture tests to be built into
+          the kernel.
           Say M if you want the RCU torture tests to build as a module.
           Say N if you are unsure.
 
+config RCU_TORTURE_TEST_RUNNABLE
+        bool "torture tests for RCU runnable by default"
+        depends on RCU_TORTURE_TEST = y
+        default n
+        help
+          This option provides a way to build the RCU torture tests
+          directly into the kernel without them starting up at boot
+          time.  You can use /proc/sys/kernel/rcutorture_runnable
+          to manually override this setting.  This /proc file is
+          available only when the RCU torture tests have been built
+          into the kernel.
+
+          Say Y here if you want the RCU torture tests to start during
+          boot (you probably don't).
+          Say N here if you want the RCU torture tests to start only
+          after being manually enabled via /proc.
+
 config KPROBES_SANITY_TEST
         bool "Kprobes sanity tests"
         depends on DEBUG_KERNEL
diff --git a/lib/Kconfig.kgdb b/lib/Kconfig.kgdb
index a5d4b1dac2a5..2cfd2721f7ed 100644
--- a/lib/Kconfig.kgdb
+++ b/lib/Kconfig.kgdb
@@ -1,7 +1,4 @@
 
-config HAVE_ARCH_KGDB_SHADOW_INFO
-        bool
-
 config HAVE_ARCH_KGDB
         bool
 
diff --git a/lib/Makefile b/lib/Makefile
index 4b836a53c08f..818c4d455518 100644
--- a/lib/Makefile
+++ b/lib/Makefile
@@ -2,21 +2,17 @@
 # Makefile for some libs needed in the kernel.
 #
 
+ifdef CONFIG_FTRACE
+ORIG_CFLAGS := $(KBUILD_CFLAGS)
+KBUILD_CFLAGS = $(subst -pg,,$(ORIG_CFLAGS))
+endif
+
 lib-y := ctype.o string.o vsprintf.o cmdline.o \
          rbtree.o radix-tree.o dump_stack.o \
          idr.o int_sqrt.o extable.o prio_tree.o \
          sha1.o irq_regs.o reciprocal_div.o argv_split.o \
          proportions.o prio_heap.o ratelimit.o
 
-ifdef CONFIG_FTRACE
-# Do not profile string.o, since it may be used in early boot or vdso
-CFLAGS_REMOVE_string.o = -pg
-# Also do not profile any debug utilities
-CFLAGS_REMOVE_spinlock_debug.o = -pg
-CFLAGS_REMOVE_list_debug.o = -pg
-CFLAGS_REMOVE_debugobjects.o = -pg
-endif
-
 lib-$(CONFIG_MMU) += ioremap.o
 lib-$(CONFIG_SMP) += cpumask.o
 
@@ -54,6 +50,7 @@ endif
 obj-$(CONFIG_BITREVERSE) += bitrev.o
 obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o
 obj-$(CONFIG_CRC16)     += crc16.o
+obj-$(CONFIG_CRC_T10DIF)+= crc-t10dif.o
 obj-$(CONFIG_CRC_ITU_T) += crc-itu-t.o
 obj-$(CONFIG_CRC32)     += crc32.o
 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 @@
+/*
+ * T10 Data Integrity Field CRC16 calculation
+ *
+ * Copyright (c) 2007 Oracle Corporation.  All rights reserved.
+ * Written by Martin K. Petersen <martin.petersen@oracle.com>
+ *
+ * This source code is licensed under the GNU General Public License,
+ * Version 2. See the file COPYING for more details.
+ */
+
+#include <linux/types.h>
+#include <linux/module.h>
+#include <linux/crc-t10dif.h>
+
+/* Table generated using the following polynomium:
+ * x^16 + x^15 + x^11 + x^9 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1
+ * gt: 0x8bb7
+ */
+static const __u16 t10_dif_crc_table[256] = {
+        0x0000, 0x8BB7, 0x9CD9, 0x176E, 0xB205, 0x39B2, 0x2EDC, 0xA56B,
+        0xEFBD, 0x640A, 0x7364, 0xF8D3, 0x5DB8, 0xD60F, 0xC161, 0x4AD6,
+        0x54CD, 0xDF7A, 0xC814, 0x43A3, 0xE6C8, 0x6D7F, 0x7A11, 0xF1A6,
+        0xBB70, 0x30C7, 0x27A9, 0xAC1E, 0x0975, 0x82C2, 0x95AC, 0x1E1B,
+        0xA99A, 0x222D, 0x3543, 0xBEF4, 0x1B9F, 0x9028, 0x8746, 0x0CF1,
+        0x4627, 0xCD90, 0xDAFE, 0x5149, 0xF422, 0x7F95, 0x68FB, 0xE34C,
+        0xFD57, 0x76E0, 0x618E, 0xEA39, 0x4F52, 0xC4E5, 0xD38B, 0x583C,
+        0x12EA, 0x995D, 0x8E33, 0x0584, 0xA0EF, 0x2B58, 0x3C36, 0xB781,
+        0xD883, 0x5334, 0x445A, 0xCFED, 0x6A86, 0xE131, 0xF65F, 0x7DE8,
+        0x373E, 0xBC89, 0xABE7, 0x2050, 0x853B, 0x0E8C, 0x19E2, 0x9255,
+        0x8C4E, 0x07F9, 0x1097, 0x9B20, 0x3E4B, 0xB5FC, 0xA292, 0x2925,
+        0x63F3, 0xE844, 0xFF2A, 0x749D, 0xD1F6, 0x5A41, 0x4D2F, 0xC698,
+        0x7119, 0xFAAE, 0xEDC0, 0x6677, 0xC31C, 0x48AB, 0x5FC5, 0xD472,
+        0x9EA4, 0x1513, 0x027D, 0x89CA, 0x2CA1, 0xA716, 0xB078, 0x3BCF,
+        0x25D4, 0xAE63, 0xB90D, 0x32BA, 0x97D1, 0x1C66, 0x0B08, 0x80BF,
+        0xCA69, 0x41DE, 0x56B0, 0xDD07, 0x786C, 0xF3DB, 0xE4B5, 0x6F02,
+        0x3AB1, 0xB106, 0xA668, 0x2DDF, 0x88B4, 0x0303, 0x146D, 0x9FDA,
+        0xD50C, 0x5EBB, 0x49D5, 0xC262, 0x6709, 0xECBE, 0xFBD0, 0x7067,
+        0x6E7C, 0xE5CB, 0xF2A5, 0x7912, 0xDC79, 0x57CE, 0x40A0, 0xCB17,
+        0x81C1, 0x0A76, 0x1D18, 0x96AF, 0x33C4, 0xB873, 0xAF1D, 0x24AA,
+        0x932B, 0x189C, 0x0FF2, 0x8445, 0x212E, 0xAA99, 0xBDF7, 0x3640,
+        0x7C96, 0xF721, 0xE04F, 0x6BF8, 0xCE93, 0x4524, 0x524A, 0xD9FD,
+        0xC7E6, 0x4C51, 0x5B3F, 0xD088, 0x75E3, 0xFE54, 0xE93A, 0x628D,
+        0x285B, 0xA3EC, 0xB482, 0x3F35, 0x9A5E, 0x11E9, 0x0687, 0x8D30,
+        0xE232, 0x6985, 0x7EEB, 0xF55C, 0x5037, 0xDB80, 0xCCEE, 0x4759,
+        0x0D8F, 0x8638, 0x9156, 0x1AE1, 0xBF8A, 0x343D, 0x2353, 0xA8E4,
+        0xB6FF, 0x3D48, 0x2A26, 0xA191, 0x04FA, 0x8F4D, 0x9823, 0x1394,
+        0x5942, 0xD2F5, 0xC59B, 0x4E2C, 0xEB47, 0x60F0, 0x779E, 0xFC29,
+        0x4BA8, 0xC01F, 0xD771, 0x5CC6, 0xF9AD, 0x721A, 0x6574, 0xEEC3,
+        0xA415, 0x2FA2, 0x38CC, 0xB37B, 0x1610, 0x9DA7, 0x8AC9, 0x017E,
+        0x1F65, 0x94D2, 0x83BC, 0x080B, 0xAD60, 0x26D7, 0x31B9, 0xBA0E,
+        0xF0D8, 0x7B6F, 0x6C01, 0xE7B6, 0x42DD, 0xC96A, 0xDE04, 0x55B3
+};
+
+__u16 crc_t10dif(const unsigned char *buffer, size_t len)
+{
+        __u16 crc = 0;
+        unsigned int i;
+
+        for (i = 0 ; i < len ; i++)
+                crc = (crc << 8) ^ t10_dif_crc_table[((crc >> 8) ^ buffer[i]) & 0xff];
+
+        return crc;
+}
+EXPORT_SYMBOL(crc_t10dif);
+
+MODULE_DESCRIPTION("T10 DIF CRC calculation");
+MODULE_LICENSE("GPL");
diff --git a/lib/kobject.c b/lib/kobject.c
index 718e5101c263..744401571ed7 100644
--- a/lib/kobject.c
+++ b/lib/kobject.c
@@ -216,13 +216,19 @@ static int kobject_add_internal(struct kobject *kobj)
 static int kobject_set_name_vargs(struct kobject *kobj, const char *fmt,
                                   va_list vargs)
 {
-        /* Free the old name, if necessary. */
-        kfree(kobj->name);
+        const char *old_name = kobj->name;
+        char *s;
 
         kobj->name = kvasprintf(GFP_KERNEL, fmt, vargs);
         if (!kobj->name)
                 return -ENOMEM;
 
+        /* ewww... some of these buggers have '/' in the name ... */
+        s = strchr(kobj->name, '/');
+        if (s)
+                s[0] = '!';
+
+        kfree(old_name);
         return 0;
 }
 
@@ -439,6 +445,7 @@ out:
 
         return error;
 }
+EXPORT_SYMBOL_GPL(kobject_rename);
 
 /**
  * kobject_move - move object to another parent
diff --git a/lib/kobject_uevent.c b/lib/kobject_uevent.c
index 2fa545a63160..9f8d599459d1 100644
--- a/lib/kobject_uevent.c
+++ b/lib/kobject_uevent.c
@@ -245,7 +245,8 @@ int kobject_uevent_env(struct kobject *kobj, enum kobject_action action,
                 if (retval)
                         goto exit;
 
-                call_usermodehelper(argv[0], argv, env->envp, UMH_WAIT_EXEC);
+                retval = call_usermodehelper(argv[0], argv,
+                                             env->envp, UMH_WAIT_EXEC);
         }
 
 exit:
diff --git a/lib/scatterlist.c b/lib/scatterlist.c
index b80c21100d78..876ba6d5b670 100644
--- a/lib/scatterlist.c
+++ b/lib/scatterlist.c
@@ -295,6 +295,117 @@ int sg_alloc_table(struct sg_table *table, unsigned int nents, gfp_t gfp_mask)
 EXPORT_SYMBOL(sg_alloc_table);
 
 /**
+ * sg_miter_start - start mapping iteration over a sg list
+ * @miter: sg mapping iter to be started
+ * @sgl: sg list to iterate over
+ * @nents: number of sg entries
+ *
+ * Description:
+ *   Starts mapping iterator @miter.
+ *
+ * Context:
+ *   Don't care.
+ */
+void sg_miter_start(struct sg_mapping_iter *miter, struct scatterlist *sgl,
+                    unsigned int nents, unsigned int flags)
+{
+        memset(miter, 0, sizeof(struct sg_mapping_iter));
+
+        miter->__sg = sgl;
+        miter->__nents = nents;
+        miter->__offset = 0;
+        miter->__flags = flags;
+}
+EXPORT_SYMBOL(sg_miter_start);
+
+/**
+ * sg_miter_next - proceed mapping iterator to the next mapping
+ * @miter: sg mapping iter to proceed
+ *
+ * Description:
+ *   Proceeds @miter@ to the next mapping.  @miter@ should have been
+ *   started using sg_miter_start().  On successful return,
+ *   @miter@->page, @miter@->addr and @miter@->length point to the
+ *   current mapping.
+ *
+ * Context:
+ *   IRQ disabled if SG_MITER_ATOMIC.  IRQ must stay disabled till
+ *   @miter@ is stopped.  May sleep if !SG_MITER_ATOMIC.
+ *
+ * Returns:
+ *   true if @miter contains the next mapping.  false if end of sg
+ *   list is reached.
+ */
+bool sg_miter_next(struct sg_mapping_iter *miter)
+{
+        unsigned int off, len;
+
+        /* check for end and drop resources from the last iteration */
+        if (!miter->__nents)
+                return false;
+
+        sg_miter_stop(miter);
+
+        /* get to the next sg if necessary.  __offset is adjusted by stop */
+        if (miter->__offset == miter->__sg->length && --miter->__nents) {
+                miter->__sg = sg_next(miter->__sg);
+                miter->__offset = 0;
+        }
+
+        /* map the next page */
+        off = miter->__sg->offset + miter->__offset;
+        len = miter->__sg->length - miter->__offset;
+
+        miter->page = nth_page(sg_page(miter->__sg), off >> PAGE_SHIFT);
+        off &= ~PAGE_MASK;
+        miter->length = min_t(unsigned int, len, PAGE_SIZE - off);
+        miter->consumed = miter->length;
+
+        if (miter->__flags & SG_MITER_ATOMIC)
+                miter->addr = kmap_atomic(miter->page, KM_BIO_SRC_IRQ) + off;
+        else
+                miter->addr = kmap(miter->page) + off;
+
+        return true;
+}
+EXPORT_SYMBOL(sg_miter_next);
+
+/**
+ * sg_miter_stop - stop mapping iteration
+ * @miter: sg mapping iter to be stopped
+ *
+ * Description:
+ *   Stops mapping iterator @miter.  @miter should have been started
+ *   started using sg_miter_start().  A stopped iteration can be
+ *   resumed by calling sg_miter_next() on it.  This is useful when
+ *   resources (kmap) need to be released during iteration.
+ *
+ * Context:
+ *   IRQ disabled if the SG_MITER_ATOMIC is set.  Don't care otherwise.
+ */
+void sg_miter_stop(struct sg_mapping_iter *miter)
+{
+        WARN_ON(miter->consumed > miter->length);
+
+        /* drop resources from the last iteration */
+        if (miter->addr) {
+                miter->__offset += miter->consumed;
+
+                if (miter->__flags & SG_MITER_ATOMIC) {
+                        WARN_ON(!irqs_disabled());
+                        kunmap_atomic(miter->addr, KM_BIO_SRC_IRQ);
+                } else
+                        kunmap(miter->addr);
+
+                miter->page = NULL;
+                miter->addr = NULL;
+                miter->length = 0;
+                miter->consumed = 0;
+        }
+}
+EXPORT_SYMBOL(sg_miter_stop);
+
+/**
  * sg_copy_buffer - Copy data between a linear buffer and an SG list
  * @sgl:                 The SG list
  * @nents:               Number of SG entries
@@ -309,56 +420,29 @@ EXPORT_SYMBOL(sg_alloc_table);
 static size_t sg_copy_buffer(struct scatterlist *sgl, unsigned int nents,
                              void *buf, size_t buflen, int to_buffer)
 {
-        struct scatterlist *sg;
-        size_t buf_off = 0;
-        int i;
-
-        WARN_ON(!irqs_disabled());
-
-        for_each_sg(sgl, sg, nents, i) {
-                struct page *page;
-                int n = 0;
-                unsigned int sg_off = sg->offset;
-                unsigned int sg_copy = sg->length;
-
-                if (sg_copy > buflen)
-                        sg_copy = buflen;
-                buflen -= sg_copy;
-
-                while (sg_copy > 0) {
-                        unsigned int page_copy;
-                        void *p;
-
-                        page_copy = PAGE_SIZE - sg_off;
-                        if (page_copy > sg_copy)
-                                page_copy = sg_copy;
-
-                        page = nth_page(sg_page(sg), n);
-                        p = kmap_atomic(page, KM_BIO_SRC_IRQ);
-
-                        if (to_buffer)
-                                memcpy(buf + buf_off, p + sg_off, page_copy);
-                        else {
-                                memcpy(p + sg_off, buf + buf_off, page_copy);
-                                flush_kernel_dcache_page(page);
-                        }
-
-                        kunmap_atomic(p, KM_BIO_SRC_IRQ);
-
-                        buf_off += page_copy;
-                        sg_off += page_copy;
-                        if (sg_off == PAGE_SIZE) {
-                                sg_off = 0;
-                                n++;
-                        }
-                        sg_copy -= page_copy;
+        unsigned int offset = 0;
+        struct sg_mapping_iter miter;
+
+        sg_miter_start(&miter, sgl, nents, SG_MITER_ATOMIC);
+
+        while (sg_miter_next(&miter) && offset < buflen) {
+                unsigned int len;
+
+                len = min(miter.length, buflen - offset);
+
+                if (to_buffer)
+                        memcpy(buf + offset, miter.addr, len);
+                else {
+                        memcpy(miter.addr, buf + offset, len);
+                        flush_kernel_dcache_page(miter.page);
                 }
 
-                if (!buflen)
-                        break;
+                offset += len;
         }
 
-        return buf_off;
+        sg_miter_stop(&miter);
+
+        return offset;
 }
 
 /**
diff --git a/lib/textsearch.c b/lib/textsearch.c
index be8bda3862f5..9fbcb44c554f 100644
--- a/lib/textsearch.c
+++ b/lib/textsearch.c
@@ -54,10 +54,13 @@
  * USAGE
  *
  *   Before a search can be performed, a configuration must be created
- *   by calling textsearch_prepare() specyfing the searching algorithm and
- *   the pattern to look for. The returned configuration may then be used
- *   for an arbitary amount of times and even in parallel as long as a
- *   separate struct ts_state variable is provided to every instance.
+ *   by calling textsearch_prepare() specifying the searching algorithm,
+ *   the pattern to look for and flags. As a flag, you can set TS_IGNORECASE
+ *   to perform case insensitive matching. But it might slow down
+ *   performance of algorithm, so you should use it at own your risk.
+ *   The returned configuration may then be used for an arbitary
+ *   amount of times and even in parallel as long as a separate struct
+ *   ts_state variable is provided to every instance.
  *
  *   The actual search is performed by either calling textsearch_find_-
  *   continuous() for linear data or by providing an own get_next_block()
@@ -89,7 +92,6 @@
  *       panic("Oh my god, dancing chickens at %d\n", pos);
  *
  *   textsearch_destroy(conf);
- *
  * ==========================================================================
  */
 
@@ -97,6 +99,7 @@
 #include <linux/types.h>
 #include <linux/string.h>
 #include <linux/init.h>
+#include <linux/rculist.h>
 #include <linux/rcupdate.h>
 #include <linux/err.h>
 #include <linux/textsearch.h>
@@ -264,7 +267,7 @@ struct ts_config *textsearch_prepare(const char *algo, const void *pattern,
                 return ERR_PTR(-EINVAL);
 
         ops = lookup_ts_algo(algo);
-#ifdef CONFIG_KMOD
+#ifdef CONFIG_MODULES
         /*
          * Why not always autoload you may ask. Some users are
          * in a situation where requesting a module may deadlock,
@@ -279,7 +282,7 @@ struct ts_config *textsearch_prepare(const char *algo, const void *pattern,
         if (ops == NULL)
                 goto errout;
 
-        conf = ops->init(pattern, len, gfp_mask);
+        conf = ops->init(pattern, len, gfp_mask, flags);
         if (IS_ERR(conf)) {
                 err = PTR_ERR(conf);
                 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 @@
 #include <linux/module.h>
 #include <linux/types.h>
 #include <linux/string.h>
+#include <linux/ctype.h>
 #include <linux/textsearch.h>
 
 /* Alphabet size, use ASCII */
@@ -64,6 +65,7 @@ static unsigned int bm_find(struct ts_config *conf, struct ts_state *state)
         unsigned int i, text_len, consumed = state->offset;
         const u8 *text;
         int shift = bm->patlen - 1, bs;
+        const u8 icase = conf->flags & TS_IGNORECASE;
 
         for (;;) {
                 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)
                         DEBUGP("Searching in position %d (%c)\n", 
                                 shift, text[shift]);
                         for (i = 0; i < bm->patlen; i++) 
-                             if (text[shift-i] != bm->pattern[bm->patlen-1-i])
+                                if ((icase ? toupper(text[shift-i])
+                                    : text[shift-i])
+                                        != bm->pattern[bm->patlen-1-i])
                                      goto next;
 
                         /* London calling... */
@@ -111,14 +115,18 @@ static int subpattern(u8 *pattern, int i, int j, int g)
         return ret;
 }
 
-static void compute_prefix_tbl(struct ts_bm *bm)
+static void compute_prefix_tbl(struct ts_bm *bm, int flags)
 {
         int i, j, g;
 
         for (i = 0; i < ASIZE; i++)
                 bm->bad_shift[i] = bm->patlen;
-        for (i = 0; i < bm->patlen - 1; i++)
+        for (i = 0; i < bm->patlen - 1; i++) {
                 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i;
+                if (flags & TS_IGNORECASE)
+                        bm->bad_shift[tolower(bm->pattern[i])]
+                            = bm->patlen - 1 - i;
+        }
 
         /* Compute the good shift array, used to match reocurrences 
          * of a subpattern */
@@ -135,10 +143,11 @@ static void compute_prefix_tbl(struct ts_bm *bm)
 }
 
 static struct ts_config *bm_init(const void *pattern, unsigned int len,
-                                 gfp_t gfp_mask)
+                                 gfp_t gfp_mask, int flags)
 {
         struct ts_config *conf;
         struct ts_bm *bm;
+        int i;
         unsigned int prefix_tbl_len = len * sizeof(unsigned int);
         size_t priv_size = sizeof(*bm) + len + prefix_tbl_len;
 
@@ -146,11 +155,16 @@ static struct ts_config *bm_init(const void *pattern, unsigned int len,
         if (IS_ERR(conf))
                 return conf;
 
+        conf->flags = flags;
         bm = ts_config_priv(conf);
         bm->patlen = len;
         bm->pattern = (u8 *) bm->good_shift + prefix_tbl_len;
-        memcpy(bm->pattern, pattern, len);
-        compute_prefix_tbl(bm);
+        if (flags & TS_IGNORECASE)
+                for (i = 0; i < len; i++)
+                        bm->pattern[i] = toupper(((u8 *)pattern)[i]);
+        else
+                memcpy(bm->pattern, pattern, len);
+        compute_prefix_tbl(bm, flags);
 
         return conf;
 }
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:
 }
 
 static struct ts_config *fsm_init(const void *pattern, unsigned int len,
-                                     gfp_t gfp_mask)
+                                    gfp_t gfp_mask, int flags)
 {
         int i, err = -EINVAL;
         struct ts_config *conf;
@@ -269,6 +269,9 @@ static struct ts_config *fsm_init(const void *pattern, unsigned int len,
         if (len  % sizeof(struct ts_fsm_token) || ntokens < 1)
                 goto errout;
 
+        if (flags & TS_IGNORECASE)
+                goto errout;
+
         for (i = 0; i < ntokens; i++) {
                 struct ts_fsm_token *t = &tokens[i];
 
@@ -284,6 +287,7 @@ static struct ts_config *fsm_init(const void *pattern, unsigned int len,
         if (IS_ERR(conf))
                 return conf;
 
+        conf->flags = flags;
         fsm = ts_config_priv(conf);
         fsm->ntokens = ntokens;
         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 @@
 #include <linux/module.h>
 #include <linux/types.h>
 #include <linux/string.h>
+#include <linux/ctype.h>
 #include <linux/textsearch.h>
 
 struct ts_kmp
@@ -47,6 +48,7 @@ static unsigned int kmp_find(struct ts_config *conf, struct ts_state *state)
         struct ts_kmp *kmp = ts_config_priv(conf);
         unsigned int i, q = 0, text_len, consumed = state->offset;
         const u8 *text;
+        const int icase = conf->flags & TS_IGNORECASE;
 
         for (;;) {
                 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)
                         break;
 
                 for (i = 0; i < text_len; i++) {
-                        while (q > 0 && kmp->pattern[q] != text[i])
+                        while (q > 0 && kmp->pattern[q]
+                            != (icase ? toupper(text[i]) : text[i]))
                                 q = kmp->prefix_tbl[q - 1];
-                        if (kmp->pattern[q] == text[i])
+                        if (kmp->pattern[q]
+                            == (icase ? toupper(text[i]) : text[i]))
                                 q++;
                         if (unlikely(q == kmp->pattern_len)) {
                                 state->offset = consumed + i + 1;
@@ -72,24 +76,28 @@ static unsigned int kmp_find(struct ts_config *conf, struct ts_state *state)
 }
 
 static inline void compute_prefix_tbl(const u8 *pattern, unsigned int len,
-                                      unsigned int *prefix_tbl)
+                                      unsigned int *prefix_tbl, int flags)
 {
         unsigned int k, q;
+        const u8 icase = flags & TS_IGNORECASE;
 
         for (k = 0, q = 1; q < len; q++) {
-                while (k > 0 && pattern[k] != pattern[q])
+                while (k > 0 && (icase ? toupper(pattern[k]) : pattern[k])
+                    != (icase ? toupper(pattern[q]) : pattern[q]))
                         k = prefix_tbl[k-1];
-                if (pattern[k] == pattern[q])
+                if ((icase ? toupper(pattern[k]) : pattern[k])
+                    == (icase ? toupper(pattern[q]) : pattern[q]))
                         k++;
                 prefix_tbl[q] = k;
         }
 }
 
 static struct ts_config *kmp_init(const void *pattern, unsigned int len,
-                                  gfp_t gfp_mask)
+                                  gfp_t gfp_mask, int flags)
 {
         struct ts_config *conf;
         struct ts_kmp *kmp;
+        int i;
         unsigned int prefix_tbl_len = len * sizeof(unsigned int);
         size_t priv_size = sizeof(*kmp) + len + prefix_tbl_len;
 
@@ -97,11 +105,16 @@ static struct ts_config *kmp_init(const void *pattern, unsigned int len,
         if (IS_ERR(conf))
                 return conf;
 
+        conf->flags = flags;
         kmp = ts_config_priv(conf);
         kmp->pattern_len = len;
-        compute_prefix_tbl(pattern, len, kmp->prefix_tbl);
+        compute_prefix_tbl(pattern, len, kmp->prefix_tbl, flags);
         kmp->pattern = (u8 *) kmp->prefix_tbl + prefix_tbl_len;
-        memcpy(kmp->pattern, pattern, len);
+        if (flags & TS_IGNORECASE)
+                for (i = 0; i < len; i++)
+                        kmp->pattern[i] = toupper(((u8 *)pattern)[i]);
+        else
+                memcpy(kmp->pattern, pattern, len);
 
         return conf;
 }