| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-6.6/Documentation/admin-guide/device-mapper/ |
| D | writecache.rst | 27 start writeback when the number of used blocks reach this
30 stop writeback when the number of used blocks drops below
33 limit the number of blocks that are in flight during
37 when the application writes this amount of blocks without
38 issuing the FLUSH request, the blocks are automatically
58 new writes (however, writes to already cached blocks are
63 blocks drops to zero, userspace can unload the
80 2. the number of blocks
81 3. the number of free blocks
82 4. the number of blocks under writeback
[all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ext4/ |
| D | blocks.rst | 3 Blocks title
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 …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ext4/ |
| D | blocks.rst | 3 Blocks title
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 …]
|
| /kernel/linux/linux-6.6/crypto/ |
| D | aegis128-core.c | 32 union aegis_block blocks[AEGIS128_STATE_BLOCKS]; member
66 tmp = state->blocks[AEGIS128_STATE_BLOCKS - 1]; in crypto_aegis128_update()
68 crypto_aegis_aesenc(&state->blocks[i], &state->blocks[i - 1], in crypto_aegis128_update()
69 &state->blocks[i]); in crypto_aegis128_update()
70 crypto_aegis_aesenc(&state->blocks[0], &tmp, &state->blocks[0]); in crypto_aegis128_update()
83 crypto_aegis_block_xor(&state->blocks[0], msg); in crypto_aegis128_update_a()
95 crypto_xor(state->blocks[0].bytes, msg, AEGIS_BLOCK_SIZE); in crypto_aegis128_update_u()
108 state->blocks[0] = key_iv; in crypto_aegis128_init()
109 state->blocks[1] = crypto_aegis_const[1]; in crypto_aegis128_init()
110 state->blocks[2] = crypto_aegis_const[0]; in crypto_aegis128_init()
[all …]
|
| /kernel/linux/linux-6.6/fs/jffs2/ |
| D | jffs2_fs_sb.h | 80 /* Number of free blocks there must be before we... */
86 /* Number of 'very dirty' blocks before we trigger immediate GC */
92 struct jffs2_eraseblock *blocks; /* The whole array of blocks. Used for getting blocks member
93 * from the offset (blocks[ofs / sector_size]) */
98 struct list_head clean_list; /* Blocks 100% full of clean data */
99 struct list_head very_dirty_list; /* Blocks with lots of dirty space */
100 struct list_head dirty_list; /* Blocks with some dirty space */
101 struct list_head erasable_list; /* Blocks which are completely dirty, and need erasing */
102 …struct list_head erasable_pending_wbuf_list; /* Blocks which need erasing but only after the curre…
103 struct list_head erasing_list; /* Blocks which are currently erasing */
[all …]
|
| /kernel/linux/linux-5.10/fs/jffs2/ |
| D | jffs2_fs_sb.h | 80 /* Number of free blocks there must be before we... */
86 /* Number of 'very dirty' blocks before we trigger immediate GC */
92 struct jffs2_eraseblock *blocks; /* The whole array of blocks. Used for getting blocks member
93 * from the offset (blocks[ofs / sector_size]) */
98 struct list_head clean_list; /* Blocks 100% full of clean data */
99 struct list_head very_dirty_list; /* Blocks with lots of dirty space */
100 struct list_head dirty_list; /* Blocks with some dirty space */
101 struct list_head erasable_list; /* Blocks which are completely dirty, and need erasing */
102 …struct list_head erasable_pending_wbuf_list; /* Blocks which need erasing but only after the curre…
103 struct list_head erasing_list; /* Blocks which are currently erasing */
[all …]
|
| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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[]);
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[]);
96 int rounds, int blocks)) in __ecb_crypt() argument
106 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; in __ecb_crypt() local
[all …]
|
| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-5.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 …]
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/msm/disp/dpu1/ |
| D | dpu_hw_catalog.h | 17 * 5 ctl paths. In all cases, it can have max 12 hardware blocks
52 * SSPP sub-blocks/features
94 * MIXER sub-blocks/features
112 * DSPP sub-blocks
121 * PINGPONG sub-blocks
126 * @DPU_PINGPONG_DITHER Dither blocks
141 * CTL sub-blocks
160 * INTF sub-blocks
178 * WB sub-blocks and features
214 * VBIF sub-blocks and features
[all …]
|
| /kernel/linux/linux-6.6/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
|
| /kernel/linux/linux-5.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
|
| /kernel/linux/linux-6.6/drivers/accel/habanalabs/common/ |
| D | security.c | 28 * @pb_blocks: blocks array
29 * @array_size: blocks array size
82 * @pb_blocks: blocks array
84 * @array_size: blocks array size
111 * @pb_blocks: blocks array
113 * @array_size: blocks array size
147 * @pb_blocks: blocks array
149 * @blocks_array_size: blocks array size
177 * @pb_blocks: blocks array
179 * @blocks_array_size: blocks array size
[all …]
|
| /kernel/linux/linux-6.6/Documentation/admin-guide/mm/ |
| D | memory-hotplug.rst | 46 Memory sections are combined into chunks referred to as "memory blocks". The
51 All memory blocks have the same size.
59 (2) Onlining memory blocks
62 for the direct mapping, is allocated and initialized, and memory blocks are
64 blocks.
75 (1) Offlining memory blocks
83 In the second phase, the memory blocks are removed and metadata is freed.
109 blocks, and, if successful, hotunplug the memory from Linux.
122 Only complete memory blocks can be probed. Individual memory blocks are probed
136 Onlining and Offlining Memory Blocks
[all …]
|
| /kernel/linux/linux-6.6/arch/x86/crypto/ |
| D | ecb_cbc_helpers.h | 32 #define ECB_WALK_ADVANCE(blocks) do { \ argument
33 dst += (blocks) * __bsize; \
34 src += (blocks) * __bsize; \
35 nbytes -= (blocks) * __bsize; \
38 #define ECB_BLOCK(blocks, func) do { \ argument
39 const int __blocks = (blocks); \
46 ECB_WALK_ADVANCE(blocks); \
61 #define CBC_DEC_BLOCK(blocks, func) do { \ argument
62 const int __blocks = (blocks); \
68 const u8 *__iv = src + ((blocks) - 1) * __bsize; \
[all …]
|
| /kernel/linux/linux-6.6/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()
235 kfree(part->blocks); in scan_header()
277 erase->addr = part->blocks[block].offset; in erase_block()
280 part->blocks[block].state = BLOCK_ERASING; in erase_block()
281 part->blocks[block].free_sectors = 0; in erase_block()
288 part->blocks[block].state = BLOCK_FAILED; in erase_block()
289 part->blocks[block].free_sectors = 0; in erase_block()
[all …]
|