Kernel/linux-stable
1
0
Fork 0
mirror of https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git synced 2024-12-29 01:05:29 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

lib/lru_cache: fix spelling mistake "colision"->"collision"

Browse Source 
There is a spelling mistake in a literal string and in cariable names. 
Fix these.

Link: https://lkml.kernel.org/r/20240725093044.1742842-1-deshan@nfschina.com
Signed-off-by: Deshan Zhang <deshan@nfschina.com>
Cc: Christoph Böhmwalder <christoph.boehmwalder@linbit.com>
Cc: Lars Ellenberg <lars.ellenberg@linbit.com>
Cc: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
This commit is contained in:
Deshan Zhang 2024-07-25 17:30:45 +08:00 committed by Andrew Morton
parent fbe617af69
commit 9a42bfd255
2 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/linux/lru_cache.h
View File

@ -119,7 +119,7 @@ write intent log information, three of which are mentioned here.
*/ */
/* this defines an element in a tracked set /* this defines an element in a tracked set
* .colision is for hash table lookup. * .collision is for hash table lookup.
* When we process a new IO request, we know its sector, thus can deduce the * When we process a new IO request, we know its sector, thus can deduce the
* region number (label) easily. To do the label -> object lookup without a * region number (label) easily. To do the label -> object lookup without a
* full list walk, we use a simple hash table. * full list walk, we use a simple hash table.
@ -145,7 +145,7 @@ write intent log information, three of which are mentioned here.
* But it avoids high order page allocations in kmalloc. * But it avoids high order page allocations in kmalloc.
*/ */
struct lc_element { struct lc_element {
struct hlist_node colision; struct hlist_node collision;
struct list_head list; /* LRU list or free list */ struct list_head list; /* LRU list or free list */
unsigned refcnt; unsigned refcnt;
/* back "pointer" into lc_cache->element[index], /* back "pointer" into lc_cache->element[index],

10
lib/lru_cache.c
View File

@ -243,7 +243,7 @@ static struct lc_element *__lc_find(struct lru_cache *lc, unsigned int enr,
BUG_ON(!lc); BUG_ON(!lc);
BUG_ON(!lc->nr_elements); BUG_ON(!lc->nr_elements);
hlist_for_each_entry(e, lc_hash_slot(lc, enr), colision) { hlist_for_each_entry(e, lc_hash_slot(lc, enr), collision) {
/* "about to be changed" elements, pending transaction commit, /* "about to be changed" elements, pending transaction commit,
* are hashed by their "new number". "Normal" elements have * are hashed by their "new number". "Normal" elements have
* lc_number == lc_new_number. */ * lc_number == lc_new_number. */
@ -303,7 +303,7 @@ void lc_del(struct lru_cache *lc, struct lc_element *e)
BUG_ON(e->refcnt); BUG_ON(e->refcnt);
e->lc_number = e->lc_new_number = LC_FREE; e->lc_number = e->lc_new_number = LC_FREE;
hlist_del_init(&e->colision); hlist_del_init(&e->collision);
list_move(&e->list, &lc->free); list_move(&e->list, &lc->free);
RETURN(); RETURN();
} }
@ -324,9 +324,9 @@ static struct lc_element *lc_prepare_for_change(struct lru_cache *lc, unsigned n
PARANOIA_LC_ELEMENT(lc, e); PARANOIA_LC_ELEMENT(lc, e);
e->lc_new_number = new_number; e->lc_new_number = new_number;
if (!hlist_unhashed(&e->colision)) if (!hlist_unhashed(&e->collision))
__hlist_del(&e->colision); __hlist_del(&e->collision);
hlist_add_head(&e->colision, lc_hash_slot(lc, new_number)); hlist_add_head(&e->collision, lc_hash_slot(lc, new_number));
list_move(&e->list, &lc->to_be_changed); list_move(&e->list, &lc->to_be_changed);
return e; return e;