Lines Matching refs:suffix
25 // search will not be optimal, since we only build tables for a suffix
160 // Store for the BoyerMoore good suffix shift table.
167 // Table used temporarily while building the BoyerMoore good suffix
371 int suffix = pattern_length + 1;
376 while (suffix <= pattern_length && c != pattern[suffix - 1]) {
377 if (shift_table[suffix] == length) {
378 shift_table[suffix] = suffix - i;
380 suffix = suffix_table[suffix];
382 suffix_table[--i] = --suffix;
383 if (suffix == pattern_length) {
384 // No suffix to extend, so we check against last_char only.
392 suffix_table[--i] = --suffix;
398 if (suffix < pattern_length) {
401 shift_table[i] = suffix - start;
403 if (i == suffix) {
404 suffix = suffix_table[suffix];
424 // How bad we are doing without a good-suffix table.