Lines Matching defs:shift
67 int shift = bm->patlen - 1;
74 while (shift < text_len) {
76 shift, text[shift]);
78 if ((icase ? toupper(text[shift-i])
79 : text[shift-i])
85 return consumed += (shift-(bm->patlen-1));
87 next: bs = bm->bad_shift[text[shift-i]];
90 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]);
129 /* Compute the good shift array, used to match reocurrences