53 	unsigned int	patlen;  member
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()
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()
124 			    = bm->patlen - 1 - i;  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()
135 				bm->good_shift[g] = bm->patlen-j-g;  in compute_prefix_tbl()
156 	bm->patlen = len;  in bm_init()
177 	return bm->patlen;  in bm_get_pattern_len()