mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-01 03:53:33 +00:00
791f79fcb3
- We now serialize the file descriptor table when spawning / executing processes on Windows. This means you can now inherit more stuff than just standard i/o. It's needed by bash, which duplicates the console to file descriptor #255. We also now do a better job serializing the environment variables, so you're less likely to encounter E2BIG when using your bash shell. We also no longer coerce environ to uppercase - execve() on Windows now remotely controls its parent process to make them spawn a replacement for itself. Then it'll be able to terminate immediately once the spawn succeeds, without having to linger around for the lifetime as a shell process for proxying the exit code. When process worker thread running in the parent sees the child die, it's given a handle to the new child, to replace it in the process table. - execve() and posix_spawn() on Windows will now provide CreateProcess an explicit handle list. This allows us to remove handle locks which enables better fork/spawn concurrency, with seriously correct thread safety. Other codebases like Go use the same technique. On the other hand fork() still favors the conventional WIN32 inheritence approach which can be a little bit messy, but is *controlled* by guaranteeing perfectly clean slates at both the spawning and execution boundaries - sigset_t is now 64 bits. Having it be 128 bits was a mistake because there's no reason to use that and it's only supported by FreeBSD. By using the system word size, signal mask manipulation on Windows goes very fast. Furthermore @asyncsignalsafe funcs have been rewritten on Windows to take advantage of signal masking, now that it's much more pleasant to use. - All the overlapped i/o code on Windows has been rewritten for pretty good signal and cancelation safety. We're now able to ensure overlap data structures are cleaned up so long as you don't longjmp() out of out of a signal handler that interrupted an i/o operation. Latencies are also improved thanks to the removal of lots of "busy wait" code. Waits should be optimal for everything except poll(), which shall be the last and final demon we slay in the win32 i/o horror show. - getrusage() on Windows is now able to report RUSAGE_CHILDREN as well as RUSAGE_SELF, thanks to aggregation in the process manager thread.
164 lines
6 KiB
C
164 lines
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 2022 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/assert.h"
|
|
#include "libc/atomic.h"
|
|
#include "libc/dce.h"
|
|
#include "libc/intrin/atomic.h"
|
|
#include "libc/intrin/strace.internal.h"
|
|
#include "libc/intrin/weaken.h"
|
|
#include "libc/limits.h"
|
|
#include "libc/mem/gc.h"
|
|
#include "libc/mem/mem.h"
|
|
#include "libc/runtime/internal.h"
|
|
#include "libc/runtime/runtime.h"
|
|
#include "libc/thread/posixthread.internal.h"
|
|
#include "libc/thread/thread.h"
|
|
#include "libc/thread/tls.h"
|
|
#include "third_party/nsync/futex.internal.h"
|
|
|
|
void _pthread_unwind(struct PosixThread *pt) {
|
|
struct _pthread_cleanup_buffer *cb;
|
|
while ((cb = pt->pt_cleanup)) {
|
|
pt->pt_cleanup = cb->__prev;
|
|
cb->__routine(cb->__arg);
|
|
}
|
|
}
|
|
|
|
void _pthread_unkey(struct CosmoTib *tib) {
|
|
int i, j, gotsome;
|
|
void *val, **keys;
|
|
pthread_key_dtor dtor;
|
|
if ((keys = tib->tib_keys)) {
|
|
for (j = 0; j < PTHREAD_DESTRUCTOR_ITERATIONS; ++j) {
|
|
for (gotsome = i = 0; i < PTHREAD_KEYS_MAX; ++i) {
|
|
if ((val = keys[i]) &&
|
|
(dtor = atomic_load_explicit(_pthread_key_dtor + i,
|
|
memory_order_relaxed)) &&
|
|
dtor != (pthread_key_dtor)-1) {
|
|
gotsome = 1;
|
|
keys[i] = 0;
|
|
dtor(val);
|
|
}
|
|
}
|
|
if (!gotsome) {
|
|
break;
|
|
}
|
|
}
|
|
free(keys);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Terminates current POSIX thread.
|
|
*
|
|
* For example, a thread could terminate early as follows:
|
|
*
|
|
* pthread_exit((void *)123);
|
|
*
|
|
* The result value could then be obtained when joining the thread:
|
|
*
|
|
* void *rc;
|
|
* pthread_join(id, &rc);
|
|
* assert((intptr_t)rc == 123);
|
|
*
|
|
* Under normal circumstances a thread can exit by simply returning from
|
|
* the callback function that was supplied to pthread_create(). This may
|
|
* be used if the thread wishes to exit at any other point in the thread
|
|
* lifecycle, in which case this function is responsible for ensuring we
|
|
* invoke _gc(), _defer(), and pthread_cleanup_push() callbacks, as well
|
|
* as pthread_key_create() destructors.
|
|
*
|
|
* If the current thread is an orphaned thread, or is the main thread
|
|
* when no other threads were created, then this will terminated your
|
|
* process with an exit code of zero. It's not possible to supply a
|
|
* non-zero exit status to wait4() via this function.
|
|
*
|
|
* Once a thread has exited, access to its stack memory is undefined.
|
|
* The behavior of calling pthread_exit() from cleanup handlers and key
|
|
* destructors is also undefined.
|
|
*
|
|
* @param rc is reported later to pthread_join()
|
|
* @noreturn
|
|
*/
|
|
wontreturn void pthread_exit(void *rc) {
|
|
struct CosmoTib *tib;
|
|
struct PosixThread *pt;
|
|
enum PosixThreadStatus status, transition;
|
|
|
|
tib = __get_tls();
|
|
pt = (struct PosixThread *)tib->tib_pthread;
|
|
pt->pt_flags |= PT_NOCANCEL;
|
|
pt->pt_rc = rc;
|
|
|
|
STRACE("pthread_exit(%p)", rc);
|
|
|
|
// free resources
|
|
_pthread_unwind(pt);
|
|
_pthread_unkey(tib);
|
|
_pthread_ungarbage();
|
|
_pthread_decimate();
|
|
|
|
// run atexit handlers if orphaned thread
|
|
if (pthread_orphan_np()) {
|
|
if (_weaken(__cxa_finalize)) {
|
|
_weaken(__cxa_finalize)(NULL);
|
|
}
|
|
}
|
|
|
|
// transition the thread to a terminated state
|
|
status = atomic_load_explicit(&pt->pt_status, memory_order_acquire);
|
|
do {
|
|
switch (status) {
|
|
case kPosixThreadJoinable:
|
|
transition = kPosixThreadTerminated;
|
|
break;
|
|
case kPosixThreadDetached:
|
|
transition = kPosixThreadZombie;
|
|
break;
|
|
default:
|
|
__builtin_unreachable();
|
|
}
|
|
} while (!atomic_compare_exchange_weak_explicit(
|
|
&pt->pt_status, &status, transition, memory_order_release,
|
|
memory_order_relaxed));
|
|
|
|
// make this thread a zombie if it was detached
|
|
if (transition == kPosixThreadZombie) {
|
|
_pthread_zombify(pt);
|
|
}
|
|
|
|
// check if this is the last survivor
|
|
if (pthread_orphan_np()) {
|
|
for (const uintptr_t *p = __fini_array_end; p > __fini_array_start;) {
|
|
((void (*)(void))(*--p))();
|
|
}
|
|
_Exit(0);
|
|
}
|
|
|
|
// check if the main thread has died whilst children live
|
|
// note that the main thread is joinable by child threads
|
|
if (pt->pt_flags & PT_STATIC) {
|
|
atomic_store_explicit(&tib->tib_tid, 0, memory_order_release);
|
|
nsync_futex_wake_(&tib->tib_tid, INT_MAX, !IsWindows() && !IsXnu());
|
|
_Exit1(0);
|
|
}
|
|
|
|
// this is a child thread
|
|
longjmp(pt->pt_exiter, 1);
|
|
}
|