I wrote a 66 byte multiplication routine (yes, unrolled, it could be very small but it'd be slower) to multiply a by c and return the result in hl, it uses a,bc and hl.
The speed statistics are: worst case (a = 254): [309] best case (a = 1): [266]
Is that anywhere near good enough or is 266 - 309 T-states slow? (its including a ret, which takes 10 T-states, but not including the call, the pure routine would take 256 to 299 T-states)
[TI ASM] Speed guidelines
Moderator: MaxCoderz Staff
-
- Calc King
- Posts: 1513
- Joined: Sat 05 Aug, 2006 7:22 am