fs/jfs/jfs_dtree.c

1950

rp->header.stblindex = DTROOTMAXSLOT;

fs/jfs/jfs_dtree.c

1951

stbl = (s8 *) & rp->slot[DTROOTMAXSLOT];

fs/jfs/jfs_dtree.c

1962

fsi = n = DTROOTMAXSLOT + stblsize;

fs/jfs/jfs_dtree.c

2028

lv->length = DTROOTMAXSLOT;

fs/jfs/jfs_dtree.c

2053

for (fsi++; fsi < DTROOTMAXSLOT; f++, fsi++)

fs/jfs/jfs_dtree.c

2058

sp->header.freecnt = DTROOTMAXSLOT - (DTENTRYSTART + 1);

fs/jfs/jfs_dtree.c

2579

lv->length = DTROOTMAXSLOT;

fs/jfs/jfs_dtree.c

2593

for (fsi++; fsi < DTROOTMAXSLOT; f++, fsi++)

fs/jfs/jfs_dtree.c

4300

DECLARE_BITMAP(bitmap, DTROOTMAXSLOT) = {0};

fs/jfs/jfs_dtree.c

4307

p->header.freecnt > DTROOTMAXSLOT - 1)) {

fs/jfs/jfs_dtree.c

4323

p->header.freelist >= DTROOTMAXSLOT)) {

fs/jfs/jfs_dtree.c

4339

if (unlikely(fsi < 1 || fsi >= DTROOTMAXSLOT)) {

fs/jfs/jfs_dtree.c

976

n -= DTROOTMAXSLOT - sp->header.freecnt; /* header + entries */