mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-06-30 08:18:30 +00:00
Make numerous improvements
- 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
This commit is contained in:
parent
fa7b4f5bd1
commit
39bf41f4eb
806 changed files with 77494 additions and 63859 deletions
|
@ -1,74 +0,0 @@
|
|||
/*-*- 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/alg/alg.h"
|
||||
#include "libc/macros.internal.h"
|
||||
#include "libc/rand/rand.h"
|
||||
#include "libc/runtime/carsort.h"
|
||||
#include "libc/str/str.h"
|
||||
#include "libc/testlib/ezbench.h"
|
||||
#include "libc/testlib/testlib.h"
|
||||
|
||||
const int32_t kUnsorted[][2] = {
|
||||
{4, 'a'}, {65, 'b'}, {2, 'c'}, {-1, 'G'}, {-31, 'd'}, {0, 'e'},
|
||||
{99, 'f'}, {2, 'g'}, {83, 'h'}, {782, 'i'}, {1, 'j'},
|
||||
};
|
||||
|
||||
const int32_t kGolden[][2] = {
|
||||
{-31, 'd'}, {-1, 'G'}, {0, 'e'}, {1, 'j'}, {2, 'c'}, {2, 'g'},
|
||||
{4, 'a'}, {65, 'b'}, {83, 'h'}, {99, 'f'}, {782, 'i'},
|
||||
};
|
||||
|
||||
int32_t A[ARRAYLEN(kUnsorted)][2];
|
||||
int32_t B[2100][2];
|
||||
|
||||
TEST(carsort100, test) {
|
||||
memcpy(A, kUnsorted, sizeof(A));
|
||||
carsort100(ARRAYLEN(A), A);
|
||||
ASSERT_EQ(0, memcmp(&A[0], &kGolden[0], sizeof(kUnsorted)));
|
||||
}
|
||||
|
||||
TEST(carsort1000, test) {
|
||||
memcpy(A, kUnsorted, sizeof(A));
|
||||
carsort1000(ARRAYLEN(A), A);
|
||||
ASSERT_EQ(0, memcmp(&A[0], &kGolden[0], sizeof(kUnsorted)));
|
||||
}
|
||||
|
||||
TEST(qsort, test) {
|
||||
memcpy(A, kUnsorted, sizeof(A));
|
||||
qsort(A, ARRAYLEN(A), 8, cmpsl);
|
||||
ASSERT_EQ(0, memcmp(&A[0], &kGolden[0], sizeof(kUnsorted)));
|
||||
}
|
||||
|
||||
BENCH(carsort, benchMedium) {
|
||||
EZBENCH2("medium carsort100", rngset(B, sizeof(B), rand64, -1),
|
||||
carsort100(ARRAYLEN(B), B));
|
||||
EZBENCH2("medium carsort1000", rngset(B, sizeof(B), rand64, -1),
|
||||
carsort1000(ARRAYLEN(B), B));
|
||||
EZBENCH2("medium qsort", rngset(B, sizeof(B), rand64, -1),
|
||||
qsort(B, ARRAYLEN(B), 8, cmpsl));
|
||||
}
|
||||
|
||||
BENCH(carsort, benchSmall) {
|
||||
EZBENCH2("small carsort100", memcpy(A, kUnsorted, sizeof(A)),
|
||||
carsort100(ARRAYLEN(A), A));
|
||||
EZBENCH2("small carsort1000", memcpy(A, kUnsorted, sizeof(A)),
|
||||
carsort1000(ARRAYLEN(A), A));
|
||||
EZBENCH2("small qsort", memcpy(A, kUnsorted, sizeof(A)),
|
||||
qsort(A, ARRAYLEN(A), 8, cmpsl));
|
||||
}
|
|
@ -25,9 +25,9 @@ TEST(GetDosEnviron, testOneVariable) {
|
|||
#define kEnv u"A=Und wird die Welt auch in Flammen stehen\0"
|
||||
size_t max = 2;
|
||||
size_t size = sizeof(kEnv) >> 1;
|
||||
char *block = malloc(size);
|
||||
char16_t *env = memcpy(malloc(sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = malloc(max * sizeof(char *));
|
||||
char *block = calloc(1, size);
|
||||
char16_t *env = memcpy(calloc(1, sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = calloc(1, max * sizeof(char *));
|
||||
EXPECT_EQ(1, GetDosEnviron(env, block, size, envp, max));
|
||||
EXPECT_STREQ("A=Und wird die Welt auch in Flammen stehen", envp[0]);
|
||||
EXPECT_EQ(NULL, envp[1]);
|
||||
|
@ -44,9 +44,9 @@ TEST(GetDosEnviron, testTwoVariables) {
|
|||
u"𐌴𐌵𐌶𐌷=Wir werden wieder auferstehen\0")
|
||||
size_t max = 3;
|
||||
size_t size = 1024;
|
||||
char *block = malloc(size);
|
||||
char16_t *env = memcpy(malloc(sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = malloc(max * sizeof(char *));
|
||||
char *block = calloc(1, size);
|
||||
char16_t *env = memcpy(calloc(1, sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = calloc(1, max * sizeof(char *));
|
||||
EXPECT_EQ(2, GetDosEnviron(env, block, size, envp, max));
|
||||
EXPECT_STREQ("𐌰𐌱𐌲𐌳=Und wird die Welt auch in Flammen stehen", envp[0]);
|
||||
EXPECT_STREQ("𐌴𐌵𐌶𐌷=Wir werden wieder auferstehen", envp[1]);
|
||||
|
@ -61,9 +61,9 @@ TEST(GetDosEnviron, testOverrun_truncatesWithGrace) {
|
|||
#define kEnv u"A=Und wird die Welt auch in Flammen stehen\0"
|
||||
size_t max = 2;
|
||||
size_t size = sizeof(kEnv) >> 2;
|
||||
char *block = malloc(size);
|
||||
char16_t *env = memcpy(malloc(sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = malloc(max * sizeof(char *));
|
||||
char *block = calloc(1, size);
|
||||
char16_t *env = memcpy(calloc(1, sizeof(kEnv)), kEnv, sizeof(kEnv));
|
||||
char **envp = calloc(1, max * sizeof(char *));
|
||||
EXPECT_EQ(1, GetDosEnviron(env, block, size, envp, max));
|
||||
EXPECT_STREQ("A=Und wird die Welt ", envp[0]);
|
||||
EXPECT_EQ(NULL, envp[1]);
|
||||
|
@ -80,7 +80,7 @@ TEST(GetDosEnviron, testEmpty_doesntTouchMemory) {
|
|||
|
||||
TEST(GetDosEnviron, testEmpty_zeroTerminatesWheneverPossible_1) {
|
||||
size_t max = 1;
|
||||
char **envp = malloc(max * sizeof(char *));
|
||||
char **envp = calloc(1, max * sizeof(char *));
|
||||
EXPECT_EQ(0, GetDosEnviron(u"", NULL, 0, envp, max));
|
||||
EXPECT_EQ(NULL, envp[0]);
|
||||
free(envp);
|
||||
|
@ -88,7 +88,7 @@ TEST(GetDosEnviron, testEmpty_zeroTerminatesWheneverPossible_1) {
|
|||
|
||||
TEST(GetDosEnviron, testEmpty_zeroTerminatesWheneverPossible_2) {
|
||||
size_t size = 1;
|
||||
char *block = malloc(size);
|
||||
char *block = calloc(1, size);
|
||||
EXPECT_EQ(0, GetDosEnviron(u"", block, size, NULL, 0));
|
||||
EXPECT_BINEQ(u" ", block);
|
||||
free(block);
|
||||
|
@ -96,7 +96,7 @@ TEST(GetDosEnviron, testEmpty_zeroTerminatesWheneverPossible_2) {
|
|||
|
||||
TEST(GetDosEnviron, testEmpty_zeroTerminatesWheneverPossible_3) {
|
||||
size_t size = 2;
|
||||
char *block = malloc(size);
|
||||
char *block = calloc(1, size);
|
||||
EXPECT_EQ(0, GetDosEnviron(u"", block, size, NULL, 0));
|
||||
EXPECT_BINEQ(u" ", block);
|
||||
free(block);
|
||||
|
|
|
@ -20,6 +20,8 @@
|
|||
#include "libc/limits.h"
|
||||
#include "libc/macros.internal.h"
|
||||
#include "libc/mem/mem.h"
|
||||
#include "libc/nt/enum/version.h"
|
||||
#include "libc/runtime/runtime.h"
|
||||
#include "libc/stdio/stdio.h"
|
||||
#include "libc/str/str.h"
|
||||
#include "libc/testlib/testlib.h"
|
||||
|
|
|
@ -320,19 +320,3 @@ TEST(ReleaseMemoryIntervals, TestWeirdGap) {
|
|||
mm[1].p = mm[1].s;
|
||||
EXPECT_NE(-1, RunReleaseMemoryIntervalsTest(mm, 15, 25));
|
||||
}
|
||||
|
||||
TEST(ReleaseMemoryIntervals, TestOutOfMemory_AllocatesMore) {
|
||||
int i;
|
||||
struct MemoryIntervals *mm;
|
||||
mm = calloc(1, sizeof(struct MemoryIntervals));
|
||||
mm->n = OPEN_MAX;
|
||||
mm->p = mm->s;
|
||||
for (i = 0; i < OPEN_MAX * 2; ++i) {
|
||||
CHECK_NE(-1, TrackMemoryInterval(mm, i * 10, i * 10 + 8, 0, 0, 0));
|
||||
}
|
||||
CheckMemoryIntervalsAreOk(mm);
|
||||
CHECK_EQ(0, ReleaseMemoryIntervals(mm, 4, 4, NULL));
|
||||
CheckMemoryIntervalsAreOk(mm);
|
||||
free(mm->p);
|
||||
free(mm);
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue