mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-03-05 16:36:26 +00:00
39bf41f4eb
- Python static hello world now 1.8mb
- Python static fully loaded now 10mb
- Python HTTPS client now uses MbedTLS
- Python REPL now completes import stmts
- Increase stack size for Python for now
- Begin synthesizing posixpath and ntpath
- Restore Python \N{UNICODE NAME} support
- Restore Python NFKD symbol normalization
- Add optimized code path for Intel SHA-NI
- Get more Python unit tests passing faster
- Get Python help() pagination working on NT
- Python hashlib now supports MbedTLS PBKDF2
- Make memcpy/memmove/memcmp/bcmp/etc. faster
- Add Mersenne Twister and Vigna to LIBC_RAND
- Provide privileged __printf() for error code
- Fix zipos opendir() so that it reports ENOTDIR
- Add basic chmod() implementation for Windows NT
- Add Cosmo's best functions to Python cosmo module
- Pin function trace indent depth to that of caller
- Show memory diagram on invalid access in MODE=dbg
- Differentiate stack overflow on crash in MODE=dbg
- Add stb_truetype and tools for analyzing font files
- Upgrade to UNICODE 13 and reduce its binary footprint
- COMPILE.COM now logs resource usage of build commands
- Start implementing basic poll() support on bare metal
- Set getauxval(AT_EXECFN) to GetModuleFileName() on NT
- Add descriptions to strerror() in non-TINY build modes
- Add COUNTBRANCH() macro to help with micro-optimizations
- Make error / backtrace / asan / memory code more unbreakable
- Add fast perfect C implementation of μ-Law and a-Law audio codecs
- Make strtol() functions consistent with other libc implementations
- Improve Linenoise implementation (see also github.com/jart/bestline)
- COMPILE.COM now suppresses stdout/stderr of successful build commands
95 lines
3.6 KiB
C
95 lines
3.6 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/mem/mem.h"
|
|
#include "libc/rand/rand.h"
|
|
#include "libc/runtime/gc.internal.h"
|
|
#include "libc/str/str.h"
|
|
#include "libc/testlib/ezbench.h"
|
|
#include "libc/testlib/testlib.h"
|
|
|
|
static void *golden(void *p, int c, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; ++i) ((char *)p)[i] = c;
|
|
return p;
|
|
}
|
|
|
|
TEST(memset, hug) {
|
|
char *a, *b;
|
|
int i, j, c;
|
|
for (i = 0; i < 1025; ++i) {
|
|
for (j = 0; j < 1025 - i; ++j) {
|
|
a = malloc(i + j);
|
|
b = malloc(i + j);
|
|
c = vigna();
|
|
rngset(a, i + j, vigna, 0);
|
|
memcpy(b, a, i + j);
|
|
ASSERT_EQ(a + i, golden(a + i, c, j));
|
|
ASSERT_EQ(b + i, memset(b + i, c, j));
|
|
ASSERT_EQ(0, timingsafe_bcmp(a, b, i + j));
|
|
free(b);
|
|
free(a);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST(bzero, hug) {
|
|
char *a, *b;
|
|
int i, j;
|
|
for (i = 0; i < 1025; ++i) {
|
|
for (j = 0; j < 1025 - i; ++j) {
|
|
a = malloc(i + j);
|
|
b = malloc(i + j);
|
|
rngset(a, i + j, vigna, 0);
|
|
memcpy(b, a, i + j);
|
|
golden(a + i, 0, j);
|
|
bzero(b + i, j);
|
|
ASSERT_EQ(0, timingsafe_bcmp(a, b, i + j));
|
|
free(b);
|
|
free(a);
|
|
}
|
|
}
|
|
}
|
|
|
|
BENCH(memset, bench) {
|
|
int n, max = 8 * 1024 * 1024;
|
|
char *volatile p = gc(malloc(max));
|
|
EZBENCH_N("memset", 0, memset(p, -1, 0));
|
|
for (n = 2; n <= max; n *= 2) {
|
|
EZBENCH_N("memset", n - 1, memset(p, -1, n - 1));
|
|
EZBENCH_N("memset", n, memset(p, -1, n));
|
|
}
|
|
EZBENCH_N("bzero", 0, bzero(p, 0));
|
|
for (n = 2; n <= max; n *= 2) {
|
|
EZBENCH_N("bzero", n - 1, bzero(p, n - 1));
|
|
EZBENCH_N("bzero", n, bzero(p, n));
|
|
}
|
|
}
|
|
|
|
BENCH(strlen, bench) {
|
|
volatile size_t r;
|
|
int n, max = 8 * 1024 * 1024;
|
|
char *volatile p = gc(calloc(max + 1, 1));
|
|
EZBENCH_N("strlen", 0, strlen(p));
|
|
for (n = 2; n <= max; n *= 2) {
|
|
memset(p, -1, n - 1);
|
|
EZBENCH_N("strlen", n - 1, r = strlen(p));
|
|
p[n - 1] = -1;
|
|
EZBENCH_N("strlen", n, r = strlen(p));
|
|
}
|
|
}
|