>> | > +
>> | > struct pid
>> | > {
>> | > atomic_t count;
>> | > @@ -40,6 +40,8 @@ enum pid_type
>> | > /* lists of tasks that use this pid */
>> | > struct hlist_head tasks[PIDTYPE_MAX];
>> | > struct rcu_head rcu;
>> | > +int level;
>> | > +s
[EMAIL PROTECTED] wrote:
> Cedric Le Goater [EMAIL PROTECTED] wrote:
> | Pavel Emelianov wrote:
> | > struct pid_namespace will have the kmem_cache to allocate
> | > the pids from, the parent, as they are hierarchical, and
> | > the level of nesting value.
> | >
> | > struct pid will have a variab
Cedric Le Goater [EMAIL PROTECTED] wrote:
| Pavel Emelianov wrote:
| > struct pid_namespace will have the kmem_cache to allocate
| > the pids from, the parent, as they are hierarchical, and
| > the level of nesting value.
| >
| > struct pid will have a variable length array of pid_number-s
| > one
Pavel Emelianov wrote:
> struct pid_namespace will have the kmem_cache to allocate
> the pids from, the parent, as they are hierarchical, and
> the level of nesting value.
>
> struct pid will have a variable length array of pid_number-s
> one for each namespace this pid lives in. The level value
>
struct pid_namespace will have the kmem_cache to allocate
the pids from, the parent, as they are hierarchical, and
the level of nesting value.
struct pid will have a variable length array of pid_number-s
one for each namespace this pid lives in. The level value
shows the level of the namespace thi
5 matches
Mail list logo
