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 12KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  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->ns == NULL) {
  59. return;
  60. }
  61. for (size_t i = 0; i < val->ns->size; ++i) {
  62. l2_word key = val->ns->data[i];
  63. if (key == 0 || key == ~(l2_word)0) {
  64. continue;
  65. }
  66. gc_mark(vm, val->ns->data[val->ns->size + i]);
  67. }
  68. if (val->extra.ns_parent != 0) {
  69. gc_mark(vm, val->extra.ns_parent);
  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 || typ == L2_VAL_TYPE_BUFFER || typ == L2_VAL_TYPE_NAMESPACE) {
  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->nsptr = 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->nstack[vm->nsptr++] = builtins;
  131. // Need to allocate a root namespace
  132. l2_word root = alloc_val(vm);
  133. vm->values[root].extra.ns_parent = builtins;
  134. vm->values[root].ns = NULL;
  135. vm->values[root].flags = L2_VAL_TYPE_NAMESPACE;
  136. vm->nstack[vm->nsptr++] = root;
  137. // Define a C function variable for every builtin
  138. l2_word id;
  139. l2_word key = 1;
  140. #define X(name, f) \
  141. id = alloc_val(vm); \
  142. vm->values[id].flags = L2_VAL_TYPE_CFUNCTION; \
  143. vm->values[id].cfunc = f; \
  144. l2_vm_namespace_set(&vm->values[builtins], key++, id);
  145. #include "builtins.x.h"
  146. #undef X
  147. }
  148. l2_word l2_vm_alloc(struct l2_vm *vm, enum l2_value_type typ, enum l2_value_flags flags) {
  149. l2_word id = alloc_val(vm);
  150. memset(&vm->values[id], 0, sizeof(vm->values[id]));
  151. vm->values[id].flags = typ | flags;
  152. return id;
  153. }
  154. void l2_vm_free(struct l2_vm *vm) {
  155. // Skip ID 0, because that's always NONE
  156. for (size_t i = 1; i < vm->valuessize; ++i) {
  157. if (!l2_bitset_get(&vm->valueset, i)) {
  158. continue;
  159. }
  160. gc_free(vm, i);
  161. }
  162. free(vm->values);
  163. l2_bitset_free(&vm->valueset);
  164. }
  165. size_t l2_vm_gc(struct l2_vm *vm) {
  166. for (l2_word nsptr = 0; nsptr < vm->nsptr; ++nsptr) {
  167. struct l2_vm_value *val = &vm->values[vm->nstack[nsptr]];
  168. val->flags |= L2_VAL_MARKED;
  169. gc_mark_namespace(vm, val);
  170. }
  171. return gc_sweep(vm);
  172. }
  173. void l2_vm_run(struct l2_vm *vm) {
  174. while ((enum l2_opcode)vm->ops[vm->iptr] != L2_OP_HALT) {
  175. l2_vm_step(vm);
  176. }
  177. }
  178. void l2_vm_step(struct l2_vm *vm) {
  179. enum l2_opcode opcode = (enum l2_opcode)vm->ops[vm->iptr++];
  180. l2_word word;
  181. switch (opcode) {
  182. case L2_OP_NOP:
  183. break;
  184. case L2_OP_PUSH:
  185. vm->stack[vm->sptr] = vm->ops[vm->iptr];
  186. vm->sptr += 1;
  187. vm->iptr += 1;
  188. break;
  189. case L2_OP_PUSH_2:
  190. vm->stack[vm->sptr] = vm->ops[vm->iptr];
  191. vm->stack[vm->sptr + 1] = vm->ops[vm->iptr + 1];
  192. vm->sptr += 2;
  193. vm->iptr += 2;
  194. break;
  195. case L2_OP_POP:
  196. vm->sptr -= 1;
  197. break;
  198. case L2_OP_SWAP_POP:
  199. vm->stack[vm->sptr - 2] = vm->stack[vm->sptr - 1];
  200. vm->sptr -= 1;
  201. break;
  202. case L2_OP_DUP:
  203. vm->stack[vm->sptr] = vm->ops[vm->sptr - 1];
  204. vm->sptr += 1;
  205. break;
  206. case L2_OP_ADD:
  207. vm->stack[vm->sptr - 2] += vm->stack[vm->sptr - 1];
  208. vm->sptr -= 1;
  209. break;
  210. case L2_OP_FUNC_CALL:
  211. {
  212. l2_word argc = vm->stack[--vm->sptr];
  213. l2_word arr_id = alloc_val(vm);
  214. vm->values[arr_id].flags = L2_VAL_TYPE_ARRAY;
  215. vm->values[arr_id].array = malloc(
  216. sizeof(struct l2_vm_array) + sizeof(l2_word) * argc);
  217. struct l2_vm_array *arr = vm->values[arr_id].array;
  218. arr->len = argc;
  219. arr->size = argc;
  220. vm->sptr -= argc;
  221. for (l2_word i = 0; i < argc; ++i) {
  222. arr->data[i] = vm->stack[vm->sptr + i];
  223. }
  224. l2_word func_id = vm->stack[--vm->sptr];
  225. struct l2_vm_value *func = &vm->values[func_id];
  226. enum l2_value_type typ = l2_vm_value_type(func);
  227. // C functions are called differently from language functions
  228. if (typ == L2_VAL_TYPE_CFUNCTION) {
  229. vm->stack[vm->sptr++] = func->cfunc(vm, arr);
  230. break;
  231. }
  232. // Don't interpret a non-function as a function
  233. if (typ != L2_VAL_TYPE_FUNCTION) {
  234. // TODO: Error mechanism
  235. break;
  236. }
  237. vm->stack[vm->sptr++] = vm->iptr;
  238. vm->stack[vm->sptr++] = arr_id;
  239. l2_word ns_id = alloc_val(vm);
  240. func = &vm->values[func_id]; // func might be stale after alloc
  241. vm->values[ns_id].extra.ns_parent = func->func.namespace;
  242. vm->values[ns_id].ns = NULL;
  243. vm->values[ns_id].flags = L2_VAL_TYPE_NAMESPACE;
  244. vm->nstack[vm->nsptr++] = ns_id;
  245. vm->iptr = func->func.pos;
  246. }
  247. break;
  248. case L2_OP_RJMP:
  249. word = vm->stack[vm->sptr - 1];
  250. vm->sptr -= 1;
  251. vm->iptr += word;
  252. break;
  253. case L2_OP_STACK_FRAME_LOOKUP:
  254. {
  255. l2_word key = vm->stack[vm->sptr - 1];
  256. struct l2_vm_value *ns = &vm->values[vm->nstack[vm->nsptr - 1]];
  257. vm->stack[vm->sptr - 1] = l2_vm_namespace_get(vm, ns, key);
  258. }
  259. break;
  260. case L2_OP_STACK_FRAME_SET:
  261. {
  262. l2_word key = vm->stack[--vm->sptr];
  263. l2_word val = vm->stack[vm->sptr - 1];
  264. struct l2_vm_value *ns = &vm->values[vm->nstack[vm->nsptr - 1]];
  265. l2_vm_namespace_set(ns, key, val);
  266. }
  267. break;
  268. case L2_OP_STACK_FRAME_REPLACE:
  269. {
  270. l2_word key = vm->stack[--vm->sptr];
  271. l2_word val = vm->stack[vm->sptr - 1];
  272. struct l2_vm_value *ns = &vm->values[vm->nstack[vm->nsptr - 1]];
  273. l2_vm_namespace_replace(vm, ns, key, val); // TODO: error if returns -1
  274. }
  275. break;
  276. case L2_OP_RET:
  277. {
  278. l2_word retval = vm->stack[--vm->sptr];
  279. vm->sptr -= 1; // Discard arguments array
  280. l2_word retaddr = vm->stack[--vm->sptr];
  281. vm->stack[vm->sptr++] = retval;
  282. vm->nsptr -= 1; // Pop function stack frame
  283. vm->iptr = retaddr;
  284. }
  285. break;
  286. case L2_OP_ALLOC_ATOM:
  287. word = alloc_val(vm);
  288. vm->values[word].flags = L2_VAL_TYPE_ATOM;
  289. vm->values[word].atom= vm->stack[--vm->sptr];
  290. vm->stack[vm->sptr++] = word;
  291. break;
  292. case L2_OP_ALLOC_REAL:
  293. word = alloc_val(vm);
  294. vm->values[word].flags = L2_VAL_TYPE_REAL;
  295. vm->values[word].real = u32s_to_double(vm->stack[vm->sptr - 1], vm->stack[vm->sptr - 2]);
  296. vm->sptr -= 2;
  297. vm->stack[vm->sptr] = word;
  298. vm->sptr += 1;
  299. break;
  300. case L2_OP_ALLOC_BUFFER_STATIC:
  301. {
  302. word = alloc_val(vm);
  303. l2_word length = vm->stack[--vm->sptr];
  304. l2_word offset = vm->stack[--vm->sptr];
  305. vm->values[word].flags = L2_VAL_TYPE_BUFFER;
  306. vm->values[word].buffer = malloc(sizeof(struct l2_vm_buffer) + length);
  307. vm->values[word].buffer->len = length;
  308. memcpy(
  309. (unsigned char *)vm->values[word].buffer + sizeof(struct l2_vm_buffer),
  310. vm->ops + offset, length);
  311. vm->stack[vm->sptr] = word;
  312. vm->sptr += 1;
  313. }
  314. break;
  315. case L2_OP_ALLOC_BUFFER_ZERO:
  316. {
  317. word = alloc_val(vm);
  318. l2_word length = vm->stack[--vm->sptr];
  319. vm->values[word].flags = L2_VAL_TYPE_BUFFER;
  320. vm->values[word].buffer = calloc(1, sizeof(struct l2_vm_buffer) + length);
  321. vm->values[word].buffer->len = length;
  322. vm->stack[vm->sptr] = word;
  323. vm->sptr += 1;
  324. }
  325. break;
  326. case L2_OP_ALLOC_ARRAY:
  327. {
  328. l2_word count = vm->stack[--vm->sptr];
  329. l2_word arr_id = alloc_val(vm);
  330. struct l2_vm_value *arr = &vm->values[arr_id];
  331. arr->flags = L2_VAL_TYPE_ARRAY;
  332. if (count == 0) {
  333. arr->array = NULL;
  334. vm->stack[vm->sptr++] = arr_id;
  335. break;
  336. }
  337. arr->array = malloc(sizeof(struct l2_vm_array) + count * sizeof(l2_word));
  338. arr->array->len = count;
  339. arr->array->size = count;
  340. for (l2_word i = 0; i < count; ++i) {
  341. arr->array->data[count - 1 - i] = vm->stack[--vm->sptr];
  342. }
  343. vm->stack[vm->sptr++] = arr_id;
  344. }
  345. break;
  346. case L2_OP_ALLOC_NAMESPACE:
  347. word = alloc_val(vm);
  348. vm->values[word].flags = L2_VAL_TYPE_NAMESPACE;
  349. vm->values[word].extra.ns_parent = 0;
  350. vm->values[word].ns = NULL; // Will be allocated on first insert
  351. vm->stack[vm->sptr] = word;
  352. vm->sptr += 1;
  353. break;
  354. case L2_OP_ALLOC_FUNCTION:
  355. word = alloc_val(vm);
  356. vm->values[word].flags = L2_VAL_TYPE_FUNCTION;
  357. vm->values[word].func.pos = vm->stack[--vm->sptr];
  358. vm->values[word].func.namespace = vm->nstack[vm->nsptr - 1];
  359. vm->stack[vm->sptr] = word;
  360. vm->sptr += 1;
  361. break;
  362. case L2_OP_NAMESPACE_SET:
  363. {
  364. l2_word key = vm->stack[--vm->sptr];
  365. l2_word val = vm->stack[vm->sptr - 1];
  366. l2_word ns = vm->stack[vm->sptr - 2];
  367. l2_vm_namespace_set(&vm->values[ns], key, val);
  368. }
  369. break;
  370. case L2_OP_NAMESPACE_LOOKUP:
  371. {
  372. l2_word key = vm->stack[--vm->sptr];
  373. l2_word ns = vm->stack[--vm->sptr];
  374. vm->stack[vm->sptr++] = l2_vm_namespace_get(vm, &vm->values[ns], key);
  375. }
  376. break;
  377. case L2_OP_DIRECT_ARRAY_LOOKUP:
  378. {
  379. l2_word key = vm->stack[--vm->sptr];
  380. l2_word arr = vm->stack[--vm->sptr];
  381. // TODO: Error if out of bounds or incorrect type
  382. vm->stack[vm->sptr++] = vm->values[arr].array->data[key];
  383. }
  384. break;
  385. case L2_OP_DIRECT_ARRAY_SET:
  386. {
  387. l2_word key = vm->stack[--vm->sptr];
  388. l2_word val = vm->stack[vm->sptr - 1];
  389. l2_word arr = vm->stack[vm->sptr - 2];
  390. // TODO: Error if out of bounds or incorrect type
  391. vm->values[arr].array->data[key] = val;
  392. }
  393. break;
  394. case L2_OP_HALT:
  395. break;
  396. }
  397. }