Home
last modified time | relevance | path

Searched refs:nextindex (Results 1 – 6 of 6) sorted by relevance

/fs/jfs/
Djfs_xtree.c58 if ((le16_to_cpu((P)->header.nextindex) < XTENTRYSTART) || \
59 (le16_to_cpu((P)->header.nextindex) > \
280 le16_to_cpu(p->header.nextindex)) { in xtSearch()
296 le16_to_cpu(p->header.nextindex)) { in xtSearch()
337 if (p->header.nextindex == /* little-endian */ in xtSearch()
363 lim = le16_to_cpu(p->header.nextindex) - XTENTRYSTART; in xtSearch()
384 if (p->header.nextindex == in xtSearch()
412 if (index < le16_to_cpu(p->header.nextindex)-1) in xtSearch()
429 if (base < le16_to_cpu(p->header.nextindex)) in xtSearch()
442 if (p->header.nextindex == in xtSearch()
[all …]
Djfs_dtree.c118 if (((P)->header.nextindex > \
633 for (base = 0, lim = p->header.nextindex; lim; lim >>= 1) { in dtSearch()
901 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - n + 1; in dtInsert()
1180 lp->header.nextindex-1, in dtSplitUp()
1274 ((sp->header.nextindex - in dtSplitUp()
1337 int skip, nextindex, half, left, nxt, off, si; in dtSplitPage() local
1414 rp->header.nextindex = 0; in dtSplitPage()
1439 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1508 nextindex = sp->header.nextindex; in dtSplitPage()
1509 for (nxt = off = 0; nxt < nextindex; ++off) { in dtSplitPage()
[all …]
Djfs_dtree.h137 u8 nextindex; /* 1: next free entry in stbl */ member
154 #define dtEmpty(IP) (JFS_IP(IP)->i_dtroot.header.nextindex == 0)
186 u8 nextindex; /* 1: next entry index in stbl */ member
Djfs_xtree.h78 __le16 nextindex; /* 2: next index = number of entries */ member
Djfs_txnmgr.c788 le16_to_cpu(p->header.nextindex); in txLock()
1719 next = le16_to_cpu(p->header.nextindex); in xtLog()
Djfs_imap.c697 n < le16_to_cpu(xp->header.nextindex); n++, xad++) in diWrite()
733 n < le16_to_cpu(xp->header.nextindex); n++, xad++) in diWrite()