fs/xfs/libxfs/xfs_iext_tree.c

123

struct xfs_iext_rec recs[RECS_PER_LEAF];

fs/xfs/libxfs/xfs_iext_tree.c

137

return RECS_PER_LEAF;

fs/xfs/libxfs/xfs_iext_tree.c

231

ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);

fs/xfs/libxfs/xfs_iext_tree.c

253

ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);

fs/xfs/libxfs/xfs_iext_tree.c

259

ASSERT(cur->pos <= RECS_PER_LEAF);

fs/xfs/libxfs/xfs_iext_tree.c

270

cur->pos = RECS_PER_LEAF;

fs/xfs/libxfs/xfs_iext_tree.c

553

const int nr_move = RECS_PER_LEAF / 2;

fs/xfs/libxfs/xfs_iext_tree.c

554

int nr_keep = nr_move + (RECS_PER_LEAF & 1);

fs/xfs/libxfs/xfs_iext_tree.c

558

if (cur->pos == RECS_PER_LEAF) {

fs/xfs/libxfs/xfs_iext_tree.c

610

if (new_size / sizeof(struct xfs_iext_rec) == RECS_PER_LEAF)

fs/xfs/libxfs/xfs_iext_tree.c

650

ASSERT(nr_entries <= RECS_PER_LEAF);

fs/xfs/libxfs/xfs_iext_tree.c

654

if (nr_entries == RECS_PER_LEAF)

fs/xfs/libxfs/xfs_iext_tree.c

823

if (nr_prev + nr_entries <= RECS_PER_LEAF) {

fs/xfs/libxfs/xfs_iext_tree.c

838

if (nr_entries + nr_next <= RECS_PER_LEAF) {

fs/xfs/libxfs/xfs_iext_tree.c

915

if (nr_entries >= RECS_PER_LEAF / 2)