Home
last modified time | relevance | path

Searched +full:cache +full:- +full:block (Results 1 – 25 of 1087) sorted by relevance

12345678910>>...44

/linux-6.8/arch/riscv/boot/dts/sophgo/
Dsg2042-cpus.dtsi1 // SPDX-License-Identifier: (GPL-2.0 OR MIT)
8 #address-cells = <1>;
9 #size-cells = <0>;
10 timebase-frequency = <50000000>;
12 cpu-map {
260 riscv,isa-base = "rv64i";
261 riscv,isa-extensions = "i", "m", "a", "f", "d", "c",
265 i-cache-block-size = <64>;
266 i-cache-size = <65536>;
267 i-cache-sets = <512>;
[all …]
/linux-6.8/Documentation/admin-guide/device-mapper/
Dcache.rst2 Cache title
8 dm-cache is a device mapper target written by Joe Thornber, Heinz
11 It aims to improve performance of a block device (eg, a spindle) by
15 This device-mapper solution allows us to insert this caching at
17 a thin-provisioning pool. Caching solutions that are integrated more
20 The target reuses the metadata library used in the thin-provisioning
23 The decision as to what data to migrate and when is left to a plug-in
32 Movement of the primary copy of a logical block from one
39 The origin device always contains a copy of the logical block, which
40 may be out of date or kept in sync with the copy on the cache device
[all …]
Dcache-policies.rst21 doesn't update states (eg, hit counts) for a block more than once
26 Overview of supplied cache replacement policies
30 ---------------
43 ---------------------------
47 The stochastic multi-queue (smq) policy addresses some of the problems
55 DM table that is using the cache target. Doing so will cause all of the
56 mq policy's hints to be dropped. Also, performance of the cache may
63 The mq policy used a lot of memory; 88 bytes per cache block on a 64
67 pointers. It avoids storing an explicit hit count for each block. It
68 has a 'hotspot' queue, rather than a pre-cache, which uses a quarter of
[all …]
Dwritecache.rst6 doesn't cache reads because reads are supposed to be cached in page cache
14 1. type of the cache device - "p" or "s"
15 - p - persistent memory
16 - s - SSD
18 3. the cache device
19 4. block size (4096 is recommended; the maximum block size is the page
25 offset from the start of cache device in 512-byte sectors
45 applicable only to persistent memory - use the FUA flag
49 applicable only to persistent memory - don't use the FUA
53 - some underlying devices perform better with fua, some
[all …]
Dera.rst2 dm-era
8 dm-era is a target that behaves similar to the linear target. In
11 maintains the current era as a monotonically increasing 32-bit
15 partially invalidating the contents of a cache to restore cache
21 era <metadata dev> <origin dev> <block size>
26 block size block size of origin data device, granularity that is
36 ----------
43 ------------------
48 ------------------
55 <metadata block size> <#used metadata blocks>/<#total metadata blocks>
[all …]
/linux-6.8/fs/squashfs/
Dcache.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Squashfs - a compressed read only filesystem for Linux
8 * cache.c
15 * This file implements a generic cache implementation used for both caches,
16 * plus functions layered ontop of the generic cache implementation to
19 * To avoid out of memory and fragmentation issues with vmalloc the cache
22 * It should be noted that the cache is not used for file datablocks, these
23 * are decompressed and cached in the page-cache in the normal way. The
24 * cache is only used to temporarily cache fragment and metadata blocks
29 * have been packed with it, these because of locality-of-reference may be read
[all …]
Dfile.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Squashfs - a compressed read only filesystem for Linux
14 * compressed fragment block (tail-end packed block). The compressed size
15 * of each datablock is stored in a block list contained within the
19 * larger), the code implements an index cache that caches the mapping from
20 * block index to datablock location on disk.
22 * The index cache allows Squashfs to handle large files (up to 1.75 TiB) while
23 * retaining a simple and space-efficient block list on disk. The cache
26 * The index cache is designed to be memory efficient, and by default uses
45 * Locate cache slot in range [offset, index] for specified inode. If
[all …]
/linux-6.8/fs/btrfs/
Dblock-group.c1 // SPDX-License-Identifier: GPL-2.0
7 #include "block-group.h"
8 #include "space-info.h"
9 #include "disk-io.h"
10 #include "free-space-cache.h"
11 #include "free-space-tree.h"
14 #include "ref-verify.h"
16 #include "tree-log.h"
17 #include "delalloc-space.h"
23 #include "extent-tree.h"
[all …]
Dblock-group.h1 /* SPDX-License-Identifier: GPL-2.0 */
6 #include "free-space-cache.h"
62 /* Block group flags set at runtime */
71 /* Does the block group need to be added to the free space tree? */
73 /* Indicate that the block group is placed on a sequential zone */
76 * Indicate that block group is in the list of new block groups of a
119 * The last committed used bytes of this block group, if the above @used
120 * is still the same as @commit_used, we don't need to update block
121 * group item of this block group.
125 * If the free space extent count exceeds this number, convert the block
[all …]
Dbackref.h1 /* SPDX-License-Identifier: GPL-2.0 */
12 #include "disk-io.h"
18 * The value must be non-negative and must not be 0, 1 (which is a common return
27 * continue. Can return BTRFS_ITERATE_EXTENT_INODES_STOP or any other non-zero
82 * commit roots when searching b+trees - this is a special case for
100 * cache which maps the logical address (bytenr) of leaves to an array
175 * Cache the sharedness result for the last few extents we have found,
183 * So keep a small cache with the lookup results for the extent pointed
184 * by the last few file extent items. This cache is checked, with a
260 * Now it only supports iteration of tree block in commit root.
[all …]
/linux-6.8/Documentation/admin-guide/
Dbcache.rst2 A block layer cache (bcache)
6 nice if you could use them as cache... Hence bcache.
11 This is the git repository of bcache-tools:
12 https://git.kernel.org/pub/scm/linux/kernel/git/colyli/bcache-tools.git/
17 It's designed around the performance characteristics of SSDs - it only allocates
18 in erase block sized buckets, and it uses a hybrid btree/log to track cached
20 designed to avoid random writes at all costs; it fills up an erase block
25 great lengths to protect your data - it reliably handles unclean shutdown. (It
29 Writeback caching can use most of the cache for buffering writes - writing
36 average is above the cutoff it will skip all IO from that task - instead of
[all …]
/linux-6.8/include/linux/
Dsysv_fs.h1 /* SPDX-License-Identifier: GPL-2.0 */
16 /* Block numbers are 24 bit, sometimes stored in 32 bit.
17 On Coherent FS, they are always stored in PDP-11 manner: the least
21 /* 0 is non-existent */
26 /* Xenix super-block data on disk */
27 #define XENIX_NICINOD 100 /* number of inode cache entries */
28 #define XENIX_NICFREE 100 /* number of free block list chunk entries */
32 /* the start of the free block list: */
34 sysv_zone_t s_free[XENIX_NICFREE]; /* first free block list chunk */
35 /* the cache of free inodes: */
[all …]
/linux-6.8/drivers/md/
Ddm-cache-target.c1 // SPDX-License-Identifier: GPL-2.0-only
9 #include "dm-bio-prison-v2.h"
10 #include "dm-bio-record.h"
11 #include "dm-cache-metadata.h"
12 #include "dm-io-tracker.h"
14 #include <linux/dm-io.h>
15 #include <linux/dm-kcopyd.h>
24 #define DM_MSG_PREFIX "cache"
27 "A percentage of time allocated for copying to and/or from cache");
29 /*----------------------------------------------------------------*/
[all …]
Ddm-bufio.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * Copyright (C) 2009-2011 Red Hat, Inc.
10 #include <linux/dm-bufio.h>
12 #include <linux/device-mapper.h>
13 #include <linux/dm-io.h>
65 * dm_buffer->list_mode
71 /*--------------------------------------------------------------*/
99 /*--------------*/
103 lru->cursor = NULL; in lru_init()
104 lru->count = 0; in lru_init()
[all …]
Ddm-cache-policy.h1 /* SPDX-License-Identifier: GPL-2.0-only */
11 #include "dm-cache-block-types.h"
13 #include <linux/device-mapper.h>
15 /*----------------------------------------------------------------*/
18 * The cache policy makes the important decisions about which blocks get to
19 * live on the faster cache device.
37 * The cache policy object. It is envisaged that this structure will be
47 * Find the location of a block.
49 * Must not block.
51 * Returns 0 if in cache (cblock will be set), -ENOENT if not, < 0 for
[all …]
/linux-6.8/arch/riscv/boot/dts/sifive/
Dfu540-c000.dtsi1 // SPDX-License-Identifier: (GPL-2.0 OR MIT)
2 /* Copyright (c) 2018-2019 SiFive, Inc */
4 /dts-v1/;
6 #include <dt-bindings/clock/sifive-fu540-prci.h>
9 #address-cells = <2>;
10 #size-cells = <2>;
11 compatible = "sifive,fu540-c000", "sifive,fu540";
23 #address-cells = <1>;
24 #size-cells = <0>;
28 i-cache-block-size = <64>;
[all …]
Dfu740-c000.dtsi1 // SPDX-License-Identifier: (GPL-2.0 OR MIT)
4 /dts-v1/;
6 #include <dt-bindings/clock/sifive-fu740-prci.h>
9 #address-cells = <2>;
10 #size-cells = <2>;
11 compatible = "sifive,fu740-c000", "sifive,fu740";
23 #address-cells = <1>;
24 #size-cells = <0>;
28 i-cache-block-size = <64>;
29 i-cache-sets = <128>;
[all …]
/linux-6.8/Documentation/devicetree/bindings/riscv/
Dcpus.yaml1 # SPDX-License-Identifier: (GPL-2.0 OR MIT)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
7 title: RISC-V CPUs
10 - Paul Walmsley <paul.walmsley@sifive.com>
11 - Palmer Dabbelt <palmer@sifive.com>
12 - Conor Dooley <conor@kernel.org>
15 This document uses some terminology common to the RISC-V community
19 mandated by the RISC-V ISA: a PC and some registers. This
27 - $ref: /schemas/cpu.yaml#
[all …]
/linux-6.8/fs/nilfs2/
Dalloc.c1 // SPDX-License-Identifier: GPL-2.0+
5 * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
21 * nilfs_palloc_groups_per_desc_block - get the number of groups that a group
22 * descriptor block can maintain
33 * nilfs_palloc_groups_count - get maximum number of groups
39 return 1UL << (BITS_PER_LONG - (inode->i_blkbits + 3 /* log2(8) */)); in nilfs_palloc_groups_count()
43 * nilfs_palloc_init_blockgroup - initialize private variables for allocator
51 mi->mi_bgl = kmalloc(sizeof(*mi->mi_bgl), GFP_NOFS); in nilfs_palloc_init_blockgroup()
52 if (!mi->mi_bgl) in nilfs_palloc_init_blockgroup()
53 return -ENOMEM; in nilfs_palloc_init_blockgroup()
[all …]
Dalloc.h1 /* SPDX-License-Identifier: GPL-2.0+ */
5 * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
19 * nilfs_palloc_entries_per_group - get the number of entries per group
23 * that a bitmap block can maintain.
28 return 1UL << (inode->i_blkbits + 3 /* log2(8 = CHAR_BITS) */); in nilfs_palloc_entries_per_group()
40 * nilfs_palloc_req - persistent allocator request and reply
42 * @pr_desc_bh: buffer head of the buffer containing block group descriptors
43 * @pr_bitmap_bh: buffer head of the buffer containing a block group bitmap
69 * struct nilfs_bh_assoc - block offset and buffer head association
70 * @blkoff: block offset
[all …]
/linux-6.8/Documentation/block/
Dwriteback_cache_control.rst2 Explicit volatile write back cache control
6 ------------
10 operating system before data actually has hit the non-volatile storage. This
12 system needs to force data out to the non-volatile storage when it performs
15 The Linux block layer provides two simple mechanisms that let filesystems
17 a forced cache flush, and the Force Unit Access (FUA) flag for requests.
20 Explicit cache flushes
21 ----------------------
24 the filesystem and will make sure the volatile cache of the storage device
26 guarantees that previously completed write requests are on non-volatile
[all …]
/linux-6.8/arch/riscv/boot/dts/thead/
Dth1520.dtsi1 // SPDX-License-Identifier: (GPL-2.0 OR MIT)
7 #include <dt-bindings/interrupt-controller/irq.h>
11 #address-cells = <2>;
12 #size-cells = <2>;
15 #address-cells = <1>;
16 #size-cells = <0>;
17 timebase-frequency = <3000000>;
23 riscv,isa-base = "rv64i";
24 riscv,isa-extensions = "i", "m", "a", "f", "d", "c", "zicntr", "zicsr",
27 i-cache-block-size = <64>;
[all …]
/linux-6.8/Documentation/filesystems/
Dsquashfs.rst1 .. SPDX-License-Identifier: GPL-2.0
7 Squashfs is a compressed read-only filesystem for Linux.
11 minimise data overhead. Block sizes greater than 4K are supported up to a
12 maximum of 1Mbytes (default block size 128K).
14 Squashfs is intended for general read-only filesystem use, for archival
16 block device/memory systems (e.g. embedded systems) where low overhead is
19 Mailing list: squashfs-devel@lists.sourceforge.net
23 ----------------------
35 Max block size 1 MiB 4 KiB
39 Tail-end packing (fragments) yes no
[all …]
/linux-6.8/fs/affs/
Dfile.c1 // SPDX-License-Identifier: GPL-2.0
5 * (c) 1996 Hans-Joachim Widmaier - Rewritten
7 * (C) 1993 Ray Burr - Modified for Amiga FFS filesystem.
11 * (C) 1991 Linus Torvalds - minix filesystem
27 inode->i_ino, atomic_read(&AFFS_I(inode)->i_opencnt)); in affs_file_open()
28 atomic_inc(&AFFS_I(inode)->i_opencnt); in affs_file_open()
36 inode->i_ino, atomic_read(&AFFS_I(inode)->i_opencnt)); in affs_file_release()
38 if (atomic_dec_and_test(&AFFS_I(inode)->i_opencnt)) { in affs_file_release()
40 if (inode->i_size != AFFS_I(inode)->mmu_private) in affs_file_release()
52 struct super_block *sb = inode->i_sb; in affs_grow_extcache()
[all …]
/linux-6.8/Documentation/devicetree/bindings/cache/
Dsifive,ccache0.yaml1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
4 ---
5 $id: http://devicetree.org/schemas/cache/sifive,ccache0.yaml#
6 $schema: http://devicetree.org/meta-schemas/core.yaml#
8 title: SiFive Composable Cache Controller
11 - Paul Walmsley <paul.walmsley@sifive.com>
14 The SiFive Composable Cache Controller is used to provide access to fast copies
15 of memory for masters in a Core Complex. The Composable Cache Controller also
16 acts as directory-based coherency manager.
24 - sifive,ccache0
[all …]

12345678910>>...44