2017-12-21 04:03:34 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2017 Calvin Rose
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to
|
|
|
|
* deal in the Software without restriction, including without limitation the
|
|
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
|
* IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <dst/dst.h>
|
2018-01-30 04:38:49 +00:00
|
|
|
#include <dst/dstcorelib.h>
|
2017-12-30 21:46:59 +00:00
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_exit(DstArgs args) {
|
2018-01-12 21:25:24 +00:00
|
|
|
int32_t exitcode = 0;
|
2018-01-14 17:10:45 +00:00
|
|
|
if (args.n > 0) {
|
|
|
|
exitcode = dst_hash(args.v[0]);
|
2018-01-12 21:25:24 +00:00
|
|
|
}
|
|
|
|
exit(exitcode);
|
2018-01-13 19:08:42 +00:00
|
|
|
return 0;
|
2018-01-12 21:25:24 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_print(DstArgs args) {
|
2017-12-30 21:46:59 +00:00
|
|
|
int32_t i;
|
2018-01-14 17:10:45 +00:00
|
|
|
for (i = 0; i < args.n; ++i) {
|
2017-12-30 21:46:59 +00:00
|
|
|
int32_t j, len;
|
2018-01-14 17:10:45 +00:00
|
|
|
const uint8_t *vstr = dst_to_string(args.v[i]);
|
2017-12-30 21:46:59 +00:00
|
|
|
len = dst_string_length(vstr);
|
|
|
|
for (j = 0; j < len; ++j) {
|
|
|
|
putc(vstr[j], stdout);
|
|
|
|
}
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
2017-12-30 21:46:59 +00:00
|
|
|
putc('\n', stdout);
|
|
|
|
return 0;
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_describe(DstArgs args) {
|
2018-01-04 02:36:10 +00:00
|
|
|
int32_t i;
|
2018-01-14 17:10:45 +00:00
|
|
|
for (i = 0; i < args.n; ++i) {
|
2018-01-04 02:36:10 +00:00
|
|
|
int32_t j, len;
|
2018-01-14 17:10:45 +00:00
|
|
|
const uint8_t *vstr = dst_description(args.v[i]);
|
2018-01-04 02:36:10 +00:00
|
|
|
len = dst_string_length(vstr);
|
|
|
|
for (j = 0; j < len; ++j) {
|
|
|
|
putc(vstr[j], stdout);
|
|
|
|
}
|
2018-01-31 22:39:18 +00:00
|
|
|
putc('\n', stdout);
|
2018-01-04 02:36:10 +00:00
|
|
|
}
|
2018-01-31 22:39:18 +00:00
|
|
|
if (!i) putc('\n', stdout);
|
2018-01-04 02:36:10 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_string(DstArgs args) {
|
2018-01-12 15:41:27 +00:00
|
|
|
int32_t i;
|
|
|
|
DstBuffer b;
|
|
|
|
dst_buffer_init(&b, 0);
|
2018-01-14 17:10:45 +00:00
|
|
|
for (i = 0; i < args.n; ++i) {
|
2018-01-12 15:41:27 +00:00
|
|
|
int32_t len;
|
2018-01-14 17:10:45 +00:00
|
|
|
const uint8_t *str = dst_to_string(args.v[i]);
|
2018-01-12 15:41:27 +00:00
|
|
|
len = dst_string_length(str);
|
|
|
|
dst_buffer_push_bytes(&b, str, len);
|
|
|
|
}
|
2018-01-14 17:10:45 +00:00
|
|
|
*args.ret = dst_stringv(b.data, b.count);
|
2018-01-12 15:41:27 +00:00
|
|
|
dst_buffer_deinit(&b);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_symbol(DstArgs args) {
|
2018-01-21 22:08:11 +00:00
|
|
|
int32_t i;
|
|
|
|
DstBuffer b;
|
|
|
|
dst_buffer_init(&b, 0);
|
|
|
|
for (i = 0; i < args.n; ++i) {
|
|
|
|
int32_t len;
|
|
|
|
const uint8_t *str = dst_to_string(args.v[i]);
|
|
|
|
len = dst_string_length(str);
|
|
|
|
dst_buffer_push_bytes(&b, str, len);
|
|
|
|
}
|
|
|
|
*args.ret = dst_symbolv(b.data, b.count);
|
|
|
|
dst_buffer_deinit(&b);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-01-31 22:39:18 +00:00
|
|
|
int dst_core_buffer(DstArgs args) {
|
|
|
|
int32_t i;
|
|
|
|
DstBuffer *b = dst_buffer(0);
|
|
|
|
for (i = 0; i < args.n; ++i) {
|
|
|
|
int32_t len;
|
|
|
|
const uint8_t *str = dst_to_string(args.v[i]);
|
|
|
|
len = dst_string_length(str);
|
|
|
|
dst_buffer_push_bytes(b, str, len);
|
|
|
|
}
|
|
|
|
return dst_return(args, dst_wrap_buffer(b));
|
2018-01-16 01:14:21 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_tuple(DstArgs args) {
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_tuple(dst_tuple_n(args.v, args.n)));
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_array(DstArgs args) {
|
2018-01-14 17:10:45 +00:00
|
|
|
DstArray *array = dst_array(args.n);
|
|
|
|
array->count = args.n;
|
|
|
|
memcpy(array->data, args.v, args.n * sizeof(Dst));
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_array(array));
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_table(DstArgs args) {
|
2017-12-30 21:46:59 +00:00
|
|
|
int32_t i;
|
2018-01-14 17:10:45 +00:00
|
|
|
DstTable *table = dst_table(args.n >> 1);
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n & 1) return dst_throw(args, "expected even number of arguments");
|
2018-01-14 17:10:45 +00:00
|
|
|
for (i = 0; i < args.n; i += 2) {
|
|
|
|
dst_table_put(table, args.v[i], args.v[i + 1]);
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_table(table));
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_struct(DstArgs args) {
|
2017-12-30 21:46:59 +00:00
|
|
|
int32_t i;
|
2018-01-14 17:10:45 +00:00
|
|
|
DstKV *st = dst_struct_begin(args.n >> 1);
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n & 1) return dst_throw(args, "expected even number of arguments");
|
2018-01-14 17:10:45 +00:00
|
|
|
for (i = 0; i < args.n; i += 2) {
|
|
|
|
dst_struct_put(st, args.v[i], args.v[i + 1]);
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_struct(dst_struct_end(st)));
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_fiber(DstArgs args) {
|
2018-01-05 21:17:55 +00:00
|
|
|
DstFiber *fiber;
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n < 1) return dst_throw(args, "expected at least one argument");
|
|
|
|
if (!dst_checktype(args.v[0], DST_FUNCTION)) return dst_throw(args, "expected a function");
|
2018-01-05 21:17:55 +00:00
|
|
|
fiber = dst_fiber(64);
|
|
|
|
fiber->parent = dst_vm_fiber;
|
2018-02-07 05:44:51 +00:00
|
|
|
dst_fiber_funcframe(fiber, dst_unwrap_function(args.v[0]));
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_fiber(fiber));
|
2018-01-05 21:17:55 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_gensym(DstArgs args) {
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n > 1) return dst_throw(args, "expected one argument");
|
2018-01-14 17:10:45 +00:00
|
|
|
if (args.n == 0) {
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_symbol(dst_symbol_gen(NULL, 0)));
|
2018-01-05 21:17:55 +00:00
|
|
|
} else {
|
2018-01-14 17:10:45 +00:00
|
|
|
const uint8_t *s = dst_to_string(args.v[0]);
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, dst_wrap_symbol(dst_symbol_gen(s, dst_string_length(s))));
|
2018-01-05 21:17:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_length(DstArgs args) {
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n != 1) return dst_throw(args, "expected at least 1 argument");
|
|
|
|
return dst_return(args, dst_wrap_integer(dst_length(args.v[0])));
|
2018-01-12 18:54:37 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_get(DstArgs args) {
|
2017-12-30 21:46:59 +00:00
|
|
|
int32_t i;
|
2018-01-06 16:09:15 +00:00
|
|
|
Dst ds;
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n < 1) return dst_throw(args, "expected at least 1 argument");
|
2018-01-14 17:10:45 +00:00
|
|
|
ds = args.v[0];
|
|
|
|
for (i = 1; i < args.n; i++) {
|
|
|
|
ds = dst_get(ds, args.v[i]);
|
2017-12-30 21:46:59 +00:00
|
|
|
if (dst_checktype(ds, DST_NIL))
|
2017-12-21 04:03:34 +00:00
|
|
|
break;
|
|
|
|
}
|
2018-01-16 01:14:21 +00:00
|
|
|
return dst_return(args, ds);
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-02-07 05:44:51 +00:00
|
|
|
int dst_core_fiber_status(DstArgs args) {
|
2018-02-02 22:14:27 +00:00
|
|
|
const char *status = "";
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n != 1) return dst_throw(args, "expected 1 argument");
|
|
|
|
if (!dst_checktype(args.v[0], DST_FIBER)) return dst_throw(args, "expected fiber");
|
2018-01-14 17:10:45 +00:00
|
|
|
switch(dst_unwrap_fiber(args.v[0])->status) {
|
2018-01-12 21:25:24 +00:00
|
|
|
case DST_FIBER_PENDING:
|
2018-02-03 18:55:55 +00:00
|
|
|
status = ":pending";
|
2018-01-12 21:25:24 +00:00
|
|
|
break;
|
|
|
|
case DST_FIBER_NEW:
|
2018-02-03 18:55:55 +00:00
|
|
|
status = ":new";
|
2018-01-12 21:25:24 +00:00
|
|
|
break;
|
|
|
|
case DST_FIBER_ALIVE:
|
2018-02-03 18:55:55 +00:00
|
|
|
status = ":alive";
|
2018-01-12 21:25:24 +00:00
|
|
|
break;
|
|
|
|
case DST_FIBER_DEAD:
|
2018-02-03 18:55:55 +00:00
|
|
|
status = ":dead";
|
2018-01-12 21:25:24 +00:00
|
|
|
break;
|
|
|
|
case DST_FIBER_ERROR:
|
2018-02-03 18:55:55 +00:00
|
|
|
status = ":error";
|
2018-01-12 21:25:24 +00:00
|
|
|
break;
|
|
|
|
}
|
2018-02-03 18:55:55 +00:00
|
|
|
return dst_return(args, dst_csymbolv(status));
|
2018-01-12 21:25:24 +00:00
|
|
|
}
|
|
|
|
|
2018-02-07 05:44:51 +00:00
|
|
|
int dst_core_fiber_current(DstArgs args) {
|
|
|
|
return dst_return(args, dst_wrap_fiber(dst_vm_fiber));
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_put(DstArgs args) {
|
2018-01-06 16:09:15 +00:00
|
|
|
Dst ds, key, value;
|
2018-01-14 17:10:45 +00:00
|
|
|
DstArgs subargs = args;
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n < 3) return dst_throw(args, "expected at least 3 arguments");
|
2018-01-14 17:10:45 +00:00
|
|
|
subargs.n -= 2;
|
2018-01-30 04:38:49 +00:00
|
|
|
if (dst_core_get(subargs)) return 1;
|
2018-01-14 17:10:45 +00:00
|
|
|
ds = *args.ret;
|
|
|
|
key = args.v[args.n - 2];
|
|
|
|
value = args.v[args.n - 1];
|
2017-12-30 21:46:59 +00:00
|
|
|
dst_put(ds, key, value);
|
|
|
|
return 0;
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_gccollect(DstArgs args) {
|
2018-01-16 01:14:21 +00:00
|
|
|
(void) args;
|
|
|
|
dst_collect();
|
2017-12-30 21:46:59 +00:00
|
|
|
return 0;
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2018-02-07 05:44:51 +00:00
|
|
|
int dst_core_gcsetinterval(DstArgs args) {
|
|
|
|
if (args.n < 1 ||
|
|
|
|
!dst_checktype(args.v[0], DST_INTEGER) ||
|
|
|
|
dst_unwrap_integer(args.v[0]) < 0)
|
|
|
|
return dst_throw(args, "expected non-negative integer");
|
|
|
|
dst_vm_gc_interval = dst_unwrap_integer(args.v[0]);
|
|
|
|
return dst_return(args, dst_wrap_integer(dst_vm_gc_interval));
|
|
|
|
}
|
|
|
|
|
|
|
|
int dst_core_gcinterval(DstArgs args) {
|
|
|
|
return dst_return(args, dst_wrap_integer(dst_vm_gc_interval));
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_type(DstArgs args) {
|
2018-01-16 01:14:21 +00:00
|
|
|
if (args.n != 1) return dst_throw(args, "expected 1 argument");
|
|
|
|
if (dst_checktype(args.v[0], DST_ABSTRACT)) {
|
2018-02-03 22:22:04 +00:00
|
|
|
return dst_return(args, dst_csymbolv(dst_abstract_type(dst_unwrap_abstract(args.v[0]))->name));
|
2018-01-16 01:14:21 +00:00
|
|
|
} else {
|
2018-02-03 18:55:55 +00:00
|
|
|
return dst_return(args, dst_csymbolv(dst_type_names[dst_type(args.v[0])]));
|
2017-12-21 04:03:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_next(DstArgs args) {
|
2018-01-17 14:58:32 +00:00
|
|
|
Dst ds;
|
|
|
|
const DstKV *kv;
|
|
|
|
if (args.n != 2) return dst_throw(args, "expected 2 arguments");
|
|
|
|
ds = args.v[0];
|
|
|
|
if (dst_checktype(ds, DST_TABLE)) {
|
|
|
|
DstTable *t = dst_unwrap_table(ds);
|
|
|
|
kv = dst_checktype(args.v[1], DST_NIL)
|
2018-02-03 23:12:07 +00:00
|
|
|
? NULL
|
2018-01-17 14:58:32 +00:00
|
|
|
: dst_table_find(t, args.v[1]);
|
|
|
|
} else if (dst_checktype(ds, DST_STRUCT)) {
|
|
|
|
const DstKV *st = dst_unwrap_struct(ds);
|
|
|
|
kv = dst_checktype(args.v[1], DST_NIL)
|
2018-02-03 23:12:07 +00:00
|
|
|
? NULL
|
2018-01-17 14:58:32 +00:00
|
|
|
: dst_struct_find(st, args.v[1]);
|
|
|
|
} else {
|
|
|
|
return dst_throw(args, "expected table/struct");
|
|
|
|
}
|
|
|
|
kv = dst_next(ds, kv);
|
|
|
|
if (kv) {
|
|
|
|
return dst_return(args, kv->key);
|
|
|
|
}
|
|
|
|
return dst_return(args, dst_wrap_nil());
|
|
|
|
}
|
|
|
|
|
2018-01-30 04:38:49 +00:00
|
|
|
int dst_core_hash(DstArgs args) {
|
2018-01-17 14:58:32 +00:00
|
|
|
if (args.n != 1) return dst_throw(args, "expected 1 argument");
|
|
|
|
return dst_return(args, dst_wrap_integer(dst_hash(args.v[0])));
|
|
|
|
}
|