mirror of
https://github.com/torvalds/linux.git
synced 2024-11-22 12:11:40 +00:00
mm: kill frontswap
The only user of frontswap is zswap, and has been for a long time. Have swap call into zswap directly and remove the indirection. [hannes@cmpxchg.org: remove obsolete comment, per Yosry] Link: https://lkml.kernel.org/r/20230719142832.GA932528@cmpxchg.org [fengwei.yin@intel.com: don't warn if none swapcache folio is passed to zswap_load] Link: https://lkml.kernel.org/r/20230810095652.3905184-1-fengwei.yin@intel.com Link: https://lkml.kernel.org/r/20230717160227.GA867137@cmpxchg.org Signed-off-by: Johannes Weiner <hannes@cmpxchg.org> Signed-off-by: Yin Fengwei <fengwei.yin@intel.com> Acked-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com> Acked-by: Nhat Pham <nphamcs@gmail.com> Acked-by: Yosry Ahmed <yosryahmed@google.com> Acked-by: Christoph Hellwig <hch@lst.de> Cc: Domenico Cerasuolo <cerasuolodomenico@gmail.com> Cc: Matthew Wilcox (Oracle) <willy@infradead.org> Cc: Vitaly Wool <vitaly.wool@konsulko.com> Cc: Vlastimil Babka <vbabka@suse.cz> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
This commit is contained in:
Johannes Weiner
Andrew Morton
parent
b8cf32dc6e
commit
42c06a0e8e
@ -49,7 +49,7 @@ compressed pool.
|
||||
Design
|
||||
======
|
||||
|
||||
Zswap receives pages for compression through the Frontswap API and is able to
|
||||
Zswap receives pages for compression from the swap subsystem and is able to
|
||||
evict pages from its own compressed pool on an LRU basis and write them back to
|
||||
the backing swap device in the case that the compressed pool is full.
|
||||
|
||||
@ -70,19 +70,19 @@ means the compression ratio will always be 2:1 or worse (because of half-full
|
||||
zbud pages). The zsmalloc type zpool has a more complex compressed page
|
||||
storage method, and it can achieve greater storage densities.
|
||||
|
||||
When a swap page is passed from frontswap to zswap, zswap maintains a mapping
|
||||
When a swap page is passed from swapout to zswap, zswap maintains a mapping
|
||||
of the swap entry, a combination of the swap type and swap offset, to the zpool
|
||||
handle that references that compressed swap page. This mapping is achieved
|
||||
with a red-black tree per swap type. The swap offset is the search key for the
|
||||
tree nodes.
|
||||
|
||||
During a page fault on a PTE that is a swap entry, frontswap calls the zswap
|
||||
load function to decompress the page into the page allocated by the page fault
|
||||
handler.
|
||||
During a page fault on a PTE that is a swap entry, the swapin code calls the
|
||||
zswap load function to decompress the page into the page allocated by the page
|
||||
fault handler.
|
||||
|
||||
Once there are no PTEs referencing a swap page stored in zswap (i.e. the count
|
||||
in the swap_map goes to 0) the swap code calls the zswap invalidate function,
|
||||
via frontswap, to free the compressed entry.
|
||||
in the swap_map goes to 0) the swap code calls the zswap invalidate function
|
||||
to free the compressed entry.
|
||||
|
||||
Zswap seeks to be simple in its policies. Sysfs attributes allow for one user
|
||||
controlled policy:
|
||||
|
||||
@ -1,264 +0,0 @@
|
||||
=========
|
||||
Frontswap
|
||||
=========
|
||||
|
||||
Frontswap provides a "transcendent memory" interface for swap pages.
|
||||
In some environments, dramatic performance savings may be obtained because
|
||||
swapped pages are saved in RAM (or a RAM-like device) instead of a swap disk.
|
||||
|
||||
.. _Transcendent memory in a nutshell: https://lwn.net/Articles/454795/
|
||||
|
||||
Frontswap is so named because it can be thought of as the opposite of
|
||||
a "backing" store for a swap device. The storage is assumed to be
|
||||
a synchronous concurrency-safe page-oriented "pseudo-RAM device" conforming
|
||||
to the requirements of transcendent memory (such as Xen's "tmem", or
|
||||
in-kernel compressed memory, aka "zcache", or future RAM-like devices);
|
||||
this pseudo-RAM device is not directly accessible or addressable by the
|
||||
kernel and is of unknown and possibly time-varying size. The driver
|
||||
links itself to frontswap by calling frontswap_register_ops to set the
|
||||
frontswap_ops funcs appropriately and the functions it provides must
|
||||
conform to certain policies as follows:
|
||||
|
||||
An "init" prepares the device to receive frontswap pages associated
|
||||
with the specified swap device number (aka "type"). A "store" will
|
||||
copy the page to transcendent memory and associate it with the type and
|
||||
offset associated with the page. A "load" will copy the page, if found,
|
||||
from transcendent memory into kernel memory, but will NOT remove the page
|
||||
from transcendent memory. An "invalidate_page" will remove the page
|
||||
from transcendent memory and an "invalidate_area" will remove ALL pages
|
||||
associated with the swap type (e.g., like swapoff) and notify the "device"
|
||||
to refuse further stores with that swap type.
|
||||
|
||||
Once a page is successfully stored, a matching load on the page will normally
|
||||
succeed. So when the kernel finds itself in a situation where it needs
|
||||
to swap out a page, it first attempts to use frontswap. If the store returns
|
||||
success, the data has been successfully saved to transcendent memory and
|
||||
a disk write and, if the data is later read back, a disk read are avoided.
|
||||
If a store returns failure, transcendent memory has rejected the data, and the
|
||||
page can be written to swap as usual.
|
||||
|
||||
Note that if a page is stored and the page already exists in transcendent memory
|
||||
(a "duplicate" store), either the store succeeds and the data is overwritten,
|
||||
or the store fails AND the page is invalidated. This ensures stale data may
|
||||
never be obtained from frontswap.
|
||||
|
||||
If properly configured, monitoring of frontswap is done via debugfs in
|
||||
the `/sys/kernel/debug/frontswap` directory. The effectiveness of
|
||||
frontswap can be measured (across all swap devices) with:
|
||||
|
||||
``failed_stores``
|
||||
how many store attempts have failed
|
||||
|
||||
``loads``
|
||||
how many loads were attempted (all should succeed)
|
||||
|
||||
``succ_stores``
|
||||
how many store attempts have succeeded
|
||||
|
||||
``invalidates``
|
||||
how many invalidates were attempted
|
||||
|
||||
A backend implementation may provide additional metrics.
|
||||
|
||||
FAQ
|
||||
===
|
||||
|
||||
* Where's the value?
|
||||
|
||||
When a workload starts swapping, performance falls through the floor.
|
||||
Frontswap significantly increases performance in many such workloads by
|
||||
providing a clean, dynamic interface to read and write swap pages to
|
||||
"transcendent memory" that is otherwise not directly addressable to the kernel.
|
||||
This interface is ideal when data is transformed to a different form
|
||||
and size (such as with compression) or secretly moved (as might be
|
||||
useful for write-balancing for some RAM-like devices). Swap pages (and
|
||||
evicted page-cache pages) are a great use for this kind of slower-than-RAM-
|
||||
but-much-faster-than-disk "pseudo-RAM device".
|
||||
|
||||
Frontswap with a fairly small impact on the kernel,
|
||||
provides a huge amount of flexibility for more dynamic, flexible RAM
|
||||
utilization in various system configurations:
|
||||
|
||||
In the single kernel case, aka "zcache", pages are compressed and
|
||||
stored in local memory, thus increasing the total anonymous pages
|
||||
that can be safely kept in RAM. Zcache essentially trades off CPU
|
||||
cycles used in compression/decompression for better memory utilization.
|
||||
Benchmarks have shown little or no impact when memory pressure is
|
||||
low while providing a significant performance improvement (25%+)
|
||||
on some workloads under high memory pressure.
|
||||
|
||||
"RAMster" builds on zcache by adding "peer-to-peer" transcendent memory
|
||||
support for clustered systems. Frontswap pages are locally compressed
|
||||
as in zcache, but then "remotified" to another system's RAM. This
|
||||
allows RAM to be dynamically load-balanced back-and-forth as needed,
|
||||
i.e. when system A is overcommitted, it can swap to system B, and
|
||||
vice versa. RAMster can also be configured as a memory server so
|
||||
many servers in a cluster can swap, dynamically as needed, to a single
|
||||
server configured with a large amount of RAM... without pre-configuring
|
||||
how much of the RAM is available for each of the clients!
|
||||
|
||||
In the virtual case, the whole point of virtualization is to statistically
|
||||
multiplex physical resources across the varying demands of multiple
|
||||
virtual machines. This is really hard to do with RAM and efforts to do
|
||||
it well with no kernel changes have essentially failed (except in some
|
||||
well-publicized special-case workloads).
|
||||
Specifically, the Xen Transcendent Memory backend allows otherwise
|
||||
"fallow" hypervisor-owned RAM to not only be "time-shared" between multiple
|
||||
virtual machines, but the pages can be compressed and deduplicated to
|
||||
optimize RAM utilization. And when guest OS's are induced to surrender
|
||||
underutilized RAM (e.g. with "selfballooning"), sudden unexpected
|
||||
memory pressure may result in swapping; frontswap allows those pages
|
||||
to be swapped to and from hypervisor RAM (if overall host system memory
|
||||
conditions allow), thus mitigating the potentially awful performance impact
|
||||
of unplanned swapping.
|
||||
|
||||
A KVM implementation is underway and has been RFC'ed to lkml. And,
|
||||
using frontswap, investigation is also underway on the use of NVM as
|
||||
a memory extension technology.
|
||||
|
||||
* Sure there may be performance advantages in some situations, but
|
||||
what's the space/time overhead of frontswap?
|
||||
|
||||
If CONFIG_FRONTSWAP is disabled, every frontswap hook compiles into
|
||||
nothingness and the only overhead is a few extra bytes per swapon'ed
|
||||
swap device. If CONFIG_FRONTSWAP is enabled but no frontswap "backend"
|
||||
registers, there is one extra global variable compared to zero for
|
||||
every swap page read or written. If CONFIG_FRONTSWAP is enabled
|
||||
AND a frontswap backend registers AND the backend fails every "store"
|
||||
request (i.e. provides no memory despite claiming it might),
|
||||
CPU overhead is still negligible -- and since every frontswap fail
|
||||
precedes a swap page write-to-disk, the system is highly likely
|
||||
to be I/O bound and using a small fraction of a percent of a CPU
|
||||
will be irrelevant anyway.
|
||||
|
||||
As for space, if CONFIG_FRONTSWAP is enabled AND a frontswap backend
|
||||
registers, one bit is allocated for every swap page for every swap
|
||||
device that is swapon'd. This is added to the EIGHT bits (which
|
||||
was sixteen until about 2.6.34) that the kernel already allocates
|
||||
for every swap page for every swap device that is swapon'd. (Hugh
|
||||
Dickins has observed that frontswap could probably steal one of
|
||||
the existing eight bits, but let's worry about that minor optimization
|
||||
later.) For very large swap disks (which are rare) on a standard
|
||||
4K pagesize, this is 1MB per 32GB swap.
|
||||
|
||||
When swap pages are stored in transcendent memory instead of written
|
||||
out to disk, there is a side effect that this may create more memory
|
||||
pressure that can potentially outweigh the other advantages. A
|
||||
backend, such as zcache, must implement policies to carefully (but
|
||||
dynamically) manage memory limits to ensure this doesn't happen.
|
||||
|
||||
* OK, how about a quick overview of what this frontswap patch does
|
||||
in terms that a kernel hacker can grok?
|
||||
|
||||
Let's assume that a frontswap "backend" has registered during
|
||||
kernel initialization; this registration indicates that this
|
||||
frontswap backend has access to some "memory" that is not directly
|
||||
accessible by the kernel. Exactly how much memory it provides is
|
||||
entirely dynamic and random.
|
||||
|
||||
Whenever a swap-device is swapon'd frontswap_init() is called,
|
||||
passing the swap device number (aka "type") as a parameter.
|
||||
This notifies frontswap to expect attempts to "store" swap pages
|
||||
associated with that number.
|
||||
|
||||
Whenever the swap subsystem is readying a page to write to a swap
|
||||
device (c.f swap_writepage()), frontswap_store is called. Frontswap
|
||||
consults with the frontswap backend and if the backend says it does NOT
|
||||
have room, frontswap_store returns -1 and the kernel swaps the page
|
||||
to the swap device as normal. Note that the response from the frontswap
|
||||
backend is unpredictable to the kernel; it may choose to never accept a
|
||||
page, it could accept every ninth page, or it might accept every
|
||||
page. But if the backend does accept a page, the data from the page
|
||||
has already been copied and associated with the type and offset,
|
||||
and the backend guarantees the persistence of the data. In this case,
|
||||
frontswap sets a bit in the "frontswap_map" for the swap device
|
||||
corresponding to the page offset on the swap device to which it would
|
||||
otherwise have written the data.
|
||||
|
||||
When the swap subsystem needs to swap-in a page (swap_readpage()),
|
||||
it first calls frontswap_load() which checks the frontswap_map to
|
||||
see if the page was earlier accepted by the frontswap backend. If
|
||||
it was, the page of data is filled from the frontswap backend and
|
||||
the swap-in is complete. If not, the normal swap-in code is
|
||||
executed to obtain the page of data from the real swap device.
|
||||
|
||||
So every time the frontswap backend accepts a page, a swap device read
|
||||
and (potentially) a swap device write are replaced by a "frontswap backend
|
||||
store" and (possibly) a "frontswap backend loads", which are presumably much
|
||||
faster.
|
||||
|
||||
* Can't frontswap be configured as a "special" swap device that is
|
||||
just higher priority than any real swap device (e.g. like zswap,
|
||||
or maybe swap-over-nbd/NFS)?
|
||||
|
||||
No. First, the existing swap subsystem doesn't allow for any kind of
|
||||
swap hierarchy. Perhaps it could be rewritten to accommodate a hierarchy,
|
||||
but this would require fairly drastic changes. Even if it were
|
||||
rewritten, the existing swap subsystem uses the block I/O layer which
|
||||
assumes a swap device is fixed size and any page in it is linearly
|
||||
addressable. Frontswap barely touches the existing swap subsystem,
|
||||
and works around the constraints of the block I/O subsystem to provide
|
||||
a great deal of flexibility and dynamicity.
|
||||
|
||||
For example, the acceptance of any swap page by the frontswap backend is
|
||||
entirely unpredictable. This is critical to the definition of frontswap
|
||||
backends because it grants completely dynamic discretion to the
|
||||
backend. In zcache, one cannot know a priori how compressible a page is.
|
||||
"Poorly" compressible pages can be rejected, and "poorly" can itself be
|
||||
defined dynamically depending on current memory constraints.
|
||||
|
||||
Further, frontswap is entirely synchronous whereas a real swap
|
||||
device is, by definition, asynchronous and uses block I/O. The
|
||||
block I/O layer is not only unnecessary, but may perform "optimizations"
|
||||
that are inappropriate for a RAM-oriented device including delaying
|
||||
the write of some pages for a significant amount of time. Synchrony is
|
||||
required to ensure the dynamicity of the backend and to avoid thorny race
|
||||
conditions that would unnecessarily and greatly complicate frontswap
|
||||
and/or the block I/O subsystem. That said, only the initial "store"
|
||||
and "load" operations need be synchronous. A separate asynchronous thread
|
||||
is free to manipulate the pages stored by frontswap. For example,
|
||||
the "remotification" thread in RAMster uses standard asynchronous
|
||||
kernel sockets to move compressed frontswap pages to a remote machine.
|
||||
Similarly, a KVM guest-side implementation could do in-guest compression
|
||||
and use "batched" hypercalls.
|
||||
|
||||
In a virtualized environment, the dynamicity allows the hypervisor
|
||||
(or host OS) to do "intelligent overcommit". For example, it can
|
||||
choose to accept pages only until host-swapping might be imminent,
|
||||
then force guests to do their own swapping.
|
||||
|
||||
There is a downside to the transcendent memory specifications for
|
||||
frontswap: Since any "store" might fail, there must always be a real
|
||||
slot on a real swap device to swap the page. Thus frontswap must be
|
||||
implemented as a "shadow" to every swapon'd device with the potential
|
||||
capability of holding every page that the swap device might have held
|
||||
and the possibility that it might hold no pages at all. This means
|
||||
that frontswap cannot contain more pages than the total of swapon'd
|
||||
swap devices. For example, if NO swap device is configured on some
|
||||
installation, frontswap is useless. Swapless portable devices
|
||||
can still use frontswap but a backend for such devices must configure
|
||||
some kind of "ghost" swap device and ensure that it is never used.
|
||||
|
||||
* Why this weird definition about "duplicate stores"? If a page
|
||||
has been previously successfully stored, can't it always be
|
||||
successfully overwritten?
|
||||
|
||||
Nearly always it can, but no, sometimes it cannot. Consider an example
|
||||
where data is compressed and the original 4K page has been compressed
|
||||
to 1K. Now an attempt is made to overwrite the page with data that
|
||||
is non-compressible and so would take the entire 4K. But the backend
|
||||
has no more space. In this case, the store must be rejected. Whenever
|
||||
frontswap rejects a store that would overwrite, it also must invalidate
|
||||
the old data and ensure that it is no longer accessible. Since the
|
||||
swap subsystem then writes the new data to the read swap device,
|
||||
this is the correct course of action to ensure coherency.
|
||||
|
||||
* Why does the frontswap patch create the new include file swapfile.h?
|
||||
|
||||
The frontswap code depends on some swap-subsystem-internal data
|
||||
structures that have, over the years, moved back and forth between
|
||||
static and global. This seemed a reasonable compromise: Define
|
||||
them as global but declare them in a new include file that isn't
|
||||
included by the large number of source files that include swap.h.
|
||||
|
||||
Dan Magenheimer, last updated April 9, 2012
|
||||
@ -44,7 +44,6 @@ above structured documentation, or deleted if it has served its purpose.
|
||||
balance
|
||||
damon/index
|
||||
free_page_reporting
|
||||
frontswap
|
||||
hmm
|
||||
hwpoison
|
||||
hugetlbfs_reserv
|
||||
|
||||
@ -1,196 +0,0 @@
|
||||
:Original: Documentation/mm/frontswap.rst
|
||||
|
||||
:翻译:
|
||||
|
||||
司延腾 Yanteng Si <siyanteng@loongson.cn>
|
||||
|
||||
:校译:
|
||||
|
||||
=========
|
||||
Frontswap
|
||||
=========
|
||||
|
||||
Frontswap为交换页提供了一个 “transcendent memory” 的接口。在一些环境中，由
|
||||
于交换页被保存在RAM（或类似RAM的设备）中，而不是交换磁盘，因此可以获得巨大的性能
|
||||
节省（提高）。
|
||||
|
||||
.. _Transcendent memory in a nutshell: https://lwn.net/Articles/454795/
|
||||
|
||||
Frontswap之所以这么命名，是因为它可以被认为是与swap设备的“back”存储相反。存
|
||||
储器被认为是一个同步并发安全的面向页面的“伪RAM设备”，符合transcendent memory
|
||||
（如Xen的“tmem”，或内核内压缩内存，又称“zcache”，或未来的类似RAM的设备）的要
|
||||
求；这个伪RAM设备不能被内核直接访问或寻址，其大小未知且可能随时间变化。驱动程序通过
|
||||
调用frontswap_register_ops将自己与frontswap链接起来，以适当地设置frontswap_ops
|
||||
的功能，它提供的功能必须符合某些策略，如下所示:
|
||||
|
||||
一个 “init” 将设备准备好接收与指定的交换设备编号（又称“类型”）相关的frontswap
|
||||
交换页。一个 “store” 将把该页复制到transcendent memory，并与该页的类型和偏移
|
||||
量相关联。一个 “load” 将把该页，如果找到的话，从transcendent memory复制到内核
|
||||
内存，但不会从transcendent memory中删除该页。一个 “invalidate_page” 将从
|
||||
transcendent memory中删除该页，一个 “invalidate_area” 将删除所有与交换类型
|
||||
相关的页（例如，像swapoff）并通知 “device” 拒绝进一步存储该交换类型。
|
||||
|
||||
一旦一个页面被成功存储，在该页面上的匹配加载通常会成功。因此，当内核发现自己处于需
|
||||
要交换页面的情况时，它首先尝试使用frontswap。如果存储的结果是成功的，那么数据就已
|
||||
经成功的保存到了transcendent memory中，并且避免了磁盘写入，如果后来再读回数据，
|
||||
也避免了磁盘读取。如果存储返回失败，transcendent memory已经拒绝了该数据，且该页
|
||||
可以像往常一样被写入交换空间。
|
||||
|
||||
请注意，如果一个页面被存储，而该页面已经存在于transcendent memory中（一个 “重复”
|
||||
的存储），要么存储成功，数据被覆盖，要么存储失败，该页面被废止。这确保了旧的数据永远
|
||||
不会从frontswap中获得。
|
||||
|
||||
如果配置正确，对frontswap的监控是通过 `/sys/kernel/debug/frontswap` 目录下的
|
||||
debugfs完成的。frontswap的有效性可以通过以下方式测量（在所有交换设备中）:
|
||||
|
||||
``failed_stores``
|
||||
有多少次存储的尝试是失败的
|
||||
|
||||
``loads``
|
||||
尝试了多少次加载（应该全部成功）
|
||||
|
||||
``succ_stores``
|
||||
有多少次存储的尝试是成功的
|
||||
|
||||
``invalidates``
|
||||
尝试了多少次作废
|
||||
|
||||
后台实现可以提供额外的指标。
|
||||
|
||||
经常问到的问题
|
||||
==============
|
||||
|
||||
* 价值在哪里?
|
||||
|
||||
当一个工作负载开始交换时，性能就会下降。Frontswap通过提供一个干净的、动态的接口来
|
||||
读取和写入交换页到 “transcendent memory”，从而大大增加了许多这样的工作负载的性
|
||||
能，否则内核是无法直接寻址的。当数据被转换为不同的形式和大小（比如压缩）或者被秘密
|
||||
移动（对于一些类似RAM的设备来说，这可能对写平衡很有用）时，这个接口是理想的。交换
|
||||
页（和被驱逐的页面缓存页）是这种比RAM慢但比磁盘快得多的“伪RAM设备”的一大用途。
|
||||
|
||||
Frontswap对内核的影响相当小，为各种系统配置中更动态、更灵活的RAM利用提供了巨大的
|
||||
灵活性：
|
||||
|
||||
在单一内核的情况下，又称“zcache”，页面被压缩并存储在本地内存中，从而增加了可以安
|
||||
全保存在RAM中的匿名页面总数。Zcache本质上是用压缩/解压缩的CPU周期换取更好的内存利
|
||||
用率。Benchmarks测试显示，当内存压力较低时，几乎没有影响，而在高内存压力下的一些
|
||||
工作负载上，则有明显的性能改善（25%以上）。
|
||||
|
||||
“RAMster” 在zcache的基础上增加了对集群系统的 “peer-to-peer” transcendent memory
|
||||
的支持。Frontswap页面像zcache一样被本地压缩，但随后被“remotified” 到另一个系
|
||||
统的RAM。这使得RAM可以根据需要动态地来回负载平衡，也就是说，当系统A超载时，它可以
|
||||
交换到系统B，反之亦然。RAMster也可以被配置成一个内存服务器，因此集群中的许多服务器
|
||||
可以根据需要动态地交换到配置有大量内存的单一服务器上......而不需要预先配置每个客户
|
||||
有多少内存可用
|
||||
|
||||
在虚拟情况下，虚拟化的全部意义在于统计地将物理资源在多个虚拟机的不同需求之间进行复
|
||||
用。对于RAM来说，这真的很难做到，而且在不改变内核的情况下，要做好这一点的努力基本上
|
||||
是失败的（除了一些广为人知的特殊情况下的工作负载）。具体来说，Xen Transcendent Memory
|
||||
后端允许管理器拥有的RAM “fallow”，不仅可以在多个虚拟机之间进行“time-shared”，
|
||||
而且页面可以被压缩和重复利用，以优化RAM的利用率。当客户操作系统被诱导交出未充分利用
|
||||
的RAM时（如 “selfballooning”），突然出现的意外内存压力可能会导致交换；frontswap
|
||||
允许这些页面被交换到管理器RAM中或从管理器RAM中交换（如果整体主机系统内存条件允许），
|
||||
从而减轻计划外交换可能带来的可怕的性能影响。
|
||||
|
||||
一个KVM的实现正在进行中，并且已经被RFC'ed到lkml。而且，利用frontswap，对NVM作为
|
||||
内存扩展技术的调查也在进行中。
|
||||
|
||||
* 当然，在某些情况下可能有性能上的优势，但frontswap的空间/时间开销是多少？
|
||||
|
||||
如果 CONFIG_FRONTSWAP 被禁用，每个 frontswap 钩子都会编译成空，唯一的开销是每
|
||||
个 swapon'ed swap 设备的几个额外字节。如果 CONFIG_FRONTSWAP 被启用，但没有
|
||||
frontswap的 “backend” 寄存器，每读或写一个交换页就会有一个额外的全局变量，而不
|
||||
是零。如果 CONFIG_FRONTSWAP 被启用，并且有一个frontswap的backend寄存器，并且
|
||||
后端每次 “store” 请求都失败（即尽管声称可能，但没有提供内存），CPU 的开销仍然可以
|
||||
忽略不计 - 因为每次frontswap失败都是在交换页写到磁盘之前，系统很可能是 I/O 绑定
|
||||
的，无论如何使用一小部分的 CPU 都是不相关的。
|
||||
|
||||
至于空间，如果CONFIG_FRONTSWAP被启用，并且有一个frontswap的backend注册，那么
|
||||
每个交换设备的每个交换页都会被分配一个比特。这是在内核已经为每个交换设备的每个交换
|
||||
页分配的8位（在2.6.34之前是16位）上增加的。(Hugh Dickins观察到，frontswap可能
|
||||
会偷取现有的8个比特，但是我们以后再来担心这个小的优化问题)。对于标准的4K页面大小的
|
||||
非常大的交换盘（这很罕见），这是每32GB交换盘1MB开销。
|
||||
|
||||
当交换页存储在transcendent memory中而不是写到磁盘上时，有一个副作用，即这可能会
|
||||
产生更多的内存压力，有可能超过其他的优点。一个backend，比如zcache，必须实现策略
|
||||
来仔细（但动态地）管理内存限制，以确保这种情况不会发生。
|
||||
|
||||
* 好吧，那就用内核骇客能理解的术语来快速概述一下这个frontswap补丁的作用如何？
|
||||
|
||||
我们假设在内核初始化过程中，一个frontswap 的 “backend” 已经注册了；这个注册表
|
||||
明这个frontswap 的 “backend” 可以访问一些不被内核直接访问的“内存”。它到底提
|
||||
供了多少内存是完全动态和随机的。
|
||||
|
||||
每当一个交换设备被交换时，就会调用frontswap_init()，把交换设备的编号（又称“类
|
||||
型”）作为一个参数传给它。这就通知了frontswap，以期待 “store” 与该号码相关的交
|
||||
换页的尝试。
|
||||
|
||||
每当交换子系统准备将一个页面写入交换设备时（参见swap_writepage()），就会调用
|
||||
frontswap_store。Frontswap与frontswap backend协商，如果backend说它没有空
|
||||
间，frontswap_store返回-1，内核就会照常把页换到交换设备上。注意，来自frontswap
|
||||
backend的响应对内核来说是不可预测的；它可能选择从不接受一个页面，可能接受每九个
|
||||
页面，也可能接受每一个页面。但是如果backend确实接受了一个页面，那么这个页面的数
|
||||
据已经被复制并与类型和偏移量相关联了，而且backend保证了数据的持久性。在这种情况
|
||||
下，frontswap在交换设备的“frontswap_map” 中设置了一个位，对应于交换设备上的
|
||||
页面偏移量，否则它就会将数据写入该设备。
|
||||
|
||||
当交换子系统需要交换一个页面时（swap_readpage()），它首先调用frontswap_load()，
|
||||
检查frontswap_map，看这个页面是否早先被frontswap backend接受。如果是，该页
|
||||
的数据就会从frontswap后端填充，换入就完成了。如果不是，正常的交换代码将被执行，
|
||||
以便从真正的交换设备上获得这一页的数据。
|
||||
|
||||
所以每次frontswap backend接受一个页面时，交换设备的读取和（可能）交换设备的写
|
||||
入都被 “frontswap backend store” 和（可能）“frontswap backend loads”
|
||||
所取代，这可能会快得多。
|
||||
|
||||
* frontswap不能被配置为一个 “特殊的” 交换设备，它的优先级要高于任何真正的交换
|
||||
设备（例如像zswap，或者可能是swap-over-nbd/NFS）？
|
||||
|
||||
首先，现有的交换子系统不允许有任何种类的交换层次结构。也许它可以被重写以适应层次
|
||||
结构，但这将需要相当大的改变。即使它被重写，现有的交换子系统也使用了块I/O层，它
|
||||
假定交换设备是固定大小的，其中的任何页面都是可线性寻址的。Frontswap几乎没有触
|
||||
及现有的交换子系统，而是围绕着块I/O子系统的限制，提供了大量的灵活性和动态性。
|
||||
|
||||
例如，frontswap backend对任何交换页的接受是完全不可预测的。这对frontswap backend
|
||||
的定义至关重要，因为它赋予了backend完全动态的决定权。在zcache中，人们无法预
|
||||
先知道一个页面的可压缩性如何。可压缩性 “差” 的页面会被拒绝，而 “差” 本身也可
|
||||
以根据当前的内存限制动态地定义。
|
||||
|
||||
此外，frontswap是完全同步的，而真正的交换设备，根据定义，是异步的，并且使用
|
||||
块I/O。块I/O层不仅是不必要的，而且可能进行 “优化”，这对面向RAM的设备来说是
|
||||
不合适的，包括将一些页面的写入延迟相当长的时间。同步是必须的，以确保后端的动
|
||||
态性，并避免棘手的竞争条件，这将不必要地大大增加frontswap和/或块I/O子系统的
|
||||
复杂性。也就是说，只有最初的 “store” 和 “load” 操作是需要同步的。一个独立
|
||||
的异步线程可以自由地操作由frontswap存储的页面。例如，RAMster中的 “remotification”
|
||||
线程使用标准的异步内核套接字，将压缩的frontswap页面移动到远程机器。同样，
|
||||
KVM的客户方实现可以进行客户内压缩，并使用 “batched” hypercalls。
|
||||
|
||||
在虚拟化环境中，动态性允许管理程序（或主机操作系统）做“intelligent overcommit”。
|
||||
例如，它可以选择只接受页面，直到主机交换可能即将发生，然后强迫客户机做他们
|
||||
自己的交换。
|
||||
|
||||
transcendent memory规格的frontswap有一个坏处。因为任何 “store” 都可
|
||||
能失败，所以必须在一个真正的交换设备上有一个真正的插槽来交换页面。因此，
|
||||
frontswap必须作为每个交换设备的 “影子” 来实现，它有可能容纳交换设备可能
|
||||
容纳的每一个页面，也有可能根本不容纳任何页面。这意味着frontswap不能包含比
|
||||
swap设备总数更多的页面。例如，如果在某些安装上没有配置交换设备，frontswap
|
||||
就没有用。无交换设备的便携式设备仍然可以使用frontswap，但是这种设备的
|
||||
backend必须配置某种 “ghost” 交换设备，并确保它永远不会被使用。
|
||||
|
||||
|
||||
* 为什么会有这种关于 “重复存储” 的奇怪定义？如果一个页面以前被成功地存储过，
|
||||
难道它不能总是被成功地覆盖吗？
|
||||
|
||||
几乎总是可以的，不，有时不能。考虑一个例子，数据被压缩了，原来的4K页面被压
|
||||
缩到了1K。现在，有人试图用不可压缩的数据覆盖该页，因此会占用整个4K。但是
|
||||
backend没有更多的空间了。在这种情况下，这个存储必须被拒绝。每当frontswap
|
||||
拒绝一个会覆盖的存储时，它也必须使旧的数据作废，并确保它不再被访问。因为交
|
||||
换子系统会把新的数据写到读交换设备上，这是确保一致性的正确做法。
|
||||
|
||||
* 为什么frontswap补丁会创建新的头文件swapfile.h？
|
||||
|
||||
frontswap代码依赖于一些swap子系统内部的数据结构，这些数据结构多年来一直
|
||||
在静态和全局之间来回移动。这似乎是一个合理的妥协：将它们定义为全局，但在一
|
||||
个新的包含文件中声明它们，该文件不被包含swap.h的大量源文件所包含。
|
||||
|
||||
Dan Magenheimer，最后更新于2012年4月9日
|
||||
@ -42,7 +42,6 @@ Linux内存管理文档
|
||||
damon/index
|
||||
free_page_reporting
|
||||
ksm
|
||||
frontswap
|
||||
hmm
|
||||
hwpoison
|
||||
hugetlbfs_reserv
|
||||
|
||||
@ -8404,13 +8404,6 @@ F: Documentation/power/freezing-of-tasks.rst
|
||||
F: include/linux/freezer.h
|
||||
F: kernel/freezer.c
|
||||
|
||||
FRONTSWAP API
|
||||
M: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
|
||||
L: linux-kernel@vger.kernel.org
|
||||
S: Maintained
|
||||
F: include/linux/frontswap.h
|
||||
F: mm/frontswap.c
|
||||
|
||||
FS-CACHE: LOCAL CACHING FOR NETWORK FILESYSTEMS
|
||||
M: David Howells <dhowells@redhat.com>
|
||||
L: linux-cachefs@redhat.com (moderated for non-subscribers)
|
||||
|
||||
@ -17,6 +17,7 @@
|
||||
#ifdef CONFIG_CMA
|
||||
#include <linux/cma.h>
|
||||
#endif
|
||||
#include <linux/zswap.h>
|
||||
#include <asm/page.h>
|
||||
#include "internal.h"
|
||||
|
||||
|
||||
@ -1,91 +0,0 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0 */
|
||||
#ifndef _LINUX_FRONTSWAP_H
|
||||
#define _LINUX_FRONTSWAP_H
|
||||
|
||||
#include <linux/swap.h>
|
||||
#include <linux/mm.h>
|
||||
#include <linux/bitops.h>
|
||||
#include <linux/jump_label.h>
|
||||
|
||||
struct frontswap_ops {
|
||||
void (*init)(unsigned); /* this swap type was just swapon'ed */
|
||||
int (*store)(unsigned, pgoff_t, struct page *); /* store a page */
|
||||
int (*load)(unsigned, pgoff_t, struct page *, bool *); /* load a page */
|
||||
void (*invalidate_page)(unsigned, pgoff_t); /* page no longer needed */
|
||||
void (*invalidate_area)(unsigned); /* swap type just swapoff'ed */
|
||||
};
|
||||
|
||||
int frontswap_register_ops(const struct frontswap_ops *ops);
|
||||
|
||||
extern void frontswap_init(unsigned type, unsigned long *map);
|
||||
extern int __frontswap_store(struct page *page);
|
||||
extern int __frontswap_load(struct page *page);
|
||||
extern void __frontswap_invalidate_page(unsigned, pgoff_t);
|
||||
extern void __frontswap_invalidate_area(unsigned);
|
||||
|
||||
#ifdef CONFIG_FRONTSWAP
|
||||
extern struct static_key_false frontswap_enabled_key;
|
||||
|
||||
static inline bool frontswap_enabled(void)
|
||||
{
|
||||
return static_branch_unlikely(&frontswap_enabled_key);
|
||||
}
|
||||
|
||||
static inline void frontswap_map_set(struct swap_info_struct *p,
|
||||
unsigned long *map)
|
||||
{
|
||||
p->frontswap_map = map;
|
||||
}
|
||||
|
||||
static inline unsigned long *frontswap_map_get(struct swap_info_struct *p)
|
||||
{
|
||||
return p->frontswap_map;
|
||||
}
|
||||
#else
|
||||
/* all inline routines become no-ops and all externs are ignored */
|
||||
|
||||
static inline bool frontswap_enabled(void)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline void frontswap_map_set(struct swap_info_struct *p,
|
||||
unsigned long *map)
|
||||
{
|
||||
}
|
||||
|
||||
static inline unsigned long *frontswap_map_get(struct swap_info_struct *p)
|
||||
{
|
||||
return NULL;
|
||||
}
|
||||
#endif
|
||||
|
||||
static inline int frontswap_store(struct page *page)
|
||||
{
|
||||
if (frontswap_enabled())
|
||||
return __frontswap_store(page);
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
static inline int frontswap_load(struct page *page)
|
||||
{
|
||||
if (frontswap_enabled())
|
||||
return __frontswap_load(page);
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
static inline void frontswap_invalidate_page(unsigned type, pgoff_t offset)
|
||||
{
|
||||
if (frontswap_enabled())
|
||||
__frontswap_invalidate_page(type, offset);
|
||||
}
|
||||
|
||||
static inline void frontswap_invalidate_area(unsigned type)
|
||||
{
|
||||
if (frontswap_enabled())
|
||||
__frontswap_invalidate_area(type);
|
||||
}
|
||||
|
||||
#endif /* _LINUX_FRONTSWAP_H */
|
||||
@ -302,10 +302,6 @@ struct swap_info_struct {
|
||||
struct file *swap_file; /* seldom referenced */
|
||||
unsigned int old_block_size; /* seldom referenced */
|
||||
struct completion comp; /* seldom referenced */
|
||||
#ifdef CONFIG_FRONTSWAP
|
||||
unsigned long *frontswap_map; /* frontswap in-use, one bit per page */
|
||||
atomic_t frontswap_pages; /* frontswap pages in-use counter */
|
||||
#endif
|
||||
spinlock_t lock; /*
|
||||
* protect map scan related fields like
|
||||
* swap_map, lowest_bit, highest_bit,
|
||||
@ -630,11 +626,6 @@ static inline int mem_cgroup_swappiness(struct mem_cgroup *mem)
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef CONFIG_ZSWAP
|
||||
extern u64 zswap_pool_total_size;
|
||||
extern atomic_t zswap_stored_pages;
|
||||
#endif
|
||||
|
||||
#if defined(CONFIG_SWAP) && defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
|
||||
void __folio_throttle_swaprate(struct folio *folio, gfp_t gfp);
|
||||
static inline void folio_throttle_swaprate(struct folio *folio, gfp_t gfp)
|
||||
|
||||
@ -2,11 +2,6 @@
|
||||
#ifndef _LINUX_SWAPFILE_H
|
||||
#define _LINUX_SWAPFILE_H
|
||||
|
||||
/*
|
||||
* these were static in swapfile.c but frontswap.c needs them and we don't
|
||||
* want to expose them to the dozens of source files that include swap.h
|
||||
*/
|
||||
extern struct swap_info_struct *swap_info[];
|
||||
extern unsigned long generic_max_swapfile_size(void);
|
||||
unsigned long arch_max_swapfile_size(void);
|
||||
|
||||
|
||||
37
include/linux/zswap.h
Normal file
37
include/linux/zswap.h
Normal file
@ -0,0 +1,37 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0 */
|
||||
#ifndef _LINUX_ZSWAP_H
|
||||
#define _LINUX_ZSWAP_H
|
||||
|
||||
#include <linux/types.h>
|
||||
#include <linux/mm_types.h>
|
||||
|
||||
extern u64 zswap_pool_total_size;
|
||||
extern atomic_t zswap_stored_pages;
|
||||
|
||||
#ifdef CONFIG_ZSWAP
|
||||
|
||||
bool zswap_store(struct page *page);
|
||||
bool zswap_load(struct page *page);
|
||||
void zswap_invalidate(int type, pgoff_t offset);
|
||||
void zswap_swapon(int type);
|
||||
void zswap_swapoff(int type);
|
||||
|
||||
#else
|
||||
|
||||
static inline bool zswap_store(struct page *page)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline bool zswap_load(struct page *page)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline void zswap_invalidate(int type, pgoff_t offset) {}
|
||||
static inline void zswap_swapon(int type) {}
|
||||
static inline void zswap_swapoff(int type) {}
|
||||
|
||||
#endif
|
||||
|
||||
#endif /* _LINUX_ZSWAP_H */
|
||||
@ -25,7 +25,6 @@ menuconfig SWAP
|
||||
config ZSWAP
|
||||
bool "Compressed cache for swap pages"
|
||||
depends on SWAP
|
||||
select FRONTSWAP
|
||||
select CRYPTO
|
||||
select ZPOOL
|
||||
help
|
||||
@ -873,9 +872,6 @@ config USE_PERCPU_NUMA_NODE_ID
|
||||
config HAVE_SETUP_PER_CPU_AREA
|
||||
bool
|
||||
|
||||
config FRONTSWAP
|
||||
bool
|
||||
|
||||
config CMA
|
||||
bool "Contiguous Memory Allocator"
|
||||
depends on MMU
|
||||
|
||||
@ -72,7 +72,6 @@ ifdef CONFIG_MMU
|
||||
endif
|
||||
|
||||
obj-$(CONFIG_SWAP) += page_io.o swap_state.o swapfile.o swap_slots.o
|
||||
obj-$(CONFIG_FRONTSWAP) += frontswap.o
|
||||
obj-$(CONFIG_ZSWAP) += zswap.o
|
||||
obj-$(CONFIG_HAS_DMA) += dmapool.o
|
||||
obj-$(CONFIG_HUGETLBFS) += hugetlb.o
|
||||
|
||||
283
mm/frontswap.c
283
mm/frontswap.c
@ -1,283 +0,0 @@
|
||||
// SPDX-License-Identifier: GPL-2.0-only
|
||||
/*
|
||||
* Frontswap frontend
|
||||
*
|
||||
* This code provides the generic "frontend" layer to call a matching
|
||||
* "backend" driver implementation of frontswap. See
|
||||
* Documentation/mm/frontswap.rst for more information.
|
||||
*
|
||||
* Copyright (C) 2009-2012 Oracle Corp. All rights reserved.
|
||||
* Author: Dan Magenheimer
|
||||
*/
|
||||
|
||||
#include <linux/mman.h>
|
||||
#include <linux/swap.h>
|
||||
#include <linux/swapops.h>
|
||||
#include <linux/security.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/debugfs.h>
|
||||
#include <linux/frontswap.h>
|
||||
#include <linux/swapfile.h>
|
||||
|
||||
DEFINE_STATIC_KEY_FALSE(frontswap_enabled_key);
|
||||
|
||||
/*
|
||||
* frontswap_ops are added by frontswap_register_ops, and provide the
|
||||
* frontswap "backend" implementation functions. Multiple implementations
|
||||
* may be registered, but implementations can never deregister. This
|
||||
* is a simple singly-linked list of all registered implementations.
|
||||
*/
|
||||
static const struct frontswap_ops *frontswap_ops __read_mostly;
|
||||
|
||||
#ifdef CONFIG_DEBUG_FS
|
||||
/*
|
||||
* Counters available via /sys/kernel/debug/frontswap (if debugfs is
|
||||
* properly configured). These are for information only so are not protected
|
||||
* against increment races.
|
||||
*/
|
||||
static u64 frontswap_loads;
|
||||
static u64 frontswap_succ_stores;
|
||||
static u64 frontswap_failed_stores;
|
||||
static u64 frontswap_invalidates;
|
||||
|
||||
static inline void inc_frontswap_loads(void)
|
||||
{
|
||||
data_race(frontswap_loads++);
|
||||
}
|
||||
static inline void inc_frontswap_succ_stores(void)
|
||||
{
|
||||
data_race(frontswap_succ_stores++);
|
||||
}
|
||||
static inline void inc_frontswap_failed_stores(void)
|
||||
{
|
||||
data_race(frontswap_failed_stores++);
|
||||
}
|
||||
static inline void inc_frontswap_invalidates(void)
|
||||
{
|
||||
data_race(frontswap_invalidates++);
|
||||
}
|
||||
#else
|
||||
static inline void inc_frontswap_loads(void) { }
|
||||
static inline void inc_frontswap_succ_stores(void) { }
|
||||
static inline void inc_frontswap_failed_stores(void) { }
|
||||
static inline void inc_frontswap_invalidates(void) { }
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Due to the asynchronous nature of the backends loading potentially
|
||||
* _after_ the swap system has been activated, we have chokepoints
|
||||
* on all frontswap functions to not call the backend until the backend
|
||||
* has registered.
|
||||
*
|
||||
* This would not guards us against the user deciding to call swapoff right as
|
||||
* we are calling the backend to initialize (so swapon is in action).
|
||||
* Fortunately for us, the swapon_mutex has been taken by the callee so we are
|
||||
* OK. The other scenario where calls to frontswap_store (called via
|
||||
* swap_writepage) is racing with frontswap_invalidate_area (called via
|
||||
* swapoff) is again guarded by the swap subsystem.
|
||||
*
|
||||
* While no backend is registered all calls to frontswap_[store|load|
|
||||
* invalidate_area|invalidate_page] are ignored or fail.
|
||||
*
|
||||
* The time between the backend being registered and the swap file system
|
||||
* calling the backend (via the frontswap_* functions) is indeterminate as
|
||||
* frontswap_ops is not atomic_t (or a value guarded by a spinlock).
|
||||
* That is OK as we are comfortable missing some of these calls to the newly
|
||||
* registered backend.
|
||||
*
|
||||
* Obviously the opposite (unloading the backend) must be done after all
|
||||
* the frontswap_[store|load|invalidate_area|invalidate_page] start
|
||||
* ignoring or failing the requests. However, there is currently no way
|
||||
* to unload a backend once it is registered.
|
||||
*/
|
||||
|
||||
/*
|
||||
* Register operations for frontswap
|
||||
*/
|
||||
int frontswap_register_ops(const struct frontswap_ops *ops)
|
||||
{
|
||||
if (frontswap_ops)
|
||||
return -EINVAL;
|
||||
|
||||
frontswap_ops = ops;
|
||||
static_branch_inc(&frontswap_enabled_key);
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Called when a swap device is swapon'd.
|
||||
*/
|
||||
void frontswap_init(unsigned type, unsigned long *map)
|
||||
{
|
||||
struct swap_info_struct *sis = swap_info[type];
|
||||
|
||||
VM_BUG_ON(sis == NULL);
|
||||
|
||||
/*
|
||||
* p->frontswap is a bitmap that we MUST have to figure out which page
|
||||
* has gone in frontswap. Without it there is no point of continuing.
|
||||
*/
|
||||
if (WARN_ON(!map))
|
||||
return;
|
||||
/*
|
||||
* Irregardless of whether the frontswap backend has been loaded
|
||||
* before this function or it will be later, we _MUST_ have the
|
||||
* p->frontswap set to something valid to work properly.
|
||||
*/
|
||||
frontswap_map_set(sis, map);
|
||||
|
||||
if (!frontswap_enabled())
|
||||
return;
|
||||
frontswap_ops->init(type);
|
||||
}
|
||||
|
||||
static bool __frontswap_test(struct swap_info_struct *sis,
|
||||
pgoff_t offset)
|
||||
{
|
||||
if (sis->frontswap_map)
|
||||
return test_bit(offset, sis->frontswap_map);
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline void __frontswap_set(struct swap_info_struct *sis,
|
||||
pgoff_t offset)
|
||||
{
|
||||
set_bit(offset, sis->frontswap_map);
|
||||
atomic_inc(&sis->frontswap_pages);
|
||||
}
|
||||
|
||||
static inline void __frontswap_clear(struct swap_info_struct *sis,
|
||||
pgoff_t offset)
|
||||
{
|
||||
clear_bit(offset, sis->frontswap_map);
|
||||
atomic_dec(&sis->frontswap_pages);
|
||||
}
|
||||
|
||||
/*
|
||||
* "Store" data from a page to frontswap and associate it with the page's
|
||||
* swaptype and offset. Page must be locked and in the swap cache.
|
||||
* If frontswap already contains a page with matching swaptype and
|
||||
* offset, the frontswap implementation may either overwrite the data and
|
||||
* return success or invalidate the page from frontswap and return failure.
|
||||
*/
|
||||
int __frontswap_store(struct page *page)
|
||||
{
|
||||
int ret = -1;
|
||||
swp_entry_t entry = { .val = page_private(page), };
|
||||
int type = swp_type(entry);
|
||||
struct swap_info_struct *sis = swap_info[type];
|
||||
pgoff_t offset = swp_offset(entry);
|
||||
|
||||
VM_BUG_ON(!frontswap_ops);
|
||||
VM_BUG_ON(!PageLocked(page));
|
||||
VM_BUG_ON(sis == NULL);
|
||||
|
||||
/*
|
||||
* If a dup, we must remove the old page first; we can't leave the
|
||||
* old page no matter if the store of the new page succeeds or fails,
|
||||
* and we can't rely on the new page replacing the old page as we may
|
||||
* not store to the same implementation that contains the old page.
|
||||
*/
|
||||
if (__frontswap_test(sis, offset)) {
|
||||
__frontswap_clear(sis, offset);
|
||||
frontswap_ops->invalidate_page(type, offset);
|
||||
}
|
||||
|
||||
ret = frontswap_ops->store(type, offset, page);
|
||||
if (ret == 0) {
|
||||
__frontswap_set(sis, offset);
|
||||
inc_frontswap_succ_stores();
|
||||
} else {
|
||||
inc_frontswap_failed_stores();
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* "Get" data from frontswap associated with swaptype and offset that were
|
||||
* specified when the data was put to frontswap and use it to fill the
|
||||
* specified page with data. Page must be locked and in the swap cache.
|
||||
*/
|
||||
int __frontswap_load(struct page *page)
|
||||
{
|
||||
int ret = -1;
|
||||
swp_entry_t entry = { .val = page_private(page), };
|
||||
int type = swp_type(entry);
|
||||
struct swap_info_struct *sis = swap_info[type];
|
||||
pgoff_t offset = swp_offset(entry);
|
||||
bool exclusive = false;
|
||||
|
||||
VM_BUG_ON(!frontswap_ops);
|
||||
VM_BUG_ON(!PageLocked(page));
|
||||
VM_BUG_ON(sis == NULL);
|
||||
|
||||
if (!__frontswap_test(sis, offset))
|
||||
return -1;
|
||||
|
||||
/* Try loading from each implementation, until one succeeds. */
|
||||
ret = frontswap_ops->load(type, offset, page, &exclusive);
|
||||
if (ret == 0) {
|
||||
inc_frontswap_loads();
|
||||
if (exclusive) {
|
||||
SetPageDirty(page);
|
||||
__frontswap_clear(sis, offset);
|
||||
}
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* Invalidate any data from frontswap associated with the specified swaptype
|
||||
* and offset so that a subsequent "get" will fail.
|
||||
*/
|
||||
void __frontswap_invalidate_page(unsigned type, pgoff_t offset)
|
||||
{
|
||||
struct swap_info_struct *sis = swap_info[type];
|
||||
|
||||
VM_BUG_ON(!frontswap_ops);
|
||||
VM_BUG_ON(sis == NULL);
|
||||
|
||||
if (!__frontswap_test(sis, offset))
|
||||
return;
|
||||
|
||||
frontswap_ops->invalidate_page(type, offset);
|
||||
__frontswap_clear(sis, offset);
|
||||
inc_frontswap_invalidates();
|
||||
}
|
||||
|
||||
/*
|
||||
* Invalidate all data from frontswap associated with all offsets for the
|
||||
* specified swaptype.
|
||||
*/
|
||||
void __frontswap_invalidate_area(unsigned type)
|
||||
{
|
||||
struct swap_info_struct *sis = swap_info[type];
|
||||
|
||||
VM_BUG_ON(!frontswap_ops);
|
||||
VM_BUG_ON(sis == NULL);
|
||||
|
||||
if (sis->frontswap_map == NULL)
|
||||
return;
|
||||
|
||||
frontswap_ops->invalidate_area(type);
|
||||
atomic_set(&sis->frontswap_pages, 0);
|
||||
bitmap_zero(sis->frontswap_map, sis->max);
|
||||
}
|
||||
|
||||
static int __init init_frontswap(void)
|
||||
{
|
||||
#ifdef CONFIG_DEBUG_FS
|
||||
struct dentry *root = debugfs_create_dir("frontswap", NULL);
|
||||
if (root == NULL)
|
||||
return -ENXIO;
|
||||
debugfs_create_u64("loads", 0444, root, &frontswap_loads);
|
||||
debugfs_create_u64("succ_stores", 0444, root, &frontswap_succ_stores);
|
||||
debugfs_create_u64("failed_stores", 0444, root,
|
||||
&frontswap_failed_stores);
|
||||
debugfs_create_u64("invalidates", 0444, root, &frontswap_invalidates);
|
||||
#endif
|
||||
return 0;
|
||||
}
|
||||
|
||||
module_init(init_frontswap);
|
||||
@ -19,12 +19,12 @@
|
||||
#include <linux/bio.h>
|
||||
#include <linux/swapops.h>
|
||||
#include <linux/writeback.h>
|
||||
#include <linux/frontswap.h>
|
||||
#include <linux/blkdev.h>
|
||||
#include <linux/psi.h>
|
||||
#include <linux/uio.h>
|
||||
#include <linux/sched/task.h>
|
||||
#include <linux/delayacct.h>
|
||||
#include <linux/zswap.h>
|
||||
#include "swap.h"
|
||||
|
||||
static void __end_swap_bio_write(struct bio *bio)
|
||||
@ -195,7 +195,7 @@ int swap_writepage(struct page *page, struct writeback_control *wbc)
|
||||
folio_unlock(folio);
|
||||
return ret;
|
||||
}
|
||||
if (frontswap_store(&folio->page) == 0) {
|
||||
if (zswap_store(&folio->page)) {
|
||||
folio_start_writeback(folio);
|
||||
folio_unlock(folio);
|
||||
folio_end_writeback(folio);
|
||||
@ -512,7 +512,7 @@ void swap_readpage(struct page *page, bool synchronous, struct swap_iocb **plug)
|
||||
}
|
||||
delayacct_swapin_start();
|
||||
|
||||
if (frontswap_load(page) == 0) {
|
||||
if (zswap_load(page)) {
|
||||
SetPageUptodate(page);
|
||||
unlock_page(page);
|
||||
} else if (data_race(sis->flags & SWP_FS_OPS)) {
|
||||
|
||||
@ -35,13 +35,13 @@
|
||||
#include <linux/memcontrol.h>
|
||||
#include <linux/poll.h>
|
||||
#include <linux/oom.h>
|
||||
#include <linux/frontswap.h>
|
||||
#include <linux/swapfile.h>
|
||||
#include <linux/export.h>
|
||||
#include <linux/swap_slots.h>
|
||||
#include <linux/sort.h>
|
||||
#include <linux/completion.h>
|
||||
#include <linux/suspend.h>
|
||||
#include <linux/zswap.h>
|
||||
|
||||
#include <asm/tlbflush.h>
|
||||
#include <linux/swapops.h>
|
||||
@ -95,7 +95,7 @@ static PLIST_HEAD(swap_active_head);
|
||||
static struct plist_head *swap_avail_heads;
|
||||
static DEFINE_SPINLOCK(swap_avail_lock);
|
||||
|
||||
struct swap_info_struct *swap_info[MAX_SWAPFILES];
|
||||
static struct swap_info_struct *swap_info[MAX_SWAPFILES];
|
||||
|
||||
static DEFINE_MUTEX(swapon_mutex);
|
||||
|
||||
@ -744,7 +744,7 @@ static void swap_range_free(struct swap_info_struct *si, unsigned long offset,
|
||||
swap_slot_free_notify = NULL;
|
||||
while (offset <= end) {
|
||||
arch_swap_invalidate_page(si->type, offset);
|
||||
frontswap_invalidate_page(si->type, offset);
|
||||
zswap_invalidate(si->type, offset);
|
||||
if (swap_slot_free_notify)
|
||||
swap_slot_free_notify(si->bdev, offset);
|
||||
offset++;
|
||||
@ -2343,11 +2343,10 @@ static void _enable_swap_info(struct swap_info_struct *p)
|
||||
|
||||
static void enable_swap_info(struct swap_info_struct *p, int prio,
|
||||
unsigned char *swap_map,
|
||||
struct swap_cluster_info *cluster_info,
|
||||
unsigned long *frontswap_map)
|
||||
struct swap_cluster_info *cluster_info)
|
||||
{
|
||||
if (IS_ENABLED(CONFIG_FRONTSWAP))
|
||||
frontswap_init(p->type, frontswap_map);
|
||||
zswap_swapon(p->type);
|
||||
|
||||
spin_lock(&swap_lock);
|
||||
spin_lock(&p->lock);
|
||||
setup_swap_info(p, prio, swap_map, cluster_info);
|
||||
@ -2390,7 +2389,6 @@ SYSCALL_DEFINE1(swapoff, const char __user *, specialfile)
|
||||
struct swap_info_struct *p = NULL;
|
||||
unsigned char *swap_map;
|
||||
struct swap_cluster_info *cluster_info;
|
||||
unsigned long *frontswap_map;
|
||||
struct file *swap_file, *victim;
|
||||
struct address_space *mapping;
|
||||
struct inode *inode;
|
||||
@ -2515,12 +2513,10 @@ SYSCALL_DEFINE1(swapoff, const char __user *, specialfile)
|
||||
p->swap_map = NULL;
|
||||
cluster_info = p->cluster_info;
|
||||
p->cluster_info = NULL;
|
||||
frontswap_map = frontswap_map_get(p);
|
||||
spin_unlock(&p->lock);
|
||||
spin_unlock(&swap_lock);
|
||||
arch_swap_invalidate_area(p->type);
|
||||
frontswap_invalidate_area(p->type);
|
||||
frontswap_map_set(p, NULL);
|
||||
zswap_swapoff(p->type);
|
||||
mutex_unlock(&swapon_mutex);
|
||||
free_percpu(p->percpu_cluster);
|
||||
p->percpu_cluster = NULL;
|
||||
@ -2528,7 +2524,6 @@ SYSCALL_DEFINE1(swapoff, const char __user *, specialfile)
|
||||
p->cluster_next_cpu = NULL;
|
||||
vfree(swap_map);
|
||||
kvfree(cluster_info);
|
||||
kvfree(frontswap_map);
|
||||
/* Destroy swap account information */
|
||||
swap_cgroup_swapoff(p->type);
|
||||
exit_swap_address_space(p->type);
|
||||
@ -2995,7 +2990,6 @@ SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags)
|
||||
unsigned long maxpages;
|
||||
unsigned char *swap_map = NULL;
|
||||
struct swap_cluster_info *cluster_info = NULL;
|
||||
unsigned long *frontswap_map = NULL;
|
||||
struct page *page = NULL;
|
||||
struct inode *inode = NULL;
|
||||
bool inced_nr_rotate_swap = false;
|
||||
@ -3135,11 +3129,6 @@ SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags)
|
||||
error = nr_extents;
|
||||
goto bad_swap_unlock_inode;
|
||||
}
|
||||
/* frontswap enabled? set up bit-per-page map for frontswap */
|
||||
if (IS_ENABLED(CONFIG_FRONTSWAP))
|
||||
frontswap_map = kvcalloc(BITS_TO_LONGS(maxpages),
|
||||
sizeof(long),
|
||||
GFP_KERNEL);
|
||||
|
||||
if ((swap_flags & SWAP_FLAG_DISCARD) &&
|
||||
p->bdev && bdev_max_discard_sectors(p->bdev)) {
|
||||
@ -3192,16 +3181,15 @@ SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags)
|
||||
if (swap_flags & SWAP_FLAG_PREFER)
|
||||
prio =
|
||||
(swap_flags & SWAP_FLAG_PRIO_MASK) >> SWAP_FLAG_PRIO_SHIFT;
|
||||
enable_swap_info(p, prio, swap_map, cluster_info, frontswap_map);
|
||||
enable_swap_info(p, prio, swap_map, cluster_info);
|
||||
|
||||
pr_info("Adding %uk swap on %s. Priority:%d extents:%d across:%lluk %s%s%s%s%s\n",
|
||||
pr_info("Adding %uk swap on %s. Priority:%d extents:%d across:%lluk %s%s%s%s\n",
|
||||
p->pages<<(PAGE_SHIFT-10), name->name, p->prio,
|
||||
nr_extents, (unsigned long long)span<<(PAGE_SHIFT-10),
|
||||
(p->flags & SWP_SOLIDSTATE) ? "SS" : "",
|
||||
(p->flags & SWP_DISCARDABLE) ? "D" : "",
|
||||
(p->flags & SWP_AREA_DISCARD) ? "s" : "",
|
||||
(p->flags & SWP_PAGE_DISCARD) ? "c" : "",
|
||||
(frontswap_map) ? "FS" : "");
|
||||
(p->flags & SWP_PAGE_DISCARD) ? "c" : "");
|
||||
|
||||
mutex_unlock(&swapon_mutex);
|
||||
atomic_inc(&proc_poll_event);
|
||||
@ -3231,7 +3219,6 @@ bad_swap:
|
||||
spin_unlock(&swap_lock);
|
||||
vfree(swap_map);
|
||||
kvfree(cluster_info);
|
||||
kvfree(frontswap_map);
|
||||
if (inced_nr_rotate_swap)
|
||||
atomic_dec(&nr_rotate_swap);
|
||||
if (swap_file)
|
||||
|
||||
159
mm/zswap.c
159
mm/zswap.c
@ -2,7 +2,7 @@
|
||||
/*
|
||||
* zswap.c - zswap driver file
|
||||
*
|
||||
* zswap is a backend for frontswap that takes pages that are in the process
|
||||
* zswap is a cache that takes pages that are in the process
|
||||
* of being swapped out and attempts to compress and store them in a
|
||||
* RAM-based memory pool. This can result in a significant I/O reduction on
|
||||
* the swap device and, in the case where decompressing from RAM is faster
|
||||
@ -20,7 +20,6 @@
|
||||
#include <linux/spinlock.h>
|
||||
#include <linux/types.h>
|
||||
#include <linux/atomic.h>
|
||||
#include <linux/frontswap.h>
|
||||
#include <linux/rbtree.h>
|
||||
#include <linux/swap.h>
|
||||
#include <linux/crypto.h>
|
||||
@ -28,7 +27,7 @@
|
||||
#include <linux/mempool.h>
|
||||
#include <linux/zpool.h>
|
||||
#include <crypto/acompress.h>
|
||||
|
||||
#include <linux/zswap.h>
|
||||
#include <linux/mm_types.h>
|
||||
#include <linux/page-flags.h>
|
||||
#include <linux/swapops.h>
|
||||
@ -1084,7 +1083,7 @@ static int zswap_get_swap_cache_page(swp_entry_t entry,
|
||||
*
|
||||
* This can be thought of as a "resumed writeback" of the page
|
||||
* to the swap device. We are basically resuming the same swap
|
||||
* writeback path that was intercepted with the frontswap_store()
|
||||
* writeback path that was intercepted with the zswap_store()
|
||||
* in the first place. After the page has been decompressed into
|
||||
* the swap cache, the compressed version stored by zswap can be
|
||||
* freed.
|
||||
@ -1224,13 +1223,11 @@ static void zswap_fill_page(void *ptr, unsigned long value)
|
||||
memset_l(page, value, PAGE_SIZE / sizeof(unsigned long));
|
||||
}
|
||||
|
||||
/*********************************
|
||||
* frontswap hooks
|
||||
**********************************/
|
||||
/* attempts to compress and store an single page */
|
||||
static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
struct page *page)
|
||||
bool zswap_store(struct page *page)
|
||||
{
|
||||
swp_entry_t swp = { .val = page_private(page), };
|
||||
int type = swp_type(swp);
|
||||
pgoff_t offset = swp_offset(swp);
|
||||
struct zswap_tree *tree = zswap_trees[type];
|
||||
struct zswap_entry *entry, *dupentry;
|
||||
struct scatterlist input, output;
|
||||
@ -1238,23 +1235,22 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
struct obj_cgroup *objcg = NULL;
|
||||
struct zswap_pool *pool;
|
||||
struct zpool *zpool;
|
||||
int ret;
|
||||
unsigned int dlen = PAGE_SIZE;
|
||||
unsigned long handle, value;
|
||||
char *buf;
|
||||
u8 *src, *dst;
|
||||
gfp_t gfp;
|
||||
int ret;
|
||||
|
||||
VM_WARN_ON_ONCE(!PageLocked(page));
|
||||
VM_WARN_ON_ONCE(!PageSwapCache(page));
|
||||
|
||||
/* THP isn't supported */
|
||||
if (PageTransHuge(page)) {
|
||||
ret = -EINVAL;
|
||||
goto reject;
|
||||
}
|
||||
if (PageTransHuge(page))
|
||||
return false;
|
||||
|
||||
if (!zswap_enabled || !tree) {
|
||||
ret = -ENODEV;
|
||||
goto reject;
|
||||
}
|
||||
if (!zswap_enabled || !tree)
|
||||
return false;
|
||||
|
||||
/*
|
||||
* XXX: zswap reclaim does not work with cgroups yet. Without a
|
||||
@ -1262,10 +1258,8 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
* local cgroup limits.
|
||||
*/
|
||||
objcg = get_obj_cgroup_from_page(page);
|
||||
if (objcg && !obj_cgroup_may_zswap(objcg)) {
|
||||
ret = -ENOMEM;
|
||||
if (objcg && !obj_cgroup_may_zswap(objcg))
|
||||
goto reject;
|
||||
}
|
||||
|
||||
/* reclaim space if needed */
|
||||
if (zswap_is_full()) {
|
||||
@ -1275,10 +1269,9 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
}
|
||||
|
||||
if (zswap_pool_reached_full) {
|
||||
if (!zswap_can_accept()) {
|
||||
ret = -ENOMEM;
|
||||
if (!zswap_can_accept())
|
||||
goto shrink;
|
||||
} else
|
||||
else
|
||||
zswap_pool_reached_full = false;
|
||||
}
|
||||
|
||||
@ -1286,7 +1279,6 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
entry = zswap_entry_cache_alloc(GFP_KERNEL);
|
||||
if (!entry) {
|
||||
zswap_reject_kmemcache_fail++;
|
||||
ret = -ENOMEM;
|
||||
goto reject;
|
||||
}
|
||||
|
||||
@ -1303,17 +1295,13 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
kunmap_atomic(src);
|
||||
}
|
||||
|
||||
if (!zswap_non_same_filled_pages_enabled) {
|
||||
ret = -EINVAL;
|
||||
if (!zswap_non_same_filled_pages_enabled)
|
||||
goto freepage;
|
||||
}
|
||||
|
||||
/* if entry is successfully added, it keeps the reference */
|
||||
entry->pool = zswap_pool_current_get();
|
||||
if (!entry->pool) {
|
||||
ret = -EINVAL;
|
||||
if (!entry->pool)
|
||||
goto freepage;
|
||||
}
|
||||
|
||||
/* compress */
|
||||
acomp_ctx = raw_cpu_ptr(entry->pool->acomp_ctx);
|
||||
@ -1333,19 +1321,17 @@ static int zswap_frontswap_store(unsigned type, pgoff_t offset,
|
||||
* synchronous in fact.
|
||||
* Theoretically, acomp supports users send multiple acomp requests in one
|
||||
* acomp instance, then get those requests done simultaneously. but in this
|
||||
* case, frontswap actually does store and load page by page, there is no
|
||||
* case, zswap actually does store and load page by page, there is no
|
||||
* existing method to send the second page before the first page is done
|
||||
* in one thread doing frontswap.
|
||||
* in one thread doing zwap.
|
||||
* but in different threads running on different cpu, we have different
|
||||
* acomp instance, so multiple threads can do (de)compression in parallel.
|
||||
*/
|
||||
ret = crypto_wait_req(crypto_acomp_compress(acomp_ctx->req), &acomp_ctx->wait);
|
||||
dlen = acomp_ctx->req->dlen;
|
||||
|
||||
if (ret) {
|
||||
ret = -EINVAL;
|
||||
if (ret)
|
||||
goto put_dstmem;
|
||||
}
|
||||
|
||||
/* store */
|
||||
zpool = zswap_find_zpool(entry);
|
||||
@ -1381,15 +1367,12 @@ insert_entry:
|
||||
|
||||
/* map */
|
||||
spin_lock(&tree->lock);
|
||||
do {
|
||||
ret = zswap_rb_insert(&tree->rbroot, entry, &dupentry);
|
||||
if (ret == -EEXIST) {
|
||||
zswap_duplicate_entry++;
|
||||
/* remove from rbtree */
|
||||
zswap_rb_erase(&tree->rbroot, dupentry);
|
||||
zswap_entry_put(tree, dupentry);
|
||||
}
|
||||
} while (ret == -EEXIST);
|
||||
while (zswap_rb_insert(&tree->rbroot, entry, &dupentry) == -EEXIST) {
|
||||
zswap_duplicate_entry++;
|
||||
/* remove from rbtree */
|
||||
zswap_rb_erase(&tree->rbroot, dupentry);
|
||||
zswap_entry_put(tree, dupentry);
|
||||
}
|
||||
if (entry->length) {
|
||||
spin_lock(&entry->pool->lru_lock);
|
||||
list_add(&entry->lru, &entry->pool->lru);
|
||||
@ -1402,7 +1385,7 @@ insert_entry:
|
||||
zswap_update_total_size();
|
||||
count_vm_event(ZSWPOUT);
|
||||
|
||||
return 0;
|
||||
return true;
|
||||
|
||||
put_dstmem:
|
||||
mutex_unlock(acomp_ctx->mutex);
|
||||
@ -1412,23 +1395,20 @@ freepage:
|
||||
reject:
|
||||
if (objcg)
|
||||
obj_cgroup_put(objcg);
|
||||
return ret;
|
||||
return false;
|
||||
|
||||
shrink:
|
||||
pool = zswap_pool_last_get();
|
||||
if (pool)
|
||||
queue_work(shrink_wq, &pool->shrink_work);
|
||||
ret = -ENOMEM;
|
||||
goto reject;
|
||||
}
|
||||
|
||||
/*
|
||||
* returns 0 if the page was successfully decompressed
|
||||
* return -1 on entry not found or error
|
||||
*/
|
||||
static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
struct page *page, bool *exclusive)
|
||||
bool zswap_load(struct page *page)
|
||||
{
|
||||
swp_entry_t swp = { .val = page_private(page), };
|
||||
int type = swp_type(swp);
|
||||
pgoff_t offset = swp_offset(swp);
|
||||
struct zswap_tree *tree = zswap_trees[type];
|
||||
struct zswap_entry *entry;
|
||||
struct scatterlist input, output;
|
||||
@ -1436,15 +1416,16 @@ static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
u8 *src, *dst, *tmp;
|
||||
struct zpool *zpool;
|
||||
unsigned int dlen;
|
||||
int ret;
|
||||
bool ret;
|
||||
|
||||
VM_WARN_ON_ONCE(!PageLocked(page));
|
||||
|
||||
/* find */
|
||||
spin_lock(&tree->lock);
|
||||
entry = zswap_entry_find_get(&tree->rbroot, offset);
|
||||
if (!entry) {
|
||||
/* entry was written back */
|
||||
spin_unlock(&tree->lock);
|
||||
return -1;
|
||||
return false;
|
||||
}
|
||||
spin_unlock(&tree->lock);
|
||||
|
||||
@ -1452,7 +1433,7 @@ static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
dst = kmap_atomic(page);
|
||||
zswap_fill_page(dst, entry->value);
|
||||
kunmap_atomic(dst);
|
||||
ret = 0;
|
||||
ret = true;
|
||||
goto stats;
|
||||
}
|
||||
|
||||
@ -1460,7 +1441,7 @@ static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
if (!zpool_can_sleep_mapped(zpool)) {
|
||||
tmp = kmalloc(entry->length, GFP_KERNEL);
|
||||
if (!tmp) {
|
||||
ret = -ENOMEM;
|
||||
ret = false;
|
||||
goto freeentry;
|
||||
}
|
||||
}
|
||||
@ -1481,7 +1462,8 @@ static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
sg_init_table(&output, 1);
|
||||
sg_set_page(&output, page, PAGE_SIZE, 0);
|
||||
acomp_request_set_params(acomp_ctx->req, &input, &output, entry->length, dlen);
|
||||
ret = crypto_wait_req(crypto_acomp_decompress(acomp_ctx->req), &acomp_ctx->wait);
|
||||
if (crypto_wait_req(crypto_acomp_decompress(acomp_ctx->req), &acomp_ctx->wait))
|
||||
WARN_ON(1);
|
||||
mutex_unlock(acomp_ctx->mutex);
|
||||
|
||||
if (zpool_can_sleep_mapped(zpool))
|
||||
@ -1489,16 +1471,16 @@ static int zswap_frontswap_load(unsigned type, pgoff_t offset,
|
||||
else
|
||||
kfree(tmp);
|
||||
|
||||
BUG_ON(ret);
|
||||
ret = true;
|
||||
stats:
|
||||
count_vm_event(ZSWPIN);
|
||||
if (entry->objcg)
|
||||
count_objcg_event(entry->objcg, ZSWPIN);
|
||||
freeentry:
|
||||
spin_lock(&tree->lock);
|
||||
if (!ret && zswap_exclusive_loads_enabled) {
|
||||
if (ret && zswap_exclusive_loads_enabled) {
|
||||
zswap_invalidate_entry(tree, entry);
|
||||
*exclusive = true;
|
||||
SetPageDirty(page);
|
||||
} else if (entry->length) {
|
||||
spin_lock(&entry->pool->lru_lock);
|
||||
list_move(&entry->lru, &entry->pool->lru);
|
||||
@ -1510,8 +1492,7 @@ freeentry:
|
||||
return ret;
|
||||
}
|
||||
|
||||
/* frees an entry in zswap */
|
||||
static void zswap_frontswap_invalidate_page(unsigned type, pgoff_t offset)
|
||||
void zswap_invalidate(int type, pgoff_t offset)
|
||||
{
|
||||
struct zswap_tree *tree = zswap_trees[type];
|
||||
struct zswap_entry *entry;
|
||||
@ -1528,8 +1509,22 @@ static void zswap_frontswap_invalidate_page(unsigned type, pgoff_t offset)
|
||||
spin_unlock(&tree->lock);
|
||||
}
|
||||
|
||||
/* frees all zswap entries for the given swap type */
|
||||
static void zswap_frontswap_invalidate_area(unsigned type)
|
||||
void zswap_swapon(int type)
|
||||
{
|
||||
struct zswap_tree *tree;
|
||||
|
||||
tree = kzalloc(sizeof(*tree), GFP_KERNEL);
|
||||
if (!tree) {
|
||||
pr_err("alloc failed, zswap disabled for swap type %d\n", type);
|
||||
return;
|
||||
}
|
||||
|
||||
tree->rbroot = RB_ROOT;
|
||||
spin_lock_init(&tree->lock);
|
||||
zswap_trees[type] = tree;
|
||||
}
|
||||
|
||||
void zswap_swapoff(int type)
|
||||
{
|
||||
struct zswap_tree *tree = zswap_trees[type];
|
||||
struct zswap_entry *entry, *n;
|
||||
@ -1547,29 +1542,6 @@ static void zswap_frontswap_invalidate_area(unsigned type)
|
||||
zswap_trees[type] = NULL;
|
||||
}
|
||||
|
||||
static void zswap_frontswap_init(unsigned type)
|
||||
{
|
||||
struct zswap_tree *tree;
|
||||
|
||||
tree = kzalloc(sizeof(*tree), GFP_KERNEL);
|
||||
if (!tree) {
|
||||
pr_err("alloc failed, zswap disabled for swap type %d\n", type);
|
||||
return;
|
||||
}
|
||||
|
||||
tree->rbroot = RB_ROOT;
|
||||
spin_lock_init(&tree->lock);
|
||||
zswap_trees[type] = tree;
|
||||
}
|
||||
|
||||
static const struct frontswap_ops zswap_frontswap_ops = {
|
||||
.store = zswap_frontswap_store,
|
||||
.load = zswap_frontswap_load,
|
||||
.invalidate_page = zswap_frontswap_invalidate_page,
|
||||
.invalidate_area = zswap_frontswap_invalidate_area,
|
||||
.init = zswap_frontswap_init
|
||||
};
|
||||
|
||||
/*********************************
|
||||
* debugfs functions
|
||||
**********************************/
|
||||
@ -1658,16 +1630,11 @@ static int zswap_setup(void)
|
||||
if (!shrink_wq)
|
||||
goto fallback_fail;
|
||||
|
||||
ret = frontswap_register_ops(&zswap_frontswap_ops);
|
||||
if (ret)
|
||||
goto destroy_wq;
|
||||
if (zswap_debugfs_init())
|
||||
pr_warn("debugfs initialization failed\n");
|
||||
zswap_init_state = ZSWAP_INIT_SUCCEED;
|
||||
return 0;
|
||||
|
||||
destroy_wq:
|
||||
destroy_workqueue(shrink_wq);
|
||||
fallback_fail:
|
||||
if (pool)
|
||||
zswap_pool_destroy(pool);
|
||||
|
||||
Loading…
Reference in New Issue
Block a user