/linux-master/include/linux/mtd/ |
H A D | bbm.h | 28 * @maxblocks: maximum number of blocks to search for a bbt. This number of 48 int maxblocks; member in struct:nand_bbt_descr
|
/linux-master/fs/nilfs2/ |
H A D | direct.c | 52 unsigned int maxblocks) 73 maxblocks = min_t(unsigned int, maxblocks, 75 for (cnt = 1; cnt < maxblocks && 50 nilfs_direct_lookup_contig(const struct nilfs_bmap *direct, __u64 key, __u64 *ptrp, unsigned int maxblocks) argument
|
H A D | inode.c | 82 unsigned int maxblocks = bh_result->b_size >> inode->i_blkbits; local 85 ret = nilfs_bmap_lookup_contig(ii->i_bmap, blkoff, &blknum, maxblocks); 1187 unsigned int maxblocks; local 1215 maxblocks = INT_MAX; 1217 maxblocks = min_t(sector_t, delalloc_blkoff - blkoff, 1218 maxblocks); 1223 NILFS_I(inode)->i_bmap, blkoff, &blkphy, maxblocks);
|
H A D | bmap.c | 95 unsigned int maxblocks) 100 ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks); 94 nilfs_bmap_lookup_contig(struct nilfs_bmap *bmap, __u64 key, __u64 *ptrp, unsigned int maxblocks) argument
|
H A D | btree.c | 704 unsigned int maxblocks) 731 if (cnt == maxblocks) 749 if (ptr2 != ptr + cnt || ++cnt == maxblocks) 702 nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, __u64 key, __u64 *ptrp, unsigned int maxblocks) argument
|
/linux-master/fs/jfs/ |
H A D | jfs_xtree.h | 111 struct inode *ip, int xflag, s64 xoff, int maxblocks,
|
H A D | jfs_xtree.c | 1934 * maxblocks - max extent length; 1942 struct inode *ip, int xflag, s64 xoff, s32 maxblocks, 1965 jfs_info("xtAppend: xoff:0x%lx maxblocks:%d xlen:%d xaddr:0x%lx", 1966 (ulong) xoff, maxblocks, xlen, (ulong) xaddr); 2013 for (; nsplit > 0; nsplit--, pxd++, xaddr += nblocks, maxblocks -= nblocks) { 2028 xlen = min(xlen, maxblocks); 1941 xtAppend(tid_t tid, struct inode *ip, int xflag, s64 xoff, s32 maxblocks, s32 * xlenp, s64 * xaddrp, int flag) argument
|
/linux-master/fs/ext2/ |
H A D | balloc.c | 570 * @maxblocks: the ending block (group relative) of the reservation 577 ext2_grpblk_t maxblocks) 581 next = ext2_find_next_zero_bit(bh->b_data, maxblocks, start); 582 if (next >= maxblocks) 592 * @maxblocks: the ending block (group relative) for the search 600 find_next_usable_block(int start, struct buffer_head *bh, int maxblocks) argument 615 if (end_goal > maxblocks) 616 end_goal = maxblocks; 628 r = memscan(p, 0, ((maxblocks + 7) >> 3) - (here >> 3)); 631 if (next < maxblocks 576 bitmap_search_next_usable_block(ext2_grpblk_t start, struct buffer_head *bh, ext2_grpblk_t maxblocks) argument [all...] |
H A D | inode.c | 625 sector_t iblock, unsigned long maxblocks, 641 BUG_ON(maxblocks == 0); 654 while (count < maxblocks && count <= blocks_to_boundary) { 730 maxblocks, blocks_to_boundary); 624 ext2_get_blocks(struct inode *inode, sector_t iblock, unsigned long maxblocks, u32 *bno, bool *new, bool *boundary, int create) argument
|
/linux-master/arch/x86/crypto/ |
H A D | chacha_glue.c | 42 static unsigned int chacha_advance(unsigned int len, unsigned int maxblocks) argument 44 len = min(len, maxblocks * CHACHA_BLOCK_SIZE);
|
/linux-master/drivers/mtd/nand/raw/ |
H A D | nand_bbt.c | 586 for (block = 0; block < td->maxblocks; block++) { 684 for (i = 0; i < td->maxblocks; i++) { 1161 block = ((i + 1) * nrblocks) - td->maxblocks; 1164 for (j = 0; j < td->maxblocks; j++) { 1327 .maxblocks = NAND_BBT_SCAN_MAXBLOCKS, 1337 .maxblocks = NAND_BBT_SCAN_MAXBLOCKS, 1347 .maxblocks = NAND_BBT_SCAN_MAXBLOCKS, 1357 .maxblocks = NAND_BBT_SCAN_MAXBLOCKS,
|
H A D | diskonchip.c | 915 unsigned blocks, maxblocks; local 942 maxblocks = min(32768U, mtd->erasesize - psize); 951 while (blocks > maxblocks) { 953 maxblocks = min(32768U, (maxblocks << 1) + psize); 970 maxblocks = min(32768U, mtd->erasesize - psize); 973 if (blocks > maxblocks) { 1190 this->bbt_td->maxblocks = INFTL_BBT_RESERVED_BLOCKS; 1200 this->bbt_md->maxblocks = INFTL_BBT_RESERVED_BLOCKS;
|
H A D | cafe_nand.c | 498 .maxblocks = 4, 508 .maxblocks = 4, 518 .maxblocks = 4, 528 .maxblocks = 4,
|
H A D | lpc32xx_slc.c | 184 .maxblocks = 4, 194 .maxblocks = 4,
|
H A D | pl35x-nand-controller.c | 200 .maxblocks = 4, 210 .maxblocks = 4,
|
H A D | fsl_ifc_nand.c | 70 .maxblocks = 4, 80 .maxblocks = 4,
|
H A D | fsl_elbc_nand.c | 131 .maxblocks = 4, 141 .maxblocks = 4,
|
H A D | mxc_nand.c | 1445 .maxblocks = 4, 1455 .maxblocks = 4,
|
H A D | marvell_nand.c | 2372 .maxblocks = 8, /* Last 8 blocks in each chip */ 2382 .maxblocks = 8, /* Last 8 blocks in each chip */
|
/linux-master/fs/xfs/ |
H A D | xfs_rtalloc.c | 476 int maxblocks; local 482 * maxblocks is the maximum possible number of 487 maxblocks = 0; 489 maxblocks = 1; 491 maxblocks = 2 << (maxlog - mp->m_blkbit_log); 494 * We need to check bbno + i + maxblocks down to 499 j = min(i + maxblocks, j);
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_bmap.c | 58 uint64_t maxblocks; /* max blocks at this level */ local 88 maxblocks = howmany_64(maxleafents, minleafrecs); 89 for (level = 1; maxblocks > 1; level++) { 90 if (maxblocks <= maxrootrecs) 91 maxblocks = 1; 93 maxblocks = howmany_64(maxblocks, minnoderecs);
|
/linux-master/fs/f2fs/ |
H A D | data.c | 1479 unsigned int maxblocks = map->m_len; local 1487 map->m_len = min((pgoff_t)maxblocks, ei.fofs + ei.len - pgoff); 1517 unsigned int maxblocks = map->m_len; local 1530 if (!maxblocks) 1545 end = pgofs + maxblocks;
|