1 files changed, 33 insertions, 58 deletions
diff --git a/Documentation/vm/page_migration b/Documentation/vm/page_migration
index 0dd4ef30c361..0a5d5fb18854 100644
--- a/Documentation/vm/page_migration
+++ b/Documentation/vm/page_migration
@@ -62,15 +62,15 @@ A. In kernel use of migrate_pages()
   It also prevents the swapper or other scans to encounter
   the page.
-2. Generate a list of newly allocates page. These pages will contain the
+2. Generate a list of newly allocates pages. These pages will contain the
   contents of the pages from the first list after page migration is
   complete.
 3. The migrate_pages() function is called which attempts
   to do the migration. It returns the moved pages in the
   list specified as the third parameter and the failed
-   migrations in the fourth parameter. The first parameter
+   migrations in the fourth parameter. When the function
-   will contain the pages that could still be retried.
+   returns the first list will contain the pages that could still be retried.
 4. The leftover pages of various types are returned
   to the LRU using putback_to_lru_pages() or otherwise
@@ -93,83 +93,58 @@ Steps:
 2. Insure that writeback is complete.
-3. Make sure that the page has assigned swap cache entry if
+3. Prep the new page that we want to move to. It is locked
-   it is an anonyous page. The swap cache reference is necessary
-   to preserve the information contain in the page table maps while
-   page migration occurs.
-4. Prep the new page that we want to move to. It is locked
   and set to not being uptodate so that all accesses to the new
   page immediately lock while the move is in progress.
-5. All the page table references to the page are either dropped (file
+4. The new page is prepped with some settings from the old page so that
-   backed pages) or converted to swap references (anonymous pages).
+   accesses to the new page will discover a page with the correct settings.
-   This should decrease the reference count.
+5. All the page table references to the page are converted
+   to migration entries or dropped (nonlinear vmas).
+   This decrease the mapcount of a page. If the resulting
+   mapcount is not zero then we do not migrate the page.
+   All user space processes that attempt to access the page
+   will now wait on the page lock.
 6. The radix tree lock is taken. This will cause all processes trying
-   to reestablish a pte to block on the radix tree spinlock.
+   to access the page via the mapping to block on the radix tree spinlock.
 7. The refcount of the page is examined and we back out if references remain
   otherwise we know that we are the only one referencing this page.
 8. The radix tree is checked and if it does not contain the pointer to this
-   page then we back out because someone else modified the mapping first.
+   page then we back out because someone else modified the radix tree.
-9. The mapping is checked. If the mapping is gone then a truncate action may
-   be in progress and we back out.
-10. The new page is prepped with some settings from the old page so that
-   accesses to the new page will be discovered to have the correct settings.
-11. The radix tree is changed to point to the new page.
+9. The radix tree is changed to point to the new page.
-12. The reference count of the old page is dropped because the radix tree
+10. The reference count of the old page is dropped because the radix tree
-    reference is gone.
+    reference is gone. A reference to the new page is established because
+    the new page is referenced to by the radix tree.
-13. The radix tree lock is dropped. With that lookups become possible again
+11. The radix tree lock is dropped. With that lookups in the mapping
-    and other processes will move from spinning on the tree lock to sleeping on
+    become possible again. Processes will move from spinning on the tree_lock
-    the locked new page.
+    to sleeping on the locked new page.
-14. The page contents are copied to the new page.
+12. The page contents are copied to the new page.
-15. The remaining page flags are copied to the new page.
+13. The remaining page flags are copied to the new page.
-16. The old page flags are cleared to indicate that the page does
+14. The old page flags are cleared to indicate that the page does
-    not use any information anymore.
+    not provide any information anymore.
-17. Queued up writeback on the new page is triggered.
+15. Queued up writeback on the new page is triggered.
-18. If swap pte's were generated for the page then replace them with real
+16. If migration entries were page then replace them with real ptes. Doing
-    ptes. This will reenable access for processes not blocked by the page lock.
+    so will enable access for user space processes not already waiting for
+    the page lock.
 19. The page locks are dropped from the old and new page.
