On Thu, 2015-04-02 at 13:43 +0100, David Howells wrote:
> Ian Kent wrote:
>
> > +static struct umh_wq_entry *umh_wq_find_entry(int token)
> > +{
> > + struct umh_wq_entry *this, *entry;
> > + struct hlist_head *bucket;
> > + unsigned int hash;
> > +
> > + hash = hash_32((unsigned long) to
Ian Kent wrote:
> +static struct umh_wq_entry *umh_wq_find_entry(int token)
> +{
> + struct umh_wq_entry *this, *entry;
> + struct hlist_head *bucket;
> + unsigned int hash;
> +
> + hash = hash_32((unsigned long) token, UMH_WQ_HASH_SHIFT);
> + bucket = &umh_wq_hash[hash];
> +
On Tue, 2015-03-31 at 07:21 -0400, Jeff Layton wrote:
> On Tue, 31 Mar 2015 11:14:42 +0800
> Ian Kent wrote:
>
> > From: Ian Kent
> >
> > Persistent use of process information is needed for contained
> > execution in a namespace other than the root init namespace.
> >
> > Use a simple random t
On Tue, 31 Mar 2015 11:14:42 +0800
Ian Kent wrote:
> From: Ian Kent
>
> Persistent use of process information is needed for contained
> execution in a namespace other than the root init namespace.
>
> Use a simple random token as a key to create and store thread
> information in a hashed list
From: Ian Kent
Persistent use of process information is needed for contained
execution in a namespace other than the root init namespace.
Use a simple random token as a key to create and store thread
information in a hashed list for use by the usermode helper
thread runner.
Signed-off-by: Ian K
5 matches
Mail list logo
