Lines Matching refs:nr_entries
461 int *nr_entries) in xfs_iext_split_node() argument
473 *nr_entries = 0; in xfs_iext_split_node()
489 *nr_entries = nr_move; in xfs_iext_split_node()
491 *nr_entries = nr_keep; in xfs_iext_split_node()
507 int i, pos, nr_entries; in xfs_iext_insert_node() local
516 nr_entries = xfs_iext_node_nr_entries(node, pos); in xfs_iext_insert_node()
518 ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0); in xfs_iext_insert_node()
519 ASSERT(nr_entries <= KEYS_PER_NODE); in xfs_iext_insert_node()
521 if (nr_entries == KEYS_PER_NODE) in xfs_iext_insert_node()
522 new = xfs_iext_split_node(&node, &pos, &nr_entries); in xfs_iext_insert_node()
528 if (node != new && pos == 0 && nr_entries > 0) in xfs_iext_insert_node()
531 for (i = nr_entries; i > pos; i--) { in xfs_iext_insert_node()
549 int *nr_entries) in xfs_iext_split_leaf() argument
561 *nr_entries = 0; in xfs_iext_split_leaf()
573 *nr_entries = nr_move; in xfs_iext_split_leaf()
575 *nr_entries = nr_keep; in xfs_iext_split_leaf()
640 int nr_entries, i; in xfs_iext_insert_raw() local
649 nr_entries = xfs_iext_leaf_nr_entries(ifp, cur->leaf, cur->pos); in xfs_iext_insert_raw()
650 ASSERT(nr_entries <= RECS_PER_LEAF); in xfs_iext_insert_raw()
651 ASSERT(cur->pos >= nr_entries || in xfs_iext_insert_raw()
654 if (nr_entries == RECS_PER_LEAF) in xfs_iext_insert_raw()
655 new = xfs_iext_split_leaf(cur, &nr_entries); in xfs_iext_insert_raw()
661 if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) { in xfs_iext_insert_raw()
666 for (i = nr_entries; i > cur->pos; i--) in xfs_iext_insert_raw()
693 int nr_entries) in xfs_iext_rebalance_node() argument
700 if (nr_entries == 0) in xfs_iext_rebalance_node()
707 if (nr_prev + nr_entries <= KEYS_PER_NODE) { in xfs_iext_rebalance_node()
708 for (i = 0; i < nr_entries; i++) { in xfs_iext_rebalance_node()
720 if (nr_entries + nr_next <= KEYS_PER_NODE) { in xfs_iext_rebalance_node()
727 node->keys[nr_entries + i] = next->keys[i]; in xfs_iext_rebalance_node()
728 node->ptrs[nr_entries + i] = next->ptrs[i]; in xfs_iext_rebalance_node()
746 int level = 2, pos, nr_entries, i; in xfs_iext_remove_node() local
756 nr_entries = xfs_iext_node_nr_entries(node, pos) - 1; in xfs_iext_remove_node()
758 for (i = pos; i < nr_entries; i++) { in xfs_iext_remove_node()
762 node->keys[nr_entries] = XFS_IEXT_KEY_INVALID; in xfs_iext_remove_node()
763 node->ptrs[nr_entries] = NULL; in xfs_iext_remove_node()
765 if (pos == 0 && nr_entries > 0) { in xfs_iext_remove_node()
770 if (nr_entries >= KEYS_PER_NODE / 2) in xfs_iext_remove_node()
786 node = xfs_iext_rebalance_node(parent, &pos, node, nr_entries); in xfs_iext_remove_node()
792 } else if (nr_entries == 1) { in xfs_iext_remove_node()
810 int nr_entries) in xfs_iext_rebalance_leaf() argument
817 if (nr_entries == 0) in xfs_iext_rebalance_leaf()
823 if (nr_prev + nr_entries <= RECS_PER_LEAF) { in xfs_iext_rebalance_leaf()
824 for (i = 0; i < nr_entries; i++) in xfs_iext_rebalance_leaf()
838 if (nr_entries + nr_next <= RECS_PER_LEAF) { in xfs_iext_rebalance_leaf()
845 leaf->recs[nr_entries + i] = in xfs_iext_rebalance_leaf()
851 cur->pos += nr_entries; in xfs_iext_rebalance_leaf()
887 int i, nr_entries; in xfs_iext_remove() local
897 nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1; in xfs_iext_remove()
898 for (i = cur->pos; i < nr_entries; i++) in xfs_iext_remove()
900 xfs_iext_rec_clear(&leaf->recs[nr_entries]); in xfs_iext_remove()
903 if (cur->pos == 0 && nr_entries > 0) { in xfs_iext_remove()
907 } else if (cur->pos == nr_entries) { in xfs_iext_remove()
915 if (nr_entries >= RECS_PER_LEAF / 2) in xfs_iext_remove()
919 xfs_iext_rebalance_leaf(ifp, cur, leaf, offset, nr_entries); in xfs_iext_remove()
920 else if (nr_entries == 0) in xfs_iext_remove()