mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-07 23:13:34 +00:00
I wanted a tiny scriptable meltdown proof way to run userspace programs and visualize how program execution impacts memory. It helps to explain how things like Actually Portable Executable works. It can show you how the GCC generated code is going about manipulating matrices and more. I didn't feel fully comfortable with Qemu and Bochs because I'm not smart enough to understand them. I wanted something like gVisor but with much stronger levels of assurances. I wanted a single binary that'll run, on all major operating systems with an embedded GPL barrier ZIP filesystem that is tiny enough to transpile to JavaScript and run in browsers too. https://justine.storage.googleapis.com/emulator625.mp4
97 lines
3.6 KiB
C
97 lines
3.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 2020 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ This program is free software; you can redistribute it and/or modify │
|
|
│ it under the terms of the GNU General Public License as published by │
|
|
│ the Free Software Foundation; version 2 of the License. │
|
|
│ │
|
|
│ This program is distributed in the hope that it will be useful, but │
|
|
│ WITHOUT ANY WARRANTY; without even the implied warranty of │
|
|
│ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU │
|
|
│ General Public License for more details. │
|
|
│ │
|
|
│ You should have received a copy of the GNU General Public License │
|
|
│ along with this program; if not, write to the Free Software │
|
|
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA │
|
|
│ 02110-1301 USA │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/bits/bits.h"
|
|
#include "libc/bits/initializer.h"
|
|
#include "libc/bits/safemacros.h"
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/dce.h"
|
|
#include "libc/nexgen32e/rdtsc.h"
|
|
#include "libc/nexgen32e/x86feature.h"
|
|
#include "libc/sysv/consts/clock.h"
|
|
#include "libc/time/time.h"
|
|
|
|
static struct Now {
|
|
bool once;
|
|
uint64_t k0;
|
|
long double r0, cpn;
|
|
} now_;
|
|
|
|
/**
|
|
* Returns timestamp without needing system calls.
|
|
* @note uses microsecond scale fallback on k8 or vm
|
|
*/
|
|
long double (*nowl)(void);
|
|
|
|
static long double GetTimeSample(void) {
|
|
uint64_t tick1, tick2;
|
|
long double time1, time2;
|
|
sched_yield();
|
|
time1 = dtime(CLOCK_MONOTONIC);
|
|
tick1 = rdtsc();
|
|
nanosleep(&(struct timespec){0, 100000}, NULL);
|
|
time2 = dtime(CLOCK_MONOTONIC);
|
|
tick2 = rdtsc();
|
|
return (time2 - time1) * 1e9 / (tick2 - tick1);
|
|
}
|
|
|
|
static long double MeasureNanosPerCycle(void) {
|
|
int i;
|
|
long double avg, samp;
|
|
for (avg = 1.0L, i = 1; i < 5; ++i) {
|
|
samp = GetTimeSample();
|
|
avg += (samp - avg) / i;
|
|
}
|
|
return avg;
|
|
}
|
|
|
|
static void InitTime(void) {
|
|
now_.cpn = MeasureNanosPerCycle();
|
|
now_.r0 = dtime(CLOCK_REALTIME);
|
|
now_.k0 = rdtsc();
|
|
now_.once = true;
|
|
}
|
|
|
|
long double converttickstonanos(uint64_t ticks) {
|
|
if (!now_.once) InitTime();
|
|
return ticks * now_.cpn; /* pico scale */
|
|
}
|
|
|
|
long double converttickstoseconds(uint64_t ticks) {
|
|
return 1 / 1e9 * converttickstonanos(ticks);
|
|
}
|
|
|
|
long double nowl$sys(void) {
|
|
return dtime(CLOCK_REALTIME);
|
|
}
|
|
|
|
long double nowl$art(void) {
|
|
uint64_t ticks;
|
|
if (!now_.once) InitTime();
|
|
ticks = unsignedsubtract(rdtsc(), now_.k0);
|
|
return now_.r0 + converttickstoseconds(ticks);
|
|
}
|
|
|
|
INITIALIZER(301, _init_nowl, {
|
|
if (X86_HAVE(INVTSC)) {
|
|
nowl = nowl$art;
|
|
} else {
|
|
nowl = nowl$sys;
|
|
}
|
|
})
|