1 Some of the implementation choices
2 ----------------------------------
6 Load from direct space:
18 1 is bad when x or y involve HL (1b)
20 1 = 12 + n*(8+8) - 8 20 36 68
21 1b = n*(12+12+8) 32 64 128
25 Hmm. (2) is too hard to support in the current model.
42 Then add pair and constant with result in hl
46 inc hl .. ; 6 = 8 + 6n
56 alt: (only when result=hl and left, rigth = pair, const)
60 So (1) is best for n <= 2, (2) is just bad, (3) is good n > 2
63 pair = pair + constant:
76 One cycle. If I cache HL later it will throw away the advantage. Choose 1.
88 So n <= 5 (1) is better.
91 It's nice to use HL as the temp register, but what if I used it as the
92 frame pointer instead of ix?
104 Things get better when you access the same set over, as you get rid
105 of the setup. But they get worse when both ops are on the stack/in
106 direct space. Easiest this way for now. iy may benifit...