2019-07-31 15:57:31 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2019-06-24 07:22:52 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2018-2019 HUAWEI, Inc.
|
2020-07-13 13:09:44 +00:00
|
|
|
* https://www.huawei.com/
|
2019-06-24 07:22:52 +00:00
|
|
|
* Created by Gao Xiang <gaoxiang25@huawei.com>
|
|
|
|
*/
|
|
|
|
#include "internal.h"
|
|
|
|
#include <asm/unaligned.h>
|
|
|
|
#include <trace/events/erofs.h>
|
|
|
|
|
|
|
|
int z_erofs_fill_inode(struct inode *inode)
|
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(inode);
|
2021-04-07 04:39:24 +00:00
|
|
|
struct erofs_sb_info *sbi = EROFS_SB(inode->i_sb);
|
2019-06-24 07:22:52 +00:00
|
|
|
|
2021-04-07 04:39:24 +00:00
|
|
|
if (!erofs_sb_has_big_pcluster(sbi) &&
|
|
|
|
vi->datalayout == EROFS_INODE_FLAT_COMPRESSION_LEGACY) {
|
2019-06-24 07:22:52 +00:00
|
|
|
vi->z_advise = 0;
|
|
|
|
vi->z_algorithmtype[0] = 0;
|
|
|
|
vi->z_algorithmtype[1] = 0;
|
2019-07-31 15:57:48 +00:00
|
|
|
vi->z_logical_clusterbits = LOG_BLOCK_SIZE;
|
2019-09-04 02:08:56 +00:00
|
|
|
set_bit(EROFS_I_Z_INITED_BIT, &vi->flags);
|
2019-06-24 07:22:52 +00:00
|
|
|
}
|
2019-11-08 03:37:33 +00:00
|
|
|
inode->i_mapping->a_ops = &z_erofs_aops;
|
2019-06-24 07:22:52 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:37:33 +00:00
|
|
|
static int z_erofs_fill_inode_lazy(struct inode *inode)
|
2019-06-24 07:22:52 +00:00
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
struct super_block *const sb = inode->i_sb;
|
|
|
|
int err;
|
|
|
|
erofs_off_t pos;
|
|
|
|
struct page *page;
|
|
|
|
void *kaddr;
|
|
|
|
struct z_erofs_map_header *h;
|
|
|
|
|
2021-02-09 13:06:18 +00:00
|
|
|
if (test_bit(EROFS_I_Z_INITED_BIT, &vi->flags)) {
|
|
|
|
/*
|
|
|
|
* paired with smp_mb() at the end of the function to ensure
|
|
|
|
* fields will only be observed after the bit is set.
|
|
|
|
*/
|
|
|
|
smp_mb();
|
2019-06-24 07:22:52 +00:00
|
|
|
return 0;
|
2021-02-09 13:06:18 +00:00
|
|
|
}
|
2019-06-24 07:22:52 +00:00
|
|
|
|
2019-09-04 02:08:56 +00:00
|
|
|
if (wait_on_bit_lock(&vi->flags, EROFS_I_BL_Z_BIT, TASK_KILLABLE))
|
2019-06-24 07:22:52 +00:00
|
|
|
return -ERESTARTSYS;
|
|
|
|
|
|
|
|
err = 0;
|
2019-09-04 02:08:56 +00:00
|
|
|
if (test_bit(EROFS_I_Z_INITED_BIT, &vi->flags))
|
2019-06-24 07:22:52 +00:00
|
|
|
goto out_unlock;
|
|
|
|
|
2021-04-07 04:39:24 +00:00
|
|
|
DBG_BUGON(!erofs_sb_has_big_pcluster(EROFS_SB(sb)) &&
|
|
|
|
vi->datalayout == EROFS_INODE_FLAT_COMPRESSION_LEGACY);
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
pos = ALIGN(iloc(EROFS_SB(sb), vi->nid) + vi->inode_isize +
|
|
|
|
vi->xattr_isize, 8);
|
2019-09-04 02:09:03 +00:00
|
|
|
page = erofs_get_meta_page(sb, erofs_blknr(pos));
|
2019-06-24 07:22:52 +00:00
|
|
|
if (IS_ERR(page)) {
|
|
|
|
err = PTR_ERR(page);
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
kaddr = kmap_atomic(page);
|
|
|
|
|
|
|
|
h = kaddr + erofs_blkoff(pos);
|
|
|
|
vi->z_advise = le16_to_cpu(h->h_advise);
|
|
|
|
vi->z_algorithmtype[0] = h->h_algorithmtype & 15;
|
|
|
|
vi->z_algorithmtype[1] = h->h_algorithmtype >> 4;
|
|
|
|
|
|
|
|
if (vi->z_algorithmtype[0] >= Z_EROFS_COMPRESSION_MAX) {
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(sb, "unknown compression format %u for nid %llu, please upgrade kernel",
|
|
|
|
vi->z_algorithmtype[0], vi->nid);
|
2019-08-14 10:37:05 +00:00
|
|
|
err = -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
goto unmap_done;
|
|
|
|
}
|
|
|
|
|
|
|
|
vi->z_logical_clusterbits = LOG_BLOCK_SIZE + (h->h_clusterbits & 7);
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
if (!erofs_sb_has_big_pcluster(EROFS_SB(sb)) &&
|
|
|
|
vi->z_advise & (Z_EROFS_ADVISE_BIG_PCLUSTER_1 |
|
|
|
|
Z_EROFS_ADVISE_BIG_PCLUSTER_2)) {
|
|
|
|
erofs_err(sb, "per-inode big pcluster without sb feature for nid %llu",
|
|
|
|
vi->nid);
|
|
|
|
err = -EFSCORRUPTED;
|
|
|
|
goto unmap_done;
|
|
|
|
}
|
|
|
|
if (vi->datalayout == EROFS_INODE_FLAT_COMPRESSION &&
|
|
|
|
!(vi->z_advise & Z_EROFS_ADVISE_BIG_PCLUSTER_1) ^
|
|
|
|
!(vi->z_advise & Z_EROFS_ADVISE_BIG_PCLUSTER_2)) {
|
|
|
|
erofs_err(sb, "big pcluster head1/2 of compact indexes should be consistent for nid %llu",
|
|
|
|
vi->nid);
|
|
|
|
err = -EFSCORRUPTED;
|
|
|
|
goto unmap_done;
|
|
|
|
}
|
2021-02-09 13:06:18 +00:00
|
|
|
/* paired with smp_mb() at the beginning of the function */
|
|
|
|
smp_mb();
|
2019-09-04 02:08:56 +00:00
|
|
|
set_bit(EROFS_I_Z_INITED_BIT, &vi->flags);
|
2019-06-24 07:22:52 +00:00
|
|
|
unmap_done:
|
|
|
|
kunmap_atomic(kaddr);
|
|
|
|
unlock_page(page);
|
|
|
|
put_page(page);
|
|
|
|
out_unlock:
|
2019-09-04 02:08:56 +00:00
|
|
|
clear_and_wake_up_bit(EROFS_I_BL_Z_BIT, &vi->flags);
|
2019-06-24 07:22:52 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct z_erofs_maprecorder {
|
|
|
|
struct inode *inode;
|
|
|
|
struct erofs_map_blocks *map;
|
|
|
|
void *kaddr;
|
|
|
|
|
|
|
|
unsigned long lcn;
|
|
|
|
/* compression extent information gathered */
|
|
|
|
u8 type;
|
|
|
|
u16 clusterofs;
|
|
|
|
u16 delta[2];
|
2021-04-07 04:39:24 +00:00
|
|
|
erofs_blk_t pblk, compressedlcs;
|
2019-06-24 07:22:52 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static int z_erofs_reload_indexes(struct z_erofs_maprecorder *m,
|
|
|
|
erofs_blk_t eblk)
|
|
|
|
{
|
|
|
|
struct super_block *const sb = m->inode->i_sb;
|
|
|
|
struct erofs_map_blocks *const map = m->map;
|
|
|
|
struct page *mpage = map->mpage;
|
|
|
|
|
|
|
|
if (mpage) {
|
|
|
|
if (mpage->index == eblk) {
|
|
|
|
if (!m->kaddr)
|
|
|
|
m->kaddr = kmap_atomic(mpage);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (m->kaddr) {
|
|
|
|
kunmap_atomic(m->kaddr);
|
|
|
|
m->kaddr = NULL;
|
|
|
|
}
|
|
|
|
put_page(mpage);
|
|
|
|
}
|
|
|
|
|
2019-09-04 02:09:03 +00:00
|
|
|
mpage = erofs_get_meta_page(sb, eblk);
|
2019-06-24 07:22:52 +00:00
|
|
|
if (IS_ERR(mpage)) {
|
|
|
|
map->mpage = NULL;
|
|
|
|
return PTR_ERR(mpage);
|
|
|
|
}
|
|
|
|
m->kaddr = kmap_atomic(mpage);
|
|
|
|
unlock_page(mpage);
|
|
|
|
map->mpage = mpage;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:37:33 +00:00
|
|
|
static int legacy_load_cluster_from_disk(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned long lcn)
|
2019-06-24 07:22:52 +00:00
|
|
|
{
|
|
|
|
struct inode *const inode = m->inode;
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
const erofs_off_t ibase = iloc(EROFS_I_SB(inode), vi->nid);
|
|
|
|
const erofs_off_t pos =
|
|
|
|
Z_EROFS_VLE_LEGACY_INDEX_ALIGN(ibase + vi->inode_isize +
|
|
|
|
vi->xattr_isize) +
|
|
|
|
lcn * sizeof(struct z_erofs_vle_decompressed_index);
|
|
|
|
struct z_erofs_vle_decompressed_index *di;
|
|
|
|
unsigned int advise, type;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
err = z_erofs_reload_indexes(m, erofs_blknr(pos));
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
m->lcn = lcn;
|
|
|
|
di = m->kaddr + erofs_blkoff(pos);
|
|
|
|
|
|
|
|
advise = le16_to_cpu(di->di_advise);
|
|
|
|
type = (advise >> Z_EROFS_VLE_DI_CLUSTER_TYPE_BIT) &
|
|
|
|
((1 << Z_EROFS_VLE_DI_CLUSTER_TYPE_BITS) - 1);
|
|
|
|
switch (type) {
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD:
|
|
|
|
m->clusterofs = 1 << vi->z_logical_clusterbits;
|
|
|
|
m->delta[0] = le16_to_cpu(di->di_u.delta[0]);
|
2021-04-07 04:39:24 +00:00
|
|
|
if (m->delta[0] & Z_EROFS_VLE_DI_D0_CBLKCNT) {
|
|
|
|
if (!(vi->z_advise & Z_EROFS_ADVISE_BIG_PCLUSTER_1)) {
|
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
m->compressedlcs = m->delta[0] &
|
|
|
|
~Z_EROFS_VLE_DI_D0_CBLKCNT;
|
|
|
|
m->delta[0] = 1;
|
|
|
|
}
|
2019-06-24 07:22:52 +00:00
|
|
|
m->delta[1] = le16_to_cpu(di->di_u.delta[1]);
|
|
|
|
break;
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_PLAIN:
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_HEAD:
|
|
|
|
m->clusterofs = le16_to_cpu(di->di_clusterofs);
|
|
|
|
m->pblk = le32_to_cpu(di->di_u.blkaddr);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
DBG_BUGON(1);
|
2019-08-14 10:37:04 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
}
|
|
|
|
m->type = type;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int decode_compactedbits(unsigned int lobits,
|
|
|
|
unsigned int lomask,
|
|
|
|
u8 *in, unsigned int pos, u8 *type)
|
|
|
|
{
|
|
|
|
const unsigned int v = get_unaligned_le32(in + pos / 8) >> (pos & 7);
|
|
|
|
const unsigned int lo = v & lomask;
|
|
|
|
|
|
|
|
*type = (v >> lobits) & 3;
|
|
|
|
return lo;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int unpack_compacted_index(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned int amortizedshift,
|
|
|
|
unsigned int eofs)
|
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(m->inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
const unsigned int lclusterbits = vi->z_logical_clusterbits;
|
|
|
|
const unsigned int lomask = (1 << lclusterbits) - 1;
|
|
|
|
unsigned int vcnt, base, lo, encodebits, nblk;
|
|
|
|
int i;
|
|
|
|
u8 *in, type;
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
bool big_pcluster;
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
if (1 << amortizedshift == 4)
|
|
|
|
vcnt = 2;
|
|
|
|
else if (1 << amortizedshift == 2 && lclusterbits == 12)
|
|
|
|
vcnt = 16;
|
|
|
|
else
|
2019-08-14 10:37:05 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
big_pcluster = vi->z_advise & Z_EROFS_ADVISE_BIG_PCLUSTER_1;
|
2019-06-24 07:22:52 +00:00
|
|
|
encodebits = ((vcnt << amortizedshift) - sizeof(__le32)) * 8 / vcnt;
|
|
|
|
base = round_down(eofs, vcnt << amortizedshift);
|
|
|
|
in = m->kaddr + base;
|
|
|
|
|
|
|
|
i = (eofs - base) >> amortizedshift;
|
|
|
|
|
|
|
|
lo = decode_compactedbits(lclusterbits, lomask,
|
|
|
|
in, encodebits * i, &type);
|
|
|
|
m->type = type;
|
|
|
|
if (type == Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD) {
|
|
|
|
m->clusterofs = 1 << lclusterbits;
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
if (lo & Z_EROFS_VLE_DI_D0_CBLKCNT) {
|
|
|
|
if (!big_pcluster) {
|
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
m->compressedlcs = lo & ~Z_EROFS_VLE_DI_D0_CBLKCNT;
|
|
|
|
m->delta[0] = 1;
|
|
|
|
return 0;
|
|
|
|
} else if (i + 1 != (int)vcnt) {
|
2019-06-24 07:22:52 +00:00
|
|
|
m->delta[0] = lo;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* since the last lcluster in the pack is special,
|
|
|
|
* of which lo saves delta[1] rather than delta[0].
|
|
|
|
* Hence, get delta[0] by the previous lcluster indirectly.
|
|
|
|
*/
|
|
|
|
lo = decode_compactedbits(lclusterbits, lomask,
|
|
|
|
in, encodebits * (i - 1), &type);
|
|
|
|
if (type != Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD)
|
|
|
|
lo = 0;
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
else if (lo & Z_EROFS_VLE_DI_D0_CBLKCNT)
|
|
|
|
lo = 1;
|
2019-06-24 07:22:52 +00:00
|
|
|
m->delta[0] = lo + 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
m->clusterofs = lo;
|
|
|
|
m->delta[0] = 0;
|
|
|
|
/* figout out blkaddr (pblk) for HEAD lclusters */
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
if (!big_pcluster) {
|
|
|
|
nblk = 1;
|
|
|
|
while (i > 0) {
|
|
|
|
--i;
|
|
|
|
lo = decode_compactedbits(lclusterbits, lomask,
|
|
|
|
in, encodebits * i, &type);
|
|
|
|
if (type == Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD)
|
|
|
|
i -= lo;
|
|
|
|
|
|
|
|
if (i >= 0)
|
|
|
|
++nblk;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
nblk = 0;
|
|
|
|
while (i > 0) {
|
|
|
|
--i;
|
|
|
|
lo = decode_compactedbits(lclusterbits, lomask,
|
|
|
|
in, encodebits * i, &type);
|
|
|
|
if (type == Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD) {
|
|
|
|
if (lo & Z_EROFS_VLE_DI_D0_CBLKCNT) {
|
|
|
|
--i;
|
|
|
|
nblk += lo & ~Z_EROFS_VLE_DI_D0_CBLKCNT;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
/* bigpcluster shouldn't have plain d0 == 1 */
|
|
|
|
if (lo <= 1) {
|
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
i -= lo - 2;
|
|
|
|
continue;
|
|
|
|
}
|
2019-06-24 07:22:52 +00:00
|
|
|
++nblk;
|
erofs: support parsing big pcluster compact indexes
Different from non-compact indexes, several lclusters are packed
as the compact form at once and an unique base blkaddr is stored for
each pack, so each lcluster index would take less space on avarage
(e.g. 2 bytes for COMPACT_2B.) btw, that is also why BIG_PCLUSTER
switch should be consistent for compact head0/1.
Prior to big pcluster, the size of all pclusters was 1 lcluster.
Therefore, when a new HEAD lcluster was scanned, blkaddr would be
bumped by 1 lcluster. However, that way doesn't work anymore for
big pcluster since we actually don't know the compressed size of
pclusters in advance (before reading CBLKCNT lcluster).
So, instead, let blkaddr of each pack be the first pcluster blkaddr
with a valid CBLKCNT, in detail,
1) if CBLKCNT starts at the pack, this first valid pcluster is
itself, e.g.
_____________________________________________________________
|_CBLKCNT0_|_NONHEAD_| .. |_HEAD_|_CBLKCNT1_| ... |_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0 ^ += CBLKCNT1
2) if CBLKCNT doesn't start at the pack, the first valid pcluster
is the next pcluster, e.g.
_________________________________________________________
| NONHEAD_| .. |_HEAD_|_CBLKCNT0_| ... |_HEAD_|_HEAD_| ...
^ = blkaddr base ^ += CBLKCNT0
^ += 1
When a CBLKCNT is found, blkaddr will be increased by CBLKCNT
lclusters, or a new HEAD is found immediately, bump blkaddr by 1
instead (see the picture above.)
Also noted if CBLKCNT is the end of the pack, instead of storing
delta1 (distance of the next HEAD lcluster) as normal NONHEADs,
it still uses the compressed block count (delta0) since delta1
can be calculated indirectly but the block count can't.
Adjust decoding logic to fit big pcluster compact indexes as well.
Link: https://lore.kernel.org/r/20210407043927.10623-9-xiang@kernel.org
Acked-by: Chao Yu <yuchao0@huawei.com>
Signed-off-by: Gao Xiang <hsiangkao@redhat.com>
2021-04-07 04:39:25 +00:00
|
|
|
}
|
2019-06-24 07:22:52 +00:00
|
|
|
}
|
|
|
|
in += (vcnt << amortizedshift) - sizeof(__le32);
|
|
|
|
m->pblk = le32_to_cpu(*(__le32 *)in) + nblk;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int compacted_load_cluster_from_disk(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned long lcn)
|
|
|
|
{
|
|
|
|
struct inode *const inode = m->inode;
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
const unsigned int lclusterbits = vi->z_logical_clusterbits;
|
|
|
|
const erofs_off_t ebase = ALIGN(iloc(EROFS_I_SB(inode), vi->nid) +
|
|
|
|
vi->inode_isize + vi->xattr_isize, 8) +
|
|
|
|
sizeof(struct z_erofs_map_header);
|
|
|
|
const unsigned int totalidx = DIV_ROUND_UP(inode->i_size, EROFS_BLKSIZ);
|
|
|
|
unsigned int compacted_4b_initial, compacted_2b;
|
|
|
|
unsigned int amortizedshift;
|
|
|
|
erofs_off_t pos;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (lclusterbits != 12)
|
2019-08-14 10:37:05 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
if (lcn >= totalidx)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
m->lcn = lcn;
|
|
|
|
/* used to align to 32-byte (compacted_2b) alignment */
|
|
|
|
compacted_4b_initial = (32 - ebase % 32) / 4;
|
|
|
|
if (compacted_4b_initial == 32 / 4)
|
|
|
|
compacted_4b_initial = 0;
|
|
|
|
|
|
|
|
if (vi->z_advise & Z_EROFS_ADVISE_COMPACTED_2B)
|
|
|
|
compacted_2b = rounddown(totalidx - compacted_4b_initial, 16);
|
|
|
|
else
|
|
|
|
compacted_2b = 0;
|
|
|
|
|
|
|
|
pos = ebase;
|
|
|
|
if (lcn < compacted_4b_initial) {
|
|
|
|
amortizedshift = 2;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
pos += compacted_4b_initial * 4;
|
|
|
|
lcn -= compacted_4b_initial;
|
|
|
|
|
|
|
|
if (lcn < compacted_2b) {
|
|
|
|
amortizedshift = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
pos += compacted_2b * 2;
|
|
|
|
lcn -= compacted_2b;
|
|
|
|
amortizedshift = 2;
|
|
|
|
out:
|
|
|
|
pos += lcn * (1 << amortizedshift);
|
|
|
|
err = z_erofs_reload_indexes(m, erofs_blknr(pos));
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
return unpack_compacted_index(m, amortizedshift, erofs_blkoff(pos));
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:37:33 +00:00
|
|
|
static int z_erofs_load_cluster_from_disk(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned int lcn)
|
2019-06-24 07:22:52 +00:00
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
const unsigned int datamode = EROFS_I(m->inode)->datalayout;
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
if (datamode == EROFS_INODE_FLAT_COMPRESSION_LEGACY)
|
2019-11-08 03:37:33 +00:00
|
|
|
return legacy_load_cluster_from_disk(m, lcn);
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
if (datamode == EROFS_INODE_FLAT_COMPRESSION)
|
|
|
|
return compacted_load_cluster_from_disk(m, lcn);
|
|
|
|
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:37:33 +00:00
|
|
|
static int z_erofs_extent_lookback(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned int lookback_distance)
|
2019-06-24 07:22:52 +00:00
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(m->inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
struct erofs_map_blocks *const map = m->map;
|
|
|
|
const unsigned int lclusterbits = vi->z_logical_clusterbits;
|
|
|
|
unsigned long lcn = m->lcn;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (lcn < lookback_distance) {
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(m->inode->i_sb,
|
|
|
|
"bogus lookback distance @ nid %llu", vi->nid);
|
2019-06-24 07:22:52 +00:00
|
|
|
DBG_BUGON(1);
|
2019-08-14 10:37:03 +00:00
|
|
|
return -EFSCORRUPTED;
|
2019-06-24 07:22:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* load extent head logical cluster if needed */
|
|
|
|
lcn -= lookback_distance;
|
2019-11-08 03:37:33 +00:00
|
|
|
err = z_erofs_load_cluster_from_disk(m, lcn);
|
2019-06-24 07:22:52 +00:00
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
switch (m->type) {
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD:
|
2019-08-29 16:38:27 +00:00
|
|
|
if (!m->delta[0]) {
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(m->inode->i_sb,
|
|
|
|
"invalid lookback distance 0 @ nid %llu",
|
|
|
|
vi->nid);
|
2019-08-19 10:34:26 +00:00
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
2019-11-08 03:37:33 +00:00
|
|
|
return z_erofs_extent_lookback(m, m->delta[0]);
|
2019-06-24 07:22:52 +00:00
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_PLAIN:
|
|
|
|
map->m_flags &= ~EROFS_MAP_ZIPPED;
|
2020-08-23 22:36:59 +00:00
|
|
|
fallthrough;
|
2019-06-24 07:22:52 +00:00
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_HEAD:
|
|
|
|
map->m_la = (lcn << lclusterbits) | m->clusterofs;
|
|
|
|
break;
|
|
|
|
default:
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(m->inode->i_sb,
|
|
|
|
"unknown type %u @ lcn %lu of nid %llu",
|
|
|
|
m->type, lcn, vi->nid);
|
2019-06-24 07:22:52 +00:00
|
|
|
DBG_BUGON(1);
|
2019-08-14 10:37:04 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2021-04-07 04:39:24 +00:00
|
|
|
static int z_erofs_get_extent_compressedlen(struct z_erofs_maprecorder *m,
|
|
|
|
unsigned int initial_lcn)
|
|
|
|
{
|
|
|
|
struct erofs_inode *const vi = EROFS_I(m->inode);
|
|
|
|
struct erofs_map_blocks *const map = m->map;
|
|
|
|
const unsigned int lclusterbits = vi->z_logical_clusterbits;
|
|
|
|
unsigned long lcn;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
DBG_BUGON(m->type != Z_EROFS_VLE_CLUSTER_TYPE_PLAIN &&
|
|
|
|
m->type != Z_EROFS_VLE_CLUSTER_TYPE_HEAD);
|
|
|
|
if (!(map->m_flags & EROFS_MAP_ZIPPED) ||
|
|
|
|
!(vi->z_advise & Z_EROFS_ADVISE_BIG_PCLUSTER_1)) {
|
|
|
|
map->m_plen = 1 << lclusterbits;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
lcn = m->lcn + 1;
|
|
|
|
if (m->compressedlcs)
|
|
|
|
goto out;
|
|
|
|
if (lcn == initial_lcn)
|
|
|
|
goto err_bonus_cblkcnt;
|
|
|
|
|
|
|
|
err = z_erofs_load_cluster_from_disk(m, lcn);
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
switch (m->type) {
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD:
|
|
|
|
if (m->delta[0] != 1)
|
|
|
|
goto err_bonus_cblkcnt;
|
|
|
|
if (m->compressedlcs)
|
|
|
|
break;
|
|
|
|
fallthrough;
|
|
|
|
default:
|
|
|
|
erofs_err(m->inode->i_sb,
|
|
|
|
"cannot found CBLKCNT @ lcn %lu of nid %llu",
|
|
|
|
lcn, vi->nid);
|
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
map->m_plen = m->compressedlcs << lclusterbits;
|
|
|
|
return 0;
|
|
|
|
err_bonus_cblkcnt:
|
|
|
|
erofs_err(m->inode->i_sb,
|
|
|
|
"bogus CBLKCNT @ lcn %lu of nid %llu",
|
|
|
|
lcn, vi->nid);
|
|
|
|
DBG_BUGON(1);
|
|
|
|
return -EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
|
2019-06-24 07:22:52 +00:00
|
|
|
int z_erofs_map_blocks_iter(struct inode *inode,
|
|
|
|
struct erofs_map_blocks *map,
|
|
|
|
int flags)
|
|
|
|
{
|
2019-09-04 02:08:56 +00:00
|
|
|
struct erofs_inode *const vi = EROFS_I(inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
struct z_erofs_maprecorder m = {
|
|
|
|
.inode = inode,
|
|
|
|
.map = map,
|
|
|
|
};
|
|
|
|
int err = 0;
|
|
|
|
unsigned int lclusterbits, endoff;
|
2021-04-07 04:39:24 +00:00
|
|
|
unsigned long initial_lcn;
|
2019-06-24 07:22:52 +00:00
|
|
|
unsigned long long ofs, end;
|
|
|
|
|
|
|
|
trace_z_erofs_map_blocks_iter_enter(inode, map, flags);
|
|
|
|
|
|
|
|
/* when trying to read beyond EOF, leave it unmapped */
|
2019-08-29 16:38:27 +00:00
|
|
|
if (map->m_la >= inode->i_size) {
|
2019-06-24 07:22:52 +00:00
|
|
|
map->m_llen = map->m_la + 1 - inode->i_size;
|
|
|
|
map->m_la = inode->i_size;
|
|
|
|
map->m_flags = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:37:33 +00:00
|
|
|
err = z_erofs_fill_inode_lazy(inode);
|
2019-06-24 07:22:52 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
lclusterbits = vi->z_logical_clusterbits;
|
|
|
|
ofs = map->m_la;
|
2021-04-07 04:39:24 +00:00
|
|
|
initial_lcn = ofs >> lclusterbits;
|
2019-06-24 07:22:52 +00:00
|
|
|
endoff = ofs & ((1 << lclusterbits) - 1);
|
|
|
|
|
2021-04-07 04:39:24 +00:00
|
|
|
err = z_erofs_load_cluster_from_disk(&m, initial_lcn);
|
2019-06-24 07:22:52 +00:00
|
|
|
if (err)
|
|
|
|
goto unmap_out;
|
|
|
|
|
|
|
|
map->m_flags = EROFS_MAP_ZIPPED; /* by default, compressed */
|
|
|
|
end = (m.lcn + 1ULL) << lclusterbits;
|
|
|
|
|
|
|
|
switch (m.type) {
|
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_PLAIN:
|
|
|
|
if (endoff >= m.clusterofs)
|
|
|
|
map->m_flags &= ~EROFS_MAP_ZIPPED;
|
2020-08-23 22:36:59 +00:00
|
|
|
fallthrough;
|
2019-06-24 07:22:52 +00:00
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_HEAD:
|
|
|
|
if (endoff >= m.clusterofs) {
|
|
|
|
map->m_la = (m.lcn << lclusterbits) | m.clusterofs;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* m.lcn should be >= 1 if endoff < m.clusterofs */
|
2019-08-29 16:38:27 +00:00
|
|
|
if (!m.lcn) {
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(inode->i_sb,
|
|
|
|
"invalid logical cluster 0 at nid %llu",
|
|
|
|
vi->nid);
|
2019-08-14 10:37:03 +00:00
|
|
|
err = -EFSCORRUPTED;
|
2019-06-24 07:22:52 +00:00
|
|
|
goto unmap_out;
|
|
|
|
}
|
|
|
|
end = (m.lcn << lclusterbits) | m.clusterofs;
|
2019-06-24 07:22:58 +00:00
|
|
|
map->m_flags |= EROFS_MAP_FULL_MAPPED;
|
2019-06-24 07:22:52 +00:00
|
|
|
m.delta[0] = 1;
|
2020-08-23 22:36:59 +00:00
|
|
|
fallthrough;
|
2019-06-24 07:22:52 +00:00
|
|
|
case Z_EROFS_VLE_CLUSTER_TYPE_NONHEAD:
|
2021-03-31 09:39:20 +00:00
|
|
|
/* get the corresponding first chunk */
|
2019-11-08 03:37:33 +00:00
|
|
|
err = z_erofs_extent_lookback(&m, m.delta[0]);
|
2019-08-29 16:38:27 +00:00
|
|
|
if (err)
|
2019-06-24 07:22:52 +00:00
|
|
|
goto unmap_out;
|
|
|
|
break;
|
|
|
|
default:
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_err(inode->i_sb,
|
|
|
|
"unknown type %u @ offset %llu of nid %llu",
|
|
|
|
m.type, ofs, vi->nid);
|
2019-08-14 10:37:04 +00:00
|
|
|
err = -EOPNOTSUPP;
|
2019-06-24 07:22:52 +00:00
|
|
|
goto unmap_out;
|
|
|
|
}
|
|
|
|
|
|
|
|
map->m_llen = end - map->m_la;
|
|
|
|
map->m_pa = blknr_to_addr(m.pblk);
|
|
|
|
map->m_flags |= EROFS_MAP_MAPPED;
|
|
|
|
|
2021-04-07 04:39:24 +00:00
|
|
|
err = z_erofs_get_extent_compressedlen(&m, initial_lcn);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2019-06-24 07:22:52 +00:00
|
|
|
unmap_out:
|
|
|
|
if (m.kaddr)
|
|
|
|
kunmap_atomic(m.kaddr);
|
|
|
|
|
|
|
|
out:
|
2019-09-04 02:09:09 +00:00
|
|
|
erofs_dbg("%s, m_la %llu m_pa %llu m_llen %llu m_plen %llu m_flags 0%o",
|
|
|
|
__func__, map->m_la, map->m_pa,
|
|
|
|
map->m_llen, map->m_plen, map->m_flags);
|
2019-06-24 07:22:52 +00:00
|
|
|
|
|
|
|
trace_z_erofs_map_blocks_iter_exit(inode, map, flags, err);
|
|
|
|
|
|
|
|
/* aggressively BUG_ON iff CONFIG_EROFS_FS_DEBUG is on */
|
|
|
|
DBG_BUGON(err < 0 && err != -ENOMEM);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|