Difference between revisions of "reentrant"
m |
m |
||
| Line 3: | Line 3: | ||
This can happen in different ways: |
This can happen in different ways: |
||
* From an other [[thread of execution]] (an other task) |
* From an other [[thread of execution]] (an other task) |
||
| − | * From an [[Interrupt |
+ | * From an [[Interrupt Service Routine]] |
* From another CPU-core sharing memory space. |
* From another CPU-core sharing memory space. |
||
Typically, this means that the routine does not use any static variables. Routines which use only parameters and local variables are reentrant. |
Typically, this means that the routine does not use any static variables. Routines which use only parameters and local variables are reentrant. |
||
Revision as of 20:36, 5 June 2019
A subroutine is called reentrant if can be safely be called again ("re-entered") before the previous invocation has completed execution. This can happen in different ways:
- From an other thread of execution (an other task)
- From an Interrupt Service Routine
- From another CPU-core sharing memory space.
Typically, this means that the routine does not use any static variables. Routines which use only parameters and local variables are reentrant. Note that re-entrancy is not the same as recursive calling. If a function is recursive, it calls itself, either directly (FuncA calls FuncA) or indirectly (FuncA calls FuncB calls FuncA).
Calling conventions of most modern processors store parameters in registers and on the stack, which is basically required for a routine to be reentrant. Some compilers for older architectures (especially for 8-bit architectures such as 8051 and 6502) do not produce reentrant code and use a static overlay scheme instead.
