Lines Matching defs:shift
85 int shift = bm->patlen - 1;
92 while (shift < text_len) {
94 shift, text[shift]);
97 &text[shift], icase);
101 return consumed + (shift-(bm->patlen-1));
104 bs = bm->bad_shift[text[shift-i]];
107 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]);
146 /* Compute the good shift array, used to match reocurrences