[hatari-devel] Little question with add cycles (same question with a move)

[Laurent Sallafranque]

Thanks again for the help.

I'll have to rework all the .L cycles (I may be wrong with nearly all of 
them).

Another 2 question :

I'm using the 68030 UM third edition of the doc. Have you got a more 
recent one ?
(mine doesn't include all the *, # ... that report to bottom and tell 
which fea, fiea, ciea table to refer to.

In this doc, there's a description of the FULL FORMAT EXTENSION WORD(S) 
cycles table.
In which case should I use the values of this table ?

Regards

Laurent




Le 15/11/2011 13:34, Miro Kropác(ek a écrit :
>
>        {2,    2,     8,1,0,0,    12,1,1,0},    // MOVE.L (d16,An),Dn
>
>     Does it take the same number of cycles than the MOVE.W (d16,An),Dn ?
>
> I guess it doesn't, see below.
>
>         ADD.W (An),Dn
>
>         and
>
>         ADD.L (An),Dn
>
>         take the same amount of cycles ?
>
>         1,    1,     7,1,0,0,     9,1,1,0
>
> Nope. Your calculation is correct for the word access, though:
> 0 0 2(0/0/0) 2(0/1/0) (add)
> 1 1 3(1/0/0) 3(1/0/0) (fea)
> ------------------------------
> 1 1 5(1/0/0) 5(1/1/0)
>
> word: 1 1 7(1/0/0) 9(1/1/0)
> long:  1 1 3+8(1/0/0) 1+8+4(1/1/0)
>
> You see, you read one long, you must always remember the amount of 
> additional data needed to fetch, be it read or write access.
> -- 
> MiKRO / Mystic Bytes
> http://mikro.atari.org
>
>
> _______________________________________________
> hatari-devel mailing list
> hatari-devel at lists.berlios.de
> https://lists.berlios.de/mailman/listinfo/hatari-devel

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.berlios.de/pipermail/hatari-devel/attachments/20111115/bc30e026/attachment.html>