XOR
Compute the bitwise exclusive OR of the two operands, storing the result in the left operand.
| Opcode | Bytes | Cycles | Form | Example |
|---|---|---|---|---|
| $82 | 3 | 3 | XOR B:_, {U_BYTE} | XOR B:1, 123 |
| $D2 | 4 | 3 | XOR P:_, {U_PAIR} | XOR P:2, 12345 |
| $83 | 3 | 3 | XOR I:_, {U_BYTE} | XOR I:4, 123 |
| $D3 | 4 | 3 | XOR I:_, {U_PAIR} | XOR I:4, 12345 |
| $84 | 3 | 3 | XOR I:_, XHEX {XINT} | XOR I:4, XHEX $D000_0000 |
| $85 | 3 | 3 | XOR B:_, B:_ | XOR B:1, B:2 |
| $86 | 3 | 3 | XOR P:_, P:_ | XOR P:2, P:4 |
| $87 | 3 | 3 | XOR I:_, I:_ | XOR I:4, I:8 |
| Condition flag | Output |
|---|---|
| zero (ZF) | If the result is zero, this flag is 1; otherwise it is 0. |
| negative (NF) | This flag is updated with the highest bit of the result. For example, if XOR B:0, $FF stores $80 in B:0, then NF will be 1. |
| overflow (OF) | This flag is always 0. |
| carry (CF) | This flag is always 0. |
Notes
-
XORis commonly used for reversing bits. -
Large literal values such as
$D000_0000must be compatible with XHEX encoding.