Lines Matching refs:i
65 unsigned int i, text_len, consumed = state->offset; in bm_find() local
79 for (i = 0; i < bm->patlen; i++) in bm_find()
80 if ((icase ? toupper(text[shift-i]) in bm_find()
81 : text[shift-i]) in bm_find()
82 != bm->pattern[bm->patlen-1-i]) in bm_find()
89 next: bs = bm->bad_shift[text[shift-i]]; in bm_find()
92 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]); in bm_find()
100 static int subpattern(u8 *pattern, int i, int j, int g) in subpattern() argument
102 int x = i+g-1, y = j+g-1, ret = 0; in subpattern()
110 ret = pattern[i-1] != pattern[j-1]; in subpattern()
120 int i, j, g; in compute_prefix_tbl() local
122 for (i = 0; i < ASIZE; i++) in compute_prefix_tbl()
123 bm->bad_shift[i] = bm->patlen; in compute_prefix_tbl()
124 for (i = 0; i < bm->patlen - 1; i++) { in compute_prefix_tbl()
125 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; in compute_prefix_tbl()
127 bm->bad_shift[tolower(bm->pattern[i])] in compute_prefix_tbl()
128 = bm->patlen - 1 - i; in compute_prefix_tbl()
134 for (i = 1; i < bm->patlen; i++) in compute_prefix_tbl()
135 bm->good_shift[i] = bm->patlen; in compute_prefix_tbl()
136 for (i = bm->patlen-1, g = 1; i > 0; g++, i--) { in compute_prefix_tbl()
137 for (j = i-1; j >= 1-g ; j--) in compute_prefix_tbl()
138 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
150 int i; in bm_init() local
163 for (i = 0; i < len; i++) in bm_init()
164 bm->pattern[i] = toupper(((u8 *)pattern)[i]); in bm_init()