-    Processes waiting on the page lock can continue.
+    Processes waiting on the page lock will redo their page faults
+    and will reach the new page.
 20. The new page is moved to the LRU and can be scanned by the swapper
    etc again.
-TODO list
+Christoph Lameter, May 8, 2006.
---------
- Page migration requires the use of swap handles to preserve the
-  information of the anonymous page table entries. This means that swap
-  space is reserved but never used. The maximum number of swap handles used
-  is determined by CHUNK_SIZE (see mm/mempolicy.c) per ongoing migration.
-  Reservation of pages could be avoided by having a special type of swap
-  handle that does not require swap space and that would only track the page
-  references. Something like that was proposed by Marcelo Tosatti in the
-  past (search for migration cache on lkml or linux-mm@kvack.org).
- Page migration unmaps ptes for file backed pages and requires page
-  faults to reestablish these ptes. This could be optimized by somehow
-  recording the references before migration and then reestablish them later.
-  However, there are several locking challenges that have to be overcome
-  before this is possible.
- Page migration generates read ptes for anonymous pages. Dirty page
-  faults are required to make the pages writable again. It may be possible
-  to generate a pte marked dirty if it is known that the page is dirty and
-  that this process has the only reference to that page.
-Christoph Lameter, March 8, 2006.

diff --git a/Documentation/vm/page_migration b/Documentation/vm/page_migration index 0dd4ef30c361..0a5d5fb18854 100644 --- a/Documentation/vm/page_migration +++ b/Documentation/vm/page_migration
@@ -62,15 +62,15 @@ A. In kernel use of migrate_pages()
62	It also prevents the swapper or other scans to encounter	62	It also prevents the swapper or other scans to encounter
63	the page.	63	the page.
64		64
65	2. Generate a list of newly allocates page. These pages will contain the	65	2. Generate a list of newly allocates pages. These pages will contain the
66	contents of the pages from the first list after page migration is	66	contents of the pages from the first list after page migration is
67	complete.	67	complete.
68		68
69	3. The migrate_pages() function is called which attempts	69	3. The migrate_pages() function is called which attempts
70	to do the migration. It returns the moved pages in the	70	to do the migration. It returns the moved pages in the
71	list specified as the third parameter and the failed	71	list specified as the third parameter and the failed
72	migrations in the fourth parameter. The first parameter	72	migrations in the fourth parameter. When the function
73	will contain the pages that could still be retried.	73	returns the first list will contain the pages that could still be retried.
74		74
75	4. The leftover pages of various types are returned	75	4. The leftover pages of various types are returned
76	to the LRU using putback_to_lru_pages() or otherwise	76	to the LRU using putback_to_lru_pages() or otherwise
@@ -93,83 +93,58 @@ Steps:
93		93
94	2. Insure that writeback is complete.	94	2. Insure that writeback is complete.
95		95
96	3. Make sure that the page has assigned swap cache entry if	96	3. Prep the new page that we want to move to. It is locked
97	it is an anonyous page. The swap cache reference is necessary
98	to preserve the information contain in the page table maps while
99	page migration occurs.
100
101	4. Prep the new page that we want to move to. It is locked
102	and set to not being uptodate so that all accesses to the new	97	and set to not being uptodate so that all accesses to the new
103	page immediately lock while the move is in progress.	98	page immediately lock while the move is in progress.
104		99
105	5. All the page table references to the page are either dropped (file	100	4. The new page is prepped with some settings from the old page so that
106	backed pages) or converted to swap references (anonymous pages).	101	accesses to the new page will discover a page with the correct settings.
107	This should decrease the reference count.	102
		103	5. All the page table references to the page are converted
		104	to migration entries or dropped (nonlinear vmas).
		105	This decrease the mapcount of a page. If the resulting
		106	mapcount is not zero then we do not migrate the page.
		107	All user space processes that attempt to access the page
		108	will now wait on the page lock.
