> The software stack is to fixed addresses determined by the call graph
> during the link phase.  A variable ends up in the same location every
time
> you call it.  Just where that is would be determined by the RAM used
before
> deepest call to it.  The linker has everything it needs to know to do
this,
> as long as the program is not recursive.  Even re-entrant is OK and is
> handled properly (by HiTech C at least).

How is re-entrancy handled when all variables have a fixed address?

Wouter.