comp-cpp

I wrote a little fibonacci: RAM AD PC ADDR ________ _ _ ---- |---****-|-|*| ---* |----**-*|-|-| --*- |---***--|-|-| --** |--*-***-|-|-| -*-- |---***-*|-|-| -*-* |----**--|-|-| -**- |---*****|-|-| -*** |-*------|-|-| *--- |--------|-|-| *--* |--------|-|-| *-*- |--------|-|-| *-** |--------|-|-| **-- |--------|-|-| **-* |-------*|-|-| ***- |--------|-|-| **** | OUTPUT |-|-| But due to the saturating arithmetic, it gets to 255 and then just prints 255 over and over. I tried to write one that would reset itself when that happens, but I can't seem to do it in 15 bytes (I have a 14 instruction+3 variable version but of course 17 bytes won't fit in RAM) Edit: I can save one of the variables with a set-immediate instruction :) https://github.com/gto76/comp-cpp/pu

And why ADDR_SIZE squared? That just seems to work "by accident", since ADDR_SIZE is 4 it evaluates to 15. What is really meant is probably (1 << ADDR_SIZE), i.e. 2 raised to ADDR_SIZE. Of course for the value 4 it evaluates to the same thing. For 5 it would become 24 rather than 31 which I would expect, assuming it's a size in bits of course ... Now I'm confused. The file in question: https://github.com/gto76/comp-cpp/blob/e800d121e40f8acca6b9d.... And the -1 seems to be explained by how the author wants to use it, it's "last valid address", i.e. not the size at all. Something I'd complain about if this were open for review, for sure. :)