Lines Matching defs:start
303 int start = search->start_;
324 } else if (j < start) {
350 int start = start_;
351 int length = pattern_length - start;
354 // even if we only cover the part of the pattern from offset start.
359 for (int i = start; i < pattern_length; i++) {
365 if (pattern_length <= start) {
374 while (i > start) {
385 while ((i > start) && (pattern[i - 1] != last_char)) {
391 if (i > start) {
399 for (int i = start; i <= pattern_length; i++) {
401 shift_table[i] = suffix - start;
471 int start = start_;
476 if (start == 0) { // All patterns less than kBMMaxShift in length.
480 bad_char_occurrence[i] = start - 1;
483 for (int i = start; i < pattern_length - 1; i++) {