aboutsummaryrefslogtreecommitdiff
path: root/src/main.c
blob: 52988760ba5795b5087643388d7ead9be7cde998 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/* Copyright (C) 2023 Aryadev Chavali

 * You may distribute and modify this code under the terms of the
 * GPLv2 license.  You should have received a copy of the GPLv2
 * license with this file.  If not, please write to:
 * aryadev@aryadevchavali.com.

 * Created: 2023-10-15
 * Author: Aryadev Chavali
 * Description: Entrypoint to program
 */

#include <assert.h>
#include <stdio.h>
#include <string.h>

#include "./inst.h"
#include "./runtime.h"

int interpret_bytecode(const char *filepath)
{
  FILE *fp             = fopen(filepath, "rb");
  size_t number        = 0;
  inst_t *instructions = insts_read_bytecode_file(fp, &number);
  fclose(fp);

  byte stack[256];
  vm_t vm = {0};
  vm_load_stack(&vm, stack, ARR_SIZE(stack));
  vm_load_program(&vm, instructions, number);
  for (size_t i = 0; i < number; ++i)
  {
    vm_execute(&vm);
    printf("Cycle %lu\n", i);
    vm_print_all(&vm, stdout);
    printf("\n");
  }
  free(instructions);
  return 0;
}

int assemble_instructions(inst_t *instructions, size_t number,
                          const char *filepath)
{
  FILE *fp = fopen(filepath, "wb");
  insts_write_bytecode_file(instructions, number, fp);
  fclose(fp);
  return 0;
}

int main(void)
{
  byte stack_data[256];
  vm_t vm = {0};
  vm_load_stack(&vm, stack_data, ARR_SIZE(stack_data));
  inst_t instructions[] = {
      INST_BPUSH(0xfa),  INST_BMOV(0),      INST_BPUSH(0xfb),
      INST_BMOV(1),      INST_BPUSH(0xfc),  INST_BMOV(2),
      INST_BPUSH(0xfd),  INST_BMOV(3),      INST_BPUSH_REG(3),
      INST_BPUSH_REG(2), INST_BPUSH_REG(1), INST_BPUSH_REG(0),
  };
  vm_load_program(&vm, instructions, ARR_SIZE(instructions));
  for (size_t i = 0; i < ARR_SIZE(instructions); ++i)
    vm_execute(&vm);
  return 0;
}