-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVsim.cpp
More file actions
1155 lines (938 loc) · 24.8 KB
/
Vsim.cpp
File metadata and controls
1155 lines (938 loc) · 24.8 KB
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <unistd.h>
#include <sys/fcntl.h>
#include <map>
#include <assert.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
// Base_Common ////////////////////////////////////////////////////////////////////////////
typedef uint8_t byte;
typedef uint8_t b8;
typedef uint16_t b16;
typedef uint32_t b32;
typedef uint64_t b64;
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t i8;
typedef int16_t i16;
typedef int32_t i32;
typedef int64_t i64;
typedef float f32;
typedef double f64;
typedef intptr_t iptr;
typedef uintptr_t uptr;
typedef const char *cstr;
#define size_of(T) sizeof(T)
#define align_of(T) alignof(T)
// Base_Arena ////////////////////////////////////////////////////////////////////////////
#define KiB(bytes) ((u64) bytes << 10)
#define MiB(bytes) ((u64) bytes << 20)
#define GiB(bytes) ((u64) bytes << 30)
class Arena
{
public:
u64 size = 0;
byte *memory = nullptr;
byte *allocated = nullptr;
Arena() {}
Arena(u64 size);
~Arena();
byte *push(u64 size, u32 align);
void pop(u64 size);
void clear();
void release();
};
#define arena_push(arena, T, count) (T *) arena->push(size_of(T) * count, align_of(T))
#define arena_push_slc(arena, T, count) Slice<T>((T *) arena->push(size_of(T) * count, align_of(T)), count)
byte *align_ptr(byte *ptr, u32 align);
Arena::Arena(u64 size)
{
this->memory = new byte[size];
memset(this->memory, 0, size);
this->allocated = this->memory;
this->size = size;
}
Arena::~Arena()
{
this->release();
}
void Arena::release()
{
delete[] this->memory;
this->memory = nullptr;
this->allocated = nullptr;
this->size = 0;
}
[[nodiscard]]
byte *Arena::push(u64 size, u32 align)
{
byte *ptr = align_ptr(this->allocated, align);
this->allocated = ptr + size;
return ptr;
}
void Arena::pop(u64 size)
{
this->allocated -= size;
// - Zero the memory ---
u64 start_idx = (u64) (this->allocated - this->memory) - 1;
u64 end_idx = start_idx + size;
for (u64 i = start_idx; i < end_idx; i++)
{
this->allocated[i] = 0;
}
}
void Arena::clear()
{
for (u64 i = 0; i < (u64) (this->allocated - this->memory); i++)
{
this->memory[i] = 0;
}
this->allocated = this->memory;
}
byte *align_ptr(byte *ptr, u32 align)
{
u64 result = (u64) ptr;
u64 remainder = result % align;
if (remainder != 0)
{
result += align - remainder;
}
return (byte *) result;
}
// Base_Slice ////////////////////////////////////////////////////////////////////////////
template <typename T>
class Slice
{
public:
T *data = nullptr;
u64 len = 0;
Slice() {}
Slice(cstr s)
{
this->from_ptr(s, strlen(s));
}
Slice(T *data, u64 count)
{
this->from_ptr(data, count);
}
Slice(T *data, u64 start, u64 end)
{
this->from_ptr(data, start, end);
}
inline
T &operator[](u64 index) const
{
assert(index >= 0);
assert(index < this->len);
return this->data[index];
}
inline
void operator=(const Slice<T> &other)
{
this->data = other.data;
this->len = other.len;
}
inline
bool operator==(const Slice<T> &other) const
{
if (this->len != other.len) return false;
for (i32 i = 0; i < this->len; i++)
{
if (this->data[i] != other.data[i]) return false;
}
return true;
}
void from_ptr(T *data, u64 count=1)
{
assert(count >= 0);
this->data = data;
this->len = count;
}
void from_ptr(T *data, u64 start, u64 end)
{
assert(start < end);
assert(start >= 0);
this->data = &data[start];
this->len = end - start;
}
Slice<T> slice(u64 start, u64 end) const
{
assert(start < end);
assert(start >= 0);
assert(end <= this->len);
Slice<T> result;
result.data = &this->data[start];
result.len = end - start;
return result;
}
cstr clone_to_cstr(Arena *arena) const
{
char *result = arena_push(arena, char, this->len+1);
memcpy(result, this->data, this->len);
result[this->len] = 0;
return (cstr) result;
}
void print(bool new_line) const
{
for (u64 i = 0; i < this->len; i++)
{
printf("%c", this->data[i]);
}
if (new_line)
{
printf("\n");
}
}
};
// Base_Dynamic_Array ////////////////////////////////////////////////////////////////////
#ifndef DYNMAIC_ARRAY_GROWTH_RATE
#define DYNAMIC_ARRAY_GROWTH_RATE 2
#endif
template <typename T>
class Dynamic_Array
{
public:
T *data = nullptr;
u64 len = 0;
u64 cap = 0;
Arena *arena = nullptr;
Dynamic_Array(Arena *arena)
{
this->arena = arena;
}
inline
T &operator[](u64 idx) const
{
assert(idx >= 0 && idx < this->len);
return this->data[idx];
}
inline
void operator=(const Slice<T> &other)
{
this->data = other.data;
this->len = other.len;
this->cap = other.cap;
}
inline
Slice<T> slice(u64 start, u64 end) const
{
return Slice<T>(this->data, start, end);
}
inline
Slice<T> to_slice() const
{
return Slice<T>(this->data, this->len);
}
void append(T elem)
{
if (this->len >= this->cap)
{
u64 new_cap = (u64) ((f32) this->cap * DYNAMIC_ARRAY_GROWTH_RATE + 1);
this->resize(new_cap);
}
this->data[this->len] = elem;
this->len += 1;
}
void resize(u64 count)
{
if (count > this->cap)
{
T *new_data = arena_push(this->arena, T, count);
memcpy((byte *) new_data, this->data, this->len * size_of(T));
this->data = new_data;
this->cap = count;
}
}
void clear()
{
memset(this->data, 0, this->cap * size_of(T));
}
};
// Base_String ///////////////////////////////////////////////////////////////////////////
#define S(lit) ((String){.data = (char *) lit, .len = size_of(lit) - 1})
class String
{
public:
char *data = nullptr;
u64 len = 0;
static bool equals(String s1, String s2);
static String copy(String s, Arena *arena);
static String copy_into(String src, String *dest);
static String copy_cstr(cstr s, u64 len, Arena *arena);
static String concat(String s1, String s2, Arena *arena);
String clone(Arena *arena) const;
String clone_from_cstr(cstr s, Arena *arena) const;
cstr clone_to_cstr(Arena *arena) const;
String slice(u64 start, u64 end) const;
Slice<char> to_slice() const;
inline const
char &operator[](u64 index) const
{
assert(index >= 0 && index < this->len);
return this->data[index];
}
inline const
void operator=(String other)
{
this->data = other.data;
this->len = other.len;
}
inline const
bool operator==(String other)
{
return equals(*this, other);
}
};
inline
u64 cstr_len(cstr s)
{
u64 len = 0;
for (; s[len]; len++);
return len;
}
void copy_cstr_into_str(String *dest, cstr src)
{
u64 len = cstr_len(src);
for (u64 i = 0; i < len; i++)
{
dest->data[i] = src[i];
}
dest->len = len;
}
String str_from_cstr(cstr src)
{
String result;
u64 len = cstr_len(src);
for (u64 i = 0; i < len; i++)
{
result.data[i] = src[i];
}
result.len = len;
return result;
}
String str_from_slice(Slice<byte> slc)
{
return {(char *) slc.data, slc.len};
}
String str_from_slice(Slice<char> slc)
{
return {slc.data, slc.len};
}
String alloc_str(u64 len, Arena *arena)
{
String result;
result.data = arena_push(arena, char, len);
result.len = len;
for (u64 i = 0; i < len; i++)
{
result.data[i] = '\0';
}
return result;
}
String String::clone(Arena *arena) const
{
return String::copy(*this, arena);
}
String String::clone_from_cstr(cstr cstr, Arena *arena) const
{
return String::copy_cstr(cstr, cstr_len(cstr), arena);
}
cstr String::clone_to_cstr(Arena *arena) const
{
char *result = arena_push(arena, char, this->len+1);
memcpy(result, this->data, this->len);
result[this->len] = '\0';
return (cstr) result;
}
bool String::equals(String s1, String s2)
{
if (s1.len != s2.len) return false;
bool result = true;
for (u64 i = 0; i < s1.len; i++)
{
if (s1.data[i] != s2.data[i])
{
result = false;
break;
}
}
return result;
}
String String::copy(String str, Arena *arena)
{
String result;
result.data = arena_push(arena, char, str.len+1);
for (u64 i = 0; i < str.len; i++)
{
result.data[i] = str.data[i];
}
result.len = str.len;
result.data[result.len] = '\0';
return result;
}
String String::copy_into(String src, String *dest)
{
for (u64 i = 0; i < src.len; i++)
{
dest->data[i] = src.data[i];
}
dest->len = src.len;
return *dest;
}
String String::copy_cstr(cstr s, u64 len, Arena *arena)
{
String result;
result.data = arena_push(arena, char, len+1);
for (u64 i = 0; i < len; i++)
{
result.data[i] = s[i];
}
result.len = len;
result.data[result.len] = '\0';
return result;
}
String String::concat(String s1, String s2, Arena *arena)
{
String result = alloc_str(s1.len + s2.len + 1, arena);
result.len -= 1;
for (u64 i = 0; i < s1.len; i++)
{
result.data[i] = s1.data[i];
}
for (u64 i = 0; i < s2.len; i++)
{
result.data[i+s1.len] = s2.data[i];
}
result.data[result.len] = '\0';
return result;
}
String String::slice(u64 start, u64 end) const
{
assert(start < end);
assert(start >= 0);
assert(end > 0);
assert(end <= this->len);
String result = {0};
result.data = this->data + start;
result.len = static_cast<u64>(end - start);
return result;
}
Slice<char> String::to_slice() const
{
return Slice<char>((char *) this->data, this->len);
}
class String_Builder
{
public:
Dynamic_Array<char> buffer;
String_Builder(Arena *arena) : buffer(arena) {};
void resize(u64 count)
{
this->buffer.resize(count);
}
void write_char(char chr)
{
this->buffer.append(chr);
}
void write_string(String str)
{
for (u64 i = 0; i < str.len; i++)
{
this->buffer.append(str[i]);
}
}
String to_string() const
{
return str_from_slice(this->buffer.to_slice());
}
};
// Main ///////////////////////////////////////////////////////////////////////////////////
enum Opcode_Name
{
Opcode_NIL,
Opcode_BEQ,
Opcode_BNE,
Opcode_BLT,
Opcode_SW,
Opcode_ADD,
Opcode_SUB,
Opcode_AND,
Opcode_OR,
Opcode_ADDI,
Opcode_ANDI,
Opcode_ORI,
Opcode_SLLI,
Opcode_SRAI,
Opcode_LW,
Opcode_JAL,
Opcode_BREAK,
Opcode_COUNT,
};
struct Instruction
{
String bytecode_str;
Opcode_Name opcode_name;
u32 bytecode;
u32 opcode;
u32 rd;
u32 rs1;
u32 rs2;
i32 imm;
u32 fn3;
u32 fn7;
String needed;
};
Opcode_Name opcode_table[128];
String opcode_name_table[Opcode_COUNT];
String reg_name_table[32];
void init_global_data()
{
// - Opcode table ---
{
opcode_table[0b0000000] = Opcode_BEQ;
opcode_table[0b0000100] = Opcode_BNE;
opcode_table[0b0001000] = Opcode_BLT;
opcode_table[0b0001100] = Opcode_SW;
opcode_table[0b0000001] = Opcode_ADD;
opcode_table[0b0000101] = Opcode_SUB;
opcode_table[0b0001001] = Opcode_AND;
opcode_table[0b0001101] = Opcode_OR;
opcode_table[0b0000010] = Opcode_ADDI;
opcode_table[0b0000110] = Opcode_ANDI;
opcode_table[0b0001010] = Opcode_ORI;
opcode_table[0b0001110] = Opcode_SLLI;
opcode_table[0b0010010] = Opcode_SRAI;
opcode_table[0b0010110] = Opcode_LW;
opcode_table[0b0000011] = Opcode_JAL;
opcode_table[0b1111111] = Opcode_BREAK;
}
// - Opcode name table ---
{
opcode_name_table[Opcode_BEQ] = S("beq");
opcode_name_table[Opcode_BNE] = S("bne");
opcode_name_table[Opcode_BLT] = S("blt");
opcode_name_table[Opcode_SW] = S("sw");
opcode_name_table[Opcode_ADD] = S("add");
opcode_name_table[Opcode_SUB] = S("sub");
opcode_name_table[Opcode_AND] = S("and");
opcode_name_table[Opcode_OR] = S("or");
opcode_name_table[Opcode_ADDI] = S("addi");
opcode_name_table[Opcode_ANDI] = S("andi");
opcode_name_table[Opcode_ORI] = S("ori");
opcode_name_table[Opcode_SLLI] = S("slli");
opcode_name_table[Opcode_SRAI] = S("srai");
opcode_name_table[Opcode_LW] = S("lw");
opcode_name_table[Opcode_JAL] = S("jal");
opcode_name_table[Opcode_BREAK] = S("break");
}
// - Register name table ---
{
reg_name_table[0] = S("x0");
reg_name_table[1] = S("x1");
reg_name_table[2] = S("x2");
reg_name_table[3] = S("x3");
reg_name_table[4] = S("x4");
reg_name_table[5] = S("x5");
reg_name_table[6] = S("x6");
reg_name_table[7] = S("x7");
reg_name_table[8] = S("x8");
reg_name_table[9] = S("x9");
reg_name_table[10] = S("x10");
reg_name_table[11] = S("x11");
reg_name_table[12] = S("x12");
reg_name_table[13] = S("x13");
reg_name_table[14] = S("x14");
reg_name_table[15] = S("x15");
reg_name_table[16] = S("x16");
reg_name_table[17] = S("x17");
reg_name_table[18] = S("x18");
reg_name_table[19] = S("x19");
reg_name_table[20] = S("x20");
reg_name_table[21] = S("x21");
reg_name_table[22] = S("x22");
reg_name_table[23] = S("x23");
reg_name_table[24] = S("x24");
reg_name_table[25] = S("x25");
reg_name_table[26] = S("x26");
reg_name_table[27] = S("x27");
reg_name_table[28] = S("x28");
reg_name_table[29] = S("x29");
reg_name_table[30] = S("x30");
reg_name_table[31] = S("x31");
}
}
Instruction instruction_from_bytecode(u32 bytecode)
{
Instruction instr = {};
instr.bytecode = bytecode;
instr.opcode = bytecode & 0b1111111;
instr.opcode_name = opcode_table[instr.opcode];
u32 format = bytecode & 0b11;
switch (format)
{
case 0b00:
instr.imm += ( bytecode & ( (i32) 0b11111 << 7)) >> 7;
instr.fn3 |= ( bytecode & ( (u32) 0b111 << 12)) >> 12;
instr.rs1 |= ( bytecode & ( (u32) 0b11111 << 15)) >> 15;
instr.rs2 |= ( bytecode & ( (u32) 0b11111 << 20)) >> 20;
instr.imm += ((i32) bytecode & (i32) ((u32) 0b1111111 << 25)) >> 20;
break;
case 0b01:
instr.rd |= (bytecode & ((u32) 0b11111 << 7)) >> 7;
instr.fn3 |= (bytecode & ((u32) 0b111 << 12)) >> 12;
instr.rs1 |= (bytecode & ((u32) 0b11111 << 15)) >> 15;
instr.rs2 |= (bytecode & ((u32) 0b11111 << 20)) >> 20;
instr.fn7 |= (bytecode & ((u32) 0b1111111 << 25)) >> 25;
break;
case 0b10:
instr.rd |= ( bytecode & ( (u32) 0b11111 << 7)) >> 7;
instr.fn3 |= ( bytecode & ( (u32) 0b111 << 12)) >> 12;
instr.rs1 |= ( bytecode & ( (u32) 0b11111 << 15)) >> 15;
instr.imm |= ((i32) bytecode & (i32) ((u32) 0b111111111111 << 20)) >> 20;
break;
case 0b11:
instr.rd |= ( bytecode & ( (u32) 0b11111 << 7)) >> 7;
instr.imm |= ((i32) bytecode & (i32) ((u32) 0b111111111111111111111 << 12)) >> 12;
break;
}
return instr;
}
i32 bytecode_from_string(String str)
{
i32 result = 0;
for (u64 i = 0; i < str.len; i++)
{
char c = str[str.len-1-i];
if (c == '1')
{
result += 1 << i;
}
else if (c != '0')
{
result = -1;
break;
}
}
return result;
}
void disassemble(Slice<Instruction> instructions, Arena *perm, Arena *temp)
{
FILE *output_file = fopen("disassembly.txt", "w");
bool hit_break = false;
for (u64 i = 0; i < instructions.len; i++)
{
Instruction &instr = instructions[i];
String_Builder builder = String_Builder(temp);
u32 address = 256 + ((u32) i * 4);
if (hit_break)
{
char bytecode_buf[64] = {};
i32 bytecode_len = snprintf(bytecode_buf, 64, "%i", instr.bytecode);
builder.write_string(String{bytecode_buf, (u64) bytecode_len});
}
else
{
String opcode_str = opcode_name_table[instr.opcode_name];
builder.write_string(opcode_str);
builder.write_char(' ');
char fmt_buf[128] = {};
i32 fmt_len = 0;
u8 format = instr.bytecode & 0b11;
switch (format)
{
case 0b00:
if (instr.opcode_name != Opcode_SW)
{
builder.write_string(reg_name_table[instr.rs1]);
builder.write_string(S(", "));
builder.write_string(reg_name_table[instr.rs2]);
builder.write_string(S(", "));
builder.write_char('#');
fmt_len = snprintf(fmt_buf, 64, "%i", instr.imm);
builder.write_string(String{fmt_buf, (u64) fmt_len});
}
else
{
builder.write_string(reg_name_table[instr.rs1]);
builder.write_string(S(", "));
fmt_len = snprintf(fmt_buf, 64, "%i", instr.imm);
builder.write_string(String{fmt_buf, (u64) fmt_len});
builder.write_char('(');
builder.write_string(reg_name_table[instr.rs2]);
builder.write_char(')');
}
break;
case 0b01:
builder.write_string(reg_name_table[instr.rd]);
builder.write_string(S(", "));
builder.write_string(reg_name_table[instr.rs1]);
builder.write_string(S(", "));
builder.write_string(reg_name_table[instr.rs2]);
builder.write_string(S(" "));
break;
case 0b10:
if (instr.opcode_name != Opcode_LW)
{
builder.write_string(reg_name_table[instr.rd]);
builder.write_string(S(", "));
builder.write_string(reg_name_table[instr.rs1]);
builder.write_string(S(", "));
builder.write_char('#');
fmt_buf[64] = {};
fmt_len = snprintf(fmt_buf, 64, "%i", instr.imm);
builder.write_string(String{fmt_buf, (u64) fmt_len});
}
else
{
builder.write_string(reg_name_table[instr.rd]);
builder.write_string(S(", "));
fmt_buf[64] = {};
fmt_len = snprintf(fmt_buf, 64, "%i", instr.imm);
builder.write_string(String{fmt_buf, (u64) fmt_len});
builder.write_char('(');
builder.write_string(reg_name_table[instr.rs1]);
builder.write_char(')');
}
break;
case 0b11:
if (instr.opcode_name != Opcode_BREAK)
{
builder.write_string(reg_name_table[instr.rd]);
builder.write_string(S(", "));
builder.write_char('#');
fmt_buf[64] = {};
fmt_len = snprintf(fmt_buf, 64, "%i", instr.imm);
builder.write_string(String{fmt_buf, (u64) fmt_len});
}
break;
}
}
if (instr.opcode_name == Opcode_BREAK)
{
hit_break = true;
}
fprintf(output_file,
"%s\t%i\t%s\n",
instr.bytecode_str.clone_to_cstr(temp),
address,
builder.to_string().clone_to_cstr(temp));
char fmt_buf[64] = {};
i32 fmt_len = snprintf(fmt_buf, 64, "%i", address);
String fmt_str = String{fmt_buf, (u64) fmt_len};
String instr_str = String::concat(S(" "), builder.to_string(), temp);
instr.needed = String::concat(fmt_str, instr_str, perm);
temp->clear();
}
temp->clear();
}
void simulate(Slice<Instruction> instructions, Arena *temp)
{
FILE *output_file = fopen("simulation.txt", "w");
static
i32 registers[32] = {};
static
std::map<i32, i32> memory = {};
{
i32 offset = 256;
bool break_hit = false;
for (u32 i = 0; i < instructions.len; i++)
{
// - populate memory ---
if (break_hit)
{
memory[(i32) offset] = (i32) instructions[i].bytecode;
// printf("Loaded %i at %i\n", instructions[i].bytecode, offset);
}
offset += 4;
if (instructions[i].opcode_name != Opcode_BREAK && !break_hit)
{
continue;
}
else
{
break_hit = true;
}
}
}
i32 cycle_cnt = 1;
bool break_hit = false;
for (i32 pc_idx = 0; pc_idx < instructions.len;)
{
Instruction &instr = instructions[(u32) pc_idx];
char fmt_buf[128] = {};
i32 fmt_len = 0;
i32 mem_addr = 0;
i32 jump_off = 1;
switch (instr.opcode_name)
{
default:
break;
case Opcode_BEQ:
if (registers[instr.rs1] == registers[instr.rs2])
{
jump_off = instr.imm >> 1;
}
break;
case Opcode_BNE:
if (registers[instr.rs1] != registers[instr.rs2])
{
jump_off = instr.imm >> 1;
}
break;
case Opcode_BLT:
if (registers[instr.rs1] < registers[instr.rs2])
{
jump_off = instr.imm >> 1;
}
break;
case Opcode_SW:
mem_addr = registers[instr.rs2] + instr.imm;
memory[mem_addr] = registers[instr.rs1];
break;
case Opcode_ADD:
registers[instr.rd] = registers[instr.rs1] + registers[instr.rs2];
break;
case Opcode_SUB:
registers[instr.rd] = registers[instr.rs1] - registers[instr.rs2];
break;
case Opcode_AND:
registers[instr.rd] = (i32) ((u32) registers[instr.rs1] & (u32) registers[instr.rs2]);
break;
case Opcode_OR:
registers[instr.rd] = (i32) ((u32) registers[instr.rs1] | (u32) registers[instr.rs2]);
break;
case Opcode_ADDI:
registers[instr.rd] = registers[instr.rs1] + instr.imm;
break;
case Opcode_ANDI:
registers[instr.rd] = (i32) ((u32) registers[instr.rs1] & (u32) instr.imm);
break;
case Opcode_ORI:
registers[instr.rd] = (i32) ((u32) registers[instr.rs1] | (u32) instr.imm);
break;