diff options
| author | Uwe Kleine-König <u.kleine-koenig@pengutronix.de> | 2010-11-01 15:38:34 -0400 |
|---|---|---|
| committer | Jiri Kosina <jkosina@suse.cz> | 2010-11-01 15:38:34 -0400 |
| commit | b595076a180a56d1bb170e6eceda6eb9d76f4cd3 (patch) | |
| tree | bc01ec7283808013e0b8ce7713fd6fc40f810429 /mm | |
| parent | 6aaccece1c483f189f76f1282b3984ff4c7ecb0a (diff) | |
| download | linux-3.10-b595076a180a56d1bb170e6eceda6eb9d76f4cd3.tar.gz linux-3.10-b595076a180a56d1bb170e6eceda6eb9d76f4cd3.tar.bz2 linux-3.10-b595076a180a56d1bb170e6eceda6eb9d76f4cd3.zip | |
tree-wide: fix comment/printk typos
"gadget", "through", "command", "maintain", "maintain", "controller", "address",
"between", "initiali[zs]e", "instead", "function", "select", "already",
"equal", "access", "management", "hierarchy", "registration", "interest",
"relative", "memory", "offset", "already",
Signed-off-by: Uwe Kleine-König <u.kleine-koenig@pengutronix.de>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
Diffstat (limited to 'mm')
| -rw-r--r-- | mm/percpu.c | 2 | ||||
| -rw-r--r-- | mm/sparse-vmemmap.c | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/mm/percpu.c b/mm/percpu.c index efe816856a9..f715d01d5ba 100644 --- a/mm/percpu.c +++ b/mm/percpu.c @@ -258,7 +258,7 @@ static void __maybe_unused pcpu_next_pop(struct pcpu_chunk *chunk, /* * (Un)populated page region iterators. Iterate over (un)populated - * page regions betwen @start and @end in @chunk. @rs and @re should + * page regions between @start and @end in @chunk. @rs and @re should * be integer variables and will be set to start and end page index of * the current region. */ diff --git a/mm/sparse-vmemmap.c b/mm/sparse-vmemmap.c index 29d6cbffb28..64b984091ed 100644 --- a/mm/sparse-vmemmap.c +++ b/mm/sparse-vmemmap.c @@ -9,7 +9,7 @@ * * However, virtual mappings need a page table and TLBs. Many Linux * architectures already map their physical space using 1-1 mappings - * via TLBs. For those arches the virtual memmory map is essentially + * via TLBs. For those arches the virtual memory map is essentially * for free if we use the same page size as the 1-1 mappings. In that * case the overhead consists of a few additional pages that are * allocated to create a view of memory for vmemmap. |