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.

vm.c 13KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506
  1. #include "vm/vm.h"
  2. #include <string.h>
  3. #include <stdio.h>
  4. #include "vm/builtins.h"
  5. static int stdio_inited = 0;
  6. static struct l2_io_file_writer std_output;
  7. static struct l2_io_file_writer std_error;
  8. static l2_word alloc_val(struct l2_vm *vm) {
  9. size_t id = l2_bitset_set_next(&vm->valueset);
  10. if (id >= vm->valuessize) {
  11. if (vm->valuessize == 0) {
  12. vm->valuessize = 16;
  13. }
  14. while (id >= vm->valuessize) {
  15. vm->valuessize *= 2;
  16. }
  17. vm->values = realloc(vm->values, sizeof(*vm->values) * vm->valuessize);
  18. }
  19. return (l2_word)id;
  20. }
  21. static float u32_to_float(uint32_t num) {
  22. float f;
  23. memcpy(&f, &num, sizeof(num));
  24. return f;
  25. }
  26. static double u32s_to_double(uint32_t high, uint32_t low) {
  27. double d;
  28. uint64_t num = (uint64_t)high << 32 | (uint64_t)low;
  29. memcpy(&d, &num, sizeof(num));
  30. return d;
  31. }
  32. static void gc_mark_array(struct l2_vm *vm, struct l2_vm_value *val);
  33. static void gc_mark_namespace(struct l2_vm *vm, struct l2_vm_value *val);
  34. static void gc_mark(struct l2_vm *vm, l2_word id) {
  35. struct l2_vm_value *val = &vm->values[id];
  36. if (val->flags & L2_VAL_MARKED) {
  37. return;
  38. }
  39. val->flags |= L2_VAL_MARKED;
  40. int typ = l2_vm_value_type(val);
  41. if (typ == L2_VAL_TYPE_ARRAY) {
  42. gc_mark_array(vm, val);
  43. } else if (typ == L2_VAL_TYPE_NAMESPACE) {
  44. gc_mark_namespace(vm, val);
  45. } else if (typ == L2_VAL_TYPE_FUNCTION) {
  46. gc_mark(vm, val->func.namespace);
  47. }
  48. }
  49. static void gc_mark_array(struct l2_vm *vm, struct l2_vm_value *val) {
  50. if (val->array == NULL) {
  51. return;
  52. }
  53. for (size_t i = 0; i < val->array->len; ++i) {
  54. gc_mark(vm, val->array->data[i]);
  55. }
  56. }
  57. static void gc_mark_namespace(struct l2_vm *vm, struct l2_vm_value *val) {
  58. if (val->extra.ns_parent != 0) {
  59. gc_mark(vm, val->extra.ns_parent);
  60. }
  61. if (val->ns == NULL) {
  62. return;
  63. }
  64. for (size_t i = 0; i < val->ns->size; ++i) {
  65. l2_word key = val->ns->data[i];
  66. if (key == 0 || key == ~(l2_word)0) {
  67. continue;
  68. }
  69. gc_mark(vm, val->ns->data[val->ns->size + i]);
  70. }
  71. }
  72. static void gc_free(struct l2_vm *vm, l2_word id) {
  73. struct l2_vm_value *val = &vm->values[id];
  74. l2_bitset_unset(&vm->valueset, id);
  75. // Don't need to do anything more; the next round of GC will free
  76. // whichever values were only referenced by the array
  77. int typ = l2_vm_value_type(val);
  78. if (typ == L2_VAL_TYPE_ARRAY) {
  79. free(val->array);
  80. } else if (typ == L2_VAL_TYPE_BUFFER) {
  81. free(val->buffer);
  82. } else if (typ == L2_VAL_TYPE_NAMESPACE) {
  83. free(val->ns);
  84. }
  85. }
  86. static size_t gc_sweep(struct l2_vm *vm) {
  87. size_t freed = 0;
  88. // Skip ID 0, because that should always exist
  89. for (size_t i = 1; i < vm->valuessize; ++i) {
  90. if (!l2_bitset_get(&vm->valueset, i)) {
  91. continue;
  92. }
  93. struct l2_vm_value *val = &vm->values[i];
  94. if (!(val->flags & L2_VAL_MARKED)) {
  95. gc_free(vm, i);
  96. freed += 1;
  97. } else {
  98. val->flags &= ~L2_VAL_MARKED;
  99. }
  100. }
  101. return freed;
  102. }
  103. void l2_vm_init(struct l2_vm *vm, l2_word *ops, size_t opcount) {
  104. if (!stdio_inited) {
  105. std_output.w.write = l2_io_file_write;
  106. std_output.f = stdout;
  107. std_error.w.write = l2_io_file_write;
  108. std_error.f = stderr;
  109. stdio_inited = 1;
  110. }
  111. vm->std_output = &std_output.w;
  112. vm->std_error = &std_error.w;
  113. vm->ops = ops;
  114. vm->opcount = opcount;
  115. vm->iptr = 0;
  116. vm->sptr = 0;
  117. vm->fsptr = 0;
  118. vm->values = NULL;
  119. vm->valuessize = 0;
  120. l2_bitset_init(&vm->valueset);
  121. // It's wasteful to allocate new 'none' variables all the time,
  122. // variable ID 0 should be the only 'none' variable in the system
  123. l2_word none_id = alloc_val(vm);
  124. vm->values[none_id].flags = L2_VAL_TYPE_NONE | L2_VAL_CONST;
  125. // Need to allocate a builtins namespace
  126. l2_word builtins = alloc_val(vm);
  127. vm->values[builtins].extra.ns_parent = 0;
  128. vm->values[builtins].ns = NULL; // Will be allocated on first insert
  129. vm->values[builtins].flags = L2_VAL_TYPE_NAMESPACE;
  130. vm->fstack[vm->fsptr].namespace = builtins;
  131. vm->fstack[vm->fsptr].retptr = 0;
  132. vm->fsptr += 1;
  133. // Need to allocate a root namespace
  134. l2_word root = alloc_val(vm);
  135. vm->values[root].extra.ns_parent = builtins;
  136. vm->values[root].ns = NULL;
  137. vm->values[root].flags = L2_VAL_TYPE_NAMESPACE;
  138. vm->fstack[vm->fsptr].namespace = root;
  139. vm->fstack[vm->fsptr].retptr = 0;
  140. vm->fsptr += 1;
  141. // Define a C function variable for every builtin
  142. l2_word id;
  143. l2_word key = 1;
  144. #define X(name, f) \
  145. id = alloc_val(vm); \
  146. vm->values[id].flags = L2_VAL_TYPE_CFUNCTION; \
  147. vm->values[id].cfunc = f; \
  148. l2_vm_namespace_set(&vm->values[builtins], key++, id);
  149. #include "builtins.x.h"
  150. #undef X
  151. }
  152. l2_word l2_vm_alloc(struct l2_vm *vm, enum l2_value_type typ, enum l2_value_flags flags) {
  153. l2_word id = alloc_val(vm);
  154. memset(&vm->values[id], 0, sizeof(vm->values[id]));
  155. vm->values[id].flags = typ | flags;
  156. return id;
  157. }
  158. void l2_vm_free(struct l2_vm *vm) {
  159. // Skip ID 0, because that's always NONE
  160. for (size_t i = 1; i < vm->valuessize; ++i) {
  161. if (!l2_bitset_get(&vm->valueset, i)) {
  162. continue;
  163. }
  164. gc_free(vm, i);
  165. }
  166. free(vm->values);
  167. l2_bitset_free(&vm->valueset);
  168. }
  169. size_t l2_vm_gc(struct l2_vm *vm) {
  170. for (l2_word sptr = 0; sptr < vm->sptr; ++sptr) {
  171. gc_mark(vm, vm->stack[sptr]);
  172. }
  173. for (l2_word fsptr = 0; fsptr < vm->fsptr; ++fsptr) {
  174. gc_mark(vm, vm->fstack[fsptr].namespace);
  175. }
  176. return gc_sweep(vm);
  177. }
  178. void l2_vm_run(struct l2_vm *vm) {
  179. while ((enum l2_opcode)vm->ops[vm->iptr] != L2_OP_HALT) {
  180. l2_vm_step(vm);
  181. }
  182. }
  183. void l2_vm_step(struct l2_vm *vm) {
  184. enum l2_opcode opcode = (enum l2_opcode)vm->ops[vm->iptr++];
  185. l2_word word;
  186. switch (opcode) {
  187. case L2_OP_NOP:
  188. break;
  189. case L2_OP_POP:
  190. vm->sptr -= 1;
  191. break;
  192. case L2_OP_SWAP_POP:
  193. vm->stack[vm->sptr - 2] = vm->stack[vm->sptr - 1];
  194. vm->sptr -= 1;
  195. break;
  196. case L2_OP_DUP:
  197. vm->stack[vm->sptr] = vm->ops[vm->sptr - 1];
  198. vm->sptr += 1;
  199. break;
  200. case L2_OP_ADD:
  201. vm->stack[vm->sptr - 2] += vm->stack[vm->sptr - 1];
  202. vm->sptr -= 1;
  203. break;
  204. case L2_OP_FUNC_CALL:
  205. {
  206. l2_word argc = vm->ops[vm->iptr++];
  207. l2_word arr_id = alloc_val(vm);
  208. vm->values[arr_id].flags = L2_VAL_TYPE_ARRAY;
  209. vm->values[arr_id].array = malloc(
  210. sizeof(struct l2_vm_array) + sizeof(l2_word) * argc);
  211. struct l2_vm_array *arr = vm->values[arr_id].array;
  212. arr->len = argc;
  213. arr->size = argc;
  214. vm->sptr -= argc;
  215. for (l2_word i = 0; i < argc; ++i) {
  216. arr->data[i] = vm->stack[vm->sptr + i];
  217. }
  218. l2_word func_id = vm->stack[--vm->sptr];
  219. struct l2_vm_value *func = &vm->values[func_id];
  220. enum l2_value_type typ = l2_vm_value_type(func);
  221. // C functions are called differently from language functions
  222. if (typ == L2_VAL_TYPE_CFUNCTION) {
  223. vm->stack[vm->sptr++] = func->cfunc(vm, arr);
  224. break;
  225. }
  226. // Don't interpret a non-function as a function
  227. if (typ != L2_VAL_TYPE_FUNCTION) {
  228. // TODO: Error mechanism
  229. break;
  230. }
  231. vm->stack[vm->sptr++] = arr_id;
  232. l2_word ns_id = alloc_val(vm);
  233. func = &vm->values[func_id]; // func might be stale after alloc
  234. vm->values[ns_id].extra.ns_parent = func->func.namespace;
  235. vm->values[ns_id].ns = NULL;
  236. vm->values[ns_id].flags = L2_VAL_TYPE_NAMESPACE;
  237. vm->fstack[vm->fsptr].namespace = ns_id;
  238. vm->fstack[vm->fsptr].retptr = vm->iptr;
  239. vm->fsptr += 1;
  240. vm->iptr = func->func.pos;
  241. }
  242. break;
  243. case L2_OP_RJMP:
  244. vm->iptr += vm->ops[vm->iptr++];
  245. break;
  246. case L2_OP_STACK_FRAME_LOOKUP:
  247. {
  248. l2_word key = vm->ops[vm->iptr++];
  249. struct l2_vm_value *ns = &vm->values[vm->fstack[vm->fsptr - 1].namespace];
  250. vm->stack[vm->sptr++] = l2_vm_namespace_get(vm, ns, key);
  251. }
  252. break;
  253. case L2_OP_STACK_FRAME_SET:
  254. {
  255. l2_word key = vm->ops[vm->iptr++];
  256. l2_word val = vm->stack[vm->sptr - 1];
  257. struct l2_vm_value *ns = &vm->values[vm->fstack[vm->fsptr - 1].namespace];
  258. l2_vm_namespace_set(ns, key, val);
  259. }
  260. break;
  261. case L2_OP_STACK_FRAME_REPLACE:
  262. {
  263. l2_word key = vm->ops[vm->iptr++];
  264. l2_word val = vm->stack[vm->sptr - 1];
  265. struct l2_vm_value *ns = &vm->values[vm->fstack[vm->fsptr - 1].namespace];
  266. l2_vm_namespace_replace(vm, ns, key, val); // TODO: error if returns -1
  267. }
  268. break;
  269. case L2_OP_RET:
  270. {
  271. l2_word retval = vm->stack[--vm->sptr];
  272. vm->sptr -= 1; // Discard arguments array
  273. l2_word retptr = vm->fstack[--vm->fsptr].retptr;
  274. vm->stack[vm->sptr++] = retval;
  275. vm->iptr = retptr;
  276. }
  277. break;
  278. case L2_OP_ALLOC_NONE:
  279. vm->stack[vm->sptr++] = 0;
  280. break;
  281. case L2_OP_ALLOC_ATOM:
  282. word = alloc_val(vm);
  283. vm->values[word].flags = L2_VAL_TYPE_ATOM;
  284. vm->values[word].atom = vm->ops[vm->iptr++];
  285. vm->stack[vm->sptr++] = word;
  286. break;
  287. case L2_OP_ALLOC_REAL:
  288. {
  289. word = alloc_val(vm);
  290. l2_word high = vm->ops[vm->iptr++];
  291. l2_word low = vm->ops[vm->iptr++];
  292. vm->values[word].flags = L2_VAL_TYPE_REAL;
  293. vm->values[word].real = u32s_to_double(high, low);
  294. vm->stack[vm->sptr++] = word;
  295. }
  296. break;
  297. case L2_OP_ALLOC_BUFFER_STATIC:
  298. {
  299. word = alloc_val(vm);
  300. l2_word length = vm->ops[vm->iptr++];
  301. l2_word offset = vm->ops[vm->iptr++];
  302. vm->values[word].flags = L2_VAL_TYPE_BUFFER;
  303. vm->values[word].buffer = malloc(sizeof(struct l2_vm_buffer) + length);
  304. vm->values[word].buffer->len = length;
  305. memcpy(
  306. (unsigned char *)vm->values[word].buffer + sizeof(struct l2_vm_buffer),
  307. vm->ops + offset, length);
  308. vm->stack[vm->sptr] = word;
  309. vm->sptr += 1;
  310. }
  311. break;
  312. case L2_OP_ALLOC_ARRAY:
  313. {
  314. l2_word count = vm->ops[vm->iptr++];
  315. l2_word arr_id = alloc_val(vm);
  316. struct l2_vm_value *arr = &vm->values[arr_id];
  317. arr->flags = L2_VAL_TYPE_ARRAY;
  318. if (count == 0) {
  319. arr->array = NULL;
  320. vm->stack[vm->sptr++] = arr_id;
  321. break;
  322. }
  323. arr->array = malloc(sizeof(struct l2_vm_array) + count * sizeof(l2_word));
  324. arr->array->len = count;
  325. arr->array->size = count;
  326. for (l2_word i = 0; i < count; ++i) {
  327. arr->array->data[count - 1 - i] = vm->stack[--vm->sptr];
  328. }
  329. vm->stack[vm->sptr++] = arr_id;
  330. }
  331. break;
  332. case L2_OP_ALLOC_NAMESPACE:
  333. word = alloc_val(vm);
  334. vm->values[word].flags = L2_VAL_TYPE_NAMESPACE;
  335. vm->values[word].extra.ns_parent = 0;
  336. vm->values[word].ns = NULL; // Will be allocated on first insert
  337. vm->stack[vm->sptr] = word;
  338. vm->sptr += 1;
  339. break;
  340. case L2_OP_ALLOC_FUNCTION:
  341. word = alloc_val(vm);
  342. vm->values[word].flags = L2_VAL_TYPE_FUNCTION;
  343. vm->values[word].func.pos = vm->ops[vm->iptr++];
  344. vm->values[word].func.namespace = vm->fstack[vm->fsptr - 1].namespace;
  345. vm->stack[vm->sptr] = word;
  346. vm->sptr += 1;
  347. break;
  348. case L2_OP_NAMESPACE_SET:
  349. {
  350. l2_word key = vm->ops[vm->iptr++];
  351. l2_word val = vm->stack[vm->sptr - 1];
  352. l2_word ns = vm->stack[vm->sptr - 2];
  353. l2_vm_namespace_set(&vm->values[ns], key, val);
  354. }
  355. break;
  356. case L2_OP_NAMESPACE_LOOKUP:
  357. {
  358. l2_word key = vm->ops[vm->iptr++];
  359. l2_word ns = vm->stack[--vm->sptr];
  360. vm->stack[vm->sptr++] = l2_vm_namespace_get(vm, &vm->values[ns], key);
  361. }
  362. break;
  363. case L2_OP_ARRAY_LOOKUP:
  364. {
  365. l2_word key = vm->ops[vm->iptr++];
  366. l2_word arr = vm->stack[--vm->sptr];
  367. // TODO: Error if out of bounds or incorrect type
  368. vm->stack[vm->sptr++] = vm->values[arr].array->data[key];
  369. }
  370. break;
  371. case L2_OP_ARRAY_SET:
  372. {
  373. l2_word key = vm->ops[vm->iptr++];
  374. l2_word val = vm->stack[vm->sptr - 1];
  375. l2_word arr = vm->stack[vm->sptr - 2];
  376. // TODO: Error if out of bounds or incorrect type
  377. vm->values[arr].array->data[key] = val;
  378. }
  379. break;
  380. case L2_OP_DYNAMIC_LOOKUP:
  381. {
  382. l2_word key_id = vm->stack[--vm->sptr];
  383. l2_word container_id = vm->stack[--vm->sptr];
  384. struct l2_vm_value *key = &vm->values[key_id];
  385. struct l2_vm_value *container = &vm->values[container_id];
  386. if (
  387. l2_vm_value_type(key) == L2_VAL_TYPE_REAL &&
  388. l2_vm_value_type(container) == L2_VAL_TYPE_ARRAY) {
  389. // TODO: Error if out of bounds
  390. vm->stack[vm->sptr++] = container->array->data[(size_t)key->real];
  391. } else if (
  392. l2_vm_value_type(key) == L2_VAL_TYPE_ATOM &&
  393. l2_vm_value_type(container) == L2_VAL_TYPE_NAMESPACE) {
  394. // TODO: Error if out of bounds
  395. vm->stack[vm->sptr++] = l2_vm_namespace_get(vm, container, key->atom);
  396. } else {
  397. // TODO: error
  398. }
  399. }
  400. break;
  401. case L2_OP_DYNAMIC_SET:
  402. {
  403. l2_word val = vm->stack[--vm->sptr];
  404. l2_word key_id = vm->stack[--vm->sptr];
  405. l2_word container_id = vm->stack[--vm->sptr];
  406. vm->stack[vm->sptr++] = val;
  407. struct l2_vm_value *key = &vm->values[key_id];
  408. struct l2_vm_value *container = &vm->values[container_id];
  409. if (
  410. l2_vm_value_type(key) == L2_VAL_TYPE_REAL &&
  411. l2_vm_value_type(container) == L2_VAL_TYPE_ARRAY) {
  412. // TODO: Error if out of bounds
  413. container->array->data[(size_t)key->real] = val;
  414. } else if (
  415. l2_vm_value_type(key) == L2_VAL_TYPE_ATOM &&
  416. l2_vm_value_type(container) == L2_VAL_TYPE_NAMESPACE) {
  417. // TODO: Error if out of bounds
  418. l2_vm_namespace_set(container, key->atom, val);
  419. } else {
  420. // TODO: error
  421. }
  422. }
  423. break;
  424. case L2_OP_HALT:
  425. break;
  426. }
  427. }