Commit dc84207d authored by Bhaskar Chowdhury's avatar Bhaskar Chowdhury Committed by Linus Torvalds

mm/slub.c: trivial typo fixes

s/operatios/operations/
s/Mininum/Minimum/
s/mininum/minimum/  ......two different places.

Link: https://lkml.kernel.org/r/20210325044940.14516-1-unixbhaskar@gmail.comSigned-off-by: default avatarBhaskar Chowdhury <unixbhaskar@gmail.com>
Acked-by: default avatarRandy Dunlap <rdunlap@infradead.org>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent 1f0723a4
...@@ -3,7 +3,7 @@ ...@@ -3,7 +3,7 @@
* SLUB: A slab allocator that limits cache line use instead of queuing * SLUB: A slab allocator that limits cache line use instead of queuing
* objects in per cpu and per node lists. * objects in per cpu and per node lists.
* *
* The allocator synchronizes using per slab locks or atomic operatios * The allocator synchronizes using per slab locks or atomic operations
* and only uses a centralized lock to manage a pool of partial slabs. * and only uses a centralized lock to manage a pool of partial slabs.
* *
* (C) 2007 SGI, Christoph Lameter * (C) 2007 SGI, Christoph Lameter
...@@ -160,7 +160,7 @@ static inline bool kmem_cache_has_cpu_partial(struct kmem_cache *s) ...@@ -160,7 +160,7 @@ static inline bool kmem_cache_has_cpu_partial(struct kmem_cache *s)
#undef SLUB_DEBUG_CMPXCHG #undef SLUB_DEBUG_CMPXCHG
/* /*
* Mininum number of partial slabs. These will be left on the partial * Minimum number of partial slabs. These will be left on the partial
* lists even if they are empty. kmem_cache_shrink may reclaim them. * lists even if they are empty. kmem_cache_shrink may reclaim them.
*/ */
#define MIN_PARTIAL 5 #define MIN_PARTIAL 5
...@@ -833,7 +833,7 @@ static int check_bytes_and_report(struct kmem_cache *s, struct page *page, ...@@ -833,7 +833,7 @@ static int check_bytes_and_report(struct kmem_cache *s, struct page *page,
* *
* A. Free pointer (if we cannot overwrite object on free) * A. Free pointer (if we cannot overwrite object on free)
* B. Tracking data for SLAB_STORE_USER * B. Tracking data for SLAB_STORE_USER
* C. Padding to reach required alignment boundary or at mininum * C. Padding to reach required alignment boundary or at minimum
* one word if debugging is on to be able to detect writes * one word if debugging is on to be able to detect writes
* before the word boundary. * before the word boundary.
* *
...@@ -3422,7 +3422,7 @@ static unsigned int slub_min_objects; ...@@ -3422,7 +3422,7 @@ static unsigned int slub_min_objects;
* *
* Higher order allocations also allow the placement of more objects in a * Higher order allocations also allow the placement of more objects in a
* slab and thereby reduce object handling overhead. If the user has * slab and thereby reduce object handling overhead. If the user has
* requested a higher mininum order then we start with that one instead of * requested a higher minimum order then we start with that one instead of
* the smallest order which will fit the object. * the smallest order which will fit the object.
*/ */
static inline unsigned int slab_order(unsigned int size, static inline unsigned int slab_order(unsigned int size,
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment