Lines Matching defs:patlen
53 unsigned int patlen;
67 int shift = bm->patlen - 1;
77 for (i = 0; i < bm->patlen; i++)
80 != bm->pattern[bm->patlen-1-i])
85 return consumed += (shift-(bm->patlen-1));
121 bm->bad_shift[i] = bm->patlen;
122 for (i = 0; i < bm->patlen - 1; i++) {
123 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i;
126 = bm->patlen - 1 - i;
132 for (i = 1; i < bm->patlen; i++)
133 bm->good_shift[i] = bm->patlen;
134 for (i = bm->patlen-1, g = 1; i > 0; g++, i--) {
137 bm->good_shift[g] = bm->patlen-j-g;
158 bm->patlen = len;
179 return bm->patlen;