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.6KB

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