2021-03-08 18:56:09 +00:00
|
|
|
/*-*- 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 2021 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. │
|
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2023-09-10 15:12:43 +00:00
|
|
|
#include "libc/mem/gc.h"
|
2022-09-08 09:33:01 +00:00
|
|
|
#include "libc/assert.h"
|
|
|
|
#include "libc/intrin/likely.h"
|
|
|
|
#include "libc/mem/mem.h"
|
|
|
|
#include "libc/nexgen32e/gc.internal.h"
|
2021-03-08 18:56:09 +00:00
|
|
|
#include "libc/nexgen32e/stackframe.h"
|
|
|
|
#include "libc/runtime/runtime.h"
|
2022-09-08 09:33:01 +00:00
|
|
|
#include "libc/str/str.h"
|
2022-09-10 09:56:25 +00:00
|
|
|
#include "libc/thread/tls.h"
|
2022-09-08 09:33:01 +00:00
|
|
|
|
2022-10-10 05:38:28 +00:00
|
|
|
forceinline bool PointerNotOwnedByParentStackFrame(struct StackFrame *frame,
|
|
|
|
struct StackFrame *parent,
|
|
|
|
void *ptr) {
|
2022-09-08 09:33:01 +00:00
|
|
|
return !(((intptr_t)ptr > (intptr_t)frame) &&
|
|
|
|
((intptr_t)ptr < (intptr_t)parent));
|
|
|
|
}
|
|
|
|
|
|
|
|
// add item to garbage shadow stack.
|
|
|
|
// then rewrite caller's return address on stack.
|
|
|
|
static void DeferFunction(struct StackFrame *frame, void *fn, void *arg) {
|
|
|
|
int n2;
|
|
|
|
struct Garbage *p2;
|
|
|
|
struct Garbages *g;
|
2022-09-10 09:56:25 +00:00
|
|
|
struct CosmoTib *t;
|
|
|
|
t = __get_tls();
|
|
|
|
g = t->tib_garbages;
|
2022-09-08 09:33:01 +00:00
|
|
|
if (UNLIKELY(!g)) {
|
|
|
|
if (!(g = malloc(sizeof(struct Garbages))))
|
|
|
|
notpossible;
|
|
|
|
g->i = 0;
|
|
|
|
g->n = 4;
|
2022-09-08 18:54:56 +00:00
|
|
|
if (!(g->p = malloc(g->n * sizeof(struct Garbage))))
|
|
|
|
notpossible;
|
2022-09-10 09:56:25 +00:00
|
|
|
t->tib_garbages = g;
|
2022-09-08 09:33:01 +00:00
|
|
|
} else if (UNLIKELY(g->i == g->n)) {
|
|
|
|
p2 = g->p;
|
|
|
|
n2 = g->n + (g->n >> 1);
|
|
|
|
if ((p2 = realloc(p2, n2 * sizeof(*p2)))) {
|
|
|
|
g->p = p2;
|
|
|
|
g->n = n2;
|
|
|
|
} else {
|
|
|
|
notpossible;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
g->p[g->i].frame = frame;
|
|
|
|
g->p[g->i].fn = (intptr_t)fn;
|
|
|
|
g->p[g->i].arg = (intptr_t)arg;
|
|
|
|
g->p[g->i].ret = frame->addr;
|
|
|
|
g->i++;
|
|
|
|
frame->addr = (intptr_t)__gc;
|
|
|
|
}
|
|
|
|
|
2024-01-08 18:07:35 +00:00
|
|
|
// the gnu extension macros for gc / defer point here
|
2022-09-08 09:33:01 +00:00
|
|
|
void __defer(void *rbp, void *fn, void *arg) {
|
|
|
|
struct StackFrame *f, *frame = rbp;
|
|
|
|
f = __builtin_frame_address(0);
|
2023-07-26 20:54:49 +00:00
|
|
|
unassert(f->next == frame);
|
|
|
|
unassert(PointerNotOwnedByParentStackFrame(f, frame, arg));
|
2022-09-08 09:33:01 +00:00
|
|
|
DeferFunction(frame, fn, arg);
|
|
|
|
}
|