| /Linux-v5.10/crypto/async_tx/ |
| D | async_pq.c | 20 /* the struct page *blocks[] parameter passed to async_gen_syndrome()
22 * blocks[disks-2] and the 'Q' destination address at blocks[disks-1]
107 do_sync_gen_syndrome(struct page **blocks, unsigned int *offsets, int disks, in do_sync_gen_syndrome() argument
117 srcs = (void **) blocks; in do_sync_gen_syndrome()
120 if (blocks[i] == NULL) { in do_sync_gen_syndrome()
124 srcs[i] = page_address(blocks[i]) + offsets[i]; in do_sync_gen_syndrome()
157 * @blocks: source blocks from idx 0..disks-3, P @ disks-2 and Q @ disks-1
159 * @disks: number of blocks (including missing P or Q, see below)
167 * both) from the calculation by setting blocks[disks-2] or
168 * blocks[disks-1] to NULL. When P or Q is omitted 'len' must be <=
[all …]
|
| D | async_raid6_recov.c | 154 struct page **blocks, unsigned int *offs, in __2data_recov_4() argument
168 p = blocks[disks-2]; in __2data_recov_4()
170 q = blocks[disks-1]; in __2data_recov_4()
173 a = blocks[faila]; in __2data_recov_4()
175 b = blocks[failb]; in __2data_recov_4()
204 struct page **blocks, unsigned int *offs, in __2data_recov_5() argument
222 if (blocks[i] == NULL) in __2data_recov_5()
231 p = blocks[disks-2]; in __2data_recov_5()
233 q = blocks[disks-1]; in __2data_recov_5()
235 g = blocks[good]; in __2data_recov_5()
[all …]
|
| /Linux-v5.10/Documentation/userspace-api/media/v4l/ |
| D | vidioc-g-edid.rst | 60 ``start_block``, ``blocks`` and ``edid`` fields, zero the ``reserved``
62 ``start_block`` and of size ``blocks`` will be placed in the memory
64 ``blocks`` * 128 bytes large (the size of one block is 128 bytes).
66 If there are fewer blocks than specified, then the driver will set
67 ``blocks`` to the actual number of blocks. If there are no EDID blocks
70 If blocks have to be retrieved from the sink, then this call will block
73 If ``start_block`` and ``blocks`` are both set to 0 when
74 :ref:`VIDIOC_G_EDID <VIDIOC_G_EDID>` is called, then the driver will set ``blocks`` to the
75 total number of available EDID blocks and it will return 0 without
76 copying any data. This is an easy way to discover how many EDID blocks
[all …]
|
| /Linux-v5.10/crypto/ |
| D | aegis128-core.c | 32 union aegis_block blocks[AEGIS128_STATE_BLOCKS]; member
79 tmp = state->blocks[AEGIS128_STATE_BLOCKS - 1]; in crypto_aegis128_update()
81 crypto_aegis_aesenc(&state->blocks[i], &state->blocks[i - 1], in crypto_aegis128_update()
82 &state->blocks[i]); in crypto_aegis128_update()
83 crypto_aegis_aesenc(&state->blocks[0], &tmp, &state->blocks[0]); in crypto_aegis128_update()
95 crypto_aegis_block_xor(&state->blocks[0], msg); in crypto_aegis128_update_a()
106 crypto_xor(state->blocks[0].bytes, msg, AEGIS_BLOCK_SIZE); in crypto_aegis128_update_u()
119 state->blocks[0] = key_iv; in crypto_aegis128_init()
120 state->blocks[1] = crypto_aegis_const[1]; in crypto_aegis128_init()
121 state->blocks[2] = crypto_aegis_const[0]; in crypto_aegis128_init()
[all …]
|
| /Linux-v5.10/Documentation/filesystems/ext4/ |
| D | blocks.rst | 3 Blocks chapter
6 ext4 allocates storage space in units of “blocks”. A block is a group of
8 integral power of 2. Blocks are in turn grouped into larger units called
11 page size (i.e. 64KiB blocks on a i386 which only has 4KiB memory
12 pages). By default a filesystem can contain 2^32 blocks; if the '64bit'
13 feature is enabled, then a filesystem can have 2^64 blocks. The location
28 * - Blocks
43 * - Blocks Per Block Group
58 * - Blocks Per File, Extents
63 * - Blocks Per File, Block Maps
[all …]
|
| /Linux-v5.10/fs/jffs2/ |
| D | jffs2_fs_sb.h | 79 /* Number of free blocks there must be before we... */
85 /* Number of 'very dirty' blocks before we trigger immediate GC */
91 struct jffs2_eraseblock *blocks; /* The whole array of blocks. Used for getting blocks member
92 * from the offset (blocks[ofs / sector_size]) */
97 struct list_head clean_list; /* Blocks 100% full of clean data */
98 struct list_head very_dirty_list; /* Blocks with lots of dirty space */
99 struct list_head dirty_list; /* Blocks with some dirty space */
100 struct list_head erasable_list; /* Blocks which are completely dirty, and need erasing */
101 …struct list_head erasable_pending_wbuf_list; /* Blocks which need erasing but only after the curre…
102 struct list_head erasing_list; /* Blocks which are currently erasing */
[all …]
|
| /Linux-v5.10/Documentation/filesystems/ |
| D | qnx6.rst | 19 concepts of blocks, inodes and directories.
28 Blocks section in Specification
31 The space in the device or file is split up into blocks. These are a fixed
49 are done by copying all modified blocks during that specific write request
57 If the level value is 0, up to 16 direct blocks can be addressed by each
61 addressing block holds up to blocksize / 4 bytes pointers to data blocks.
63 to 16 * 256 * 256 = 1048576 blocks that can be addressed by such a tree).
66 indirect addressing blocks or inodes.
75 information (total number of filesystem blocks) or by taking the highest
86 The inode structure contains pointers to the filesystem blocks which contain
[all …]
|
| D | ext2.rst | 48 resuid=n The user ID which may use the reserved blocks.
49 resgid=n The group ID which may use the reserved blocks.
77 the concepts of blocks, inodes and directories. It has space in the
84 Blocks section in Specification
87 The space in the device or file is split up into blocks. These are
89 which is decided when the filesystem is created. Smaller blocks mean
96 Blocks are clustered into block groups in order to reduce fragmentation
100 Two blocks near the start of each group are reserved for the block usage
101 bitmap and the inode usage bitmap which show which blocks and inodes
107 blocks. The block allocation algorithm attempts to allocate data blocks
[all …]
|
| D | nilfs2.rst | 67 blocks to be written to disk without making a
70 filesystem except for the updates on data blocks still
75 blocks. That means, it is guaranteed that no
84 block device when blocks are freed. This is useful
125 due to redundant move of in-use blocks.
193 of logs. Each log is composed of summary information blocks, payload
194 blocks, and an optional super root block (SR)::
209 | Summary | Payload blocks |SR|
212 The payload blocks are organized per file, and each file consists of
213 data blocks and B-tree node blocks::
[all …]
|
| /Linux-v5.10/fs/jfs/ |
| D | jfs_extent.c | 80 /* This blocks if we are low on resources */ in extAlloc()
103 * extent if we can allocate the blocks immediately in extAlloc()
114 /* allocate the disk blocks for the extent. initially, extBalloc() in extAlloc()
115 * will try to allocate disk blocks for the requested size (xlen). in extAlloc()
116 * if this fails (xlen contiguous free blocks not available), it'll in extAlloc()
117 * try to allocate a smaller number of blocks (producing a smaller in extAlloc()
118 * extent), with this smaller number of blocks consisting of the in extAlloc()
119 * requested number of blocks rounded down to the next smaller in extAlloc()
121 * and retry the allocation until the number of blocks to allocate in extAlloc()
122 * is smaller than the number of blocks per page. in extAlloc()
[all …]
|
| /Linux-v5.10/arch/arm64/crypto/ |
| D | aes-neonbs-glue.c | 29 int rounds, int blocks);
31 int rounds, int blocks);
34 int rounds, int blocks, u8 iv[]);
37 int rounds, int blocks, u8 iv[], u8 final[]);
40 int rounds, int blocks, u8 iv[]);
42 int rounds, int blocks, u8 iv[]);
46 int rounds, int blocks);
48 int rounds, int blocks, u8 iv[]);
99 int rounds, int blocks)) in __ecb_crypt() argument
109 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; in __ecb_crypt() local
[all …]
|
| /Linux-v5.10/Documentation/devicetree/bindings/sifive/ |
| D | sifive-blocks-ip-versioning.txt | 1 DT compatible string versioning for SiFive open-source IP blocks
4 strings for open-source SiFive IP blocks. HDL for these IP blocks
7 https://github.com/sifive/sifive-blocks
14 https://github.com/sifive/sifive-blocks/blob/v1.0/src/main/scala/devices/uart/UART.scala#L43
16 Until these IP blocks (or IP integration) support version
17 auto-discovery, the maintainers of these IP blocks intend to increment
19 interface to these IP blocks changes, or when the functionality of the
20 underlying IP blocks changes in a way that software should be aware of.
25 upstream sifive-blocks commits. It is expected that most drivers will
|
| /Linux-v5.10/drivers/mtd/ |
| D | rfd_ftl.c | 88 struct block *blocks; member
95 struct block *block = &part->blocks[block_no]; in build_block_map()
188 part->blocks = kcalloc(part->total_blocks, sizeof(struct block), in scan_header()
190 if (!part->blocks) in scan_header()
238 kfree(part->blocks); in scan_header()
280 erase->addr = part->blocks[block].offset; in erase_block()
283 part->blocks[block].state = BLOCK_ERASING; in erase_block()
284 part->blocks[block].free_sectors = 0; in erase_block()
291 part->blocks[block].state = BLOCK_FAILED; in erase_block()
292 part->blocks[block].free_sectors = 0; in erase_block()
[all …]
|
| /Linux-v5.10/arch/arm/crypto/ |
| D | aes-neonbs-glue.c | 29 int rounds, int blocks);
31 int rounds, int blocks);
34 int rounds, int blocks, u8 iv[]);
37 int rounds, int blocks, u8 ctr[], u8 final[]);
40 int rounds, int blocks, u8 iv[], int);
42 int rounds, int blocks, u8 iv[], int);
87 int rounds, int blocks)) in __ecb_crypt() argument
97 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; in __ecb_crypt() local
100 blocks = round_down(blocks, in __ecb_crypt()
105 ctx->rounds, blocks); in __ecb_crypt()
[all …]
|
| /Linux-v5.10/Documentation/admin-guide/device-mapper/ |
| D | dm-dust.rst | 10 requests on specific blocks (to emulate the behavior of a hard disk
14 "dmsetup status" displays "fail_read_on_bad_block"), reads of blocks
17 Writes of blocks in the "bad block list will result in the following:
28 messages to add arbitrary bad blocks at new locations, and the
30 configured "bad blocks" will be treated as bad, or bypassed.
86 Adding and removing bad blocks
90 enabled or disabled), bad blocks may be added or removed from the
102 These bad blocks will be stored in the "bad block list".
128 ...and writing to the bad blocks will remove the blocks from the list,
157 Counting the number of bad blocks in the bad block list
[all …]
|
| D | era.rst | 9 addition it keeps track of which blocks were written within a user
14 Use cases include tracking changed blocks for backup software, and
25 origin dev device holding data blocks that may change
55 <metadata block size> <#used metadata blocks>/<#total metadata blocks>
61 #used metadata blocks Number of metadata blocks used
62 #total metadata blocks Total number of metadata blocks
64 held metadata root The location, in blocks, of the metadata root
89 - Ascertain which blocks have been written since the snapshot was taken
91 - Invalidate those blocks in the caching software
99 that it uses a few 4k blocks for updating metadata::
|
| D | verity.rst | 50 The number of data blocks on the data device. Additional blocks are
55 This is the offset, in <hash_block_size>-blocks, from the start of hash_dev
79 Log corrupted blocks, but allow read operations to proceed normally.
91 Do not verify blocks that are expected to contain zeroes and always return
92 zeroes instead. This may be useful if the partition contains unused blocks
98 may be the same device where data and hash blocks reside, in which case
102 on the hash device after the hash blocks.
113 The number of encoding data blocks on the FEC device. The block size for
117 This is the offset, in <data_block_size> blocks, from the start of the
121 Verify data blocks only the first time they are read from the data device,
[all …]
|
| D | cache.rst | 56 3. A small metadata device - records which blocks are in the cache,
66 The origin is divided up into blocks of a fixed size. This block size
90 blocks should remain clean.
107 dirty blocks in a cache. Useful for decommissioning a cache or when
109 blocks, in the area of the cache being removed, to be clean. If the
110 area being removed from the cache still contains dirty blocks the resize
143 system crashes all cache blocks will be assumed dirty when restarted.
168 blocks. However, we allow this bitset to have a different block size
169 from the cache blocks. This is because we need to track the discard
187 cache dev fast device holding cached data blocks
[all …]
|
| /Linux-v5.10/drivers/gpu/drm/msm/disp/dpu1/ |
| D | dpu_hw_catalog.h | 15 * 5 ctl paths. In all cases, it can have max 12 hardware blocks
94 * SSPP sub-blocks/features
134 * MIXER sub-blocks/features
150 * DSPP sub-blocks
161 * PINGPONG sub-blocks
166 * @DPU_PINGPONG_DITHER, Dither blocks
179 * CTL sub-blocks
190 * INTF sub-blocks
203 * VBIF sub-blocks and features
215 * MACRO DPU_HW_BLK_INFO - information of HW blocks inside DPU
[all …]
|
| /Linux-v5.10/drivers/gpu/drm/i915/ |
| D | intel_memory_region.c | 35 struct list_head *blocks) in intel_memory_region_free_pages() argument
40 list_for_each_entry_safe(block, on, blocks, link) { in intel_memory_region_free_pages()
44 INIT_LIST_HEAD(blocks); in intel_memory_region_free_pages()
51 struct list_head *blocks) in __intel_memory_region_put_pages_buddy() argument
54 mem->avail += intel_memory_region_free_pages(mem, blocks); in __intel_memory_region_put_pages_buddy()
61 struct list_head blocks; in __intel_memory_region_put_block_buddy() local
63 INIT_LIST_HEAD(&blocks); in __intel_memory_region_put_block_buddy()
64 list_add(&block->link, &blocks); in __intel_memory_region_put_block_buddy()
65 __intel_memory_region_put_pages_buddy(block->private, &blocks); in __intel_memory_region_put_block_buddy()
72 struct list_head *blocks) in __intel_memory_region_get_pages_buddy() argument
[all …]
|
| /Linux-v5.10/fs/xfs/libxfs/ |
| D | xfs_btree_staging.c | 27 * initializing new btree blocks and filling them with records or key/ptr
57 * Bulk loading uses a separate callback to obtain new blocks from a
285 * height of and the number of blocks needed to construct the btree. See the
289 * In step four, the caller must allocate xfs_btree_bload.nr_blocks blocks and
291 * blocks to be allocated beforehand to avoid ENOSPC failures midway through a
298 * is responsible for cleaning up the previous btree blocks, if any.
306 * is the number of blocks in the next lower level of the tree. For each
311 * The number of blocks for the level is defined to be:
313 * blocks = floor(nr_items / desired)
319 * npb = nr_items / blocks
[all …]
|
| /Linux-v5.10/arch/m68k/emu/ |
| D | nfblock.c | 41 static inline s32 nfhd_get_capacity(u32 major, u32 minor, u32 *blocks, in nfhd_get_capacity() argument
45 virt_to_phys(blocks), virt_to_phys(blocksize)); in nfhd_get_capacity()
56 u32 blocks, bsize; member
87 geo->cylinders = dev->blocks >> (6 - dev->bshift); in nfhd_getgeo()
100 static int __init nfhd_init_one(int id, u32 blocks, u32 bsize) in nfhd_init_one() argument
105 pr_info("nfhd%u: found device with %u blocks (%u bytes)\n", dev_id, in nfhd_init_one()
106 blocks, bsize); in nfhd_init_one()
118 dev->blocks = blocks; in nfhd_init_one()
137 set_capacity(dev->disk, (sector_t)blocks * (bsize / 512)); in nfhd_init_one()
156 u32 blocks, bsize; in nfhd_init() local
[all …]
|
| /Linux-v5.10/arch/x86/crypto/ |
| D | cast5-avx-x86_64-asm_64.S | 215 * RL1: blocks 1 and 2
216 * RR1: blocks 3 and 4
217 * RL2: blocks 5 and 6
218 * RR2: blocks 7 and 8
219 * RL3: blocks 9 and 10
220 * RR3: blocks 11 and 12
221 * RL4: blocks 13 and 14
222 * RR4: blocks 15 and 16
224 * RL1: encrypted blocks 1 and 2
225 * RR1: encrypted blocks 3 and 4
[all …]
|
| /Linux-v5.10/drivers/gpu/drm/i915/selftests/ |
| D | i915_buddy.c | 112 struct list_head *blocks, in igt_check_blocks() argument
125 list_for_each_entry(block, blocks, link) { in igt_check_blocks()
328 LIST_HEAD(blocks); in igt_buddy_alloc_smoke()
364 list_add_tail(&block->link, &blocks); in igt_buddy_alloc_smoke()
381 err = igt_check_blocks(&mm, &blocks, total, false); in igt_buddy_alloc_smoke()
383 i915_buddy_free_list(&mm, &blocks); in igt_buddy_alloc_smoke()
413 LIST_HEAD(blocks); in igt_buddy_alloc_pessimistic()
438 list_add_tail(&block->link, &blocks); in igt_buddy_alloc_pessimistic()
448 list_add_tail(&block->link, &blocks); in igt_buddy_alloc_pessimistic()
456 list_add_tail(&block->link, &blocks); in igt_buddy_alloc_pessimistic()
[all …]
|
| /Linux-v5.10/fs/ext4/ |
| D | indirect.c | 53 * data blocks at leaves and indirect blocks in intermediate nodes.
60 * we need to know is the capacity of indirect blocks (taken from the
68 * if our filesystem had 8Kb blocks. We might use long long, but that would
115 * ext4_get_branch - read the chain of indirect blocks leading to data
118 * @offsets: offsets of pointers in inode/indirect blocks
138 * or when it reads all @depth-1 indirect blocks successfully and finds
260 * of direct blocks need to be allocated for the given branch.
262 * @branch: chain of indirect blocks
263 * @k: number of blocks need for indirect blocks
264 * @blks: number of data blocks to be mapped.
[all …]
|
