UBIFS_BLOCK_SIZE
factor = UBIFS_BLOCK_SIZE;
if (clen <= 0 || clen > UBIFS_BLOCK_SIZE || clen > dlen) {
ubifs_assert(c, dlen <= UBIFS_BLOCK_SIZE);
stat->blksize = UBIFS_BLOCK_SIZE;
size = ALIGN(size, UBIFS_BLOCK_SIZE);
int offset = new_size & (UBIFS_BLOCK_SIZE - 1), budgeted = 1;
if (new_size & (UBIFS_BLOCK_SIZE - 1))
beyond = (i_size + UBIFS_BLOCK_SIZE - 1) >> UBIFS_BLOCK_SHIFT;
folio_zero_range(folio, offset, UBIFS_BLOCK_SIZE);
int ilen = i_size & (UBIFS_BLOCK_SIZE - 1);
offset += UBIFS_BLOCK_SIZE;
folio_zero_range(folio, offset, UBIFS_BLOCK_SIZE);
folio_zero_range(folio, offset, UBIFS_BLOCK_SIZE);
if (len <= 0 || len > UBIFS_BLOCK_SIZE)
out_len = UBIFS_BLOCK_SIZE;
if (len < UBIFS_BLOCK_SIZE)
UBIFS_BLOCK_SIZE - len);
if (len <= 0 || len > UBIFS_BLOCK_SIZE)
folio_zero_range(folio, offset, UBIFS_BLOCK_SIZE);
offset += UBIFS_BLOCK_SIZE;
out_len = UBIFS_BLOCK_SIZE;
if (len < UBIFS_BLOCK_SIZE)
folio_zero_range(folio, offset + len, UBIFS_BLOCK_SIZE - len);
blen = min_t(size_t, len, UBIFS_BLOCK_SIZE);
ubifs_assert(c, out_len <= UBIFS_BLOCK_SIZE);
dlen = new_size & (UBIFS_BLOCK_SIZE - 1);
if (dn_len <= 0 || dn_len > UBIFS_BLOCK_SIZE) {
bit = new_size & (UBIFS_BLOCK_SIZE - 1);
bit = old_size & (UBIFS_BLOCK_SIZE - 1);
ubifs_assert(c, len <= UBIFS_BLOCK_SIZE);
ubifs_assert(c, compr_len <= UBIFS_BLOCK_SIZE);
return (1ULL << UBIFS_S_KEY_BLOCK_BITS) * UBIFS_BLOCK_SIZE;
min_blk = r->new_size / UBIFS_BLOCK_SIZE;
if (r->new_size & (UBIFS_BLOCK_SIZE - 1))
max_blk = r->old_size / UBIFS_BLOCK_SIZE;
if ((r->old_size & (UBIFS_BLOCK_SIZE - 1)) == 0)
UBIFS_BLOCK_SIZE;
sb->s_blocksize = UBIFS_BLOCK_SIZE;
if (PAGE_SIZE < UBIFS_BLOCK_SIZE) {
buf->f_bsize = UBIFS_BLOCK_SIZE;
block = (size + UBIFS_BLOCK_SIZE - 1) >> UBIFS_BLOCK_SHIFT;
#define UBIFS_MAX_INO_DATA UBIFS_BLOCK_SIZE
#define UBIFS_MAX_DATA_NODE_SZ (UBIFS_DATA_NODE_SZ + UBIFS_BLOCK_SIZE)
(UBIFS_DATA_NODE_SZ + UBIFS_BLOCK_SIZE)
#define UBIFS_BLOCKS_PER_PAGE (PAGE_SIZE / UBIFS_BLOCK_SIZE)