mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-07 23:13:34 +00:00
f4f4caab0e
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
289 lines
9.3 KiB
C
289 lines
9.3 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/errno.h"
|
|
#include "libc/limits.h"
|
|
#include "libc/log/check.h"
|
|
#include "libc/mem/mem.h"
|
|
#include "libc/runtime/memtrack.h"
|
|
#include "libc/runtime/runtime.h"
|
|
#include "libc/stdio/stdio.h"
|
|
#include "libc/str/str.h"
|
|
#include "libc/testlib/testlib.h"
|
|
|
|
static bool AreMemoryIntervalsEqual(const struct MemoryIntervals *mm1,
|
|
const struct MemoryIntervals *mm2) {
|
|
if (mm1->i != mm2->i) return false;
|
|
if (memcmp(mm1->p, mm2->p, mm1->i * sizeof(*mm2->p)) != 0) return false;
|
|
if (memcmp(mm1->h, mm2->h, mm1->i * sizeof(*mm2->h)) != 0) return false;
|
|
return true;
|
|
}
|
|
|
|
static void PrintMemoryInterval(const struct MemoryIntervals *mm) {
|
|
int i;
|
|
for (i = 0; i < mm->i; ++i) {
|
|
if (i) fprintf(stderr, ",");
|
|
fprintf(stderr, "{%d,%d}", mm->p[i].x, mm->p[i].y);
|
|
}
|
|
fprintf(stderr, "\n");
|
|
}
|
|
|
|
static void CheckMemoryIntervalsEqual(const struct MemoryIntervals *mm1,
|
|
const struct MemoryIntervals *mm2) {
|
|
if (!AreMemoryIntervalsEqual(mm1, mm2)) {
|
|
PrintMemoryInterval(mm1);
|
|
PrintMemoryInterval(mm2);
|
|
CHECK(!"memory intervals not equal");
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
static void CheckMemoryIntervalsAreOk(const struct MemoryIntervals *mm) {
|
|
if (!AreMemoryIntervalsOk(mm)) {
|
|
PrintMemoryInterval(mm);
|
|
CHECK(!"memory intervals not ok");
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
static void RunTrackMemoryIntervalTest(const struct MemoryIntervals t[2], int x,
|
|
int y, long h) {
|
|
struct MemoryIntervals *mm;
|
|
mm = memcpy(memalign(alignof(*t), sizeof(*t)), t, sizeof(*t));
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CHECK_NE(-1, TrackMemoryInterval(mm, x, y, h));
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CheckMemoryIntervalsEqual(mm, t + 1);
|
|
free(mm);
|
|
}
|
|
|
|
static void RunReleaseMemoryIntervalsTest(const struct MemoryIntervals t[2],
|
|
int x, int y) {
|
|
struct MemoryIntervals *mm;
|
|
mm = memcpy(memalign(alignof(*t), sizeof(*t)), t, sizeof(*t));
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CHECK_NE(-1, ReleaseMemoryIntervals(mm, x, y, NULL));
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CheckMemoryIntervalsEqual(t + 1, mm);
|
|
free(mm);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestEmpty) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{0, {}, {}},
|
|
{1, {{2, 2}}, {0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 2, 2, 0);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestFull) {
|
|
int i;
|
|
struct MemoryIntervals *mm;
|
|
mm = calloc(1, sizeof(struct MemoryIntervals));
|
|
for (i = 0; i < ARRAYLEN(mm->p); ++i) {
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CHECK_NE(-1, TrackMemoryInterval(mm, i, i, i));
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
}
|
|
CHECK_EQ(-1, TrackMemoryInterval(mm, i, i, i));
|
|
CHECK_EQ(ENOMEM, errno);
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
free(mm);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestAppend) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{2, 2}}, {0}},
|
|
{1, {{2, 3}}, {0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 3, 3, 0);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestPrepend) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{2, 2}}, {0}},
|
|
{1, {{1, 2}}, {0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 1, 1, 0);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestFillHole) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{4, {{1, 1}, {3, 4}, {5, 5}, {6, 8}}, {0, 0, 1, 0}},
|
|
{3, {{1, 4}, {5, 5}, {6, 8}}, {0, 1, 0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 2, 2, 0);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestAppend2) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{2, 2}}, {0}},
|
|
{2, {{2, 2}, {3, 3}}, {0, 1}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 3, 3, 1);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestPrepend2) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{2, 2}}, {0}},
|
|
{2, {{1, 1}, {2, 2}}, {1, 0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 1, 1, 1);
|
|
}
|
|
|
|
TEST(TrackMemoryInterval, TestFillHole2) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{4, {{1, 1}, {3, 4}, {5, 5}, {6, 8}}, {0, 0, 1, 0}},
|
|
{5, {{1, 1}, {2, 2}, {3, 4}, {5, 5}, {6, 8}}, {0, 1, 0, 1, 0}},
|
|
};
|
|
RunTrackMemoryIntervalTest(mm, 2, 2, 1);
|
|
}
|
|
|
|
TEST(FindMemoryInterval, Test) {
|
|
static const struct MemoryIntervals mm[1] = {
|
|
{4,
|
|
{
|
|
[0] = {1, 1},
|
|
[1] = {3, 4},
|
|
[2] = {5, 5},
|
|
[3] = {6, 8},
|
|
},
|
|
{0, 0, 1, 0}},
|
|
};
|
|
EXPECT_EQ(0, FindMemoryInterval(mm, 0));
|
|
EXPECT_EQ(0, FindMemoryInterval(mm, 1));
|
|
EXPECT_EQ(1, FindMemoryInterval(mm, 2));
|
|
EXPECT_EQ(1, FindMemoryInterval(mm, 3));
|
|
EXPECT_EQ(1, FindMemoryInterval(mm, 4));
|
|
EXPECT_EQ(2, FindMemoryInterval(mm, 5));
|
|
EXPECT_EQ(3, FindMemoryInterval(mm, 6));
|
|
EXPECT_EQ(3, FindMemoryInterval(mm, 7));
|
|
EXPECT_EQ(3, FindMemoryInterval(mm, 8));
|
|
EXPECT_EQ(4, FindMemoryInterval(mm, 9));
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestEmpty) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{0, {}, {}},
|
|
{0, {}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 2, 2);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestRemoveElement_UsesInclusiveRange) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{3, {{0, 0}, {2, 2}, {4, 4}}, {}},
|
|
{2, {{0, 0}, {4, 4}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 2, 2);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestPunchHole) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{0, 9}}, {}},
|
|
{2, {{0, 3}, {6, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 4, 5);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestShortenLeft) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{0, 9}}, {}},
|
|
{1, {{0, 7}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 8, 9);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestShortenRight) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{0, 9}}, {}},
|
|
{1, {{3, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 0, 2);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestShortenLeft2) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{0, 9}}, {}},
|
|
{1, {{0, 7}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 8, 11);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestShortenRight2) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{0, 9}}, {}},
|
|
{1, {{3, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, -3, 2);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestZeroZero) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{3, 9}}, {}},
|
|
{1, {{3, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 0, 0);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestNoopLeft) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{3, 9}}, {}},
|
|
{1, {{3, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 1, 2);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestNoopRight) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{1, {{3, 9}}, {}},
|
|
{1, {{3, 9}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 10, 10);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestBigFree) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{2, {{0, 3}, {6, 9}}, {}},
|
|
{0, {}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, INT_MIN, INT_MAX);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestWeirdGap) {
|
|
static const struct MemoryIntervals mm[2] = {
|
|
{3, {{10, 10}, {20, 20}, {30, 30}}, {}},
|
|
{2, {{10, 10}, {30, 30}}, {}},
|
|
};
|
|
RunReleaseMemoryIntervalsTest(mm, 15, 25);
|
|
}
|
|
|
|
TEST(ReleaseMemoryIntervals, TestOutOfMemory) {
|
|
int i;
|
|
struct MemoryIntervals *mm;
|
|
mm = calloc(1, sizeof(struct MemoryIntervals));
|
|
for (i = 0; i < ARRAYLEN(mm->p); ++i) {
|
|
CHECK_NE(-1, TrackMemoryInterval(mm, i * 10, i * 10 + 8, 0));
|
|
}
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
CHECK_EQ(-1, ReleaseMemoryIntervals(mm, 4, 4, NULL));
|
|
CHECK_EQ(ENOMEM, errno);
|
|
CheckMemoryIntervalsAreOk(mm);
|
|
free(mm);
|
|
}
|