Browse code

(uxn.c) Housekeeping

neauoire authored on 02/11/2023 03:37:46
Showing 1 changed files
... ...
@@ -45,12 +45,12 @@ uxn_eval(Uxn *u, Uint16 pc)
45 45
 		Stack *s = ins & 0x40 ? &u->rst : &u->wst;
46 46
 		switch(ins & 0x1f ? ins & 0x3f : ins) {
47 47
 			/* IMM */
48
-			case 0x00: /* BRK  */                      return 1;
49
-			case 0x20: /* JCI  */ t=T;       SHIFT(-1) if(!t) { pc += 2; break; } /* else fallthrough */
50
-			case 0x40: /* JMI  */                      rr = ram + pc; pc += PEEK2(rr) + 2; break;
51
-			case 0x60: /* JSI  */            SHIFT( 2) T2_(pc + 2); rr = ram + pc; pc += PEEK2(rr) + 2; break;
52
-			case 0x80: /* LIT  */ case 0xc0: SHIFT( 1) T = ram[pc++]; break;
53
-			case 0xa0: /* LIT2 */ case 0xe0: SHIFT( 2) N = ram[pc++]; T = ram[pc++]; break;
48
+			case 0x00: /* BRK  */                           return 1;
49
+			case 0x20: /* JCI  */ t=T;            SHIFT(-1) if(!t) { pc += 2; break; }
50
+			case 0x40: /* JMI  */                           rr = ram + pc; pc += 2 + PEEK2(rr); break;
51
+			case 0x60: /* JSI  */                 SHIFT( 2) rr = ram + pc; pc += 2; T2_(pc); pc += PEEK2(rr); break;
52
+			case 0x80: /* LIT  */ case 0xc0:      SHIFT( 1) T = ram[pc++]; break;
53
+			case 0xa0: /* LIT2 */ case 0xe0:      SHIFT( 2) N = ram[pc++]; T = ram[pc++]; break;
54 54
 			/* ALU */
55 55
 			case 0x01: /* INC  */ t=T;            SET(1, 0) T = t + 1; break;
56 56
 			case 0x21: /* INC2 */ t=T2;           SET(2, 0) T2_(t + 1) break;