aboutsummaryrefslogtreecommitdiffstats
path: root/lib
diff options
context:
space:
mode:
authorJames Bottomley <James.Bottomley@SteelEye.com>2005-08-19 09:14:01 -0400
committerGreg Kroah-Hartman <gregkh@suse.de>2005-09-05 19:03:13 -0400
commitd856f1e337782326c638c70c0b4df2b909350dec (patch)
tree15c070e3909cbd260b2616001f0a6dde4a0c24fa /lib
parentfef6ec8dd96205fb22e3cfe2e4abd69d89413631 (diff)
[PATCH] klist: fix klist to have the same klist_add semantics as list_head
at the moment, the list_head semantics are list_add(node, head) whereas current klist semantics are klist_add(head, node) This is bound to cause confusion, and since klist is the newcomer, it should follow the list_head semantics. I also added missing include guards to klist.h Signed-off-by: James Bottomley <James.Bottomley@SteelEye.com> Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
Diffstat (limited to 'lib')
-rw-r--r--lib/klist.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/klist.c b/lib/klist.c
index 738ab810160a..a70c836c5c4c 100644
--- a/lib/klist.c
+++ b/lib/klist.c
@@ -79,11 +79,11 @@ static void klist_node_init(struct klist * k, struct klist_node * n)
79 79
80/** 80/**
81 * klist_add_head - Initialize a klist_node and add it to front. 81 * klist_add_head - Initialize a klist_node and add it to front.
82 * @k: klist it's going on.
83 * @n: node we're adding. 82 * @n: node we're adding.
83 * @k: klist it's going on.
84 */ 84 */
85 85
86void klist_add_head(struct klist * k, struct klist_node * n) 86void klist_add_head(struct klist_node * n, struct klist * k)
87{ 87{
88 klist_node_init(k, n); 88 klist_node_init(k, n);
89 add_head(k, n); 89 add_head(k, n);
@@ -94,11 +94,11 @@ EXPORT_SYMBOL_GPL(klist_add_head);
94 94
95/** 95/**
96 * klist_add_tail - Initialize a klist_node and add it to back. 96 * klist_add_tail - Initialize a klist_node and add it to back.
97 * @k: klist it's going on.
98 * @n: node we're adding. 97 * @n: node we're adding.
98 * @k: klist it's going on.
99 */ 99 */
100 100
101void klist_add_tail(struct klist * k, struct klist_node * n) 101void klist_add_tail(struct klist_node * n, struct klist * k)
102{ 102{
103 klist_node_init(k, n); 103 klist_node_init(k, n);
104 add_tail(k, n); 104 add_tail(k, n);