about summary refs log tree commit diff stats
path: root/subx/012indirect_addressing.cc
diff options
context:
space:
mode:
authorKartik K. Agaram <vc@akkartik.com>2018-01-24 02:47:49 -0800
committerKartik K. Agaram <vc@akkartik.com>2018-01-24 02:47:49 -0800
commit3ecd66fb7c9aa444a5f195d60f8fc92f0c121fdd (patch)
tree56bfe2530d483ee35f22789cc6038721bb448fdc /subx/012indirect_addressing.cc
parent836d13dbc92c97cf529d6a51972be350e8ee1b2c (diff)
downloadmu-3ecd66fb7c9aa444a5f195d60f8fc92f0c121fdd.tar.gz
4183
Diffstat (limited to 'subx/012indirect_addressing.cc')
-rw-r--r--subx/012indirect_addressing.cc140
1 files changed, 70 insertions, 70 deletions
diff --git a/subx/012indirect_addressing.cc b/subx/012indirect_addressing.cc
index 0acd7a1e..f41bdfef 100644
--- a/subx/012indirect_addressing.cc
+++ b/subx/012indirect_addressing.cc
@@ -5,9 +5,9 @@
 % Reg[0].i = 0x60;
 % SET_WORD_IN_MEM(0x60, 1);
 # op  ModR/M  SIB   displacement  immediate
-  01  18                                     # add EBX (reg 3) to *EAX (reg 0)
-+run: add reg 3 to effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  01  18                                     # add EBX to *EAX
++run: add EBX to effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x00000011
 
 :(before "End Mod Special-cases")
