81   int Search(Vector<const SubjectChar> subject, int index) {  in Search()  argument
82     return strategy_(this, subject, index);  in Search()
109                               Vector<const SubjectChar> subject,
113                           Vector<const SubjectChar> subject,
117                            Vector<const SubjectChar> subject,
122       Vector<const SubjectChar> subject,
126                               Vector<const SubjectChar> subject,
211                               Vector<const SubjectChar> subject, int index) {  in FindFirstCharacter()  argument
213   const int max_n = (subject.length() - pattern.length() + 1);  in FindFirstCharacter()
221         memchr(subject.start() + pos, search_byte,  in FindFirstCharacter()
225     pos = static_cast<int>(char_pos - subject.start());  in FindFirstCharacter()
226     if (subject[pos] == search_char) return pos;  in FindFirstCharacter()
240     Vector<const SubjectChar> subject,  in SingleCharSearch()  argument
249   return FindFirstCharacter(search->pattern_, subject, index);  in SingleCharSearch()
259                         const SubjectChar* subject,  in CharCompare()  argument
264     if (pattern[pos] != subject[pos]) {  in CharCompare()
277     Vector<const SubjectChar> subject,  in LinearSearch()  argument
283   int n = subject.length() - pattern_length;  in LinearSearch()
285     i = FindFirstCharacter(pattern, subject, i);  in LinearSearch()
292                     subject.start() + i,  in LinearSearch()
307     Vector<const SubjectChar> subject,  in BoyerMooreSearch()  argument
310   int subject_length = subject.length();  in BoyerMooreSearch()
324     while (last_char != (c = subject[index + j])) {  in BoyerMooreSearch()
332     while (j >= 0 && pattern[j] == (c = subject[index + j])) j--;  in BoyerMooreSearch()
430     Vector<const SubjectChar> subject,  in BoyerMooreHorspoolSearch()  argument
433   int subject_length = subject.length();  in BoyerMooreHorspoolSearch()
447     while (last_char != (subject_char = subject[index + j])) {  in BoyerMooreHorspoolSearch()
457     while (j >= 0 && pattern[j] == (subject[index + j])) j--;  in BoyerMooreHorspoolSearch()
470         return BoyerMooreSearch(search, subject, index);  in BoyerMooreHorspoolSearch()
515     Vector<const SubjectChar> subject,  in InitialSearch()  argument
526   for (int i = index, n = subject.length() - pattern_length; i <= n; i++) {  in InitialSearch()
529       i = FindFirstCharacter(pattern, subject, i);  in InitialSearch()
534         if (pattern[j] != subject[i + j]) {  in InitialSearch()
546       return BoyerMooreHorspoolSearch(search, subject, i);  in InitialSearch()
559                  Vector<const SubjectChar> subject,  in SearchString()  argument
563   return search.Search(subject, start_index);  in SearchString()
574   Vector<const SubjectChar> subject(subject_ptr, subject_length);  in SearchStringRaw()
576   return SearchString(isolate, subject, pattern, start_index);  in SearchStringRaw()