mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-07-04 18:28: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
|
@ -306,7 +306,7 @@ static textwindows int err_check_handle(int64_t handle) {
|
|||
}
|
||||
|
||||
static textwindows void tree_init(struct Tree *tree) {
|
||||
memset(tree, 0, sizeof *tree);
|
||||
bzero(tree, sizeof *tree);
|
||||
}
|
||||
|
||||
static textwindows void ts_tree_init(struct TsTree *ts_tree) {
|
||||
|
@ -492,7 +492,7 @@ static textwindows int port__close_iocp(struct PortState *port_state) {
|
|||
}
|
||||
|
||||
static textwindows void tree_node_init(struct TreeNode *node) {
|
||||
memset(node, 0, sizeof *node);
|
||||
bzero(node, sizeof *node);
|
||||
}
|
||||
|
||||
static textwindows void reflock_init(struct RefLock *reflock) {
|
||||
|
@ -567,7 +567,7 @@ static textwindows struct PortState *port_new(int64_t *iocp_handle_out) {
|
|||
if (!port_state) goto err1;
|
||||
iocp_handle = port__create_iocp();
|
||||
if (!iocp_handle) goto err2;
|
||||
memset(port_state, 0, sizeof *port_state);
|
||||
bzero(port_state, sizeof *port_state);
|
||||
port_state->iocp_handle = iocp_handle;
|
||||
tree_init(&port_state->sock_tree);
|
||||
queue_init(&port_state->sock_update_queue);
|
||||
|
@ -867,7 +867,7 @@ static textwindows struct PollGroup *poll_group__new(
|
|||
struct Queue *poll_group_queue = port_get_poll_group_queue(port_state);
|
||||
struct PollGroup *poll_group = malloc(sizeof *poll_group);
|
||||
if (!poll_group) RETURN_SET_ERROR(NULL, kNtErrorNotEnoughMemory);
|
||||
memset(poll_group, 0, sizeof *poll_group);
|
||||
bzero(poll_group, sizeof *poll_group);
|
||||
queue_node_init(&poll_group->queue_node);
|
||||
poll_group->port_state = port_state;
|
||||
if (afd_create_device_handle(iocp_handle, &poll_group->afd_device_handle) <
|
||||
|
@ -1225,7 +1225,7 @@ static textwindows struct SockState *sock_new(struct PortState *port_state,
|
|||
if (!poll_group) return NULL;
|
||||
sock_state = sock__alloc();
|
||||
if (!sock_state) goto err1;
|
||||
memset(sock_state, 0, sizeof *sock_state);
|
||||
bzero(sock_state, sizeof *sock_state);
|
||||
sock_state->base_socket = base_socket;
|
||||
sock_state->poll_group = poll_group;
|
||||
tree_node_init(&sock_state->tree_node);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue