Dariaceli's Git
Browse code

(uxn-fast) First draft

Devine Lu Linvega authored on 03/03/2023 00:37:14
Showing 2 changed files
build.sh
History View file @ 61393d0
... ... 
@@ -94,7 +94,7 @@ then
94 94 
 	CORE='src/uxn.c'
95 95 
 else
96 96 
 	CFLAGS="${CFLAGS} -DNDEBUG -Os -g0 -s"
97 
-	CORE='src/uxn.c'
97 
+	CORE='src/uxn-fast.c'
98 98 
 fi
99 99
100 100 
 echo "Building.."
src/uxn-fast.c
History View file @ 61393d0
101 101 
new file mode 100644
... ... 
@@ -0,0 +1,145 @@
1 
+#include "uxn.h"
2 
+
3 
+#include <stdio.h>
4 
+
5 
+/*
6 
+Copyright (u) 2022-2023 Devine Lu Linvega, Andrew Alderwick, Andrew Richards
7 
+
8 
+Permission to use, copy, modify, and distribute this software for any
9 
+purpose with or without fee is hereby granted, provided that the above
10 
+copyright notice and this permission notice appear in all copies.
11 
+
12 
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
13 
+WITH REGARD TO THIS SOFTWARE.
14 
+*/
15 
+
16 
+/* Registers
17 
+
18 
+[ . ][ . ][ . ][ L ][ N ][ T ] <
19 
+[ . ][ . ][ . ][   H2   ][ T ] <
20 
+[   L2   ][   N2   ][   T2   ] <
21 
+
22 
+*/
23 
+
24 
+#define T s->dat[s->ptr-1]
25 
+#define N s->dat[s->ptr-2]
26 
+#define L s->dat[s->ptr-3]
27 
+#define H2 PEEK16(s->dat+s->ptr-3)
28 
+#define T2 PEEK16(s->dat+s->ptr-2)
29 
+#define N2 PEEK16(s->dat+s->ptr-4)
30 
+#define L2 PEEK16(s->dat+s->ptr-6)
31 
+
32 
+#define HALT(c) { return uxn_halt(u, instr, (c), pc - 1); }
33 
+#define INC(mul, add) { if(mul > s->ptr) HALT(1) s->ptr += k * mul + add; }
34 
+#define DEC(mul, sub) { if(mul > s->ptr) HALT(1) s->ptr -= !k * mul - sub; }
35 
+#define PUT(o, v) { s->dat[s->ptr - o - 1] = (v); }
36 
+#define PUT2(o, v) { tmp = (v); s->dat[s->ptr - o - 2] = tmp >> 8; s->dat[s->ptr - o - 1] = tmp; }
37 
+#define PUSH(stack, v) { stack->dat[stack->ptr++] = (v); }
38 
+#define PUSH2(stack, v) { tmp = (v); stack->dat[stack->ptr] = (v) >> 8; stack->dat[stack->ptr + 1] = (v); stack->ptr += 2; }
39 
+
40 
+int
41 
+uxn_eval(Uxn *u, Uint16 pc)
42 
+{
43 
+	Uint8 instr, opc, k;
44 
+	Uint16 t, n, l, tmp;
45 
+	Stack *s;
46 
+	if(!pc || u->dev[0x0f]) return 0;
47 
+	for(;;) {
48 
+		instr = u->ram[pc++];
49 
+		k = !!(instr & 0x80);
50 
+		s = instr & 0x40 ? u->rst : u->wst;
51 
+		opc = instr & 0x3f;
52 
+		if(!(instr & 0x1f))
53 
+			opc = 0 - (instr >> 5);
54 
+		switch(opc) {
55 
+			/* IMM */
56 
+			case 0x00: /* BRK   */ return 1;
57 
+			case 0xff: /* JCI   */ pc += !!s->dat[--s->ptr] * PEEK16(u->ram + pc) + 2; break;
58 
+			case 0xfe: /* JMI   */ pc += PEEK16(u->ram + pc) + 2; break;
59 
+			case 0xfd: /* JSI   */ PUSH2(u->rst, pc + 2); pc += PEEK16(u->ram + pc) + 2; break;
60 
+			case 0xfc: /* LIT   */ PUSH(u->wst, u->ram[pc++]); break;
61 
+			case 0xfb: /* LIT2  */ PUSH2(u->wst, PEEK16(u->ram + pc)); pc += 2; break;
62 
+			case 0xfa: /* LITr  */ PUSH(u->rst, u->ram[pc++]); break;
63 
+			case 0xf9: /* LIT2r */ PUSH2(u->rst, PEEK16(u->ram + pc)); pc += 2; break;
64 
+			/* ALU */
65 
+			case 0x21: /* INC2 */ t=T2;           INC(2, 0) PUT2(0, t + 1) break;
66 
+			case 0x01: /* INC  */ t=T;            INC(1, 0) PUT(0, t + 1); break;
67 
+			case 0x22: /* POP2 */                 DEC(2, 0) break;
68 
+			case 0x02: /* POP  */                 DEC(1, 0) break;
69 
+			case 0x23: /* NIP2 */ t=T2;           DEC(2, 0) PUT2(0, t) break;
70 
+			case 0x03: /* NIP  */ t=T;            DEC(1, 0) PUT(0, t) break;
71 
+			case 0x24: /* SWP2 */ t=T2;n=N2;      INC(4, 0) PUT2(2, t) PUT2(0, n); break;
72 
+			case 0x04: /* SWP  */ t=T;n=N;        INC(2, 0) PUT(0, n) PUT(1, t); break;
73 
+			case 0x25: /* ROT2 */ t=T2;n=N2;l=L2; INC(6, 0) PUT2(0, l) PUT2(2, t) PUT2(4, n) break;
74 
+			case 0x05: /* ROT  */ t=T;n=N;l=L;    INC(3, 0) PUT(0, l) PUT(1, t) PUT(2, n) break;
75 
+			case 0x26: /* DUP2 */ t=T2;           INC(2, 2) PUT2(0, t) PUT2(2, t) break;
76 
+			case 0x06: /* DUP  */ t=T;            INC(1, 1) PUT(0, t) PUT(1, t) break;
77 
+			case 0x27: /* OVR2 */ t=T2;n=N2;      INC(4, 2) PUT2(0, n) PUT2(2, t) PUT2(4, n) break;
78 
+			case 0x07: /* OVR  */ t=T;n=N;        INC(2, 1) PUT(0, n) PUT(1, t) PUT(2, n) break;
79 
+			case 0x28: /* EQU2 */ t=T2;n=N2;      INC(4,-3) PUT(0, n == t) break;
80 
+			case 0x08: /* EQU  */ t=T;n=N;        INC(2,-1) PUT(0, n == t) break;
81 
+			case 0x29: /* NEQ2 */ t=T2;n=N2;      INC(4,-3) PUT(0, n != t) break;
82 
+			case 0x09: /* NEQ  */ t=T;n=N;        INC(2,-1) PUT(0, n != t) break;
83 
+			case 0x2a: /* GTH2 */ t=T2;n=N2;      INC(4,-3) PUT(0, n > t)  break;
84 
+			case 0x0a: /* GTH  */ t=T;n=N;        INC(2,-1) PUT(0, n > t) break;
85 
+			case 0x2b: /* LTH2 */ t=T2;n=N2;      INC(4,-3) PUT(0, n < t)  break;
86 
+			case 0x0b: /* LTH  */ t=T;n=N;        INC(2,-1) PUT(0, n < t) break;
87 
+			case 0x2c: /* JMP2 */ t=T2;           DEC(2, 0) pc = t; break;
88 
+			case 0x0c: /* JMP  */ t=T;            DEC(1, 0) pc += (Sint8)(t);  break;
89 
+			case 0x2d: /* JCN2 */ t=T2;n=L;       DEC(3, 0) if(n) { pc = t; } break;
90 
+			case 0x0d: /* JCN  */ t=T;n=N;        DEC(2, 0) pc += !!n * (Sint8)t; break;
91 
+			case 0x2e: /* JSR2 */ t=T2;           DEC(2, 0) PUSH2(u->rst, pc) pc = t; break;
92 
+			case 0x0e: /* JSR  */ t=T;            DEC(1, 0) PUSH2(u->rst, pc) pc += (Sint8)t; break;
93 
+			case 0x2f: /* STH2 */ t=T2; if(instr & 0x40){ u->rst->ptr -= !k * 2; PUSH2(u->wst, t); } else{ u->wst->ptr -= !k * 2; PUSH2(u->rst, t); } break;
94 
+			case 0x0f: /* STH  */ t=T;  if(instr & 0x40){ u->rst->ptr -= !k; PUSH(u->wst, t); } else{ u->wst->ptr -= !k; PUSH(u->rst, t); } break;
95 
+			case 0x30: /* LDZ2 */ t=T;            INC(1, 1) PUT2(0, PEEK16(u->ram + t)) break;
96 
+			case 0x10: /* LDZ  */ t=T;            INC(1, 0) PUT(0, u->ram[t]) break;
97 
+			case 0x31: /* STZ2 */ t=T;n=H2;       DEC(3, 0) POKE16(u->ram + t, n) break;
98 
+			case 0x11: /* STZ  */ t=T;n=N;        DEC(2, 0) u->ram[t] = n; break;
99 
+			case 0x32: /* LDR2 */ t=T;            INC(1, 1) PUT2(0, PEEK16(u->ram + pc + (Sint8)t)) break;
100 
+			case 0x12: /* LDR  */ t=T;            INC(1, 0) PUT(0, u->ram[pc + (Sint8)t]) break;
101 
+			case 0x33: /* STR2 */ t=T;n=H2;       DEC(3, 0) POKE16(u->ram + pc + (Sint8)t, n) break;
102 
+			case 0x13: /* STR  */ t=T;n=N;        DEC(2, 0) u->ram[pc + (Sint8)t] = n; break;
103 
+			case 0x34: /* LDA2 */ t=T2;           INC(2, 0) PUT2(0, PEEK16(u->ram + t)) break;
104 
+			case 0x14: /* LDA  */ t=T2;           INC(2,-1) PUT(0, u->ram[t]) break;
105 
+			case 0x35: /* STA2 */ t=T2;n=N2;      DEC(4, 0) POKE16(u->ram + t, n) break;
106 
+			case 0x15: /* STA  */ t=T2;n=L;       DEC(3, 0) u->ram[t] = n; break;
107 
+			case 0x36: /* DEI2 */ t=T;            INC(1, 1) PUT(1, u->dei(u, t)) PUT(0, u->dei(u, t + 1)) break;
108 
+			case 0x16: /* DEI  */ t=T;            INC(1, 0) PUT(0, u->dei(u, t)) break;
109 
+			case 0x37: /* DEO2 */ t=T;n=N;l=L;    DEC(3, 0) u->deo(u, t, l); u->deo(u, t + 1, n); break;
110 
+			case 0x17: /* DEO  */ t=T;n=N;        DEC(2, 0) u->deo(u, t, n); break;
111 
+			case 0x38: /* ADD2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n + t) break;
112 
+			case 0x18: /* ADD  */ t=T;n=N;        INC(2,-1) PUT(0, n + t) break;
113 
+			case 0x39: /* SUB2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n - t) break;
114 
+			case 0x19: /* SUB  */ t=T;n=N;        INC(2,-1) PUT(0, n - t) break;
115 
+			case 0x3a: /* MUL2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n * t) break;
116 
+			case 0x1a: /* MUL  */ t=T;n=N;        INC(2,-1) PUT(0, n * t) break;
117 
+			case 0x3b: /* DIV2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n / t) break;
118 
+			case 0x1b: /* DIV  */ t=T;n=N;        INC(2,-1) PUT(0, n / t) break;
119 
+			case 0x3c: /* AND2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n & t) break;
120 
+			case 0x1c: /* AND  */ t=T;n=N;        INC(2,-1) PUT(0, n & t) break;
121 
+			case 0x3d: /* ORA2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n | t) break;
122 
+			case 0x1d: /* ORA  */ t=T;n=N;        INC(2,-1) PUT(0, n | t) break;
123 
+			case 0x3e: /* EOR2 */ t=T2;n=N2;      INC(4,-2) PUT2(0, n ^ t) break;
124 
+			case 0x1e: /* EOR  */ t=T;n=N;        INC(2,-1) PUT(0, n ^ t) break;
125 
+			case 0x3f: /* SFT2 */ t=T;n=H2;       INC(3,-1) PUT2(0, n >> (t & 0x0f) << ((t & 0xf0) >> 4)) break;
126 
+			case 0x1f: /* SFT  */ t=T;n=N;        INC(2,-1) PUT(0, n >> (t & 0x0f) << ((t & 0xf0) >> 4)) break;
127 
+		}
128 
+	}
129 
+}
130 
+
131 
+int
132 
+uxn_boot(Uxn *u, Uint8 *ram, Dei *dei, Deo *deo)
133 
+{
134 
+	Uint32 i;
135 
+	char *cptr = (char *)u;
136 
+	for(i = 0; i < sizeof(*u); i++)
137 
+		cptr[i] = 0x00;
138 
+	u->wst = (Stack *)(ram + 0xf0000);
139 
+	u->rst = (Stack *)(ram + 0xf0100);
140 
+	u->dev = (Uint8 *)(ram + 0xf0200);
141 
+	u->ram = ram;
142 
+	u->dei = dei;
143 
+	u->deo = deo;
144 
+	return 1;
145 
+}