xfs/libxfs/xfs_iext_tree.c

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