diff options
| author | Jesper Dangaard Brouer | 2016-03-15 14:54:03 -0700 |
|---|---|---|
| committer | Linus Torvalds | 2016-03-15 16:55:16 -0700 |
| commit | 9f706d6820d3ea776d6b3fc0c1de9f81eb0d021b (patch) | |
| tree | b2978df1e40afd4178c183fb05aeb07d526e26f6 /include | |
| parent | ca257195511d536308700548de008b51729221eb (diff) | |
mm: fix some spelling
Fix up trivial spelling errors, noticed while reading the code.
Signed-off-by: Jesper Dangaard Brouer <brouer@redhat.com>
Cc: Christoph Lameter <cl@linux.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Joonsoo Kim <iamjoonsoo.kim@lge.com>
Cc: Vladimir Davydov <vdavydov@virtuozzo.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'include')
| -rw-r--r-- | include/linux/memcontrol.h | 2 | ||||
| -rw-r--r-- | include/linux/slab.h | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/include/linux/memcontrol.h b/include/linux/memcontrol.h index 792c8981e633..30b02e79610e 100644 --- a/include/linux/memcontrol.h +++ b/include/linux/memcontrol.h @@ -765,7 +765,7 @@ int __memcg_kmem_charge(struct page *page, gfp_t gfp, int order); void __memcg_kmem_uncharge(struct page *page, int order); /* - * helper for acessing a memcg's index. It will be used as an index in the + * helper for accessing a memcg's index. It will be used as an index in the * child cache array in kmem_cache, and also to derive its name. This function * will return -1 when this is not a kmem-limited memcg. */ diff --git a/include/linux/slab.h b/include/linux/slab.h index 9d9a5bdb9b00..5d49f0c60dcb 100644 --- a/include/linux/slab.h +++ b/include/linux/slab.h @@ -314,7 +314,7 @@ void *kmem_cache_alloc(struct kmem_cache *, gfp_t flags) __assume_slab_alignment void kmem_cache_free(struct kmem_cache *, void *); /* - * Bulk allocation and freeing operations. These are accellerated in an + * Bulk allocation and freeing operations. These are accelerated in an * allocator specific way to avoid taking locks repeatedly or building * metadata structures unnecessarily. * |