Home
last modified time | relevance | path

Searched refs:stree (Results 1 – 4 of 4) sorted by relevance

/linux/fs/jfs/
A Djfs_dmap.c1442 if (l2nb > dcp->stree[ti]) in dbAllocAG()
2056 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2111 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2173 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2528 oldval = dcp->stree[ti]; in dbAdjCtl()
2529 oldroot = dcp->stree[ROOT]; in dbAdjCtl()
2556 oldval = dcp->stree[ti]; in dbAdjCtl()
2599 if (dcp->stree[ti] == NOFREE) in dbAdjCtl()
3265 oldroot = tp->stree[ROOT]; in dbAllocDmapBU()
3344 if (tp->stree[ROOT] == oldroot) in dbAllocDmapBU()
[all …]
A Djfs_dmap.h140 s8 stree[TREESIZE]; /* TREESIZE: tree */ member
168 s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */ member
186 #define dmt_stree t2.stree
/linux/lib/zlib_deflate/
A Ddeftree.c360 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()
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()
/linux/fs/reiserfs/
A DMakefile9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \

Completed in 13 milliseconds