blob: caca49b77d9e112c33191820f62720d8f1b74f35 [file] [log] [blame]
// SPDX-License-Identifier: GPL-2.0+ OR Apache-2.0
/*
* Copyright (C) 2018-2019 HUAWEI, Inc.
* http://www.huawei.com/
* Created by Miao Xie <miaoxie@huawei.com>
* with heavy changes by Gao Xiang <gaoxiang25@huawei.com>
*/
#include <stdlib.h>
#include <erofs/cache.h>
#include "erofs/io.h"
#include "erofs/print.h"
static struct erofs_buffer_block blkh = {
.list = LIST_HEAD_INIT(blkh.list),
.blkaddr = NULL_ADDR,
};
static erofs_blk_t tail_blkaddr, erofs_metablkcnt;
/* buckets for all mapped buffer blocks to boost up allocation */
static struct list_head mapped_buckets[META + 1][EROFS_MAX_BLOCK_SIZE];
/* last mapped buffer block to accelerate erofs_mapbh() */
static struct erofs_buffer_block *last_mapped_block = &blkh;
static bool erofs_bh_flush_drop_directly(struct erofs_buffer_head *bh)
{
return erofs_bh_flush_generic_end(bh);
}
const struct erofs_bhops erofs_drop_directly_bhops = {
.flush = erofs_bh_flush_drop_directly,
};
static bool erofs_bh_flush_skip_write(struct erofs_buffer_head *bh)
{
return false;
}
const struct erofs_bhops erofs_skip_write_bhops = {
.flush = erofs_bh_flush_skip_write,
};
/* return buffer_head of erofs super block (with size 0) */
struct erofs_buffer_head *erofs_buffer_init(void)
{
int i, j;
struct erofs_buffer_head *bh = erofs_balloc(META, 0, 0, 0);
if (IS_ERR(bh))
return bh;
bh->op = &erofs_skip_write_bhops;
for (i = 0; i < ARRAY_SIZE(mapped_buckets); i++)
for (j = 0; j < ARRAY_SIZE(mapped_buckets[0]); j++)
init_list_head(&mapped_buckets[i][j]);
return bh;
}
static void erofs_bupdate_mapped(struct erofs_buffer_block *bb)
{
struct list_head *bkt;
if (bb->blkaddr == NULL_ADDR)
return;
bkt = mapped_buckets[bb->type] +
(bb->buffers.off & (erofs_blksiz(&sbi) - 1));
list_del(&bb->mapped_list);
list_add_tail(&bb->mapped_list, bkt);
}
/* return occupied bytes in specific buffer block if succeed */
static int __erofs_battach(struct erofs_buffer_block *bb,
struct erofs_buffer_head *bh,
erofs_off_t incr,
unsigned int alignsize,
unsigned int extrasize,
bool dryrun)
{
const unsigned int blksiz = erofs_blksiz(&sbi);
const unsigned int blkmask = blksiz - 1;
const erofs_off_t alignedoffset = roundup(bb->buffers.off, alignsize);
const int oob = cmpsgn(roundup(((bb->buffers.off - 1) & blkmask) + 1,
alignsize) + incr + extrasize, blksiz);
bool tailupdate = false;
erofs_blk_t blkaddr;
if (oob >= 0) {
/* the next buffer block should be NULL_ADDR all the time */
if (oob && list_next_entry(bb, list)->blkaddr != NULL_ADDR)
return -EINVAL;
blkaddr = bb->blkaddr;
if (blkaddr != NULL_ADDR) {
tailupdate = (tail_blkaddr == blkaddr +
DIV_ROUND_UP(bb->buffers.off, blksiz));
if (oob && !tailupdate)
return -EINVAL;
}
}
if (!dryrun) {
if (bh) {
bh->off = alignedoffset;
bh->block = bb;
list_add_tail(&bh->list, &bb->buffers.list);
}
bb->buffers.off = alignedoffset + incr;
/* need to update the tail_blkaddr */
if (tailupdate)
tail_blkaddr = blkaddr +
DIV_ROUND_UP(bb->buffers.off, blksiz);
erofs_bupdate_mapped(bb);
}
return ((alignedoffset + incr - 1) & blkmask) + 1;
}
int erofs_bh_balloon(struct erofs_buffer_head *bh, erofs_off_t incr)
{
struct erofs_buffer_block *const bb = bh->block;
/* should be the tail bh in the corresponding buffer block */
if (bh->list.next != &bb->buffers.list)
return -EINVAL;
return __erofs_battach(bb, NULL, incr, 1, 0, false);
}
static int erofs_bfind_for_attach(int type, erofs_off_t size,
unsigned int required_ext,
unsigned int inline_ext,
unsigned int alignsize,
struct erofs_buffer_block **bbp)
{
const unsigned int blksiz = erofs_blksiz(&sbi);
struct erofs_buffer_block *cur, *bb;
unsigned int used0, used_before, usedmax, used;
int ret;
used0 = ((size + required_ext) & (blksiz - 1)) + inline_ext;
/* inline data should be in the same fs block */
if (used0 > blksiz)
return -ENOSPC;
if (!used0 || alignsize == blksiz) {
*bbp = NULL;
return 0;
}
usedmax = 0;
bb = NULL;
/* try to find a most-fit mapped buffer block first */
if (size + required_ext + inline_ext >= blksiz)
goto skip_mapped;
used_before = rounddown(blksiz -
(size + required_ext + inline_ext), alignsize);
for (; used_before; --used_before) {
struct list_head *bt = mapped_buckets[type] + used_before;
if (list_empty(bt))
continue;
cur = list_first_entry(bt, struct erofs_buffer_block,
mapped_list);
/* last mapped block can be expended, don't handle it here */
if (list_next_entry(cur, list)->blkaddr == NULL_ADDR) {
DBG_BUGON(cur != last_mapped_block);
continue;
}
DBG_BUGON(cur->type != type);
DBG_BUGON(cur->blkaddr == NULL_ADDR);
DBG_BUGON(used_before != (cur->buffers.off & (blksiz - 1)));
ret = __erofs_battach(cur, NULL, size, alignsize,
required_ext + inline_ext, true);
if (ret < 0) {
DBG_BUGON(1);
continue;
}
/* should contain all data in the current block */
used = ret + required_ext + inline_ext;
DBG_BUGON(used > blksiz);
bb = cur;
usedmax = used;
break;
}
skip_mapped:
/* try to start from the last mapped one, which can be expended */
cur = last_mapped_block;
if (cur == &blkh)
cur = list_next_entry(cur, list);
for (; cur != &blkh; cur = list_next_entry(cur, list)) {
used_before = cur->buffers.off & (blksiz - 1);
/* skip if buffer block is just full */
if (!used_before)
continue;
/* skip if the entry which has different type */
if (cur->type != type)
continue;
ret = __erofs_battach(cur, NULL, size, alignsize,
required_ext + inline_ext, true);
if (ret < 0)
continue;
used = ((ret + required_ext) & (blksiz - 1)) + inline_ext;
/* should contain inline data in current block */
if (used > blksiz)
continue;
/*
* remaining should be smaller than before or
* larger than allocating a new buffer block
*/
if (used < used_before && used < used0)
continue;
if (usedmax < used) {
bb = cur;
usedmax = used;
}
}
*bbp = bb;
return 0;
}
struct erofs_buffer_head *erofs_balloc(int type, erofs_off_t size,
unsigned int required_ext,
unsigned int inline_ext)
{
struct erofs_buffer_block *bb;
struct erofs_buffer_head *bh;
unsigned int alignsize;
int ret = get_alignsize(type, &type);
if (ret < 0)
return ERR_PTR(ret);
DBG_BUGON(type < 0 || type > META);
alignsize = ret;
/* try to find if we could reuse an allocated buffer block */
ret = erofs_bfind_for_attach(type, size, required_ext, inline_ext,
alignsize, &bb);
if (ret)
return ERR_PTR(ret);
if (bb) {
bh = malloc(sizeof(struct erofs_buffer_head));
if (!bh)
return ERR_PTR(-ENOMEM);
} else {
/* get a new buffer block instead */
bb = malloc(sizeof(struct erofs_buffer_block));
if (!bb)
return ERR_PTR(-ENOMEM);
bb->type = type;
bb->blkaddr = NULL_ADDR;
bb->buffers.off = 0;
init_list_head(&bb->buffers.list);
if (type == DATA)
list_add(&bb->list, &last_mapped_block->list);
else
list_add_tail(&bb->list, &blkh.list);
init_list_head(&bb->mapped_list);
bh = malloc(sizeof(struct erofs_buffer_head));
if (!bh) {
free(bb);
return ERR_PTR(-ENOMEM);
}
}
ret = __erofs_battach(bb, bh, size, alignsize,
required_ext + inline_ext, false);
if (ret < 0) {
free(bh);
return ERR_PTR(ret);
}
return bh;
}
struct erofs_buffer_head *erofs_battach(struct erofs_buffer_head *bh,
int type, unsigned int size)
{
struct erofs_buffer_block *const bb = bh->block;
struct erofs_buffer_head *nbh;
unsigned int alignsize;
int ret = get_alignsize(type, &type);
if (ret < 0)
return ERR_PTR(ret);
alignsize = ret;
/* should be the tail bh in the corresponding buffer block */
if (bh->list.next != &bb->buffers.list)
return ERR_PTR(-EINVAL);
nbh = malloc(sizeof(*nbh));
if (!nbh)
return ERR_PTR(-ENOMEM);
ret = __erofs_battach(bb, nbh, size, alignsize, 0, false);
if (ret < 0) {
free(nbh);
return ERR_PTR(ret);
}
return nbh;
}
static erofs_blk_t __erofs_mapbh(struct erofs_buffer_block *bb)
{
erofs_blk_t blkaddr;
if (bb->blkaddr == NULL_ADDR) {
bb->blkaddr = tail_blkaddr;
last_mapped_block = bb;
erofs_bupdate_mapped(bb);
}
blkaddr = bb->blkaddr + BLK_ROUND_UP(&sbi, bb->buffers.off);
if (blkaddr > tail_blkaddr)
tail_blkaddr = blkaddr;
return blkaddr;
}
erofs_blk_t erofs_mapbh(struct erofs_buffer_block *bb)
{
struct erofs_buffer_block *t = last_mapped_block;
if (bb && bb->blkaddr != NULL_ADDR)
return bb->blkaddr;
do {
t = list_next_entry(t, list);
if (t == &blkh)
break;
DBG_BUGON(t->blkaddr != NULL_ADDR);
(void)__erofs_mapbh(t);
} while (t != bb);
return tail_blkaddr;
}
static void erofs_bfree(struct erofs_buffer_block *bb)
{
DBG_BUGON(!list_empty(&bb->buffers.list));
if (bb == last_mapped_block)
last_mapped_block = list_prev_entry(bb, list);
list_del(&bb->mapped_list);
list_del(&bb->list);
free(bb);
}
bool erofs_bflush(struct erofs_buffer_block *bb)
{
const unsigned int blksiz = erofs_blksiz(&sbi);
struct erofs_buffer_block *p, *n;
erofs_blk_t blkaddr;
list_for_each_entry_safe(p, n, &blkh.list, list) {
struct erofs_buffer_head *bh, *nbh;
unsigned int padding;
bool skip = false;
if (p == bb)
break;
/* check if the buffer block can flush */
list_for_each_entry(bh, &p->buffers.list, list)
if (bh->op->preflush && !bh->op->preflush(bh))
return false;
blkaddr = __erofs_mapbh(p);
list_for_each_entry_safe(bh, nbh, &p->buffers.list, list) {
/* flush and remove bh */
if (!bh->op->flush(bh))
skip = true;
}
if (skip)
continue;
padding = blksiz - (p->buffers.off & (blksiz - 1));
if (padding != blksiz)
dev_fillzero(&sbi, erofs_pos(&sbi, blkaddr) - padding,
padding, true);
if (p->type != DATA)
erofs_metablkcnt += BLK_ROUND_UP(&sbi, p->buffers.off);
erofs_dbg("block %u to %u flushed", p->blkaddr, blkaddr - 1);
erofs_bfree(p);
}
return true;
}
void erofs_bdrop(struct erofs_buffer_head *bh, bool tryrevoke)
{
struct erofs_buffer_block *const bb = bh->block;
const erofs_blk_t blkaddr = bh->block->blkaddr;
bool rollback = false;
/* tail_blkaddr could be rolled back after revoking all bhs */
if (tryrevoke && blkaddr != NULL_ADDR &&
tail_blkaddr == blkaddr + BLK_ROUND_UP(&sbi, bb->buffers.off))
rollback = true;
bh->op = &erofs_drop_directly_bhops;
erofs_bh_flush_generic_end(bh);
if (!list_empty(&bb->buffers.list))
return;
if (!rollback && bb->type != DATA)
erofs_metablkcnt += BLK_ROUND_UP(&sbi, bb->buffers.off);
erofs_bfree(bb);
if (rollback)
tail_blkaddr = blkaddr;
}
erofs_blk_t erofs_total_metablocks(void)
{
return erofs_metablkcnt;
}