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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  1. #include "vm/print.h"
  2. #include <stdio.h>
  3. void l2_vm_print_val(struct l2_vm_value *val) {
  4. switch (val->flags & 0x0f) {
  5. case L2_VAL_TYPE_NONE:
  6. printf("NONE\n");
  7. break;
  8. case L2_VAL_TYPE_INTEGER:
  9. printf("INTEGER %zi\n", val->integer);
  10. break;
  11. case L2_VAL_TYPE_REAL:
  12. printf("REAL %f\n", val->real);
  13. break;
  14. case L2_VAL_TYPE_ARRAY:
  15. {
  16. if (val->data == NULL) {
  17. printf("ARRAY, empty\n");
  18. return;
  19. }
  20. struct l2_vm_array *arr = (struct l2_vm_array *)val->data;
  21. printf("ARRAY, len %zu\n", arr->len);
  22. for (size_t i = 0; i < arr->len; ++i) {
  23. printf(" %zu: %u\n", i, arr->data[i]);
  24. }
  25. }
  26. break;
  27. case L2_VAL_TYPE_BUFFER:
  28. {
  29. if (val->data == NULL) {
  30. printf("BUFFER, empty\n");
  31. return;
  32. }
  33. struct l2_vm_buffer *buf = (struct l2_vm_buffer *)val->data;
  34. printf("BUFFER, len %zu\n", buf->len);
  35. for (size_t i = 0; i < buf->len; ++i) {
  36. printf(" %zu: %c\n", i, buf->data[i]);
  37. }
  38. }
  39. break;
  40. case L2_VAL_TYPE_NAMESPACE:
  41. {
  42. if (val->data == NULL) {
  43. printf("NAMESPACE, empty\n");
  44. return;
  45. }
  46. struct l2_vm_namespace *ns = (struct l2_vm_namespace *)val->data;
  47. printf("NAMESPACE, len %zu\n", ns->len);
  48. }
  49. break;
  50. case L2_VAL_TYPE_FUNCTION:
  51. printf("FUNCTION, pos %u, ns %u\n", val->func.pos, val->func.namespace);
  52. break;
  53. }
  54. }
  55. void l2_vm_print_state(struct l2_vm *vm) {
  56. printf("Stack:\n");
  57. l2_vm_print_stack(vm);
  58. printf("Heap:\n");
  59. l2_vm_print_heap(vm);
  60. printf("NStack:\n");
  61. l2_vm_print_nstack(vm);
  62. }
  63. void l2_vm_print_heap(struct l2_vm *vm) {
  64. for (l2_word i = 0; i < vm->valuessize; ++i) {
  65. if (l2_bitset_get(&vm->valueset, i)) {
  66. printf(" %u: ", i);
  67. l2_vm_print_val(&vm->values[i]);
  68. }
  69. }
  70. }
  71. void l2_vm_print_stack(struct l2_vm *vm) {
  72. for (l2_word i = 0; i < vm->sptr; ++i) {
  73. printf(" %i: %i\n", i, vm->stack[i]);
  74. }
  75. }
  76. void l2_vm_print_nstack(struct l2_vm *vm) {
  77. for (l2_word i = 0; i < vm->nsptr; ++i) {
  78. printf(" %i: %i\n", i, vm->nstack[i]);
  79. }
  80. }
  81. static void print_op_num(l2_word *ops, size_t opcount, size_t ptr) {
  82. if (ptr >= opcount) {
  83. printf("<EOF>");
  84. } else {
  85. printf("%i", ops[ptr]);
  86. }
  87. }
  88. void l2_vm_print_op(l2_word *ops, size_t opcount, size_t *ptr) {
  89. enum l2_opcode opcode = (enum l2_opcode)ops[(*ptr)++];
  90. switch (opcode) {
  91. case L2_OP_NOP:
  92. printf("NOP\n");
  93. break;
  94. case L2_OP_PUSH:
  95. printf("PUSH ");
  96. print_op_num(ops, opcount, (*ptr)++);
  97. printf("\n");
  98. break;
  99. case L2_OP_PUSH_2:
  100. printf("PUSH2 ");
  101. print_op_num(ops, opcount, (*ptr)++);
  102. printf(" ");
  103. print_op_num(ops, opcount, (*ptr)++);
  104. printf("\n");
  105. break;
  106. case L2_OP_POP:
  107. printf("POP\n");
  108. break;
  109. case L2_OP_DUP:
  110. printf("DUP\n");
  111. break;
  112. case L2_OP_ADD:
  113. printf("ADD\n");
  114. break;
  115. case L2_OP_CALL:
  116. printf("CALL\n");
  117. break;
  118. case L2_OP_RJMP:
  119. printf("RJMP\n");
  120. break;
  121. case L2_OP_GEN_STACK_FRAME:
  122. printf("GEN_STACK_FRAME\n");
  123. break;
  124. case L2_OP_STACK_FRAME_LOOKUP:
  125. printf("STACK_FRAME_LOOKUP\n");
  126. break;
  127. case L2_OP_STACK_FRAME_SET:
  128. printf("STACK_FRAME_SET\n");
  129. break;
  130. case L2_OP_RET:
  131. printf("RET\n");
  132. break;
  133. case L2_OP_ALLOC_INTEGER_32:
  134. printf("ALLOC_INTEGER_32\n");
  135. break;
  136. case L2_OP_ALLOC_INTEGER_64:
  137. printf("ALLOC_INTEGER_64\n");
  138. break;
  139. case L2_OP_ALLOC_REAL_32:
  140. printf("ALLOC_REAL_32\n");
  141. break;
  142. case L2_OP_ALLOC_REAL_64:
  143. printf("ALLOC_REAL_64\n");
  144. break;
  145. case L2_OP_ALLOC_BUFFER_STATIC:
  146. printf("ALLOC_BUFFER_STATIC\n");
  147. break;
  148. case L2_OP_ALLOC_BUFFER_ZERO:
  149. printf("ALLOC_BUFFER_ZERO\n");
  150. break;
  151. case L2_OP_ALLOC_ARRAY:
  152. printf("ALLOC_ARRAY\n");
  153. break;
  154. case L2_OP_ALLOC_NAMESPACE:
  155. printf("ALLOC_NAMESPACE\n");
  156. break;
  157. case L2_OP_ALLOC_FUNCTION:
  158. printf("ALLOC_FUNCTION\n");
  159. break;
  160. case L2_OP_NAMESPACE_SET:
  161. printf("NAMESPACE_SET\n");
  162. break;
  163. case L2_OP_HALT:
  164. printf("HALT\n");
  165. break;
  166. }
  167. }
  168. void l2_vm_print_bytecode(l2_word *ops, size_t opcount) {
  169. size_t ptr = 0;
  170. while (ptr < opcount) {
  171. l2_vm_print_op(ops, opcount, &ptr);
  172. }
  173. }