19  *   Note: Since Boyer-Moore (BM) performs searches for matchings from right 
31  *   matchings spread over multiple fragments, then go BM.
60 	struct ts_bm *bm = ts_config_priv(conf);  in bm_find()  local
63 	int shift = bm->patlen - 1, bs;  in bm_find()
75 			for (i = 0; i < bm->patlen; i++)   in bm_find()
78 					!= bm->pattern[bm->patlen-1-i])  in bm_find()
83 			return consumed += (shift-(bm->patlen-1));  in bm_find()
85 next:			bs = bm->bad_shift[text[shift-i]];  in bm_find()
88 			shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]);  in bm_find()
114 static void compute_prefix_tbl(struct ts_bm *bm, int flags)  in compute_prefix_tbl()  argument
119 		bm->bad_shift[i] = bm->patlen;  in compute_prefix_tbl()
120 	for (i = 0; i < bm->patlen - 1; i++) {  in compute_prefix_tbl()
121 		bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i;  in compute_prefix_tbl()
123 			bm->bad_shift[tolower(bm->pattern[i])]  in compute_prefix_tbl()
124 			    = bm->patlen - 1 - i;  in compute_prefix_tbl()
129 	bm->good_shift[0] = 1;  in compute_prefix_tbl()
130 	for (i = 1; i < bm->patlen; i++)  in compute_prefix_tbl()
131 		bm->good_shift[i] = bm->patlen;  in compute_prefix_tbl()
132         for (i = bm->patlen-1, g = 1; i > 0; g++, i--) {  in compute_prefix_tbl()
134 			if (subpattern(bm->pattern, i, j, g)) {  in compute_prefix_tbl()
135 				bm->good_shift[g] = bm->patlen-j-g;  in compute_prefix_tbl()
145 	struct ts_bm *bm;  in bm_init()  local
148 	size_t priv_size = sizeof(*bm) + len + prefix_tbl_len;  in bm_init()
155 	bm = ts_config_priv(conf);  in bm_init()
156 	bm->patlen = len;  in bm_init()
157 	bm->pattern = (u8 *) bm->good_shift + prefix_tbl_len;  in bm_init()
160 			bm->pattern[i] = toupper(((u8 *)pattern)[i]);  in bm_init()
162 		memcpy(bm->pattern, pattern, len);  in bm_init()
163 	compute_prefix_tbl(bm, flags);  in bm_init()
170 	struct ts_bm *bm = ts_config_priv(conf);  in bm_get_pattern()  local
171 	return bm->pattern;  in bm_get_pattern()
176 	struct ts_bm *bm = ts_config_priv(conf);  in bm_get_pattern_len()  local
177 	return bm->patlen;  in bm_get_pattern_len()
181 	.name		  = "bm",