|
@@ -26,8 +26,9 @@ unit aasmcpu;
|
|
interface
|
|
interface
|
|
|
|
|
|
uses
|
|
uses
|
|
- cclasses,aasmtai,
|
|
|
|
- aasmbase,globtype,globals,verbose,
|
|
|
|
|
|
+ cclasses,globtype,globals,verbose,
|
|
|
|
+ aasmbase,aasmtai,
|
|
|
|
+ symtype,
|
|
cpubase,cpuinfo,cgbase,cgutils;
|
|
cpubase,cpuinfo,cgbase,cgutils;
|
|
|
|
|
|
const
|
|
const
|
|
@@ -36,7 +37,25 @@ uses
|
|
{ "mov reg,reg" source operand number }
|
|
{ "mov reg,reg" source operand number }
|
|
O_MOV_DEST = 0;
|
|
O_MOV_DEST = 0;
|
|
|
|
|
|
|
|
+ maxinfolen = 5;
|
|
|
|
+
|
|
|
|
+ IF_NONE = $00000000;
|
|
|
|
+
|
|
|
|
+ IF_ARMMASK = $000F0000;
|
|
|
|
+ { if the instruction can change in a second pass }
|
|
|
|
+ IF_PASS2 = longint($80000000);
|
|
|
|
+
|
|
type
|
|
type
|
|
|
|
+ tinsentry = record
|
|
|
|
+ opcode : tasmop;
|
|
|
|
+ ops : byte;
|
|
|
|
+ optypes : array[0..2] of longint;
|
|
|
|
+ code : array[0..maxinfolen] of char;
|
|
|
|
+ flags : longint;
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+ pinsentry=^tinsentry;
|
|
|
|
+
|
|
taicpu = class(tai_cpu_abstract)
|
|
taicpu = class(tai_cpu_abstract)
|
|
oppostfix : TOpPostfix;
|
|
oppostfix : TOpPostfix;
|
|
roundingmode : troundingmode;
|
|
roundingmode : troundingmode;
|
|
@@ -75,7 +94,36 @@ uses
|
|
function is_same_reg_move(regtype: Tregistertype):boolean; override;
|
|
function is_same_reg_move(regtype: Tregistertype):boolean; override;
|
|
|
|
|
|
function spilling_get_operation_type(opnr: longint): topertype;override;
|
|
function spilling_get_operation_type(opnr: longint): topertype;override;
|
|
|
|
+
|
|
|
|
+ { assembler }
|
|
|
|
+ public
|
|
|
|
+ { the next will reset all instructions that can change in pass 2 }
|
|
|
|
+ procedure ResetPass1;
|
|
|
|
+ procedure ResetPass2;
|
|
|
|
+ function CheckIfValid:boolean;
|
|
|
|
+ function Pass1(offset:longint):longint;virtual;
|
|
|
|
+ procedure Pass2(objdata:TAsmObjectdata);virtual;
|
|
|
|
+ protected
|
|
|
|
+ procedure ppuloadoper(ppufile:tcompilerppufile;var o:toper);override;
|
|
|
|
+ procedure ppuwriteoper(ppufile:tcompilerppufile;const o:toper);override;
|
|
|
|
+ procedure ppubuildderefimploper(var o:toper);override;
|
|
|
|
+ procedure ppuderefoper(var o:toper);override;
|
|
|
|
+ private
|
|
|
|
+ { next fields are filled in pass1, so pass2 is faster }
|
|
|
|
+ inssize : shortint;
|
|
|
|
+ insoffset : longint;
|
|
|
|
+ LastInsOffset : longint; { need to be public to be reset }
|
|
|
|
+ insentry : PInsEntry;
|
|
|
|
+ function InsEnd:longint;
|
|
|
|
+ procedure create_ot;
|
|
|
|
+ function Matches(p:PInsEntry):longint;
|
|
|
|
+ function calcsize(p:PInsEntry):shortint;
|
|
|
|
+ procedure gencode(objdata:TAsmObjectData);
|
|
|
|
+ function NeedAddrPrefix(opidx:byte):boolean;
|
|
|
|
+ procedure Swapoperands;
|
|
|
|
+ function FindInsentry:boolean;
|
|
end;
|
|
end;
|
|
|
|
+
|
|
tai_align = class(tai_align_abstract)
|
|
tai_align = class(tai_align_abstract)
|
|
{ nothing to add }
|
|
{ nothing to add }
|
|
end;
|
|
end;
|
|
@@ -514,4 +562,1044 @@ implementation
|
|
curdata.free;
|
|
curdata.free;
|
|
end;
|
|
end;
|
|
|
|
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ResetPass1;
|
|
|
|
+ begin
|
|
|
|
+ { we need to reset everything here, because the choosen insentry
|
|
|
|
+ can be invalid for a new situation where the previously optimized
|
|
|
|
+ insentry is not correct }
|
|
|
|
+ InsEntry:=nil;
|
|
|
|
+ InsSize:=0;
|
|
|
|
+ LastInsOffset:=-1;
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ResetPass2;
|
|
|
|
+ begin
|
|
|
|
+ { we are here in a second pass, check if the instruction can be optimized }
|
|
|
|
+ if assigned(InsEntry) and
|
|
|
|
+ ((InsEntry^.flags and IF_PASS2)<>0) then
|
|
|
|
+ begin
|
|
|
|
+ InsEntry:=nil;
|
|
|
|
+ InsSize:=0;
|
|
|
|
+ end;
|
|
|
|
+ LastInsOffset:=-1;
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.CheckIfValid:boolean;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.Pass1(offset:longint):longint;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.Pass2(objdata:TAsmObjectdata);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ppuloadoper(ppufile:tcompilerppufile;var o:toper);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ppuwriteoper(ppufile:tcompilerppufile;const o:toper);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ppubuildderefimploper(var o:toper);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.ppuderefoper(var o:toper);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.InsEnd:longint;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.create_ot;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.Matches(p:PInsEntry):longint;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.calcsize(p:PInsEntry):shortint;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.gencode(objdata:TAsmObjectData);
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.NeedAddrPrefix(opidx:byte):boolean;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ procedure taicpu.Swapoperands;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ function taicpu.FindInsentry:boolean;
|
|
|
|
+ begin
|
|
|
|
+ end;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+
|
|
end.
|
|
end.
|
|
|
|
+
|
|
|
|
+{$ifdef dummy}
|
|
|
|
+ (*
|
|
|
|
+static void gencode (long segment, long offset, int bits,
|
|
|
|
+ insn *ins, char *codes, long insn_end)
|
|
|
|
+{
|
|
|
|
+ int has_S_code; /* S - setflag */
|
|
|
|
+ int has_B_code; /* B - setflag */
|
|
|
|
+ int has_T_code; /* T - setflag */
|
|
|
|
+ int has_W_code; /* ! => W flag */
|
|
|
|
+ int has_F_code; /* ^ => S flag */
|
|
|
|
+ int keep;
|
|
|
|
+ unsigned char c;
|
|
|
|
+ unsigned char bytes[4];
|
|
|
|
+ long data, size;
|
|
|
|
+ static int cc_code[] = /* bit pattern of cc */
|
|
|
|
+ { /* order as enum in */
|
|
|
|
+ 0x0E, 0x03, 0x02, 0x00, /* nasm.h */
|
|
|
|
+ 0x0A, 0x0C, 0x08, 0x0D,
|
|
|
|
+ 0x09, 0x0B, 0x04, 0x01,
|
|
|
|
+ 0x05, 0x07, 0x06,
|
|
|
|
+ };
|
|
|
|
+
|
|
|
|
+(*
|
|
|
|
+#ifdef DEBUG
|
|
|
|
+static char *CC[] =
|
|
|
|
+ { /* condition code names */
|
|
|
|
+ "AL", "CC", "CS", "EQ",
|
|
|
|
+ "GE", "GT", "HI", "LE",
|
|
|
|
+ "LS", "LT", "MI", "NE",
|
|
|
|
+ "PL", "VC", "VS", "",
|
|
|
|
+ "S"
|
|
|
|
+};
|
|
|
|
+*)
|
|
|
|
+
|
|
|
|
+ has_S_code = (ins->condition & C_SSETFLAG);
|
|
|
|
+ has_B_code = (ins->condition & C_BSETFLAG);
|
|
|
|
+ has_T_code = (ins->condition & C_TSETFLAG);
|
|
|
|
+ has_W_code = (ins->condition & C_EXSETFLAG);
|
|
|
|
+ has_F_code = (ins->condition & C_FSETFLAG);
|
|
|
|
+ ins->condition = (ins->condition & 0x0F);
|
|
|
|
+
|
|
|
|
+(*
|
|
|
|
+ if (rt_debug)
|
|
|
|
+ {
|
|
|
|
+ printf ("gencode: instruction: %s%s", insn_names[ins->opcode],
|
|
|
|
+ CC[ins->condition & 0x0F]);
|
|
|
|
+ if (has_S_code)
|
|
|
|
+ printf ("S");
|
|
|
|
+ if (has_B_code)
|
|
|
|
+ printf ("B");
|
|
|
|
+ if (has_T_code)
|
|
|
|
+ printf ("T");
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ printf ("!");
|
|
|
|
+ if (has_F_code)
|
|
|
|
+ printf ("^");
|
|
|
|
+
|
|
|
|
+ printf ("\n");
|
|
|
|
+
|
|
|
|
+ c = *codes;
|
|
|
|
+
|
|
|
|
+ printf (" (%d) decode - '0x%02X'\n", ins->operands, c);
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ bytes[0] = 0xB;
|
|
|
|
+ bytes[1] = 0xE;
|
|
|
|
+ bytes[2] = 0xE;
|
|
|
|
+ bytes[3] = 0xF;
|
|
|
|
+ }
|
|
|
|
+*)
|
|
|
|
+ // First condition code in upper nibble
|
|
|
|
+ if (ins->condition < C_NONE)
|
|
|
|
+ {
|
|
|
|
+ c = cc_code[ins->condition] << 4;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ c = cc_code[C_AL] << 4; // is often ALWAYS but not always
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ switch (keep = *codes)
|
|
|
|
+ {
|
|
|
|
+ case 1:
|
|
|
|
+ // B, BL
|
|
|
|
+ ++codes;
|
|
|
|
+ c |= *codes++;
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+
|
|
|
|
+ if (ins->oprs[0].segment != segment)
|
|
|
|
+ {
|
|
|
|
+ // fais une relocation
|
|
|
|
+ c = 1;
|
|
|
|
+ data = 0; // Let the linker locate ??
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ c = 0;
|
|
|
|
+ data = ins->oprs[0].offset - (offset + 8);
|
|
|
|
+
|
|
|
|
+ if (data % 4)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "offset not aligned on 4 bytes");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x1000)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ data = data >> 2;
|
|
|
|
+ bytes[1] = (data >> 16) & 0xFF;
|
|
|
|
+ bytes[2] = (data >> 8) & 0xFF;
|
|
|
|
+ bytes[3] = (data ) & 0xFF;
|
|
|
|
+
|
|
|
|
+ if (c == 1)
|
|
|
|
+ {
|
|
|
|
+// out (offset, segment, &bytes[0], OUT_RAWDATA+1, NO_SEG, NO_SEG);
|
|
|
|
+ out (offset, segment, &bytes[0], OUT_REL3ADR+4, ins->oprs[0].segment, NO_SEG);
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ out (offset, segment, &bytes[0], OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ }
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+ case 2:
|
|
|
|
+ // SWI
|
|
|
|
+ ++codes;
|
|
|
|
+ c |= *codes++;
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+ data = ins->oprs[0].offset;
|
|
|
|
+ bytes[1] = (data >> 16) & 0xFF;
|
|
|
|
+ bytes[2] = (data >> 8) & 0xFF;
|
|
|
|
+ bytes[3] = (data) & 0xFF;
|
|
|
|
+ out (offset, segment, &bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ return;
|
|
|
|
+ case 3:
|
|
|
|
+ // BX
|
|
|
|
+ ++codes;
|
|
|
|
+ c |= *codes++;
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+ bytes[2] = *codes++;
|
|
|
|
+ bytes[3] = *codes++;
|
|
|
|
+ c = regval (&ins->oprs[0],1);
|
|
|
|
+ if (c == 15) // PC
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_WARNING, "'BX' with R15 has undefined behaviour");
|
|
|
|
+ }
|
|
|
|
+ else if (c > 15)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "Illegal register specified for 'BX'");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[3] |= (c & 0x0F);
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+ case 4: // AND Rd,Rn,Rm
|
|
|
|
+ case 5: // AND Rd,Rn,Rm,<shift>Rs
|
|
|
|
+ case 6: // AND Rd,Rn,Rm,<shift>imm
|
|
|
|
+ case 7: // AND Rd,Rn,<shift>imm
|
|
|
|
+ ++codes;
|
|
|
|
+#ifdef DEBUG
|
|
|
|
+ if (rt_debug)
|
|
|
|
+ {
|
|
|
|
+ printf (" decode - '0x%02X'\n", keep);
|
|
|
|
+ printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
|
|
|
|
+ }
|
|
|
|
+#endif
|
|
|
|
+ bytes[0] = c | *codes;
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes;
|
|
|
|
+ if (has_S_code)
|
|
|
|
+ bytes[1] |= 0x10;
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+ // Rn in low nibble
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ // Rd in high nibble
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+
|
|
|
|
+ if (keep != 7)
|
|
|
|
+ {
|
|
|
|
+ // Rm in low nibble
|
|
|
|
+ bytes[3] = regval (&ins->oprs[2],1);
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Shifts if any
|
|
|
|
+ if (keep == 5 || keep == 6)
|
|
|
|
+ {
|
|
|
|
+ // Shift in bytes 2 and 3
|
|
|
|
+ if (keep == 5)
|
|
|
|
+ {
|
|
|
|
+ // Rs
|
|
|
|
+ c = regval (&ins->oprs[3],1);
|
|
|
|
+ bytes[2] |= c;
|
|
|
|
+
|
|
|
|
+ c = 0x10; // Set bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ if (keep == 6)
|
|
|
|
+ {
|
|
|
|
+ c = (ins->oprs[3].offset) & 0x1F;
|
|
|
|
+
|
|
|
|
+ // #imm
|
|
|
|
+ bytes[2] |= c >> 1;
|
|
|
|
+ if (c & 0x01)
|
|
|
|
+ {
|
|
|
|
+ bytes[3] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ c = 0; // Clr bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ // <shift>
|
|
|
|
+ c |= shiftval (&ins->oprs[3]) << 5;
|
|
|
|
+
|
|
|
|
+ bytes[3] |= c;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // reg,reg,imm
|
|
|
|
+ if (keep == 7)
|
|
|
|
+ {
|
|
|
|
+ int shimm;
|
|
|
|
+
|
|
|
|
+ shimm = imm_shift (ins->oprs[2].offset);
|
|
|
|
+
|
|
|
|
+ if (shimm == -1)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "cannot create that constant");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = shimm & 0xFF;
|
|
|
|
+ bytes[2] |= (shimm & 0xF00) >> 8;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+ case 8: // MOV Rd,Rm
|
|
|
|
+ case 9: // MOV Rd,Rm,<shift>Rs
|
|
|
|
+ case 0xA: // MOV Rd,Rm,<shift>imm
|
|
|
|
+ case 0xB: // MOV Rd,<shift>imm
|
|
|
|
+ ++codes;
|
|
|
|
+#ifdef DEBUG
|
|
|
|
+ if (rt_debug)
|
|
|
|
+ {
|
|
|
|
+ printf (" decode - '0x%02X'\n", keep);
|
|
|
|
+ printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
|
|
|
|
+ }
|
|
|
|
+#endif
|
|
|
|
+ bytes[0] = c | *codes;
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes;
|
|
|
|
+ if (has_S_code)
|
|
|
|
+ bytes[1] |= 0x10;
|
|
|
|
+
|
|
|
|
+ // Rd in high nibble
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+
|
|
|
|
+ if (keep != 0x0B)
|
|
|
|
+ {
|
|
|
|
+ // Rm in low nibble
|
|
|
|
+ bytes[3] = regval (&ins->oprs[1],1);
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Shifts if any
|
|
|
|
+ if (keep == 0x09 || keep == 0x0A)
|
|
|
|
+ {
|
|
|
|
+ // Shift in bytes 2 and 3
|
|
|
|
+ if (keep == 0x09)
|
|
|
|
+ {
|
|
|
|
+ // Rs
|
|
|
|
+ c = regval (&ins->oprs[2],1);
|
|
|
|
+ bytes[2] |= c;
|
|
|
|
+
|
|
|
|
+ c = 0x10; // Set bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ if (keep == 0x0A)
|
|
|
|
+ {
|
|
|
|
+ c = (ins->oprs[2].offset) & 0x1F;
|
|
|
|
+
|
|
|
|
+ // #imm
|
|
|
|
+ bytes[2] |= c >> 1;
|
|
|
|
+ if (c & 0x01)
|
|
|
|
+ {
|
|
|
|
+ bytes[3] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ c = 0; // Clr bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ // <shift>
|
|
|
|
+ c |= shiftval (&ins->oprs[2]) << 5;
|
|
|
|
+
|
|
|
|
+ bytes[3] |= c;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // reg,imm
|
|
|
|
+ if (keep == 0x0B)
|
|
|
|
+ {
|
|
|
|
+ int shimm;
|
|
|
|
+
|
|
|
|
+ shimm = imm_shift (ins->oprs[1].offset);
|
|
|
|
+
|
|
|
|
+ if (shimm == -1)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "cannot create that constant");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = shimm & 0xFF;
|
|
|
|
+ bytes[2] |= (shimm & 0xF00) >> 8;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ case 0xC: // CMP Rn,Rm
|
|
|
|
+ case 0xD: // CMP Rn,Rm,<shift>Rs
|
|
|
|
+ case 0xE: // CMP Rn,Rm,<shift>imm
|
|
|
|
+ case 0xF: // CMP Rn,<shift>imm
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes;
|
|
|
|
+
|
|
|
|
+ // Implicit S code
|
|
|
|
+ bytes[1] |= 0x10;
|
|
|
|
+
|
|
|
|
+ c = regval (&ins->oprs[0],1);
|
|
|
|
+ // Rn in low nibble
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ // No destination
|
|
|
|
+ bytes[2] = 0;
|
|
|
|
+
|
|
|
|
+ if (keep != 0x0B)
|
|
|
|
+ {
|
|
|
|
+ // Rm in low nibble
|
|
|
|
+ bytes[3] = regval (&ins->oprs[1],1);
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Shifts if any
|
|
|
|
+ if (keep == 0x0D || keep == 0x0E)
|
|
|
|
+ {
|
|
|
|
+ // Shift in bytes 2 and 3
|
|
|
|
+ if (keep == 0x0D)
|
|
|
|
+ {
|
|
|
|
+ // Rs
|
|
|
|
+ c = regval (&ins->oprs[2],1);
|
|
|
|
+ bytes[2] |= c;
|
|
|
|
+
|
|
|
|
+ c = 0x10; // Set bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ if (keep == 0x0E)
|
|
|
|
+ {
|
|
|
|
+ c = (ins->oprs[2].offset) & 0x1F;
|
|
|
|
+
|
|
|
|
+ // #imm
|
|
|
|
+ bytes[2] |= c >> 1;
|
|
|
|
+ if (c & 0x01)
|
|
|
|
+ {
|
|
|
|
+ bytes[3] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ c = 0; // Clr bit 4 in byte[3]
|
|
|
|
+ }
|
|
|
|
+ // <shift>
|
|
|
|
+ c |= shiftval (&ins->oprs[2]) << 5;
|
|
|
|
+
|
|
|
|
+ bytes[3] |= c;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // reg,imm
|
|
|
|
+ if (keep == 0x0F)
|
|
|
|
+ {
|
|
|
|
+ int shimm;
|
|
|
|
+
|
|
|
|
+ shimm = imm_shift (ins->oprs[1].offset);
|
|
|
|
+
|
|
|
|
+ if (shimm == -1)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "cannot create that constant");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = shimm & 0xFF;
|
|
|
|
+ bytes[2] |= (shimm & 0xF00) >> 8;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+ case 0x10: // MRS Rd,<psr>
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ c = regval (&ins->oprs[0],1);
|
|
|
|
+
|
|
|
|
+ bytes[2] = c << 4;
|
|
|
|
+
|
|
|
|
+ bytes[3] = 0;
|
|
|
|
+
|
|
|
|
+ c = ins->oprs[1].basereg;
|
|
|
|
+
|
|
|
|
+ if (c == R_CPSR || c == R_SPSR)
|
|
|
|
+ {
|
|
|
|
+ if (c == R_SPSR)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+
|
|
|
|
+ return;
|
|
|
|
+
|
|
|
|
+ case 0x11: // MSR <psr>,Rm
|
|
|
|
+ case 0x12: // MSR <psrf>,Rm
|
|
|
|
+ case 0x13: // MSR <psrf>,#expression
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[2] = *codes;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ if (keep == 0x11 || keep == 0x12)
|
|
|
|
+ {
|
|
|
|
+ // Rm
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+
|
|
|
|
+ bytes[3] = c;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ int shimm;
|
|
|
|
+
|
|
|
|
+ shimm = imm_shift (ins->oprs[1].offset);
|
|
|
|
+
|
|
|
|
+ if (shimm == -1)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "cannot create that constant");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = shimm & 0xFF;
|
|
|
|
+ bytes[2] |= (shimm & 0xF00) >> 8;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ c = ins->oprs[0].basereg;
|
|
|
|
+
|
|
|
|
+ if ( keep == 0x11)
|
|
|
|
+ {
|
|
|
|
+ if ( c == R_CPSR || c == R_SPSR)
|
|
|
|
+ {
|
|
|
|
+ if ( c== R_SPSR)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ if ( c == R_CPSR_FLG || c == R_SPSR_FLG)
|
|
|
|
+ {
|
|
|
|
+ if ( c== R_SPSR_FLG)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "CPSR_flg or SPSR_flg expected");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x14: // MUL Rd,Rm,Rs
|
|
|
|
+ case 0x15: // MULA Rd,Rm,Rs,Rn
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[3] = *codes;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[1] |= regval (&ins->oprs[0],1);
|
|
|
|
+ if (has_S_code)
|
|
|
|
+ bytes[1] |= 0x10;
|
|
|
|
+
|
|
|
|
+ // Rm
|
|
|
|
+ bytes[3] |= regval (&ins->oprs[1],1);
|
|
|
|
+
|
|
|
|
+ // Rs
|
|
|
|
+ bytes[2] = regval (&ins->oprs[2],1);
|
|
|
|
+
|
|
|
|
+ if (keep == 0x15)
|
|
|
|
+ {
|
|
|
|
+ bytes[2] |= regval (&ins->oprs[3],1) << 4;
|
|
|
|
+ }
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x16: // SMLAL RdHi,RdLo,Rm,Rs
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[3] = *codes;
|
|
|
|
+
|
|
|
|
+ // RdHi
|
|
|
|
+ bytes[1] |= regval (&ins->oprs[1],1);
|
|
|
|
+ if (has_S_code)
|
|
|
|
+ bytes[1] |= 0x10;
|
|
|
|
+
|
|
|
|
+ // RdLo
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+ // Rm
|
|
|
|
+ bytes[3] |= regval (&ins->oprs[2],1);
|
|
|
|
+
|
|
|
|
+ // Rs
|
|
|
|
+ bytes[2] |= regval (&ins->oprs[3],1);
|
|
|
|
+
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x17: // LDR Rd, expression
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+ if (has_B_code)
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ if (has_T_code)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
|
|
|
|
+ }
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "'!' not allowed");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Rn - implicit R15
|
|
|
|
+ bytes[1] |= 0xF;
|
|
|
|
+
|
|
|
|
+ if (ins->oprs[1].segment != segment)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "label not in same segment");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ data = ins->oprs[1].offset - (offset + 8);
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x1000)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF00) >> 8);
|
|
|
|
+ bytes[3] = data & 0xFF;
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x18: // LDR Rd, [Rn]
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+ if (has_B_code)
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ if (has_T_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20; // write-back
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[0] |= 0x01; // implicit pre-index mode
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20; // write-back
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Rn
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ if (c == 0x15) // R15
|
|
|
|
+ data = -8;
|
|
|
|
+ else
|
|
|
|
+ data = 0;
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF00) >> 8);
|
|
|
|
+ bytes[3] = data & 0xFF;
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x19: // LDR Rd, [Rn,#expression]
|
|
|
|
+ case 0x20: // LDR Rd, [Rn,Rm]
|
|
|
|
+ case 0x21: // LDR Rd, [Rn,Rm,shift]
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+ if (has_B_code)
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+
|
|
|
|
+ // Rn
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
|
|
|
|
+ {
|
|
|
|
+ bytes[0] |= 0x01; // pre-index mode
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20;
|
|
|
|
+ }
|
|
|
|
+ if (has_T_code)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ if (has_T_code) // Forced write-back in post-index mode
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20;
|
|
|
|
+ }
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (keep == 0x19)
|
|
|
|
+ {
|
|
|
|
+ data = ins->oprs[2].offset;
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x1000)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF00) >> 8);
|
|
|
|
+ bytes[3] = data & 0xFF;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ if (ins->oprs[2].minus == 0)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ c = regval (&ins->oprs[2],1);
|
|
|
|
+ bytes[3] = c;
|
|
|
|
+
|
|
|
|
+ if (keep == 0x21)
|
|
|
|
+ {
|
|
|
|
+ c = ins->oprs[3].offset;
|
|
|
|
+ if (c > 0x1F)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too large shiftvalue");
|
|
|
|
+ c = c & 0x1F;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[2] |= c >> 1;
|
|
|
|
+ if (c & 0x01)
|
|
|
|
+ {
|
|
|
|
+ bytes[3] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ bytes[3] |= shiftval (&ins->oprs[3]) << 5;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x22: // LDRH Rd, expression
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | 0x01; // Implicit pre-index
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+
|
|
|
|
+ // Rn - implicit R15
|
|
|
|
+ bytes[1] |= 0xF;
|
|
|
|
+
|
|
|
|
+ if (ins->oprs[1].segment != segment)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "label not in same segment");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ data = ins->oprs[1].offset - (offset + 8);
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x100)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF0) >> 4);
|
|
|
|
+ bytes[3] |= data & 0xF;
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x23: // LDRH Rd, Rn
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c | 0x01; // Implicit pre-index
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+
|
|
|
|
+ // Rn
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ if (c == 0x15) // R15
|
|
|
|
+ data = -8;
|
|
|
|
+ else
|
|
|
|
+ data = 0;
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x100)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+ bytes[3] = *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF0) >> 4);
|
|
|
|
+ bytes[3] |= data & 0xF;
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x24: // LDRH Rd, Rn, expression
|
|
|
|
+ case 0x25: // LDRH Rd, Rn, Rm
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+
|
|
|
|
+ bytes[1] = *codes++;
|
|
|
|
+
|
|
|
|
+ // Rd
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+
|
|
|
|
+ // Rn
|
|
|
|
+ c = regval (&ins->oprs[1],1);
|
|
|
|
+ bytes[1] |= c;
|
|
|
|
+
|
|
|
|
+ if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
|
|
|
|
+ {
|
|
|
|
+ bytes[0] |= 0x01; // pre-index mode
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[3] = *codes++;
|
|
|
|
+
|
|
|
|
+ if (keep == 0x24)
|
|
|
|
+ {
|
|
|
|
+ data = ins->oprs[2].offset;
|
|
|
|
+
|
|
|
|
+ if (data < 0)
|
|
|
|
+ {
|
|
|
|
+ data = -data;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if (data >= 0x100)
|
|
|
|
+ {
|
|
|
|
+ errfunc (ERR_NONFATAL, "too long offset");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ bytes[2] |= ((data & 0xF0) >> 4);
|
|
|
|
+ bytes[3] |= data & 0xF;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ {
|
|
|
|
+ if (ins->oprs[2].minus == 0)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x80;
|
|
|
|
+ }
|
|
|
|
+ c = regval (&ins->oprs[2],1);
|
|
|
|
+ bytes[3] |= c;
|
|
|
|
+
|
|
|
|
+ }
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x26: // LDM/STM Rn, {reg-list}
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+
|
|
|
|
+ bytes[0] |= ( *codes >> 4) & 0xF;
|
|
|
|
+ bytes[1] = ( *codes << 4) & 0xF0;
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ if (has_W_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x20;
|
|
|
|
+ }
|
|
|
|
+ if (has_F_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Rn
|
|
|
|
+ bytes[1] |= regval (&ins->oprs[0],1);
|
|
|
|
+
|
|
|
|
+ data = ins->oprs[1].basereg;
|
|
|
|
+
|
|
|
|
+ bytes[2] = ((data >> 8) & 0xFF);
|
|
|
|
+ bytes[3] = (data & 0xFF);
|
|
|
|
+
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ case 0x27: // SWP Rd, Rm, [Rn]
|
|
|
|
+ ++codes;
|
|
|
|
+
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+
|
|
|
|
+ bytes[0] |= *codes++;
|
|
|
|
+
|
|
|
|
+ bytes[1] = regval (&ins->oprs[2],1);
|
|
|
|
+ if (has_B_code)
|
|
|
|
+ {
|
|
|
|
+ bytes[1] |= 0x40;
|
|
|
|
+ }
|
|
|
|
+ bytes[2] = regval (&ins->oprs[0],1) << 4;
|
|
|
|
+ bytes[3] = *codes++;
|
|
|
|
+ bytes[3] |= regval (&ins->oprs[1],1);
|
|
|
|
+ break;
|
|
|
|
+
|
|
|
|
+ default:
|
|
|
|
+ errfunc (ERR_FATAL, "unknown decoding of instruction");
|
|
|
|
+
|
|
|
|
+ bytes[0] = c;
|
|
|
|
+ // And a fix nibble
|
|
|
|
+ ++codes;
|
|
|
|
+ bytes[0] |= *codes++;
|
|
|
|
+
|
|
|
|
+ if ( *codes == 0x01) // An I bit
|
|
|
|
+ {
|
|
|
|
+
|
|
|
|
+ }
|
|
|
|
+ if ( *codes == 0x02) // An I bit
|
|
|
|
+ {
|
|
|
|
+
|
|
|
|
+ }
|
|
|
|
+ ++codes;
|
|
|
|
+ }
|
|
|
|
+ out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+*)
|
|
|
|
+{$endif dummy
|
|
|
|
+}
|