aboutsummaryrefslogtreecommitdiffstats
path: root/src/uxn.c
diff options
context:
space:
mode:
authorBad Diode <bd@badd10de.dev>2023-08-30 20:31:08 +0200
committerBad Diode <bd@badd10de.dev>2023-08-30 20:31:08 +0200
commit874ae39b6074da2778b72bcbaf6c7c7ef19aa233 (patch)
tree5ed5989ac78df0fea75c88c0b63f9a1a5ead6f53 /src/uxn.c
parentbe57c62f4633623005b5ac463ce7f65e8761d9bd (diff)
downloaduxngba-874ae39b6074da2778b72bcbaf6c7c7ef19aa233.tar.gz
uxngba-874ae39b6074da2778b72bcbaf6c7c7ef19aa233.zip
Remove previous uxn core
Diffstat (limited to 'src/uxn.c')
-rw-r--r--src/uxn.c117
1 files changed, 0 insertions, 117 deletions
diff --git a/src/uxn.c b/src/uxn.c
deleted file mode 100644
index d525ff1..0000000
--- a/src/uxn.c
+++ /dev/null
@@ -1,117 +0,0 @@
1#include "uxn.h"
2
3/*
4Copyright (u) 2022-2023 Devine Lu Linvega, Andrew Alderwick, Andrew Richards
5
6Permission to use, copy, modify, and distribute this software for any
7purpose with or without fee is hereby granted, provided that the above
8copyright notice and this permission notice appear in all copies.
9
10THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11WITH REGARD TO THIS SOFTWARE.
12*/
13
14#define T s->dat[s->ptr - 1]
15#define N s->dat[s->ptr - 2]
16#define L s->dat[s->ptr - 3]
17#define H2 PEEK2(s->dat + s->ptr - 3)
18#define T2 PEEK2(s->dat + s->ptr - 2)
19#define N2 PEEK2(s->dat + s->ptr - 4)
20#define L2 PEEK2(s->dat + s->ptr - 6)
21
22/* Registers
23
24[ . ][ . ][ . ][ L ][ N ][ T ] <
25[ . ][ . ][ . ][ H2 ][ T ] <
26[ L2 ][ N2 ][ T2 ] <
27
28*/
29
30
31u16 deo_mask[] = {0xff08, 0x0300, 0xc028, 0x8000, 0x8000, 0x8000, 0x8000, 0x0000, 0x0000, 0x0000, 0xa260, 0xa260, 0x0000, 0x0000, 0x0000, 0x0000};
32u16 dei_mask[] = {0x0000, 0x0000, 0x003c, 0x0014, 0x0014, 0x0014, 0x0014, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x07ff, 0x0000, 0x0000, 0x0000};
33
34#define POKE2(d, v) { (d)[0] = (v) >> 8; (d)[1] = (v); }
35#define PEEK2(d) ((d)[0] << 8 | (d)[1])
36#define HALT(c) { return uxn_halt(u, ins, (c), pc - 1); }
37#define SET(mul, add) { if(mul > s->ptr) HALT(1) tmp = s->ptr + k * mul + add; if(tmp > 254) HALT(2) s->ptr = tmp; }
38#define PUT(o, v) { s->dat[(u8)(s->ptr - 1 - (o))] = (v); }
39#define PUT2(o, v) { tmp = (v); s->dat[(u8)(s->ptr - o - 2)] = tmp >> 8; s->dat[(u8)(s->ptr - o - 1)] = tmp; }
40#define PUSH(stack, v) { if(s->ptr > 254) HALT(2) stack->dat[stack->ptr++] = (v); }
41#define PUSH2(stack, v) { if(s->ptr > 253) HALT(2) tmp = (v); stack->dat[stack->ptr] = tmp >> 8; stack->dat[stack->ptr + 1] = tmp; stack->ptr += 2; }
42#define DEO(a, b) { u->dev[(a)] = (b); if((deo_mask[(a) >> 4] >> ((a) & 0xf)) & 0x1) uxn_deo(u, (a)); }
43#define DEI(a, b) { PUT((a), ((dei_mask[(b) >> 4] >> ((b) & 0xf)) & 0x1) ? uxn_dei(u, (b)) : u->dev[(b)]) }
44
45IWRAM_CODE
46int
47uxn_eval(Uxn *u, u16 pc) {
48 u8 ins, opc, k;
49 u16 t, n, l, tmp;
50 Stack *s;
51 if(!pc || u->dev[0x0f]) return 0;
52 for(;;) {
53 ins = u->ram[pc++];
54 k = !!(ins & 0x80);
55 s = ins & 0x40 ? u->rst : u->wst;
56 opc = !(ins & 0x1f) ? 0 - (ins >> 5) : ins & 0x3f;
57 switch(opc) {
58 /* IMM */
59 case 0x00: /* BRK */ return 1;
60 case 0xff: /* JCI */ pc += !!s->dat[--s->ptr] * PEEK2(u->ram + pc) + 2; break;
61 case 0xfe: /* JMI */ pc += PEEK2(u->ram + pc) + 2; break;
62 case 0xfd: /* JSI */ PUSH2(u->rst, pc + 2) pc += PEEK2(u->ram + pc) + 2; break;
63 case 0xfc: /* LIT */ PUSH(s, u->ram[pc++]) break;
64 case 0xfb: /* LIT2 */ PUSH2(s, PEEK2(u->ram + pc)) pc += 2; break;
65 case 0xfa: /* LITr */ PUSH(s, u->ram[pc++]) break;
66 case 0xf9: /* LIT2r */ PUSH2(s, PEEK2(u->ram + pc)) pc += 2; break;
67 /* ALU */
68 case 0x01: /* INC */ t=T; SET(1, 0) PUT(0, t + 1) break; case 0x21: t=T2; SET(2, 0) PUT2(0, t + 1) break;
69 case 0x02: /* POP */ SET(1,-1) break; case 0x22: SET(2,-2) break;
70 case 0x03: /* NIP */ t=T; SET(2,-1) PUT(0, t) break; case 0x23: t=T2; SET(4,-2) PUT2(0, t) break;
71 case 0x04: /* SWP */ t=T;n=N; SET(2, 0) PUT(0, n) PUT(1, t) break; case 0x24: t=T2;n=N2; SET(4, 0) PUT2(0, n) PUT2(2, t) break;
72 case 0x05: /* ROT */ t=T;n=N;l=L; SET(3, 0) PUT(0, l) PUT(1, t) PUT(2, n) break; case 0x25: t=T2;n=N2;l=L2; SET(6, 0) PUT2(0, l) PUT2(2, t) PUT2(4, n) break;
73 case 0x06: /* DUP */ t=T; SET(1, 1) PUT(0, t) PUT(1, t) break; case 0x26: t=T2; SET(2, 2) PUT2(0, t) PUT2(2, t) break;
74 case 0x07: /* OVR */ t=T;n=N; SET(2, 1) PUT(0, n) PUT(1, t) PUT(2, n) break; case 0x27: t=T2;n=N2; SET(4, 2) PUT2(0, n) PUT2(2, t) PUT2(4, n) break;
75 case 0x08: /* EQU */ t=T;n=N; SET(2,-1) PUT(0, n == t) break; case 0x28: t=T2;n=N2; SET(4,-3) PUT(0, n == t) break;
76 case 0x09: /* NEQ */ t=T;n=N; SET(2,-1) PUT(0, n != t) break; case 0x29: t=T2;n=N2; SET(4,-3) PUT(0, n != t) break;
77 case 0x0a: /* GTH */ t=T;n=N; SET(2,-1) PUT(0, n > t) break; case 0x2a: t=T2;n=N2; SET(4,-3) PUT(0, n > t) break;
78 case 0x0b: /* LTH */ t=T;n=N; SET(2,-1) PUT(0, n < t) break; case 0x2b: t=T2;n=N2; SET(4,-3) PUT(0, n < t) break;
79 case 0x0c: /* JMP */ t=T; SET(1,-1) pc += (s8)t; break; case 0x2c: t=T2; SET(2,-2) pc = t; break;
80 case 0x0d: /* JCN */ t=T;n=N; SET(2,-2) pc += !!n * (s8)t; break; case 0x2d: t=T2;n=L; SET(3,-3) if(n) pc = t; break;
81 case 0x0e: /* JSR */ t=T; SET(1,-1) PUSH2(u->rst, pc) pc += (s8)t; break; case 0x2e: t=T2; SET(2,-2) PUSH2(u->rst, pc) pc = t; break;
82 case 0x0f: /* STH */ t=T; SET(1,-1) PUSH((ins & 0x40 ? u->wst : u->rst), t) break; case 0x2f: t=T2; SET(2,-2) PUSH2((ins & 0x40 ? u->wst : u->rst), t) break;
83 case 0x10: /* LDZ */ t=T; SET(1, 0) PUT(0, u->ram[t]) break; case 0x30: t=T; SET(1, 1) PUT2(0, PEEK2(u->ram + t)) break;
84 case 0x11: /* STZ */ t=T;n=N; SET(2,-2) u->ram[t] = n; break; case 0x31: t=T;n=H2; SET(3,-3) POKE2(u->ram + t, n) break;
85 case 0x12: /* LDR */ t=T; SET(1, 0) PUT(0, u->ram[pc + (s8)t]) break; case 0x32: t=T; SET(1, 1) PUT2(0, PEEK2(u->ram + pc + (s8)t)) break;
86 case 0x13: /* STR */ t=T;n=N; SET(2,-2) u->ram[pc + (s8)t] = n; break; case 0x33: t=T;n=H2; SET(3,-3) POKE2(u->ram + pc + (s8)t, n) break;
87 case 0x14: /* LDA */ t=T2; SET(2,-1) PUT(0, u->ram[t]) break; case 0x34: t=T2; SET(2, 0) PUT2(0, PEEK2(u->ram + t)) break;
88 case 0x15: /* STA */ t=T2;n=L; SET(3,-3) u->ram[t] = n; break; case 0x35: t=T2;n=N2; SET(4,-4) POKE2(u->ram + t, n) break;
89 case 0x16: /* DEI */ t=T; SET(1, 0) DEI(0, t) break; case 0x36: t=T; SET(1, 1) DEI(1, t) DEI(0, t + 1) break;
90 case 0x17: /* DEO */ t=T;n=N; SET(2,-2) DEO(t, n) break; case 0x37: t=T;n=N;l=L; SET(3,-3) DEO(t, l) DEO(t + 1, n) break;
91 case 0x18: /* ADD */ t=T;n=N; SET(2,-1) PUT(0, n + t) break; case 0x38: t=T2;n=N2; SET(4,-2) PUT2(0, n + t) break;
92 case 0x19: /* SUB */ t=T;n=N; SET(2,-1) PUT(0, n - t) break; case 0x39: t=T2;n=N2; SET(4,-2) PUT2(0, n - t) break;
93 case 0x1a: /* MUL */ t=T;n=N; SET(2,-1) PUT(0, n * t) break; case 0x3a: t=T2;n=N2; SET(4,-2) PUT2(0, n * t) break;
94 case 0x1b: /* DIV */ t=T;n=N; SET(2,-1) PUT(0, n / t) break; case 0x3b: t=T2;n=N2; SET(4,-2) PUT2(0, n / t) break;
95 case 0x1c: /* AND */ t=T;n=N; SET(2,-1) PUT(0, n & t) break; case 0x3c: t=T2;n=N2; SET(4,-2) PUT2(0, n & t) break;
96 case 0x1d: /* ORA */ t=T;n=N; SET(2,-1) PUT(0, n | t) break; case 0x3d: t=T2;n=N2; SET(4,-2) PUT2(0, n | t) break;
97 case 0x1e: /* EOR */ t=T;n=N; SET(2,-1) PUT(0, n ^ t) break; case 0x3e: t=T2;n=N2; SET(4,-2) PUT2(0, n ^ t) break;
98 case 0x1f: /* SFT */ t=T;n=N; SET(2,-1) PUT(0, n >> (t & 0xf) << (t >> 4)) break; case 0x3f: t=T;n=H2; SET(3,-1) PUT2(0, n >> (t & 0xf) << (t >> 4)) break;
99 }
100 }
101}
102
103int
104uxn_boot(Uxn *u, u8 *ram, Dei *dei, Deo *deo)
105{
106 u32 i;
107 char *cptr = (char *)u;
108 for(i = 0; i < sizeof(*u); i++)
109 cptr[i] = 0x00;
110 u->wst = (Stack *)(ram + 0x10000);
111 u->rst = (Stack *)(ram + 0x10100);
112 u->dev = (u8 *)(ram + 0x10200);
113 u->ram = ram;
114 u->dei = dei;
115 u->deo = deo;
116 return 1;
117}
generated by cgit v1.2.1 (git 2.18.0) at 2024-05-04 16:18:53 +0000