Frans Kaashoek dabbc348bc Maybe fix two races identified by rtm (thx!):
- during exit(), hold p's parent lock and p's lock across all changes
to p and its parent (e.g., reparenting and wakeup1).  the lock
ordering between concurrent exits of children, parent, and great
parent might work out because processes form a tree.

- in wakeup1() test and set p->state atomically by asking caller to
have p locked.

a correctness proof would be desirable.
2019-07-06 16:38:41 -04:00
..
2019-06-13 06:57:38 -04:00
2019-06-11 09:57:14 -04:00
2019-06-13 10:29:27 -04:00
2019-06-11 09:57:14 -04:00
2019-06-13 10:29:27 -04:00
2019-06-13 10:29:27 -04:00
2019-06-13 10:29:27 -04:00
2019-06-13 06:49:02 -04:00
2019-06-13 06:49:02 -04:00
2019-06-11 09:57:14 -04:00
2019-06-13 06:57:38 -04:00
2019-06-13 09:40:17 -04:00
2019-06-13 09:40:17 -04:00
2019-07-02 20:52:30 -04:00
2019-07-04 08:57:23 -04:00
2019-07-02 14:19:31 -04:00
2019-07-02 14:19:31 -04:00
2019-07-02 14:19:31 -04:00
2019-07-02 14:19:31 -04:00
x
2019-07-01 08:28:14 -04:00