2020-06-15 14:18:57 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2022-08-07 00:18:40 +00:00
|
|
|
#include "libc/bits/likely.h"
|
|
|
|
#include "libc/dce.h"
|
|
|
|
#include "libc/intrin/asan.internal.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/str/str.h"
|
|
|
|
|
2022-08-07 00:18:40 +00:00
|
|
|
typedef char xmm_t __attribute__((__vector_size__(16), __aligned__(16)));
|
|
|
|
|
2020-06-15 14:18:57 +00:00
|
|
|
/**
|
|
|
|
* Searches for fixed-length substring in memory region.
|
|
|
|
*
|
|
|
|
* @param haystack is the region of memory to be searched
|
|
|
|
* @param haystacklen is its character count
|
|
|
|
* @param needle contains the memory for which we're searching
|
|
|
|
* @param needlelen is its character count
|
|
|
|
* @return pointer to first result or NULL if not found
|
|
|
|
*/
|
2022-08-07 00:18:40 +00:00
|
|
|
noasan void *memmem(const void *haystack, size_t haystacklen,
|
|
|
|
const void *needle, size_t needlelen) {
|
|
|
|
char c;
|
|
|
|
xmm_t n, *v;
|
|
|
|
unsigned i, k, m;
|
|
|
|
const char *p, *q, *e;
|
|
|
|
if (IsAsan()) __asan_verify(needle, needlelen);
|
|
|
|
if (IsAsan()) __asan_verify(haystack, haystacklen);
|
2020-10-06 06:11:49 +00:00
|
|
|
if (!needlelen) return haystack;
|
2022-08-07 00:18:40 +00:00
|
|
|
if (UNLIKELY(needlelen > haystacklen)) return 0;
|
|
|
|
q = needle;
|
|
|
|
c = *q;
|
|
|
|
n = (xmm_t){c, c, c, c, c, c, c, c, c, c, c, c, c, c, c, c};
|
|
|
|
p = haystack;
|
|
|
|
e = p + haystacklen;
|
|
|
|
k = (uintptr_t)p & 15;
|
|
|
|
v = (const xmm_t *)((uintptr_t)p & -16);
|
|
|
|
m = __builtin_ia32_pmovmskb128(*v == n);
|
|
|
|
m >>= k;
|
|
|
|
m <<= k;
|
|
|
|
for (;;) {
|
|
|
|
while (!m) {
|
|
|
|
++v;
|
|
|
|
if ((const char *)v >= e) return 0;
|
|
|
|
m = __builtin_ia32_pmovmskb128(*v == n);
|
2021-05-03 19:09:35 +00:00
|
|
|
}
|
2022-08-07 00:18:40 +00:00
|
|
|
do {
|
|
|
|
k = __builtin_ctzl(m);
|
|
|
|
p = (const char *)v + k;
|
|
|
|
if (UNLIKELY(p + needlelen > e)) return 0;
|
|
|
|
for (i = 1;; ++i) {
|
|
|
|
if (i == needlelen) return (/*unconst*/ char *)p;
|
|
|
|
if (p[i] != q[i]) break;
|
2021-05-03 19:09:35 +00:00
|
|
|
}
|
2022-08-07 00:18:40 +00:00
|
|
|
m &= ~(1 << k);
|
|
|
|
} while (m);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|