Lines Matching refs:and

12 that is not directly accessible or addressable by the kernel and is
13 of unknown and possibly time-varying size.
18 and a disk access is avoided.
21 in Xen (using hypervisor memory) and zcache (using in-kernel compressed
22 memory) and other implementations are in development.
35 by the kernel and so may or may not still be in cleancache at any later time.
37 Cleancache has complete discretion over what pages to preserve and what
38 pages to discard and when.
43 (presumably about-to-be-evicted) page into cleancache and associate it with
44 the pool id, a file key, and a page index into the file.  (The combination
45 of a pool id, a file key, and an index is sometimes called a "handle".)
49 file; and, when a filesystem is unmounted, an "invalidate_fs" will invalidate
50 all pages in all files specified by the given pool id and also surrender
56 systems) that may share a clustered filesystem, and where cleancache
68 cleancache (shared or not), the page cache, and the filesystem, using
71 Note that cleancache must enforce put-put-get coherency and get-get
73 with different data, say AAA by the first put and BBB by the second, a
79 different Linux threads are simultaneously putting and invalidating a page
105 and thus disk reads.
107 Cleancache (and its sister code "frontswap") provide interfaces for
109 fast kernel-directly-addressable RAM and slower DMA/asynchronous devices.
111 is ideal when data is transformed to a different form and size (such
113 balancing for some RAM-like devices).  Evicted page-cache pages (and
115 faster-than-disk transcendent memory, and the cleancache (and frontswap)
116 "page-object-oriented" specification provides a nice way to read and
117 write -- and indirectly "name" -- the pages.
121 virtual machines.  This is really hard to do with RAM and efforts to
123 well-publicized special-case workloads).  Cleancache -- and frontswap --
128 virtual machines, but the pages can be compressed and deduplicated to
131 are the first to go, and cleancache allows those pages to be
132 saved and reclaimed if overall host system memory conditions allow.
141    filesystems and VFS? (Andrew Morton and Christoph Hellwig)
144 and the minimum set are placed precisely where needed to maintain
146 the page cache, and disk.  All hooks compile into nothingness if
147 cleancache is config'ed off and turn into a function-pointer-
153 Some filesystems are built entirely on top of VFS and the hooks
157 incomplete and one or more hooks in fs-specific code are required.
164 that untested filesystems are not affected, and the hooks in the
168 The total impact of the hooks to existing fs and mm files is only
169 about 40 lines added (not counting comments and blank lines).
171 3) Why not make cleancache asynchronous and batched so it can
176 on both the frontend and backend and also allows the backend to
177 do fancy things on-the-fly like page compression and
180 a great deal of race conditions and potential coherency issues
188 The main reason is to free up space in transcendent memory and
198 Performance analysis has been presented at OLS'09 and LCA'10.
201 overcommitted in a virtual workload); and because the hooks are
211 Filesystems that are well-behaved and conform to certain
215 and/or undergo extensive additional testing... or should just
228 - The FS must call the VFS superblock alloc and deactivate routines
245 inode unused list, and only invalidates the data page if the file
251 is potentially much larger than the kernel pagecache and is most