Lines Matching defs:patlen
53 unsigned int patlen;
58 static unsigned int matchpat(const u8 *pattern, unsigned int patlen,
63 for (i = 0; i < patlen; i++) {
85 int shift = bm->patlen - 1;
96 i = matchpat(&bm->pattern[bm->patlen-1], bm->patlen,
98 if (i == bm->patlen) {
101 return consumed + (shift-(bm->patlen-1));
138 bm->bad_shift[i] = bm->patlen;
139 for (i = 0; i < bm->patlen - 1; i++) {
140 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i;
143 = bm->patlen - 1 - i;
149 for (i = 1; i < bm->patlen; i++)
150 bm->good_shift[i] = bm->patlen;
151 for (i = bm->patlen-1, g = 1; i > 0; g++, i--) {
154 bm->good_shift[g] = bm->patlen-j-g;
175 bm->patlen = len;
196 return bm->patlen;