/linux-master/fs/afs/ |
H A D | xdr_fs.h | 102 union afs_xdr_dir_block blocks[AFS_DIR_BLOCKS_PER_PAGE]; member in struct:afs_xdr_dir_page
|
/linux-master/drivers/usb/isp1760/ |
H A D | isp1760-hcd.h | 26 unsigned int blocks[ISP176x_BLOCK_NUM]; member in struct:isp1760_memory_layout
|
/linux-master/drivers/gpu/drm/msm/disp/ |
H A D | msm_disp_snapshot.h | 48 struct list_head blocks; member in struct:msm_disp_state
|
/linux-master/arch/arm/crypto/ |
H A D | ghash-ce-glue.c | 62 asmlinkage void pmull_ghash_update_p64(int blocks, u64 dg[], const char *src, 65 asmlinkage void pmull_ghash_update_p8(int blocks, u64 dg[], const char *src, 78 static void ghash_do_update(int blocks, u64 dg[], const char *src, argument 84 pmull_ghash_update_p64(blocks, dg, src, key->h, head); 86 pmull_ghash_update_p8(blocks, dg, src, key->h, head); 96 blocks++; 104 } while (--blocks); 121 int blocks; local 131 blocks = len / GHASH_BLOCK_SIZE; 134 ghash_do_update(blocks, ct 435 int blocks = count / GHASH_BLOCK_SIZE; local [all...] |
/linux-master/drivers/gpu/drm/i915/ |
H A D | i915_scatterlist.c | 171 struct list_head *blocks = &bman_res->blocks; local 178 GEM_BUG_ON(list_empty(blocks)); 202 list_for_each_entry(block, blocks, link) {
|
H A D | i915_ttm_buddy_manager.c | 56 INIT_LIST_HEAD(&bman_res->blocks); 96 &bman_res->blocks, 106 list_for_each_entry(block, &bman_res->blocks, link) { 129 drm_buddy_free_list(mm, &bman_res->blocks, 0); 144 drm_buddy_free_list(&bman->mm, &bman_res->blocks, 0); 177 list_for_each_entry(block, &bman_res->blocks, link) { 210 list_for_each_entry(block, &bman_res->blocks, link) { 269 * simplifies keeping the property where allocated blocks having natural
|
/linux-master/arch/arm64/crypto/ |
H A D | sha256-glue.c | 31 int blocks) 33 sha256_block_data_order(sst->state, src, blocks); 40 int blocks) 42 sha256_block_neon(sst->state, src, blocks); 30 sha256_arm64_transform(struct sha256_state *sst, u8 const *src, int blocks) argument 39 sha256_neon_transform(struct sha256_state *sst, u8 const *src, int blocks) argument
|
H A D | aes-ce-ccm-glue.c | 36 int blocks, u8 dg[], int enc_before, 106 u32 blocks = abytes / AES_BLOCK_SIZE; local 108 if (macp == AES_BLOCK_SIZE || (!macp && blocks > 0)) { 109 u32 rem = ce_aes_mac_update(in, rk, rounds, blocks, mac, 111 u32 adv = (blocks - rem) * AES_BLOCK_SIZE;
|
/linux-master/include/linux/ |
H A D | stat.h | 51 u64 blocks; member in struct:kstat
|
H A D | async_tx.h | 189 async_gen_syndrome(struct page **blocks, unsigned int *offsets, int src_cnt, 193 async_syndrome_val(struct page **blocks, unsigned int *offsets, int src_cnt,
|
/linux-master/fs/xfs/ |
H A D | xfs_quota.h | 213 xfs_quota_reserve_blkres(struct xfs_inode *ip, int64_t blocks) argument 215 return xfs_trans_reserve_quota_nblks(NULL, ip, blocks, 0, false); 219 xfs_quota_unreserve_blkres(struct xfs_inode *ip, uint64_t blocks) argument 222 xfs_quota_reserve_blkres(ip, -(int64_t)blocks);
|
/linux-master/drivers/md/persistent-data/ |
H A D | dm-transaction-manager.c | 29 dm_block_t blocks[PREFETCH_SIZE]; member in struct:prefetch_set 42 p->blocks[i] = PREFETCH_SENTINEL; 56 if (p->blocks[h] == PREFETCH_SENTINEL) 57 p->blocks[h] = b; 69 if (p->blocks[i] != PREFETCH_SENTINEL) { 70 dm_bm_prefetch(bm, p->blocks[i]); 71 p->blocks[i] = PREFETCH_SENTINEL; 260 * New blocks count as shadows in that they don't need to be
|
/linux-master/fs/ocfs2/ |
H A D | ocfs2.h | 44 * amount of inlined blocks to be stored on an array and grow the 128 #define OCFS2_LOCK_UPCONVERT_FINISHING (0x00000800) /* blocks the dc thread 725 u64 blocks) 730 blocks += (1 << b_to_c_bits) - 1; 731 return (u32)(blocks >> b_to_c_bits); 735 u64 blocks) 740 return (u32)(blocks >> b_to_c_bits); 780 u64 blocks) 785 clusters = ocfs2_blocks_to_clusters(sb, blocks); 802 u64 blocks; local 724 ocfs2_clusters_for_blocks(struct super_block *sb, u64 blocks) argument 734 ocfs2_blocks_to_clusters(struct super_block *sb, u64 blocks) argument 779 ocfs2_block_to_cluster_start(struct super_block *sb, u64 blocks) argument [all...] |
/linux-master/drivers/gpu/drm/xe/ |
H A D | xe_ttm_vram_mgr.c | 78 INIT_LIST_HEAD(&vres->blocks); 144 &vres->blocks, 153 if (!drm_buddy_block_trim(mm, vres->base.size, &vres->blocks)) 162 list_for_each_entry(block, &vres->blocks, link) { 178 xe_is_vram_mgr_blocks_contiguous(mm, &vres->blocks)) 186 struct drm_buddy_block *block = list_first_entry(&vres->blocks, 199 drm_buddy_free_list(mm, &vres->blocks, 0); 217 drm_buddy_free_list(mm, &vres->blocks, 0); 262 list_for_each_entry(block, &vres->blocks, link) { 292 list_for_each_entry(block, &vres->blocks, lin [all...] |
/linux-master/include/media/ |
H A D | cec.h | 502 * at least two blocks and one or more of the extensions blocks are CEA-861 503 * blocks. 514 unsigned int blocks = size / 128; local 518 /* Sanity check: at least 2 blocks and a multiple of the block size */ 519 if (blocks < 2 || size % 128) 523 * If there are fewer extension blocks than the size, then update 524 * 'blocks'. It is allowed to have more extension blocks than the size, 526 * though more blocks ar [all...] |
/linux-master/fs/xfs/scrub/ |
H A D | fscounters.c | 32 * AGs counting the number of free blocks, free space btree blocks, per-AG 38 * the free blocks, in practice we prefer not do that for a scan because 245 * summary counts (total inodes, free inodes, free data blocks) to an incore 257 /* Count free space btree blocks manually for pre-lazysbcount filesystems. */ 264 xfs_extlen_t blocks; local 271 error = xfs_btree_count_blocks(sc->sa.bno_cur, &blocks); 274 fsc->fdblocks += blocks - 1; 276 error = xfs_btree_count_blocks(sc->sa.cnt_cur, &blocks); 279 fsc->fdblocks += blocks [all...] |
/linux-master/drivers/block/ |
H A D | ataflop.c | 172 unsigned blocks; /* total number of blocks */ member in struct:atari_disk_type 284 * default_params[].blocks > 0 - a bit in unit[].flags might be used for this?) 774 if (!UDT || desc->track >= UDT->blocks/UDT->spt/2 || desc->head >= 2) { 1181 if (SUDT[-1].blocks > ReqBlock) { 1185 SUDT->blocks); 1200 SUDT->blocks); 1473 if (default_params[drive].blocks == 0) 1543 set_capacity(bd->rq->q->disk, UDT->blocks); 1563 set_capacity(bd->rq->q->disk, UDT->blocks); [all...] |
/linux-master/drivers/gpu/drm/tests/ |
H A D | drm_buddy_test.c | 229 * Allocate cleared blocks in the bias range when the DRM buddy's clear avail is 231 * when no cleared blocks are available and exercise the fallback path too. The resulting 232 * blocks should always be dirty. 464 * At this point we should have enough contiguous space for 2 blocks, 497 LIST_HEAD(blocks); 516 block = list_first_entry_or_null(&blocks, typeof(*block), link); 531 KUNIT_ASSERT_TRUE_MSG(test, block, "alloc_blocks has no blocks\n"); 533 list_move_tail(&block->link, &blocks); 543 KUNIT_ASSERT_TRUE_MSG(test, block, "alloc_blocks has no blocks\n"); 556 /* Nothing larger than blocks o [all...] |
/linux-master/drivers/mmc/core/ |
H A D | sdio_io.c | 328 * size and the maximum for IO_RW_EXTENDED of 511 blocks. */ 332 unsigned blocks; local 334 blocks = remainder / func->cur_blksize; 335 if (blocks > max_blocks) 336 blocks = max_blocks; 337 size = blocks * func->cur_blksize; 341 blocks, func->cur_blksize); 356 /* Indicate byte mode by setting "blocks" = 0 */
|
H A D | block.c | 427 idata->buf_bytes = (u64) idata->ic.blksz * idata->ic.blocks; 516 data.blocks = idata->ic.blocks; 554 sbc.arg = data.blocks | (idata->ic.write_flag & BIT(31)); 949 __be32 *blocks; local 966 data.blocks = 1; 975 blocks = kmalloc(4, GFP_KERNEL); 976 if (!blocks) 979 sg_init_one(&sg, blocks, 4); 983 result = ntohl(*blocks); 1871 u32 blocks; local [all...] |
H A D | mmc_test.c | 69 * @blocks: number of (512 byte) blocks currently mapped by @sg 81 unsigned int blocks; member in struct:mmc_test_area 190 struct mmc_request *mrq, unsigned int blocks) 202 mrq->sbc->arg = blocks; 211 unsigned dev_addr, unsigned blocks, unsigned blksz, int write) 216 if (blocks > 1) { 230 if (blocks == 1) 239 mrq->data->blocks = blocks; 189 mmc_test_prepare_sbc(struct mmc_test_card *test, struct mmc_request *mrq, unsigned int blocks) argument 209 mmc_test_prepare_mrq(struct mmc_test_card *test, struct mmc_request *mrq, struct scatterlist *sg, unsigned sg_len, unsigned dev_addr, unsigned blocks, unsigned blksz, int write) argument 873 mmc_test_simple_transfer(struct mmc_test_card *test, struct scatterlist *sg, unsigned sg_len, unsigned dev_addr, unsigned blocks, unsigned blksz, int write) argument 899 mmc_test_broken_transfer(struct mmc_test_card *test, unsigned blocks, unsigned blksz, int write) argument 930 mmc_test_transfer(struct mmc_test_card *test, struct scatterlist *sg, unsigned sg_len, unsigned dev_addr, unsigned blocks, unsigned blksz, int write) argument [all...] |
/linux-master/fs/gfs2/ |
H A D | inode.h | 45 static inline void gfs2_set_inode_blocks(struct inode *inode, u64 blocks) argument 47 inode->i_blocks = blocks << (inode->i_blkbits - 9);
|
/linux-master/fs/sysv/ |
H A D | itree.c | 5 * Handling of indirect blocks' trees. 406 /* Clear the ends of indirect blocks on the shared branch */ 436 unsigned blocks, res, direct = DIRECT, i = DEPTH; local 437 blocks = (size + s->s_blocksize - 1) >> s->s_blocksize_bits; 438 res = blocks; 439 while (--i && blocks > direct) { 440 blocks = ((blocks - direct - 1) >> ptrs_bits) + 1; 441 res += blocks; 453 stat->blocks [all...] |
/linux-master/fs/squashfs/ |
H A D | file.c | 13 * consists of a sequence of contiguous compressed blocks, and/or a 16 * file inode (itself stored in one or more compressed metadata blocks). 24 * is split into slots, caching up to eight 224 GiB files (128 KiB blocks). 158 * Read the next n blocks from the block list, starting from 174 int blocks = min_t(int, n, PAGE_SIZE >> 2); local 177 offset, blocks << 2); 184 for (i = 0; i < blocks; i++) { 192 n -= blocks; 211 * the number of metadata blocks that need to be read fits into the cache. 215 static inline int calculate_skip(u64 blocks) argument 276 int blocks = skip * SQUASHFS_META_INDEXES; local [all...] |
/linux-master/fs/befs/ |
H A D | datastream.c | 161 * befs_count_blocks - blocks used by a file 165 * Counts the number of fs blocks that the file represented by 174 befs_blocknr_t blocks; local 175 befs_blocknr_t datablocks; /* File data blocks */ 176 befs_blocknr_t metablocks; /* FS metadata blocks */ 192 * Double indir block, plus all the indirect blocks it maps. 194 * BEFS_DBLINDIR_BRUN_LEN blocks long. Therefore, we know 196 * and from that we know how many indirect blocks it takes to 197 * map them. We assume that the indirect blocks are also 198 * BEFS_DBLINDIR_BRUN_LEN blocks lon [all...] |