| /kernel/linux/linux-4.19/crypto/ |
| D | aegis128l.c | 34 union aegis_block blocks[AEGIS128L_CHUNK_BLOCKS]; member
39 union aegis_block blocks[AEGIS128L_STATE_BLOCKS]; member
59 tmp = state->blocks[AEGIS128L_STATE_BLOCKS - 1]; in crypto_aegis128l_update()
61 crypto_aegis_aesenc(&state->blocks[i], &state->blocks[i - 1], in crypto_aegis128l_update()
62 &state->blocks[i]); in crypto_aegis128l_update()
63 crypto_aegis_aesenc(&state->blocks[0], &tmp, &state->blocks[0]); in crypto_aegis128l_update()
70 crypto_aegis_block_xor(&state->blocks[0], &msg->blocks[0]); in crypto_aegis128l_update_a()
71 crypto_aegis_block_xor(&state->blocks[4], &msg->blocks[1]); in crypto_aegis128l_update_a()
78 crypto_xor(state->blocks[0].bytes, msg + 0 * AEGIS_BLOCK_SIZE, in crypto_aegis128l_update_u()
80 crypto_xor(state->blocks[4].bytes, msg + 1 * AEGIS_BLOCK_SIZE, in crypto_aegis128l_update_u()
[all …]
|
| D | aegis256.c | 32 union aegis_block blocks[AEGIS256_STATE_BLOCKS]; member
52 tmp = state->blocks[AEGIS256_STATE_BLOCKS - 1]; in crypto_aegis256_update()
54 crypto_aegis_aesenc(&state->blocks[i], &state->blocks[i - 1], in crypto_aegis256_update()
55 &state->blocks[i]); in crypto_aegis256_update()
56 crypto_aegis_aesenc(&state->blocks[0], &tmp, &state->blocks[0]); in crypto_aegis256_update()
63 crypto_aegis_block_xor(&state->blocks[0], msg); in crypto_aegis256_update_a()
69 crypto_xor(state->blocks[0].bytes, msg, AEGIS_BLOCK_SIZE); in crypto_aegis256_update_u()
86 state->blocks[0] = key_iv[0]; in crypto_aegis256_init()
87 state->blocks[1] = key_iv[1]; in crypto_aegis256_init()
88 state->blocks[2] = crypto_aegis_const[1]; in crypto_aegis256_init()
[all …]
|
| D | aegis128.c | 32 union aegis_block blocks[AEGIS128_STATE_BLOCKS]; member
52 tmp = state->blocks[AEGIS128_STATE_BLOCKS - 1]; in crypto_aegis128_update()
54 crypto_aegis_aesenc(&state->blocks[i], &state->blocks[i - 1], in crypto_aegis128_update()
55 &state->blocks[i]); in crypto_aegis128_update()
56 crypto_aegis_aesenc(&state->blocks[0], &tmp, &state->blocks[0]); in crypto_aegis128_update()
63 crypto_aegis_block_xor(&state->blocks[0], msg); in crypto_aegis128_update_a()
69 crypto_xor(state->blocks[0].bytes, msg, AEGIS_BLOCK_SIZE); in crypto_aegis128_update_u()
82 state->blocks[0] = key_iv; in crypto_aegis128_init()
83 state->blocks[1] = crypto_aegis_const[1]; in crypto_aegis128_init()
84 state->blocks[2] = crypto_aegis_const[0]; in crypto_aegis128_init()
[all …]
|
| /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-4.19/crypto/async_tx/ |
| D | async_pq.c | 36 /* the struct page *blocks[] parameter passed to async_gen_syndrome()
38 * blocks[disks-2] and the 'Q' destination address at blocks[disks-1]
123 do_sync_gen_syndrome(struct page **blocks, unsigned int offset, int disks, in do_sync_gen_syndrome() argument
133 srcs = (void **) blocks; in do_sync_gen_syndrome()
136 if (blocks[i] == NULL) { in do_sync_gen_syndrome()
140 srcs[i] = page_address(blocks[i]) + offset; in do_sync_gen_syndrome()
159 * @blocks: source blocks from idx 0..disks-3, P @ disks-2 and Q @ disks-1
161 * @disks: number of blocks (including missing P or Q, see below)
169 * both) from the calculation by setting blocks[disks-2] or
170 * blocks[disks-1] to NULL. When P or Q is omitted 'len' must be <=
[all …]
|
| D | async_raid6_recov.c | 161 struct page **blocks, struct async_submit_ctl *submit) in __2data_recov_4() argument
172 p = blocks[disks-2]; in __2data_recov_4()
173 q = blocks[disks-1]; in __2data_recov_4()
175 a = blocks[faila]; in __2data_recov_4()
176 b = blocks[failb]; in __2data_recov_4()
200 struct page **blocks, struct async_submit_ctl *submit) in __2data_recov_5() argument
215 if (blocks[i] == NULL) in __2data_recov_5()
224 p = blocks[disks-2]; in __2data_recov_5()
225 q = blocks[disks-1]; in __2data_recov_5()
226 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-4.19/Documentation/media/uapi/v4l/ |
| D | vidioc-g-edid.rst | 59 ``start_block``, ``blocks`` and ``edid`` fields, zero the ``reserved``
61 ``start_block`` and of size ``blocks`` will be placed in the memory
63 ``blocks`` * 128 bytes large (the size of one block is 128 bytes).
65 If there are fewer blocks than specified, then the driver will set
66 ``blocks`` to the actual number of blocks. If there are no EDID blocks
69 If blocks have to be retrieved from the sink, then this call will block
72 If ``start_block`` and ``blocks`` are both set to 0 when
73 :ref:`VIDIOC_G_EDID <VIDIOC_G_EDID>` is called, then the driver will set ``blocks`` to the
74 total number of available EDID blocks and it will return 0 without
75 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-4.19/Documentation/blockdev/ |
| D | README.DAC960 | 308 Controller Queue Depth: 128, Maximum Blocks per Command: 128
315 Disk Status: Online, 17928192 blocks
318 Disk Status: Online, 17928192 blocks
321 Disk Status: Online, 17928192 blocks
324 Disk Status: Online, 17928192 blocks
327 Disk Status: Online, 17928192 blocks
330 Disk Status: Online, 17928192 blocks
333 /dev/rd/c0d0: RAID-5, Online, 89640960 blocks, Write Thru
430 Controller Queue Depth: 128, Maximum Blocks per Command: 128
434 0:1 - Disk: Online, 2201600 blocks
[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-4.19/Documentation/filesystems/ext4/ondisk/ |
| 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.
26 * - Blocks
41 * - Blocks Per Block Group
56 * - Blocks Per File, Extents
61 * - Blocks Per File, Block Maps
[all …]
|
| /kernel/linux/linux-4.19/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 …]
|
| /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-4.19/arch/arm/crypto/ |
| D | aes-neonbs-glue.c | 30 int rounds, int blocks);
32 int rounds, int blocks);
35 int rounds, int blocks, u8 iv[]);
38 int rounds, int blocks, u8 ctr[], u8 final[]);
41 int rounds, int blocks, u8 iv[]);
43 int rounds, int blocks, u8 iv[]);
82 int rounds, int blocks)) in __ecb_crypt() argument
93 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; in __ecb_crypt() local
96 blocks = round_down(blocks, in __ecb_crypt()
100 ctx->rounds, blocks); in __ecb_crypt()
[all …]
|
| D | aes-ce-glue.c | 30 int rounds, int blocks);
32 int rounds, int blocks);
35 int rounds, int blocks, u8 iv[]);
37 int rounds, int blocks, u8 iv[]);
40 int rounds, int blocks, u8 ctr[]);
43 int rounds, int blocks, u8 iv[],
46 int rounds, int blocks, u8 iv[],
182 unsigned int blocks; in ecb_encrypt() local
188 while ((blocks = (walk.nbytes / AES_BLOCK_SIZE))) { in ecb_encrypt()
190 (u8 *)ctx->key_enc, num_rounds(ctx), blocks); in ecb_encrypt()
[all …]
|
| /kernel/linux/linux-4.19/arch/arm64/crypto/ |
| D | aes-neonbs-glue.c | 32 int rounds, int blocks);
34 int rounds, int blocks);
37 int rounds, int blocks, u8 iv[]);
40 int rounds, int blocks, u8 iv[], u8 final[]);
43 int rounds, int blocks, u8 iv[]);
45 int rounds, int blocks, u8 iv[]);
49 int rounds, int blocks);
51 int rounds, int blocks, u8 iv[]);
95 int rounds, int blocks)) in __ecb_crypt() argument
105 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; in __ecb_crypt() local
[all …]
|
| /kernel/linux/linux-4.19/Documentation/filesystems/ |
| D | qnx6.txt | 16 concepts of blocks, inodes and directories.
23 Blocks
26 The space in the device or file is split up into blocks. These are a fixed
43 are done by copying all modified blocks during that specific write request
51 If the level value is 0, up to 16 direct blocks can be addressed by each
54 addressing block holds up to blocksize / 4 bytes pointers to data blocks.
56 to 16 * 256 * 256 = 1048576 blocks that can be addressed by such a tree).
59 indirect addressing blocks or inodes.
66 information (total number of filesystem blocks) or by taking the highest
77 The inode structure contains pointers to the filesystem blocks which contain
[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-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-4.19/fs/jfs/ |
| D | jfs_extent.c | 93 /* This blocks if we are low on resources */ in extAlloc()
116 * extent if we can allocate the blocks immediately in extAlloc()
127 /* allocate the disk blocks for the extent. initially, extBalloc() in extAlloc()
128 * will try to allocate disk blocks for the requested size (xlen). in extAlloc()
129 * if this fails (xlen contiguous free blocks not available), it'll in extAlloc()
130 * try to allocate a smaller number of blocks (producing a smaller in extAlloc()
131 * extent), with this smaller number of blocks consisting of the in extAlloc()
132 * requested number of blocks rounded down to the next smaller in extAlloc()
134 * and retry the allocation until the number of blocks to allocate in extAlloc()
135 * 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-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-4.19/Documentation/device-mapper/ |
| D | era.txt | 5 addition it keeps track of which blocks were written within a user
10 Use cases include tracking changed blocks for backup software, and
20 origin dev : device holding data blocks that may change
49 <metadata block size> <#used metadata blocks>/<#total metadata blocks>
54 #used metadata blocks : Number of metadata blocks used
55 #total metadata blocks : Total number of metadata blocks
57 held metadata root : The location, in blocks, of the metadata root
81 - Ascertain which blocks have been written since the snapshot was taken
83 - Invalidate those blocks in the caching software
91 that it uses a few 4k blocks for updating metadata.
|