Hello:
I found your Tstate calculator really useful, but I think it would be even better if it includes the sum of the Tstates and the bytes. The best way would be to put the accumulated value until each instruction. An example:
2 | 7 | | 2 | 7 | ld a,0
1 | 4 | | 3 | 11 | inc a
1 | 11 | | 4 | 22 | rst #38
2 | 13 | 8 | 6 | 30 | djnz -5
2 | 7 | | 8 | 37 | ld b, 5
This would allow to easily calculate how many bytes needs a piece of code just by sustracting the initial byte number to the final byte number, and the same for Tstates (for conditionals, I think it is better to add the number of Tstates needed when the condition is not met).
Hello:
I found your Tstate calculator really useful, but I think it would be even better if it includes the sum of the Tstates and the bytes. The best way would be to put the accumulated value until each instruction. An example:
This would allow to easily calculate how many bytes needs a piece of code just by sustracting the initial byte number to the final byte number, and the same for Tstates (for conditionals, I think it is better to add the number of Tstates needed when the condition is not met).