diff options
| author |   Simon Arlott <simon@fire.lp0.eux> | 2007-10-20 01:27:18 +0200 |
|---|---|---|
| committer |   Adrian Bunk <bunk@kernel.org> | 2007-10-20 01:27:18 +0200 |
| commit | 183ff22bb6bd8188c904ebfb479656ae52230b72 (patch) | |
| tree | 425207fc9cdca03df64ee8241ba764c75db4d8d1 /mm/prio_tree.c | |
| parent | spelling fixes: arch/x86_64/ (diff) | |
| download | linux-dev-183ff22bb6bd8188c904ebfb479656ae52230b72.tar.xz linux-dev-183ff22bb6bd8188c904ebfb479656ae52230b72.zip | |
spelling fixes: mm/
Spelling fixes in mm/.
Signed-off-by: Simon Arlott <simon@fire.lp0.eu>
Signed-off-by: Adrian Bunk <bunk@kernel.org>
Diffstat (limited to 'mm/prio_tree.c')
| -rw-r--r-- | mm/prio_tree.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/mm/prio_tree.c b/mm/prio_tree.c index b4e76c25f953..603ae98d9694 100644 --- a/mm/prio_tree.c +++ b/mm/prio_tree.c @@ -34,7 +34,7 @@ * Radix priority search tree for address_space->i_mmap * * For each vma that map a unique set of file pages i.e., unique [radix_index, - * heap_index] value, we have a corresponing priority search tree node. If + * heap_index] value, we have a corresponding priority search tree node. If * multiple vmas have identical [radix_index, heap_index] value, then one of * them is used as a tree node and others are stored in a vm_set list. The tree * node points to the first vma (head) of the list using vm_set.head. |