Timeline for non-reentrant libraries in shared memory?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:36 | history | edited | CommunityBot | replaced http://unix.stackexchange.com/ with https://unix.stackexchange.com/ | |
| Mar 11, 2016 at 16:06 | vote | accept | enigmaticPhysicist | ||
| Mar 11, 2016 at 14:30 | answer | added | user732 | timeline score: 4 | |
| Mar 11, 2016 at 13:29 | comment | added | Rui F Ribeiro | I did not dismiss your thread, I simply havent got the time yet to give it a proper answer. | |
| Mar 11, 2016 at 12:28 | comment | added | enigmaticPhysicist | I might not have the terminology exactly right, but I think the spirit of the question is pretty clear. Is non-reentrant code shared in memory between processes, and if so, how? | |
| Mar 11, 2016 at 12:15 | comment | added | Rui F Ribeiro | Either you are confusing concepts, or the post needs some clarification. Often the virtual memory mechanism will share code in memory to save resources, the data segment/stacks will be distinct; the problem of reentrancy will present itself in the same program with multiple threads/points of entry. For instance, it is known printf is not reentrant, or the kernel has non-reentrant points/functions. Share memory per se is yet another concept; you might be thinking of shared libraries, which is yet another different thing. I might come back and turn this comment in a proper answer later on. | |
| Mar 11, 2016 at 10:34 | history | asked | enigmaticPhysicist | CC BY-SA 3.0 |