Commit 79a1971c authored by Linus Torvalds's avatar Linus Torvalds
Browse files

mm: move the copy_one_pte() pte_present check into the caller 



This completes the split of the non-present and present pte cases by
moving the check for the source pte being present into the single
caller, which also means that we clearly separate out the very different
return value case for a non-present pte.

The present pte case currently always succeeds.

This is a pure code re-organization with no semantic change: the intent
is to make it much easier to add a new return case to the present pte
case for when we do early COW at page table copy time.

This was split out from the previous commit simply to make it easy to
visually see that there were no semantic changes from this code
re-organization.

Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent df3a57d1

mm/memory.c

+12 −12
Original line number Diff line number Diff line
@@ -773,8 +773,8 @@ copy_nonpresent_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm, 
	return 0;

}



static inline unsigned long

copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,

static inline void

copy_present_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,

		pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,

		unsigned long addr, int *rss)

{
@@ -782,12 +782,6 @@ copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm, 
	pte_t pte = *src_pte;

	struct page *page;



	/* pte contains position in swap or file, so copy. */

	if (unlikely(!pte_present(pte)))

		return copy_nonpresent_pte(dst_mm, src_mm,

					   dst_pte, src_pte, vma,

					   addr, rss);



	/*

	 * If it's a COW mapping, write protect it both

	 * in the parent and the child
@@ -821,7 +815,6 @@ copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm, 
	}



	set_pte_at(dst_mm, addr, dst_pte, pte);

	return 0;

}



static int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
@@ -863,11 +856,18 @@ again: 
			progress++;

			continue;

		}

		entry.val = copy_one_pte(dst_mm, src_mm, dst_pte, src_pte,

		if (unlikely(!pte_present(*src_pte))) {

			entry.val = copy_nonpresent_pte(dst_mm, src_mm,

							dst_pte, src_pte,

							vma, addr, rss);

			if (entry.val)

				break;

			progress += 8;

			continue;

		}

		copy_present_pte(dst_mm, src_mm, dst_pte, src_pte,

				 vma, addr, rss);

		progress += 8;

	} while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end);



	arch_leave_lazy_mmu_mode();

CRA Git | Maintained and supported by SUSTech CRA and CCSE