On Thu, 14 Feb 2013 14:55:23, Shmuel (Seymour J.) Metz <firstname.lastname@example.org> wrote:
> In <DmJ5SKFdRQph-pn2-1k3VuEUx5fde@209-142-179-164.dyn.centurytel.net>, > on 02/10/2013 > at 04:50 PM, email@example.com (Will Janoschka) said: > > >The term is generally applied to a computer routine that forces > >the routine at each call, to make a private copy of all the data it > >may change, so that routine can call itself recursively without > >stepping on itself. In some places is slso a type of a still, > >thart operates in a recursve manner. > > No. Some authors define reentrant as equivalent to recursive and the > term is generally applied to thread-safe code, but neither usage > involves making copies of global data. Both usages require using local > variables for most private writable data.
Then your thread safe code cannot call itself from within itself which is the whole idea of reentrant rather than recursive a local copy must be made for anything that changes changing global data until final return from current instantiation would cause computation that is circular. For example any part of an general interrupt routine that can be interrupted must be reentrant. global variables can be used if not changed in this instantiation.