aboutsummaryrefslogtreecommitdiff
path: root/main.c
blob: 58357c873f41d81f04fa509e7b501dc2e960d1a6 (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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
/* main.c
 * Created: 2023-09-02
 * Author: Aryadev Chavali
 * Description: Entrypoint of compiler
 */

#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "./lib.h"
#include "./parser.h"

#define MEMORY_DEFAULT 30000

#define MIN_MEM_DUMP 64

typedef struct
{
  size_t dp;
  uint8_t memory[MEMORY_DEFAULT];

#ifdef DEBUG
  size_t dp_max;
#endif
} machine_t;

void interpret(machine_t *cpu, node_t *ast, size_t num)
{
  for (size_t i = 0; i < num; ++i)
  {
    node_t node = ast[i];
    switch (node.type)
    {
    case NEXT:
      ++cpu->dp;
      break;
    case PREV:
      --cpu->dp;
      break;
    case INC:
      ++cpu->memory[cpu->dp];
      break;
    case DEC:
      --cpu->memory[cpu->dp];
      break;
    case OUT:
      putchar(cpu->memory[cpu->dp]);
      break;
    case READ:
      cpu->memory[cpu->dp] = getchar();
      break;
    case LIN:
      if (cpu->memory[cpu->dp] == 0)
        i = node.loop_ref;
      break;
    case LOUT:
      if (cpu->memory[cpu->dp] != 0)
        i = node.loop_ref;
      break;
    }
#ifdef DEBUG
    if (cpu->dp > cpu->dp_max)
      cpu->dp_max = cpu->dp + 1;
#endif
  }

#ifdef DEBUG
  if (cpu->dp_max < MIN_MEM_DUMP)
    cpu->dp_max = MIN_MEM_DUMP;
#endif
}

void usage(const char *name, FILE *fp)
{
  fprintf(fp,
          "Usage: %s [FILE]...\n\tExecutes FILES sequentially on the "
          "same machine\n",
          name);
}

int main(int argc, char *argv[])
{
  if (argc == 1)
  {
    usage(argv[0], stderr);
    return 1;
  }

  char *filepath = NULL, *file_data = NULL;
  buffer_t *buffer   = NULL;
  struct PResult res = {0};

  machine_t machine = {0};

  for (int i = 1; i < argc; ++i)
  {
    filepath = argv[i];

    FILE *handle = fopen(filepath, "r");
#ifdef DEBUG
    printf("[DEBUG]: Attempting to open file handle to %s\n", filepath);
#endif
    if (!handle)
    {
      fprintf(stderr, "ERROR: Could not open \"%s\"\n", filepath);
      goto error;
    }
    file_data = fread_all(handle);
    fclose(handle);
#ifdef DEBUG
    printf("[DEBUG]: Read data from file %s\n", filepath);
#endif

    buffer = buffer_init_str(filepath, file_data, strlen(file_data));
#ifdef DEBUG
    puts("[DEBUG]: Initialised buffer");
#endif
    res = parse_buffer(buffer);
    if (res.nodes == NULL)
    {
      fputs("Exiting early...\n", stderr);
      goto error;
    }

#ifdef DEBUG
    char *str = ast_to_str(res.nodes, res.size);
    printf("[DEBUG]: Parsed buffer (%lu nodes parsed)\n\t[DEBUG]: Out=%s\n",
           res.size, str);
    free(str);
#endif

    interpret(&machine, res.nodes, res.size);

#ifdef DEBUG
    printf("[DEBUG]: Finished interpreting, memory:");
    for (size_t i = 0; i < machine.dp_max; ++i)
    {
      if (i % 8 == 0)
        printf("\n\t");
      printf("%d    ", machine.memory[i]);
    }
#endif

    free(res.nodes);
    free(buffer);
    free(file_data);
  }
  return 0;
error:
  if (buffer)
    free(buffer);
  if (res.nodes)
    free(res.nodes);
  return 1;
}