108		109
109	6. The radix tree lock is taken. This will cause all processes trying	110	6. The radix tree lock is taken. This will cause all processes trying
110	to reestablish a pte to block on the radix tree spinlock.	111	to access the page via the mapping to block on the radix tree spinlock.
111		112
112	7. The refcount of the page is examined and we back out if references remain	113	7. The refcount of the page is examined and we back out if references remain
113	otherwise we know that we are the only one referencing this page.	114	otherwise we know that we are the only one referencing this page.
114		115
115	8. The radix tree is checked and if it does not contain the pointer to this	116	8. The radix tree is checked and if it does not contain the pointer to this
116	page then we back out because someone else modified the mapping first.	117	page then we back out because someone else modified the radix tree.
117
118	9. The mapping is checked. If the mapping is gone then a truncate action may
119	be in progress and we back out.
120
121	10. The new page is prepped with some settings from the old page so that
122	accesses to the new page will be discovered to have the correct settings.
123		118
124	11. The radix tree is changed to point to the new page.	119	9. The radix tree is changed to point to the new page.
125		120
126	12. The reference count of the old page is dropped because the radix tree	121	10. The reference count of the old page is dropped because the radix tree
127	reference is gone.	122	reference is gone. A reference to the new page is established because
		123	the new page is referenced to by the radix tree.
128		124
129	13. The radix tree lock is dropped. With that lookups become possible again	125	11. The radix tree lock is dropped. With that lookups in the mapping
130	and other processes will move from spinning on the tree lock to sleeping on	126	become possible again. Processes will move from spinning on the tree_lock
131	the locked new page.	127	to sleeping on the locked new page.
132		128
133	14. The page contents are copied to the new page.	129	12. The page contents are copied to the new page.
134		130
135	15. The remaining page flags are copied to the new page.	131	13. The remaining page flags are copied to the new page.
136		132
137	16. The old page flags are cleared to indicate that the page does	133	14. The old page flags are cleared to indicate that the page does
138	not use any information anymore.	134	not provide any information anymore.
139		135
140	17. Queued up writeback on the new page is triggered.	136	15. Queued up writeback on the new page is triggered.
141		137
142	18. If swap pte's were generated for the page then replace them with real	138	16. If migration entries were page then replace them with real ptes. Doing
143	ptes. This will reenable access for processes not blocked by the page lock.	139	so will enable access for user space processes not already waiting for
		140	the page lock.
144		141
145	19. The page locks are dropped from the old and new page.	142	19. The page locks are dropped from the old and new page.
146	Processes waiting on the page lock can continue.	143	Processes waiting on the page lock will redo their page faults
		144	and will reach the new page.
147		145
148	20. The new page is moved to the LRU and can be scanned by the swapper	146	20. The new page is moved to the LRU and can be scanned by the swapper
149	etc again.	147	etc again.
150		148
151	TODO list	149	Christoph Lameter, May 8, 2006.
152	---------
153
154	- Page migration requires the use of swap handles to preserve the
155	information of the anonymous page table entries. This means that swap
156	space is reserved but never used. The maximum number of swap handles used
157	is determined by CHUNK_SIZE (see mm/mempolicy.c) per ongoing migration.
158	Reservation of pages could be avoided by having a special type of swap
159	handle that does not require swap space and that would only track the page
160	references. Something like that was proposed by Marcelo Tosatti in the
161	past (search for migration cache on lkml or linux-mm@kvack.org).
162
163	- Page migration unmaps ptes for file backed pages and requires page
164	faults to reestablish these ptes. This could be optimized by somehow
165	recording the references before migration and then reestablish them later.
166	However, there are several locking challenges that have to be overcome
167	before this is possible.
168
169	- Page migration generates read ptes for anonymous pages. Dirty page
170	faults are required to make the pages writable again. It may be possible
171	to generate a pte marked dirty if it is known that the page is dirty and
172	that this process has the only reference to that page.
173
174	Christoph Lameter, March 8, 2006.
175		150