mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-07-04 02:08:30 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Make fork() go 30% faster

Browse source 
This change makes fork() go nearly as fast as sys_fork() on UNIX. As for
Windows this change shaves about 4-5ms off fork() + wait() latency. This
is accomplished by using WriteProcessMemory() from the parent process to
setup the address space of a suspended process; it is better than a pipe
This commit is contained in:
Justine Tunney 2025-01-01 04:59:38 -08:00
parent 98c5847727
commit 0b3c81dd4e
No known key found for this signature in database
GPG key ID: BE714B4575D6E328
44 changed files with 769 additions and 649 deletions
Download patch file Download diff file Expand all files Collapse all files

18
libc/intrin/tree.c
View file

@ -54,7 +54,8 @@ struct Tree *tree_prev(struct Tree *node) {
return parent;
}
static void tree_rotate_left(struct Tree **root, struct Tree *x) {
dontinstrument static void tree_rotate_left(struct Tree **root,
struct Tree *x) {
struct Tree *y = x->right;
x->right = tree_get_left(y);
if (tree_get_left(y))
@ -71,7 +72,8 @@ static void tree_rotate_left(struct Tree **root, struct Tree *x) {
x->parent = y;
}
static void tree_rotate_right(struct Tree **root, struct Tree *y) {
dontinstrument static void tree_rotate_right(struct Tree **root,
struct Tree *y) {
struct Tree *x = tree_get_left(y);
tree_set_left(y, x->right);
if (x->right)
@ -88,7 +90,8 @@ static void tree_rotate_right(struct Tree **root, struct Tree *y) {
x->right = y;
}
static void tree_rebalance_insert(struct Tree **root, struct Tree *node) {
dontinstrument static void tree_rebalance_insert(struct Tree **root,
struct Tree *node) {
struct Tree *uncle;
tree_set_red(node, 1);
while (node != *root && tree_get_red(node->parent)) {
@ -157,8 +160,8 @@ void tree_insert(struct Tree **root, struct Tree *node, tree_cmp_f *cmp) {
}
}
static void tree_transplant(struct Tree **root, struct Tree *u,
struct Tree *v) {
dontinstrument static void tree_transplant(struct Tree **root, struct Tree *u,
struct Tree *v) {
if (!u->parent) {
*root = v;
} else if (u == tree_get_left(u->parent)) {
@ -170,8 +173,9 @@ static void tree_transplant(struct Tree **root, struct Tree *u,
v->parent = u->parent;
}
static void tree_rebalance_remove(struct Tree **root, struct Tree *node,
struct Tree *parent) {
dontinstrument static void tree_rebalance_remove(struct Tree **root,
struct Tree *node,
struct Tree *parent) {
struct Tree *sibling;
while (node != *root && (!node || !tree_get_red(node))) {
if (node == tree_get_left(parent)) {