提交 c60aa176 编写于 作者: H Hugh Dickins 提交者: Linus Torvalds

swapfile: swap allocation cycle if nonrot

Though attempting to find free clusters (Andrea), swap allocation has
always restarted its searches from the beginning of the swap area (sct),
to reduce seek times between swap pages, by not scattering them all over
the partition.

But on a solidstate swap device, seeks are cheap, and block remapping to
level the wear may be limited by zones: in that case it's better to cycle
around the whole partition.
Signed-off-by: NHugh Dickins <hugh@veritas.com>
Cc: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Nick Piggin <nickpiggin@yahoo.com.au>
Cc: David Woodhouse <dwmw2@infradead.org>
Cc: Jens Axboe <jens.axboe@oracle.com>
Cc: Matthew Wilcox <matthew@wil.cx>
Cc: Joern Engel <joern@logfs.org>
Cc: James Bottomley <James.Bottomley@HansenPartnership.com>
Cc: Donjun Shin <djshin90@gmail.com>
Cc: Tejun Heo <teheo@suse.de>
Signed-off-by: NAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
上级 20137a49
...@@ -169,6 +169,7 @@ static int wait_for_discard(void *word) ...@@ -169,6 +169,7 @@ static int wait_for_discard(void *word)
static inline unsigned long scan_swap_map(struct swap_info_struct *si) static inline unsigned long scan_swap_map(struct swap_info_struct *si)
{ {
unsigned long offset; unsigned long offset;
unsigned long scan_base;
unsigned long last_in_cluster = 0; unsigned long last_in_cluster = 0;
int latency_ration = LATENCY_LIMIT; int latency_ration = LATENCY_LIMIT;
int found_free_cluster = 0; int found_free_cluster = 0;
...@@ -181,10 +182,11 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si) ...@@ -181,10 +182,11 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si)
* all over the entire swap partition, so that we reduce * all over the entire swap partition, so that we reduce
* overall disk seek times between swap pages. -- sct * overall disk seek times between swap pages. -- sct
* But we do now try to find an empty cluster. -Andrea * But we do now try to find an empty cluster. -Andrea
* And we let swap pages go all over an SSD partition. Hugh
*/ */
si->flags += SWP_SCANNING; si->flags += SWP_SCANNING;
offset = si->cluster_next; scan_base = offset = si->cluster_next;
if (unlikely(!si->cluster_nr--)) { if (unlikely(!si->cluster_nr--)) {
if (si->pages - si->inuse_pages < SWAPFILE_CLUSTER) { if (si->pages - si->inuse_pages < SWAPFILE_CLUSTER) {
...@@ -206,7 +208,16 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si) ...@@ -206,7 +208,16 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si)
} }
spin_unlock(&swap_lock); spin_unlock(&swap_lock);
offset = si->lowest_bit; /*
* If seek is expensive, start searching for new cluster from
* start of partition, to minimize the span of allocated swap.
* But if seek is cheap, search from our current position, so
* that swap is allocated from all over the partition: if the
* Flash Translation Layer only remaps within limited zones,
* we don't want to wear out the first zone too quickly.
*/
if (!(si->flags & SWP_SOLIDSTATE))
scan_base = offset = si->lowest_bit;
last_in_cluster = offset + SWAPFILE_CLUSTER - 1; last_in_cluster = offset + SWAPFILE_CLUSTER - 1;
/* Locate the first empty (unaligned) cluster */ /* Locate the first empty (unaligned) cluster */
...@@ -228,6 +239,27 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si) ...@@ -228,6 +239,27 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si)
} }
offset = si->lowest_bit; offset = si->lowest_bit;
last_in_cluster = offset + SWAPFILE_CLUSTER - 1;
/* Locate the first empty (unaligned) cluster */
for (; last_in_cluster < scan_base; offset++) {
if (si->swap_map[offset])
last_in_cluster = offset + SWAPFILE_CLUSTER;
else if (offset == last_in_cluster) {
spin_lock(&swap_lock);
offset -= SWAPFILE_CLUSTER - 1;
si->cluster_next = offset;
si->cluster_nr = SWAPFILE_CLUSTER - 1;
found_free_cluster = 1;
goto checks;
}
if (unlikely(--latency_ration < 0)) {
cond_resched();
latency_ration = LATENCY_LIMIT;
}
}
offset = scan_base;
spin_lock(&swap_lock); spin_lock(&swap_lock);
si->cluster_nr = SWAPFILE_CLUSTER - 1; si->cluster_nr = SWAPFILE_CLUSTER - 1;
si->lowest_alloc = 0; si->lowest_alloc = 0;
...@@ -239,7 +271,7 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si) ...@@ -239,7 +271,7 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si)
if (!si->highest_bit) if (!si->highest_bit)
goto no_page; goto no_page;
if (offset > si->highest_bit) if (offset > si->highest_bit)
offset = si->lowest_bit; scan_base = offset = si->lowest_bit;
if (si->swap_map[offset]) if (si->swap_map[offset])
goto scan; goto scan;
...@@ -323,8 +355,18 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si) ...@@ -323,8 +355,18 @@ static inline unsigned long scan_swap_map(struct swap_info_struct *si)
latency_ration = LATENCY_LIMIT; latency_ration = LATENCY_LIMIT;
} }
} }
offset = si->lowest_bit;
while (++offset < scan_base) {
if (!si->swap_map[offset]) {
spin_lock(&swap_lock);
goto checks;
}
if (unlikely(--latency_ration < 0)) {
cond_resched();
latency_ration = LATENCY_LIMIT;
}
}
spin_lock(&swap_lock); spin_lock(&swap_lock);
goto checks;
no_page: no_page:
si->flags -= SWP_SCANNING; si->flags -= SWP_SCANNING;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册