Lines Matching full:suffix
22 // search will not be optimal, since we only build tables for a suffix
165 // Store for the BoyerMoore good suffix shift table.
172 // Table used temporarily while building the BoyerMoore good suffix
363 int suffix = pattern_length + 1;
368 while (suffix <= pattern_length && c != pattern[suffix - 1]) {
369 if (shift_table[suffix] == length) {
370 shift_table[suffix] = suffix - i;
372 suffix = suffix_table[suffix];
374 suffix_table[--i] = --suffix;
375 if (suffix == pattern_length) {
376 // No suffix to extend, so we check against last_char only.
384 suffix_table[--i] = --suffix;
390 if (suffix < pattern_length) {
393 shift_table[i] = suffix - start;
395 if (i == suffix) {
396 suffix = suffix_table[suffix];
417 // How bad we are doing without a good-suffix table.
