* RLA, RRA, RLCA, RRCA are essentially optimized versions, one byte smaller and one M-cycle faster, of RL A, RR A, RLC A, RRC A.
* ADD HL,HL is 3 bytes smaller and one M-cycle faster than SLA L; RL H.* Unconditional JR and is one byte shorter than JP take and takes the same amount of time on CPC but JR is one byte shorter.* Many programs use XOR A to To set A to zero, since it's XOR A is one byte smaller and one M-cycle faster than LD A,0.* Likewise, many programs use AND A or OR A to To check if A is zero, since it's also AND A or OR A are one byte smaller and one M-cycle faster than CP 0.
<br>