Compute contiguous empty PTEs for mTHP efficiently
Get series with b4
b4 am [email protected]Versions newest first
- v2 Latest2 patches 6 repliesIn review
Changes in v2 from the cover letter
- Break into two patches
Patches in v2 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/2 | mm: Make pte_range_none() return number of empty PTEsmm/ | +6 | 2 replies | |
| 2/2 | mm: Compute first_set_pte to eliminate evaluating redundant rangesmm/ | +18 | 4 replies |
Reviews trailers per patch
1 of 2 patches has a Reviewed-by or Acked-by.
| Patch | Baolin Wang | Barry Song |
|---|---|---|
| 1/2 | R-b | R-b |
| 2/2 |
Trailers given in replies are filled; those carried in the patches from earlier versions are outlined with dashes.
Cover letter [PATCH v2 0/2] Compute contiguous empty PTEs for mTHP efficiently
We use pte_range_none() to determine whether contiguous PTEs are empty for an mTHP allocation. Instead of iterating the while loop for every order, use some information from the previous iteration to eliminate some cases.
v1->v2:
- Break into two patches
v1: https://lore.kernel.org/all/[email protected]/
Dev Jain (2):
mm: Make pte_range_none() return number of empty PTEs
mm: Compute first_set_pte to eliminate evaluating redundant ranges
mm/memory.c | 30 +++++++++++++++++++++++------- 1 file changed, 23 insertions(+), 7 deletions(-)
Signature · 1 line
2.30.2