Eric Lee / smarc-ti-linux-kernel

Download as
Browse Code ยป

Commit 0f9859ca92c9182bcb8f18c55cae1a04627cbb59

Authored by Ken Helias
Committed by Linus Torvalds
1 parent 1d023284c3
Exists in ti-lsk-linux-4.1.y and in 10 other branches dlt-processor-sdk-linux-03.00.00.04, processor-sdk-linux-02.00.01, smarc-ti-lsk-linux-4.1.y, smarct3x-processor-sdk-04.01.00.06, smarct3x-processor-sdk-linux-02.00.01, smarct3x-processor-sdk-linux-03.00.00.04, smarct4x-800-processor-sdk-linux-02.00.01, smarct4x-processor-sdk-04.01.00.06, smarct4x-processor-sdk-linux-02.00.01, smarct4x-processor-sdk-linux-03.00.00.04

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>

Showing 2 changed files with 4 additions and 4 deletions Side-by-side Diff

include/linux/klist.h
Diff comments   View file @ 0f9859c
... ... @@ -44,7 +44,7 @@
44 44  
45 45 extern void klist_add_tail(struct klist_node *n, struct klist *k);
46 46 extern void klist_add_head(struct klist_node *n, struct klist *k);
47   -extern void klist_add_after(struct klist_node *n, struct klist_node *pos);
  47 +extern void klist_add_behind(struct klist_node *n, struct klist_node *pos);
48 48 extern void klist_add_before(struct klist_node *n, struct klist_node *pos);
49 49  
50 50 extern void klist_del(struct klist_node *n);
... ... @@ -140,11 +140,11 @@
140 140 EXPORT_SYMBOL_GPL(klist_add_tail);
141 141  
142 142 /**
143   - * klist_add_after - Init a klist_node and add it after an existing node
  143 + * klist_add_behind - Init a klist_node and add it after an existing node
144 144 * @n: node we're adding.
145 145 * @pos: node to put @n after
146 146 */
147   -void klist_add_after(struct klist_node *n, struct klist_node *pos)
  147 +void klist_add_behind(struct klist_node *n, struct klist_node *pos)
148 148 {
149 149 struct klist *k = knode_klist(pos);
150 150  
... ... @@ -153,7 +153,7 @@
153 153 list_add(&n->n_node, &pos->n_node);
154 154 spin_unlock(&k->k_lock);
155 155 }
156   -EXPORT_SYMBOL_GPL(klist_add_after);
  156 +EXPORT_SYMBOL_GPL(klist_add_behind);
157 157  
158 158 /**
159 159 * klist_add_before - Init a klist_node and add it before an existing node