scene: Re: toodeloo
 2025-03-29 12:52Posted by: Apleif
I'm pleased to inform you all that I have launched three Toodeloo albums on all relevant streaming platforms, with good help from Dasse and Toodeloo's sister.

You can find his artist profile on Spotify here: https://open.spotify.com/artist/0eSWYvtbBuC7TOAgCr51TM?si=mkP1BFXFTMOrZ2U5MwR9WQ
coding: DSP cross tools v2.0
 2025-03-11 19:19Posted by: insane/rabenauge^tscc
I've released Version 2.0 of my DSP Cross Tools for 56k coding on unix systems.

There's cldlod, lod2p56 and a disassembly port of the ASM56000 v4.1.1 assembler.

You can get it at:

github.com/insane-rabenauge/dsptools
coding: Re: carry overflow step decision
 2025-03-10 21:12Posted by: ROGer
Wonderful! Works like a charm. Thanks again for the help. You are the best :-)
coding: Re: carry overflow step decision
 2025-03-10 15:44Posted by: ROGer
Hi tat, mikro, and ggn!
Thanks a lot for your replies to my somewhat cryptic question. @tat: I meant what mikro wrote. Will try out your advices and report back in the next days. See you :-)
coding: Re: carry overflow step decision
 2025-03-10 10:27Posted by: mikro
I think he meant something like this:

add.w d0,dn ; d0 contains a constant 0.16 fixed point value less than one
bcs move_to_right


However this feel very inefficient, using addx and reversed int/frac part would certainly be more usable here.

As ggn said, rounding can be done with just pre-adding the 0.5 value to your d0.
coding: Re: carry overflow step decision
 2025-03-09 14:04Posted by: ggn
Just to clarify, I guess you mean "add.w dn,d0" as you say you accumulate the results in d0?

But anyway. If I understand you correctly, you want to round your fraction and take decision on the rounded number rather than the actual, and this is what what I type below is all about.

The naive way we do rounding is to add 0.5 and take the integer part, so int(x+0.5). If we generalise this, we add the half of our unit, i.e. our "1".

When we have base 16 16.16 fractional numbers our unit is "10000" as we reserve 2 bytes for fraction. Therefore, our 0.5 is $8000. Just add this to your number and then check for overflows etc. That's it. Basically we need to copy d0 to some other register and add $8000.

If that last bit sounds fiddly, then we can simplify this furhter. If we don't really need to keep track of the actual fraction, we can pre-add that $8000 at initialisation. Then the value will automatically be rounded. And to keep everything in order, also add $8000 to the destination value.

What this means in practice: If you want to interpolate (for example) between $150000 and $310000, modify those to $158000 and $3180000. Then you get rounding and your limits are still correct.

(There are several other things to consider when rounding, but this is the main idea)

Hope this helps! Let us know if this makes sense or you have further questions.
coding: Re: carry overflow step decision
 2025-03-09 13:43Posted by: ggn
Just to clarify, I guess you mean "add.w dn,d0" as you say you accumulate the results in d0?

But anyway. If I understand you correctly, you want to round your fraction and take decision on the rounded number rather than the actual, and this is what what I type below is all about.

The naive way we do rounding is to add 0.5 and take the integer part, so int(x+0.5). If we generalise this, we add the half of our unit, i.e. our "1".

When we have base 16 16.16 fractional numbers our unit is "10000" as we reserve 2 bytes for fraction. Therefore, our 0.5 is $8000. Just add this to your number and then check for overflows etc. That's it. Basically we need to copy d0 to some other register and add $8000.

If that last bit sounds fiddly, then we can simplify this furhter. If we don't really need to keep track of the actual fraction, we can pre-add that $8000 at initialisation. Then the value will automatically be rounded. And to keep everything in order, also add $8000 to the destination value.

What this means in practice: If you want to interpolate (for example) between $150000 and $310000, modify those to $158000 and $3180000. Then you get rounding and your limits are still correct.

(There are several other things to consider when rounding, but this is the main idea)

Hope this helps! Let us know if this makes sense or you have further questions.
coding: Re: carry overflow step decision
 2025-03-09 13:41Posted by: tat
Hi ROGer,

I'm not sure I understand the question. Can you explain any more what you are trying to achieve?

Often the "X" bit of the 68000, and the ADDX instruction, is used to automatically add a carry-1 to an accumulated bigger value. But I'm not quite sure this is what you mean.

Steve
coding: carry overflow step decision
 2025-03-08 14:02Posted by: ROGer
I have a word-sized (constant) fractional value in a data register (d0) and sum that up in a loop (add.w d0,dn) and everytime the carry bit is set I take action (e.g. moving one step in x direction). Is there a (smart) way to do this with "rounding"? So to say - and if I am not mistaken - to take action when the carry condition is fulfilled to its half? Could the overflow bit be of value?
scene: Re: Sell my CT60e
 2024-12-27 20:29Posted by: Thadoss/Dune
Sorry for the previous blanck posts.

I ve got a ct60e I don t use.
I had it new and never installed it into my falcon.
It is selled without 68060 CPU.

I sell it for 250 euros.
If an entousiast atarian is interrested, pm me.

Regards
Laurent
scene: Sell my CT60e
 2024-12-27 20:22Posted by: Thadoss/Dune
scene: Re: rmac v2.2.37
 2024-12-27 11:56Posted by: mikro
Typo in the link. :)
scene: Re: rmac v2.2.37
 2024-12-23 14:12Posted by: ggn
And yet another one! https://rmac.is-slick.coml#rmac-2-2-37
scene: SillyVenture Sk24WE
 2024-12-06 18:12Posted by: AdamK
SillyVenture Sk24WE Gwem concert: https://www.youtube.com/live/EXtsINiG6jE
scene: Re: toodeloo
 2024-11-24 10:07Posted by: Apleif
Sorry for the long delay. I have finally gotten in touch with his sister and received permission to remaster and publish his music on all the major sites. You can find the first record on Spotify, Apple Music, Deezer et c, called Toodeloo - The Toodeloo Archives. More will come in time. :)

https://open.spotify.com/album/4GGyGGzhBF4UB9aBqqAJSP?si=dLMmgBb6TqiczssMb-p7vQ
coding: Re: Modified STE Replayers
 2024-11-18 17:23Posted by: evil
o/ Wee thank you! :-)

Hacking Lance had incredible performance but oh boy whas it tangled into Paulos framework. Now finally freed :)

--
Anders Eriksson
ae@dhs.nu
coding: Modified STE Replayers
 2024-11-18 00:25Posted by: insane/rabenauge^tscc
I've finally released the modified replayers I've used for Chipo Django 1 and 2.
CD1 used Leonard's Paula Emulator with a Protracker 2.3f replay while CD2 used Hacking Lance bugfixed for Invert Loop Support.

If anyone is interested:
https://github.com/insane-rabenauge/atari-ste-protracker-23f

Assemble with VASM.

insane/rabenauge^tscc
scene: Re: DangerZone - new Falcon game
 2024-08-25 21:23Posted by: MrHabaki
scene: DangerZone - new Falcon game
 2024-08-25 21:22Posted by: MrHabaki
scene: Re: SillyVenture 2K24 stream
 2024-08-17 12:43Posted by: AdamK
Saturday stream: https://www.youtube.com/live/egDTbiwZExM
Or see here: https://sillyventure.eu/pl/stream
He had some electricity problems, we hope it won't happen again.
There will be slight delay as usual, but not much ;)