Lines Matching refs:i
61 unsigned int i; in matchpat() local
63 for (i = 0; i < patlen; i++) { in matchpat()
64 u8 t = *(text-i); in matchpat()
69 if (t != *(pattern-i)) in matchpat()
73 return i; in matchpat()
79 unsigned int i, text_len, consumed = state->offset; in bm_find() local
96 i = matchpat(&bm->pattern[bm->patlen-1], bm->patlen, in bm_find()
98 if (i == bm->patlen) { in bm_find()
104 bs = bm->bad_shift[text[shift-i]]; in bm_find()
107 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]); in bm_find()
115 static int subpattern(u8 *pattern, int i, int j, int g) in subpattern() argument
117 int x = i+g-1, y = j+g-1, ret = 0; in subpattern()
125 ret = pattern[i-1] != pattern[j-1]; in subpattern()
135 int i, j, g; in compute_prefix_tbl() local
137 for (i = 0; i < ASIZE; i++) in compute_prefix_tbl()
138 bm->bad_shift[i] = bm->patlen; in compute_prefix_tbl()
139 for (i = 0; i < bm->patlen - 1; i++) { in compute_prefix_tbl()
140 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; in compute_prefix_tbl()
142 bm->bad_shift[tolower(bm->pattern[i])] in compute_prefix_tbl()
143 = bm->patlen - 1 - i; in compute_prefix_tbl()
149 for (i = 1; i < bm->patlen; i++) in compute_prefix_tbl()
150 bm->good_shift[i] = bm->patlen; in compute_prefix_tbl()
151 for (i = bm->patlen-1, g = 1; i > 0; g++, i--) { in compute_prefix_tbl()
152 for (j = i-1; j >= 1-g ; j--) in compute_prefix_tbl()
153 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
165 int i; in bm_init() local
178 for (i = 0; i < len; i++) in bm_init()
179 bm->pattern[i] = toupper(((u8 *)pattern)[i]); in bm_init()