Lines Matching refs:i
180 int height, i; in xfs_iext_find_last_leaf() local
186 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_last_leaf()
187 if (!node->ptrs[i]) in xfs_iext_find_last_leaf()
189 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
210 int i; in xfs_iext_last() local
218 for (i = 1; i < xfs_iext_max_recs(ifp); i++) { in xfs_iext_last()
219 if (xfs_iext_rec_is_empty(&cur->leaf->recs[i])) in xfs_iext_last()
222 cur->pos = i - 1; in xfs_iext_last()
310 int height, i; in xfs_iext_find_level() local
316 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_level()
317 if (xfs_iext_key_cmp(node, i, offset) > 0) in xfs_iext_find_level()
320 node = node->ptrs[i - 1]; in xfs_iext_find_level()
333 int i; in xfs_iext_node_pos() local
335 for (i = 1; i < KEYS_PER_NODE; i++) { in xfs_iext_node_pos()
336 if (xfs_iext_key_cmp(node, i, offset) > 0) in xfs_iext_node_pos()
340 return i - 1; in xfs_iext_node_pos()
348 int i; in xfs_iext_node_insert_pos() local
350 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_node_insert_pos()
351 if (xfs_iext_key_cmp(node, i, offset) > 0) in xfs_iext_node_insert_pos()
352 return i; in xfs_iext_node_insert_pos()
363 int i; in xfs_iext_node_nr_entries() local
365 for (i = start; i < KEYS_PER_NODE; i++) { in xfs_iext_node_nr_entries()
366 if (node->keys[i] == XFS_IEXT_KEY_INVALID) in xfs_iext_node_nr_entries()
370 return i; in xfs_iext_node_nr_entries()
379 int i; in xfs_iext_leaf_nr_entries() local
381 for (i = start; i < xfs_iext_max_recs(ifp); i++) { in xfs_iext_leaf_nr_entries()
382 if (xfs_iext_rec_is_empty(&leaf->recs[i])) in xfs_iext_leaf_nr_entries()
386 return i; in xfs_iext_leaf_nr_entries()
402 int i; in xfs_iext_grow() local
418 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_grow()
419 node->keys[i] = XFS_IEXT_KEY_INVALID; in xfs_iext_grow()
434 int height, i; in xfs_iext_update_node() local
437 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_update_node()
438 if (i > 0 && xfs_iext_key_cmp(node, i, old_offset) > 0) in xfs_iext_update_node()
440 if (node->keys[i] == old_offset) in xfs_iext_update_node()
441 node->keys[i] = new_offset; in xfs_iext_update_node()
443 node = node->ptrs[i - 1]; in xfs_iext_update_node()
460 int i = 0; in xfs_iext_split_node() local
471 for (i = 0; i < nr_move; i++) { in xfs_iext_split_node()
472 new->keys[i] = node->keys[nr_keep + i]; in xfs_iext_split_node()
473 new->ptrs[i] = node->ptrs[nr_keep + i]; in xfs_iext_split_node()
475 node->keys[nr_keep + i] = XFS_IEXT_KEY_INVALID; in xfs_iext_split_node()
476 node->ptrs[nr_keep + i] = NULL; in xfs_iext_split_node()
487 for (; i < KEYS_PER_NODE; i++) in xfs_iext_split_node()
488 new->keys[i] = XFS_IEXT_KEY_INVALID; in xfs_iext_split_node()
500 int i, pos, nr_entries; in xfs_iext_insert_node() local
524 for (i = nr_entries; i > pos; i--) { in xfs_iext_insert_node()
525 node->keys[i] = node->keys[i - 1]; in xfs_iext_insert_node()
526 node->ptrs[i] = node->ptrs[i - 1]; in xfs_iext_insert_node()
548 int i; in xfs_iext_split_leaf() local
558 for (i = 0; i < nr_move; i++) { in xfs_iext_split_leaf()
559 new->recs[i] = leaf->recs[nr_keep + i]; in xfs_iext_split_leaf()
560 xfs_iext_rec_clear(&leaf->recs[nr_keep + i]); in xfs_iext_split_leaf()
634 int nr_entries, i; in xfs_iext_insert() local
660 for (i = nr_entries; i > cur->pos; i--) in xfs_iext_insert()
661 cur->leaf->recs[i] = cur->leaf->recs[i - 1]; in xfs_iext_insert()
688 int nr_prev = xfs_iext_node_nr_entries(prev, 0), i; in xfs_iext_rebalance_node() local
691 for (i = 0; i < nr_entries; i++) { in xfs_iext_rebalance_node()
692 prev->keys[nr_prev + i] = node->keys[i]; in xfs_iext_rebalance_node()
693 prev->ptrs[nr_prev + i] = node->ptrs[i]; in xfs_iext_rebalance_node()
701 int nr_next = xfs_iext_node_nr_entries(next, 0), i; in xfs_iext_rebalance_node() local
709 for (i = 0; i < nr_next; i++) { in xfs_iext_rebalance_node()
710 node->keys[nr_entries + i] = next->keys[i]; in xfs_iext_rebalance_node()
711 node->ptrs[nr_entries + i] = next->ptrs[i]; in xfs_iext_rebalance_node()
729 int level = 2, pos, nr_entries, i; in xfs_iext_remove_node() local
741 for (i = pos; i < nr_entries; i++) { in xfs_iext_remove_node()
742 node->keys[i] = node->keys[i + 1]; in xfs_iext_remove_node()
743 node->ptrs[i] = node->ptrs[i + 1]; in xfs_iext_remove_node()
804 int nr_prev = xfs_iext_leaf_nr_entries(ifp, leaf->prev, 0), i; in xfs_iext_rebalance_leaf() local
807 for (i = 0; i < nr_entries; i++) in xfs_iext_rebalance_leaf()
808 leaf->prev->recs[nr_prev + i] = leaf->recs[i]; in xfs_iext_rebalance_leaf()
819 int nr_next = xfs_iext_leaf_nr_entries(ifp, leaf->next, 0), i; in xfs_iext_rebalance_leaf() local
827 for (i = 0; i < nr_next; i++) { in xfs_iext_rebalance_leaf()
828 leaf->recs[nr_entries + i] = in xfs_iext_rebalance_leaf()
829 leaf->next->recs[i]; in xfs_iext_rebalance_leaf()
870 int i, nr_entries; in xfs_iext_remove() local
881 for (i = cur->pos; i < nr_entries; i++) in xfs_iext_remove()
882 leaf->recs[i] = leaf->recs[i + 1]; in xfs_iext_remove()
1028 int i; in xfs_iext_destroy_node() local
1031 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_destroy_node()
1032 if (node->keys[i] == XFS_IEXT_KEY_INVALID) in xfs_iext_destroy_node()
1034 xfs_iext_destroy_node(node->ptrs[i], level - 1); in xfs_iext_destroy_node()