Lines Matching refs:suffix
45 // search will not be optimal, since we only build tables for a suffix
180 // Store for the BoyerMoore good suffix shift table.
187 // Table used temporarily while building the BoyerMoore good suffix
374 int suffix = pattern_length + 1;
379 while (suffix <= pattern_length && c != pattern[suffix - 1]) {
380 if (shift_table[suffix] == length) {
381 shift_table[suffix] = suffix - i;
383 suffix = suffix_table[suffix];
385 suffix_table[--i] = --suffix;
386 if (suffix == pattern_length) {
387 // No suffix to extend, so we check against last_char only.
395 suffix_table[--i] = --suffix;
401 if (suffix < pattern_length) {
404 shift_table[i] = suffix - start;
406 if (i == suffix) {
407 suffix = suffix_table[suffix];
428 // How bad we are doing without a good-suffix table.
