Home
last modified time | relevance | path

Searched full:blocks (Results 1 – 25 of 2085) sorted by relevance

12345678910>>...84

/linux/crypto/async_tx/
H A Dasync_pq.c20 /* 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 …]
H A Dasync_raid6_recov.c154 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/Documentation/userspace-api/media/v4l/
H A Dvidioc-g-edid.rst60 ``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/Documentation/admin-guide/device-mapper/
H A Dwritecache.rst27 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 …]
H A Ddm-dust.rst10 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 …]
H A Dverity.rst50 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.
100 Do not verify blocks that are expected to contain zeroes and always return
101 zeroes instead. This may be useful if the partition contains unused blocks
130 The total number of <data_block_size> blocks that are error-checked using
132 blocks needed by the hash tree. It can include additional metadata blocks,
133 which are assumed to be accessible on <hash_dev> following the hash blocks
[all...]
H A Dcache.rst56 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 …]
H A Dera.rst9 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::
/linux/Documentation/filesystems/ext4/
H A Dblocks.rst3 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 …]
/linux/arch/arm64/crypto/
H A Daes-neonbs-glue.c31 int rounds, int blocks);
33 int rounds, int blocks);
36 int rounds, int blocks, u8 iv[]);
39 int rounds, int blocks, u8 iv[]);
42 int rounds, int blocks, u8 iv[]);
44 int rounds, int blocks, u8 iv[]);
88 int rounds, int blocks)) in aesbs_setkey()
98 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE;
101 blocks = round_down(blocks, in __ecb_crypt() argument
111 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; __ecb_crypt() local
173 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; cbc_encrypt() local
196 unsigned int blocks = walk.nbytes / AES_BLOCK_SIZE; cbc_decrypt() local
223 int blocks = (walk.nbytes / AES_BLOCK_SIZE) & ~7; ctr_encrypt() local
286 __xts_crypt(struct skcipher_request * req,bool encrypt,void (* fn)(u8 out[],u8 const in[],u8 const rk[],int rounds,int blocks,u8 iv[])) __xts_crypt() argument
326 int blocks = (walk.nbytes / AES_BLOCK_SIZE) & ~7; __xts_crypt() local
[all...]
/linux/fs/jffs2/
H A Djffs2_fs_sb.h80 /* 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 …]
/linux/Documentation/filesystems/
H A Dqnx6.rst19 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 …]
H A Dnilfs2.rst67 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/drivers/accel/habanalabs/common/
H A Dsecurity.c44 * @pb_blocks: blocks array
45 * @array_size: blocks array size
98 * @pb_blocks: blocks array
100 * @array_size: blocks array size
127 * @pb_blocks: blocks array
129 * @array_size: blocks array size
163 * @pb_blocks: blocks array
165 * @blocks_array_size: blocks array size
193 * @pb_blocks: blocks array
195 * @blocks_array_size: blocks array size
[all …]
H A Dsecurity.h15 /* special blocks */
29 * @major: number of major blocks of particular type.
30 * @minor: number of minor blocks of particular type.
31 * @sub_minor: number of sub minor blocks of particular type.
32 * @major_offset: address gap between 2 consecutive major blocks of particular type,
34 * @minor_offset: address gap between 2 consecutive minor blocks of particular type,
36 * @sub_minor_offset: address gap between 2 consecutive sub_minor blocks of particular
39 * e.g., in Gaudi2, NIC_UMR blocks can be interpreted as:
42 * 2 blocks with different minor numbers (i.e. 0 to 1). Again, for each minor
43 * number there are 15 blocks with different sub_minor numbers (i.e. 0 to 14).
[all …]
/linux/drivers/mtd/
H A Drfd_ftl.c88 struct block *blocks; member
95 struct block *block = &part->blocks[block_no]; in build_block_map()
188 part->blocks = kzalloc_objs(struct block, part->total_blocks); in scan_header()
189 if (!part->blocks) in scan_header()
234 kfree(part->blocks); in scan_header()
276 erase->addr = part->blocks[block].offset; in erase_block()
279 part->blocks[block].state = BLOCK_ERASING; in erase_block()
280 part->blocks[block].free_sectors = 0; in erase_block()
287 part->blocks[block].state = BLOCK_FAILED; in erase_block()
288 part->blocks[block].free_sectors = 0; in erase_block()
[all …]
/linux/fs/jfs/
H A Djfs_extent.c82 /* This blocks if we are low on resources */ in extAlloc()
105 * extent if we can allocate the blocks immediately in extAlloc()
116 /* allocate the disk blocks for the extent. initially, extBalloc() in extAlloc()
117 * will try to allocate disk blocks for the requested size (xlen). in extAlloc()
118 * if this fails (xlen contiguous free blocks not available), it'll in extAlloc()
119 * try to allocate a smaller number of blocks (producing a smaller in extAlloc()
120 * extent), with this smaller number of blocks consisting of the in extAlloc()
121 * requested number of blocks rounded down to the next smaller in extAlloc()
123 * and retry the allocation until the number of blocks to allocate in extAlloc()
124 * is smaller than the number of blocks per page. in extAlloc()
[all …]
/linux/Documentation/devicetree/bindings/sifive/
H A Dsifive-blocks-ip-versioning.txt1 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/drivers/gpu/drm/msm/disp/dpu1/
H A Ddpu_hw_catalog.h17 * 5 ctl paths. In all cases, it can have max 12 hardware blocks
32 * SSPP sub-blocks/features
68 * MIXER sub-blocks/features
78 * DSPP sub-blocks
89 * CTL sub-blocks
99 * WB sub-blocks and features
132 * VBIF sub-blocks and features
144 * DSC sub-blocks/features
154 * MACRO DPU_HW_BLK_INFO - information of HW blocks inside DPU
296 * struct dpu_sspp_sub_blks : SSPP sub-blocks
[all...]
/linux/arch/x86/crypto/
H A Decb_cbc_helpers.h32 #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 …]
/linux/fs/ext4/
H A Dindirect.c53 * 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
267 * of direct blocks need to be allocated for the given branch.
269 * @branch: chain of indirect blocks
270 * @k: number of blocks nee
[all...]
/linux/arch/m68k/emu/
H A Dnfblock.c40 static inline s32 nfhd_get_capacity(u32 major, u32 minor, u32 *blocks, in nfhd_get_capacity() argument
44 virt_to_phys(blocks), virt_to_phys(blocksize)); in nfhd_get_capacity()
55 u32 blocks, bsize; member
84 geo->cylinders = dev->blocks >> (6 - dev->bshift); in nfhd_getgeo()
97 static int __init nfhd_init_one(int id, u32 blocks, u32 bsize) in nfhd_init_one() argument
107 pr_info("nfhd%u: found device with %u blocks (%u bytes)\n", dev_id, in nfhd_init_one()
108 blocks, bsize); in nfhd_init_one()
120 dev->blocks = blocks; in nfhd_init_one()
137 set_capacity(dev->disk, (sector_t)blocks * (bsiz in nfhd_init_one()
155 u32 blocks, bsize; nfhd_init() local
[all...]
/linux/fs/xfs/scrub/
H A Dalloc_repair.c61 * record all visited rmap btree blocks and all blocks owned by the AGFL.
64 * expression identifies possible former bnobt/cntbt blocks:
66 * (OWN_AG blocks) & ~(rmapbt blocks | agfl blocks);
78 * bnobt/cntbt blocks. The xagb_bitmap_disunion operation modifies its first
82 * reservation and used to format new btree blocks. The remaining records are
91 /* Blocks owned by the rmapbt or the agfl. */
94 /* All OWN_AG blocks. */
123 /* Number of free blocks in this AG. */
232 /* Record all the OWN_AG blocks... */ in xrep_abt_walk_rmap()
240 /* ...and all the rmapbt blocks... */ in xrep_abt_walk_rmap()
[all …]
/linux/drivers/md/dm-vdo/
H A Dslab-depot.h40 * from the recovery journal to commit slab journal tail blocks must be scheduled from the recovery
138 /* The number of blocks in the on-disk journal */
140 /* The number of blocks at which to start pushing reference blocks */
142 /* The number of blocks at which all reference blocks should be writing */
144 /* The number of blocks at which to wait for reference blocks to write */
146 /* The number of blocks at which to scrub the slab before coming online */
161 * Blocks ar
[all...]
/linux/fs/ext2/
H A Dinode.c143 * data blocks at leaves and indirect blocks in intermediate nodes.
150 * we need to know is the capacity of indirect blocks (taken from the
158 * if our filesystem had 8Kb blocks. We might use long long, but that would
207 * ext2_get_branch - read the chain of indirect blocks leading to data
210 * @offsets: offsets of pointers in inode/indirect blocks
232 * or when it reads all @depth-1 indirect blocks successfully and finds
352 * of direct blocks need to be allocated for the given branch.
354 * @branch: chain of indirect blocks
355 * @k: number of blocks nee
[all...]

12345678910>>...84