mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
0b3c81dd4e
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
71 lines
3.7 KiB
C
71 lines
3.7 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│ vi: set et ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi │
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2024 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/fmt/conv.h"
|
|
#include "libc/intrin/describeflags.h"
|
|
#include "libc/intrin/kprintf.h"
|
|
#include "libc/macros.h"
|
|
#include "libc/nt/enum/memflags.h"
|
|
#include "libc/nt/memory.h"
|
|
#include "libc/runtime/runtime.h"
|
|
#include "libc/stdio/sysparam.h"
|
|
#include "libc/str/str.h"
|
|
|
|
static const struct DescribeFlags kNtMemState[] = {
|
|
{kNtMemCommit, "Commit"}, //
|
|
{kNtMemFree, "Free"}, //
|
|
{kNtMemReserve, "Reserve"}, //
|
|
};
|
|
|
|
const char *DescribeNtMemState(char buf[64], uint32_t x) {
|
|
return _DescribeFlags(buf, 64, kNtMemState, ARRAYLEN(kNtMemState), "kNtMem",
|
|
x);
|
|
}
|
|
|
|
static const struct DescribeFlags kNtMemType[] = {
|
|
{kNtMemImage, "Image"}, //
|
|
{kNtMemMapped, "Mapped"}, //
|
|
{kNtMemPrivate, "Private"}, //
|
|
};
|
|
|
|
const char *DescribeNtMemType(char buf[64], uint32_t x) {
|
|
return _DescribeFlags(buf, 64, kNtMemType, ARRAYLEN(kNtMemType), "kNtMem", x);
|
|
}
|
|
|
|
void __print_maps_win32(int64_t hProcess, const char *addr, size_t size) {
|
|
char *p, b[5][64];
|
|
struct NtMemoryBasicInformation mi;
|
|
kprintf("%-12s %-12s %10s %16s %16s %32s %32s\n", "Allocation", "BaseAddress",
|
|
"RegionSize", "State", "Type", "AllocationProtect", "Protect");
|
|
for (p = 0;; p = (char *)mi.BaseAddress + mi.RegionSize) {
|
|
bzero(&mi, sizeof(mi));
|
|
if (!VirtualQueryEx(hProcess, p, &mi, sizeof(mi)))
|
|
break;
|
|
sizefmt(b[0], mi.RegionSize, 1024);
|
|
kprintf("%.12lx %.12lx %10s %16s %16s %32s %32s%s\n", mi.AllocationBase,
|
|
mi.BaseAddress, b[0], DescribeNtMemState(b[1], mi.State),
|
|
DescribeNtMemType(b[2], mi.Type),
|
|
_DescribeNtPageFlags(b[3], mi.AllocationProtect),
|
|
_DescribeNtPageFlags(b[4], mi.Protect),
|
|
(mi.State != kNtMemFree &&
|
|
MAX(addr, (const char *)mi.BaseAddress) <
|
|
MIN(addr + size, (const char *)mi.BaseAddress + mi.RegionSize))
|
|
? " [OVERLAPS]"
|
|
: "");
|
|
}
|
|
}
|