mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
cc1732bc42
- Perform some housekeeping on scalar math function code - Import ARM's Optimized Routines for SIMD string processing - Upgrade to latest Chromium zlib and enable more SIMD optimizations
86 lines
3.4 KiB
C
86 lines
3.4 KiB
C
/*-*- 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 2021 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ 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. │
|
|
│ │
|
|
│ 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. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/dce.h"
|
|
#include "libc/intrin/asan.internal.h"
|
|
#include "libc/nexgen32e/x86feature.h"
|
|
#include "libc/str/str.h"
|
|
#ifndef __aarch64__
|
|
|
|
typedef char xmm_t __attribute__((__vector_size__(16), __aligned__(1)));
|
|
|
|
static inline const unsigned char *memrchr_pure(const unsigned char *s,
|
|
unsigned char c, size_t n) {
|
|
size_t i;
|
|
for (i = n; i--;) {
|
|
if (s[i] == c) {
|
|
return s + i;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
#ifdef __x86_64__
|
|
noasan static inline const unsigned char *memrchr_sse(const unsigned char *s,
|
|
unsigned char c,
|
|
size_t n) {
|
|
size_t i;
|
|
unsigned k, m;
|
|
xmm_t v, t = {c, c, c, c, c, c, c, c, c, c, c, c, c, c, c, c};
|
|
for (i = n; i >= 16;) {
|
|
v = *(const xmm_t *)(s + (i -= 16));
|
|
m = __builtin_ia32_pmovmskb128(v == t);
|
|
if (m) {
|
|
m = __builtin_clzl(m) ^ (sizeof(long) * CHAR_BIT - 1);
|
|
return s + i + m;
|
|
}
|
|
}
|
|
while (i--) {
|
|
if (s[i] == c) {
|
|
return s + i;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
/**
|
|
* Returns pointer to first instance of character.
|
|
*
|
|
* @param s is memory to search
|
|
* @param c is search byte which is masked with 255
|
|
* @param n is byte length of p
|
|
* @return is pointer to first instance of c or NULL if not found
|
|
* @asyncsignalsafe
|
|
*/
|
|
void *memrchr(const void *s, int c, size_t n) {
|
|
#ifdef __x86_64__
|
|
const void *r;
|
|
if (!IsTiny() && X86_HAVE(SSE)) {
|
|
if (IsAsan()) __asan_verify(s, n);
|
|
r = memrchr_sse(s, c, n);
|
|
} else {
|
|
r = memrchr_pure(s, c, n);
|
|
}
|
|
return (void *)r;
|
|
#else
|
|
return memrchr_pure(s, c, n);
|
|
#endif
|
|
}
|
|
|
|
#endif /* __aarch64__ */
|