Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 93dd4001 authored by Tejun Heo's avatar Tejun Heo Committed by Greg Kroah-Hartman
Browse files

klist: implement klist_add_{after|before}() 



Add klist_add_after() and klist_add_before() which puts a new node
after and before an existing node, respectively.  This is useful for
callers which need to keep klist ordered.  Note that synchronizing
between simultaneous additions for ordering is the caller's
responsibility.

Signed-off-by: default avatarTejun Heo <htejun@gmail.com>
Signed-off-by: default avatarGreg Kroah-Hartman <gregkh@suse.de>
parent 1da43e4a

include/linux/klist.h

+2 −0
Original line number Original line Diff line number Diff line
@@ -46,6 +46,8 @@ struct klist_node { 




extern void klist_add_tail(struct klist_node * n, struct klist * k);

extern void klist_add_tail(struct klist_node * n, struct klist * k);

extern void klist_add_head(struct klist_node * n, struct klist * k);

extern void klist_add_head(struct klist_node * n, struct klist * k);

extern void klist_add_after(struct klist_node *n, struct klist_node *pos);

extern void klist_add_before(struct klist_node *n, struct klist_node *pos);





extern void klist_del(struct klist_node * n);

extern void klist_del(struct klist_node * n);

extern void klist_remove(struct klist_node * n);

extern void klist_remove(struct klist_node * n);

lib/klist.c

+33 −0
Original line number Original line Diff line number Diff line
@@ -120,6 +120,39 @@ void klist_add_tail(struct klist_node * n, struct klist * k) 
EXPORT_SYMBOL_GPL(klist_add_tail);

EXPORT_SYMBOL_GPL(klist_add_tail);









/**

 * klist_add_after - Init a klist_node and add it after an existing node

 * @n: node we're adding.

 * @pos: node to put @n after

 */

void klist_add_after(struct klist_node *n, struct klist_node *pos)

{

	struct klist *k = pos->n_klist;



	klist_node_init(k, n);

	spin_lock(&k->k_lock);

	list_add(&n->n_node, &pos->n_node);

	spin_unlock(&k->k_lock);

}

EXPORT_SYMBOL_GPL(klist_add_after);



/**

 * klist_add_before - Init a klist_node and add it before an existing node

 * @n: node we're adding.

 * @pos: node to put @n after

 */

void klist_add_before(struct klist_node *n, struct klist_node *pos)

{

	struct klist *k = pos->n_klist;



	klist_node_init(k, n);

	spin_lock(&k->k_lock);

	list_add_tail(&n->n_node, &pos->n_node);

	spin_unlock(&k->k_lock);

}

EXPORT_SYMBOL_GPL(klist_add_before);





static void klist_release(struct kref * kref)

static void klist_release(struct kref * kref)

{

{

	struct klist_node * n = container_of(kref, struct klist_node, n_ref);

	struct klist_node * n = container_of(kref, struct klist_node, n_ref);