Searched refs:bp_index (Results 1 - 2 of 2) sorted by relevance
| /linux-4.4.14/fs/nilfs2/ |
| H A D | btree.c | 48 path[level].bp_index = 0; nilfs_btree_alloc_path()
554 path[level].bp_index = index; nilfs_btree_do_lookup()
586 path[level].bp_index = index; nilfs_btree_do_lookup()
613 path[level].bp_index = index; nilfs_btree_do_lookup_last()
625 path[level].bp_index = index; nilfs_btree_do_lookup_last()
654 /* Next index is already set to bp_index for leaf nodes. */ nilfs_btree_get_next_key()
662 index = path[level].bp_index + next_adj; nilfs_btree_get_next_key()
668 /* For non-leaf nodes, next index is stored at bp_index + 1. */ nilfs_btree_get_next_key()
724 index = path[level].bp_index + 1; nilfs_btree_lookup_contig()
747 p.index = path[level + 1].bp_index + 1; nilfs_btree_lookup_contig()
753 path[level + 1].bp_index = p.index; nilfs_btree_lookup_contig()
765 path[level].bp_index = index; nilfs_btree_lookup_contig()
783 path[level].bp_index, key); nilfs_btree_promote_key()
786 } while ((path[level].bp_index == 0) && nilfs_btree_promote_key()
793 path[level].bp_index, key); nilfs_btree_promote_key()
807 nilfs_btree_node_insert(node, path[level].bp_index, nilfs_btree_do_insert()
812 if (path[level].bp_index == 0) nilfs_btree_do_insert()
818 nilfs_btree_node_insert(node, path[level].bp_index, nilfs_btree_do_insert()
839 if (n > path[level].bp_index) { nilfs_btree_carry_left()
859 path[level].bp_index += lnchildren; nilfs_btree_carry_left()
860 path[level + 1].bp_index--; nilfs_btree_carry_left()
864 path[level].bp_index -= n; nilfs_btree_carry_left()
885 if (n > nchildren - path[level].bp_index) { nilfs_btree_carry_right()
898 path[level + 1].bp_index++; nilfs_btree_carry_right()
901 path[level + 1].bp_index--; nilfs_btree_carry_right()
907 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); nilfs_btree_carry_right()
908 path[level + 1].bp_index++; nilfs_btree_carry_right()
931 if (n > nchildren - path[level].bp_index) { nilfs_btree_split()
944 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); nilfs_btree_split()
945 nilfs_btree_node_insert(right, path[level].bp_index, nilfs_btree_split()
964 path[level + 1].bp_index++; nilfs_btree_split()
1007 if (path[level].bp_index > 0) { nilfs_btree_find_near()
1010 path[level].bp_index - 1, nilfs_btree_find_near()
1018 return nilfs_btree_node_get_ptr(node, path[level].bp_index, nilfs_btree_find_near()
1083 pindex = path[level + 1].bp_index; nilfs_btree_prepare_insert()
1257 nilfs_btree_node_delete(node, path[level].bp_index, nilfs_btree_do_delete()
1261 if (path[level].bp_index == 0) nilfs_btree_do_delete()
1266 nilfs_btree_node_delete(node, path[level].bp_index, nilfs_btree_do_delete()
1301 path[level].bp_index += n; nilfs_btree_borrow_left()
1328 path[level + 1].bp_index++; nilfs_btree_borrow_right()
1331 path[level + 1].bp_index--; nilfs_btree_borrow_right()
1360 path[level].bp_index += nilfs_btree_node_get_nchildren(left); nilfs_btree_concat_left()
1385 path[level + 1].bp_index++; nilfs_btree_concat_right()
1434 for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index; nilfs_btree_prepare_delete()
1452 pindex = path[level + 1].bp_index; nilfs_btree_prepare_delete()
1903 nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, nilfs_btree_prepare_update_v()
1949 nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, nilfs_btree_commit_update_v()
2035 path[level + 1].bp_index, nilfs_btree_propagate_v()
2183 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, nilfs_btree_assign_p()
2200 nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, nilfs_btree_assign_p()
2203 key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); nilfs_btree_assign_p()
2226 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, nilfs_btree_assign_v()
2234 key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); nilfs_btree_assign_v()
|
| H A D | btree.h | 37 * @bp_index: index of child node
45 int bp_index; member in struct:nilfs_btree_path
|
Completed in 53 milliseconds