uint16_t * u16_chr (const uint16_t *s, size_t n, ucs4_t uc) { uint16_t c[2]; if (uc < 0x10000) { uint16_t c0 = uc; for (; n > 0; s++, n--) { if (*s == c0) return (uint16_t *) s; } } else switch (u16_uctomb_aux (c, uc, 2)) { case 2: if (n > 1) { uint16_t c0 = c[0]; uint16_t c1 = c[1]; for (n--; n > 0; s++, n--) { if (*s == c0 && s[1] == c1) return (uint16_t *) s; } } break; } return NULL; }
uint16_t * u16_strrchr (const uint16_t *s, ucs4_t uc) { /* Calling u16_strlen and then searching from the other end would cause more memory accesses. Avoid that, at the cost of a few more comparisons. */ uint16_t *result = NULL; uint16_t c[2]; if (uc < 0x10000) { uint16_t c0 = uc; for (;; s++) { if (*s == c0) result = (uint16_t *) s; if (*s == 0) break; } } else switch (u16_uctomb_aux (c, uc, 2)) { case 2: if (*s) { uint16_t c0 = c[0]; uint16_t c1 = c[1]; /* FIXME: Maybe walking the string via u16_mblen is a win? */ for (;; s++) { if (s[1] == 0) break; if (*s == c0 && s[1] == c1) result = (uint16_t *) s; } } break; } return result; }
uint16_t * u16_strchr (const uint16_t *s, ucs4_t uc) { uint16_t c[2]; if (uc < 0x10000) { uint16_t c0 = uc; for (;; s++) { if (*s == c0) break; if (*s == 0) goto notfound; } return (uint16_t *) s; } else switch (u16_uctomb_aux (c, uc, 2)) { case 2: if (*s == 0) goto notfound; { uint16_t c0 = c[0]; uint16_t c1 = c[1]; for (;; s++) { if (s[1] == 0) goto notfound; if (*s == c0 && s[1] == c1) break; } return (uint16_t *) s; } } notfound: return NULL; }