Lines Matching full:bm
19 * Note: Since Boyer-Moore (BM) performs searches for matchings from right
31 * matchings spread over multiple fragments, then go BM.
78 struct ts_bm *bm = ts_config_priv(conf); in bm_find() local
85 int shift = bm->patlen - 1; in bm_find()
96 i = matchpat(&bm->pattern[bm->patlen-1], bm->patlen, in bm_find()
98 if (i == bm->patlen) { in bm_find()
101 return consumed + (shift-(bm->patlen-1)); 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()
133 static void compute_prefix_tbl(struct ts_bm *bm, int flags) in compute_prefix_tbl() argument
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()
148 bm->good_shift[0] = 1; 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()
153 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
154 bm->good_shift[g] = bm->patlen-j-g; in compute_prefix_tbl()
164 struct ts_bm *bm; in bm_init() local
167 size_t priv_size = sizeof(*bm) + len + prefix_tbl_len; in bm_init()
174 bm = ts_config_priv(conf); in bm_init()
175 bm->patlen = len; in bm_init()
176 bm->pattern = (u8 *) bm->good_shift + prefix_tbl_len; in bm_init()
179 bm->pattern[i] = toupper(((u8 *)pattern)[i]); in bm_init()
181 memcpy(bm->pattern, pattern, len); in bm_init()
182 compute_prefix_tbl(bm, flags); in bm_init()
189 struct ts_bm *bm = ts_config_priv(conf); in bm_get_pattern() local
190 return bm->pattern; in bm_get_pattern()
195 struct ts_bm *bm = ts_config_priv(conf); in bm_get_pattern_len() local
196 return bm->patlen; in bm_get_pattern_len()
200 .name = "bm",