Home
last modified time | relevance | path

Searched refs:leafidx (Results 1 – 2 of 2) sorted by relevance

/linux/fs/jfs/
H A Djfs_dmap.c90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
1079 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNext()
1086 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1209 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNear()
1214 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1375 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) { in dbAllocAG()
1440 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin; in dbAllocAG()
1683 int rc, leafidx, lev; in dbFindCtl() local
1705 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) { in dbFindCtl()
1717 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, tru in dbFindCtl()
1960 int leafidx, rc; dbAllocDmapLev() local
2947 dbFindLeaf(dmtree_t * tp,int l2nb,int * leafidx,bool is_ctl) dbFindLeaf() argument
[all...]
H A Djfs_dmap.h137 __le32 leafidx; /* 4: index of first tree leaf */ member
165 __le32 leafidx; /* 4: index of the first tree leaf */ member
183 #define dmt_leafidx t1.leafidx