> Yep, I knew it was a circular stack, but when I read
> your post a funny thought occured to me. Since the stack
> is circular, you could call a function ANY amount of times,
> and return the same amount of times, provided:
> * It was originally called from the top level
> * no ints or other functions were called.
>
> This would give an option to do a recursive activity
> a very large number of times??
>
> Any opinions?? :o)
> -Roman
>

Sorry Roman, this won't work.

Remember the stack stores return addresses, not function addresses.

Given:

main:
    call     func
point_a:
    ...


func:
    ...
    call       func
point_b:
    ...
    return

After 8 calls every "return" will go back to "point_b", and we'll never get
back to "point_a".

Bob Ammerman
RAm Systems
(contract development of high performance, high function, low-level
software)

--
http://www.piclist.com hint: To leave the PICList
mailto:piclist-unsubscribe-request@mitvma.mit.edu