RFC Task references..
Get series with b4
b4 am [email protected]Versions newest first
- v1 RFC Latest5 patches 25 repliesIn review
Patches in v1 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/5 | pid: Implement task references.include/ include/ kernel/ +1 more | +119 | 16 replies | |
| 2/5 | pid: Add macros for interating through tasks by type.include/ | +12 | 0 replies | |
| 3/5 | pid: Implement kill_tref.include/ kernel/ | +34 | 0 replies | |
| 4/5 | vt: Update spawnpid to use a task_ref.drivers/ drivers/ | +7 | 4 replies | |
| 5/5 | file: Modify struct fown_struct to contain a treffs/ fs/ include/ +1 more | +30 | 2 replies |
Reviews trailers per patch
No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.
Cover letter [RFC][PATCH 0/5] Task references..
In the pid virtualization thread it was noticed that currently in the kernel we have a variables that hold pids of processes or process groups that we later intend to send signals to.
It was suggest that we instead use pointers to struct task_struct and reference count them to get around this problem.
The problem was that each file descriptor in the system has one of these variables in f_owner an instance of struct fown_struct it would allow user to bypass the limits on the number of processes and type of megabytes of memory with invisible zombie processes.
For kernel threads where things are tightly coordinated this is not an issue hand holding a reference to the task struct of a kernel thread seems the sane thing to do.
The other problem was that pointers to struct task_struct don't map well to process groups.
I believe the solution to these problems is to introduce a small data structure that can be reference counted and holds a pointer to a
struct task_struct. The struct task_struct holds a pointer to this
small data structure that will be used to remove the pointer to itself when the struct task_struct is freed.
The following series of patches implement the data structure and the routines for manipulating it. As well as implementing this data structure in two common cases in the kernel, that demonstrate it's usefulness.
Eric