* To check if A is zero, AND A or OR A are one byte smaller and one M-cycle faster than CP 0.
* If tables are aligned to a 256-byte boundary, the contents can be accessed by placing the index in a register such as L and the table address in H. This is faster than loading the full unaligned 16-bit address and adding a 16-bit index to it, and makes accessing tables with a size of 256 bytes or less very convenient.
* PUSH Unrolled LDI loop is faster than LDIR to fill memory. See: [[Programming:Filling_memory_with_a_byte]]
<br>