1 19a8d9fe 2022-10-31 op /*	$OpenBSD: memmem.c,v 1.5 2020/04/16 12:39:28 claudio Exp $ */
  2 19a8d9fe 2022-10-31 op 
  3 19a8d9fe 2022-10-31 op /*
  4 19a8d9fe 2022-10-31 op  * Copyright (c) 2005-2020 Rich Felker, et al.
  5 19a8d9fe 2022-10-31 op  *
  6 19a8d9fe 2022-10-31 op  * Permission is hereby granted, free of charge, to any person obtaining
  7 19a8d9fe 2022-10-31 op  * a copy of this software and associated documentation files (the
  8 19a8d9fe 2022-10-31 op  * "Software"), to deal in the Software without restriction, including
  9 19a8d9fe 2022-10-31 op  * without limitation the rights to use, copy, modify, merge, publish,
 10 19a8d9fe 2022-10-31 op  * distribute, sublicense, and/or sell copies of the Software, and to
 11 19a8d9fe 2022-10-31 op  * permit persons to whom the Software is furnished to do so, subject to
 12 19a8d9fe 2022-10-31 op  * the following conditions:
 13 19a8d9fe 2022-10-31 op  *
 14 19a8d9fe 2022-10-31 op  * The above copyright notice and this permission notice shall be
 15 19a8d9fe 2022-10-31 op  * included in all copies or substantial portions of the Software.
 16 19a8d9fe 2022-10-31 op  *
 17 19a8d9fe 2022-10-31 op  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 18 19a8d9fe 2022-10-31 op  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 19 19a8d9fe 2022-10-31 op  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 20 19a8d9fe 2022-10-31 op  * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 21 19a8d9fe 2022-10-31 op  * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 22 19a8d9fe 2022-10-31 op  * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 23 19a8d9fe 2022-10-31 op  * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 24 19a8d9fe 2022-10-31 op  */
 25 19a8d9fe 2022-10-31 op 
 26 19a8d9fe 2022-10-31 op #include <string.h>
 27 19a8d9fe 2022-10-31 op #include <stdint.h>
 28 19a8d9fe 2022-10-31 op 
 29 19a8d9fe 2022-10-31 op static char *
 30 19a8d9fe 2022-10-31 op twobyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
 31 19a8d9fe 2022-10-31 op {
 32 19a8d9fe 2022-10-31 op 	uint16_t nw = n[0]<<8 | n[1], hw = h[0]<<8 | h[1];
 33 19a8d9fe 2022-10-31 op 	for (h+=2, k-=2; k; k--, hw = hw<<8 | *h++)
 34 19a8d9fe 2022-10-31 op 		if (hw == nw) return (char *)h-2;
 35 19a8d9fe 2022-10-31 op 	return hw == nw ? (char *)h-2 : 0;
 36 19a8d9fe 2022-10-31 op }
 37 19a8d9fe 2022-10-31 op 
 38 19a8d9fe 2022-10-31 op static char *
 39 19a8d9fe 2022-10-31 op threebyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
 40 19a8d9fe 2022-10-31 op {
 41 19a8d9fe 2022-10-31 op 	uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8;
 42 19a8d9fe 2022-10-31 op 	uint32_t hw = h[0]<<24 | h[1]<<16 | h[2]<<8;
 43 19a8d9fe 2022-10-31 op 	for (h+=3, k-=3; k; k--, hw = (hw|*h++)<<8)
 44 19a8d9fe 2022-10-31 op 		if (hw == nw) return (char *)h-3;
 45 19a8d9fe 2022-10-31 op 	return hw == nw ? (char *)h-3 : 0;
 46 19a8d9fe 2022-10-31 op }
 47 19a8d9fe 2022-10-31 op 
 48 19a8d9fe 2022-10-31 op static char *
 49 19a8d9fe 2022-10-31 op fourbyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
 50 19a8d9fe 2022-10-31 op {
 51 19a8d9fe 2022-10-31 op 	uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8 | n[3];
 52 19a8d9fe 2022-10-31 op 	uint32_t hw = h[0]<<24 | h[1]<<16 | h[2]<<8 | h[3];
 53 19a8d9fe 2022-10-31 op 	for (h+=4, k-=4; k; k--, hw = hw<<8 | *h++)
 54 19a8d9fe 2022-10-31 op 		if (hw == nw) return (char *)h-4;
 55 19a8d9fe 2022-10-31 op 	return hw == nw ? (char *)h-4 : 0;
 56 19a8d9fe 2022-10-31 op }
 57 19a8d9fe 2022-10-31 op 
 58 19a8d9fe 2022-10-31 op #define MAX(a,b) ((a)>(b)?(a):(b))
 59 19a8d9fe 2022-10-31 op #define MIN(a,b) ((a)<(b)?(a):(b))
 60 19a8d9fe 2022-10-31 op 
 61 19a8d9fe 2022-10-31 op #define BITOP(a,b,op) \
 62 19a8d9fe 2022-10-31 op  ((a)[(size_t)(b)/(8*sizeof *(a))] op (size_t)1<<((size_t)(b)%(8*sizeof *(a))))
 63 19a8d9fe 2022-10-31 op 
 64 19a8d9fe 2022-10-31 op /*
 65 19a8d9fe 2022-10-31 op  * Maxime Crochemore and Dominique Perrin, Two-way string-matching,
 66 19a8d9fe 2022-10-31 op  * Journal of the ACM, 38(3):651-675, July 1991.
 67 19a8d9fe 2022-10-31 op  */
 68 19a8d9fe 2022-10-31 op static char *
 69 19a8d9fe 2022-10-31 op twoway_memmem(const unsigned char *h, const unsigned char *z,
 70 19a8d9fe 2022-10-31 op     const unsigned char *n, size_t l)
 71 19a8d9fe 2022-10-31 op {
 72 19a8d9fe 2022-10-31 op 	size_t i, ip, jp, k, p, ms, p0, mem, mem0;
 73 19a8d9fe 2022-10-31 op 	size_t byteset[32 / sizeof(size_t)] = { 0 };
 74 19a8d9fe 2022-10-31 op 	size_t shift[256];
 75 19a8d9fe 2022-10-31 op 
 76 19a8d9fe 2022-10-31 op 	/* Computing length of needle and fill shift table */
 77 19a8d9fe 2022-10-31 op 	for (i=0; i<l; i++)
 78 19a8d9fe 2022-10-31 op 		BITOP(byteset, n[i], |=), shift[n[i]] = i+1;
 79 19a8d9fe 2022-10-31 op 
 80 19a8d9fe 2022-10-31 op 	/* Compute maximal suffix */
 81 19a8d9fe 2022-10-31 op 	ip = -1; jp = 0; k = p = 1;
 82 19a8d9fe 2022-10-31 op 	while (jp+k<l) {
 83 19a8d9fe 2022-10-31 op 		if (n[ip+k] == n[jp+k]) {
 84 19a8d9fe 2022-10-31 op 			if (k == p) {
 85 19a8d9fe 2022-10-31 op 				jp += p;
 86 19a8d9fe 2022-10-31 op 				k = 1;
 87 19a8d9fe 2022-10-31 op 			} else k++;
 88 19a8d9fe 2022-10-31 op 		} else if (n[ip+k] > n[jp+k]) {
 89 19a8d9fe 2022-10-31 op 			jp += k;
 90 19a8d9fe 2022-10-31 op 			k = 1;
 91 19a8d9fe 2022-10-31 op 			p = jp - ip;
 92 19a8d9fe 2022-10-31 op 		} else {
 93 19a8d9fe 2022-10-31 op 			ip = jp++;
 94 19a8d9fe 2022-10-31 op 			k = p = 1;
 95 19a8d9fe 2022-10-31 op 		}
 96 19a8d9fe 2022-10-31 op 	}
 97 19a8d9fe 2022-10-31 op 	ms = ip;
 98 19a8d9fe 2022-10-31 op 	p0 = p;
 99 19a8d9fe 2022-10-31 op 
100 19a8d9fe 2022-10-31 op 	/* And with the opposite comparison */
101 19a8d9fe 2022-10-31 op 	ip = -1; jp = 0; k = p = 1;
102 19a8d9fe 2022-10-31 op 	while (jp+k<l) {
103 19a8d9fe 2022-10-31 op 		if (n[ip+k] == n[jp+k]) {
104 19a8d9fe 2022-10-31 op 			if (k == p) {
105 19a8d9fe 2022-10-31 op 				jp += p;
106 19a8d9fe 2022-10-31 op 				k = 1;
107 19a8d9fe 2022-10-31 op 			} else k++;
108 19a8d9fe 2022-10-31 op 		} else if (n[ip+k] < n[jp+k]) {
109 19a8d9fe 2022-10-31 op 			jp += k;
110 19a8d9fe 2022-10-31 op 			k = 1;
111 19a8d9fe 2022-10-31 op 			p = jp - ip;
112 19a8d9fe 2022-10-31 op 		} else {
113 19a8d9fe 2022-10-31 op 			ip = jp++;
114 19a8d9fe 2022-10-31 op 			k = p = 1;
115 19a8d9fe 2022-10-31 op 		}
116 19a8d9fe 2022-10-31 op 	}
117 19a8d9fe 2022-10-31 op 	if (ip+1 > ms+1) ms = ip;
118 19a8d9fe 2022-10-31 op 	else p = p0;
119 19a8d9fe 2022-10-31 op 
120 19a8d9fe 2022-10-31 op 	/* Periodic needle? */
121 19a8d9fe 2022-10-31 op 	if (memcmp(n, n+p, ms+1)) {
122 19a8d9fe 2022-10-31 op 		mem0 = 0;
123 19a8d9fe 2022-10-31 op 		p = MAX(ms, l-ms-1) + 1;
124 19a8d9fe 2022-10-31 op 	} else mem0 = l-p;
125 19a8d9fe 2022-10-31 op 	mem = 0;
126 19a8d9fe 2022-10-31 op 
127 19a8d9fe 2022-10-31 op 	/* Search loop */
128 19a8d9fe 2022-10-31 op 	for (;;) {
129 19a8d9fe 2022-10-31 op 		/* If remainder of haystack is shorter than needle, done */
130 19a8d9fe 2022-10-31 op 		if (z-h < l) return 0;
131 19a8d9fe 2022-10-31 op 
132 19a8d9fe 2022-10-31 op 		/* Check last byte first; advance by shift on mismatch */
133 19a8d9fe 2022-10-31 op 		if (BITOP(byteset, h[l-1], &)) {
134 19a8d9fe 2022-10-31 op 			k = l-shift[h[l-1]];
135 19a8d9fe 2022-10-31 op 			if (k) {
136 19a8d9fe 2022-10-31 op 				if (k < mem) k = mem;
137 19a8d9fe 2022-10-31 op 				h += k;
138 19a8d9fe 2022-10-31 op 				mem = 0;
139 19a8d9fe 2022-10-31 op 				continue;
140 19a8d9fe 2022-10-31 op 			}
141 19a8d9fe 2022-10-31 op 		} else {
142 19a8d9fe 2022-10-31 op 			h += l;
143 19a8d9fe 2022-10-31 op 			mem = 0;
144 19a8d9fe 2022-10-31 op 			continue;
145 19a8d9fe 2022-10-31 op 		}
146 19a8d9fe 2022-10-31 op 
147 19a8d9fe 2022-10-31 op 		/* Compare right half */
148 19a8d9fe 2022-10-31 op 		for (k=MAX(ms+1,mem); k<l && n[k] == h[k]; k++);
149 19a8d9fe 2022-10-31 op 		if (k < l) {
150 19a8d9fe 2022-10-31 op 			h += k-ms;
151 19a8d9fe 2022-10-31 op 			mem = 0;
152 19a8d9fe 2022-10-31 op 			continue;
153 19a8d9fe 2022-10-31 op 		}
154 19a8d9fe 2022-10-31 op 		/* Compare left half */
155 19a8d9fe 2022-10-31 op 		for (k=ms+1; k>mem && n[k-1] == h[k-1]; k--);
156 19a8d9fe 2022-10-31 op 		if (k <= mem) return (char *)h;
157 19a8d9fe 2022-10-31 op 		h += p;
158 19a8d9fe 2022-10-31 op 		mem = mem0;
159 19a8d9fe 2022-10-31 op 	}
160 19a8d9fe 2022-10-31 op }
161 19a8d9fe 2022-10-31 op 
162 19a8d9fe 2022-10-31 op void *
163 19a8d9fe 2022-10-31 op memmem(const void *h0, size_t k, const void *n0, size_t l)
164 19a8d9fe 2022-10-31 op {
165 19a8d9fe 2022-10-31 op 	const unsigned char *h = h0, *n = n0;
166 19a8d9fe 2022-10-31 op 
167 19a8d9fe 2022-10-31 op 	/* Return immediately on empty needle */
168 19a8d9fe 2022-10-31 op 	if (!l) return (void *)h;
169 19a8d9fe 2022-10-31 op 
170 19a8d9fe 2022-10-31 op 	/* Return immediately when needle is longer than haystack */
171 19a8d9fe 2022-10-31 op 	if (k<l) return 0;
172 19a8d9fe 2022-10-31 op 
173 19a8d9fe 2022-10-31 op 	/* Use faster algorithms for short needles */
174 19a8d9fe 2022-10-31 op 	h = memchr(h0, *n, k);
175 19a8d9fe 2022-10-31 op 	if (!h || l==1) return (void *)h;
176 19a8d9fe 2022-10-31 op 	k -= h - (const unsigned char *)h0;
177 19a8d9fe 2022-10-31 op 	if (k<l) return 0;
178 19a8d9fe 2022-10-31 op 	if (l==2) return twobyte_memmem(h, k, n);
179 19a8d9fe 2022-10-31 op 	if (l==3) return threebyte_memmem(h, k, n);
180 19a8d9fe 2022-10-31 op 	if (l==4) return fourbyte_memmem(h, k, n);
181 19a8d9fe 2022-10-31 op 
182 19a8d9fe 2022-10-31 op 	return twoway_memmem(h, h+k, n, l);
183 19a8d9fe 2022-10-31 op }