lama_byterun/runtime/runtime.c

1317 lines
30 KiB
C
Raw Normal View History

2018-03-04 23:13:08 +03:00
/* Runtime library */
2023-05-31 11:01:11 +02:00
#define _GNU_SOURCE 1
2021-09-28 03:02:05 +03:00
2023-05-31 11:01:11 +02:00
#include "runtime.h"
2024-02-07 12:12:46 +01:00
#include <regex.h>
2024-02-07 10:08:10 +01:00
2023-05-31 11:01:11 +02:00
#include "gc.h"
#include "runtime_common.h"
extern size_t __gc_stack_top, __gc_stack_bottom;
#define PRE_GC() \
bool flag = false; \
flag = __gc_stack_top == 0; \
if (flag) { __gc_stack_top = (size_t)__builtin_frame_address(0); } \
assert(__gc_stack_top != 0); \
2024-02-05 14:18:06 +01:00
assert((__gc_stack_top & 0xF) == 0); \
assert(__builtin_frame_address(0) <= (void *)__gc_stack_top);
#define POST_GC() \
assert(__builtin_frame_address(0) <= (void *)__gc_stack_top); \
if (flag) { __gc_stack_top = 0; }
2020-01-04 21:50:14 +03:00
static void vfailure (char *s, va_list args) {
2023-05-31 11:01:11 +02:00
fprintf(stderr, "*** FAILURE: ");
vfprintf(stderr, s, args); // vprintf (char *, va_list) <-> printf (char *, ...)
exit(255);
2020-01-04 21:50:14 +03:00
}
2021-09-28 03:02:05 +03:00
void failure (char *s, ...) {
2023-05-31 11:01:11 +02:00
va_list args;
2020-01-04 21:50:14 +03:00
2023-05-31 11:01:11 +02:00
va_start(args, s);
vfailure(s, args);
2020-01-04 21:50:14 +03:00
}
2021-01-25 01:22:56 +03:00
void Lassert (void *f, char *s, ...) {
2023-05-31 11:01:11 +02:00
if (!UNBOX(f)) {
va_list args;
2021-01-25 01:22:56 +03:00
2023-05-31 11:01:11 +02:00
va_start(args, s);
vfailure(s, args);
}
}
#define ASSERT_BOXED(memo, x) \
do \
if (UNBOXED(x)) failure("boxed value expected in %s\n", memo); \
while (0)
#define ASSERT_UNBOXED(memo, x) \
do \
if (!UNBOXED(x)) failure("unboxed value expected in %s\n", memo); \
while (0)
#define ASSERT_STRING(memo, x) \
do \
if (!UNBOXED(x) && TAG(TO_DATA(x)->data_header) != STRING_TAG) \
failure("string value expected in %s\n", memo); \
while (0)
2018-10-25 03:15:24 +03:00
extern void *Bsexp (aint* args, aint bn);
extern aint LtagHash (char *);
2020-01-14 05:15:19 +03:00
2020-01-26 07:58:11 +03:00
void *global_sysargs;
// Gets a raw data_header
extern aint LkindOf (void *p) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(p)) return UNBOXED_TAG;
2023-05-31 11:01:11 +02:00
return TAG(TO_DATA(p)->data_header);
2020-08-02 23:56:21 +03:00
}
2023-09-05 20:56:10 +02:00
// Compare s-exprs tags
extern aint LcompareTags (void *p, void *q) {
2023-05-31 11:01:11 +02:00
data *pd, *qd;
2023-05-31 11:01:11 +02:00
ASSERT_BOXED("compareTags, 0", p);
ASSERT_BOXED("compareTags, 1", q);
2023-05-31 11:01:11 +02:00
pd = TO_DATA(p);
qd = TO_DATA(q);
2023-05-31 11:01:11 +02:00
if (TAG(pd->data_header) == SEXP_TAG && TAG(qd->data_header) == SEXP_TAG) {
return BOX((TO_SEXP(p)->tag) - (TO_SEXP(q)->tag));
} else {
2024-02-06 15:39:33 +01:00
failure("not a sexpr in compareTags: %ld, %ld\n", TAG(pd->data_header), TAG(qd->data_header));
}
2023-09-05 20:56:10 +02:00
// dead code
return 0;
2020-08-04 15:48:20 +03:00
}
2020-01-14 05:15:19 +03:00
// Functional synonym for built-in operator ":";
void *Ls__Infix_58 (void** args) {
2023-05-31 11:01:11 +02:00
void *res;
2020-01-14 05:15:19 +03:00
PRE_GC();
2020-01-14 05:15:19 +03:00
aint bsexp_args[] = {(aint)args[0], (aint)args[1], LtagHash("cons")};
res = Bsexp(bsexp_args, BOX(3));
2020-01-14 05:15:19 +03:00
POST_GC();
2023-05-31 11:01:11 +02:00
return res;
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "!!";
aint Ls__Infix_3333 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured !!:1", p);
ASSERT_UNBOXED("captured !!:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) || UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "&&";
aint Ls__Infix_3838 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured &&:1", p);
ASSERT_UNBOXED("captured &&:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) && UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "==";
aint Ls__Infix_6161 (void *p, void *q) { return BOX(p == q); }
2020-01-14 05:15:19 +03:00
// Functional synonym for built-in operator "!=";
aint Ls__Infix_3361 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured !=:1", p);
ASSERT_UNBOXED("captured !=:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) != UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "<=";
aint Ls__Infix_6061 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured <=:1", p);
ASSERT_UNBOXED("captured <=:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) <= UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "<";
aint Ls__Infix_60 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured <:1", p);
ASSERT_UNBOXED("captured <:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) < UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator ">=";
aint Ls__Infix_6261 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured >=:1", p);
ASSERT_UNBOXED("captured >=:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) >= UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator ">";
aint Ls__Infix_62 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured >:1", p);
ASSERT_UNBOXED("captured >:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) > UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "+";
aint Ls__Infix_43 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured +:1", p);
ASSERT_UNBOXED("captured +:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) + UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "-";
aint Ls__Infix_45 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(p)) {
ASSERT_UNBOXED("captured -:2", q);
return BOX(UNBOX(p) - UNBOX(q));
}
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
ASSERT_BOXED("captured -:1", q);
return BOX(p - q);
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "*";
aint Ls__Infix_42 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured *:1", p);
ASSERT_UNBOXED("captured *:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) * UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "/";
aint Ls__Infix_47 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured /:1", p);
ASSERT_UNBOXED("captured /:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) / UNBOX(q));
2020-01-14 05:15:19 +03:00
}
// Functional synonym for built-in operator "%";
aint Ls__Infix_37 (void *p, void *q) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("captured %:1", p);
ASSERT_UNBOXED("captured %:2", q);
2020-01-14 05:15:19 +03:00
2023-05-31 11:01:11 +02:00
return BOX(UNBOX(p) % UNBOX(q));
2020-01-14 05:15:19 +03:00
}
2018-11-29 18:27:59 +03:00
extern aint Llength (void *p) {
2023-05-31 11:01:11 +02:00
ASSERT_BOXED(".length", p);
return BOX(LEN(TO_DATA(p)->data_header));
2018-04-30 17:18:41 +03:00
}
2023-05-31 11:01:11 +02:00
static char *chars = "_abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'";
#ifdef X86_64
#define MAX_SEXP_TAG_LEN 10
#else
#define MAX_SEXP_TAG_LEN 5
#endif
2020-09-01 17:23:36 +03:00
extern char *de_hash (aint);
2020-09-01 20:31:34 +03:00
extern aint LtagHash (char *s) {
2023-05-31 11:01:11 +02:00
char *p;
aint h = 0, limit = 0;
2023-05-31 11:01:11 +02:00
p = s;
while (*p && limit++ < MAX_SEXP_TAG_LEN) {
2023-05-31 11:01:11 +02:00
char *q = chars;
aint pos = 0;
2020-09-01 17:23:36 +03:00
2023-05-31 11:01:11 +02:00
for (; *q && *q != *p; q++, pos++)
;
2020-09-01 17:23:36 +03:00
2023-05-31 11:01:11 +02:00
if (*q) h = (h << 6) | pos;
else failure("tagHash: character not found: %c\n", *p);
2020-09-01 17:23:36 +03:00
2023-05-31 11:01:11 +02:00
p++;
}
if (strncmp(s, de_hash(h), MAX_SEXP_TAG_LEN) != 0) { failure("%s <-> %s\n", s, de_hash(h)); }
2020-09-01 17:23:36 +03:00
2023-05-31 11:01:11 +02:00
return BOX(h);
2020-09-01 17:23:36 +03:00
}
char *de_hash (aint n) {
static char buf[MAX_SEXP_TAG_LEN + 1] = {0, 0, 0, 0, 0, 0};
2023-05-31 11:01:11 +02:00
char *p = (char *)BOX(NULL);
p = &buf[MAX_SEXP_TAG_LEN];
2019-04-24 17:34:53 +03:00
2023-05-31 11:01:11 +02:00
*p-- = 0;
2023-05-31 11:01:11 +02:00
while (n != 0) {
*p-- = chars[n & 0b111111];
2023-05-31 11:01:11 +02:00
n = n >> 6;
}
2023-05-31 11:01:11 +02:00
return ++p;
2018-10-31 20:10:50 +03:00
}
typedef struct {
2023-05-31 11:01:11 +02:00
char *contents;
aint ptr;
aint len;
2018-10-31 20:10:50 +03:00
} StringBuf;
static StringBuf stringBuf;
2023-05-31 11:01:11 +02:00
#define STRINGBUF_INIT 128
2018-10-31 20:10:50 +03:00
static void createStringBuf () {
2023-05-31 11:01:11 +02:00
stringBuf.contents = (char *)malloc(STRINGBUF_INIT);
memset(stringBuf.contents, 0, STRINGBUF_INIT);
stringBuf.ptr = 0;
stringBuf.len = STRINGBUF_INIT;
2018-10-31 20:10:50 +03:00
}
2023-05-31 11:01:11 +02:00
static void deleteStringBuf () { free(stringBuf.contents); }
2018-10-31 20:10:50 +03:00
static void extendStringBuf () {
aint len = stringBuf.len << 1;
2018-10-31 20:10:50 +03:00
2023-05-31 11:01:11 +02:00
stringBuf.contents = (char *)realloc(stringBuf.contents, len);
stringBuf.len = len;
2018-10-31 20:10:50 +03:00
}
2019-12-21 02:34:56 +03:00
static void vprintStringBuf (char *fmt, va_list args) {
aint written = 0, rest = 0;
2023-05-31 11:01:11 +02:00
char *buf = (char *)BOX(NULL);
va_list vsnargs;
2023-05-31 11:01:11 +02:00
again:
va_copy(vsnargs, args);
2023-05-31 11:01:11 +02:00
buf = &stringBuf.contents[stringBuf.ptr];
rest = stringBuf.len - stringBuf.ptr;
2018-10-31 20:10:50 +03:00
2023-05-31 11:01:11 +02:00
written = vsnprintf(buf, rest, fmt, vsnargs);
2023-05-31 11:01:11 +02:00
va_end(vsnargs);
2023-05-31 11:01:11 +02:00
if (written >= rest) {
extendStringBuf();
goto again;
}
2023-05-31 11:01:11 +02:00
stringBuf.ptr += written;
2018-10-31 20:10:50 +03:00
}
2019-12-21 02:34:56 +03:00
static void printStringBuf (char *fmt, ...) {
2023-05-31 11:01:11 +02:00
va_list args;
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
va_start(args, fmt);
vprintStringBuf(fmt, args);
2019-12-21 02:34:56 +03:00
}
2018-10-31 20:10:50 +03:00
static void printValue (void *p) {
2023-05-31 11:01:11 +02:00
data *a = (data *)BOX(NULL);
aint i = BOX(0);
2023-05-31 11:01:11 +02:00
if (UNBOXED(p)) {
2024-02-06 15:39:33 +01:00
printStringBuf("%ld", UNBOX(p));
2023-05-31 11:01:11 +02:00
} else {
if (!is_valid_heap_pointer(p)) {
printStringBuf("0x%x", p);
return;
}
2018-10-31 20:10:50 +03:00
2023-05-31 11:01:11 +02:00
a = TO_DATA(p);
switch (TAG(a->data_header)) {
case STRING_TAG: printStringBuf("\"%s\"", a->contents); break;
2023-08-09 20:16:51 +02:00
case CLOSURE_TAG: {
2023-05-31 11:01:11 +02:00
printStringBuf("<closure ");
for (i = 0; i < LEN(a->data_header); i++) {
if (i) printValue((void *)((aint *)a->contents)[i]);
else printStringBuf("0x%x", (void *)((aint *)a->contents)[i]);
2023-05-31 11:01:11 +02:00
if (i != LEN(a->data_header) - 1) printStringBuf(", ");
}
2023-05-31 11:01:11 +02:00
printStringBuf(">");
break;
2023-08-09 20:16:51 +02:00
}
case ARRAY_TAG: {
2023-05-31 11:01:11 +02:00
printStringBuf("[");
for (i = 0; i < LEN(a->data_header); i++) {
printValue((void *)((aint *)a->contents)[i]);
2023-05-31 11:01:11 +02:00
if (i != LEN(a->data_header) - 1) printStringBuf(", ");
}
printStringBuf("]");
break;
2023-08-09 20:16:51 +02:00
}
2023-05-31 11:01:11 +02:00
case SEXP_TAG: {
2023-08-09 20:16:51 +02:00
sexp *sa = (sexp *)a;
char *tag = de_hash((aint)sa->tag);
2023-05-31 11:01:11 +02:00
if (strcmp(tag, "cons") == 0) {
2023-08-09 20:16:51 +02:00
sexp *sb = sa;
2023-05-31 11:01:11 +02:00
printStringBuf("{");
2023-08-09 20:16:51 +02:00
while (LEN(sb->data_header)) {
printValue((void *)((aint *)sb->contents)[0]);
aint list_next = ((aint *)sb->contents)[1];
2023-08-09 20:16:51 +02:00
if (!UNBOXED(list_next)) {
2023-05-31 11:01:11 +02:00
printStringBuf(", ");
2023-08-09 20:16:51 +02:00
sb = TO_SEXP(list_next);
2023-05-31 11:01:11 +02:00
} else break;
}
printStringBuf("}");
} else {
printStringBuf("%s", tag);
2023-08-09 20:16:51 +02:00
sexp *sexp_a = (sexp *)a;
2023-05-31 11:01:11 +02:00
if (LEN(a->data_header)) {
printStringBuf(" (");
2023-08-09 20:16:51 +02:00
for (i = 0; i < LEN(sexp_a->data_header); i++) {
printValue((void *)((aint *)sexp_a->contents)[i]);
2023-08-09 20:16:51 +02:00
if (i != LEN(sexp_a->data_header) - 1) printStringBuf(", ");
2023-05-31 11:01:11 +02:00
}
printStringBuf(")");
}
}
} break;
default: printStringBuf("*** invalid data_header: 0x%x ***", TAG(a->data_header));
2018-10-31 20:10:50 +03:00
}
2023-05-31 11:01:11 +02:00
}
2018-10-31 20:10:50 +03:00
}
2019-12-21 02:34:56 +03:00
static void stringcat (void *p) {
2023-05-31 11:01:11 +02:00
data *a;
aint i;
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
if (UNBOXED(p))
;
else {
a = TO_DATA(p);
2023-05-31 11:01:11 +02:00
switch (TAG(a->data_header)) {
case STRING_TAG: printStringBuf("%s", a->contents); break;
case SEXP_TAG: {
char *tag = de_hash(TO_SEXP(p)->tag);
if (strcmp(tag, "cons") == 0) {
sexp *b = (sexp *)a;
2023-05-31 11:01:11 +02:00
while (LEN(b->data_header)) {
stringcat((void *)((aint *)b->contents)[0]);
aint next_b = ((aint *)b->contents)[1];
if (!UNBOXED(next_b)) {
b = TO_SEXP(next_b);
2023-05-31 11:01:11 +02:00
} else break;
}
} else printStringBuf("*** non-list data_header: %s ***", tag);
} break;
default: printStringBuf("*** invalid data_header: 0x%x ***", TAG(a->data_header));
2019-12-21 02:34:56 +03:00
}
2023-05-31 11:01:11 +02:00
}
2019-12-21 02:34:56 +03:00
}
extern aint Luppercase (void *v) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("Luppercase:1", v);
return BOX(toupper((int)UNBOX(v)));
2021-10-31 15:34:34 +03:00
}
extern aint Llowercase (void *v) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("Llowercase:1", v);
return BOX(tolower((int)UNBOX(v)));
2021-10-31 15:34:34 +03:00
}
extern aint LmatchSubString (char *subj, char *patt, aint pos) {
2023-05-31 11:01:11 +02:00
data *p = TO_DATA(patt), *s = TO_DATA(subj);
aint n;
2023-05-31 11:01:11 +02:00
ASSERT_STRING("matchSubString:1", subj);
ASSERT_STRING("matchSubString:2", patt);
ASSERT_UNBOXED("matchSubString:3", pos);
2019-12-31 00:59:28 +03:00
2023-05-31 11:01:11 +02:00
n = LEN(p->data_header);
2023-05-31 11:01:11 +02:00
if (n + UNBOX(pos) > LEN(s->data_header)) return BOX(0);
2023-05-31 11:01:11 +02:00
return BOX(strncmp(subj + UNBOX(pos), patt, n) == 0);
2019-12-31 00:59:28 +03:00
}
extern void *Lsubstring (aint* args /*void *subj, aint p, aint l*/) {
data *d = TO_DATA(args[0]);
aint pp = UNBOX(args[1]), ll = UNBOX(args[2]);
ASSERT_STRING("substring:1", args[0]);
ASSERT_UNBOXED("substring:2", args[1]);
ASSERT_UNBOXED("substring:3", args[2]);
2020-01-03 01:38:49 +03:00
2023-05-31 11:01:11 +02:00
if (pp + ll <= LEN(d->data_header)) {
data *r;
2020-01-03 01:38:49 +03:00
PRE_GC();
2020-01-03 01:38:49 +03:00
push_extra_root((void**)&args[0]);
2023-05-31 11:01:11 +02:00
r = (data *)alloc_string(ll);
pop_extra_root((void**)&args[0]);
strncpy(r->contents, (char *)args[0] + pp, ll);
POST_GC();
2023-05-31 11:01:11 +02:00
return r->contents;
}
2024-02-06 15:39:33 +01:00
failure("substring: index out of bounds (position=%ld, length=%ld, subject length=%ld)",
2023-05-31 11:01:11 +02:00
pp,
ll,
LEN(d->data_header));
2024-02-07 10:08:10 +01:00
exit(1);
return NULL;
2020-01-03 01:38:49 +03:00
}
extern struct re_pattern_buffer *Lregexp (char *regexp) {
2023-05-31 11:01:11 +02:00
regex_t *b = (regex_t *)malloc(sizeof(regex_t));
/* printf ("regexp: %s,\t%x\n", regexp, b); */
2020-05-04 02:45:34 +03:00
2023-05-31 11:01:11 +02:00
memset(b, 0, sizeof(regex_t));
2020-01-03 01:38:49 +03:00
aint n = (aint)re_compile_pattern(regexp, strlen(regexp), b);
2023-05-31 11:01:11 +02:00
if (n != 0) { failure("%", strerror(n)); };
2023-05-31 11:01:11 +02:00
return b;
2020-01-03 01:38:49 +03:00
}
extern aint LregexpMatch (struct re_pattern_buffer *b, char *s, aint pos) {
aint res;
2020-05-04 02:45:34 +03:00
2023-05-31 11:01:11 +02:00
ASSERT_BOXED("regexpMatch:1", b);
ASSERT_STRING("regexpMatch:2", s);
ASSERT_UNBOXED("regexpMatch:3", pos);
2020-05-04 02:45:34 +03:00
2023-05-31 11:01:11 +02:00
res = re_match(b, s, LEN(TO_DATA(s)->data_header), UNBOX(pos), 0);
2024-02-06 15:39:33 +01:00
/* printf ("regexpMatch %x: %s, res=%ld\n", b, s+UNBOX(pos), res); */
2020-05-04 02:45:34 +03:00
2023-05-31 11:01:11 +02:00
if (res) { return BOX(res); }
2023-05-31 11:01:11 +02:00
return BOX(res);
2020-01-03 01:38:49 +03:00
}
extern void *Bstring (aint* args);
2020-01-28 03:01:54 +03:00
void *Lclone (aint* args /*void *p*/) {
2023-05-31 11:01:11 +02:00
data *obj;
void *res;
if (UNBOXED(args[0])) return (void*)args[0];
2020-01-15 21:42:59 +03:00
PRE_GC();
data *a = TO_DATA(args[0]);
aint t = TAG(a->data_header), l = LEN(a->data_header);
push_extra_root((void**)&args[0]);
switch (t) {
case STRING_TAG: {
void* p = TO_DATA(args[0])->contents;
res = Bstring((aint*)&p);
break;
}
case ARRAY_TAG:
obj = (data *)alloc_array(l);
memcpy(obj, TO_DATA(args[0]), array_size(l));
res = (void *)obj->contents;
break;
case CLOSURE_TAG:
obj = (data *)alloc_closure(l);
memcpy(obj, TO_DATA(args[0]), closure_size(l));
res = (void *)(obj->contents);
break;
case SEXP_TAG:
2023-08-09 20:16:51 +02:00
obj = (data *)alloc_sexp(l);
memcpy(obj, TO_DATA(args[0]), sexp_size(l));
2023-08-09 20:16:51 +02:00
res = (void *)obj->contents;
break;
2024-02-06 15:39:33 +01:00
default: failure("invalid data_header %ld in clone *****\n", t);
2023-05-31 11:01:11 +02:00
}
pop_extra_root((void**)&args[0]);
2020-01-15 21:42:59 +03:00
POST_GC();
2023-05-31 11:01:11 +02:00
return res;
2020-01-15 21:42:59 +03:00
}
2023-05-31 11:01:11 +02:00
#define HASH_DEPTH 3
#define HASH_APPEND(acc, x) \
2024-02-05 14:18:06 +01:00
(((acc + (auint)x) << (WORD_SIZE / 2)) | ((acc + (auint)x) >> (WORD_SIZE / 2)))
2020-01-15 21:42:59 +03:00
2024-02-05 14:18:06 +01:00
aint inner_hash (aint depth, auint acc, void *p) {
2023-05-31 11:01:11 +02:00
if (depth > HASH_DEPTH) return acc;
2020-01-15 21:42:59 +03:00
2023-05-31 11:01:11 +02:00
if (UNBOXED(p)) return HASH_APPEND(acc, UNBOX(p));
else if (is_valid_heap_pointer(p)) {
data *a = TO_DATA(p);
2024-02-05 14:18:06 +01:00
aint t = TAG(a->data_header), l = LEN(a->data_header), i;
2020-01-15 21:42:59 +03:00
2023-05-31 11:01:11 +02:00
acc = HASH_APPEND(acc, t);
acc = HASH_APPEND(acc, l);
2020-01-15 21:42:59 +03:00
2023-05-31 11:01:11 +02:00
switch (t) {
case STRING_TAG: {
char *p = a->contents;
2020-01-15 21:42:59 +03:00
2023-05-31 11:01:11 +02:00
while (*p) {
aint n = (aint)*p++;
2023-05-31 11:01:11 +02:00
acc = HASH_APPEND(acc, n);
}
2020-01-15 21:42:59 +03:00
2024-02-05 14:18:06 +01:00
return (aint)acc;
2023-05-31 11:01:11 +02:00
}
2023-05-31 11:01:11 +02:00
case CLOSURE_TAG:
acc = HASH_APPEND(acc, ((void **)a->contents)[0]);
i = 1;
break;
2023-05-31 11:01:11 +02:00
case ARRAY_TAG: i = 0; break;
2023-05-31 11:01:11 +02:00
case SEXP_TAG: {
aint ta = TO_SEXP(p)->tag;
acc = HASH_APPEND(acc, ta);
2023-08-09 20:16:51 +02:00
i = 1;
++l;
2023-05-31 11:01:11 +02:00
break;
}
2020-01-15 21:42:59 +03:00
2024-02-06 15:39:33 +01:00
default: failure("invalid data_header %ld in hash *****\n", t);
2023-05-31 11:01:11 +02:00
}
2020-01-15 21:42:59 +03:00
2023-05-31 11:01:11 +02:00
for (; i < l; i++) acc = inner_hash(depth + 1, acc, ((void **)a->contents)[i]);
2020-01-15 21:42:59 +03:00
2024-02-05 14:18:06 +01:00
return (aint)acc;
2023-05-31 11:01:11 +02:00
} else return HASH_APPEND(acc, p);
2020-01-15 21:42:59 +03:00
}
2023-05-31 11:01:11 +02:00
extern void *LstringInt (char *b) {
aint n;
2024-02-06 15:39:33 +01:00
sscanf(b, "%ld", &n);
2023-05-31 11:01:11 +02:00
return (void *)BOX(n);
2020-02-23 01:36:30 +03:00
}
2024-02-05 14:18:06 +01:00
extern aint Lhash (void *p) { return BOX(0x3fffff & inner_hash(0, 0, p)); }
2020-08-06 14:56:41 +03:00
2024-02-05 14:18:06 +01:00
extern aint LflatCompare (void *p, void *q) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(p)) {
if (UNBOXED(q)) { return BOX(UNBOX(p) - UNBOX(q)); }
return -1;
} else if (~UNBOXED(q)) {
return BOX(p - q);
2024-02-07 10:08:10 +01:00
} else return BOX(1);
2020-01-15 21:42:59 +03:00
}
extern aint Lcompare (void *p, void *q) {
2023-05-31 11:01:11 +02:00
#define COMPARE_AND_RETURN(x, y) \
do \
if (x != y) return BOX(x - y); \
while (0)
if (p == q) return BOX(0);
if (UNBOXED(p)) {
if (UNBOXED(q)) return BOX(UNBOX(p) - UNBOX(q));
2024-02-07 10:08:10 +01:00
else return BOX(-1u);
2023-05-31 11:01:11 +02:00
} else if (UNBOXED(q)) return BOX(1);
else {
if (is_valid_heap_pointer(p)) {
if (is_valid_heap_pointer(q)) {
data *a = TO_DATA(p), *b = TO_DATA(q);
aint ta = TAG(a->data_header), tb = TAG(b->data_header);
aint la = LEN(a->data_header), lb = LEN(b->data_header);
aint i;
aint shift = 0;
2023-05-31 11:01:11 +02:00
COMPARE_AND_RETURN(ta, tb);
switch (ta) {
case STRING_TAG: return BOX(strcmp(a->contents, b->contents));
case CLOSURE_TAG:
COMPARE_AND_RETURN(((void **)a->contents)[0], ((void **)b->contents)[0]);
COMPARE_AND_RETURN(la, lb);
i = 1;
break;
case ARRAY_TAG:
COMPARE_AND_RETURN(la, lb);
i = 0;
break;
case SEXP_TAG: {
aint tag_a = TO_SEXP(p)->tag, tag_b = TO_SEXP(q)->tag;
2023-08-09 20:16:51 +02:00
COMPARE_AND_RETURN(tag_a, tag_b);
2023-05-31 11:01:11 +02:00
COMPARE_AND_RETURN(la, lb);
2023-08-09 20:16:51 +02:00
i = 0;
shift = 1;
2023-05-31 11:01:11 +02:00
break;
}
2024-02-06 15:39:33 +01:00
default: failure("invalid data_header %ld in compare *****\n", ta);
2020-05-04 02:45:34 +03:00
}
2023-05-31 11:01:11 +02:00
for (; i < la; i++) {
aint c = Lcompare(((void **)a->contents)[i + shift], ((void **)b->contents)[i + shift]);
if (c != BOX(0)) return c;
2023-05-31 11:01:11 +02:00
}
return BOX(0);
2024-02-07 10:08:10 +01:00
} else return BOX(-1u);
2023-05-31 11:01:11 +02:00
} else if (is_valid_heap_pointer(q)) return BOX(1);
else return BOX(p - q);
}
2019-12-20 00:23:35 +03:00
}
extern void *Belem (void *p, aint i) {
2023-05-31 11:01:11 +02:00
data *a = (data *)BOX(NULL);
2023-08-09 20:16:51 +02:00
if (UNBOXED(p)) { ASSERT_BOXED(".elem:1", p); }
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED(".elem:2", i);
2023-05-31 11:01:11 +02:00
a = TO_DATA(p);
i = UNBOX(i);
2020-01-04 21:50:14 +03:00
2023-08-09 20:16:51 +02:00
switch (TAG(a->data_header)) {
2024-01-26 18:45:03 +01:00
case STRING_TAG: return (void *)BOX((char)a->contents[i]);
case SEXP_TAG: return (void *)((aint *)((sexp *)a)->contents)[i];
default: return (void *)((aint *)a->contents)[i];
2023-08-09 20:16:51 +02:00
}
2018-04-30 17:18:41 +03:00
}
extern void *LmakeArray (aint length) {
2023-05-31 11:01:11 +02:00
data *r;
aint n, *p;
2020-01-16 06:59:34 +03:00
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("makeArray:1", length);
2020-01-16 06:59:34 +03:00
PRE_GC();
2023-05-31 11:01:11 +02:00
n = UNBOX(length);
r = (data *)alloc_array(n);
2020-01-16 06:59:34 +03:00
p = (aint *)r->contents;
2023-05-31 11:01:11 +02:00
while (n--) *p++ = BOX(0);
2020-01-16 06:59:34 +03:00
POST_GC();
2020-01-16 06:59:34 +03:00
2023-05-31 11:01:11 +02:00
return r->contents;
2020-01-16 06:59:34 +03:00
}
extern void *LmakeString (aint length) {
aint n = UNBOX(length);
2023-05-31 11:01:11 +02:00
data *r;
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("makeString", length);
PRE_GC();
2018-12-06 23:04:45 +03:00
2023-05-31 11:01:11 +02:00
r = (data *)alloc_string(n); // '\0' in the end of the string is taken into account
2018-04-30 17:18:41 +03:00
POST_GC();
2023-05-31 11:01:11 +02:00
return r->contents;
2018-04-30 17:18:41 +03:00
}
extern void *Bstring (aint* args/*void *p*/) {
size_t n = strlen((char*)args[0]);
2023-05-31 11:01:11 +02:00
void *s = NULL;
PRE_GC();
push_extra_root((void**)&args[0]);
2023-05-31 11:01:11 +02:00
s = LmakeString(BOX(n));
pop_extra_root((void**)&args[0]);
strncpy((char *)&TO_DATA(s)->contents, (char*)args[0], n + 1); // +1 because of '\0' in the end of C-strings
POST_GC();
2023-05-31 11:01:11 +02:00
return s;
2019-12-21 02:34:56 +03:00
}
extern void *Lstringcat (aint *args /* void* p */) {
2023-05-31 11:01:11 +02:00
void *s;
2023-05-31 11:01:11 +02:00
/* ASSERT_BOXED("stringcat", p); */
2020-01-28 03:01:54 +03:00
PRE_GC();
2023-05-31 11:01:11 +02:00
createStringBuf();
stringcat((void*)args[0]);
2019-12-21 02:34:56 +03:00
push_extra_root((void**)&args[0]);
void* content = stringBuf.contents;
s = Bstring((aint*) &content);
pop_extra_root((void**)&args[0]);
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
deleteStringBuf();
POST_GC();
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
return s;
2019-12-21 02:34:56 +03:00
}
extern void *Lstring (aint* args /* void *p */) {
2023-05-31 11:01:11 +02:00
void *s = (void *)BOX(NULL);
PRE_GC();
2023-05-31 11:01:11 +02:00
createStringBuf();
printValue((void*)args[0]);
2018-10-31 20:10:50 +03:00
push_extra_root((void**)&args[0]);
void* content = stringBuf.contents;
s = Bstring((aint*)&content);
pop_extra_root((void**)&args[0]);
2018-10-31 20:10:50 +03:00
2023-05-31 11:01:11 +02:00
deleteStringBuf();
POST_GC();
2023-05-31 11:01:11 +02:00
return s;
2018-10-31 20:10:50 +03:00
}
extern void *Bclosure (aint* args, aint bn) {
2023-05-31 11:01:11 +02:00
data *r;
aint n = UNBOX(bn);
PRE_GC();
for (aint i = 0; i < n; ++i) {
push_extra_root((void**)&args[i + 1]);
}
2023-05-31 11:01:11 +02:00
r = (data *)alloc_closure(n + 1);
((void **)r->contents)[0] = (void*) args[0];
for (int i = 0; i < n; i++) {
((aint *)r->contents)[i + 1] = args[i + 1];
2023-05-31 11:01:11 +02:00
}
for (aint i = n - 1; i >= 0; --i) {
pop_extra_root((void**)&args[i + 1]);
}
POST_GC();
2023-05-31 11:01:11 +02:00
return r->contents;
2019-10-16 01:13:52 +03:00
}
extern void *Barray (aint* args, aint bn) {
2023-05-31 11:01:11 +02:00
data *r;
aint n = UNBOX(bn);
PRE_GC();
for (aint i = 0; i < n; i++) {
push_extra_root((void**)&args[i]);
}
r = (data *)alloc_array(n);
for (int i = 0; i < n; i++) {
((aint *)r->contents)[i] = args[i];
2023-05-31 11:01:11 +02:00
}
for (aint i = n - 1; i >= 0; --i) {
pop_extra_root((void**)&args[i]);
}
POST_GC();
2023-05-31 11:01:11 +02:00
return r->contents;
2018-04-30 17:18:41 +03:00
}
#ifdef DEBUG_VERSION
extern memory_chunk heap;
#endif
extern void *Bsexp (aint* args, aint bn) {
2024-01-30 18:16:44 +01:00
sexp *r;
aint n = UNBOX(bn);
PRE_GC();
aint fields_cnt = n - 1;
for (aint i = 0; i < fields_cnt; i++) {
push_extra_root((void**)&args[i]);
}
2024-01-30 18:16:44 +01:00
r = alloc_sexp(fields_cnt);
r->tag = 0;
for (int i = 0; i < fields_cnt; i++) {
((auint *)r->contents)[i] = args[i];
2023-05-31 11:01:11 +02:00
}
r->tag = args[fields_cnt];
2019-04-24 16:02:29 +03:00
for (aint i = fields_cnt - 1; i >= 0; --i) {
pop_extra_root((void**)&args[i]);
}
2018-04-30 17:18:41 +03:00
POST_GC();
2024-01-30 18:16:44 +01:00
return (void *)((data *)r)->contents;
2018-04-30 17:18:41 +03:00
}
2024-02-20 02:32:42 +01:00
extern aint Btag (void *d, aint t, aint n) {
2023-05-31 11:01:11 +02:00
data *r;
2023-05-31 11:01:11 +02:00
if (UNBOXED(d)) return BOX(0);
else {
r = TO_DATA(d);
2024-02-20 02:32:42 +01:00
return (aint)BOX(TAG(r->data_header) == SEXP_TAG && TO_SEXP(d)->tag == UNBOX(t)
2024-01-26 18:45:03 +01:00
&& LEN(r->data_header) == UNBOX(n));
2023-05-31 11:01:11 +02:00
}
2018-04-30 17:18:41 +03:00
}
2018-11-06 00:21:38 +03:00
aint get_tag (data *d) { return TAG(d->data_header); }
aint get_len (data *d) { return LEN(d->data_header); }
extern aint Barray_patt (void *d, aint n) {
2023-05-31 11:01:11 +02:00
data *r;
2023-05-31 11:01:11 +02:00
if (UNBOXED(d)) return BOX(0);
else {
r = TO_DATA(d);
return BOX(get_tag(r) == ARRAY_TAG && get_len(r) == UNBOX(n));
}
2018-11-06 00:21:38 +03:00
}
extern aint Bstring_patt (void *x, void *y) {
2023-05-31 11:01:11 +02:00
data *rx = (data *)BOX(NULL), *ry = (data *)BOX(NULL);
2023-05-31 11:01:11 +02:00
ASSERT_STRING(".string_patt:2", y);
2023-05-31 11:01:11 +02:00
if (UNBOXED(x)) return BOX(0);
else {
rx = TO_DATA(x);
ry = TO_DATA(y);
2023-05-31 11:01:11 +02:00
if (TAG(rx->data_header) != STRING_TAG) return BOX(0);
2018-11-06 00:21:38 +03:00
return BOX(strcmp(rx->contents, ry->contents) == 0 ? 1 : 0);
2023-05-31 11:01:11 +02:00
}
2018-11-06 00:21:38 +03:00
}
extern aint Bclosure_tag_patt (void *x) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(x)) return BOX(0);
2023-05-31 11:01:11 +02:00
return BOX(TAG(TO_DATA(x)->data_header) == CLOSURE_TAG);
2019-10-16 01:13:52 +03:00
}
extern aint Bboxed_patt (void *x) { return BOX(UNBOXED(x) ? 0 : 1); }
2018-11-06 00:21:38 +03:00
extern aint Bunboxed_patt (void *x) { return BOX(UNBOXED(x) ? 1 : 0); }
2018-11-06 00:21:38 +03:00
extern aint Barray_tag_patt (void *x) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(x)) return BOX(0);
2023-05-31 11:01:11 +02:00
return BOX(TAG(TO_DATA(x)->data_header) == ARRAY_TAG);
2018-11-06 00:21:38 +03:00
}
extern aint Bstring_tag_patt (void *x) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(x)) return BOX(0);
2023-05-31 11:01:11 +02:00
return BOX(TAG(TO_DATA(x)->data_header) == STRING_TAG);
2018-11-06 00:21:38 +03:00
}
extern aint Bsexp_tag_patt (void *x) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(x)) return BOX(0);
2023-05-31 11:01:11 +02:00
return BOX(TAG(TO_DATA(x)->data_header) == SEXP_TAG);
2018-11-06 00:21:38 +03:00
}
2018-04-30 17:18:41 +03:00
2024-02-15 10:18:14 +01:00
extern void *Bsta (void *x, aint i, void *v) {
2023-05-31 11:01:11 +02:00
if (UNBOXED(i)) {
ASSERT_BOXED(".sta:3", x);
2023-08-09 20:16:51 +02:00
data *d = TO_DATA(x);
2023-08-09 20:16:51 +02:00
switch (TAG(d->data_header)) {
case STRING_TAG: {
((char *)x)[UNBOX(i)] = (char)UNBOX(v);
break;
}
case SEXP_TAG: {
((aint *)((sexp *)d)->contents)[UNBOX(i)] = (aint)v;
2023-08-09 20:16:51 +02:00
break;
}
default: {
((aint *)x)[UNBOX(i)] = (aint)v;
2023-08-09 20:16:51 +02:00
}
}
} else {
*(void **)x = v;
2023-05-31 11:01:11 +02:00
}
2023-05-31 11:01:11 +02:00
return v;
2019-04-10 22:15:08 +03:00
}
2018-04-30 17:18:41 +03:00
extern void Bmatch_failure (void *v, char *fname, aint line, aint col) {
2023-05-31 11:01:11 +02:00
createStringBuf();
printValue(v);
2024-02-06 15:39:33 +01:00
failure("match failure at %s:%ld:%ld, value '%s'\n",
2023-05-31 11:01:11 +02:00
fname,
UNBOX(line),
UNBOX(col),
stringBuf.contents);
2019-12-24 03:59:05 +03:00
}
extern void * /*Lstrcat*/ Li__Infix_4343 (aint* args /* void *a, void *b */) {
2023-05-31 11:01:11 +02:00
data *da = (data *)BOX(NULL);
data *db = (data *)BOX(NULL);
data *d = (data *)BOX(NULL);
ASSERT_STRING("++:1", args[0]);
ASSERT_STRING("++:2", args[1]);
da = TO_DATA(args[0]);
db = TO_DATA(args[1]);
PRE_GC();
2018-12-06 23:04:45 +03:00
push_extra_root((void**)&args[0]);
push_extra_root((void**)&args[1]);
2023-05-31 11:01:11 +02:00
d = alloc_string(LEN(da->data_header) + LEN(db->data_header));
pop_extra_root((void**)&args[1]);
pop_extra_root((void**)&args[0]);
2018-12-06 23:04:45 +03:00
da = TO_DATA(args[0]);
db = TO_DATA(args[1]);
2023-05-31 11:01:11 +02:00
strncpy(d->contents, da->contents, LEN(da->data_header));
strncpy(d->contents + LEN(da->data_header), db->contents, LEN(db->data_header));
d->contents[LEN(da->data_header) + LEN(db->data_header)] = 0;
2018-05-25 09:53:10 +03:00
POST_GC();
2018-05-25 09:53:10 +03:00
2023-05-31 11:01:11 +02:00
return d->contents;
2018-05-25 09:53:10 +03:00
}
2023-05-31 11:01:11 +02:00
extern void *LgetEnv (char *var) {
char *e = getenv(var);
void *s;
if (e == NULL) return (void *)BOX(0);
PRE_GC();
s = Bstring((aint*)&e);
POST_GC();
2023-05-31 11:01:11 +02:00
return s;
}
2024-02-06 10:27:27 +01:00
extern aint Lsystem (char *cmd) { return BOX(system(cmd)); }
#ifndef X86_64
// In X86_64 we are not able to modify va_arg
static void fix_unboxed (char *s, va_list va) {
aint *p = (aint *)va;
aint i = 0;
while (*s) {
if (*s == '%') {
aint n = p[i];
if (UNBOXED(n)) { p[i] = UNBOX(n); }
i++;
2024-02-05 14:18:06 +01:00
}
2024-02-06 10:27:27 +01:00
s++;
}
2024-02-05 14:18:06 +01:00
}
2024-02-06 10:27:27 +01:00
extern void Lfailure (char *s, ...) {
va_list args;
va_start(args, s);
fix_unboxed(s, args);
vfailure(s, args);
}
2024-02-05 14:18:06 +01:00
extern void Lprintf (char *s, ...) {
va_list args; // = (va_list)BOX(NULL);
2024-02-05 14:18:06 +01:00
ASSERT_STRING("printf:1", s);
2024-02-05 14:18:06 +01:00
va_start(args, s);
fix_unboxed(s, args);
if (vprintf(s, args) < 0) { failure("fprintf (...): %s\n", strerror(errno)); }
2018-04-30 17:18:41 +03:00
2024-02-05 14:18:06 +01:00
fflush(stdout);
2019-12-21 02:34:56 +03:00
}
2024-02-05 14:18:06 +01:00
extern void *Lsprintf (char *fmt, ...) {
va_list args;
void *s;
2024-02-05 14:18:06 +01:00
ASSERT_STRING("sprintf:1", fmt);
2019-12-21 02:34:56 +03:00
2024-02-05 14:18:06 +01:00
va_start(args, fmt);
2024-02-06 10:27:27 +01:00
fix_unboxed(fmt, args);
2024-02-05 14:18:06 +01:00
createStringBuf();
vprintStringBuf(fmt, args);
2020-01-04 21:50:14 +03:00
2024-02-05 14:18:06 +01:00
PRE_GC();
push_extra_root((void **)&fmt);
void* content = stringBuf.contents;
s = Bstring((aint*)&content);
2024-02-05 14:18:06 +01:00
pop_extra_root((void **)&fmt);
POST_GC();
deleteStringBuf();
return s;
}
extern void Lfprintf (FILE *f, char *s, ...) {
va_list args; // = (va_list)BOX(NULL);
ASSERT_BOXED("fprintf:1", f);
ASSERT_STRING("fprintf:2", s);
va_start(args, s);
fix_unboxed(s, args);
2024-02-05 14:18:06 +01:00
if (vfprintf(f, s, args) < 0) { failure("fprintf (...): %s\n", strerror(errno)); }
2018-04-30 17:18:41 +03:00
}
2024-02-06 15:39:33 +01:00
2024-02-06 10:27:27 +01:00
#else
extern void *Bsprintf (char *fmt, ...) {
va_list args;
void *s;
ASSERT_STRING("sprintf:1", fmt);
va_start(args, fmt);
createStringBuf();
vprintStringBuf(fmt, args);
PRE_GC();
push_extra_root((void **)&fmt);
void* content = stringBuf.contents;
s = Bstring((aint*)&content);
2024-02-06 10:27:27 +01:00
pop_extra_root((void **)&fmt);
POST_GC();
deleteStringBuf();
return s;
}
2024-02-06 15:39:33 +01:00
extern void Bprintf (char *s, ...) {
va_list args; // = (va_list)BOX(NULL);
ASSERT_STRING("printf:1", s);
va_start(args, s);
if (vprintf(s, args) < 0) { failure("fprintf (...): %s\n", strerror(errno)); }
fflush(stdout);
}
extern void Bfprintf (FILE *f, char *s, ...) {
va_list args; // = (va_list)BOX(NULL);
ASSERT_BOXED("fprintf:1", f);
ASSERT_STRING("fprintf:2", s);
va_start(args, s);
if (vfprintf(f, s, args) < 0) { failure("fprintf (...): %s\n", strerror(errno)); }
}
2024-02-06 10:27:27 +01:00
#endif
2018-04-30 17:18:41 +03:00
2023-05-31 11:01:11 +02:00
extern FILE *Lfopen (char *f, char *m) {
FILE *h;
2023-05-31 11:01:11 +02:00
ASSERT_STRING("fopen:1", f);
ASSERT_STRING("fopen:2", m);
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
h = fopen(f, m);
2020-01-04 21:50:14 +03:00
2023-05-31 11:01:11 +02:00
if (h) return h;
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
failure("fopen (\"%s\", \"%s\"): %s, %s, %s\n", f, m, strerror(errno));
2024-02-07 10:08:10 +01:00
exit(1);
return NULL;
2018-04-30 17:18:41 +03:00
}
extern void Lfclose (FILE *f) {
2023-05-31 11:01:11 +02:00
ASSERT_BOXED("fclose", f);
2020-01-04 21:50:14 +03:00
2023-05-31 11:01:11 +02:00
fclose(f);
2018-05-16 09:24:40 +03:00
}
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
extern void *LreadLine () {
char *buf;
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
if (scanf("%m[^\n]", &buf) == 1) {
void *s = Bstring((aint*)&buf);
2020-02-25 01:19:15 +03:00
2023-05-31 11:01:11 +02:00
getchar();
2023-05-31 11:01:11 +02:00
free(buf);
return s;
}
2023-05-31 11:01:11 +02:00
if (errno != 0) failure("readLine (): %s\n", strerror(errno));
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
return (void *)BOX(0);
2019-12-21 02:34:56 +03:00
}
2023-05-31 11:01:11 +02:00
extern void *Lfread (char *fname) {
FILE *f;
2023-05-31 11:01:11 +02:00
ASSERT_STRING("fread", fname);
2023-05-31 11:01:11 +02:00
f = fopen(fname, "r");
2023-09-05 20:56:10 +02:00
if (f && fseek(f, 0l, SEEK_END) >= 0) {
long size = ftell(f);
void *s = LmakeString(BOX(size));
2023-09-05 20:56:10 +02:00
rewind(f);
2023-09-05 20:56:10 +02:00
if (fread(s, 1, size, f) == size) {
fclose(f);
return s;
2019-12-21 02:34:56 +03:00
}
2023-05-31 11:01:11 +02:00
}
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
failure("fread (\"%s\"): %s\n", fname, strerror(errno));
2024-02-07 10:08:10 +01:00
exit(1);
return NULL;
2019-12-21 02:34:56 +03:00
}
extern void Lfwrite (char *fname, char *contents) {
2023-05-31 11:01:11 +02:00
FILE *f;
2020-01-04 21:50:14 +03:00
2023-05-31 11:01:11 +02:00
ASSERT_STRING("fwrite:1", fname);
ASSERT_STRING("fwrite:2", contents);
2019-12-21 02:34:56 +03:00
2023-05-31 11:01:11 +02:00
f = fopen(fname, "w");
2023-09-05 20:56:10 +02:00
if (f && !(fprintf(f, "%s", contents) < 0)) {
fclose(f);
} else {
failure("fwrite (\"%s\"): %s\n", fname, strerror(errno));
2023-05-31 11:01:11 +02:00
}
2019-12-21 02:34:56 +03:00
}
2023-05-31 11:01:11 +02:00
extern void *Lfexists (char *fname) {
FILE *f;
2023-05-31 11:01:11 +02:00
ASSERT_STRING("fexists", fname);
2021-11-19 01:38:22 +03:00
2023-05-31 11:01:11 +02:00
f = fopen(fname, "r");
2021-11-19 01:38:22 +03:00
if (f) return (void *)BOX(1);
2021-11-19 01:38:22 +03:00
return (void *)BOX(0);
2021-11-19 01:38:22 +03:00
}
2023-05-31 11:01:11 +02:00
extern void *Lfst (void *v) { return Belem(v, BOX(0)); }
2019-12-24 03:59:05 +03:00
2023-05-31 11:01:11 +02:00
extern void *Lsnd (void *v) { return Belem(v, BOX(1)); }
2019-12-24 03:59:05 +03:00
2023-05-31 11:01:11 +02:00
extern void *Lhd (void *v) { return Belem(v, BOX(0)); }
2019-12-24 03:59:05 +03:00
2023-05-31 11:01:11 +02:00
extern void *Ltl (void *v) { return Belem(v, BOX(1)); }
2019-12-24 03:59:05 +03:00
2018-03-04 23:13:08 +03:00
/* Lread is an implementation of the "read" construct */
2024-02-20 02:32:42 +01:00
extern aint Lread () {
2024-01-26 18:45:03 +01:00
// int result = BOX(0);
2024-02-20 02:32:42 +01:00
aint result = BOX(0);
2018-03-04 23:13:08 +03:00
2023-05-31 11:01:11 +02:00
printf("> ");
fflush(stdout);
2024-01-26 18:45:03 +01:00
scanf("%li", &result);
2018-03-04 23:13:08 +03:00
2023-05-31 11:01:11 +02:00
return BOX(result);
2018-03-04 23:13:08 +03:00
}
extern int Lbinoperror (void) {
2023-09-04 21:54:38 +02:00
fprintf(stderr, "ERROR: POINTER ARITHMETICS is forbidden; EXIT\n");
exit(1);
}
extern int Lbinoperror2 (void) {
2023-09-04 21:54:38 +02:00
fprintf(stderr, "ERROR: Comparing BOXED and UNBOXED value ; EXIT\n");
exit(1);
}
2018-03-04 23:13:08 +03:00
/* Lwrite is an implementation of the "write" construct */
extern aint Lwrite (aint n) {
2024-01-26 18:45:03 +01:00
printf("%ld\n", UNBOX(n));
2023-05-31 11:01:11 +02:00
fflush(stdout);
2018-03-04 23:13:08 +03:00
2023-05-31 11:01:11 +02:00
return 0;
2018-03-04 23:13:08 +03:00
}
2018-04-30 17:18:41 +03:00
extern aint Lrandom (aint n) {
2023-05-31 11:01:11 +02:00
ASSERT_UNBOXED("Lrandom, 0", n);
2024-02-06 15:39:33 +01:00
if (UNBOX(n) <= 0) { failure("invalid range in random: %ld\n", UNBOX(n)); }
2020-08-02 23:56:21 +03:00
2023-05-31 11:01:11 +02:00
return BOX(random() % UNBOX(n));
2020-08-02 23:56:21 +03:00
}
extern aint Ltime () {
2023-05-31 11:01:11 +02:00
struct timespec t;
2023-05-31 11:01:11 +02:00
clock_gettime(CLOCK_MONOTONIC_RAW, &t);
2023-05-31 11:01:11 +02:00
return BOX(t.tv_sec * 1000000 + t.tv_nsec / 1000);
2020-08-02 23:56:21 +03:00
}
extern void set_args (aint argc, char *argv[]) {
aint n = argc;
aint *p = NULL;
aint i;
PRE_GC();
2023-05-31 11:01:11 +02:00
p = LmakeArray(BOX(n));
push_extra_root((void **)&p);
for (i = 0; i < n; i++) {
((aint *)p)[i] = (aint)Bstring((aint*)&argv[i]);
}
2023-05-31 11:01:11 +02:00
pop_extra_root((void **)&p);
POST_GC();
2020-01-28 03:01:54 +03:00
2023-05-31 11:01:11 +02:00
global_sysargs = p;
2023-06-29 20:05:54 +02:00
2023-05-31 11:01:11 +02:00
push_extra_root((void **)&global_sysargs);
2020-01-28 03:01:54 +03:00
}