tjh.dev / kernel
Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux
1
fork

Configure Feed

Select the types of activity you want to include in your feed.

mm: fix some typos and code style problems

fix some typos and code style problems in mm.

gfp.h: s/MAXNODES/MAX_NUMNODES
mmzone.h: s/then/than
rmap.c: s/__vma_split()/__vma_adjust()
swap.c: s/__mod_zone_page_stat/__mod_zone_page_state, s/is is/is
swap_state.c: s/whoes/whose
z3fold.c: code style problem fix in z3fold_unregister_migration
zsmalloc.c: s/of/or, s/give/given

Link: https://lkml.kernel.org/r/20210419083057.64820-1-luoshijie1@huawei.com
Signed-off-by: Shijie Luo <luoshijie1@huawei.com>
Signed-off-by: Miaohe Lin <linmiaohe@huawei.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>

authored by

Shijie Luo and committed by
Linus Torvalds cb152a1a b1989a3d

+9 -9
+1 -1
include/linux/gfp.h
··· 490 490 491 491 /* 492 492 * We get the zone list from the current node and the gfp_mask. 493 - * This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones. 493 + * This zone list contains a maximum of MAX_NUMNODES*MAX_NR_ZONES zones. 494 494 * There are two zonelists per node, one for all zones with memory and 495 495 * one containing just zones from the node the zonelist belongs to. 496 496 *
+1 -1
include/linux/mmzone.h
··· 55 55 * pageblocks to MIGRATE_CMA which can be done by 56 56 * __free_pageblock_cma() function. What is important though 57 57 * is that a range of pageblocks must be aligned to 58 - * MAX_ORDER_NR_PAGES should biggest page be bigger then 58 + * MAX_ORDER_NR_PAGES should biggest page be bigger than 59 59 * a single pageblock. 60 60 */ 61 61 MIGRATE_CMA,
+1 -1
mm/rmap.c
··· 257 257 * Attach the anon_vmas from src to dst. 258 258 * Returns 0 on success, -ENOMEM on failure. 259 259 * 260 - * anon_vma_clone() is called by __vma_split(), __split_vma(), copy_vma() and 260 + * anon_vma_clone() is called by __vma_adjust(), __split_vma(), copy_vma() and 261 261 * anon_vma_fork(). The first three want an exact copy of src, while the last 262 262 * one, anon_vma_fork(), may try to reuse an existing anon_vma to prevent 263 263 * endless growth of anon_vma. Since dst->anon_vma is set to NULL before call,
+2 -2
mm/swap.c
··· 496 496 if (unlikely(unevictable) && !TestSetPageMlocked(page)) { 497 497 int nr_pages = thp_nr_pages(page); 498 498 /* 499 - * We use the irq-unsafe __mod_zone_page_stat because this 499 + * We use the irq-unsafe __mod_zone_page_state because this 500 500 * counter is not modified from interrupt context, and the pte 501 501 * lock is held(spinlock), which implies preemption disabled. 502 502 */ ··· 808 808 * below which drains the page vectors. 809 809 * 810 810 * Let x, y, and z represent some system CPU numbers, where x < y < z. 811 - * Assume CPU #z is is in the middle of the for_each_online_cpu loop 811 + * Assume CPU #z is in the middle of the for_each_online_cpu loop 812 812 * below and has already reached CPU #y's per-cpu data. CPU #x comes 813 813 * along, adds some pages to its per-cpu vectors, then calls 814 814 * lru_add_drain_all().
+1 -1
mm/swap_state.c
··· 792 792 * 793 793 * Returns the struct page for entry and addr, after queueing swapin. 794 794 * 795 - * Primitive swap readahead code. We simply read in a few pages whoes 795 + * Primitive swap readahead code. We simply read in a few pages whose 796 796 * virtual addresses are around the fault address in the same vma. 797 797 * 798 798 * Caller must hold read mmap_lock if vmf->vma is not NULL.
+1 -1
mm/z3fold.c
··· 391 391 { 392 392 if (pool->inode) 393 393 iput(pool->inode); 394 - } 394 + } 395 395 396 396 /* Initializes the z3fold header of a newly allocated z3fold page */ 397 397 static struct z3fold_header *init_z3fold_page(struct page *page, bool headless,
+2 -2
mm/zsmalloc.c
··· 61 61 #define ZSPAGE_MAGIC 0x58 62 62 63 63 /* 64 - * This must be power of 2 and greater than of equal to sizeof(link_free). 64 + * This must be power of 2 and greater than or equal to sizeof(link_free). 65 65 * These two conditions ensure that any 'struct link_free' itself doesn't 66 66 * span more than 1 page which avoids complex case of mapping 2 pages simply 67 67 * to restore link_free pointer values. ··· 530 530 * class maintains a list of zspages where each zspage is divided 531 531 * into equal sized chunks. Each allocation falls into one of these 532 532 * classes depending on its size. This function returns index of the 533 - * size class which has chunk size big enough to hold the give size. 533 + * size class which has chunk size big enough to hold the given size. 534 534 */ 535 535 static int get_size_class_index(int size) 536 536 {