You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

builtins.c 8.4KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368
  1. #include "vm/builtins.h"
  2. #include <stdio.h>
  3. static void print_val(struct l2_vm *vm, struct l2_io_writer *out, struct l2_vm_value *val) {
  4. switch (l2_vm_value_type(val)) {
  5. case L2_VAL_TYPE_NONE:
  6. l2_io_printf(out, "(none)");
  7. break;
  8. case L2_VAL_TYPE_ATOM:
  9. if (val->atom == vm->values[vm->ktrue].atom) {
  10. l2_io_printf(out, "(true)");
  11. } else if (val->atom == vm->values[vm->kfalse].atom) {
  12. l2_io_printf(out, "(false)");
  13. } else {
  14. l2_io_printf(out, "(atom %u)", val->atom);
  15. }
  16. break;
  17. case L2_VAL_TYPE_REAL:
  18. l2_io_printf(out, "%g", val->real);
  19. break;
  20. case L2_VAL_TYPE_BUFFER:
  21. if (val->buffer != NULL) {
  22. out->write(out, val->buffer->data, val->buffer->len);
  23. }
  24. break;
  25. case L2_VAL_TYPE_ARRAY:
  26. if (val->array == NULL) {
  27. out->write(out, "[]", 2);
  28. break;
  29. }
  30. out->write(out, "[", 1);
  31. for (size_t i = 0; i < val->array->len; ++i) {
  32. if (i != 0) {
  33. out->write(out, " ", 1);
  34. }
  35. print_val(vm, out, &vm->values[val->array->data[i]]);
  36. }
  37. out->write(out, "]", 1);
  38. break;
  39. case L2_VAL_TYPE_NAMESPACE:
  40. l2_io_printf(out, "(namespace)");
  41. break;
  42. case L2_VAL_TYPE_FUNCTION:
  43. case L2_VAL_TYPE_CFUNCTION:
  44. l2_io_printf(out, "(function)");
  45. break;
  46. case L2_VAL_TYPE_ERROR:
  47. l2_io_printf(out, "(error: %s)", val->error);
  48. break;
  49. case L2_VAL_TYPE_CONTINUATION:
  50. l2_io_printf(out, "(continuation)");
  51. break;
  52. }
  53. }
  54. l2_word l2_builtin_add(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  55. if (argc < 1) {
  56. return 0;
  57. }
  58. struct l2_vm_value *val = &vm->values[argv[0]];
  59. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  60. return l2_vm_type_error(vm, val);
  61. }
  62. double sum = val->real;
  63. for (l2_word i = 1; i < argc; ++i) {
  64. val = &vm->values[argv[i]];
  65. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  66. return l2_vm_type_error(vm, val);
  67. }
  68. sum += val->real;
  69. }
  70. l2_word id = l2_vm_alloc(vm, L2_VAL_TYPE_REAL, 0);
  71. vm->values[id].real = sum;
  72. return id;
  73. }
  74. l2_word l2_builtin_sub(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  75. if (argc < 1) {
  76. return 0;
  77. }
  78. struct l2_vm_value *val = &vm->values[argv[0]];
  79. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  80. return l2_vm_type_error(vm, val);
  81. }
  82. double sum = val->real;
  83. for (l2_word i = 1; i < argc; ++i) {
  84. val = &vm->values[argv[i]];
  85. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  86. return l2_vm_type_error(vm, val);
  87. }
  88. sum -= val->real;
  89. }
  90. l2_word id = l2_vm_alloc(vm, L2_VAL_TYPE_REAL, 0);
  91. vm->values[id].real = sum;
  92. return id;
  93. }
  94. l2_word l2_builtin_mul(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  95. if (argc < 1) {
  96. return 0;
  97. }
  98. struct l2_vm_value *val = &vm->values[argv[0]];
  99. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  100. return l2_vm_type_error(vm, val);
  101. }
  102. double sum = val->real;
  103. for (l2_word i = 1; i < argc; ++i) {
  104. val = &vm->values[argv[i]];
  105. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  106. return l2_vm_type_error(vm, val);
  107. }
  108. sum *= val->real;
  109. }
  110. l2_word id = l2_vm_alloc(vm, L2_VAL_TYPE_REAL, 0);
  111. vm->values[id].real = sum;
  112. return id;
  113. }
  114. l2_word l2_builtin_div(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  115. if (argc < 1) {
  116. return 0;
  117. }
  118. struct l2_vm_value *val = &vm->values[argv[0]];
  119. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  120. return l2_vm_type_error(vm, val);
  121. }
  122. double sum = val->real;
  123. for (l2_word i = 1; i < argc; ++i) {
  124. val = &vm->values[argv[i]];
  125. if (l2_vm_value_type(val) != L2_VAL_TYPE_REAL) {
  126. return l2_vm_type_error(vm, val);
  127. }
  128. sum /= val->real;
  129. }
  130. l2_word id = l2_vm_alloc(vm, L2_VAL_TYPE_REAL, 0);
  131. vm->values[id].real = sum;
  132. return id;
  133. }
  134. l2_word l2_builtin_eq(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  135. if (argc < 2) {
  136. return l2_vm_error(vm, "Expected at least 2 arguments");
  137. }
  138. for (l2_word i = 1; i < argc; ++i) {
  139. if (argv[i - 1] == argv[i]) continue;
  140. struct l2_vm_value *a = &vm->values[argv[i - 1]];
  141. struct l2_vm_value *b = &vm->values[argv[i]];
  142. if (a->flags != b->flags) {
  143. return vm->kfalse;
  144. }
  145. enum l2_value_type typ = l2_vm_value_type(a);
  146. if (typ == L2_VAL_TYPE_ATOM) {
  147. if (a->atom != b->atom) {
  148. return vm->kfalse;
  149. }
  150. } else if (typ == L2_VAL_TYPE_REAL) {
  151. if (a->real != b->real) {
  152. return vm->kfalse;
  153. }
  154. } else if (typ == L2_VAL_TYPE_BUFFER) {
  155. if (a->buffer == NULL && b->buffer == NULL) continue;
  156. if (a->buffer == NULL || b->buffer == NULL) {
  157. return vm->kfalse;
  158. }
  159. if (a->buffer->len != b->buffer->len) {
  160. return vm->kfalse;
  161. }
  162. if (memcmp(a->buffer->data, b->buffer->data, a->buffer->len) != 0) {
  163. return vm->kfalse;
  164. }
  165. } else {
  166. return vm->kfalse;
  167. }
  168. }
  169. return vm->ktrue;
  170. }
  171. l2_word l2_builtin_neq(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  172. l2_word ret_id = l2_builtin_eq(vm, argc, argv);
  173. if (ret_id == vm->ktrue) {
  174. return vm->kfalse;
  175. } else if (ret_id == vm->kfalse) {
  176. return vm->ktrue;
  177. } else {
  178. return ret_id;
  179. }
  180. }
  181. #define X(name, op) \
  182. l2_word name(struct l2_vm *vm, l2_word argc, l2_word *argv) { \
  183. if (argc < 2) { \
  184. return l2_vm_error(vm, "Expected at least 2 arguments"); \
  185. } \
  186. struct l2_vm_value *lhs = &vm->values[argv[0]]; \
  187. if (l2_vm_value_type(lhs) != L2_VAL_TYPE_REAL) { \
  188. return l2_vm_type_error(vm, lhs); \
  189. } \
  190. for (l2_word i = 1; i < argc; ++i) { \
  191. struct l2_vm_value *rhs = &vm->values[argv[i]]; \
  192. if (l2_vm_value_type(rhs) != L2_VAL_TYPE_REAL) { \
  193. return l2_vm_type_error(vm, rhs); \
  194. } \
  195. if (!(lhs->real op rhs->real)) { \
  196. return vm->kfalse; \
  197. } \
  198. lhs = rhs; \
  199. } \
  200. return vm->ktrue; \
  201. }
  202. X(l2_builtin_lt, <)
  203. X(l2_builtin_lteq, <=)
  204. X(l2_builtin_gt, >)
  205. X(l2_builtin_gteq, >=)
  206. #undef X
  207. l2_word l2_builtin_print(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  208. for (size_t i = 0; i < argc; ++i) {
  209. if (i != 0) {
  210. vm->std_output->write(vm->std_output, " ", 1);
  211. }
  212. struct l2_vm_value *val = &vm->values[argv[i]];
  213. print_val(vm, vm->std_output, val);
  214. }
  215. vm->std_output->write(vm->std_output, "\n", 1);
  216. return 0;
  217. }
  218. l2_word l2_builtin_len(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  219. if (argc != 1) {
  220. return l2_vm_error(vm, "Expected 1 argument");
  221. }
  222. l2_word ret_id = l2_vm_alloc(vm, L2_VAL_TYPE_REAL, 0);
  223. struct l2_vm_value *ret = &vm->values[ret_id];
  224. ret->real = 0;
  225. struct l2_vm_value *val = &vm->values[argv[0]];
  226. switch (l2_vm_value_type(val)) {
  227. case L2_VAL_TYPE_NONE:
  228. case L2_VAL_TYPE_ATOM:
  229. case L2_VAL_TYPE_REAL:
  230. case L2_VAL_TYPE_FUNCTION:
  231. case L2_VAL_TYPE_CFUNCTION:
  232. case L2_VAL_TYPE_ERROR:
  233. case L2_VAL_TYPE_CONTINUATION:
  234. break;
  235. case L2_VAL_TYPE_BUFFER:
  236. if (val->buffer) {
  237. ret->real = val->buffer->len;
  238. }
  239. break;
  240. case L2_VAL_TYPE_ARRAY:
  241. if (val->array) {
  242. ret->real = val->array->len;
  243. }
  244. break;
  245. case L2_VAL_TYPE_NAMESPACE:
  246. if (val->ns) {
  247. ret->real = val->ns->len;
  248. }
  249. }
  250. return ret_id;
  251. }
  252. l2_word l2_builtin_if(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  253. if (argc != 2 && argc != 3) {
  254. return l2_vm_error(vm, "Expected 2 or 3 arguments");
  255. }
  256. struct l2_vm_value *cond = &vm->values[argv[0]];
  257. if (
  258. l2_vm_value_type(cond) == L2_VAL_TYPE_ATOM &&
  259. cond->atom == vm->values[vm->ktrue].atom) {
  260. l2_word ret_id = l2_vm_alloc(vm, L2_VAL_TYPE_CONTINUATION, 0);
  261. struct l2_vm_value *ret = &vm->values[ret_id];
  262. ret->extra.cont_call = argv[1];
  263. return ret_id;
  264. } else if (argc == 3) {
  265. l2_word ret_id = l2_vm_alloc(vm, L2_VAL_TYPE_CONTINUATION, 0);
  266. struct l2_vm_value *ret = &vm->values[ret_id];
  267. ret->extra.cont_call = argv[2];
  268. return ret_id;
  269. } else {
  270. return 0;
  271. }
  272. }
  273. struct loop_context {
  274. struct l2_vm_contcontext base;
  275. l2_word cond;
  276. };
  277. static l2_word loop_callback(struct l2_vm *vm, l2_word retval, l2_word cont) {
  278. struct l2_vm_value *ret = &vm->values[retval];
  279. if (
  280. l2_vm_value_type(ret) == L2_VAL_TYPE_ATOM &&
  281. ret->atom == vm->values[vm->ktrue].atom) {
  282. return cont;
  283. }
  284. return retval;
  285. }
  286. static void loop_marker(
  287. struct l2_vm *vm, void *data, void (*mark)(struct l2_vm *vm, l2_word id)) {
  288. struct loop_context *ctx = data;
  289. mark(vm, ctx->cond);
  290. }
  291. l2_word l2_builtin_loop(struct l2_vm *vm, l2_word argc, l2_word *argv) {
  292. if (argc != 1 && argc != 2) {
  293. return l2_vm_error(vm, "Expected 1 or 2 arguments");
  294. }
  295. struct loop_context *ctx = malloc(sizeof(*ctx));
  296. if (ctx == NULL) {
  297. return l2_vm_error(vm, "Allocation failure");
  298. }
  299. ctx->base.callback = loop_callback;
  300. ctx->base.marker = loop_marker;
  301. ctx->cond = argv[0];
  302. l2_word cont_id = l2_vm_alloc(vm, L2_VAL_TYPE_CONTINUATION, 0);
  303. struct l2_vm_value *cont = &vm->values[cont_id];
  304. cont->extra.cont_call = argv[0];
  305. cont->cont = &ctx->base;
  306. return cont_id;
  307. }