mirror of
https://github.com/torvalds/linux.git
synced 2026-11-06 21:58:01 +01:00
mm: fix typos in various comments
Fix spelling errors found by codespell in several mm source files: - "aray" -> "array" in include/linux/mm.h - "indiciate" -> "indicate" in include/linux/mm_types.h - "aggresive" -> "aggressive" in include/linux/mm_types.h - "progated" -> "propagated" in mm/huge_memory.c - "Pressumably" -> "Presumably" in mm/hugetlb.c - "fime" -> "time" in mm/hugetlb.c - "farest" -> "farthest" in mm/list_lru.c - "trivally" -> "trivially" in mm/madvise.c - "atmost" -> "at most" in mm/memcontrol.c - "splited" -> "split" in mm/memory-failure.c - "appliable" -> "applicable" in mm/memory.c - "incase" -> "in case" in mm/page_io.c - "contigous" -> "contiguous" in mm/vmalloc.c - "probablity" -> "probability" in mm/kfence/core.c - "possesss" -> "possesses" in mm/util.c No functional changes. Link: https://lore.kernel.org/20260922031843.2857104-1-hanzhijian1991@gmail.com Signed-off-by: Zhijian Han <hanzhijian1991@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
This commit is contained in:
parent
8290f45995
commit
c2d4ccfbba
|
|
@ -4601,7 +4601,7 @@ static inline void mmap_action_simple_ioremap(struct vm_area_desc *desc,
|
|||
* @desc: The VMA descriptor for the VMA requiring kernel pags to be mapped.
|
||||
* @start: The virtual address from which to map them.
|
||||
* @pages: An array of struct page pointers describing the memory to map.
|
||||
* @nr_pages: The number of entries in the @pages aray.
|
||||
* @nr_pages: The number of entries in the @pages array.
|
||||
*/
|
||||
static inline void mmap_action_map_kernel_pages(struct vm_area_desc *desc,
|
||||
unsigned long start, struct page **pages,
|
||||
|
|
|
|||
|
|
@ -759,7 +759,7 @@ static inline struct anon_vma_name *anon_vma_name_alloc(const char *name)
|
|||
/*
|
||||
* While __vma_enter_locked() is working to ensure are no read-locks held on a
|
||||
* VMA (either while acquiring a VMA write lock or marking a VMA detached) we
|
||||
* set the VM_REFCNT_EXCLUDE_READERS_FLAG in vma->vm_refcnt to indiciate to
|
||||
* set the VM_REFCNT_EXCLUDE_READERS_FLAG in vma->vm_refcnt to indicate to
|
||||
* vma_start_read() that the reference count should be left alone.
|
||||
*
|
||||
* See the comment describing vm_refcnt in vm_area_struct for details as to
|
||||
|
|
@ -1971,7 +1971,7 @@ enum {
|
|||
/*
|
||||
* MMF_HAS_PINNED: Whether this mm has pinned any pages. This can be either
|
||||
* replaced in the future by mm.pinned_vm when it becomes stable, or grow into
|
||||
* a counter on its own. We're aggresive on this bit for now: even if the
|
||||
* a counter on its own. We're aggressive on this bit for now: even if the
|
||||
* pinned pages were unpinned later on, we'll still keep this bit set for the
|
||||
* lifecycle of this mm, just for simplicity.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -3420,7 +3420,7 @@ static void __split_huge_pmd_locked(struct vm_area_struct *vma, pmd_t *pmd,
|
|||
swp_entry = make_readable_device_private_entry(
|
||||
page_to_pfn(page + i));
|
||||
/*
|
||||
* Young and dirty bits are not progated via swp_entry
|
||||
* Young and dirty bits are not propagated via swp_entry
|
||||
*/
|
||||
entry = swp_entry_to_pte(swp_entry);
|
||||
if (soft_dirty)
|
||||
|
|
|
|||
|
|
@ -5397,7 +5397,7 @@ void __unmap_hugepage_range(struct mmu_gather *tlb, struct vm_area_struct *vma,
|
|||
int rc = vma_needs_reservation(h, vma, address);
|
||||
|
||||
if (rc < 0)
|
||||
/* Pressumably allocate_file_region_entries failed
|
||||
/* Presumably allocate_file_region_entries failed
|
||||
* to allocate a file_region struct. Clear
|
||||
* hugetlb_restore_reserve so that global reserve
|
||||
* count will not be incremented by free_huge_folio.
|
||||
|
|
@ -5619,7 +5619,7 @@ static vm_fault_t hugetlb_wp(struct vm_fault *vmf)
|
|||
* In order to determine where this is a COW on a MAP_PRIVATE mapping it
|
||||
* is enough to check whether the old_folio is anonymous. This means that
|
||||
* the reserve for this address was consumed. If reserves were used, a
|
||||
* partial faulted mapping at the fime of fork() could consume its reserves
|
||||
* partial faulted mapping at the time of fork() could consume its reserves
|
||||
* on COW instead of the full address range.
|
||||
*/
|
||||
if (is_vma_resv_set(vma, HPAGE_RESV_OWNER) &&
|
||||
|
|
|
|||
|
|
@ -156,7 +156,7 @@ atomic_t kfence_allocation_gate = ATOMIC_INIT(1);
|
|||
* allocations of the same source filling up the pool.
|
||||
*
|
||||
* Assuming a range of 15%-85% unique allocations in the pool at any point in
|
||||
* time, the below parameters provide a probablity of 0.02-0.33 for false
|
||||
* time, the below parameters provide a probability of 0.02-0.33 for false
|
||||
* positive hits respectively:
|
||||
*
|
||||
* P(alloc_traces) = (1 - e^(-HNUM * (alloc_traces / SIZE)) ^ HNUM
|
||||
|
|
|
|||
|
|
@ -587,7 +587,7 @@ static int __memcg_list_lru_alloc(struct mem_cgroup *memcg,
|
|||
*/
|
||||
do {
|
||||
/*
|
||||
* Keep finding the farest parent that wasn't populated
|
||||
* Keep finding the farthest parent that wasn't populated
|
||||
* until found memcg itself.
|
||||
*/
|
||||
pos = memcg;
|
||||
|
|
|
|||
|
|
@ -1298,7 +1298,7 @@ static bool is_discard(int behavior)
|
|||
* We are restricted from madvise()'ing mseal()'d VMAs only in very particular
|
||||
* circumstances - discarding of data from read-only anonymous SEALED mappings.
|
||||
*
|
||||
* This is because users cannot trivally discard data from these VMAs, and may
|
||||
* This is because users cannot trivially discard data from these VMAs, and may
|
||||
* only do so via an appropriate madvise() call.
|
||||
*/
|
||||
static bool can_madvise_modify(struct madvise_behavior *madv_behavior)
|
||||
|
|
|
|||
|
|
@ -741,7 +741,7 @@ static unsigned long *memcg_events_local_array(struct mem_cgroup *memcg)
|
|||
*
|
||||
* 2) Flush the stats synchronously on reader side only when there are more than
|
||||
* (MEMCG_CHARGE_BATCH * nr_cpus) update events. Though this optimization
|
||||
* will let stats be out of sync by atmost (MEMCG_CHARGE_BATCH * nr_cpus) but
|
||||
* will let stats be out of sync by at most (MEMCG_CHARGE_BATCH * nr_cpus) but
|
||||
* only for 2 seconds due to (1).
|
||||
*/
|
||||
static void flush_memcg_stats_dwork(struct work_struct *w);
|
||||
|
|
|
|||
|
|
@ -2560,7 +2560,7 @@ int memory_failure(unsigned long pfn, int flags)
|
|||
/*
|
||||
* We're only intended to deal with the non-Compound page here.
|
||||
* The page cannot become compound pages again as folio has been
|
||||
* splited and extra refcnt is held.
|
||||
* split and extra refcnt is held.
|
||||
*/
|
||||
WARN_ON(folio_test_large(folio));
|
||||
|
||||
|
|
|
|||
|
|
@ -5069,7 +5069,7 @@ vm_fault_t do_swap_page(struct vm_fault *vmf)
|
|||
* have changed, so sub pages might got charged to the wrong cgroup,
|
||||
* or even should be shmem. So we have to free it and fallback.
|
||||
* Nothing should have touched it, both anon and shmem checks if a
|
||||
* large folio is fully appliable before use.
|
||||
* large folio is fully applicable before use.
|
||||
*
|
||||
* This will be removed once we unify folio allocation in the swap cache
|
||||
* layer, where allocation of a folio stabilizes the swap entries.
|
||||
|
|
|
|||
|
|
@ -135,7 +135,7 @@ static bool is_folio_zero_filled(struct folio *folio)
|
|||
for (i = 0; i < folio_nr_pages(folio); i++) {
|
||||
data = kmap_local_folio(folio, i * PAGE_SIZE);
|
||||
/*
|
||||
* Check last word first, incase the page is zero-filled at
|
||||
* Check last word first, in case the page is zero-filled at
|
||||
* the start and has non-zero data at the end, which is common
|
||||
* in real-world workloads.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -1240,7 +1240,7 @@ EXPORT_SYMBOL(__compat_vma_mmap);
|
|||
/**
|
||||
* compat_vma_mmap() - Apply the file's .mmap_prepare() hook to an
|
||||
* existing VMA and execute any requested actions.
|
||||
* @file: The file which possesss an f_op->mmap_prepare() hook.
|
||||
* @file: The file which possesses an f_op->mmap_prepare() hook.
|
||||
* @vma: The VMA to apply the .mmap_prepare() hook to.
|
||||
*
|
||||
* Ordinarily, .mmap_prepare() is invoked directly upon mmap(). However, certain
|
||||
|
|
|
|||
|
|
@ -3685,7 +3685,7 @@ vm_area_alloc_pages(gfp_t gfp, int nid,
|
|||
/*
|
||||
* Initially, attempt to have the page allocator give us large order
|
||||
* pages. Do not attempt allocating smaller than order chunks since
|
||||
* __vmap_pages_range() expects physically contigous pages of exactly
|
||||
* __vmap_pages_range() expects physically contiguous pages of exactly
|
||||
* order long chunks.
|
||||
*/
|
||||
while (large_order > order && nr_remaining) {
|
||||
|
|
|
|||
Loading…
Reference in New Issue
Block a user