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

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