Home
last modified time | relevance | path

Searched refs:stree (Results 1 - 8 of 8) sorted by relevance

/kernel/linux/linux-5.10/fs/jfs/
H A Djfs_dmap.c1165 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1293 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1480 if (l2nb > dcp->stree[ti]) in dbAllocAG()
1489 if (l2nb <= dcp->stree[m + n]) { in dbAllocAG()
1496 "failed descending stree\n"); in dbAllocAG()
1920 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
2050 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2097 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2103 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2110 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROO in dbAllocDmap()
[all...]
H A Djfs_dmap.h140 s8 stree[TREESIZE]; /* TREESIZE: tree */ member
168 s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */ member
186 #define dmt_stree t2.stree
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_dmap.c1097 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1225 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1412 if (l2nb > dcp->stree[ti]) in dbAllocAG()
1421 if (l2nb <= dcp->stree[m + n]) { in dbAllocAG()
1428 "failed descending stree\n"); in dbAllocAG()
1852 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
1982 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2029 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2035 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2042 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROO in dbAllocDmap()
[all...]
H A Djfs_dmap.h140 s8 stree[TREESIZE]; /* TREESIZE: tree */ member
168 s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */ member
186 #define dmt_stree t2.stree
/kernel/linux/linux-5.10/lib/zlib_deflate/
H A Ddeftree.c350 * The length opt_len is updated; static_len is also updated if stree is
360 const ct_data *stree = desc->stat_desc->static_tree; in gen_bitlen() local
392 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()
482 * also updated if stree is not null. The field max_code is set.
490 const ct_data *stree = desc->stat_desc->static_tree; in build_tree() local
520 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
/kernel/linux/linux-6.6/lib/zlib_deflate/
H A Ddeftree.c350 * The length opt_len is updated; static_len is also updated if stree is
360 const ct_data *stree = desc->stat_desc->static_tree; in gen_bitlen() local
392 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()
482 * also updated if stree is not null. The field max_code is set.
490 const ct_data *stree = desc->stat_desc->static_tree; in build_tree() local
520 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
/kernel/linux/linux-5.10/fs/reiserfs/
H A DMakefile9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \
/kernel/linux/linux-6.6/fs/reiserfs/
H A DMakefile9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \

Completed in 15 milliseconds