Make {add to,subtract from} minus one; Make -t alu work better
This commit is contained in:
parent
854efa68e8
commit
4ffd6ed0f3
|
@ -1,3 +1,19 @@
|
|||
Tue Jan 16 09:50:53 1996 Michael Meissner <meissner@tiktok.cygnus.com>
|
||||
|
||||
* idecode_expression.h (ALU_END): Add ITRACE of the result.
|
||||
|
||||
* ppc-instructions (Equivalent): Enable this instruction.
|
||||
(Add to Minus One Extended): Ditto.
|
||||
(Subtract from Minus One Extended): Ditto.
|
||||
(Add/And/Or/Xor Immediate): Add alu trace of result.
|
||||
(Add/And/Or/Xor Shifted Immediate): Ditto.
|
||||
(And/Or/Equivalent/Nand/Nor): Ditto.
|
||||
(And/Or with Complement): Ditto.
|
||||
(Extend Sign Byte/Half Word): Ditto.
|
||||
(Count Leading Zeros): Ditto.
|
||||
(Shift Right Algerbraic Word): Ditto.
|
||||
(Shift Right Algerbraic Word Immediate): Ditto.
|
||||
|
||||
Tue Jan 9 15:10:27 1996 Andrew Cagney <cagney@highland.com.au>
|
||||
|
||||
* emul_bugapi.c (emul_bugapi_instruction_call) : Make format type
|
||||
|
|
|
@ -0,0 +1,399 @@
|
|||
/* This file is part of the program psim.
|
||||
|
||||
Copyright (C) 1994-1995, Andrew Cagney <cagney@highland.com.au>
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
|
||||
*/
|
||||
|
||||
|
||||
/* 32bit target expressions:
|
||||
|
||||
Each calculation is performed three times using each of the
|
||||
signed64, unsigned64 and long integer types. The macro ALU_END
|
||||
(in _ALU_RESULT_VAL) then selects which of the three alternative
|
||||
results will be used in the final assignment of the target
|
||||
register. As this selection is determined at compile time by
|
||||
fields in the instruction (OE, EA, Rc) the compiler has sufficient
|
||||
information to firstly simplify the selection code into a single
|
||||
case and then back anotate the equations and hence eliminate any
|
||||
resulting dead code. That dead code being the calculations that,
|
||||
as it turned out were not in the end needed.
|
||||
|
||||
64bit arrithemetic is used firstly because it allows the use of
|
||||
gcc's efficient long long operators (typically efficiently output
|
||||
inline) and secondly because the resultant answer will contain in
|
||||
the low 32bits the answer while in the high 32bits is either carry
|
||||
or status information. */
|
||||
|
||||
/* 64bit target expressions:
|
||||
|
||||
Unfortunatly 128bit arrithemetic isn't that common. Consequently
|
||||
the 32/64 bit trick can not be used. Instead all calculations are
|
||||
required to retain carry/overflow information in separate
|
||||
variables. Even with this restriction it is still possible for the
|
||||
trick of letting the compiler discard the calculation of unneeded
|
||||
values */
|
||||
|
||||
|
||||
/* Macro's to type cast 32bit constants to 64bits */
|
||||
#define SIGNED64(val) ((signed64)(signed32)(val))
|
||||
#define UNSIGNED64(val) ((unsigned64)(unsigned32)(val))
|
||||
|
||||
|
||||
/* Start a section of ALU code */
|
||||
|
||||
#define ALU_BEGIN(val) \
|
||||
{ \
|
||||
natural_word alu_val; \
|
||||
unsigned64 alu_carry_val; \
|
||||
signed64 alu_overflow_val; \
|
||||
ALU_SET(val)
|
||||
|
||||
|
||||
/* assign the result to the target register */
|
||||
|
||||
#define ALU_END(TARG,CA,OE,Rc) \
|
||||
{ /* select the result to use */ \
|
||||
signed_word const alu_result = _ALU_RESULT_VAL(CA,OE,Rc); \
|
||||
/* determine the overflow bit if needed */ \
|
||||
if (OE) { \
|
||||
if ((((unsigned64)(alu_overflow_val & BIT64(0))) \
|
||||
>> 32) \
|
||||
== (alu_overflow_val & BIT32(0))) \
|
||||
XER &= (~xer_overflow); \
|
||||
else \
|
||||
XER |= (xer_summary_overflow | xer_overflow); \
|
||||
} \
|
||||
/* Update the carry bit if needed */ \
|
||||
if (CA) { \
|
||||
XER = ((XER & ~xer_carry) \
|
||||
| SHUFFLED32((alu_carry_val >> 32), 31, xer_carry_bit)); \
|
||||
/* if (alu_carry_val & BIT64(31)) \
|
||||
XER |= (xer_carry); \
|
||||
else \
|
||||
XER &= (~xer_carry); */ \
|
||||
} \
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx), XER = %ld\n", \
|
||||
(long)alu_result, (long)alu_result, (long)XER)); \
|
||||
/* Update the Result Conditions if needed */ \
|
||||
CR0_COMPARE(alu_result, 0, Rc); \
|
||||
/* assign targ same */ \
|
||||
TARG = alu_result; \
|
||||
}}
|
||||
|
||||
/* select the result from the different options */
|
||||
|
||||
#define _ALU_RESULT_VAL(CA,OE,Rc) (WITH_TARGET_WORD_BITSIZE == 64 \
|
||||
? alu_val \
|
||||
: (OE \
|
||||
? alu_overflow_val \
|
||||
: (CA \
|
||||
? alu_carry_val \
|
||||
: alu_val)))
|
||||
|
||||
|
||||
/* More basic alu operations */
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#define ALU_SET(val) \
|
||||
do { \
|
||||
alu_val = val; \
|
||||
alu_carry_val = ((unsigned64)alu_val) >> 32; \
|
||||
alu_overflow_val = ((signed64)alu_val) >> 32; \
|
||||
} while (0)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_SET(val) \
|
||||
do { \
|
||||
alu_val = val; \
|
||||
alu_carry_val = (unsigned32)(alu_val); \
|
||||
alu_overflow_val = (signed32)(alu_val); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#define ALU_ADD(val) \
|
||||
do { \
|
||||
unsigned64 alu_lo = (UNSIGNED64(alu_val) \
|
||||
+ UNSIGNED64(val)); \
|
||||
signed alu_carry = ((alu_lo & BIT(31)) != 0); \
|
||||
alu_carry_val = (alu_carry_val \
|
||||
+ UNSIGNED64(EXTRACTED(val, 0, 31)) \
|
||||
+ alu_carry); \
|
||||
alu_overflow_val = (alu_overflow_val \
|
||||
+ SIGNED64(EXTRACTED(val, 0, 31)) \
|
||||
+ alu_carry); \
|
||||
alu_val = alu_val + val; \
|
||||
} while (0)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_ADD(val) \
|
||||
do { \
|
||||
alu_val += val; \
|
||||
alu_carry_val += (unsigned32)(val); \
|
||||
alu_overflow_val += (signed32)(val); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#define ALU_ADD_CA \
|
||||
do { \
|
||||
signed carry = MASKED32(XER, xer_carry_bit, xer_carry_bit) != 0; \
|
||||
ALU_ADD(carry); \
|
||||
} while (0)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_ADD_CA \
|
||||
do { \
|
||||
signed carry = MASKED32(XER, xer_carry_bit, xer_carry_bit) != 0; \
|
||||
ALU_ADD(carry); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
|
||||
#if 0
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_SUB(val) \
|
||||
do { \
|
||||
alu_val -= val; \
|
||||
alu_carry_val -= (unsigned32)(val); \
|
||||
alu_overflow_val -= (signed32)(val); \
|
||||
} while (0)
|
||||
#endif
|
||||
#endif
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_OR(val) \
|
||||
do { \
|
||||
alu_val |= val; \
|
||||
alu_carry_val = (unsigned32)(alu_val); \
|
||||
alu_overflow_val = (signed32)(alu_val); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_XOR(val) \
|
||||
do { \
|
||||
alu_val ^= val; \
|
||||
alu_carry_val = (unsigned32)(alu_val); \
|
||||
alu_overflow_val = (signed32)(alu_val); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
|
||||
#if 0
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_NEGATE \
|
||||
do { \
|
||||
alu_val = -alu_val; \
|
||||
alu_carry_val = -alu_carry_val; \
|
||||
alu_overflow_val = -alu_overflow_val; \
|
||||
} while(0)
|
||||
#endif
|
||||
#endif
|
||||
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_AND(val) \
|
||||
do { \
|
||||
alu_val &= val; \
|
||||
alu_carry_val = (unsigned32)(alu_val); \
|
||||
alu_overflow_val = (signed32)(alu_val); \
|
||||
} while (0)
|
||||
#endif
|
||||
|
||||
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 64)
|
||||
#define ALU_NOT \
|
||||
do { \
|
||||
signed64 new_alu_val = ~alu_val; \
|
||||
ALU_SET(new_alu_val); \
|
||||
} while (0)
|
||||
#endif
|
||||
#if (WITH_TARGET_WORD_BITSIZE == 32)
|
||||
#define ALU_NOT \
|
||||
do { \
|
||||
signed new_alu_val = ~alu_val; \
|
||||
ALU_SET(new_alu_val); \
|
||||
} while(0)
|
||||
#endif
|
||||
|
||||
|
||||
/* Macros for updating the condition register */
|
||||
|
||||
#define CR1_UPDATE(Rc) \
|
||||
do { \
|
||||
if (Rc) { \
|
||||
CR_SET(1, EXTRACTED32(FPSCR, fpscr_fx_bit, fpscr_ox_bit)); \
|
||||
} \
|
||||
} while (0)
|
||||
|
||||
|
||||
#define _DO_CR_COMPARE(LHS, RHS) \
|
||||
(((LHS) < (RHS)) \
|
||||
? cr_i_negative \
|
||||
: (((LHS) > (RHS)) \
|
||||
? cr_i_positive \
|
||||
: cr_i_zero))
|
||||
|
||||
#define CR_SET(REG, VAL) MBLIT32(CR, REG*4, REG*4+3, VAL)
|
||||
#define CR_SET_XER_SO(REG, VAL) \
|
||||
do { \
|
||||
creg new_bits = ((XER & xer_summary_overflow) \
|
||||
? (cr_i_summary_overflow | VAL) \
|
||||
: VAL); \
|
||||
CR_SET(REG, new_bits); \
|
||||
} while(0)
|
||||
|
||||
#define CR_COMPARE(REG, LHS, RHS) \
|
||||
do { \
|
||||
creg new_bits = ((XER & xer_summary_overflow) \
|
||||
? (cr_i_summary_overflow | _DO_CR_COMPARE(LHS,RHS)) \
|
||||
: _DO_CR_COMPARE(LHS,RHS)); \
|
||||
CR_SET(REG, new_bits); \
|
||||
} while (0)
|
||||
|
||||
#define CR0_COMPARE(LHS, RHS, Rc) \
|
||||
do { \
|
||||
if (Rc) { \
|
||||
CR_COMPARE(0, LHS, RHS); \
|
||||
ITRACE(trace_alu, \
|
||||
("CR=0x%08lx, LHS=%ld, RHS=%ld\n", \
|
||||
(unsigned long)CR, (long)LHS, (long)RHS)); \
|
||||
} \
|
||||
} while (0)
|
||||
|
||||
|
||||
|
||||
/* Bring data in from the cold */
|
||||
|
||||
#define MEM(SIGN, EA, NR_BYTES) \
|
||||
((SIGN##_##NR_BYTES) vm_data_map_read_##NR_BYTES(cpu_data_map(processor), EA, \
|
||||
processor, cia)) \
|
||||
|
||||
#define STORE(EA, NR_BYTES, VAL) \
|
||||
do { \
|
||||
vm_data_map_write_##NR_BYTES(cpu_data_map(processor), EA, VAL, \
|
||||
processor, cia); \
|
||||
} while (0)
|
||||
|
||||
|
||||
/* some FPSCR update macros */
|
||||
|
||||
#define FPSCR_BEGIN \
|
||||
FPSCR &= ~fpscr_reserved_20; \
|
||||
{ \
|
||||
fpscreg old_fpscr __attribute__((__unused__)) = FPSCR
|
||||
|
||||
#define FPSCR_END(Rc) { \
|
||||
CR1_UPDATE(Rc); \
|
||||
if (FPSCR & fpscr_reserved_20) { \
|
||||
FPSCR &= ~fpscr_reserved_20; \
|
||||
program_interrupt(processor, cia, \
|
||||
floating_point_enabled_program_interrupt); \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define FPSCR_SET_FPCC(VAL) MBLIT32(FPSCR, fpscr_fpcc_bit, fpscr_fpcc_bit+3, VAL)
|
||||
|
||||
/* Handle various exceptions */
|
||||
|
||||
#define FPSCR_OR_VX(VAL) \
|
||||
do { \
|
||||
FPSCR |= (VAL); \
|
||||
FPSCR |= fpscr_fx; \
|
||||
if (FPSCR & fpscr_ve) \
|
||||
FPSCR |= fpscr_fex | fpscr_reserved_20; \
|
||||
FPSCR |= fpscr_vx; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_OX(COND) \
|
||||
do { \
|
||||
if (COND) { \
|
||||
FPSCR |= fpscr_ox; \
|
||||
FPSCR |= fpscr_fx; \
|
||||
if (FPSCR & fpscr_oe) \
|
||||
FPSCR |= fpscr_fex | fpscr_reserved_20; \
|
||||
} \
|
||||
else \
|
||||
FPSCR &= ~fpscr_ox; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_UX(COND) \
|
||||
do { \
|
||||
if (COND) { \
|
||||
FPSCR |= fpscr_ux; \
|
||||
FPSCR |= fpscr_fx; \
|
||||
if (FPSCR & fpscr_ue) \
|
||||
FPSCR |= fpscr_fex | fpscr_reserved_20; \
|
||||
} \
|
||||
else \
|
||||
FPSCR &= ~fpscr_ux; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_ZX(COND) \
|
||||
do { \
|
||||
if (COND) { \
|
||||
FPSCR |= fpscr_zx; \
|
||||
FPSCR |= fpscr_fx; \
|
||||
if (FPSCR & fpscr_ze) \
|
||||
FPSCR |= fpscr_fex | fpscr_reserved_20; \
|
||||
} \
|
||||
else \
|
||||
FPSCR &= ~fpscr_zx; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_XX(COND) \
|
||||
do { \
|
||||
if (COND) { \
|
||||
FPSCR |= fpscr_xx; \
|
||||
FPSCR |= fpscr_fx; \
|
||||
if (FPSCR & fpscr_xe) \
|
||||
FPSCR |= fpscr_fex | fpscr_reserved_20; \
|
||||
} \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_FR(COND) \
|
||||
do { \
|
||||
if (COND) \
|
||||
FPSCR |= fpscr_fr; \
|
||||
else \
|
||||
FPSCR &= ~fpscr_fr; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_FI(COND) \
|
||||
do { \
|
||||
if (COND) \
|
||||
FPSCR |= fpscr_fi; \
|
||||
else \
|
||||
FPSCR &= ~fpscr_fi; \
|
||||
} while (0)
|
||||
|
||||
#define FPSCR_SET_FPRF(VAL) \
|
||||
do { \
|
||||
FPSCR = (FPSCR & ~fpscr_fprf) | (VAL); \
|
||||
} while (0)
|
|
@ -216,7 +216,7 @@
|
|||
unsigned8 busy[nr_ppc_function_units]; /* whether a function is busy or not */
|
||||
};
|
||||
|
||||
STATIC_MODEL const char *const ppc_function_unit_name[ (int)nr_ppc_function_units ] = {
|
||||
static const char *const ppc_function_unit_name[ (int)nr_ppc_function_units ] = {
|
||||
"unknown functional unit instruction",
|
||||
"integer functional unit instruction",
|
||||
"system register functional unit instruction",
|
||||
|
@ -228,7 +228,7 @@
|
|||
"branch functional unit instruction",
|
||||
};
|
||||
|
||||
STATIC_MODEL const char *const ppc_branch_conditional_name[32] = {
|
||||
static const char *const ppc_branch_conditional_name[32] = {
|
||||
"branch if --CTR != 0 and condition is FALSE", /* 0000y */
|
||||
"branch if --CTR != 0 and condition is FALSE, reverse branch likely",
|
||||
"branch if --CTR == 0 and condition is FALSE", /* 0001y */
|
||||
|
@ -263,7 +263,7 @@
|
|||
"branch always (ignored bits 1,4,5 set to 1)",
|
||||
};
|
||||
|
||||
STATIC_MODEL const char *const ppc_nr_mtcrf_crs[9] = {
|
||||
static const char *const ppc_nr_mtcrf_crs[9] = {
|
||||
"mtcrf moving 0 CRs",
|
||||
"mtcrf moving 1 CR",
|
||||
"mtcrf moving 2 CRs",
|
||||
|
@ -1408,6 +1408,14 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
|
||||
|
||||
|
||||
#
|
||||
# 0.0.0.0 Illegal instruction used for kernel mode emulation
|
||||
#
|
||||
0.0,6./,11./,16./,21./,31.1:X:::instruction_call
|
||||
if (!os_emul_instruction_call(processor, cia, real_addr(cia, 1)))
|
||||
program_interrupt(processor, cia,
|
||||
illegal_instruction_program_interrupt);
|
||||
|
||||
#
|
||||
# I.2.4.1 Branch Instructions
|
||||
#
|
||||
|
@ -2258,6 +2266,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
if (RA_is_0) *rT = EXTS(SI);
|
||||
else *rT = *rA + EXTS(SI);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rT, (long)*rT));
|
||||
PPC_INSN_INT(RT_BITMASK, (RA_BITMASK & ~1), 0);
|
||||
|
||||
0.15,6.RT,11.RA,16.SI:D:::Add Immediate Shifted
|
||||
|
@ -2267,6 +2276,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
if (RA_is_0) *rT = EXTS(SI) << 16;
|
||||
else *rT = *rA + (EXTS(SI) << 16);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rT, (long)*rT));
|
||||
PPC_INSN_INT(RT_BITMASK, (RA_BITMASK & ~1), 0);
|
||||
|
||||
0.31,6.RT,11.RA,16.RB,21.OE,22.266,31.Rc:XO:::Add
|
||||
|
@ -2374,21 +2384,23 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
# ALU_BEGIN(*rA);
|
||||
# ALU_ADD_CA;
|
||||
# ALU_SUB(1);
|
||||
# ALU_END(*rT, 1/*CA*/, OE, Rc);
|
||||
ALU_BEGIN(*rA);
|
||||
ALU_ADD_CA;
|
||||
ALU_ADD(-1);
|
||||
ALU_END(*rT, 1/*CA*/, OE, Rc);
|
||||
PPC_INSN_INT(RT_BITMASK, RA_BITMASK, Rc);
|
||||
|
||||
0.31,6.RT,11.RA,16./,21.OE,22.232,31.Rc:XO:::Subtract From Minus One Extended
|
||||
*601: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*603: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
# ALU_BEGIN(*rA);
|
||||
# ALU_NOT;
|
||||
# ALU_ADD_CA;
|
||||
# ALU_SUB(1);
|
||||
# ALU_END(*rT, 1/*CA*/, OE, Rc);
|
||||
ALU_BEGIN(*rA);
|
||||
ALU_NOT;
|
||||
ALU_ADD_CA;
|
||||
ALU_ADD(-1);
|
||||
ALU_END(*rT, 1/*CA*/, OE, Rc);
|
||||
PPC_INSN_INT(RT_BITMASK, RA_BITMASK, Rc);
|
||||
|
||||
0.31,6.RT,11.RA,16./,21.OE,22.202,31.Rc:XO::addze:Add to Zero Extended
|
||||
*601: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
|
@ -2696,6 +2708,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS & UI;
|
||||
CR0_COMPARE(*rA, 0, 1/*Rc*/);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 1/*Rc*/);
|
||||
|
||||
0.29,6.RS,11.RA,16.UI:D:::AND Immediate Shifted
|
||||
|
@ -2705,6 +2718,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS & (UI << 16);
|
||||
CR0_COMPARE(*rA, 0, 1/*Rc*/);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 1/*Rc*/);
|
||||
|
||||
0.24,6.RS,11.RA,16.UI:D:::OR Immediate
|
||||
|
@ -2713,6 +2727,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS | UI;
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 0/*Rc*/);
|
||||
|
||||
0.25,6.RS,11.RA,16.UI:D:::OR Immediate Shifted
|
||||
|
@ -2721,6 +2736,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS | (UI << 16);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 0/*Rc*/);
|
||||
|
||||
0.26,6.RS,11.RA,16.UI:D:::XOR Immediate
|
||||
|
@ -2729,6 +2745,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS ^ UI;
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 0/*Rc*/);
|
||||
|
||||
0.27,6.RS,11.RA,16.UI:D:::XOR Immediate Shifted
|
||||
|
@ -2737,6 +2754,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS ^ (UI << 16);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, 0/*Rc*/);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.28,31.Rc:X:::AND
|
||||
|
@ -2746,6 +2764,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS & *rB;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.444,31.Rc:X:::OR
|
||||
|
@ -2755,6 +2774,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS | *rB;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.316,31.Rc:X:::XOR
|
||||
|
@ -2764,6 +2784,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS ^ *rB;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.476,31.Rc:X:::NAND
|
||||
|
@ -2773,6 +2794,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = ~(*rS & *rB);
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.124,31.Rc:X:::NOR
|
||||
|
@ -2782,6 +2804,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = ~(*rS | *rB);
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.284,31.Rc:X:::Equivalent
|
||||
|
@ -2789,8 +2812,10 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*603: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*603e:PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
# *rA = ~(*rS ^ *rB); /* A === B */
|
||||
# CR0_COMPARE(*rA, 0, Rc);
|
||||
*rA = ~(*rS ^ *rB); /* A === B */
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.60,31.Rc:X:::AND with Complement
|
||||
*601: PPC_UNIT_IU, PPC_UNIT_IU, 1, 1, 0
|
||||
|
@ -2799,6 +2824,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS & ~*rB;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.412,31.Rc:X:::OR with Complement
|
||||
|
@ -2808,6 +2834,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = *rS | ~*rB;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK | RB_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16./,21.954,31.Rc:X::extsb:Extend Sign Byte
|
||||
|
@ -2817,6 +2844,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = (signed_word)(signed8)*rS;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16./,21.922,31.Rc:X::extsh:Extend Sign Half Word
|
||||
|
@ -2826,6 +2854,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
*604: PPC_UNIT_SCIU1, PPC_UNIT_SCIU2, 1, 1, 0
|
||||
*rA = (signed_word)(signed16)*rS;
|
||||
CR0_COMPARE(*rA, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16./,21.986,31.Rc:X:64::Extend Sign Word
|
||||
|
@ -2860,6 +2889,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
count++;
|
||||
}
|
||||
*rA = count;
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
CR0_COMPARE(count, 0, Rc); /* FIXME - is this correct */
|
||||
|
||||
|
||||
|
@ -2874,6 +2904,7 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
# unsigned_word m = MASK(b, 63);
|
||||
# signed_word result = r & m;
|
||||
# *rA = result;
|
||||
# ITRACE(trace_alu, (" Result = %ld (0x%lx)\n", (long)*rA, (long)*rA));
|
||||
# CR0_COMPARE(result, 0, Rc); /* FIXME - is this correct */
|
||||
|
||||
0.30,6.RS,11.RA,16.sh_0_4,21.me,27.1,30.sh_5,31.Rc:MD:64::Rotate Left Doubleword Immediate then Clear Right
|
||||
|
@ -3024,6 +3055,8 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
else
|
||||
XER &= ~xer_carry;
|
||||
CR0_COMPARE(shifted, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx), XER = %ld\n",
|
||||
(long)*rA, (long)*rA, (long)XER));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, Rc);
|
||||
|
||||
0.31,6.RS,11.RA,16.RB,21.794,31.Rc:X:64::Shift Right Algebraic Doubleword
|
||||
|
@ -3044,6 +3077,8 @@ void::function::invalid_arithemetic_operation:cpu *processor, unsigned_word cia,
|
|||
else
|
||||
XER &= ~xer_carry;
|
||||
CR0_COMPARE(shifted, 0, Rc);
|
||||
ITRACE(trace_alu, (" Result = %ld (0x%lx), XER = %ld\n",
|
||||
(long)*rA, (long)*rA, (long)XER));
|
||||
PPC_INSN_INT(RA_BITMASK, RS_BITMASK, Rc);
|
||||
|
||||
#
|
||||
|
|
Loading…
Reference in New Issue