13 static void *malloc(size_t len);
36 void *memmove(void *dst, const void *src, size_t len)  in memmove()  argument
40 	pos = len;  in memmove()
48 	while (len) {  in memmove()
51 		len--;  in memmove()
60 void *memcpy(void *dst, const void *src, size_t len)  in memcpy()  argument
64 	while (pos < len) {  in memcpy()
77 void *memset(void *dst, int b, size_t len)  in memset()  argument
81 	while (len--) {  in memset()
130 	size_t len;  in strlen()  local
132 	for (len = 0; str[len]; len++)  in strlen()
134 	return len;  in strlen()
152 	size_t len;  in strnlen()  local
154 	for (len = 0; (len < maxlen) && str[len]; len++);  in strnlen()
155 	return len;  in strnlen()
161 	size_t len;  in strdup()  local
164 	len = strlen(str);  in strdup()
165 	ret = malloc(len + 1);  in strdup()
167 		memcpy(ret, str, len + 1);  in strdup()
175 	size_t len;  in strndup()  local
178 	len = strnlen(str, maxlen);  in strndup()
179 	ret = malloc(len + 1);  in strndup()
181 		memcpy(ret, str, len);  in strndup()
182 		ret[len] = '\0';  in strndup()
191 	size_t len = strnlen(dst, size);  in strlcat()  local
194 	 * We want len < size-1. But as size is unsigned and can wrap  in strlcat()
195 	 * around, we use len + 1 instead.  in strlcat()
197 	while (len + 1 < size) {  in strlcat()
198 		dst[len] = *src;  in strlcat()
201 		len++;  in strlcat()
205 	if (len < size)  in strlcat()
206 		dst[len] = '\0';  in strlcat()
209 		len++;  in strlcat()
211 	return len;  in strlcat()
217 	size_t len;  in strlcpy()  local
219 	for (len = 0; len < size; len++) {  in strlcpy()
220 		dst[len] = src[len];  in strlcpy()
221 		if (!dst[len])  in strlcpy()
222 			return len;  in strlcpy()
227 	while (src[len])  in strlcpy()
228 		len++;  in strlcpy()
230 	return len;  in strlcpy()
267 	size_t len;  in strncpy()  local
269 	for (len = 0; len < size; len++)  in strncpy()
270 		if ((dst[len] = *src))  in strncpy()