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.

print.c 5.0KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  1. #include "vm/print.h"
  2. #include <stdio.h>
  3. #include <string.h>
  4. #include <stdint.h>
  5. void l2_vm_print_val(struct l2_vm_value *val) {
  6. switch (l2_vm_value_type(val)) {
  7. case L2_VAL_TYPE_NONE:
  8. printf("NONE\n");
  9. break;
  10. case L2_VAL_TYPE_ATOM:
  11. printf("ATOM %u\n", val->atom);
  12. break;
  13. case L2_VAL_TYPE_REAL:
  14. printf("REAL %f\n", val->real);
  15. break;
  16. case L2_VAL_TYPE_ARRAY:
  17. {
  18. if (val->array == NULL) {
  19. printf("ARRAY, empty\n");
  20. return;
  21. }
  22. printf("ARRAY, len %zu\n", val->array->len);
  23. for (size_t i = 0; i < val->array->len; ++i) {
  24. printf(" %zu: %u\n", i, val->array->data[i]);
  25. }
  26. }
  27. break;
  28. case L2_VAL_TYPE_BUFFER:
  29. {
  30. if (val->buffer == NULL) {
  31. printf("BUFFER, empty\n");
  32. return;
  33. }
  34. printf("BUFFER, len %zu\n", val->buffer->len);
  35. for (size_t i = 0; i < val->buffer->len; ++i) {
  36. printf(" %zu: %c\n", i, val->buffer->data[i]);
  37. }
  38. }
  39. break;
  40. case L2_VAL_TYPE_NAMESPACE:
  41. {
  42. if (val->ns == NULL) {
  43. printf("NAMESPACE, empty, parent %u\n", val->extra.ns_parent);
  44. return;
  45. }
  46. printf("NAMESPACE, len %zu, parent %u\n", val->ns->len, val->extra.ns_parent);
  47. for (size_t i = 0; i < val->ns->size; ++i) {
  48. l2_word key = val->ns->data[i];
  49. l2_word v = val->ns->data[val->ns->size + i];
  50. if (key == 0 || key == ~(l2_word)0) continue;
  51. printf(" %u: %u\n", key, v);
  52. }
  53. }
  54. break;
  55. case L2_VAL_TYPE_FUNCTION:
  56. printf("FUNCTION, pos %u, ns %u\n", val->func.pos, val->func.ns);
  57. break;
  58. case L2_VAL_TYPE_CFUNCTION:
  59. // ISO C doesn't let you cast a function pointer to void*.
  60. printf("C FUNCTION, %jx\n", (uintmax_t)val->cfunc);
  61. break;
  62. case L2_VAL_TYPE_ERROR:
  63. printf("ERROR, %s\n", val->error);
  64. break;
  65. case L2_VAL_TYPE_CONTINUATION:
  66. printf("CONTINUATION, call %u, arg %u\n", val->cont.call, val->cont.arg);
  67. break;
  68. }
  69. }
  70. void l2_vm_print_state(struct l2_vm *vm) {
  71. printf("Stack:\n");
  72. l2_vm_print_stack(vm);
  73. printf("Heap:\n");
  74. l2_vm_print_heap(vm);
  75. printf("Frame Stack:\n");
  76. l2_vm_print_fstack(vm);
  77. }
  78. void l2_vm_print_heap(struct l2_vm *vm) {
  79. for (l2_word i = 0; i < vm->valuessize; ++i) {
  80. if (l2_bitset_get(&vm->valueset, i)) {
  81. printf(" %u: ", i);
  82. l2_vm_print_val(&vm->values[i]);
  83. }
  84. }
  85. }
  86. void l2_vm_print_stack(struct l2_vm *vm) {
  87. for (l2_word i = 0; i < vm->sptr; ++i) {
  88. printf(" %i: %i\n", i, vm->stack[i]);
  89. }
  90. }
  91. void l2_vm_print_fstack(struct l2_vm *vm) {
  92. for (l2_word i = 0; i < vm->fsptr; ++i) {
  93. printf(" %i: %i, ret %i, stack base %i\n",
  94. i, vm->fstack[i].ns, vm->fstack[i].retptr, vm->fstack[i].sptr);
  95. }
  96. }
  97. void l2_vm_print_op(l2_word *ops, size_t opcount, size_t *ptr) {
  98. enum l2_opcode opcode = (enum l2_opcode)ops[(*ptr)++];
  99. switch (opcode) {
  100. case L2_OP_NOP:
  101. printf("NOP\n");
  102. return;
  103. case L2_OP_DISCARD:
  104. printf("DISCARD\n");
  105. return;
  106. case L2_OP_SWAP_DISCARD:
  107. printf("SWAP_DISCARD\n");
  108. return;
  109. case L2_OP_DUP:
  110. printf("DUP\n");
  111. return;
  112. case L2_OP_ADD:
  113. printf("ADD\n");
  114. return;
  115. case L2_OP_FUNC_CALL:
  116. printf("FUNC_CALL %08x\n", ops[(*ptr)++]);
  117. return;
  118. case L2_OP_FUNC_CALL_INFIX:
  119. printf("FUNC_CALL_INFIX\n");
  120. return;
  121. case L2_OP_RJMP:
  122. printf("RJMP %08x\n", ops[(*ptr)++]);
  123. return;
  124. case L2_OP_STACK_FRAME_LOOKUP:
  125. printf("STACK_FRAME_LOOKUP %08x\n", ops[(*ptr)++]);
  126. return;
  127. case L2_OP_STACK_FRAME_SET:
  128. printf("STACK_FRAME_SET %08x\n", ops[(*ptr)++]);
  129. return;
  130. case L2_OP_STACK_FRAME_REPLACE:
  131. printf("STACK_FRAME_REPLACE %08x\n", ops[(*ptr)++]);
  132. return;
  133. case L2_OP_RET:
  134. printf("RET\n");
  135. return;
  136. case L2_OP_ALLOC_NONE:
  137. printf("ALLOC_NONE\n");
  138. return;
  139. case L2_OP_ALLOC_ATOM:
  140. printf("ALLOC_ATOM %08x\n", ops[(*ptr)++]);
  141. return;
  142. case L2_OP_ALLOC_REAL:
  143. {
  144. l2_word w1 = ops[(*ptr)++];
  145. l2_word w2 = ops[(*ptr)++];
  146. printf("ALLOC_REAL %08x %08x\n", w1, w2);
  147. }
  148. return;
  149. case L2_OP_ALLOC_BUFFER_STATIC:
  150. {
  151. l2_word w1 = ops[(*ptr)++];
  152. l2_word w2 = ops[(*ptr)++];
  153. printf("ALLOC_BUFFER_STATIC %08x %08x\n", w1, w2);
  154. }
  155. return;
  156. case L2_OP_ALLOC_ARRAY:
  157. printf("ALLOC_ARRAY %08x\n", ops[(*ptr)++]);
  158. return;
  159. case L2_OP_ALLOC_NAMESPACE:
  160. printf("ALLOC_NAMESPACE\n");
  161. return;
  162. case L2_OP_ALLOC_FUNCTION:
  163. printf("ALLOC_FUNCTION %08x\n", ops[(*ptr)++]);
  164. return;
  165. case L2_OP_NAMESPACE_SET:
  166. printf("NAMESPACE_SET %08x\n", ops[(*ptr)++]);
  167. return;
  168. case L2_OP_NAMESPACE_LOOKUP:
  169. printf("NAMESPACE_LOOKUP %08x\n", ops[(*ptr)++]);
  170. return;
  171. case L2_OP_ARRAY_LOOKUP:
  172. printf("ARRAY_LOOKUP %08x\n", ops[(*ptr)++]);
  173. return;
  174. case L2_OP_ARRAY_SET:
  175. printf("ARRAY_SET %08x\n", ops[(*ptr)++]);
  176. return;
  177. case L2_OP_DYNAMIC_LOOKUP:
  178. printf("DYNAMIC_LOOKUP\n");
  179. return;
  180. case L2_OP_DYNAMIC_SET:
  181. printf("DYNAMIC_SET\n");
  182. return;
  183. case L2_OP_HALT:
  184. printf("HALT\n");
  185. return;
  186. }
  187. l2_word word = (l2_word)opcode;
  188. char bytes[sizeof(word)];
  189. memcpy(&bytes, &word, sizeof(word));
  190. printf("?");
  191. for (size_t i = 0; i < sizeof(bytes); ++i) {
  192. printf(" %02x", bytes[i]);
  193. }
  194. printf("\n");
  195. }
  196. void l2_vm_print_bytecode(l2_word *ops, size_t opcount) {
  197. size_t ptr = 0;
  198. while (ptr < opcount) {
  199. printf("%04zu ", ptr);
  200. l2_vm_print_op(ops, opcount, &ptr);
  201. }
  202. }