mirror of
https://github.com/jart/cosmopolitan.git
synced 2024-05-17 02:52:40 +00:00
2ab9e9f7fd
- Introduce portable sched_getcpu() api - Support GCC's __target_clones__ feature - Make fma() go faster on x86 in default mode - Remove some asan checks from core libraries - WinMain() now ensures $HOME and $USER are defined
82 lines
3.3 KiB
C
82 lines
3.3 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│ vi: set et 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/limits.h"
|
|
#include "libc/nexgen32e/x86feature.h"
|
|
#include "libc/str/str.h"
|
|
|
|
typedef char16_t xmm_t __attribute__((__vector_size__(16), __aligned__(2)));
|
|
|
|
static inline const char16_t *memrchr16_pure(const char16_t *s, char16_t c,
|
|
size_t n) {
|
|
size_t i;
|
|
for (i = n; i--;) {
|
|
if (s[i] == c) {
|
|
return s + i;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
#if defined(__x86_64__) && !defined(__chibicc__)
|
|
static inline const char16_t *memrchr16_sse(const char16_t *s, char16_t c,
|
|
size_t n) {
|
|
size_t i;
|
|
unsigned m;
|
|
xmm_t v, t = {c, c, c, c, c, c, c, c};
|
|
for (i = n; i >= 8;) {
|
|
v = *(const xmm_t *)(s + (i -= 8));
|
|
m = __builtin_ia32_pmovmskb128(v == t);
|
|
if (m) {
|
|
m = __builtin_clzl(m) ^ (sizeof(long) * CHAR_BIT - 1);
|
|
return s + i + m / 2;
|
|
}
|
|
}
|
|
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 65535
|
|
* @param n is number of char16_t elements in `s`
|
|
* @return is pointer to first instance of c or NULL if not found
|
|
* @asyncsignalsafe
|
|
*/
|
|
__vex void *memrchr16(const void *s, int c, size_t n) {
|
|
#if defined(__x86_64__) && !defined(__chibicc__)
|
|
const void *r;
|
|
if (!IsTiny() && X86_HAVE(SSE)) {
|
|
r = memrchr16_sse(s, c, n);
|
|
} else {
|
|
r = memrchr16_pure(s, c, n);
|
|
}
|
|
return (void *)r;
|
|
#else
|
|
return (void *)memrchr16_pure(s, c, n);
|
|
#endif
|
|
}
|