klist: use same naming scheme as hlist for klist_add_after()
The name was modified from hlist_add_after() to hlist_add_behind() when adjusting the order of arguments to match the one with klist_add_after(). This is necessary to break old code when it would use it the wrong way. Make klist follow this naming scheme for consistency. Signed-off-by: Ken Helias <kenhelias@firemail.de> Cc: "Paul E. McKenney" <paulmck@linux.vnet.ibm.com> Cc: Christoph Hellwig <hch@infradead.org> Cc: Hugh Dickins <hughd@google.com> Cc: Jeff Kirsher <jeffrey.t.kirsher@intel.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
1d023284c3
commit
0f9859ca92
@ -44,7 +44,7 @@ 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_behind(struct klist_node *n, struct klist_node *pos);
|
||||||
extern void klist_add_before(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);
|
||||||
|
@ -140,11 +140,11 @@ 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
|
* klist_add_behind - Init a klist_node and add it after an existing node
|
||||||
* @n: node we're adding.
|
* @n: node we're adding.
|
||||||
* @pos: node to put @n after
|
* @pos: node to put @n after
|
||||||
*/
|
*/
|
||||||
void klist_add_after(struct klist_node *n, struct klist_node *pos)
|
void klist_add_behind(struct klist_node *n, struct klist_node *pos)
|
||||||
{
|
{
|
||||||
struct klist *k = knode_klist(pos);
|
struct klist *k = knode_klist(pos);
|
||||||
|
|
||||||
@ -153,7 +153,7 @@ void klist_add_after(struct klist_node *n, struct klist_node *pos)
|
|||||||
list_add(&n->n_node, &pos->n_node);
|
list_add(&n->n_node, &pos->n_node);
|
||||||
spin_unlock(&k->k_lock);
|
spin_unlock(&k->k_lock);
|
||||||
}
|
}
|
||||||
EXPORT_SYMBOL_GPL(klist_add_after);
|
EXPORT_SYMBOL_GPL(klist_add_behind);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* klist_add_before - Init a klist_node and add it before an existing node
|
* klist_add_before - Init a klist_node and add it before an existing node
|
||||||
|
Loading…
x
Reference in New Issue
Block a user