diff options
| author | Tejun Heo <htejun@gmail.com> | 2008-04-22 18:58:46 +0900 |
|---|---|---|
| committer | Greg Kroah-Hartman <gregkh@suse.de> | 2008-04-30 16:52:47 -0700 |
| commit | 93dd40013f4f7f4b18d19d0d77855f025bcc57c3 (patch) | |
| tree | 81f61934013cbfbfec720e0798d13189571364b5 /include/linux | |
| parent | 1da43e4a9ee942c9c967dbe8839476571df0c3ed (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 'include/linux')
| -rw-r--r-- | include/linux/klist.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/include/linux/klist.h b/include/linux/klist.h index a119c0da8977..b49385f13419 100644 --- a/include/linux/klist.h +++ b/include/linux/klist.h @@ -46,6 +46,8 @@ struct klist_node { 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_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_remove(struct klist_node * n); |