99     size_t pattern_length = pattern_.length();  in StringSearch()  local
100     CHECK_GT(pattern_length, 0);  in StringSearch()
101     if (pattern_length < kBMMinPatternLength) {  in StringSearch()
102       if (pattern_length == 1) {  in StringSearch()
340   const size_t pattern_length = pattern_.length();  in BoyerMooreSearch()  local
347   Char last_char = pattern_[pattern_length - 1];  in BoyerMooreSearch()
350   while (index <= subject_length - pattern_length) {  in BoyerMooreSearch()
351     size_t j = pattern_length - 1;  in BoyerMooreSearch()
356       if (index > subject_length - pattern_length) {  in BoyerMooreSearch()
369       index += pattern_length - 1 -  in BoyerMooreSearch()
387   const size_t pattern_length = pattern_.length();  in PopulateBoyerMooreTable()  local
391   const size_t length = pattern_length - start;  in PopulateBoyerMooreTable()
399   for (size_t i = start; i < pattern_length; i++) {  in PopulateBoyerMooreTable()
402   shift_table[pattern_length] = 1;  in PopulateBoyerMooreTable()
403   suffix_table[pattern_length] = pattern_length + 1;  in PopulateBoyerMooreTable()
405   if (pattern_length <= start) {  in PopulateBoyerMooreTable()
410   Char last_char = pattern_[pattern_length - 1];  in PopulateBoyerMooreTable()
411   size_t suffix = pattern_length + 1;  in PopulateBoyerMooreTable()
413     size_t i = pattern_length;  in PopulateBoyerMooreTable()
416       while (suffix <= pattern_length && c != pattern_[suffix - 1]) {  in PopulateBoyerMooreTable()
423       if (suffix == pattern_length) {  in PopulateBoyerMooreTable()
426           if (static_cast<size_t>(shift_table[pattern_length]) == length) {  in PopulateBoyerMooreTable()
427             shift_table[pattern_length] = pattern_length - i;  in PopulateBoyerMooreTable()
429           suffix_table[--i] = pattern_length;  in PopulateBoyerMooreTable()
438   if (suffix < pattern_length) {  in PopulateBoyerMooreTable()
439     for (size_t i = start; i <= pattern_length; i++) {  in PopulateBoyerMooreTable()
459   const size_t pattern_length = pattern_.length();  in BoyerMooreHorspoolSearch()  local
461   int64_t badness = -static_cast<int64_t>(pattern_length);  in BoyerMooreHorspoolSearch()
464   Char last_char = pattern_[pattern_length - 1];  in BoyerMooreHorspoolSearch()
466       pattern_length - 1 -  in BoyerMooreHorspoolSearch()
471   while (index <= subject_length - pattern_length) {  in BoyerMooreHorspoolSearch()
472     size_t j = pattern_length - 1;  in BoyerMooreHorspoolSearch()
479       if (index > subject_length - pattern_length) {  in BoyerMooreHorspoolSearch()
495     badness += (pattern_length - j) - last_char_shift;  in BoyerMooreHorspoolSearch()
507   const size_t pattern_length = pattern_.length();  in PopulateBoyerMooreHorspoolTable()  local
525   for (size_t i = start; i < pattern_length - 1; i++) {  in PopulateBoyerMooreHorspoolTable()
542   const size_t pattern_length = pattern_.length();  in InitialSearch()  local
546   int64_t badness = -10 - (pattern_length << 2);  in InitialSearch()
550   for (size_t i = index, n = subject.length() - pattern_length; i <= n; i++) {  in InitialSearch()
563       } while (j < pattern_length);  in InitialSearch()
564       if (j == pattern_length) {  in InitialSearch()