@@ -15,7 +15,7 @@ case 0:
   // mod 0 is usually indirect addressing
   switch (rm) {
   default:
-    trace(2, "run") << "effective address is mem at address 0x" << std::hex << Reg[rm].u << " (reg " << NUM(rm) << ")" << end();
+    trace(2, "run") << "effective address is mem at address 0x" << std::hex << Reg[rm].u << " (" << rname(rm) << ")" << end();
     assert(Reg[rm].u + sizeof(int32_t) <= Mem.size());
     result = reinterpret_cast<int32_t*>(&Mem.at(Reg[rm].u));  // rely on the host itself being in little-endian order
     break;
@@ -30,16 +30,16 @@ case 0:
 % Reg[3].i = 0x10;
 % SET_WORD_IN_MEM(0x60, 1);
 # op  ModR/M  SIB   displacement  immediate
-  03  18                                      # add *EAX (reg 0) to EBX (reg 3)
-+run: add effective address to reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  03  18                                      # add *EAX to EBX
++run: add effective address to EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x00000011
 
 :(before "End Single-Byte Opcodes")
 case 0x03: {  // add r/m32 to r32
   uint8_t modrm = next();
   uint8_t arg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "add effective address to reg " << NUM(arg1) << end();
+  trace(2, "run") << "add effective address to " << rname(arg1) << end();
   const int32_t* arg2 = effective_address(modrm);
   BINARY_ARITHMETIC_OP(+, Reg[arg1].i, *arg2);
   break;
@@ -52,9 +52,9 @@ case 0x03: {  // add r/m32 to r32
 % SET_WORD_IN_MEM(0x60, 10);
 % Reg[3].i = 1;
 # op  ModRM   SIB   displacement  immediate
-  29  18                                      # subtract EBX (reg 3) from *EAX (reg 0)
-+run: subtract reg 3 from effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  29  18                                      # subtract EBX from *EAX
++run: subtract EBX from effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x00000009
 
 //:
@@ -64,16 +64,16 @@ case 0x03: {  // add r/m32 to r32
 % SET_WORD_IN_MEM(0x60, 1);
 % Reg[3].i = 10;
 # op  ModRM   SIB   displacement  immediate
-  2b  18                                      # subtract *EAX (reg 0) from EBX (reg 3)
-+run: subtract effective address from reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  2b  18                                      # subtract *EAX from EBX
++run: subtract effective address from EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x00000009
 
 :(before "End Single-Byte Opcodes")
 case 0x2b: {  // subtract r/m32 from r32
   uint8_t modrm = next();
   uint8_t arg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "subtract effective address from reg " << NUM(arg1) << end();
+  trace(2, "run") << "subtract effective address from " << rname(arg1) << end();
   const int32_t* arg2 = effective_address(modrm);
   BINARY_ARITHMETIC_OP(-, Reg[arg1].i, *arg2);
   break;
@@ -86,9 +86,9 @@ case 0x2b: {  // subtract r/m32 from r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0xff;
 # op  ModRM   SIB   displacement  immediate
-  21  18                                      # and EBX (reg 3) with *EAX (reg 0)
-+run: and reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  21  18                                      # and EBX with *EAX
++run: and EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x0000000d
 
 //:
@@ -98,16 +98,16 @@ case 0x2b: {  // subtract r/m32 from r32
 % SET_WORD_IN_MEM(0x60, 0x000000ff);
 % Reg[3].i = 0x0a0b0c0d;
 # op  ModRM   SIB   displacement  immediate
-  23  18                                      # and *EAX (reg 0) with EBX (reg 3)
-+run: and effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  23  18                                      # and *EAX with EBX
++run: and effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x0000000d
 
 :(before "End Single-Byte Opcodes")
 case 0x23: {  // and r/m32 with r32
   uint8_t modrm = next();
   uint8_t arg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "and effective address with reg " << NUM(arg1) << end();
+  trace(2, "run") << "and effective address with " << rname(arg1) << end();
   const int32_t* arg2 = effective_address(modrm);
   BINARY_BITWISE_OP(&, Reg[arg1].u, *arg2);
   break;
@@ -120,9 +120,9 @@ case 0x23: {  // and r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0xa0b0c0d0;
 # op  ModRM   SIB   displacement  immediate
-  09  18                                      # or EBX (reg 3) with *EAX (reg 0)
-+run: or reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  09  18                                      # or EBX with *EAX
++run: or EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0xaabbccdd
 
 //:
@@ -132,16 +132,16 @@ case 0x23: {  // and r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0xa0b0c0d0;
 # op  ModRM   SIB   displacement  immediate
-  0b  18                                      # or *EAX (reg 0) with EBX (reg 3)
-+run: or effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  0b  18                                      # or *EAX with EBX
++run: or effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0xaabbccdd
 
 :(before "End Single-Byte Opcodes")
 case 0x0b: {  // or r/m32 with r32
   uint8_t modrm = next();
   uint8_t arg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "or effective address with reg " << NUM(arg1) << end();
+  trace(2, "run") << "or effective address with " << rname(arg1) << end();
   const int32_t* arg2 = effective_address(modrm);
   BINARY_BITWISE_OP(|, Reg[arg1].u, *arg2);
   break;
@@ -154,9 +154,9 @@ case 0x0b: {  // or r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0xaabb0c0d);
 % Reg[3].i = 0xa0b0c0d0;
 # op  ModRM   SIB   displacement  immediate
-  31  18                                      # xor EBX (reg 3) with *EAX (reg 0)
-+run: xor reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  31  18                                      # xor EBX with *EAX
++run: xor EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x0a0bccdd
 
 //:
@@ -166,16 +166,16 @@ case 0x0b: {  // or r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0xa0b0c0d0;
 # op  ModRM   SIB   displacement  immediate
-  33  18                                      # xor *EAX (reg 0) with EBX (reg 3)
-+run: xor effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  33  18                                      # xor *EAX with EBX
++run: xor effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0xaabbccdd
 
 :(before "End Single-Byte Opcodes")
 case 0x33: {  // xor r/m32 with r32
   uint8_t modrm = next();
   uint8_t arg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "xor effective address with reg " << NUM(arg1) << end();
+  trace(2, "run") << "xor effective address with " << rname(arg1) << end();
   const int32_t* arg2 = effective_address(modrm);
   BINARY_BITWISE_OP(|, Reg[arg1].u, *arg2);
   break;
@@ -188,9 +188,9 @@ case 0x33: {  // xor r/m32 with r32
 # word at 0x60 is 0x0f0f00ff
 % SET_WORD_IN_MEM(0x60, 0x0f0f00ff);
 # op  ModRM   SIB   displacement  immediate
-  f7  03                                      # negate *EBX (reg 3)
+  f7  03                                      # negate *EBX
 +run: 'not' of effective address
-+run: effective address is mem at address 0x60 (reg 3)
++run: effective address is mem at address 0x60 (EBX)
 +run: storing 0xf0f0ff00
 
 //:: compare (cmp)
@@ -200,9 +200,9 @@ case 0x33: {  // xor r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0x0a0b0c07;
 # op  ModRM   SIB   displacement  immediate
-  39  18                                      # compare EBX (reg 3) with *EAX (reg 0)
-+run: compare reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  39  18                                      # compare EBX with *EAX
++run: compare EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=0; ZF=0; OF=0
 
 :(scenario compare_mem_at_r32_with_r32_lesser)
@@ -210,9 +210,9 @@ case 0x33: {  // xor r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c07);
 % Reg[3].i = 0x0a0b0c0d;
 # op  ModRM   SIB   displacement  immediate
-  39  18                                      # compare EBX (reg 3) with *EAX (reg 0)
-+run: compare reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  39  18                                      # compare EBX with *EAX
++run: compare EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=1; ZF=0; OF=0
 
 :(scenario compare_mem_at_r32_with_r32_equal)
@@ -220,9 +220,9 @@ case 0x33: {  // xor r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0x0a0b0c0d;
 # op  ModRM   SIB   displacement  immediate
-  39  18                                      # compare EBX (reg 3) with *EAX (reg 0)
-+run: compare reg 3 with effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  39  18                                      # compare EBX with *EAX
++run: compare EBX with effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=0; ZF=1; OF=0
 
 //:
@@ -232,16 +232,16 @@ case 0x33: {  // xor r/m32 with r32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c07);
 % Reg[3].i = 0x0a0b0c0d;
 # op  ModRM   SIB   displacement  immediate
-  3b  18                                      # compare *EAX (reg 0) with EBX (reg 3)
-+run: compare effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  3b  18                                      # compare *EAX with EBX
++run: compare effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=0; ZF=0; OF=0
 
 :(before "End Single-Byte Opcodes")
 case 0x3b: {  // set SF if r32 < r/m32
   uint8_t modrm = next();
   uint8_t reg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "compare effective address with reg " << NUM(reg1) << end();
+  trace(2, "run") << "compare effective address with " << rname(reg1) << end();
   int32_t arg1 = Reg[reg1].i;
   int32_t* arg2 = effective_address(modrm);
   int32_t tmp1 = arg1 - *arg2;
@@ -258,9 +258,9 @@ case 0x3b: {  // set SF if r32 < r/m32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0x0a0b0c07;
 # op  ModRM   SIB   displacement  immediate
-  3b  18                                      # compare *EAX (reg 0) with EBX (reg 3)
-+run: compare effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  3b  18                                      # compare *EAX with EBX
++run: compare effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=1; ZF=0; OF=0
 
 :(scenario compare_r32_with_mem_at_r32_equal)
@@ -268,9 +268,9 @@ case 0x3b: {  // set SF if r32 < r/m32
 % SET_WORD_IN_MEM(0x60, 0x0a0b0c0d);
 % Reg[3].i = 0x0a0b0c0d;
 # op  ModRM   SIB   displacement  immediate
-  3b  18                                      # compare *EAX (reg 0) with EBX (reg 3)
-+run: compare effective address with reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  3b  18                                      # compare *EAX with EBX
++run: compare effective address with EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: SF=0; ZF=1; OF=0
 
 //:: copy (mov)
@@ -279,9 +279,9 @@ case 0x3b: {  // set SF if r32 < r/m32
 % Reg[3].i = 0xaf;
 % Reg[0].i = 0x60;
 # op  ModRM   SIB   displacement  immediate
-  89  18                                      # copy EBX (reg 3) to *EAX (reg 0)
-+run: copy reg 3 to effective address
-+run: effective address is mem at address 0x60 (reg 0)
+  89  18                                      # copy EBX to *EAX
++run: copy EBX to effective address
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x000000af
 
 //:
@@ -290,16 +290,16 @@ case 0x3b: {  // set SF if r32 < r/m32
 % Reg[0].i = 0x60;
 % SET_WORD_IN_MEM(0x60, 0x000000af);
 # op  ModRM   SIB   displacement  immediate
-  8b  18                                      # copy *EAX (reg 0) to EBX (reg 3)
-+run: copy effective address to reg 3
-+run: effective address is mem at address 0x60 (reg 0)
+  8b  18                                      # copy *EAX to EBX
++run: copy effective address to EBX
++run: effective address is mem at address 0x60 (EAX)
 +run: storing 0x000000af
 
 :(before "End Single-Byte Opcodes")
 case 0x8b: {  // copy r32 to r/m32
   uint8_t modrm = next();
   uint8_t reg1 = (modrm>>3)&0x7;
-  trace(2, "run") << "copy effective address to reg " << NUM(reg1) << end();
+  trace(2, "run") << "copy effective address to " << rname(reg1) << end();
   int32_t* arg2 = effective_address(modrm);
   Reg[reg1].i = *arg2;
   trace(2, "run") << "storing 0x" << HEXWORD << *arg2 << end();
@@ -312,12 +312,12 @@ case 0x8b: {  // copy r32 to r/m32
 % Reg[0].i = 0x60;
 % SET_WORD_IN_MEM(0x60, 8);
 # op  ModRM   SIB   displacement  immediate
-  ff  20                                      # jump to *EAX (reg 0)
+  ff  20                                      # jump to *EAX
   05                              00 00 00 01
   05                              00 00 00 02
 +run: inst: 0x00000001
 +run: jump to effective address
-+run: effective address is mem at address 0x60 (reg 0)
++run: effective address is mem at address 0x60 (EAX)
 +run: jumping to 0x00000008
 +run: inst: 0x00000008
 -run: inst: 0x00000003
@@ -346,9 +346,9 @@ case 0xff: {
 % SET_WORD_IN_MEM(0x60, 0x000000af);
 % Reg[ESP].u = 0x14;
 # op  ModRM   SIB   displacement  immediate
-  ff  30                                      # push *EAX (reg 0) to stack
+  ff  30                                      # push *EAX to stack
 +run: push effective address
-+run: effective address is mem at address 0x60 (reg 0)
++run: effective address is mem at address 0x60 (EAX)
 +run: decrementing ESP to 0x00000010
 +run: pushing value 0x000000af
 
@@ -367,9 +367,9 @@ case 6: {  // push r/m32 to stack
 % Reg[ESP].u = 0x10;
 % SET_WORD_IN_MEM(0x10, 0x00000030);
 # op  ModRM   SIB   displacement  immediate
-  8f  00                                      # pop stack into *EAX (reg 0)
+  8f  00                                      # pop stack into *EAX
 +run: pop into effective address
-+run: effective address is mem at address 0x60 (reg 0)
++run: effective address is mem at address 0x60 (EAX)
 +run: popping value 0x00000030
 +run: incrementing ESP to 0x00000014