1 /*-
2  * SPDX-License-Identifier: MIT
4  * Copyright (c) 2005-2014 Rich Felker, et al.
32 	for (h += 2, k -= 2; k; k--, hw = hw << 8 | *h++)  in twobyte_memmem()
34 			return (char *)h - 2;  in twobyte_memmem()
35 	return hw == nw ? (char *)h - 2 : 0;  in twobyte_memmem()
43 	for (h += 3, k -= 3; k; k--, hw = (hw | *h++) << 8)  in threebyte_memmem()
45 			return (char *)h - 3;  in threebyte_memmem()
46 	return hw == nw ? (char *)h - 3 : 0;  in threebyte_memmem()
54 	for (h += 4, k -= 4; k; k--, hw = hw << 8 | *h++)  in fourbyte_memmem()
56 			return (char *)h - 4;  in fourbyte_memmem()
57 	return hw == nw ? (char *)h - 4 : 0;  in fourbyte_memmem()
69  * byte of the window. A bit array marks which entries in the shift table are
72  * Reference: CROCHEMORE M., PERRIN D., 1991, Two-way string-matching,
73  * Journal of the ACM 38(3):651-675
79 	size_t i, ip, jp, k, p, ms, p0, mem, mem0;  in twoway_memmem()  local
88 	ip = -1;  in twoway_memmem()
101 			p = jp - ip;  in twoway_memmem()
111 	ip = -1;  in twoway_memmem()
124 			p = jp - ip;  in twoway_memmem()
138 		p = MAX(ms, l - ms - 1) + 1;  in twoway_memmem()
140 		mem0 = l - p;  in twoway_memmem()
141 	mem = 0;  in twoway_memmem()
146 		if (z - h < l)  in twoway_memmem()
150 		if (BITOP(byteset, h[l - 1], &)) {  in twoway_memmem()
151 			k = l - shift[h[l - 1]];  in twoway_memmem()
153 				if (k < mem)  in twoway_memmem()
154 					k = mem;  in twoway_memmem()
156 				mem = 0;  in twoway_memmem()
161 			mem = 0;  in twoway_memmem()
166 		for (k = MAX(ms + 1, mem); k < l && n[k] == h[k]; k++)  in twoway_memmem()
169 			h += k - ms;  in twoway_memmem()
170 			mem = 0;  in twoway_memmem()
174 		for (k = ms + 1; k > mem && n[k - 1] == h[k - 1]; k--)  in twoway_memmem()
176 		if (k <= mem)  in twoway_memmem()
179 		mem = mem0;  in twoway_memmem()
200 	k -= h - (const unsigned char *)h0;  in memmem()