aboutsummaryrefslogtreecommitdiff
path: root/mm/mempolicy.c
diff options
context:
space:
mode:
authorJustin P. Mattock <justinmattock@gmail.com>2011-03-01 15:06:02 +0100
committerJiri Kosina <jkosina@suse.cz>2011-03-01 15:47:58 +0100
commitae0e47f02aaedbfdd5e4bec73f79b714d758223d (patch)
tree348f99385f42a2f698bddb4ced3e6c472e5d68cc /mm/mempolicy.c
parentddf12286951aee1e7763112cf26629de3fabe6ae (diff)
Remove one to many n's in a word
Signed-off-by: Justin P. Mattock <justinmattock@gmail.com> Signed-off-by: Jiri Kosina <jkosina@suse.cz>
Diffstat (limited to 'mm/mempolicy.c')
-rw-r--r--mm/mempolicy.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/mm/mempolicy.c b/mm/mempolicy.c
index 368fc9d2361..a5d79958492 100644
--- a/mm/mempolicy.c
+++ b/mm/mempolicy.c
@@ -993,7 +993,7 @@ int do_migrate_pages(struct mm_struct *mm,
* most recent <s, d> pair that moved (s != d). If we find a pair
* that not only moved, but what's better, moved to an empty slot
* (d is not set in tmp), then we break out then, with that pair.
- * Otherwise when we finish scannng from_tmp, we at least have the
+ * Otherwise when we finish scanning from_tmp, we at least have the
* most recent <s, d> pair that moved. If we get all the way through
* the scan of tmp without finding any node that moved, much less
* moved to an empty node, then there is nothing left worth migrating.