/openbmc/linux/crypto/async_tx/ |
H A 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 …]
|
H A 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 …]
|
/openbmc/linux/Documentation/userspace-api/media/v4l/ |
H A 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 …]
|
/openbmc/linux/Documentation/admin-guide/device-mapper/ |
H A 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 …]
|
H A 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 …]
|
H A 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::
|
H A 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 …]
|
/openbmc/linux/Documentation/filesystems/ext4/ |
H A 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 …]
|
/openbmc/linux/crypto/ |
H A 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 …]
|
/openbmc/linux/fs/jffs2/ |
H A 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 …]
|
/openbmc/linux/Documentation/filesystems/ |
H A 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 …]
|
H A D | ext2.rst | 49 resuid=n The user ID which may use the reserved blocks. 50 resgid=n The group ID which may use the reserved blocks. 76 the concepts of blocks, inodes and directories. It has space in the 83 Blocks section in Specification 86 The space in the device or file is split up into blocks. These are 88 which is decided when the filesystem is created. Smaller blocks mean 95 Blocks are clustered into block groups in order to reduce fragmentation 99 Two blocks near the start of each group are reserved for the block usage 100 bitmap and the inode usage bitmap which show which blocks and inodes 106 blocks. The block allocation algorithm attempts to allocate data blocks [all …]
|
/openbmc/linux/arch/arm64/crypto/ |
H A 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 …]
|
/openbmc/linux/drivers/gpu/drm/msm/disp/dpu1/ |
H A 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 …]
|
/openbmc/linux/Documentation/devicetree/bindings/sifive/ |
H A 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
|
/openbmc/linux/drivers/accel/habanalabs/common/ |
H A 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 …]
|
/openbmc/linux/Documentation/admin-guide/mm/ |
H A 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 …]
|
/openbmc/qemu/include/exec/ |
H A D | ramlist.h | 16 /* The dirty memory bitmap is split into fixed-size blocks to allow growth 21 * DirtyMemoryBlocks *blocks = 25 * unsigned long *block = blocks.blocks[idx]; 33 * Organization into blocks allows dirty memory to grow (but not shrink) under 35 * DirtyMemoryBlocks array is allocated with pointers to existing blocks kept 36 * the same. Other threads can safely access existing blocks while dirty 38 * anymore it is freed by RCU (but the underlying blocks stay because they are 44 unsigned long *blocks[]; member 51 QLIST_HEAD(, RAMBlock) blocks; 61 QLIST_FOREACH_RCU(block, &ram_list.blocks, next)
|
H A D | ram_addr.h | 158 DirtyMemoryBlocks *blocks; in cpu_physical_memory_get_dirty() local 169 blocks = qatomic_rcu_read(&ram_list.dirty_memory[client]); in cpu_physical_memory_get_dirty() 177 unsigned long found = find_next_bit(blocks->blocks[idx], in cpu_physical_memory_get_dirty() 198 DirtyMemoryBlocks *blocks; in cpu_physical_memory_all_dirty() local 210 blocks = qatomic_rcu_read(&ram_list.dirty_memory[client]); in cpu_physical_memory_all_dirty() 218 unsigned long found = find_next_zero_bit(blocks->blocks[idx], num, offset); in cpu_physical_memory_all_dirty() 273 DirtyMemoryBlocks *blocks; in cpu_physical_memory_set_dirty_flag() local 283 blocks = qatomic_rcu_read(&ram_list.dirty_memory[client]); in cpu_physical_memory_set_dirty_flag() 285 set_bit_atomic(offset, blocks->blocks[idx]); in cpu_physical_memory_set_dirty_flag() 292 DirtyMemoryBlocks *blocks[DIRTY_MEMORY_NUM]; in cpu_physical_memory_set_dirty_range() local [all …]
|
/openbmc/linux/arch/x86/crypto/ |
H A 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 …]
|
/openbmc/linux/drivers/mtd/ |
H A 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 …]
|
/openbmc/linux/fs/jfs/ |
H A D | jfs_extent.c | 77 /* This blocks if we are low on resources */ in extAlloc() 100 * extent if we can allocate the blocks immediately in extAlloc() 111 /* allocate the disk blocks for the extent. initially, extBalloc() in extAlloc() 112 * will try to allocate disk blocks for the requested size (xlen). in extAlloc() 113 * if this fails (xlen contiguous free blocks not available), it'll in extAlloc() 114 * try to allocate a smaller number of blocks (producing a smaller in extAlloc() 115 * extent), with this smaller number of blocks consisting of the in extAlloc() 116 * requested number of blocks rounded down to the next smaller in extAlloc() 118 * and retry the allocation until the number of blocks to allocate in extAlloc() 119 * is smaller than the number of blocks per page. in extAlloc() [all …]
|
/openbmc/linux/fs/xfs/libxfs/ |
H A 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 …]
|
/openbmc/linux/drivers/gpu/drm/tests/ |
H A D | drm_buddy_test.c | 142 struct list_head *blocks, u64 expected_size, bool is_contiguous) in check_blocks() argument 153 list_for_each_entry(block, blocks, link) { in check_blocks() 333 LIST_HEAD(blocks); in drm_test_buddy_alloc_pathological() 352 block = list_first_entry_or_null(&blocks, typeof(*block), link); in drm_test_buddy_alloc_pathological() 367 KUNIT_ASSERT_TRUE_MSG(test, block, "alloc_blocks has no blocks\n"); in drm_test_buddy_alloc_pathological() 369 list_move_tail(&block->link, &blocks); in drm_test_buddy_alloc_pathological() 379 KUNIT_ASSERT_TRUE_MSG(test, block, "alloc_blocks has no blocks\n"); in drm_test_buddy_alloc_pathological() 392 /* Nothing larger than blocks of chunk_size now available */ in drm_test_buddy_alloc_pathological() 401 list_splice_tail(&holes, &blocks); in drm_test_buddy_alloc_pathological() 402 drm_buddy_free_list(&mm, &blocks); in drm_test_buddy_alloc_pathological() [all …]
|
/openbmc/linux/arch/m68k/emu/ |
H A D | nfblock.c | 40 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 103 pr_info("nfhd%u: found device with %u blocks (%u bytes)\n", dev_id, in nfhd_init_one() 104 blocks, bsize); in nfhd_init_one() 116 dev->blocks = blocks; in nfhd_init_one() 130 set_capacity(dev->disk, (sector_t)blocks * (bsize / 512)); in nfhd_init_one() 150 u32 blocks, bsize; in nfhd_init() local [all …]
|