Home
last modified time | relevance | path

Searched refs:BUDMIN (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/fs/jfs/
H A Djfs_dmap.h17 #define BUDMIN L2DBWORD /* max free string in a map word */ macro
265 #define NLSTOL2BSZ(n) (31 - cntlz((n)) + BUDMIN)
H A Djfs_dmap.c1229 if (leaf[word] < BUDMIN) in dbAllocNext()
1240 nw = BUDSIZE(l2size, BUDMIN); in dbAllocNext()
1320 if (leaf[word] < BUDMIN) in dbAllocNear()
2050 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2259 dbSplit(tp, word, BUDMIN, in dbAllocBits()
2280 if (leaf[word] < BUDMIN) { in dbAllocBits()
2303 nw = BUDSIZE(size, BUDMIN); in dbAllocBits()
2435 (word, L2LPERDMAP, BUDMIN), in dbFreeBits()
2446 nw = BUDSIZE(size, BUDMIN); in dbFreeBits()
3117 * free buddy size is BUDMIN in dbMaxBud()
[all...]
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_dmap.h17 #define BUDMIN L2DBWORD /* max free string in a map word */ macro
265 #define NLSTOL2BSZ(n) (31 - cntlz((n)) + BUDMIN)
H A Djfs_dmap.c1161 if (leaf[word] < BUDMIN) in dbAllocNext()
1172 nw = BUDSIZE(l2size, BUDMIN); in dbAllocNext()
1252 if (leaf[word] < BUDMIN) in dbAllocNear()
1982 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2191 dbSplit(tp, word, BUDMIN, in dbAllocBits()
2212 if (leaf[word] < BUDMIN) { in dbAllocBits()
2235 nw = BUDSIZE(size, BUDMIN); in dbAllocBits()
2367 (word, L2LPERDMAP, BUDMIN), in dbFreeBits()
2378 nw = BUDSIZE(size, BUDMIN); in dbFreeBits()
3053 * free buddy size is BUDMIN in dbMaxBud()
[all...]

Completed in 10 milliseconds