AVR-Chat

Hi Martin,

> My problem is that all the states are basically equally likely.  I'd like to find a way to minimize the difference between the run times of the subroutine for states 1 and state N.   The states are sequential (or at least close enough that it's not worrying about) and memory use isn't an option.  Also I'm more interested in balance between the execution rate then brute speed, though, as always, faster is better.  Does anyone have any ideas on how to solve this little problem?  Any ideas are much appreciated, thank you in advance.

The normal technique would be to use a lookup table with the state as
an index. The looked up value would be the address to jump to (i.e.
address of the state).

--
Dave Hylands
Vancouver, BC, Canada
http://www.DaveHylands.com/