aboutsummaryrefslogtreecommitdiffstats
path: root/lib
diff options
context:
space:
mode:
authorTejun Heo <htejun@gmail.com>2008-04-22 05:58:46 -0400
committerGreg Kroah-Hartman <gregkh@suse.de>2008-04-30 19:52:47 -0400
commit93dd40013f4f7f4b18d19d0d77855f025bcc57c3 (patch)
tree81f61934013cbfbfec720e0798d13189571364b5 /lib
parent1da43e4a9ee942c9c967dbe8839476571df0c3ed (diff)
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: Tejun Heo <htejun@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
Diffstat (limited to 'lib')
-rw-r--r--lib/klist.c33
1 files changed, 33 insertions, 0 deletions
diff --git a/lib/klist.c b/lib/klist.c
index 120bd175aa78..ebba9488046e 100644
--- a/lib/klist.c
+++ b/lib/klist.c
@@ -120,6 +120,39 @@ void klist_add_tail(struct klist_node * n, struct klist * k)
120EXPORT_SYMBOL_GPL(klist_add_tail); 120EXPORT_SYMBOL_GPL(klist_add_tail);
121 121
122 122
123/**
124 * klist_add_after - Init a klist_node and add it after an existing node
125 * @n: node we're adding.
126 * @pos: node to put @n after
127 */
128void klist_add_after(struct klist_node *n, struct klist_node *pos)
129{
130 struct klist *k = pos->n_klist;
131
132 klist_node_init(k, n);
133 spin_lock(&k->k_lock);
134 list_add(&n->n_node, &pos->n_node);
135 spin_unlock(&k->k_lock);
136}
137EXPORT_SYMBOL_GPL(klist_add_after);
138
139/**
140 * klist_add_before - Init a klist_node and add it before an existing node
141 * @n: node we're adding.
142 * @pos: node to put @n after
143 */
144void klist_add_before(struct klist_node *n, struct klist_node *pos)
145{
146 struct klist *k = pos->n_klist;
147
148 klist_node_init(k, n);
149 spin_lock(&k->k_lock);
150 list_add_tail(&n->n_node, &pos->n_node);
151 spin_unlock(&k->k_lock);
152}
153EXPORT_SYMBOL_GPL(klist_add_before);
154
155
123static void klist_release(struct kref * kref) 156static void klist_release(struct kref * kref)
124{ 157{
125 struct klist_node * n = container_of(kref, struct klist_node, n_ref); 158 struct klist_node * n = container_of(kref, struct klist_node, n_ref);