mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-08 07:23:33 +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
84 lines
3.7 KiB
C
84 lines
3.7 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 2020 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/bits/bits.h"
|
|
#include "libc/bits/safemacros.internal.h"
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/calls/struct/stat.h"
|
|
#include "libc/macros.internal.h"
|
|
#include "libc/mem/mem.h"
|
|
#include "libc/rand/rand.h"
|
|
#include "libc/runtime/memtrack.internal.h"
|
|
#include "libc/runtime/runtime.h"
|
|
#include "libc/stdio/stdio.h"
|
|
#include "libc/str/str.h"
|
|
#include "libc/sysv/consts/map.h"
|
|
#include "libc/sysv/consts/o.h"
|
|
#include "libc/sysv/consts/prot.h"
|
|
#include "libc/testlib/testlib.h"
|
|
|
|
#define N 1024
|
|
#define M 20
|
|
|
|
TEST(malloc, zeroMeansOne) {
|
|
ASSERT_GE(malloc_usable_size(malloc(0)), 1);
|
|
}
|
|
|
|
TEST(calloc, zerosMeansOne) {
|
|
ASSERT_GE(malloc_usable_size(calloc(0, 0)), 1);
|
|
}
|
|
|
|
TEST(malloc, test) {
|
|
static struct stat st;
|
|
static volatile int i, j, k, *A[4096], fds[M], *maps[M], mapsizes[M];
|
|
memset(fds, -1, sizeof(fds));
|
|
memset(maps, -1, sizeof(maps));
|
|
for (i = 0; i < N * M; ++i) {
|
|
j = rand() % ARRAYLEN(A);
|
|
if (A[j]) {
|
|
ASSERT_EQ(j, A[j][0]);
|
|
A[j] = realloc(A[j], max(sizeof(int), rand() % N));
|
|
ASSERT_NE(NULL, A[j]);
|
|
ASSERT_EQ(j, A[j][0]);
|
|
free(A[j]);
|
|
A[j] = NULL;
|
|
} else {
|
|
A[j] = malloc(max(sizeof(int), rand() % N));
|
|
ASSERT_NE(NULL, A[j]);
|
|
A[j][0] = j;
|
|
}
|
|
if (i % M == 0) {
|
|
k = rand() % M;
|
|
if (fds[k] == -1) {
|
|
ASSERT_NE(-1, (fds[k] = open(program_invocation_name, O_RDONLY)));
|
|
ASSERT_NE(-1, fstat(fds[k], &st));
|
|
ASSERT_NE(MAP_FAILED,
|
|
(maps[k] = mmap(NULL, (mapsizes[k] = st.st_size), PROT_READ,
|
|
MAP_SHARED, fds[k], 0)));
|
|
} else {
|
|
ASSERT_NE(-1, munmap(maps[k], mapsizes[k]));
|
|
ASSERT_NE(-1, close(fds[k]));
|
|
fds[k] = -1;
|
|
}
|
|
}
|
|
}
|
|
for (i = 0; i < ARRAYLEN(A); ++i) free(A[i]);
|
|
for (i = 0; i < ARRAYLEN(maps); ++i) munmap(maps[i], mapsizes[i]);
|
|
for (i = 0; i < ARRAYLEN(fds); ++i) close(fds[i]);
|
|
malloc_trim(0);
|
|
}
|